Dagstuhl Seminar Proceedings, Volume 8381,

• Peter Bro Miltersen, Rüdiger Reischuk, Georg Schnitger, and Dieter van Melkebeek 08381 Abstracts Collection – Computational Complexity of Discrete Problems 10.4230/DagSemProc.08381.1
• Peter Bro Miltersen, Rüdiger Reischuk, Georg Schnitger, and Dieter van Melkebeek 08381 Executive Summary – Computational Complexity of Discrete Problems 10.4230/DagSemProc.08381.2
• Troy Lee and Adi Shraibman Approximation norms and duality for communication complexity lower bounds 10.4230/DagSemProc.08381.3
• Kristoffer Arnsfelt Hansen Depth Reduction for Circuits with a Single Layer of Modular Counting Gates 10.4230/DagSemProc.08381.4
• Kiran Kedlaya and Christopher Umans Fast polynomial factorization and modular composition 10.4230/DagSemProc.08381.5
• Eli Ben-Sasson and Jakob Nordström Understanding space in resolution: optimal lower bounds and exponential trade-offs 10.4230/DagSemProc.08381.6