1. BPP has subexponential time simulations unlessEXPTIME has publishable proofs

   • Lźszló Babai
   • Lance Fortnow
   • Avi Wigderson

   OriginalPaper Pages: 307 - 318

2. Randomness in interactive proofs

   • Mihir Bellare
   • Oded Goldreich
   • Shafi Goldwasser

   OriginalPaper Pages: 319 - 354

3. Primality testing with fewer random bits

   • René Peralta
   • Victor Shoup

   OriginalPaper Pages: 355 - 367

4. The complexity of computing maximal word functions

   • Eric Allender
   • Danilo Bruschi
   • Giovanni Pighizzini

   OriginalPaper Pages: 368 - 391

5. Two tapes versus one for off-line Turing machines

   • Wolfgang Maass
   • Georg Schnitger
   • György Turán

   OriginalPaper Pages: 392 - 401