Static Dictionaries on RAMs: Query Time is Necessary and Sufficient

Approximate nearest neighbors: towards removing the curse of dimensionality

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing

Optimal bounds for the predecessor problem

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing

Randomized sorting in O(n log log n) time and linear space using addition, shift, and bit-wise boolean operations

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms

Fast deterministic construction of static dictionaries

Proceedings of the tenth 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

Error correcting codes, perfect hashing circuits, and deterministic dynamic dictionaries

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms

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

Communication complexity of document exchange

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms

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

An Efficient Quasidictionary

SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory

Hash and Displace: Efficient Evaluation of Minimal Perfect Hash Functions

WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures

Integer priority queues with decrease key in constant time and the single source shortest paths problem

Journal of Computer and System Sciences - Special issue: STOC 2003

Dynamic ordered sets with exponential search trees

Journal of the ACM (JACM)

Making deterministic signatures quickly

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms

Uniform deterministic dictionaries

ACM Transactions on Algorithms (TALG)

Making deterministic signatures quickly

ACM Transactions on Algorithms (TALG)

Subquadratic algorithms for 3SUM

WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures

Cache-Oblivious dictionaries and multimaps with negligible failure probability

MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms