External Links

    Journal: J. Comput. Syst. Sci.

    Volume 63, Issue 4

    511 -- 0Rajeev Motwani. Guest Editor s Foreword
    512 -- 530Russell Impagliazzo, Ramamohan Paturi, Francis Zane. Which Problems Have Strongly Exponential Complexity?
    531 -- 541Wenceslas Fernandez de la Vega, Claire Kenyon. A Randomized Approximation Scheme for Metric MAX-CUT
    542 -- 572Paul Beame, T. S. Jayram, Michael E. Saks. Time-Space Tradeoffs for Branching Programs
    573 -- 596Micah Adler, Bruce M. Maggs. Protocols for Asymmetric Communication Channels
    597 -- 611Christopher Umans. The Minimum Equivalent DNF Problem and Shortest Implicants
    612 -- 626Alexander Russell, David Zuckerman. Perfect Information Leader Election in log* n+O (1) Rounds
    627 -- 638Piotr Indyk. On Approximate Nearest Neighbors under l::infinity:: Norm
    639 -- 671Uriel Feige, Joe Kilian. Heuristics for Semirandom Graph Problems
    672 -- 688Russell Impagliazzo, Avi Wigderson. Randomness vs Time: Derandomization under a Uniform Assumption
    runs on