A New Approach to Analyzing Robin Hood Hashing

DOI10.1137/1.9781611974324.2zbMath1430.68053arXiv1401.7616OpenAlexW2962890070MaRDI QIDQ5194939

Michael Mitzenmacher

Publication date: 17 September 2019

Published in: 2016 Proceedings of the Thirteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.7616

Mathematics Subject Classification ID

Searching and sorting (68P10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05)

Related Items (1)

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

This page was built for publication: A New Approach to Analyzing Robin Hood Hashing