Deviation results for sparse tables in hashing with linear probing
- 4 May 2022
- journal article
- research article
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 183 (3-4) , 871-908
Abstract
No abstract availableKeywords
All Related Versions
This publication has 21 references indexed in Scilit:
- A simple proof of Sanov’s theorem*Bulletin of the Brazilian Mathematical Society, New Series, 2006
- Individual displacements for linear probing hashing with different insertion policiesACM Transactions on Algorithms, 2005
- Phase transition for Parking blocks, Brownian excursion and coalescenceRandom Structures & Algorithms, 2002
- Asymptotic distribution for the cost of linear probing hashingRandom Structures & Algorithms, 2001
- Parking with densityRandom Structures & Algorithms, 2001
- Moment convergence in conditional limit theoremsJournal of Applied Probability, 2001
- Large Deviations, Moderate Deviations and LIL for Empirical ProcessesThe Annals of Probability, 1994
- Large Deviations of Sums of Independent Random VariablesThe Annals of Probability, 1979
- Integral Limit Theorems Taking Large Deviations Into Account When Cramér’s Condition Does Not Hold. IITheory of Probability & Its Applications, 1969
- Integral Limit Theorems Taking Large Deviations into Account when Cramér’s Condition Does Not Hold. ITheory of Probability & Its Applications, 1969