BibTeX Export for Dagstuhl Seminar Proceedings, Volume 8081

Copy to Clipboard Download

@InProceedings{arge_et_al:DagSemProc.08081.1,
  author =	{Arge, Lars and Sedgewick, Robert and Seidel, Raimund},
  title =	{{08081 Abstracts Collection – Data Structures}},
  booktitle =	{Data Structures},
  pages =	{1--18},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{8081},
  editor =	{Lars Arge and Robert Sedgewick and Raimund Seidel},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08081.1},
  URN =		{urn:nbn:de:0030-drops-15325},
  doi =		{10.4230/DagSemProc.08081.1},
  annote =	{Keywords: Data structures, information retrieval, complexity, algorithms, flash memory}
}
@InProceedings{abam_et_al:DagSemProc.08081.2,
  author =	{Abam, Mohammad and de Berg, Mark and Speckmann, Bettina},
  title =	{{Kinetic kd-Trees and Longest-Side kd-Trees}},
  booktitle =	{Data Structures},
  pages =	{1--12},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{8081},
  editor =	{Lars Arge and Robert Sedgewick and Raimund Seidel},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08081.2},
  URN =		{urn:nbn:de:0030-drops-15307},
  doi =		{10.4230/DagSemProc.08081.2},
  annote =	{Keywords: Kinetic data structures, kd-tree, longest-side kd-tree}
}
@InProceedings{lopezortiz_et_al:DagSemProc.08081.3,
  author =	{Lopez-Ortiz, Alejandro and Dorrigiv, Reza and Salinger, Alejandro},
  title =	{{Optimal Speedup on a Low-Degree Multi-Core Parallel Architecture (LoPRAM)}},
  booktitle =	{Data Structures},
  pages =	{1--13},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{8081},
  editor =	{Lars Arge and Robert Sedgewick and Raimund Seidel},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08081.3},
  URN =		{urn:nbn:de:0030-drops-15315},
  doi =		{10.4230/DagSemProc.08081.3},
  annote =	{Keywords: PRAM, multicore architectures, parallelism, algorithms, dynamic programming, divide and conquer}
}
@InProceedings{pettie:DagSemProc.08081.4,
  author =	{Pettie, Seth},
  title =	{{Sources of Superlinearity in Davenport-Schinzel Sequences}},
  booktitle =	{Data Structures},
  pages =	{1--14},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{8081},
  editor =	{Lars Arge and Robert Sedgewick and Raimund Seidel},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08081.4},
  URN =		{urn:nbn:de:0030-drops-15291},
  doi =		{10.4230/DagSemProc.08081.4},
  annote =	{Keywords: Davenport-Schinzel Sequences, lower envelopes, splay trees}
}

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