Comparison of the Performance of Skip Lists and Splay Trees in Classification of Internet Packets

PeerJ Computer Science - United States
doi 10.7717/peerj-cs.204
Full Text
Abstract

Available in full text

Date
Authors
Publisher

PeerJ

Related search

Efficient Computation of Binomial Coefficients Using Splay Trees

International Journal on Data Science and Technology
2016English

A Study on Splay Trees

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2019English

On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting Log N-Block Sequences

SIAM Journal on Computing
MathematicsComputer Science
2000English

Statistical Analysis of Malformed Packets and Their Origins in the Modern Internet

2002English

Oracle Coached Decision Trees and Lists

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Classification and Trees

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Figure 7: Classification Performance Comparison.

English

A Query Index for Stream Data Using Interval Skip Lists Exploiting Locality

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2007English

Comparison of Skip List Algorithms to Alternative Data Structures

International Journal of Computing, Communication and Instrumentation Engineering
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy