| 0 | -- | 0 | Ronen Shaltiel. Towards proving strong direct product theorems |
| 0 | -- | 0 | Eldar Fischer. On the strength of comparisons in property testing |
| 0 | -- | 0 | Vered Rosen. On the Security of Modular Exponentiation |
| 0 | -- | 0 | Rocco A. Servedio. On Learning Monotone DNF under Product Distributions |
| 0 | -- | 0 | Alexander A. Razborov. Improved Resolution Lower Bounds for the Weak Pigeonhole Principle |
| 0 | -- | 0 | Piotr Berman, Amir Ben-Dor, Itsik Pe er, Roded Sharan, Ron Shamir. On the Complexity of Positional Sequencing by Hybridization |
| 0 | -- | 0 | Piotr Berman, Marek Karpinski. Efficient Amplifiers and Bounded Degree Optimization |
| 0 | -- | 0 | Michael V. Vyugin, Vladimir V. V yugin. Non-linear Inequalities between Predictive and Kolmogorov Complexity |
| 0 | -- | 0 | Sophie Laplante, Richard Lassaigne, Frédéric Magniez, Sylvain Peyronnet, Michel de Rougemont. Probabilistic abstraction for model checking: An approach based on property testing |
| 0 | -- | 0 | Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen. Black-Box Concurrent Zero-Knowledge Requires ~Omega(log n) Rounds |
| 0 | -- | 0 | Pascal Tesson, Denis Thérien. The Computing Power of Programs over Finite Monoids |
| 0 | -- | 0 | Stasys Jukna, Georg Schnitger. On Multi-Partition Communication Complexity of Triangle-Freeness |
| 0 | -- | 0 | Jui-Lin Lee. Branching program, commutator, and icosahedron, part I |
| 0 | -- | 0 | Piotr Berman, Sridhar Hannenhalli, Marek Karpinski. 1.375-Approximation Algorithm for Sorting by Reversals |
| 0 | -- | 0 | Oded Goldreich, Salil P. Vadhan, Avi Wigderson. On Interactive Proofs with a Laconic Prover |
| 0 | -- | 0 | Michael Schmitt. Neural Networks with Local Receptive Fields and Superlinear VC Dimension |
| 0 | -- | 0 | Pavel Pudlák. On reducibility and symmetry of disjoint NP-pairs |
| 0 | -- | 0 | Michael V. Vyugin, Vladimir V. V yugin. Predictive complexity and information |
| 0 | -- | 0 | Marek Karpinski. Approximating Bounded Degree Instances of NP-Hard Problems |
| 0 | -- | 0 | Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy, V. Vinay. Time-Space Tradeoffs in the Counting Hierarchy |
| 0 | -- | 0 | Pierre Péladeau, Denis Thérien. On the Languages Recognized by Nilpotent Groups (a translation of Sur les Langages Reconnus par des Groupes Nilpotents ) |
| 0 | -- | 0 | Tobias Gärtner, Günter Hotz. Recursive analytic functions of a complex variable |
| 0 | -- | 0 | Stasys Jukna, Stanislav Zák. On Uncertainty versus Size in Branching Programs |
| 0 | -- | 0 | Rüdiger Reischuk. Approximating Schedules for Dynamic Graphs Efficiently |
| 0 | -- | 0 | Rustam Mubarakzjanov. Bounded-Width Probabilistic OBDDs and Read-Once Branching Programs are Incomparable |
| 0 | -- | 0 | Amnon Ta-Shma, David Zuckerman, Shmuel Safra. Extractors from Reed-Muller Codes |
| 0 | -- | 0 | Amir Shpilka. Affine Projections of Symmetric Polynomials |
| 0 | -- | 0 | Cristina Bazgan, Wenceslas Fernandez de la Vega, Marek Karpinski. Polynomial Time Approximation Schemes for Dense Instances of Minimum Constraint Satisfaction |
| 0 | -- | 0 | Eric Allender, David A. Mix Barrington, William Hesse. Uniform Circuits for Division: Consequences and Problems |
| 0 | -- | 0 | Aduri Pavan, Alan L. Selman. Separation of NP-completeness Notions |
| 0 | -- | 0 | Eli Ben-Sasson, Nicola Galesi. Space Complexity of Random Formulae in Resolution |
| 0 | -- | 0 | Jin-yi Cai. S_2:::p::: /subseteq ZPP:::NP::: |
| 0 | -- | 0 | Lars Engebretsen, Jonas Holmerin. Towards Optimal Lower Bounds For Clique and Chromatic Number |
| 0 | -- | 0 | Denis Xavier Charles. A Note on Subgroup Membership Problem for PSL(2,p) |
| 0 | -- | 0 | Thanh Minh Hoang, Thomas Thierauf. The Complexity of the Minimal Polynomial |
| 0 | -- | 0 | Marius Zimand. Probabilistically Checkable Proofs The Easy Way |
| 0 | -- | 0 | Piotr Berman, Marek Karpinski. Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION |
| 0 | -- | 0 | Piotr Berman, Marek Karpinski. Approximating Minimum Unsatisfiability of Linear Equations |
| 0 | -- | 0 | Stephen A. Cook, Antonina Kolokolova. A second-order system for polynomial-time reasoning based on Graedel s theorem |
| 0 | -- | 0 | Jochen Alber, Henning Fernau, Rolf Niedermeier. Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems |
| 0 | -- | 0 | Rahul Santhanam. On segregators, separators and time versus space |
| 0 | -- | 0 | Ran Raz. Resolution Lower Bounds for the Weak Pigeonhole Principle |
| 0 | -- | 0 | N. S. Narayanaswamy, C. E. Veni Madhavan. Lower Bounds for OBDDs and Nisan s pseudorandom generator |
| 0 | -- | 0 | Venkatesan Guruswami. Constructions of Codes from Number Fields |
| 0 | -- | 0 | Andris Ambainis, Harry Buhrman, William I. Gasarch, Bala Kalyanasundaram, Leen Torenvliet. The Communication Complexity of Enumeration, Elimination, and Selection |
| 0 | -- | 0 | Omer Reingold, Salil P. Vadhan, Avi Wigderson. Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors |
| 0 | -- | 0 | Petr Savický, Detlef Sieling. A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism |
| 0 | -- | 0 | Ran Canetti. A unified framework for analyzing security of protocols |
| 0 | -- | 0 | Amos Beimel, Yuval Ishai. Information-Theoretic Private Information Retrieval: A Unified Construction |
| 0 | -- | 0 | Marcos A. Kiwi, Frédéric Magniez, Miklos Santha. Exact and Approximate Testing/Correcting of Algebraic Functions: A Survey |
| 0 | -- | 0 | Michal Koucký. Log-space Constructible Universal Traversal Sequences for Cycles of Length O(n:::4.03:::) |
| 0 | -- | 0 | Evgeny Dantsin, Edward A. Hirsch, Sergei Ivanov, Maxim Vsemirnov. Algorithms for SAT and Upper Bounds on Their Complexity |
| 0 | -- | 0 | Dima Grigoriev, Edward A. Hirsch. Algebraic proof systems over formulas |
| 0 | -- | 0 | Oded Goldreich, Luca Trevisan. Three Theorems regarding Testing Graph Properties |
| 0 | -- | 0 | Jin-yi Cai. Essentially every unimodular matrix defines an expander |
| 0 | -- | 0 | Alexander A. Razborov. Resolution Lower Bounds for the Weak Functional Pigeonhole Principle |
| 0 | -- | 0 | Josh Buresh-Oppenheim, David G. Mitchell, Toniann Pitassi. Linear and Negative Resolution are Weaker than Resolution |
| 0 | -- | 0 | Beate Bollig, Philipp Woelfel, Stephan Waack. Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication |
| 0 | -- | 0 | Ronald Cramer, Victor Shoup. Universal Hash Proofs and and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption |
| 0 | -- | 0 | Robert A. Legenstein, Wolfgang Maass. Neural Circuits for Pattern Recognition with Small Total Wire Length |
| 0 | -- | 0 | Robert A. Legenstein, Wolfgang Maass. Total Wire Length as a Salient Circuit Complexity Measure for Sensory Processing |
| 0 | -- | 0 | Robert A. Legenstein, Wolfgang Maass. Optimizing the Layout of a Balanced Tree |
| 0 | -- | 0 | Philippe Moser. Relative to P, APP and promise-BPP are the same |
| 0 | -- | 0 | Hubie Chen. Polynomial Programs and the Razborov-Smolensky Method |
| 0 | -- | 0 | Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger. On Multipartition Communication Complexity |
| 0 | -- | 0 | Chandra Chekuri. Approximation Schemes for Preemptive Weighted Flow Time |
| 0 | -- | 0 | Moni Naor, Omer Reingold, Alon Rosen. Pseudo-Random Functions and Factoring |
| 0 | -- | 0 | Michal Parnas, Dana Ron, Alex Samorodnitsky. Proclaiming Dictators and Juntas or Testing Boolean Formulae |
| 0 | -- | 0 | Moni Naor, Kobbi Nissim. Communication Complexity and Secure Function Evaluation |
| 0 | -- | 0 | Mitsunori Ogihara, Seinosuke Toda. The Complexity of Computing the Number of Self-Avoiding Walks in Two-Dimensional Grid Graphs and in Hypercube Graphs |
| 0 | -- | 0 | Amir Shpilka. Lower bounds for matrix product |
| 0 | -- | 0 | Elvira Mayordomo. A Kolmogorov complexity characterization of constructive Hausdorff dimension |
| 0 | -- | 0 | Stasys Jukna. A Note on the Minimum Number of Negations Leading to Superpolynomial Savings |
| 0 | -- | 0 | Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang. On the (Im)possibility of Obfuscating Programs |
| 0 | -- | 0 | Michael Alekhnovich, Jan Johannsen, Toniann Pitassi, Alasdair Urquhart. An Exponential Separation between Regular and General Resolution |