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

    Volume 63, Issue 3

    305 -- 354Sanjay Jain, Efim B. Kinber, Rolf Wiehagen. Language Learning from Texts: Degrees of Intrinsic Complexity and Their Characterizations
    355 -- 383Sanjay Gupta, R. K. P. Zia. Quantum Neural Networks
    384 -- 393Hing Leung. Tight Lower Bounds on the Size of Sweeping Automata
    394 -- 431Nicolas Bedon. Logic over Words on Denumerable Ordinals
    432 -- 448Fan R. K. Chung, Mark W. Garrett, Ronald L. Graham, David Shallcross. Distance Realization Problems with Applications to Internet Tomography
    449 -- 473Satyanarayana V. Lokam. Spectral Methods for Matrix Rigidity with Applications to Size-Depth Trade-offs and Communication Complexity
    474 -- 485David Peleg, Eilon Reshef. Low Complexity Variants of the Arrow Distributed Directory
    486 -- 497Jay Sethuraman, Chung-Piaw Teo. A Polynomial-time Algorithm for the Bistable Roommates Problem
    498 -- 508Johan Håstad. A Slight Sharpening of LMN

    Volume 63, Issue 2

    147 -- 0Pavel Pudlák. Gust Editor s Foreword
    148 -- 185Andris Ambainis, Harry Buhrman, William I. Gasarch, Bala Kalyanasundaram, Leen Torenvliet. The Communication Complexity of Enumeration, Elimination, and Selection
    186 -- 200David A. Mix Barrington, Peter Kadau, Klaus-Jörn Lange, Pierre McKenzie. On the Complexity of Some Problems on Groups Input as Multiplication Tables
    201 -- 221André Berthiaume, Wim van Dam, Sophie Laplante. Quantum Kolmogorov Complexity
    222 -- 235Oliver Giel. Branching Program Size Is Almost Linear in Formula Size
    236 -- 252Valentine Kabanets. Easiness Assumptions and Hardness Tests: Trading Time for Zero Error
    253 -- 267Ketan Mulmuley, Pradyut Shah. A Lower Bound for the Shortest Path Problem
    268 -- 287Iannis Tourlakis. Time-Space Tradeoffs for SAT on Nonuniform Machines
    288 -- 303Ke Yang. Integer Circuit Evaluation Is PSPACE-Complete

    Volume 63, Issue 1

    1 -- 0Fan Chung Graham. Editor s Foreword
    2 -- 20Jon M. Kleinberg, Yuval Rabani, Éva Tardos. Fairness in Routing and Load Balancing
    21 -- 41Joan Feigenbaum, Christos H. Papadimitriou, Scott Shenker. Sharing the Cost of Multicast Transmissions
    42 -- 61Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins. Recommendation Systems: A Probabilistic Analysis
    62 -- 79Ashish Goel, Adam Meyerson, Serge A. Plotkin. Combining Fairness with Throughput: Online Routing with Multiple Objectives
    80 -- 126Philip J. Hanlon, Dean Chung, Siddhartha Chatterjee, Daniela Genius, Alvin R. Lebeck, Erin Parker. The Combinatorics of Cache Misses during Matrix Multiplication
    127 -- 145Micah Adler, Frank Thomson Leighton. Compression Using Efficient Multicasting
    runs on