Maximum queue size and hashing with lazy deletion

DOI10.1007/BF01759063MaRDI QIDQ802861zbMATH OpenOpenAlexFDO

Authors Claire 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

zbMATH Keywords

continued fractionsorthogonal polynomialsqueuesbirth-and-death processesfile historieshasing with lazy deletionlinear listsM/G/\(\infty \)M/M/\(\infty \)symbol tables

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• The Maximum Size of Dynamic Data Structures
• A Queueing Analysis of Hashing with Lazy Deletion
• Stochastic Models of Queue Storage
• The complexity of hashing with lazy deletion
• scientific article; zbMATH DE number 1166248

Cites work

• scientific article; zbMATH DE number 3148801 (Why is no real title available?)
• scientific article; zbMATH DE number 3656855 (Why is no real title available?)
• scientific article; zbMATH DE number 3727273 (Why is no real title available?)
• scientific article; zbMATH DE number 3522951 (Why is no real title available?)
• A Queueing Analysis of Hashing with Lazy Deletion
• Expected Length of the Longest Probe Sequence in Hash Code Searching
• Sequence of operations analysis for dynamic data structures
• The Maximum Size of Dynamic Data Structures
• The complexity of hashing with lazy deletion

Cited in

(3)

• Authenticated hash tables based on cryptographic accumulators
• Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence
• A Queueing Analysis of Hashing with Lazy Deletion

This page was built for publication: Maximum queue size and hashing with lazy deletion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q802861)