Journal of Algorithms - Analysis of algorithms
A New Method for Balancing Binary Search Trees
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
A simple and scalable algorithm for the IP address lookup problem
Fundamenta Informaticae - Special issue on computing patterns in strings
A direct algorithm for restricted rotation distance
Information Processing Letters
Theoretical Computer Science
On using conditional rotations and randomized heuristics for self-organizing ternary search tries
Proceedings of the 43rd annual Southeast regional conference - Volume 1
Effective splaying with restricted rotations
International Journal of Computer Mathematics
On embedding subclasses of height-balanced trees in hypercubes
Information Sciences: an International Journal
Efficient license validation in MPML DRM architecture
Proceedings of the nineth ACM workshop on Digital rights management
An improved kernel size for rotation distance in binary trees
Information Processing Letters
A dynamic data structure for approximate range searching
Proceedings of the twenty-sixth annual symposium on Computational geometry
An efficient access control method for multimedia social networks
Proceedings of second ACM SIGMM workshop on Social media
Parallel discrete event simulation with Erlang
Proceedings of the 1st ACM SIGPLAN workshop on Functional high-performance computing
A Simple and Scalable Algorithm for the IP Address Lookup Problem
Fundamenta Informaticae - Computing Patterns in Strings
Hi-index | 0.00 |