Journals in DBLP

J. Comput. Syst. Sci.
2001, volume: 63, number: 4

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