Hashing with Linear Probing under Nonuniform Probabilities

DOI10.1017/S0269964800000577zbMath1134.68372MaRDI QIDQ3415863

David J. Aldous

Publication date: 19 January 2007

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Related Items (3)

A Vervaat-like path transformation for the reflected Brownian bridge conditioned on its local time at 0 ⋮ Dynamical model for the neural activity of singing Serinus canaria ⋮ Parking with density

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The analysis of double hashing
• The expected length of the longest probe sequence for bucket searching when the distribution is not uniform
• Expected Length of the Longest Probe Sequence in Hash Code Searching
• Linear probing: The probable largest search time grows logarithmically with the number of records

This page was built for publication: Hashing with Linear Probing under Nonuniform Probabilities