Maximum Size of a Dynamic Data Structure: Hashing with Lazy Deletion Revisited

DOI10.1137/0221043zbMath0825.68338OpenAlexW2080420484MaRDI QIDQ4018400

Wojciech Szpankowski, David J. Aldous, Micha Hofri

Publication date: 16 January 1993

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

Full work available at URL: https://semanticscholar.org/paper/04a4f50ef53a6dfa0af71a665a427c892c1668f6

Mathematics Subject Classification ID

Theory of data (68P99) Data structures (68P05)

Related Items (3)

Combinational optimization problems for which almost every algorithm is asymptotically optimal ⋮ Random trees in queueing systems with deadlines ⋮ Maximum Queue Length and Waiting Time Revisited: Multserver G/G/c Queue

This page was built for publication: Maximum Size of a Dynamic Data Structure: Hashing with Lazy Deletion Revisited