Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
The cell probe complexity of dynamic data structures
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Improved parallel integer sorting without concurrent writing
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete 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
Dynamic Perfect Hashing: Upper and Lower Bounds
SIAM Journal on Computing
On sorting strings in external memory (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Journal of Computer and System Sciences
The string B-tree: a new data structure for string search in external memory and its applications
Journal of the ACM (JACM)
Journal of 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
Optimal Algorithms for List Indexing and Subset Rank
WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
Trans-Dichotomous Algorithms Without Multiplication - Some Upper and Lower Bounds
WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
Simpler and Faster Dictionaries on the AC0 RAM
ICALP '98 Proceedings of the 25th 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
Priority Queues: Small, Monotone and Trans-dichotomous
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
On the limits of cache-obliviousness
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Sublogarithmic searching without multiplications
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
FOCS '99 Proceedings of the 40th 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
Deterministic sorting in O(nlog logn) time and linear space
Journal of Algorithms
Cache-oblivious string dictionaries
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Time-space trade-offs for predecessor search
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Cache-oblivious string B-trees
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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)
Constructing Efficient Dictionaries in Close to Sorting Time
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Simple linear work suffix array construction
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
External string sorting: faster and cache-oblivious
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
| Hi-index | 0.00 |
We present a new technique of universe reduction. Primary applications are the dictionary problem and the predecessor problem. We give several new results on static dictionaries in different computational models: the word RAM, the practical RAM, and the cache-oblivious model. All algorithms and data structures are deterministic and use linear space. Representative results are: a dictionary with a lookup time of O(log log n) and construction time of O(n) on sorted input on a word RAM, and a static predecessor structure for variable- and unbounded length binary strings that in the cache-oblivious model has a query performance of O(|s|/B + log |s|) I/Os, for query argument s.