Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleSeptember 2015
Statistical dynamic splay tree filters towards multilevel firewall packet filtering enhancement
Computers and Security (CSEC), Volume 53, Issue CPages 109–131https://doi.org/10.1016/j.cose.2015.05.010Network Firewalls are considered to be one of the most important security components in today's IP network architectures. Performance of firewalls has significant impact on the overall network performance. Firewalls should be able to sustain a very high ...
- articleDecember 2014
The CB tree: a practical concurrent self-adjusting search tree
Distributed Computing (DICO), Volume 27, Issue 6Pages 393–417https://doi.org/10.1007/s00446-014-0229-0We present the CB tree, a counting-based self-adjusting binary search tree in which, as in splay trees, more-frequently accessed items move closer to the root. In a sequential execution, after $$m$$m operations of which $$c(v)$$c(v) access item $$v$$v, ...
- ArticleOctober 2012
A Data Structure for Content Cache Management in Content-Centric Networking
ICNDC '12: Proceedings of the 2012 Third International Conference on Networking and Distributed ComputingPages 11–15https://doi.org/10.1109/ICNDC.2012.11Content-Centric Networking (CCN) is a new network architecture that rethinks the model of network communication. In this architecture all the network sources will be looked as content and routed by name. In this paper, we describe a scheme about the ...
- articleSeptember 2010
Revisiting priority queues for image analysis
Pattern Recognition (PATT), Volume 43, Issue 9Pages 3003–3012https://doi.org/10.1016/j.patcog.2010.04.002Many algorithms in image analysis require a priority queue, a data structure that holds pointers to pixels in the image, and which allows efficiently finding the pixel in the queue with the highest priority. However, very few articles describing such ...
- articleMay 2008
Effective splaying with restricted rotations
International Journal of Computer Mathematics (IJOCM), Volume 85, Issue 5Pages 717–726https://doi.org/10.1080/00207160701435219The splay tree is a well-known binary search tree with many remarkable properties. It is a self-adjusting data structure whose amortized performance matches any of the many forms of balanced search trees. Furthermore, splay trees are adaptive, and have ...
- articleMay 2005
Key-Independent Optimality
A new form of optimality for comparison-based static dictionaries is introduced. This type of optimality, key-independent optimality, is motivated by applications that assign key values randomly. It is shown that any data structure that is key-...