| 0 | -- | 0 | Shachar Lovett, Tali Kaufman. The List-Decoding Size of Reed-Muller Codes |
| 0 | -- | 0 | Chris Calabro. A Lower Bound on the Size of Series-Parallel Graphs Dense in Long Paths |
| 0 | -- | 0 | Marc Kaplan, Sophie Laplante. Kolmogorov complexity and combinatorial methods in communication complexity |
| 0 | -- | 0 | Nitin Saxena, C. Seshadhri. An Almost Optimal Rank Bound for Depth-3 Identities |
| 0 | -- | 0 | Zenon Sadowski. Optimal Proof Systems and Complete Languages |
| 0 | -- | 0 | Jack H. Lutz. A Divergence Formula for Randomness and Dimension |
| 0 | -- | 0 | Parikshit Gopalan, Venkatesan Guruswami, Prasad Raghavendra. List Decoding Tensor Products and Interleaved Codes |
| 0 | -- | 0 | Madhur Tulsiani. CSP Gaps and Reductions in the Lasserre Hierarchy |
| 0 | -- | 0 | Luca Trevisan, Madhur Tulsiani, Salil P. Vadhan. Regularity, Boosting, and Efficiently Simulating Every High-Entropy Distribution |
| 0 | -- | 0 | Adi Akavia. Finding Significant Fourier Transform Coefficients Deterministically and Locally |
| 0 | -- | 0 | Marek Karpinski, Warren Schudy. Linear Time Approximation Schemes for the Gale-Berlekamp Game and Related Minimization Problems |
| 0 | -- | 0 | Chris Peikert. Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem |
| 0 | -- | 0 | Gábor Ivanyos, Marek Karpinski, Lajos Rónyai, Nitin Saxena. Trading GRH for algebra: algorithms for factoring polynomials and related structures |
| 0 | -- | 0 | Victor Chen. A Hypergraph Dictatorship Test with Perfect Completeness |
| 0 | -- | 0 | Oded Goldreich, Michael Krivelevich, Ilan Newman, Eyal Rozenberg. Hierarchy Theorems for Property Testing |
| 0 | -- | 0 | Andrew Drucker. Multitask Efficiencies in the Decision Tree Model |
| 0 | -- | 0 | Brendan Juba, Madhu Sudan. Universal Semantic Communication II: A Theory of Goal-Oriented Communication |
| 0 | -- | 0 | Piotr Berman, Marek Karpinski, Alexander Zelikovsky. 1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two |
| 0 | -- | 0 | Cristopher Moore, Alexander Russell. A simple constant-probability RP reduction from NP to Parity P |
| 0 | -- | 0 | Scott Aaronson, John Watrous. Closed Timelike Curves Make Quantum and Classical Computing Equivalent |
| 0 | -- | 0 | Vitaly Feldman. On The Power of Membership Queries in Agnostic Learning |
| 0 | -- | 0 | Ulrich Schöpp, Martin Hofmann. Pointer Programs and Undirected Reachability |
| 0 | -- | 0 | Noam Berger, Nevin Kapur, Leonard J. Schulman, Vijay V. Vazirani. Solvency Games |
| 0 | -- | 0 | Arnab Bhattacharyya, Victor Chen, Madhu Sudan, Ning Xie. Testing Linear-Invariant Non-Linear Properties |
| 0 | -- | 0 | Tomás Feder, Carlos S. Subi. Nearly Tight Bounds on the Number of Hamiltonian Circuits of the Hypercube and Generalizations (revised) |
| 0 | -- | 0 | Vikraman Arvind, Partha Mukhopadhyay. Quantum Query Complexity of Multilinear Identity Testing |
| 0 | -- | 0 | Farid M. Ablayev, Airat Khasianov, Alexander Vasiliev. On Complexity of Quantum Branching Programs Computing Equality-like Boolean Functions |
| 0 | -- | 0 | Sanjeeb Dash. On the complexity of cutting plane proofs using split cuts |
| 0 | -- | 0 | Yijia Chen, Jörg Flum. A logic for PTIME and a parameterized halting problem |
| 0 | -- | 0 | Paul Beame, Dang-Trinh Huynh-Ngoc. Multiparty Communication Complexity and Threshold Circuit Size of AC^0 |
| 0 | -- | 0 | Alexander A. Razborov. A simple proof of Bazzi s theorem |
| 0 | -- | 0 | Ido Ben-Eliezer, Rani Hod, Shachar Lovett. Random low degree polynomials are hard to approximate |
| 0 | -- | 0 | Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Avi Wigderson. Uniform Direct-Product Theorems: Simplified, Optimized, and Derandomized |
| 0 | -- | 0 | Debajyoti Bera, Stephen A. Fenner, Frederic Green, Steven Homer. Universal Quantum Circuits |
| 0 | -- | 0 | Felix Brandt, Felix A. Fischer, Markus Holzer. On Iterated Dominance, Matrix Elimination, and Matched Paths |
| 0 | -- | 0 | Ryan Williams. Non-Linear Time Lower Bound for (Succinct) Quantified Boolean Formulas |
| 0 | -- | 0 | Olaf Beyersdorff, Johannes Köbler, Sebastian Müller. Nondeterministic Instance Complexity and Proof Systems with Advice |
| 0 | -- | 0 | Neeraj Kayal, Timur Nezhmetdinov. Factoring groups efficiently |
| 0 | -- | 0 | Dmitry Itsykson. Structural complexity of AvgBPP |
| 0 | -- | 0 | Shachar Lovett, Tali Kaufman. Worst case to Average case reductions for polynomials |
| 0 | -- | 0 | Dana Moshkovitz, Ran Raz. Two Query PCP with Sub-Constant Error |
| 0 | -- | 0 | Klim Efremenko. 3-Query Locally Decodable Codes of Subexponential Length |
| 0 | -- | 0 | Lior Malka. Instance-Dependent Commitment Schemes and the Round Complexity of Perfect Zero-Knowledge Proofs |
| 0 | -- | 0 | Scott Aaronson. On Perfect Completeness for QMA |
| 0 | -- | 0 | Noga Alon, Shai Gutner. Kernels for the Dominating Set Problem on Graphs with an Excluded Minor |
| 0 | -- | 0 | Noga Alon, Rina Panigrahy, Sergey Yekhanin. Deterministic Approximation Algorithms for the Nearest Codeword Problem |
| 0 | -- | 0 | Or Meir. On the Efficiency of Non-Uniform PCPP Verifiers |
| 0 | -- | 0 | Moritz Müller. Valiant-Vazirani Lemmata for Various Logics |
| 0 | -- | 0 | Manindra Agrawal, V. Vinay. Arithmetic Circuits: A Chasm at Depth Four |
| 0 | -- | 0 | Paul Beame, Dang-Trinh Huynh-Ngoc. Multiparty Communication Complexity of AC^0 |
| 0 | -- | 0 | James R. Lee, Prasad Raghavendra. Coarse Differentiation and Multi-flows in Planar Graphs |
| 0 | -- | 0 | Farid M. Ablayev, Alexander Vasiliev. On the Computation of Boolean Functions by Quantum Branching Programs via Fingerprinting |
| 0 | -- | 0 | Zeev Dvir, Avi Wigderson. Kakeya sets, new mergers and old extractors |
| 0 | -- | 0 | Alexander A. Sherstov. Communication Lower Bounds Using Dual Polynomials |
| 0 | -- | 0 | Beate Bollig. On the OBDD complexity of the most significant bit of integer multiplication |
| 0 | -- | 0 | Ryan O Donnell. Some Topics in Analysis of Boolean Functions |
| 0 | -- | 0 | Venkatesan Guruswami, Atri Rudra. Concatenated codes can achieve list-decoding capacity |
| 0 | -- | 0 | Stephen A. Fenner, William I. Gasarch, Brian Postow. The complexity of learning SUBSEQ(A) |
| 0 | -- | 0 | Vikraman Arvind, T. C. Vijayaraghavan. The Orbit problem is in the GapL Hierarchy |
| 0 | -- | 0 | Scott Aaronson, Salman Beigi, Andrew Drucker, Bill Fefferman, Peter W. Shor. The Power of Unentanglement |
| 0 | -- | 0 | Manoj Prabhakaran, Mike Rosulek. Cryptographic Complexity of Multi-party Computation Problems: Classifications and Separations |
| 0 | -- | 0 | Vikraman Arvind, Partha Mukhopadhyay. Derandomizing the Isolation Lemma and Lower Bounds for Noncommutative Circuit Size |
| 0 | -- | 0 | Meena Mahajan, B. V. Raghavendra Rao. Arithmetic circuits, syntactic multilinearity, and the limitations of skew formulae |
| 0 | -- | 0 | Vijay V. Vazirani, Wang Lei. Continuity Properties of Equilibria in Some Fisher and Arrow-Debreu Market Models |
| 0 | -- | 0 | Nikhil R. Devanur, Lance Fortnow. A Computational Theory of Awareness and Decision Making |
| 0 | -- | 0 | Omer Reingold, Luca Trevisan, Madhur Tulsiani, Salil P. Vadhan. Dense Subsets of Pseudorandom Sets |
| 0 | -- | 0 | Miki Hermann, Reinhard Pichler. Complexity of Counting the Optimal Solutions |
| 0 | -- | 0 | Gábor Ivanyos, Marek Karpinski, Nitin Saxena. Schemes for Deterministic Polynomial Factoring |
| 0 | -- | 0 | Zeev Dvir. Deterministic Extractors for Algebraic Sources |
| 0 | -- | 0 | Oded Goldreich, Dana Ron. On Proximity Oblivious Testing |
| 0 | -- | 0 | Sourav Chakraborty, László Babai. Property Testing of Equivalence under a Permutation Group Action |
| 0 | -- | 0 | Oded Goldreich, Dana Ron. Algorithmic Aspects of Property Testing in the Dense Graphs Model |
| 0 | -- | 0 | Eric Allender, Michal Koucký. Amplifying Lower Bounds by Means of Self-Reducibility |
| 0 | -- | 0 | Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo. Curves That Must Be Retraced |
| 0 | -- | 0 | Venkatesan Guruswami, Atri Rudra. Soft decoding, dual BCH codes, and better list-decodable eps-biased codes |
| 0 | -- | 0 | James I. Lathrop, Jack H. Lutz, Scott M. Summers. Strict Self-Assembly of Discrete Sierpinski Triangles |
| 0 | -- | 0 | Dan Gutfreund, Guy N. Rothblum. The Complexity of Local List Decoding |
| 0 | -- | 0 | Elena Grigorescu, Tali Kaufman, Madhu Sudan. 2-Transitivity is Insufficient for Local Testability |
| 0 | -- | 0 | Dmitriy Yu. Cherukhin. Lower Bounds for Boolean Circuits with Finite Depth and Arbitrary Gates |
| 0 | -- | 0 | James I. Lathrop, Jack H. Lutz, Matthew J. Patitz, Scott M. Summers. Computability and Complexity in Self-Assembly |
| 0 | -- | 0 | Bruno Durand, Alexander Shen, Andrei E. Romashchenko. Fixed Point and Aperiodic Tilings |
| 0 | -- | 0 | Christian Glaßer, Christian Reitwießner, Victor L. Selivanov. The Shrinking Property for NP and coNP |
| 0 | -- | 0 | Michael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer. The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments |
| 0 | -- | 0 | Till Tantau. Generalizations of the Hartmanis-Immerman-Sewelson Theorem and Applications to Infinite Subsets of P-Selective Sets |
| 0 | -- | 0 | Jakob Nordström, Johan Håstad. Towards an Optimal Separation of Space and Length in Resolution |
| 0 | -- | 0 | Vikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan. New results on Noncommutative and Commutative Polynomial Identity Testing |
| 0 | -- | 0 | Paul Beame, Dang-Trinh Huynh-Ngoc. On the Value of Multiple Read/Write Streams for Approximating Frequency Moments |
| 0 | -- | 0 | Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi. Fast Integer Multiplication using Modular Arithmetic |
| 0 | -- | 0 | Harry Buhrman, John M. Hitchcock. NP-Hard Sets are Exponentially Dense Unless NP is contained in coNP/poly |
| 0 | -- | 0 | Shankar Kalyanaraman, Christopher Umans. The Complexity of Rationalizing Matchings |
| 0 | -- | 0 | Irit Dinur, Elena Grigorescu, Swastik Kopparty, Madhu Sudan. Decodability of Group Homomorphisms beyond the Johnson Bound |
| 0 | -- | 0 | Stasys Jukna. Entropy of operators or why matrix multiplication is hard for small depth circuits |
| 0 | -- | 0 | Ran Raz. A Counterexample to Strong Parallel Repetition |
| 0 | -- | 0 | Dieter van Melkebeek, Thomas Watson. A Quantum Time-Space Lower Bound for the Counting Hierarchy |
| 0 | -- | 0 | Alexander A. Razborov, Alexander A. Sherstov. The Sign-Rank of AC^0 |
| 0 | -- | 0 | Anup Rao. Extractors for Low-Weight Affine Sources |
| 0 | -- | 0 | Matei David, Toniann Pitassi. Separating NOF communication complexity classes RP and NP |
| 0 | -- | 0 | Anup Rao. Parallel Repetition in Projection Games and a Concentration Bound |
| 0 | -- | 0 | Arnab Bhattacharyya. A Note on the Distance to Monotonicity of Boolean Functions |
| 0 | -- | 0 | Kazuo Iwama, Suguru Tamaki. The Complexity of the Hajos Calculus for Planar Graphs |
| 0 | -- | 0 | Itai Benjamini, Oded Schramm, Asaf Shapira. Every Minor-Closed Property of Sparse Graphs is Testable |
| 0 | -- | 0 | Per Austrin, Elchanan Mossel. Approximation Resistant Predicates From Pairwise Independence |
| 0 | -- | 0 | Venkatesan Guruswami, Prasad Raghavendra. Constraint Satisfaction over a Non-Boolean Domain: Approximation algorithms and Unique-Games hardness |
| 0 | -- | 0 | Dan Gutfreund, Salil P. Vadhan. Limitations of Hardness vs. Randomness under Uniform Reductions |
| 0 | -- | 0 | Ran Raz, Amir Yehudayoff. Lower Bounds and Separations for Constant Depth Multilinear Circuits |
| 0 | -- | 0 | Scott Aaronson, Avi Wigderson. Algebrization: A New Barrier in Complexity Theory |
| 0 | -- | 0 | Zeev Dvir, Amir Shpilka. Noisy Interpolating Sets for Low Degree Polynomials |
| 0 | -- | 0 | Troy Lee, Adi Shraibman. Disjointness is hard in the multi-party number-on-the-forehead model |
| 0 | -- | 0 | Arkadev Chattopadhyay, Anil Ada. Multiparty Communication Complexity of Disjointness |
| 0 | -- | 0 | Ran Raz. Elusive Functions and Lower Bounds for Arithmetic Circuits |