One-probe search

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2380 LNCS, Issue , 2002, Pages 439-450

  Östlin, Anna ^a   Pagh, Rasmus ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

EXPANDER GRAPHS; LOOKUPS; MEMORY LOCATIONS; RUNNING TIME; SINGLE WORDS; SPACE USAGE;

DATA STRUCTURES;

EID: 33749582946     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45465-9_38     Document Type: Conference Paper

References (16)

1. Arne Andersson and Mikkel Thorup. Tight(er) worst-case bounds on dynamic searching and priority queues. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC '00), pages 335-342. ACM Press, 2000.
2. Paul Beame and Faith Fich. Optimal bounds for the predecessor problem. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC '99), pages 295-304. ACM Press, 1999.
3. Gerth Stølting Brodal and Rolf Fagerberg. Dynamic representations of sparse graphs. In Proceedings of the 6th International Workshop on Algorithms and Data Structures (WADS '99), volume 1663 of Lecture Notes in Computer Science, pages 342-351. Springer-Verlag, 1999.
4. Harry Buhrman, Peter Bro Miltersen, Jaikumar Radhakrishnan, and S. Venkatesh. Are bitvectors optimal? In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC '00), pages 449-458. ACM Press, 2000.
5. Martin Dietzfelbinger and Friedhelm Meyer auf der Heide. A newuniv ersal class of hash functions and dynamic hashing in real time. In Proceedings of the 17th International Colloquium on Automata, Languages and Programming (ICALP '90), volume 443 of Lecture Notes in Computer Science, pages 6-19. Springer-Verlag, 1990.
6. Amos Fiat and Moni Naor. Implicit O(1) probe search. SIAM J. Comput., 22(1):1-10, 1993.
7. Michael L. Fredman, János Komlós, and Endre Szemerédi. Storing a sparse table with O(1) worst case access time. J. Assoc. Comput. Mach., 31(3):538-544, 1984.
8. Michael L. Fredman and Dan E. Willard. Surpassing the information theoretic bound with fusion trees. J. Comput. System Sci., 47:424-436, 1993.
9. Torben Hagerup, Peter Bro Miltersen, and Rasmus Pagh. Deterministic dictionaries. J. Algorithms, 41(1):69-85, 2001.
10. Philip Hall. On representatives of subsets. J. London Math. Soc., 10:26-30, 1935.
11. J. Ian Munro and Hendra Suwanda. Implicit data structures for fast search and update. J. Comput. System Sci., 21(2):236-250, 1980.
12. Rasmus Pagh. A trade-off for worst-case efficient dictionaries. Nordic J. Comput., 7(3):151-163, 2000.
13. Rasmus Pagh. On the Cell Probe Complexity of Membership and Perfect Hashing. In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC '01), pages 425-432. ACM Press, 2001. http://www.brics.dk/pagh/papers/ probe.pdf
14. Amnon Ta-Shma. Storing information with extractors. To appear in Information Processing Letters.
15. Amnon Ta-Shma, Christopher Umans, and David Zuckerman. Loss-less condensers, unbalanced expanders, and extractors. In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC '01), pages 143-152. ACM Press, 2001.
16. AndrewC.-C. Yao. Should tables be sorted? J. Assoc. Comput. Mach., 28(3):615-628, 1981.