Self-adjusting binary search trees
Journal of the ACM (JACM)
Introduction to algorithms
Handbook of theoretical computer science (vol. A)
Deletion in two-dimensional quad trees
Communications of the ACM
Multidimensional binary search trees used for associative searching
Communications of the ACM
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Journal of the ACM (JACM)
Confluently persistent deques via data structuaral bootstrapping
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Competitive tree-structured dictionaries
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A simple and scalable algorithm for the IP address lookup problem
Fundamenta Informaticae - Special issue on computing patterns in strings
On using conditional rotations and randomized heuristics for self-organizing ternary search tries
Proceedings of the 43rd annual Southeast regional conference - Volume 1
Data & Knowledge Engineering
Rank-Sensitive Priority Queues
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Starsscheck: a tool to find errors in task-based parallel programs
EuroPar'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part I
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
A Simple and Scalable Algorithm for the IP Address Lookup Problem
Fundamenta Informaticae - Computing Patterns in Strings
| Hi-index | 0.00 |