The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Cuckoo hashing
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Universal classes of hash functions
Carter, J. L., & Wegman, M. N. (1979) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(79)90044-8 · Cited by 2,519
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Knuth, D. E. (1998) · Addison-Wesley Longman Publishing Co., Inc. eBooks · Cited by 1,421
The LEDA platform for combinatorial and geometric computing
Mehlhorn, K., Näher, S., & Uhrig, C. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-63165-8_161 · Cited by 1,199
Storing a Sparse Table with 0 (1) Worst Case Access Time
Fredman, M. L., Komlós, J., & Szemerédi, E. (1984) · Journal of the ACM · doi:10.1145/828.1884 · Cited by 748
LEDA: A platform for combinatorial and geometric computing
(2000) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(00)90217-7 · Cited by 489
Gonnet, G. H. (1984) · CERN Document Server (European Organization for Nuclear Research) · Cited by 448
Handbook of algorithms and data structures
Gonnet, G. H. (1984) · CERN Document Server (European Organization for Nuclear Research) · Cited by 436
Dynamic Perfect Hashing: Upper and Lower Bounds
Dietzfelbinger, M., Karlin, A. R., Mehlhorn, K., der Heide, F. M. A., Rohnert, H., & Tarjan, R. E. (1988) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1988.21968 · Cited by 421
Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
(2001) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898714906 · Cited by 118
Goldwasser, M. H., Johnson, D., & McGeoch, C. C. (2002) · DIMACS series in discrete mathematics and theoretical computer science · doi:10.1090/dimacs/059 · Cited by 62
Cited by
The Case for Learned Index Structures
Kraska, T., Beutel, A., Chi, E. H., Dean, J., & Polyzotis, N. (2018) · Proceedings of the 2018 International Conference on Management of Data · doi:10.1145/3183713.3196909 · Cited by 956
Forwarding metamorphosis: fast programmable match-action processing in hardware for SDN
Bosshart, P., Gibb, G., Kim, H.-S., Varghese, G., McKeown, N., Izzard, M., Mujica, F., & Horowitz, M. (2013) · Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM · doi:10.1145/2486001.2486011 · Cited by 771
Cuckoo Filter: Practically Better Than Bloom
Fan, B., Andersen, D. G., Kaminsky, M., & Mitzenmacher, M. D. (2014) · Proceedings of the 10th ACM International on Conference on emerging Networking Experiments and Technologies · doi:10.1145/2674005.2674994 · Cited by 737
Searching Efficient 3D Architectures with Sparse Point-Voxel Convolution
Tang, H., Liu, Z., Zhao, S., Lin, Y., Lin, J., Wang, H., & Han, S. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-58604-1_41 · Cited by 733
Theory and Practice of Bloom Filters for Distributed Systems
Tarkoma, S., Rothenberg, C. E., & Lagerspetz, E. (2012) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2011.031611.00024 · Cited by 518
Forwarding metamorphosis: fast programmable match-action processing in hardware for SDN
Bosshart, P., Gibb, G., Kim, H.-S., Varghese, G., McKeown, N., Izzard, M., Mujica, F., & Horowitz, M. (2013) · ACM SIGCOMM Computer Communication Review · doi:10.1145/2534169.2486011 · Cited by 443
Using RDMA efficiently for key-value services
Kalia, A., Kaminsky, M., & Andersen, D. G. (2014) · Proceedings of the 2014 ACM conference on SIGCOMM · doi:10.1145/2619239.2626299 · Cited by 395
Efficient Batched Oblivious PRF with Applications to Private Set Intersection
Kolesnikov, V., Kumaresan, R., Rosulek, M., & Trieu, N. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978381 · Cited by 380
MICA: A Holistic Approach to Fast In-Memory Key-Value Storage
Lim, H., Han, D., Andersen, D. G., & Kaminsky, M. (2018) · Figshare · doi:10.1184/r1/6607280 · Cited by 361
A Comprehensive Study of the Past, Present, and Future of Data Deduplication
Xia, W., Jiang, H., Feng, D., Douglis, F., Shilane, P., Hua, Y., Fu, M., Zhang, Y., & Zhou, Y. (2016) · Proceedings of the IEEE · doi:10.1109/jproc.2016.2571298 · Cited by 318
Scalable Private Set Intersection Based on OT Extension
Pinkas, B., Schneider, T., & Zohner, M. (2018) · ACM Transactions on Privacy and Security · doi:10.1145/3154794 · Cited by 313
MemC3: Compact and Concurrent MemCache with Dumber Caching and Smarter Hashing
Fan, B., Andersen, D. G., & Kaminsky, M. (2018) · doi:10.1184/r1/6607223 · Cited by 296
SILT: a memory-efficient, high-performance key-value store
Lim, H., Fan, B., Andersen, D. G., & Kaminsky, M. (2011) · Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles · doi:10.1145/2043556.2043558 · Cited by 294
Xenome—a tool for classifying reads from xenograft samples
Conway, T., Wazny, J., Bromage, A., Tymms, M., Sooraj, D., Williams, E. D., & Beresford-Smith, B. (2012) · Bioinformatics · doi:10.1093/bioinformatics/bts236 · Cited by 276
The PGM-index: a fully-dynamic compressed learned index with provable worst-case bounds
Ferragina, P., & Vinciguerra, G. (2020) · Proceedings of the VLDB Endowment · doi:10.14778/3389133.3389135 · Cited by 274
Zhuang, L., Guo, N., & Chen, Y. (2023) · Sensors · doi:10.3390/s23031164 · Cited by 10
Metadata
- Authors
- Pagh, R., & Rodler, F. F.
- Venue
- Journal of Algorithms
- Publisher
- Elsevier BV
- Published
- 2004-05
- Volume
- 51
- Issue
- 2
- Pages
- 122-144
- ISSN
- 0196-6774 (ISSN-L)
- OpenAlex
- W2912601938
- Cited by
- 1,045
- References
- 10
- FWCI
- 8.81
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.