| 359 | -- | 373 | Richard Chang, Jim Kadin, Pankaj Rohatgi. On Unique Satisfiability and the Threshold Behavior of Randomized Reductions |
| 374 | -- | 381 | David A. Mix Barrington, Howard Straubing. Superlinear Lower Bounds for Bounded-Width Branching Programs |
| 382 | -- | 390 | Daniel P. Bovet, Pierluigi Crescenzi, Riccardo Silvestri. Complexity Classes and Sparse Oracles |
| 391 | -- | 411 | Phokion G. Kolaitis, Madhukar N. Thakur. Approximation Properties of NP Minimization Classes |
| 412 | -- | 432 | Sanjay Gupta. Closure Properties and Witness Reduction |
| 433 | -- | 437 | Michelangelo Grigni, Michael Sipser. Monotone Separation of Logarithmic Space from Logarithmic Depth |
| 441 | -- | 455 | Martin Beaudry, Pierre McKenzie. Circuits, Matrices, and Nonassociative Computation |
| 456 | -- | 467 | Frederic Green, Johannes Köbler, Kenneth W. Regan, Thomas Schwentick, Jacobo Torán. The Power of the Middle Bit of a #P Function |
| 468 | -- | 475 | Ricard Gavaldà. Bounding the Complexity of Advice Functions |
| 476 | -- | 492 | Pankaj Rohatgi. Saving Queries with Randomness |
| 493 | -- | 505 | Sanjeev Saluja, K. V. Subrahmanyam, Madhukar N. Thakur. Descriptive Complexity of #P Functions |
| 506 | -- | 518 | Anne Condon, Richard E. Ladner. Interactive Proof Systems with Polynomially Bounded Strategies |
| 521 | -- | 542 | Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein. Learning Boolean Read-Once Formulas over Generalized Bases |
| 543 | -- | 550 | Yishay Mansour. An O(n^(log log n)) Learning Algorithm for DNT under the Uniform Distribution |
| 551 | -- | 573 | David P. Helmbold, Manfred K. Warmuth. On Weak Learning |
| 574 | -- | 599 | Robert P. Daley, Bala Kalyanasundaram, Mahendran Velauthapillai. Breaking the Probability 1/2 Barrier in FIN-Type Learning |
| 600 | -- | 610 | Michael Kharitonov. Cryptographic Lower Bounds for Learnability of Boolean Functions on the Uniform Distribution |