Maximum queue size and hashing with lazy deletion
From MaRDI portal
Publication:802861
DOI10.1007/BF01759063zbMath0726.68021OpenAlexW2023189876MaRDI QIDQ802861
Claire M. Kenyon, Jeffrey Scott Vitter
Publication date: 1991
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01759063
orthogonal polynomialsqueuescontinued fractionsbirth-and-death processesfile historieshasing with lazy deletionlinear listsM/G/\(\infty \)M/M/\(\infty \)symbol tables
Related Items (2)
Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence ⋮ Authenticated hash tables based on cryptographic accumulators
Cites Work
- The complexity of hashing with lazy deletion
- A Queueing Analysis of Hashing with Lazy Deletion
- Sequence of operations analysis for dynamic data structures
- Expected Length of the Longest Probe Sequence in Hash Code Searching
- The Maximum Size of Dynamic Data Structures
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Maximum queue size and hashing with lazy deletion
