Dagstuhl Seminar Proceedings, Volume 4421,

• Harry Buhrman, Lance Fortnow, and Thomas Thierauf 04421 Abstracts Collection – Algebraic Methods in Computational Complexity 10.4230/DagSemProc.04421.1
• Jörg Rothe Exact-Four-Colorability, Exact Domatic Number Problems, and the Boolean Hierarchy 10.4230/DagSemProc.04421.2
• William Gasarch and Frank Stephan Finding Isolated Cliques by Queries – An Approach to Fault Diagnosis with Many Faults 10.4230/DagSemProc.04421.3
• Judy Goldsmith Preferences and Domination 10.4230/DagSemProc.04421.4
• Beatrice List, Markus Maucher, Uwe Schöning, and Rainer Schuler Randomized QuickSort and the Entropy of the Random Source 10.4230/DagSemProc.04421.5
• William Gasarch, James Glenn, and Andre Utis The communication complexity of the Exact-N Problem revisited 10.4230/DagSemProc.04421.6