GUEST EDITOR'S FOREWORD
Which Problems Have Strongly Exponential Complexity?
A Randomized Approximation Scheme for Metric MAX-CUT
Time–Space Tradeoffs for Branching Programs
Protocols for Asymmetric Communication Channels
The Minimum Equivalent DNF Problem and Shortest Implicants
Perfect Information Leader Election in log* n+O(1) Rounds
On Approximate Nearest Neighbors under l∞ Norm
Heuristics for Semirandom Graph Problems
Randomness vs Time: Derandomization under a Uniform Assumption
Papers to Appear in Forthcoming Issues
Author Index for Volume 63