Individual displacements for linear probing hashing with different insertion policies

DOI10.1145/1103963.1103964zbMATH Open1321.68224OpenAlexW2014367232WikidataQ114978189 ScholiaQ114978189MaRDI QIDQ2944495FDOQ2944495

Authors: 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

Recommendations

• Exact distribution of individual displacements in linear probing hashing
• The maximum displacement for linear probing hashing
• Individual Displacements in Hashing with Coalesced Chains
• Asymptotic distribution for the cost of linear probing hashing
• Distributional analysis of Robin Hood linear probing hashing with buckets

zbMATH Keywords

linear probing hashingRobin Hood hashing

Mathematics Subject Classification ID

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

Cited In (12)

• Efficient data structures for sparse network representation
• Title not available (Why is that?)
• Parking functions for mappings
• The maximum displacement for linear probing hashing
• A unified approach to linear probing hashing with buckets
• Parking distributions on trees
• Deviation results for sparse tables in hashing with linear probing
• A conditional Berry-Esseen inequality
• Asymptotic distribution for the cost of linear probing hashing
• Where should you park your car? The $\frac{1}{2}$ rule
• Title not available (Why is that?)
• Individual Displacements in Hashing with Coalesced Chains

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

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