Data structures and network algorithms
Data structures and network algorithms
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
Lower bounds for union-split-find related problems on random access machines
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Improved parallel integer sorting without concurrent writing
Information and Computation
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
SODA '97 Proceedings of the eighth 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
Priority Queues: Small, Monotone and Trans-dichotomous
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
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
Tight(er) worst-case bounds on dynamic searching and priority queues
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On the sorting-complexity of suffix tree construction
Journal of the ACM (JACM)
Improved fast integer sorting in linear space
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
Deterministic sorting in O(nlog log n) time and linear space
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Optimal time-space trade-offs for non-comparison-based sorting
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A locality-preserving cache-oblivious dynamic dictionary
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Improved fast interger sorting in linear space
Information and Computation
Optimal bounds for the predecessor problem and related problems
Journal of Computer and System Sciences - STOC 1999
On AC0 implementations of fusion trees and atomic heaps
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Exponential Structures for Efficient Cache-Oblivious Algorithms
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Improved Shortest Paths on the Word RAM
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Fast Integer Sorting in Linear Space
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Exact and Approximate Distances in Graphs - A Survey
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Deterministic sorting in O(nlog logn) time and linear space
Journal of Algorithms
Computational Geometry: Theory and Applications - Special issue on the 10th fall workshop on computational geometry
A locality-preserving cache-oblivious dynamic dictionary
Journal of Algorithms
Dynamic ordered sets with exponential search trees
Journal of the ACM (JACM)
Equivalence between priority queues and sorting
Journal of the ACM (JACM)
Dynamic 3-Sided Planar Range Queries with Expected Doubly Logarithmic Time
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Delaunay triangulations in O(sort(n)) time and more
Journal of the ACM (JACM)
| Hi-index | 0.01 |