Space Efficient Hash Tables with Worst Case Constant Access Time-Reference-Cited by-同舟云学术

Space Efficient Hash Tables with Worst Case Constant Access Time

Published:2003 Issue: Volume: Page:271-282
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Fotakis Dimitris,Pagh Rasmus,Sanders Peter,Spirakis Paul

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-36494-3_25

Reference22 articles.

1. R. P. Brent. Reducing the retrieval time of scatter storage techniques. Communications of the ACM, 16(2):105–109, 1973.

2. A. Z. Broder and A. R. Karlin. Multilevel adaptive hashing. In Proc. 1st Annual ACM-SIAM Symposium on Discrete Algorithms, pages 43–53. ACM Press, 2000.

3. A. Brodnik and J. I. Munro. Membership in constant time and almost-minimum space. SIAM J. Comput., 28(5):1627–1640, 1999.

4. J. G. Cleary. Compact hash tables using bidirectional linear probing. IEEE Transactions on Computers, C-33(9):828–834, September 1984.

5. Lect Notes Comput Sci;M. Dietzfelbinger,1992

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. SmartDIMM: In-Memory Acceleration of Upper Layer Protocols;2024 IEEE International Symposium on High-Performance Computer Architecture (HPCA);2024-03-02

2. Iceberg Hashing: Optimizing Many Hash-Table Criteria at Once;Journal of the ACM;2023-11-30

3. Tight Cell-Probe Lower Bounds for Dynamic Succinct Dictionaries;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

4. A Faster Algorithm for Cuckoo Insertion and Bipartite Matching in Large Graphs;Algorithmica;2019-06-12

5. Reducing Writebacks Through In-Cache Displacement;ACM Transactions on Design Automation of Electronic Systems;2019-03-21