@InProceedings{buhrman_et_al:DagSemProc.04421.1,
  author =	{Buhrman, Harry and Fortnow, Lance and Thierauf, Thomas},
  title =	{{04421 Abstracts Collection – Algebraic Methods in Computational Complexity}},
  booktitle =	{Algebraic Methods in Computational Complexity},
  pages =	{1--14},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4421},
  editor =	{Harry Buhrman and Lance Fortnow and Thomas Thierauf},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04421.1},
  URN =		{urn:nbn:de:0030-drops-1162},
  doi =		{10.4230/DagSemProc.04421.1},
  annote =	{Keywords: Computational complexity , algebraic methods , quantum computations , lower bounds}
}
@InProceedings{rothe:DagSemProc.04421.2,
  author =	{Rothe, J\"{o}rg},
  title =	{{Exact-Four-Colorability, Exact Domatic Number Problems, and the Boolean Hierarchy}},
  booktitle =	{Algebraic Methods in Computational Complexity},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4421},
  editor =	{Harry Buhrman and Lance Fortnow and Thomas Thierauf},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04421.2},
  URN =		{urn:nbn:de:0030-drops-1059},
  doi =		{10.4230/DagSemProc.04421.2},
  annote =	{Keywords: Exact Colorability , exact domatic number , boolean hierarchy completeness}
}
@InProceedings{gasarch_et_al:DagSemProc.04421.3,
  author =	{Gasarch, William and Stephan, Frank},
  title =	{{Finding Isolated Cliques by Queries – An Approach to Fault Diagnosis with Many Faults}},
  booktitle =	{Algebraic Methods in Computational Complexity},
  pages =	{1--16},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4421},
  editor =	{Harry Buhrman and Lance Fortnow and Thomas Thierauf},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04421.3},
  URN =		{urn:nbn:de:0030-drops-1066},
  doi =		{10.4230/DagSemProc.04421.3},
  annote =	{Keywords: Isolated Cliques , Query-Complexity , Fault Diagnosis}
}
@InProceedings{goldsmith:DagSemProc.04421.4,
  author =	{Goldsmith, Judy},
  title =	{{Preferences and Domination}},
  booktitle =	{Algebraic Methods in Computational Complexity},
  pages =	{1--10},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4421},
  editor =	{Harry Buhrman and Lance Fortnow and Thomas Thierauf},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04421.4},
  URN =		{urn:nbn:de:0030-drops-1038},
  doi =		{10.4230/DagSemProc.04421.4},
  annote =	{Keywords: Preferences , CP-nets , PSPACE-complete , reductions}
}
@InProceedings{list_et_al:DagSemProc.04421.5,
  author =	{List, Beatrice and Maucher, Markus and Sch\"{o}ning, Uwe and Schuler, Rainer},
  title =	{{Randomized QuickSort and the Entropy of the Random Source}},
  booktitle =	{Algebraic Methods in Computational Complexity},
  pages =	{1--15},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4421},
  editor =	{Harry Buhrman and Lance Fortnow and Thomas Thierauf},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04421.5},
  URN =		{urn:nbn:de:0030-drops-1043},
  doi =		{10.4230/DagSemProc.04421.5},
  annote =	{Keywords: Randomized Algorithms , QuickSort , Entropy}
}
@InProceedings{gasarch_et_al:DagSemProc.04421.6,
  author =	{Gasarch, William and Glenn, James and Utis, Andre},
  title =	{{The communication complexity of the Exact-N Problem revisited}},
  booktitle =	{Algebraic Methods in Computational Complexity},
  pages =	{1--14},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4421},
  editor =	{Harry Buhrman and Lance Fortnow and Thomas Thierauf},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04421.6},
  URN =		{urn:nbn:de:0030-drops-1026},
  doi =		{10.4230/DagSemProc.04421.6},
  annote =	{Keywords: Communication Complexity , Exact-N problem , Arithmetic Sequences}
}