Table of Contents

• Committees [doi]
• Awards [doi]
• Preface [doi]
• On the Ring Isomorphism and Automorphism ProblemsNeeraj Kayal, Nitin Saxena. 2-12 [doi]
• Bounded Color Multiplicity Graph Isomorphism is in the #L HierarchyVikraman Arvind, Piyush P. Kurur, T. C. Vijayaraghavan. 13-27 [doi]
• The Complexity of the Inertia and Some Closure Properties of GapLThanh Minh Hoang, Thomas Thierauf. 28-37 [doi]
• Better Time-Space Lower Bounds for SAT and Related ProblemsRyan Williams. 40-49 [doi]
• A Direct Sum Theorem for Corruption and the Multiparty NOF Communication Complexity of Set DisjointnessPaul Beame, Toniann Pitassi, Nathan Segerlind, Avi Wigderson. 52-66 [doi]
• Monotone Circuits for Weighted Threshold FunctionsAmos Beimel, Enav Weinreb. 67-75 [doi]
• The Quantum Adversary Method and Classical Formula Size Lower BoundsSophie Laplante, Troy Lee, Mario Szegedy. 76-90 [doi]
• More on Noncommutative Polynomial Identity TestingAndrej Bogdanov, Hoeteck Wee. 92-99 [doi]
• New Results on the Complexity of the Middle Bit of MultiplicationIngo Wegener, Philipp Woelfel. 100-110 [doi]
• On the Fourier Spectrum of Symmetric Boolean Functions with Applications to Learning Symmetric JuntasRichard J. Lipton, Evangelos Markakis, Aranyak Mehta, Nisheeth K. Vishnoi. 112-119 [doi]
• Short PCPs Verifiable in Polylogarithmic TimeEli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan. 120-134 [doi]
• Tolerant Versus Intolerant Testing for Boolean PropertiesEldar Fischer, Lance Fortnow. 135-140 [doi]
• On the Hardness of Approximating Multicut and Sparsest-CutShuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuval Rabani, D. Sivakumar. 144-153 [doi]
• Hardness of Max 3SAT with No Mixed ClausesVenkatesan Guruswami, Subhash Khot. 154-162 [doi]
• On the Sensitivity of Cyclically-Invariant Boolean FunctionsSourav Chakraborty. 163-167 [doi]
• On the Complexity of Hardness AmplificationChi-Jen Lu, Shi-Chun Tsai, Hsin-Lung Wu. 170-182 [doi]
• On Constructing Parallel Pseudorandom Generators from One-Way FunctionsEmanuele Viola. 183-197 [doi]
• Pseudorandom Bits for Constant Depth Circuits with Few Arbitrary Symmetric GatesEmanuele Viola. 198-209 [doi]
• Pseudorandomness for Approximate Counting and SamplingRonen Shaltiel, Christopher Umans. 212-226 [doi]
• NP with Small AdviceLance Fortnow, Adam R. Klivans. 228-234 [doi]
• Average-Case Computations - Comparing AvgP, HP, and Nearly-PArfst Nickelsen, Birgit Schelm. 235-242 [doi]
• If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard InstancesDan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma. 243-257 [doi]
• Computationally Private Randomizing Polynomials and Their ApplicationsBenny Applebaum, Yuval Ishai, Eyal Kushilevitz. 260-274 [doi]
• A Geometric Approach to Information-Theoretic Private Information RetrievalDavid P. Woodruff, Sergey Yekhanin. 275-284 [doi]
• Prior Entanglement, Message Compression and Privacy in Quantum CommunicationRahul Jain, Jaikumar Radhakrishnan, Pranab Sen. 285-296 [doi]
• Topology Inside NC¹Eric Allender, Samir Datta, Sambuddha Roy. 298-307 [doi]
• Toward a Model for Backtracking and Dynamic ProgrammingMichael Alekhnovich, Allan Borodin, Joshua Buresh-Oppenheim, Russell Impagliazzo, Avner Magen, Toniann Pitassi. 308-322 [doi]
• On the Complexity of Succinct Zero-Sum GamesLance Fortnow, Russell Impagliazzo, Valentine Kabanets, Christopher Umans. 323-332 [doi]
• Upper Bounds for Quantum Interactive Proofs with Competing ProversGus Gutoski. 334-343 [doi]
• On the Hardness of Distinguishing Mixed-State Quantum ComputationsBill Rosgen. 344-354 [doi]