1. Special issue, final part “Conference on Computational Complexity 2004 ” Guest Editor’s foreword

   • Eric Allender
   • Guest Editor

   Foreword Open access Pages: 185 - 185

2. Compression of Samplable Sources

   • Luca Trevisan
   • Salil Vadhan
   • David Zuckerman

   Original Paper Open access Pages: 186 - 227

3. Language compression and pseudorandom generators

   • Harry Buhrman
   • Troy Lee
   • Dieter van Melkebeek

   Original Paper Open access Pages: 228 - 255

4. Derandomizing Arthur–Merlin Games using Hitting Sets

   • Peter Bro Miltersen
   • N. V. Vinodchandran

   Original Paper Open access Pages: 256 - 279