168 | -- | 192 | Wolfgang Maass, Theodore A. Slaman. The Complexity Types of Computable Sets |
193 | -- | 219 | Shai Ben-David, Benny Chor, Oded Goldreich, Michael Luby. On the Theory of Average Case Complexity |
220 | -- | 258 | Jack H. Lutz. Almost Everywhere High Nonuniform Complexity |
259 | -- | 271 | Uriel Feige, Adi Shamir. Multi-Oracle Interactive Protocols with Constant Space Verifiers |
272 | -- | 286 | Johannes Köbler, Uwe Schöning, Seinosuke Toda, Jacobo Torán. Turing Machines with Few Accepting Computations and Low Sets for PP |
287 | -- | 301 | Steven Homer, Alan L. Selman. Oracles for Structural Properties: The Isomorphism Problem and Public-Key Cryptography |
302 | -- | 323 | Ernst W. Mayr, Ashok Subramanian. The Complexity of Circuit Value and Network Stability |
324 | -- | 342 | Tak Wah Lam, Walter L. Ruzzo. Results on Communication Complexity Classes |
343 | -- | 384 | Ming Li, Paul M. B. Vitányi. Inductive Reasoning and Kolmogorov Complexity |