Article

Free access

Faster deterministic dictionaries

Author:

Rasmus PaghAuthors Info & Claims

SODA '00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms

Pages 487 - 493

Published: 01 February 2000 Publication History

PDF eReader

References

[1]

N. Alon and M. Naor. Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions. Algorithmica, 16(4-5):434-449, 1996.

Google Scholar

[2]

Arne Andersson. Faster deterministic sorting and searching in linear space. In 37th Annual Symposium on Foundations of Computer Science (Burlington, VT, 1996), pages 135-141. IEEE Comput. Soc. Press, Los Alamitos, CA, 1996.

Digital Library

Google Scholar

[3]

Paul Beame and Faith Fich. Optimal bounds for the predecessor problem. In Proceedings of the 31th Annual A CM Symposium on Theory of Computing (STOC '99), pages 295-304, New York, 1999. ACM Press.

Digital Library

Google Scholar

[4]

J. Lawrence Carter and Mark N. Wegman. Universal classes of hash functions. J. Comput. System Sci., 18(2):143-154, 1979.

Google Scholar

[5]

Martin Dietzfelbinger, Joseph Gil, Yossi Matias, and Nicholas Pippenger. Polynomial hash functions are reliable (extended abstract). In Proceedings of the 19th International Colloquium on Automata, Languages and Programming (ICALP '92), volume 623 of Lecture Notes in Computer Science, pages 235-246, Berlin, 1992. Springer-Verlag.

Digital Library

Google Scholar

[6]

Martin Dietzfelbinger, Anna Karlin, Kurt Mehlhorn, Friedhelm Meyer Auf Der Heide, Hans Rohnert, and Robert E. Tarjan. Dynamic perfect hashing: Upper and lower bounds. SIAM Journal on Computing, 23(4):738-761, August 1994.

Digital Library

Google Scholar

[7]

Michael L. Fredman, JAnos Koml6s, and Endre Szemer~di. Storing a sparse table with O(1) worst case access time. J. Assoc. Comput. Mach., 31(3):538-544,. 1984.

Digital Library

Google Scholar

[8]

Michael L. Fredman and Dan E. Willard. Surpassing the information-theoretic bound with fusion trees. J. Comput. System Sci., 47:424-436, 1993.

Digital Library

Google Scholar

[9]

Torben Hagerup. Fast deterministic construction of static dictionaries. In Proceedings of the Tenth Annual A CM-SIAM Symposium on Discrete Algorithms (SO- DA 1999), pages 414-418, New York, 1999. ACM.

Digital Library

Google Scholar

[10]

Peter Bro Miltersen. Error correcting codes, perfect hashing circuits, and deterministic dynamic dictionaries. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1998), pages 556-563, New York, 1998. ACM.

Digital Library

Google Scholar

[11]

Mark H. Overmaxs and Jan van Leeuwen. Worstcase optimal insertion and deletion methods for decomposable searching problems. Inform. Process. Lett., 12(4):168-173, 1981.

Google Scholar

[12]

Rajeev l~aman. Priority queues: small, monotone and trans-dichotomous. In Proceedings of the 4th European Symposium on Algorithms (ESA '96), volume 1136 of Lecture Notes in Computer Science, pages 121-137. Springer-Verlag, Berlin, 1996.

Digital Library

Google Scholar

[13]

Robert Endre Tarjan and Andrew Chi Chih Yao. Storing a sparse table. Communications of the ACM, 22(11):606-611, November 1979.

Digital Library

Google Scholar

Cited By

View all

Cohen HPorat E(2010)Fast set intersection and two-patterns matchingTheoretical Computer Science10.1016/j.tcs.2010.06.002411:40-42(3795-3800)Online publication date: 1-Sep-2010
https://dl.acm.org/doi/10.1016/j.tcs.2010.06.002
Roditty IThorup MZwick U(2008)Roundtrip spanners and roundtrip routing in directed graphsACM Transactions on Algorithms10.1145/1367064.13670694:3(1-17)Online publication date: 4-Jul-2008
https://dl.acm.org/doi/10.1145/1367064.1367069
Roditty LThorup MZwick UEppstein D(2002)Roundtrip spanners and roundtrip routing in directed graphsProceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms10.5555/545381.545491(844-851)Online publication date: 6-Jan-2002
https://dl.acm.org/doi/10.5555/545381.545491
Show More Cited By

Index Terms

Faster deterministic dictionaries

Recommendations

Closure properties and descriptional complexity of deterministic regular expressions

We study the descriptional complexity of regular languages that are definable by deterministic regular expressions, i.e., we examine worst-case blow-ups in size when translating between different representations for such languages. As representations of ...
Quantum versus deterministic counter automata

This paper focuses on quantum analogues of various models of counter automata, and almost completely proves the relation between the classes of languages recognizable by bounded error quantum ones and classical deterministic ones in every model of ...
Strictly deterministic CD-systems of restarting automata
FCT'07: Proceedings of the 16th international conference on Fundamentals of Computation Theory

A CD-system of restarting automata is called strictly deterministic if all its component systems are deterministic, and if there is a unique successor system for each component. Here we show that the strictly deterministic CD-systems of restarting ...

Comments

Information & Contributors

Information

Published In

SODA '00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms

February 2000

965 pages

ISBN:0898714532

Chairman:
David Shmoys

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 01 February 2000

Check for updates

Qualifiers

Article

Acceptance Rates

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

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
311
Total Downloads

Downloads (Last 12 months)28
Downloads (Last 6 weeks)2

Reflects downloads up to 27 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Cohen HPorat E(2010)Fast set intersection and two-patterns matchingTheoretical Computer Science10.1016/j.tcs.2010.06.002411:40-42(3795-3800)Online publication date: 1-Sep-2010
https://dl.acm.org/doi/10.1016/j.tcs.2010.06.002
Roditty IThorup MZwick U(2008)Roundtrip spanners and roundtrip routing in directed graphsACM Transactions on Algorithms10.1145/1367064.13670694:3(1-17)Online publication date: 4-Jul-2008
https://dl.acm.org/doi/10.1145/1367064.1367069
Roditty LThorup MZwick UEppstein D(2002)Roundtrip spanners and roundtrip routing in directed graphsProceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms10.5555/545381.545491(844-851)Online publication date: 6-Jan-2002
https://dl.acm.org/doi/10.5555/545381.545491
Alstrup SGavoille CKaplan HRauhe TRosenberg AMaggs B(2002)Nearest common ancestorsProceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures10.1145/564870.564914(258-264)Online publication date: 10-Aug-2002
https://dl.acm.org/doi/10.1145/564870.564914
Beame PFich F(2002)Optimal bounds for the predecessor problem and related problemsJournal of Computer and System Sciences10.1006/jcss.2002.182265:1(38-72)Online publication date: 1-Aug-2002
https://dl.acm.org/doi/10.1006/jcss.2002.1822
Pagh R(2000)A trade-off for worst-case efficient dictionariesNordic Journal of Computing10.5555/642992.6429947:3(151-163)Online publication date: 1-Sep-2000
https://dl.acm.org/doi/10.5555/642992.642994

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Closure properties and descriptional complexity of deterministic regular expressions

Quantum versus deterministic counter automata

Strictly deterministic CD-systems of restarting automata