Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A compact data structure for representing a dynamic multiset

From MaRDI portal
Publication:1675822
Jump to:navigation, search

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1675822&oldid=13988576"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 05:06.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki