The complexity of hashing with lazy deletion

DOI10.1007/BF01840434zbMath0611.68043OpenAlexW1984996833MaRDI QIDQ1087334

Christopher J. Van Wyk, Jeffrey Scott Vitter

Publication date: 1986

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01840434

zbMATH Keywords

birth-death processLaplace's methoddynamic dictionary problemhashing algorithms

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (2)

Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence ⋮ Maximum queue size and hashing with lazy deletion

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The complexity of hashing with lazy deletion