The Maximum Size of Dynamic Data Structures

DOI10.1137/0220050zbMath0736.68045OpenAlexW2164609939MaRDI QIDQ3982711

Claire Kenyon-Mathieu, Jeffrey Scott Vitter

Publication date: 26 June 1992

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1808/7172

zbMATH Keywords

Markov processVLSIqueueing theoryhashingdictionariespriority queueslistssweeplinefile historiessymbol tableslazy deletionsoccupancy distribution

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Related Items (5)

Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. plane sweep ⋮ The exhaustion of shared memory: Stochastic results ⋮ Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep versus plane sweep ⋮ Random trees in queueing systems with deadlines ⋮ Maximum queue size and hashing with lazy deletion

This page was built for publication: The Maximum Size of Dynamic Data Structures