BibTeX Export for Dynamic Ordered Sets with Approximate Queries, Approximate Heaps and Soft Heaps

Copy to Clipboard Download

@InProceedings{thorup_et_al:LIPIcs.ICALP.2019.95,
  author =	{Thorup, Mikkel and Zamir, Or and Zwick, Uri},
  title =	{{Dynamic Ordered Sets with Approximate Queries, Approximate Heaps and Soft Heaps}},
  booktitle =	{46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
  pages =	{95:1--95:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-109-2},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{132},
  editor =	{Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.95},
  URN =		{urn:nbn:de:0030-drops-106712},
  doi =		{10.4230/LIPIcs.ICALP.2019.95},
  annote =	{Keywords: Order queries, word RAM, lower bounds}
}

The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.

Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode