External-memory dictionaries with worst-case update cost

DOI10.4230/LIPICS.ISAAC.2022.21MaRDI QIDQ6602438zbMATH OpenFDO

Authors Rathish Das, John Iacono, Yakov Nekrich

Publication date 11 September 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ISAAC.2022.21

zbMATH Keywords

buffer treedata structuresexternal memory

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(1)

• Buffered partially-persistent external-memory search trees

This page was built for publication: External-memory dictionaries with worst-case update cost

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