skip to main content
10.5555/314500.314594acmconferencesArticle/Chapter ViewAbstractPublication PagessodaConference Proceedingsconference-collections
Article
Free access

Fast deterministic construction of static dictionaries

Published: 01 January 1999 Publication History
First page of PDF

References

[1]
A.V. Aho, J. E. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison- Wesley, Reading, MA, 1974.
[2]
A. Andersson, Faster deterministic sorting and searching in linear space, in Proc. 37th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1996), pp. 135-141.
[3]
A. Andersson, T. Hagerup, S. Nilsson, and R. Raman, Sorting in linear time?, d. Comput. System Sci. 57 (1998), pp. 74-93.
[4]
A. Anderszon, P.B. Miltersen, S. Riis, and M. Thorup, Static dictionaries on AC~ RAMs: Query time O(#ogn/loglogn) is necessary and sufficient, in Proc. 37th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1996), pp. 441-450.
[5]
A. Brodnik, P.B. Miltersen, and J. I. Munro, Transdichotomous algorithms without multiplication some upper and lower bounds, in Proc. 5th International Workshop on Algorithms and Data Structures (WADS 1997), Lecture Notes in Computer Science, Vol. 1272, Springer-Verlag, Berlin, pp. 426-439.
[6]
S.A. Cook and R. A. Reckhow, Time bounded random access machines, J. Comput. System Sci. 7 (1973), pp. 354-375.
[7]
M. Dietzfelbinger, Universal hashing and k-wise independent random variables via integer arithmetic without primes, in Proc. 13th Annual Symposium on Theoretical Aspects of Computer Science (STACS 1996), Lecture Notes in Computer Science, Springer-Verlag, Berlin, Vol. 1046, pp. 569-580.
[8]
M. D#etzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohne:rt, and R. E. Tarjan. Dynamic perfect hashing: Upper and lower bounds, SIAM d. Comput. 23 (1994), pp. 738-761.
[9]
T. Hagerup, Sorting and searching on the word RAM. in Proc. 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS 1998), Lecture Notes in Computer Science, Springer-Verlag, Berlin. Vol. 1373, pp. 366-398.
[10]
T. Hagerup, Simpler and faster dictionaries on the AC~ RAM, in Proc. 25th International Colloquium on Automata, Languages and Programming (ICALP 1998), Lecture Notes in Computer Science, Springer- Verlag, Berlin, Vol. 1443, pp. 79-90.
[11]
P.B. Miltersen, Error correcting codes, perfect hashing circuits, and deterministic dynamic dictionaries, in Proc. 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1998), pp. 556-563.
[12]
M.H. Overmars and J. #xn Leeuwen, Worst-case optimal insertion and deletion methods for decomposable searching problems, /nform. Process. Lett. 12 (1981), pp. 168-173.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SODA '99: Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
January 1999
992 pages
ISBN:0898714346

Sponsors

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 01 January 1999

Check for updates

Qualifiers

  • Article

Conference

SODA99
Sponsor:
SODA99: 1999 10th Conference on Discrete Algorithms
January 17 - 19, 1999
Maryland, Baltimore, USA

Acceptance Rates

Overall Acceptance Rate 411 of 1,322 submissions, 31%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)24
  • Downloads (Last 6 weeks)3
Reflects downloads up to 25 Dec 2024

Other Metrics

Citations

Cited By

View all

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media