Membership in constant time and minimum space
Author:
Publisher
Springer Berlin Heidelberg
Link
http://link.springer.com/content/pdf/10.1007/BFb0049398
Reference15 articles.
1. M. Dietzfelbinger, J. Gil, Y. Matias, and N. Pippenger. Polynomial hash functions are reliable. In Proceedings 19 th International Colloquium on Automata, Languages and Programming, volume 623 of Lecture Notes in Computer Science, pages 235–246. Springer-Verlag, 1992.
2. M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, and R.E. Tarjan. Dynamic perfect hashing: Upper and lower bounds. In 29 th IEEE Symposium on Foundations of Computer Science, pages 524–531, 1988.
3. M. Dietzfelbinger and F. Meyer auf der Heide. A new universal class of hash functions and dynamic hashing in real time. In Proceedings 17 th International Colloquium on Automata, Languages and Programming, volume 443 of Lecture Notes in Computer Science, pages 6–19. Springer-Verlag, 1990.
4. P. Elias. Efficient storage retrieval by content and address of static files. Journal of the ACM, 21(2):246–260, April 1974.
5. P. Elias and R.A. Flower. The complexity of some simple retrieval problems. Journal of the ACM, 22(3):367–379, July 1975.
Cited by 8 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. ChainedFilter: Combining Membership Filters by Chain Rule;Proceedings of the ACM on Management of Data;2023-12-08
2. Approximate Dictionaries;Encyclopedia of Algorithms;2016
3. Timely Autonomic Adaptation of Publish/Subscribe Middleware in Dynamic Environments;International Journal of Adaptive, Resilient and Autonomic Systems;2011-10
4. A Simple, Fast, and Compact Static Dictionary;Algorithms and Computation;2009
5. Low Redundancy in Static Dictionaries with O(1) Worst Case Lookup Time;Automata, Languages and Programming;1999
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3