A balanced search tree with O(1) worst case update time
Acta Informatica
Bounded ordered dictionaries in O(loglogN) time and O(n) space
Information Processing Letters
Surpassing the information theoretic bound with fusion trees
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
A constant update time finger search tree
Information Processing Letters
Optimal bounds for the predecessor problem
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Finger search trees with constant insertion time
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Faster deterministic sorting and priority queues in linear space
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Trans-Dichotomous Algorithms Without Multiplication - Some Upper and Lower Bounds
WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
Sublogarithmic searching without multiplications
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Static Dictionaries on RAMs: Query Time is Necessary and Sufficient
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Faster deterministic sorting and searching in linear space
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Worst case constant time priority queue
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Optimal static range reporting in one dimension
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Dynamic and hierarchical spatial access method using integer searching
Proceedings of the tenth international conference on Information and knowledge management
Optimal finger search trees in the pointer machine
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A locality-preserving cache-oblivious dynamic dictionary
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Optimal bounds for the predecessor problem and related problems
Journal of Computer and System Sciences - STOC 1999
A trade-off for worst-case efficient dictionaries
Nordic Journal of Computing
On AC0 implementations of fusion trees and atomic heaps
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A New Trade-Off for Deterministic Dictionaries
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Exponential Structures for Efficient Cache-Oblivious Algorithms
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Cache-oblivious data structures for orthogonal range searching
Proceedings of the nineteenth annual symposium on Computational geometry
Space efficient dynamic stabbing with fast queries
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Optimal finger search trees in the pointer machine
Journal of Computer and System Sciences - STOC 2002
New dynamic balanced search trees with worst-case constant update time
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the 13th Australasian workshop on combinatorial algorithms
A locality-preserving cache-oblivious dynamic dictionary
Journal of Algorithms
Concurrent cache-oblivious b-trees
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Worst case constant time priority queue
Journal of Systems and Software
Dynamic ordered sets with exponential search trees
Journal of the ACM (JACM)
Rotation and lighting invariant template matching
Information and Computation
Compressed data structures: Dictionaries and data-aware measures
Theoretical Computer Science
Uniform deterministic dictionaries
ACM Transactions on Algorithms (TALG)
Balanced distributed web service lookup system
Journal of Network and Computer Applications
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Steinitz theorems for orthogonal polyhedra
Proceedings of the twenty-sixth annual symposium on Computational geometry
Compressed dictionaries: space measures, data sets, and experiments
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
One-Dimensional finger searching in RAM model revisited
PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
Predecessor queries in constant time?
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Dynamic interpolation search revisited
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.00 |