Making deterministic signatures quickly

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 for strings - 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 log log n) on a word RAM, and a static predecessor structure for variable-length binary strings with a query performance of O(|s|/B + log |s| + log log n) I/Os, for query argument s, in the cache-oblivious model.

[1]  Torben Hagerup.  Simpler and Faster Dictionaries on the AC0 RAM , 1998, ICALP.

[2]  B. E. Eckbo,et al.  Appendix , 1826, Epilepsy Research.

[3]  Peter Sanders,et al.  Simple Linear Work Suffix Array Construction , 2003, ICALP.

[4]  Yijie Han.  Deterministic sorting in O(nlog log n) time and linear space , 2002, STOC '02.

[5]  R. Graham,et al.  Spearman's Footrule as a Measure of Disarray , 1977 .

[6]  Paul F. Dietz.  Optimal Algorithms for List Indexing and Subset Rank , 1989, WADS.

[7]  HanYijie.  Deterministic sorting in O(nlog logn) time and linear space , 2004 .

[8]  János Komlós,et al.  Storing a sparse table with O(1) worst case access time , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[9]  J. Vitter,et al.  On Sorting Strings in External Memory , 1997 .

[10]  Charles E. Leiserson,et al.  Cache-Oblivious Algorithms , 2003, CIAC.

[11]  Anna Pagh,et al.  External String Sorting: Faster and Cache-Oblivious , 2006, STACS.

[12]  Faith Ellen,et al.  Optimal Bounds for the Predecessor Problem and Related Problems , 2002, J. Comput. Syst. Sci..

[13]  Michael E. Saks,et al.  The cell probe complexity of dynamic data structures , 1989, STOC '89.

[14]  Søren Riis,et al.  Dictionaries on AC 0 RAMs : Query time Θ ( √ log n / log log n ) is necessary and sufficient ∗ , 1997 .

[15]  Peter Bro Miltersen,et al.  Trans-Dichotomous Algorithms without Multiplication —some Upper and Lower Bounds , 1997 .

[16]  Rajeev Raman,et al.  Sorting in linear time? , 1995, STOC '95.

[17]  Roberto Grossi,et al.  The string B-tree: a new data structure for string search in external memory and its applications , 1999, JACM.

[18]  Roberto Grossi,et al.  On sorting strings in external memory (extended abstract) , 1997, STOC '97.

[19]  Milan Ruzic,et al.  Constructing Efficient Dictionaries in Close to Sorting Time , 2008, ICALP.

[20]  Torben Hagerup,et al.  Sorting and Searching on the Word RAM , 1998, STACS.

[21]  Mikkel Thorup,et al.  Time-space trade-offs for predecessor search , 2006, STOC '06.

[22]  Gerth Stølting Brodal,et al.  On the limits of cache-obliviousness , 2003, STOC '03.

[23]  Friedhelm Meyer auf der Heide,et al.  Dynamic perfect hashing: upper and lower bounds , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[24]  Peter van Emde Boas,et al.  Design and implementation of an efficient priority queue , 1976, Mathematical systems theory.

[25]  Susanne Albers,et al.  Improved parallel integer sorting without concurrent writing , 1992, SODA '92.

[26]  Michael A. Bender,et al.  Cache-oblivious string B-trees , 2006, PODS '06.

[27]  Milan Ruzic,et al.  Uniform deterministic dictionaries , 2008, TALG.

[28]  Milan Ruzic,et al.  Uniform Algorithms for Deterministic Construction of Efficient Dictionaries , 2004, ESA.

[29]  Rajeev Raman,et al.  Priority Queues: Small, Monotone and Trans-dichotomous , 1996, ESA.

[30]  Mikkel Thorup,et al.  On AC0 implementations of fusion trees and atomic heaps , 2003, SODA '03.

[31]  Friedhelm Meyer auf der Heide,et al.  Dynamic Perfect Hashing: Upper and Lower Bounds , 1994, SIAM J. Comput..

[32]  Arne Andersson.  Faster deterministic sorting and searching in linear space , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[33]  Michael L. Fredman,et al.  Surpassing the Information Theoretic Bound with Fusion Trees , 1993, J. Comput. Syst. Sci..

[34]  Gerth Stølting Brodal,et al.  Cache-oblivious string dictionaries , 2006, SODA '06.

[35]  Arne Andersson,et al.  Sublogarithmic searching without multiplications , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[36]  Peter Bro Miltersen,et al.  Static dictionaries on AC/sup 0/ RAMs: query time /spl theta/(/spl radic/log n/log log n) is necessary and sufficient , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[37]  A. Andersson.  Static Dictionaries on RAMs: Query Time is Necessary and Sufficient , 1996, FOCS 1996.