Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
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
Dynamic Perfect Hashing: Upper and Lower Bounds
SIAM Journal on Computing
A reliable randomized algorithm for the closest-pair problem
Journal of Algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
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
Communications of the ACM
Journal of 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
Universal Hashing and k-Wise Independent Random Variables via Integer Arithmetic without Primes
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
Sorting and Searching on the Word RAM
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Priority Queues: Small, Monotone and Trans-dichotomous
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Polynomial Hash Functions Are Reliable (Extended Abstract)
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
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
Making deterministic signatures quickly
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Filter Image Browsing: Interactive Image Retrieval by Using Database Overviews
Multimedia Tools and Applications
Making deterministic signatures quickly
ACM Transactions on Algorithms (TALG)
Time-Space trade-offs for longest common extensions
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Time-space trade-offs for longest common extensions
Journal of Discrete Algorithms
| Hi-index | 0.00 |
We present a new analysis of the well-known family of multiplicative hash functions, and improved deterministic algorithms for selecting “good” hash functions. The main motivation is realization of deterministic dictionaries with fast lookups and reasonably fast updates. The model of computation is the Word RAM, and it is assumed that the machine word-size matches the size of keys in bits. Many of the modern solutions to the dictionary problem are weakly nonuniform, that is, they require a number of constants to be computed at “compile time” for the stated time bounds to hold. The currently fastest deterministic dictionary uses constants not known to be computable in polynomial time. In contrast, our dictionaries do not require any special constants or instructions, and running times are independent of word (and key) length. Our family of dynamic dictionaries achieves a performance of the following type: lookups in time O(t) and updates in amortized time O(n1/t), for an appropriate parameter function t. Update procedures require division, whereas searching uses multiplication only.