Individual displacements for linear probing hashing with different insertion policies

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

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

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

Cited In (10)

• Efficient data structures for sparse network representation
• Parking functions for mappings
• A conditional Berry–Esseen inequality
• A unified approach to linear probing hashing with buckets
• Parking distributions on trees
• Deviation results for sparse tables in hashing with linear probing
• Where should you park your car? The $\frac{1}{2}$ rule
• The Maximum Displacement for Linear Probing Hashing
• 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)