| 0 | -- | 0 | Yijia Chen, Jörg Flum, Moritz Müller. Lower Bounds for Kernelizations |
| 0 | -- | 0 | Felix Brandt, Felix A. Fischer, Markus Holzer. Equilibria of Graphical Games with Symmetries |
| 0 | -- | 0 | Paul Valiant. Testing Symmetric Properties of Distributions |
| 0 | -- | 0 | Jeff Kinne, Dieter van Melkebeek. Space Hierarchy Results for Randomized and Other Semantic Models |
| 0 | -- | 0 | Craig Gentry, Chris Peikert, Vinod Vaikuntanathan. Trapdoors for Hard Lattices and New Cryptographic Constructions |
| 0 | -- | 0 | Emanuele Viola. The sum of d small-bias generators fools polynomials of degree d |
| 0 | -- | 0 | Satyen Kale. Boosting and hard-core set constructions: a simplified approach |
| 0 | -- | 0 | Ronen Shaltiel, Emanuele Viola. Hardness amplification proofs require majority |
| 0 | -- | 0 | Jeffrey C. Jackson, Homin K. Lee, Rocco A. Servedio, Andrew Wan. Learning Random Monotone DNF |
| 0 | -- | 0 | Kevin Matulef, Ryan O Donnell, Ronitt Rubinfeld, Rocco A. Servedio. Testing Halfspaces |
| 0 | -- | 0 | Arie Matsliah, Eli Ben-Sasson, Prahladh Harsha, Oded Lachish. Sound 3-query PCPPs are Long |
| 0 | -- | 0 | Nathan Segerlind. On the relative efficiency of resolution-like proofs and ordered binary decision diagram proofs |
| 0 | -- | 0 | Ali Juma, Valentine Kabanets, Charles Rackoff, Amir Shpilka. The black-box query complexity of polynomial summation |
| 0 | -- | 0 | Nitin Saxena. Diagonal Circuit Identity Testing and Lower Bounds |
| 0 | -- | 0 | Shachar Lovett, Roy Meshulam, Alex Samorodnitsky. Inverse Conjecture for the Gowers norm is false |
| 0 | -- | 0 | Zeev Dvir, Amir Shpilka. Towards Dimension Expanders Over Finite Fields |
| 0 | -- | 0 | Zeev Dvir, Amir Shpilka, Amir Yehudayoff. Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits |
| 0 | -- | 0 | . Improved approximation algorithms for directed Steiner forest |
| 0 | -- | 0 | Piotr Berman, Bhaskar DasGupta, Marek Karpinski. Approximating Transitive Reductions for Directed Networks |
| 0 | -- | 0 | Asaf Nachmias, Asaf Shapira. Testing the Expansion of a Graph |
| 0 | -- | 0 | Edward A. Hirsch, Dmitry Itsykson. An infinitely-often one-way function based on an average-case assumption |
| 0 | -- | 0 | Alexander A. Sherstov. Approximate Inclusion-Exclusion for Arbitrary Symmetric Functions |
| 0 | -- | 0 | Or Meir. Combinatorial Construction of Locally Testable Codes |
| 0 | -- | 0 | Jakob Nordström. A Simplified Way of Proving Trade-off Results for Resolution |
| 0 | -- | 0 | Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar, Lisa Zhang. Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs |
| 0 | -- | 0 | Alexander A. Sherstov. Unbounded-Error Communication Complexity of Symmetric Functions |
| 0 | -- | 0 | Tali Kaufman, Madhu Sudan. Algebraic Property Testing: The Role of Invariance |
| 0 | -- | 0 | Beate Bollig. The Optimal Read-Once Branching Program Complexity for the Direct Storage Access Function |
| 0 | -- | 0 | Venkatesan Guruswami, Atri Rudra. Better Binary List-Decodable Codes via Multilevel Concatenation |
| 0 | -- | 0 | Moses Charikar, Konstantin Makarychev, Yury Makarychev. Local Global Tradeoffs in Metric Embeddings |
| 0 | -- | 0 | Nathan Segerlind, Toniann Pitassi. Exponential lower bounds and integrality gaps for tree-like Lovasz-Schrijver procedures |
| 0 | -- | 0 | Yijia Chen, Martin Grohe, Magdalena Grüber. On Parameterized Approximability |
| 0 | -- | 0 | Jelani Nelson. A Note on Set Cover Inapproximability Independent of Universe Size |
| 0 | -- | 0 | Moses Charikar, Konstantin Makarychev, Yury Makarychev. On the Advantage over Random for Maximum Acyclic Subgraph |
| 0 | -- | 0 | Emanuele Viola. Selected Results in Additive Combinatorics: An Exposition |
| 0 | -- | 0 | Andrej Bogdanov, Muli Safra. Hardness amplification for errorless heuristics |
| 0 | -- | 0 | Patrick Briest, Martin Hoefer, Piotr Krysta. Stackelberg Network Pricing Games |
| 0 | -- | 0 | Alexander A. Sherstov. The Pattern Matrix Method for Lower Bounds on Quantum Communication |
| 0 | -- | 0 | Dieter van Melkebeek. A Survey of Lower Bounds for Satisfiability and Related Problems |
| 0 | -- | 0 | Tali Kaufman, Simon Litsyn, Ning Xie. Breaking the /epsilon -Soundness Bound of the Linearity Test over GF(2) |
| 0 | -- | 0 | Miklós Ajtai, Cynthia Dwork. The First and Fourth Public-Key Cryptosystems with Worst-Case/Average-Case Equivalence. |
| 0 | -- | 0 | Lance Fortnow, Rahul Santhanam. Infeasibility of Instance Compression and Succinct PCPs for NP |
| 0 | -- | 0 | Vikraman Arvind, Partha Mukhopadhyay. The Ideal Membership Problem and Polynomial Identity Testing |
| 0 | -- | 0 | Christian Glasser, Heinz Schmitz, Victor L. Selivanov. Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages |
| 0 | -- | 0 | Andrei A. Bulatov. The complexity of the counting constraint satisfaction problem |
| 0 | -- | 0 | Piotr Berman, Bhaskar DasGupta. Approximating the Online Set Multicover Problems Via Randomized Winnowing |
| 0 | -- | 0 | Martin Grohe. Logic, Graphs, and Algorithms |
| 0 | -- | 0 | Shachar Lovett. Tight lower bounds for adaptive linearity tests |
| 0 | -- | 0 | Parikshit Gopalan, Venkatesan Guruswami. Deterministic Hardness Amplification via Local GMD Decoding |
| 0 | -- | 0 | Elad Hazan, C. Seshadhri. Adaptive Algorithms for Online Decision Problems |
| 0 | -- | 0 | Nutan Limaye, Meena Mahajan, B. V. Raghavendra Rao. Arithmetizing classes around NC^1 and L |
| 0 | -- | 0 | Venkatesan Guruswami, James R. Lee, Alexander A. Razborov. Almost Euclidean subspaces of /ell_1^N via expander codes |
| 0 | -- | 0 | Ran Raz, Amir Yehudayoff. Multilinear Formulas, Maximal-Partition Discrepancy and Mixed-Sources Extractors |
| 0 | -- | 0 | Brendan Juba, Madhu Sudan. Universal Semantic Communication I |
| 0 | -- | 0 | Artur Czumaj, Asaf Shapira, Christian Sohler. Testing Hereditary Properties of Non-Expanding Bounded-Degree Graphs |
| 0 | -- | 0 | Christian Borgs, Jennifer T. Chayes, Nicole Immorlica, Adam Kalai, Vahab S. Mirrokni, Christos H. Papadimitriou. The Myth of the Folk Theorem |
| 0 | -- | 0 | Andrej Bogdanov, Emanuele Viola. Pseudorandom bits for polynomials |
| 0 | -- | 0 | Chris Peikert, Brent Waters. Lossy Trapdoor Functions and Their Applications |
| 0 | -- | 0 | Emanuele Viola, Avi Wigderson. One-way multi-party communication lower bound for pointer jumping with applications |
| 0 | -- | 0 | Ran Raz, Iddo Tzameret. Resolution over Linear Equations and Multilinear Proofs |
| 0 | -- | 0 | Ilias Diakonikolas, Homin K. Lee, Kevin Matulef, Krzysztof Onak, Ronitt Rubinfeld, Rocco A. Servedio, Andrew Wan. Testing for Concise Representations |
| 0 | -- | 0 | Satyen Kale, C. Seshadhri. Testing Expansion in Bounded Degree Graphs |
| 0 | -- | 0 | Shachar Lovett. Unconditional pseudorandom generators for low degree polynomials |
| 0 | -- | 0 | Dmitry Gavinsky, Pavel Pudlák. Exponential Separation of Quantum and Classical Non-Interactive Multi-Party Communication Complexity |
| 0 | -- | 0 | Parikshit Gopalan, Subhash Khot, Rishi Saket. Hardness of Reconstructing Multivariate Polynomials over Finite Fields |
| 0 | -- | 0 | Alexander A. Sherstov. Communication Complexity under Product and Nonproduct Distributions |
| 0 | -- | 0 | Jacobo Torán. Reductions to Graph Isomorphism |
| 0 | -- | 0 | Nir Ailon, Edo Liberty. Fast Dimension Reduction Using Rademacher Series on Dual BCH Codes |
| 0 | -- | 0 | Ronen Shaltiel, Christopher Umans. Low-end uniform hardness vs. randomness tradeoffs for AM |
| 0 | -- | 0 | Thomas Thierauf, Fabian Wagner. The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace |
| 0 | -- | 0 | Paul G. Spirakis, Haralampos Tsaknakis. Computing 1/3-approximate Nash equilibria of bimatrix games in polynomial time. |
| 0 | -- | 0 | Christian Hundt, Maciej Liskiewicz. A Combinatorial Geometric Approach to Linear Image Matching |
| 0 | -- | 0 | Jonathan Katz. Which Languages Have 4-Round Zero-Knowledge Proofs? |
| 0 | -- | 0 | Rahul Jain, Hartmut Klauck, Ashwin Nayak. Direct Product Theorems for Communication Complexity via Subdistribution Bounds |
| 0 | -- | 0 | Tomás Feder, Carlos S. Subi. Nearly Tight Bounds on the Number of Hamiltonian Circuits of the Hypercube and Generalizations |
| 0 | -- | 0 | Oded Goldreich, Or Meir. The Tensor Product of Two Good Codes Is Not Necessarily Robustly Testable |
| 0 | -- | 0 | Or Meir. On the Rectangle Method in proofs of Robustness of Tensor Products |
| 0 | -- | 0 | Tali Kaufman, Madhu Sudan. Sparse Random Linear Codes are Locally Decodable and Testable |
| 0 | -- | 0 | Shankar Kalyanaraman, Christopher Umans. Algorithms for Playing Games with Limited Randomness |
| 0 | -- | 0 | Dmitry Gavinsky. Classical Interaction Cannot Replace a Quantum Message |
| 0 | -- | 0 | Oded Goldreich. On the Average-Case Complexity of Property Testing |
| 0 | -- | 0 | Zeev Dvir, Ariel Gabizon, Avi Wigderson. Extractors and Rank Extractors for Polynomial Sources |
| 0 | -- | 0 | Oliver Kullmann. Constraint satisfaction problems in clausal form: Autarkies and minimal unsatisfiability |
| 0 | -- | 0 | Shirley Halevy, Oded Lachish, Ilan Newman, Dekel Tsur. Testing Properties of Constraint-Graphs |
| 0 | -- | 0 | Jens Groth, Amit Sahai. Efficient Non-interactive Proof Systems for Bilinear Groups |
| 0 | -- | 0 | Li Chen, Bin Fu. Linear and Sublinear Time Algorithms for the Basis of Abelian Groups |
| 0 | -- | 0 | Pilar Albert, Elvira Mayordomo, Philippe Moser. Bounded Pushdown dimension vs Lempel Ziv information density |
| 0 | -- | 0 | Arkadev Chattopadhyay. Discrepancy and the power of bottom fan-in in depth-three circuits |
| 0 | -- | 0 | Beate Bollig, Niko Range, Ingo Wegener. Exact OBDD Bounds for some Fundamental Functions |
| 0 | -- | 0 | Alexandr Andoni, Piotr Indyk, Robert Krauthgamer. Earth Mover Distance over High-Dimensional Spaces |
| 0 | -- | 0 | Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, Guy N. Rothblum. A (De)constructive Approach to Program Checking |
| 0 | -- | 0 | Philipp Hertel, Toniann Pitassi. An Exponential Time/Space Speedup For Resolution |
| 0 | -- | 0 | Heribert Vollmer. The complexity of deciding if a Boolean function can be computed by circuits over a restricted basis |
| 0 | -- | 0 | Philipp Hertel, Toniann Pitassi. Black-White Pebbling is PSPACE-Complete |
| 0 | -- | 0 | Uriel Feige, Guy Kindler, Ryan O Donnell. Understanding Parallel Repetition Requires Understanding Foams |
| 0 | -- | 0 | Zohar Shay Karnin, Amir Shpilka. Black Box Polynomial Identity Testing of Depth-3 Arithmetic Circuits with Bounded Top Fan-in |
| 0 | -- | 0 | Nicola Galesi, Massimo Lauria. Extending Polynomial Calculus to k -DNF Resolution |
| 0 | -- | 0 | Kiran S. Kedlaya, Sergey Yekhanin. Locally Decodable Codes From Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers |
| 0 | -- | 0 | Bodo Manthey, Till Tantau. Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise |
| 0 | -- | 0 | Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev. Finding Collisions in Interactive Protocols -- A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments |
| 0 | -- | 0 | Leonid Gurvits. Polynomial time algorithms to approximate mixed volumes within a simply exponential factor |
| 0 | -- | 0 | Ryan Williams. Time-Space Tradeoffs for Counting NP Solutions Modulo Integers |
| 0 | -- | 0 | Mark Braverman, Raghav Kulkarni, Sambuddha Roy. Parity Problems in Planar Graphs |
| 0 | -- | 0 | Anup Rao. An Exposition of Bourgain s 2-Source Extractor |
| 0 | -- | 0 | Michael Navon, Alex Samorodnitsky. Linear programming bounds for codes via a covering argument |
| 0 | -- | 0 | Pavel Pudlák. Quantum deduction rules |
| 0 | -- | 0 | Yael Tauman Kalai, Ran Raz. Interactive PCP |
| 0 | -- | 0 | Kai-Min Chung, Omer Reingold, Salil P. Vadhan. S-T Connectivity on Digraphs with a Known Stationary Distribution |
| 0 | -- | 0 | Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto. A Dichotomy Theorem within Schaefer for the Boolean Connectivity Problem |
| 0 | -- | 0 | Daniel Sawitzki. Implicit Simulation of FNC Algorithms |
| 0 | -- | 0 | Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt. Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models |
| 0 | -- | 0 | Dana Moshkovitz, Ran Raz. Sub-Constant Error Probabilistically Checkable Proof of Almost Linear Size |
| 0 | -- | 0 | Benoit Larose, Pascal Tesson. Universal Algebra and Hardness Results for Constraint Satisfaction Problems |
| 0 | -- | 0 | László Egri, Benoit Larose, Pascal Tesson. Symmetric Datalog and Constraint Satisfaction Problems in Logspace |
| 0 | -- | 0 | Heribert Vollmer, Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor. The Complexity of Problems for Quantified Constraints |
| 0 | -- | 0 | Rafail Ostrovsky, William E. Skeith III. Algebraic Lower Bounds for Computing on Encrypted Data |
| 0 | -- | 0 | Brett Hemenway, Rafail Ostrovsky. Public Key Encryption Which is Simultaneously a Locally-Decodable Error-Correcting Code |
| 0 | -- | 0 | Jin-yi Cai, Pinyan Lu. Holographic Algorithms: The Power of Dimensionality Resolved |
| 0 | -- | 0 | Jin-yi Cai, Pinyan Lu. On Block-wise Symmetric Signatures for Matchgates |
| 0 | -- | 0 | Christian Glaßer, Alan L. Selman, Liyu Zhang. The Informational Content of Canonical Disjoint NP-Pairs |
| 0 | -- | 0 | Ashish Rastogi, Richard Cole. Indivisible Markets with Good Approximate EquilibriumPrices |
| 0 | -- | 0 | Prasad Raghavendra. A Note on Yekhanin s Locally Decodable Codes |
| 0 | -- | 0 | Oded Goldreich, Or Sheffet. On the randomness complexity of property testing |
| 0 | -- | 0 | Amit Chakrabarti. Lower Bounds for Multi-Player Pointer Jumping |
| 0 | -- | 0 | Andris Ambainis, Joseph Emerson. Quantum t-designs: t-wise independence in the quantum world |
| 0 | -- | 0 | Shachar Lovett, Sasha Sodin. Almost Euclidean sections of the N-dimensional cross-polytope using O(N) random bits |
| 0 | -- | 0 | Bodo Manthey. On Approximating Restricted Cycle Covers |
| 0 | -- | 0 | Arist Kojevnikov. Improved Lower Bounds for Resolution over Linear Inequalities |
| 0 | -- | 0 | Nathan Segerlind. Nearly-Exponential Size Lower Bounds for Symbolic Quantifier Elimination Algorithms and OBDD-Based Proofs of Unsatisfiability |
| 0 | -- | 0 | Philipp Weis, Neil Immerman. Structure Theorem and Strict Alternation Hierarchy for FO^2 on Words |
| 0 | -- | 0 | Jan Krajícek. An exponential lower bound for a constraint propagation proof system based on ordered binary decision diagrams |
| 0 | -- | 0 | David P. Woodruff. New Lower Bounds for General Locally Decodable Codes |
| 0 | -- | 0 | Rahul Santhanam. Circuit Lower Bounds for Merlin-Arthur Classes |
| 0 | -- | 0 | Lance Fortnow, Rahul Santhanam. Time Hierarchies: A Survey |
| 0 | -- | 0 | Jin-yi Cai, Pinyan Lu. Bases Collapse in Holographic Algorithms |
| 0 | -- | 0 | Moti Yung, Yunlei Zhao. Concurrent Knowledge-Extraction in the Public-Key Model |
| 0 | -- | 0 | Stefan S. Dantchev, Barnaby Martin, Stefan Szeider. Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution |