| 0 | -- | 0 | Marek Karpinski. A Note on Las Vegas OBDDs |
| 0 | -- | 0 | Eric Allender, Vikraman Arvind, Meena Mahajan. Arithmetic Complexity, Kleene Closure, and Formal Power Series |
| 0 | -- | 0 | Juraj Hromkovic. On the Power of Las Vegas II: Two-Way Finite Automata |
| 0 | -- | 0 | Jin-yi Cai. Some Recent Progress on the Complexity of Lattice Problems |
| 0 | -- | 0 | Michael Schmitt. On the Sample Complexity for Nonoverlapping Neural Networks |
| 0 | -- | 0 | Valentine Kabanets. Almost k-Wise Independence and Boolean Functions Hard for Read-Once Branching Programs |
| 0 | -- | 0 | Johan Håstad. On approximating CSP-B |
| 0 | -- | 0 | Peter Jonsson. On the Complexity of Finding Satisfiable Subinstances in Constraint Satisfaction |
| 0 | -- | 0 | Johan Håstad, Mats Näslund. The Security of all RSA and Discrete Log Bits |
| 0 | -- | 0 | Edward A. Hirsch. A New Algorithm for MAX-2-SAT |
| 0 | -- | 0 | Leonard J. Schulman. Clustering for Edge-Cost Minimization |
| 0 | -- | 0 | Wolfgang Merkle. The Global Power of Additional Queries to p-random Oracles |
| 0 | -- | 0 | Vikraman Arvind, Johannes Köbler. Graph Isomorphism is Low for ZPP:::NP::: and other Lowness results |
| 0 | -- | 0 | Cristopher Moore. Quantum Circuits: Fanout, Parity, and Counting |
| 0 | -- | 0 | Meena Mahajan, P. R. Subramanya, V. Vinay. A Combinatorial Algorithm for Pfaffians |
| 0 | -- | 0 | Stephen A. Fenner, Frederic Green, Steven Homer, Randall Pruim. Determining Acceptance Possibility for a Quantum Computation is Hard for the Polynomial Hierarchy |
| 0 | -- | 0 | Ilya Dumer, Daniele Micciancio, Madhu Sudan. Hardness of Approximating the Minimum Distance of a Linear Code |
| 0 | -- | 0 | Stefan Edelkamp. On the performance of WEAK-HEAPSORT |
| 0 | -- | 0 | Marek Karpinski, Igor Shparlinski. On the Computational Hardness of Testing Square-Freeness of Sparse Polynomials |
| 0 | -- | 0 | Miklós Ajtai. A Non-linear Time Lower Bound for Boolean Branching Programs |
| 0 | -- | 0 | Yonatan Aumann, Johan Håstad, Michael O. Rabin, Madhu Sudan. Linear Consistency Testing |
| 0 | -- | 0 | Oded Goldreich, Shafi Goldwasser, Silvio Micali. Interleaved Zero-Knowledge in the Public-Key Model. |
| 0 | -- | 0 | Amir Shpilka. Depth-3 Arithmetic Formulae over Fields of Characteristic Zero |
| 0 | -- | 0 | Eli Ben-Sasson. Short Proofs are Narrow - Resolution made Simple |
| 0 | -- | 0 | Igor Shparlinski. On the Uniformity of Distribution of a Certain Pseudo-Random Function |
| 0 | -- | 0 | Marek Karpinski. Randomized Complexity of Linear Arrangements and Polyhedra |
| 0 | -- | 0 | Oded Goldreich, Daniele Micciancio, Shmuel Safra, Jean-Pierre Seifert. Approximating Shortest Lattice Vectors is Not Harder Than Approximating Closest Lattice Vectors |
| 0 | -- | 0 | Detlef Sieling. Lower Bounds for Linear Transformed OBDDs and FBDDs |
| 0 | -- | 0 | Manindra Agrawal. Reducing Randomness via Chinese Remaindering |
| 0 | -- | 0 | Yevgeniy Dodis, Oded Goldreich, Eric Lehman, Sofya Raskhodnikova, Dana Ron, Alex Samorodnitsky. Improved Testing Algorithms for Monotonicity |
| 0 | -- | 0 | Irit Dinur. Approximating SVP::infty:: to within Almost-Polynomial Factors is NP-hard |
| 0 | -- | 0 | Irit Dinur, Shmuel Safra. On the Hardness of Approximating Label Cover |
| 0 | -- | 0 | Alexander A. Razborov, Nikolai K. Vereshchagin. One Property of Cross-Intersecting Families |
| 0 | -- | 0 | Oded Goldreich, Amit Sahai, Salil P. Vadhan. Can Statistical Zero Knowledge be made Non-Interactive? or On the Relationship of SZK and NISZK |
| 0 | -- | 0 | Eric Allender, Andris Ambainis, David A. Mix Barrington, Samir Datta, Huong LeThanh. Bounded Depth Arithmetic Circuits: Counting and Closure |
| 0 | -- | 0 | Matthias Krause, Petr Savický, Ingo Wegener. Approximations by OBDDs and the variable ordering problem |
| 0 | -- | 0 | Eric Allender, Igor Shparlinski, Michael E. Saks. A Lower Bound for Primality |
| 0 | -- | 0 | Detlef Sieling. The Complexity of Minimizing FBDDs |