BibTeX Export for Dagstuhl Seminar Proceedings, Volume 8341

Copy to Clipboard Download

@InProceedings{czumaj_et_al:DagSemProc.08341.1,
  author =	{Czumaj, Artur and Muthukrishnan, S. Muthu and Rubinfeld, Ronitt and Sohler, Christian},
  title =	{{08341 Abstracts Collection – Sublinear Algorithms}},
  booktitle =	{Sublinear Algorithms},
  pages =	{1--19},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{8341},
  editor =	{Artur Czumaj and S. Muthu Muthukrishnan and Ronitt Rubinfeld and Christian Sohler},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.08341.1},
  URN =		{urn:nbn:de:0030-drops-16981},
  doi =		{10.4230/DagSemProc.08341.1},
  annote =	{Keywords: Sublinear algorithms, property testing, data streaming, graph algorithms, approximation algorithms}
}
@InProceedings{czumaj_et_al:DagSemProc.08341.2,
  author =	{Czumaj, Artur and Muthukrishnan, S. Muthu and Rubinfeld, Ronitt and Sohler, Christian},
  title =	{{08341 Executive Summary – Sublinear Algorithms}},
  booktitle =	{Sublinear Algorithms},
  pages =	{1--2},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{8341},
  editor =	{Artur Czumaj and S. Muthu Muthukrishnan and Ronitt Rubinfeld and Christian Sohler},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.08341.2},
  URN =		{urn:nbn:de:0030-drops-16964},
  doi =		{10.4230/DagSemProc.08341.2},
  annote =	{Keywords: Sublinear algorithms, property testing, data streaming, graph algorithms, approximation algorithms}
}
@InProceedings{kaufman_et_al:DagSemProc.08341.3,
  author =	{Kaufman, Tali and Litsyn, Simon and Xie, Ning},
  title =	{{Breaking the \$\backslashepsilon\$-Soundness Bound of the Linearity Test over GF(2)}},
  booktitle =	{Sublinear Algorithms},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{8341},
  editor =	{Artur Czumaj and S. Muthu Muthukrishnan and Ronitt Rubinfeld and Christian Sohler},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.08341.3},
  URN =		{urn:nbn:de:0030-drops-16971},
  doi =		{10.4230/DagSemProc.08341.3},
  annote =	{Keywords: Linearity test, Fourier analysis, coding theory}
}
@InProceedings{ganguly:DagSemProc.08341.4,
  author =	{Ganguly, Sumit},
  title =	{{Lower bound for estimating frequency for update data streams}},
  booktitle =	{Sublinear Algorithms},
  pages =	{1--15},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{8341},
  editor =	{Artur Czumaj and S. Muthu Muthukrishnan and Ronitt Rubinfeld and Christian Sohler},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.08341.4},
  URN =		{urn:nbn:de:0030-drops-16959},
  doi =		{10.4230/DagSemProc.08341.4},
  annote =	{Keywords: Data stream, lower bound, frequency estimation, stream automata, linear map}
}

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