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
Optimal bounds for the predecessor problem
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Fast deterministic construction of static dictionaries
Proceedings of the tenth 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
Journal of the ACM (JACM)
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
Faster deterministic dictionaries
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Design of Dynamic Data Structures
Design of Dynamic Data Structures
A New Universal Class of Hash Functions and Dynamic Hashing in Real Time
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Sorting and Searching on the Word RAM
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Dynamization of Decomposable Searching Problems Yielding Good Worsts-Case Bounds
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Polynomial Hash Functions Are Reliable (Extended Abstract)
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Faster deterministic sorting and searching in linear space
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Uniform deterministic dictionaries
ACM Transactions on Algorithms (TALG)
Data Structures with Local Update Operations
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Mihai Pǎtraşcu: obituary and open problems
ACM SIGACT News
| Hi-index | 0.00 |
We consider dynamic dictionaries over the universe U = {0, 1}w on a unit-cost RAM with word size w and a standard instruction set, and present a linear space deterministic dictionary accommodating membership queries in time (log log n)O(1) and updates in time (log n)O(1), where n is the size of the set stored. Previous solutions either had query time (log n)Ω(1) or update time 2ω(√log n) in the worst case.