Maximum Size of a Dynamic Data Structure: Hashing with Lazy Deletion Revisited
- 1 August 1992
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 21 (4) , 713-732
- https://doi.org/10.1137/0221043
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Dynamic algorithms in D.E. Knuth's model: a probabilistic analysisTheoretical Computer Science, 1992
- The Maximum Size of Dynamic Data StructuresSIAM Journal on Computing, 1991
- Data structures maximaPublished by Springer Nature ,1991
- Probability Approximations via the Poisson Clumping HeuristicPublished by Springer Nature ,1989
- A Queueing Analysis of Hashing with Lazy DeletionSIAM Journal on Computing, 1987
- Sequence of operations analysis for dynamic data structuresJournal of Algorithms, 1980
- Limit Theorems for a $GI/G/\infty$ QueueThe Annals of Probability, 1975
- Extreme value theory for a class of discrete distributions with applications to some stochastic processesJournal of Applied Probability, 1970
- A Limit Theorem for Passage Times in Ergodic Regenerative ProcessesThe Annals of Mathematical Statistics, 1966
- Limiting Distribution of the Maximum Term in Sequences of Dependent Random VariablesThe Annals of Mathematical Statistics, 1962