Dagstuhl Seminar Proceedings, Volume 6111,

• Matthias Krause, Pavel Pudlák, Rüdiger Reischuk, and Dieter van Melkebeek 06111 Abstracts Collection – Complexity of Boolean Functions 10.4230/DagSemProc.06111.1
• Matthias Krause, Dieter van Melkebeek, Pavel Pudlák, and Rüdiger Reischuk 06111 Executive Summary – Complexity of Boolean Functions 10.4230/DagSemProc.06111.2
• Dieter van Melkebeek and Konstantin Pervyshev A Generic Time Hierarchy for Semantic Models With One Bit of Advice 10.4230/DagSemProc.06111.3
• Jan Arpe and Bodo Manthey Approximability of Minimum AND-Circuits 10.4230/DagSemProc.06111.4
• Igor E. Shparlinski Bounds on the Fourier Coefficients of the Weighted Sum Function 10.4230/DagSemProc.06111.5
• Andreas Jakoby and Till Tantau Computing Shortest Paths in Series-Parallel Graphs in Logarithmic Space 10.4230/DagSemProc.06111.6
• Marcin Gomulkiewicz, Miroslaw Kutylowski, and Pawel Wlaz Fault Jumping Attacks against Shrinking Generator 10.4230/DagSemProc.06111.7
• Stasys Jukna Graphs and Circuits: Some Further Remarks 10.4230/DagSemProc.06111.8
• Jeff Ford and Anna Gál Hadamard Tensors and Lower Bounds on Multiparty Communication Complexity 10.4230/DagSemProc.06111.9
• Anna Gál, Pierre McKenzie, and Michal Koucký Incremental branching programs 10.4230/DagSemProc.06111.10
• Emanuele Viola On Probabilistic Time versus Alternating Time 10.4230/DagSemProc.06111.11
• Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, and Peter Bro Miltersen On the Complexity of Numerical Analysis 10.4230/DagSemProc.06111.12
• Frank J. Balbach and Thomas Zeugmann On the Teachability of Randomized Learners 10.4230/DagSemProc.06111.13
• Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, and Shigeru Yamashita Quantum Network Coding 10.4230/DagSemProc.06111.14
• Martin Sauerhoff Quantum vs. Classical Read-Once Branching Programs 10.4230/DagSemProc.06111.15
• Eike Kiltz and Enav Weinreb Secure Linear Algebra Using Linearly Recurrent Sequences 10.4230/DagSemProc.06111.16
• Anna Gál and Peter Bro Miltersen The Cell Probe Complexity of Succinct Data Structures 10.4230/DagSemProc.06111.17
• Claude Carlet The complexity of Boolean functions from cryptographic viewpoint 10.4230/DagSemProc.06111.18
• Alexander E. Andreev The optimal sequence compression 10.4230/DagSemProc.06111.19
• Scott Diehl and Dieter van Melkebeek Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines 10.4230/DagSemProc.06111.20
• Andreas Jakoby, Maciej Liskiewicz, and Aleksander Madry Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment 10.4230/DagSemProc.06111.21
• Alexander E. Andreev and Stasys Jukna Very Large Cliques are Easy to Detect 10.4230/DagSemProc.06111.22