| 0 | -- | 0 | Tomás Feder, Phokion G. Kolaitis. Closures and dichotomies for quantified constraints |
| 0 | -- | 0 | Predrag T. Tosic. Computational Complexity of Some Enumeration Problems About Uniformly Sparse Boolean Network Automata |
| 0 | -- | 0 | Gyula Györ. Representing Boolean OR function by quadratic polynomials modulo 6 |
| 0 | -- | 0 | Lance Fortnow, Rahul Santhanam. Fixed-Polynomial Size Circuit Bounds |
| 0 | -- | 0 | Tomás Feder, Rajeev Motwani. Finding large cycles in Hamiltonian graphs |
| 0 | -- | 0 | Wenceslas Fernandez de la Vega, Marek Karpinski. Trading Tensors for Cloning: Constant Time Approximation Schemes for Metric MAX-CSP |
| 0 | -- | 0 | Joshua Buresh-Oppenheim, Valentine Kabanets, Rahul Santhanam. Uniform Hardness Amplification in NP via Monotone Codes |
| 0 | -- | 0 | Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer. The Complexity of Generalized Satisfiability for Linear Temporal Logic |
| 0 | -- | 0 | Konstantinos Georgiou, Avner Magen, Toniann Pitassi, Iannis Tourlakis. Tight integrality gaps for Vertex Cover SDPs in the Lovasz-Schrijver hierarchy |
| 0 | -- | 0 | Prahladh Harsha, Rahul Jain, David A. McAllester, Jaikumar Radhakrishnan. The communication complexity of correlation |
| 0 | -- | 0 | Patrick Briest. Towards Hardness of Envy-Free Pricing |
| 0 | -- | 0 | Lance Fortnow, Rakesh Vohra. The Complexity of Forecast Testing |
| 0 | -- | 0 | Chris Peikert. Limits on the Hardness of Lattice Problems in /ell_p Norms |
| 0 | -- | 0 | Chris Peikert, Alon Rosen. Lattices that Admit Logarithmic Worst-Case to Average-Case Connection Factors |
| 0 | -- | 0 | Christoph Buchheim, Peter J. Cameron, Taoyang Wu. On the Subgroup Distance Problem |
| 0 | -- | 0 | Jin-yi Cai, Pinyan Lu. Holographic Algorithms: From Art to Science |
| 0 | -- | 0 | Claire Kenyon-Mathieu, Warren Schudy. How to rank with few errors: A PTAS for Weighted Feedback Arc Set on Tournaments |
| 0 | -- | 0 | Frank Neumann, Carsten Witt. Ant Colony Optimization and the Minimum Spanning Tree Problem |
| 0 | -- | 0 | Olaf Beyersdorff. On the Deduction Theorem and Complete Disjoint NP-Pairs |
| 0 | -- | 0 | Venkatesan Guruswami, Kunal Talwar. Hardness of Low Congestion Routing in Directed Graphs |
| 0 | -- | 0 | Paul Beame, Russell Impagliazzo, Toniann Pitassi, Nathan Segerlind. Formula Caching in DPLL |
| 0 | -- | 0 | Shien Jin Ong, Salil P. Vadhan. Zero Knowledge and Soundness are Symmetric |
| 0 | -- | 0 | Wolfgang Maass, Kei Uchizawa, Rodney J. Douglas. Energy Complexity and Entropy of Threshold Circuits |
| 0 | -- | 0 | Wolfgang Maass, Prashant Joshi, Eduardo D. Sontag. Computational aspects of feedback in neural circuits |
| 0 | -- | 0 | Mihir Bellare, Oded Goldreich. On Probabilistic versus Deterministic Provers in the Definition of Proofs Of Knowledge |
| 0 | -- | 0 | Jin-yi Cai, Pinyan Lu. On Symmetric Signatures in Holographic Algorithms |
| 0 | -- | 0 | Venkatesan Guruswami, Christopher Umans, Salil P. Vadhan. Extractors and condensers from univariate polynomials |
| 0 | -- | 0 | Alexander Hertel, Alasdair Urquhart. The Resolution Width Problem is EXPTIME-Complete |
| 0 | -- | 0 | Grant Schoenebeck, Luca Trevisan, Madhur Tulsiani. Tight Integrality Gaps for Lovasz-Schrijver LP Relaxations of Vertex Cover and Max Cut |
| 0 | -- | 0 | Konstantin Pervyshev. On Heuristic Time Hierarchies |
| 0 | -- | 0 | Tanmoy Chakraborty, Samir Datta. One-input-face MPCVP is Hard for L, but in LogDCFL |
| 0 | -- | 0 | Manindra Agrawal, Thanh Minh Hoang, Thomas Thierauf. The polynomially bounded perfect matching problem is in NC^2 |
| 0 | -- | 0 | Shankar Kalyanaraman, Christopher Umans. On obtaining pseudorandomness from error-correcting codes. |
| 0 | -- | 0 | Sergey Yekhanin. New Locally Decodable Codes and Private Information Retrieval Schemes |
| 0 | -- | 0 | Piotr Indyk. Uncertainty Principles, Extractors, and Explicit Embeddings of L2 into L1 |
| 0 | -- | 0 | Luis Antunes, Lance Fortnow, Alexandre Pinto, Andre Souto. Low-Depth Witnesses are Easy to Find |
| 0 | -- | 0 | Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski. Approximation of Global MAX-CSP Problems |
| 0 | -- | 0 | Venkatesan Guruswami. Iterative Decoding of Low-Density Parity Check Codes (A Survey) |
| 0 | -- | 0 | Noam Livne. All Natural NPC Problems Have Average-Case Complete Versions |
| 0 | -- | 0 | Charanjit S. Jutla. A Simple Biased Distribution for Dinur s Construction |
| 0 | -- | 0 | Leslie G. Valiant. Evolvability |
| 0 | -- | 0 | Noga Alon, Oded Schwartz, Asaf Shapira. An Elementary Construction of Constant-Degree Expanders |
| 0 | -- | 0 | Irit Dinur, Madhu Sudan, Avi Wigderson. Robust Local Testability of Tensor Products of LDPC Codes |
| 0 | -- | 0 | Arkadev Chattopadhyay, Michal Koucký, Andreas Krebs, Mario Szegedy, Pascal Tesson, Denis Thérien. Languages with Bounded Multiparty Communication Complexity |
| 0 | -- | 0 | Amin Coja-Oghlan. Graph partitioning via adaptive spectral techniques |
| 0 | -- | 0 | Artur Czumaj, Andrzej Lingas. Finding a Heaviest Triangle is not Harder than Matrix Multiplication |
| 0 | -- | 0 | Carl Bosley, Yevgeniy Dodis. Does Privacy Require True Randomness? |
| 0 | -- | 0 | Peter Bürgisser. On defining integers in the counting hierarchy and proving lower bounds in algebraic complexity |
| 0 | -- | 0 | Xin Han, Kazuo Iwama, Deshi Ye, Guochuan Zhang. Strip Packing vs. Bin Packing |
| 0 | -- | 0 | Artur Czumaj, Miroslaw Kowaluk, Andrzej Lingas. Faster algorithms for finding lowest common ancestors in directed acyclic graphs |
| 0 | -- | 0 | Nishanth Chandran, Ryan Moriarty, Rafail Ostrovsky, Omkant Pandey, Amit Sahai. Improved Algorithms for Optimal Embeddings |
| 0 | -- | 0 | Julia Chuzhoy, Sanjeev Khanna. Hardness of Directed Routing with Congestion |
| 0 | -- | 0 | Dan Gutfreund, Amnon Ta-Shma. New connections between derandomization, worst-case complexity and average-case complexity |
| 0 | -- | 0 | Arkadev Chattopadhyay. An improved bound on correlation between polynomials over Z_m and MOD_q |
| 0 | -- | 0 | Avi Wigderson, David Xiao. Derandomizing the AW matrix-valued Chernoff bound using pessimistic estimators and applications |
| 0 | -- | 0 | Wenceslas Fernandez de la Vega, Marek Karpinski. On the Sample Complexity of MAX-CUT |
| 0 | -- | 0 | Oded Lachish, Ilan Newman, Asaf Shapira. Space Complexity vs. Query Complexity |
| 0 | -- | 0 | Luis Rademacher, Santosh Vempala. Dispersion of Mass and the Complexity of Randomized Geometric Algorithms |
| 0 | -- | 0 | Wenceslas Fernandez de la Vega, Marek Karpinski. Approximation Complexity of Nondense Instances of MAX-CUT |
| 0 | -- | 0 | Meena Mahajan, Jayalal M. N. Sarma. On the Complexity of Rank and Rigidity |
| 0 | -- | 0 | Oded Goldreich. On Expected Probabilistic Polynomial-Time Adversaries -- A suggestion for restricted definitions and their benefits |
| 0 | -- | 0 | Grant Schoenebeck, Luca Trevisan, Madhur Tulsiani. A Linear Round Lower Bound for Lovasz-Schrijver SDP Relaxations of Vertex Cover |
| 0 | -- | 0 | Emanuele Viola. New correlation bounds for GF(2) polynomials using Gowers uniformity |
| 0 | -- | 0 | Iftach Haitner, Omer Reingold. A New Interactive Hashing Theorem |
| 0 | -- | 0 | Rafail Ostrovsky, Giuseppe Persiano, Ivan Visconti. Concurrent Non-Malleable Witness Indistinguishability and its Applications |
| 0 | -- | 0 | Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. Maneva, Christos H. Papadimitriou. The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies |
| 0 | -- | 0 | Takeshi Koshiba, Yoshiharu Seri. Round-Efficient One-Way Permutation Based Perfectly Concealing Bit Commitment Scheme |
| 0 | -- | 0 | Matthias Englert, Heiko Röglin, Berthold Vöcking. Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP |
| 0 | -- | 0 | Felix Brandt, Felix A. Fischer, Markus Holzer. Symmetries and the Complexity of Pure Nash Equilibrium |
| 0 | -- | 0 | Christian Glaßer, Alan L. Selman, Stephen D. Travers, Liyu Zhang. Non-Mitotic Sets |
| 0 | -- | 0 | Sofya Raskhodnikova, Adam Smith. A Note on Adaptivity in Testing Properties of Bounded Degree Graphs |
| 0 | -- | 0 | Per Austrin. Balanced Max 2-Sat might not be the hardest |
| 0 | -- | 0 | Iordanis Kerenidis, Ran Raz. The one-way communication complexity of the Boolean Hidden Matching Problem |
| 0 | -- | 0 | Dmitry Gavinsky, Julia Kempe, Ronald de Wolf. Exponential Separation of Quantum and Classical One-Way Communication Complexity for a Boolean Function |
| 0 | -- | 0 | Andreas Jakoby, Maciej Liskiewicz, Aleksander Madry. Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment |
| 0 | -- | 0 | Frank Neumann, Carsten Witt. Runtime Analysis of a Simple Ant Colony Optimization Algorithm |
| 0 | -- | 0 | Nils Hebbinghaus, Benjamin Doerr, Frank Neumann. Speeding up Evolutionary Algorithms by Restricted Mutation Operators |
| 0 | -- | 0 | Prabhu Manyem. Polynomial-Time Maximisation Classes: Syntactic Hierarchy |
| 0 | -- | 0 | Spyros C. Kontogiannis, Panagiota N. Panagopoulou, Paul G. Spirakis. Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games |
| 0 | -- | 0 | David Doty. Dimension Extractors |
| 0 | -- | 0 | Kristoffer Arnsfelt Hansen. Lower Bounds for Circuits with Few Modular Gates using Exponential Sums |
| 0 | -- | 0 | Tobias Riege, Jörg Rothe. Improving Deterministic and Randomized Exponential-Time Algorithms for the Satisfiability, the Colorability, and the Domatic Number Problem |
| 0 | -- | 0 | María López-Valdés. Lempel-Ziv Dimension for Lempel-Ziv Compression |
| 0 | -- | 0 | Noam Nisan. A Note on the computational hardness of evolutionary stable strategies |
| 0 | -- | 0 | Minh-Huyen Nguyen, Shien Jin Ong, Salil P. Vadhan. Statistical Zero-Knowledge Arguments for NP from Any One-Way Function |
| 0 | -- | 0 | Shahar Dobzinski, Noam Nisan. Approximations by Computationally-Efficient VCG-Based Mechanisms |
| 0 | -- | 0 | Andrej Bogdanov, Luca Trevisan. Average-Case Complexity |
| 0 | -- | 0 | Henning Fernau. Parameterized Algorithms for Hitting Set: the Weighted Case |
| 0 | -- | 0 | John M. Hitchcock, Aduri Pavan. Hardness Hypotheses, Derandomization, and Circuit Complexity |
| 0 | -- | 0 | Ludwig Staiger. The Kolmogorov complexity of infinite words |
| 0 | -- | 0 | Christian Glaßer, Alan L. Selman, Stephen D. Travers, Klaus W. Wagner. The Complexity of Unions of Disjoint Sets |
| 0 | -- | 0 | Patrick Briest, Piotr Krysta. Buying Cheap is Expensive: Hardness of Non-Parametric Multi-Product Pricing |
| 0 | -- | 0 | Heiner Ackermann, Heiko Röglin, Berthold Vöcking. On the Impact of Combinatorial Structure on Congestion Games |
| 0 | -- | 0 | Vitaly Feldman. On Attribute Efficient and Non-adaptive Learning of Parities and DNF Expressions |
| 0 | -- | 0 | Jan Arpe, Rüdiger Reischuk. When Does Greedy Learning of Relevant Features Succeed? --- A Fourier-based Characterization --- |
| 0 | -- | 0 | Moses Charikar, Konstantin Makarychev, Yury Makarychev. Note on MAX 2SAT |
| 0 | -- | 0 | Moses Charikar, Konstantin Makarychev, Yury Makarychev. Approximation Algorithm for the Max k-CSP Problem |
| 0 | -- | 0 | Subhas Kumar Ghosh. Unique k-SAT is as Hard as k-SAT |
| 0 | -- | 0 | Venkatesan Guruswami, Prasad Raghavendra. Hardness of Learning Halfspaces with Noise |
| 0 | -- | 0 | Ran Raz, Amir Shpilka, Amir Yehudayoff. A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits |
| 0 | -- | 0 | Vitaly Feldman, Parikshit Gopalan, Subhash Khot, Ashok Kumar Ponnuswami. New Results for Learning Noisy Parities and Halfspaces |
| 0 | -- | 0 | Alexander Healy. Randomness-Efficient Sampling within NC^1 |
| 0 | -- | 0 | Adam R. Klivans, Alexander A. Sherstov. Cryptographic Hardness Results for Learning Intersections of Halfspaces |
| 0 | -- | 0 | Salil P. Vadhan. An Unconditional Study of Computational Zero Knowledge |
| 0 | -- | 0 | Scott Aaronson, Greg Kuperberg. Quantum Versus Classical Proofs and Advice |
| 0 | -- | 0 | Alex Samorodnitsky. Low-degree tests at large distances |
| 0 | -- | 0 | Eldar Fischer, Orly Yahalom. Testing Convexity Properties of Tree Colorings |
| 0 | -- | 0 | Wenbin Chen 0002, Jiangtao Meng. Inapproximability Results for the Closest Vector Problem with Preprocessing over infty Norm |
| 0 | -- | 0 | Alan Nash, Russell Impagliazzo, Jeffrey B. Remmel. Infinitely-Often Universal Languages and Diagonalization |
| 0 | -- | 0 | Alexander A. Razborov, Sergey Yekhanin. An Omega(n^{1/3}) Lower Bound for Bilinear Group Based Private Information Retrieval |
| 0 | -- | 0 | Guy Wolfovitz. The Complexity of Depth-3 Circuits Computing Symmetric Boolean Functions |
| 0 | -- | 0 | Jin-yi Cai, Vinay Choudhary. Some Results on Matchgates and Holographic Algorithms |
| 0 | -- | 0 | María López-Valdés. Scaled Dimension of Individual Strings |
| 0 | -- | 0 | Jan Arpe, Bodo Manthey. Approximability of Minimum AND-Circuits |
| 0 | -- | 0 | Andreas Björklund, Thore Husfeldt. Inclusion-Exclusion Based Algorithms for Graph Colouring |
| 0 | -- | 0 | Eran Ofek, Uriel Feige. Random 3CNF formulas elude the Lovasz theta function |
| 0 | -- | 0 | Amit Deshpande, Santosh Vempala. Adaptive Sampling and Fast Low-Rank Matrix Approximation |
| 0 | -- | 0 | Tomás Feder, Rajeev Motwani, An Zhu. k-connected spanning subgraphs of low degree |
| 0 | -- | 0 | Tomás Feder, Gagan Aggarwal, Rajeev Motwani, An Zhu. Channel assignment in wireless networks and classification of minimum graph homomorphism |
| 0 | -- | 0 | John M. Hitchcock, Aduri Pavan. Comparing Reductions to NP-Complete Sets |
| 0 | -- | 0 | David Doty, Jack H. Lutz, Satyadev Nandakumar. Finite-State Dimension and Real Arithmetic |
| 0 | -- | 0 | Xi Chen, Xiaotie Deng. On the Complexity of 2D Discrete Fixed Point Problem |
| 0 | -- | 0 | Tobias Riege, Jörg Rothe. Completeness in the Boolean Hierarchy: Exact-Four-Colorability, Minimal Graph Uncolorability, and Exact Domatic Number Problems |
| 0 | -- | 0 | Till Tantau. The Descriptive Complexity of the Reachability Problem As a Function of Different Graph Parameters |
| 0 | -- | 0 | Moni Naor, Guy N. Rothblum. The Complexity of Online Memory Checking |
| 0 | -- | 0 | Amit Agarwal, Elad Hazan. Efficient Algorithms for Online Game Playing and Universal Portfolio Management |
| 0 | -- | 0 | Vitaly Feldman. Optimal Hardness Results for Maximizing Agreements with Monomials |
| 0 | -- | 0 | Li-Sha Huang, Shang-Hua Teng. On the Approximation and Smoothed Complexity of Leontief Market Equilibria |
| 0 | -- | 0 | Piotr Berman, Jieun K. Jeong, Shiva Prasad Kasiviswanathan, Bhuvan Urgaonkar. Packing to angles and sectors |
| 0 | -- | 0 | Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani. Eisenberg-Gale Markets: Rationality, Strongly Polynomial Solvability, and Competition Monotonicity |
| 0 | -- | 0 | Jonathan Katz, Chiu-Yuen Koo. On Expected Constant-Round Protocols for Byzantine Agreement |
| 0 | -- | 0 | Hermann Gruber, Markus Holzer. Finding Lower Bounds for Nondeterministic State Complexity is Hard |
| 0 | -- | 0 | Ronen Gradwohl, Salil P. Vadhan, David Zuckerman. Random Selection with an Adversarial Majority |
| 0 | -- | 0 | Leonid Gurvits. Hyperbolic Polynomials Approach to Van der Waerden/Schrijver-Valiant like Conjectures : // Sharper Bounds , Simpler Proofs and Algorithmic Applications |
| 0 | -- | 0 | Harry Buhrman, Lance Fortnow, Michal Koucký, John D. Rogers, Nikolai K. Vereshchagin. Inverting onto functions might not be hard |
| 0 | -- | 0 | Xi Chen, Xiaotie Deng, Shang-Hua Teng. Computing Nash Equilibria: Approximation and Smoothed Complexity |
| 0 | -- | 0 | Danny Harnik, Moni Naor. On the Compressibility of NP Instances and Cryptographic Applications |
| 0 | -- | 0 | Tomás Feder. Constraint satisfaction: a personal perspective |
| 0 | -- | 0 | Akinori Kawachi, Tomoyuki Yamakami. Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding |