Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract)-Reference-Cited by-同舟云学术

Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract)

Published:2008 Issue: Volume: Page:385-396
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Dietzfelbinger Martin,Pagh Rasmus

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-70575-8_32

Reference24 articles.

1. Alstrup, S., Brodal, G.S., Rauhe, T.: Optimal static range reporting in one dimension. In: Proc. 33rd ACM STOC, pp. 476–482 (2001)

2. Bloom, B.H.: Space/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422–426 (1970)

3. Lecture Notes in Computer Science;F.C. Botelho,2007

4. Broder, A.Z., Mitzenmacher, M.: Network applications of Bloom filters: A survey. In: Proc. 40th Annual Allerton Conference on Communication, Control, and Computing, pp. 636–646. ACM Press, New York (2002)

5. Cain, J.A., Sanders, P., Wormald, N.C.: The random graph threshold for k-orientiability and a fast algorithm for optimal multiple-choice allocation. In: Proc. 18th ACM-SIAM SODA, pp. 469–476 (2007)

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

1. Space Lower Bounds for Dynamic Filters and Value-Dynamic Retrieval;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. FeCBF: A Novel Sub-Optimal Cascaded Bloom Filter Structure Based on Feature Extraction;IEEE Access;2024

3. Forward Security with Crash Recovery for Secure Logs;ACM Transactions on Privacy and Security;2023-12-12

4. Practical Volume-Hiding Encrypted Multi-Maps with Optimal Overhead and Beyond;Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security;2022-11-07

5. Common Message Acknowledgments: Massive ARQ Protocols for Wireless Access;IEEE Transactions on Communications;2022-08