A compact data structure for representing a dynamic multiset

DOI10.1016/j.ipl.2010.08.007zbMath1379.68107OpenAlexW2044453172MaRDI QIDQ1675822

S. Srinivasa Rao, Jyrki Katajainen

Publication date: 3 November 2017

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.08.007

zbMATH Keywords

data structuresmemory managementbalanced search treesdictionariesspace efficiency

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (1)

Space-efficient B trees via load-balancing

Cites Work

• Implicit data structures for fast search and update
• Implicit Data Structures for the Dictionary Problem
• Maintaining discrete probability distributions optimally
• Algorithms and Data Structures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A compact data structure for representing a dynamic multiset