Dagstuhl Seminar Proceedings, Volume 9421,

• Manindra Agrawal, Lance Fortnow, Thomas Thierauf, and Christopher Umans 09421 Abstracts Collection – Algebraic Methods in Computational Complexity 10.4230/DagSemProc.09421.1
• Manindra Agrawal, Lance Fortnow, Thomas Thierauf, and Christopher Umans 09421 Executive Summary – Algebraic Methods in Computational Complexity 10.4230/DagSemProc.09421.2
• Russell Impagliazzo, Valentine Kabanets, and Antonina Kolokolova An Axiomatic Approach to Algebrization 10.4230/DagSemProc.09421.3
• Noga Alon, Rina Panigrahy, and Sergey Yekhanin Deterministic approximation algorithms for the nearest codeword problem 10.4230/DagSemProc.09421.4
• Harry Buhrman, David Garcia-Soriano, and Arie Matsliah Learning Parities in the Mistake-Bound model 10.4230/DagSemProc.09421.5
• Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, and Fabian Wagner Planar Graph Isomorphism is in Log-Space 10.4230/DagSemProc.09421.6
• Meena Mahajan and Raghavendra Rao B. V. Small space analogues of Valiant's classes and the limitations of skew formula 10.4230/DagSemProc.09421.7
• Harry Buhrman, Lance Fortnow, and Rahul Santhanam Unconditional Lower Bounds against Advice 10.4230/DagSemProc.09421.8