Individual displacements for linear probing hashing with different insertion policies

DOI10.1145/1103963.1103964zbMath1321.68224OpenAlexW2014367232WikidataQ114978189 ScholiaQ114978189MaRDI QIDQ2944495

Svante Janson

Publication date: 2 September 2015

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

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

zbMATH Keywords

linear probing hashingRobin Hood hashing

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (10)

Parking functions for mappings ⋮ A unified approach to linear probing hashing with buckets ⋮ Deviation results for sparse tables in hashing with linear probing ⋮ Parking distributions on trees ⋮ Efficient data structures for sparse network representation ⋮ The Maximum Displacement for Linear Probing Hashing ⋮ Unnamed Item ⋮ Individual Displacements in Hashing with Coalesced Chains ⋮ A conditional Berry–Esseen inequality ⋮ Where should you park your car? The $\frac{1}{2}$ rule

This page was built for publication: Individual displacements for linear probing hashing with different insertion policies