Parking with density

DOI10.1002/rsa.1014zbMath1005.68080OpenAlexW2006331623MaRDI QIDQ2746214

Jean-François Marckert

Publication date: 12 February 2003

Published in: Random Structures and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.1014

zbMATH Keywords

parkingthreshold functiongiant component

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Search theory (90B40)

Related Items (2)

Deviation results for sparse tables in hashing with linear probing ⋮ A conditional Berry–Esseen inequality

Cites Work

• Unnamed Item
• Open-addressing hashing with unequal-probability keys
• Acyclic and parking functions
• On the analysis of linear probing hashing
• Mappings of acyclic and parking functions
• Hashing with Linear Probing under Nonuniform Probabilities
• The expected length of the longest probe sequence for bucket searching when the distribution is not uniform
• An approximation of partial sums of independent RV's, and the sample DF. II
• Linear probing: The probable largest search time grows logarithmically with the number of records

This page was built for publication: Parking with density