License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2019.64
URN: urn:nbn:de:0030-drops-110083
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2019/11008/
Go to the corresponding LIPIcs Volume Portal

Hagerup, Torben

A Constant-Time Colored Choice Dictionary with Almost Robust Iteration

pdf-format:
LIPIcs-MFCS-2019-64.pdf (0.5 MB)

Abstract

A (colored) choice dictionary is a data structure that is initialized with positive integers n and c and subsequently maintains a sequence of n elements of {0,...,c-1}, called colors, under operations to inspect and to update the color in a given position and to return the position of an occurrence of a given color. Choice dictionaries are fundamental in space-efficient computing. Some applications call for the additional operation of dynamic iteration, i.e., enumeration of the positions containing a given color while the sequence of colors may change. An iteration is robust if it enumerates every position that contains the relevant color throughout the iteration but never enumerates a position more than once or when it does not contain the color in question. We describe the first choice dictionary that executes every operation in constant amortized time and almost robust iteration in constant amortized time per element enumerated. The iteration is robust, except that it may enumerate some elements a second time. The data structure occupies n log_2 c+O((log n)^2) bits. The time and space bounds assume that c=O((log n)^{1/2}(log log n)^{-{3/2}}).

BibTeX - Entry

@InProceedings{hagerup:LIPIcs:2019:11008,
  author =	{Torben Hagerup},
  title =	{{A Constant-Time Colored Choice Dictionary with Almost Robust Iteration}},
  booktitle =	{44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)},
  pages =	{64:1--64:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-117-7},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{138},
  editor =	{Peter Rossmanith and Pinar Heggernes and Joost-Pieter Katoen},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2019/11008},
  URN =		{urn:nbn:de:0030-drops-110083},
  doi =		{10.4230/LIPIcs.MFCS.2019.64},
  annote =	{Keywords: Succinct data structures, space efficiency, in-place chain technique, bounded universes, amortization}
}

Keywords: Succinct data structures, space efficiency, in-place chain technique, bounded universes, amortization
Collection: 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)
Issue Date: 2019
Date of publication: 20.08.2019

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI