Analysis of Robin Hood and Other Hashing Algorithms Under the Random Probing Model, With and Without Deletions

DOI10.1017/S0963548318000408zbMath1435.68406OpenAlexW2887289722MaRDI QIDQ5219328

No author found.

Publication date: 11 March 2020

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548318000408

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Universal classes of hash functions
• Uniform Hashing in Constant Time and Optimal Space
• The Analysis of Hashing Techniques That Exhibit k -ary Clustering
• Efficient Ordering of Hash Tables
• Last-come-first-served hashing
• Ordered hash tables
• A New Approach to Analyzing Robin Hood Hashing
• Reducing the retrieval time of scatter storage techniques

This page was built for publication: Analysis of Robin Hood and Other Hashing Algorithms Under the Random Probing Model, With and Without Deletions