Tiny pointers

DOI10.1145/3700594MaRDI QIDQ6907353zbMATH OpenFDO

Authors Michael A. Bender, Alex Conway, Martin Farach-Colton, William Kuszmaul, Guido Tagliavini

Publication date 3 November 2025

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3700594

zbMATH Keywords

randomized algorithmsload balancinghashingretrievalballs and binsbalanced allocationpointersspace-efficiency

Mathematics Subject Classification ID

Randomized algorithms (68W20) Data structures (68P05)

Cites work

• scientific article; zbMATH DE number 3664386 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 1301967 (Why is no real title available?)
• scientific article; zbMATH DE number 2038723 (Why is no real title available?)
• scientific article; zbMATH DE number 7559133 (Why is no real title available?)
• Almost random graphs with simple hash functions
• Analysis of Uniform Hashing
• Applications of a Splitting Trick
• Asymmetric balanced allocation with simple hash functions
• Backyard cuckoo hashing: constant worst-case operations with a succinct representation
• Balanced Allocations
• Balanced allocation and dictionaries with tightly packed constant size bins
• Bloom filters, adaptivity, and the dictionary problem
• Cuckoo hashing
• De Dictionariis Dynamicis Pauco Spatio Utentibus
• De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results
• Dynamic dictionaries for multisets and counting filters with constant time operations
• Fully functional static and dynamic succinct trees
• How asymmetry helps load balancing
• Iceberg hashing: optimizing many hash-table criteria at once
• On succinct representations of binary trees
• On the optimal time/space tradeoff for hash tables
• Optimal static range reporting in one dimension
• Optimal worst-case operations for implicit cache-oblivious search trees.
• Randomized search trees
• Representing dynamic binary trees succinctly
• Self-adjusting binary search trees
• Simple and efficient fully-functional succinct trees
• Space efficient hash tables with worst case constant access time
• Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract)
• Succinct representation of dynamic trees
• Uniform Hashing in Constant Time and Optimal Space

This page was built for publication: Tiny pointers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6907353)