1. On intractability of the classUP

   • Osamu Watanabe

   OriginalPaper Pages: 1 - 10

2. A polynomial algorithm for recognizing bounded cutwidth in hypergraphs

   • Zevi Miller
   • I. H. Sudborough

   OriginalPaper Pages: 11 - 40

3. On problems for which no oracle can help

   • Juraj Hromkovič

   OriginalPaper Pages: 41 - 52

4. Limitations of the upward separation technique

   • Eric Allender

   OriginalPaper Pages: 53 - 67

5. On polynomial-time truth-table reducibility of intractable sets to P-selective sets

   • Seinosuke Toda

   OriginalPaper Pages: 69 - 82

6. Self-reducible sets of small density

   • Antoni Lozano
   • Jacobo Torán

   OriginalPaper Pages: 83 - 100

7. A computer-assisted optimal depth lower bound for nine-input sorting networks

   • Ian Parberry

   OriginalPaper Pages: 101 - 116

8. A geometrical view of the determinization and minimization of finite-state automata

   • Bruno Courcelle
   • Damian Niwinski
   • Andreas Podelski

   OriginalPaper Pages: 117 - 146

9. On limitations of transformations between combinatorial problems

   • William Slough
   • Karl Winklmann

   OriginalPaper Pages: 149 - 168

10. Bandwidth Minimization: An approximation algorithm for caterpillars

    • J. Haralambides
    • F. Makedon
    • B. Monien

    OriginalPaper Pages: 169 - 177

11. Completeness for nondeterministic complexity classes

    • Harry Buhrman
    • Steven Homer
    • Leen Torenvliet

    OriginalPaper Pages: 179 - 200

12. Selection and sorting in totally monotone arrays

    • Dina Kravets
    • James K. Park

    OriginalPaper Pages: 201 - 220

13. Editor's foreword

    • Arnold L. Rosenberg

    EditorialNotes Pages: 221 - 221

14. Tight bounds for oblivious routing in the hypercube

    • Christos Kaklamanis
    • Danny Krizanc
    • Thanasis Tsantilas

    OriginalPaper Pages: 223 - 232

15. A unified framework for off-line permutation routing in parallel networks

    • Marc Baumslag
    • Fred Annexstein

    OriginalPaper Pages: 233 - 251

16. Fast algorithms for bit-serial routing on a hypercube

    • William A. Aiello
    • F. T. Leighton
    • Mark Newman

    OriginalPaper Pages: 253 - 271

17. Fast fault-tolerant parallel communication and on-line maintenance for hypercubes using information dispersal

    • Yuh-Dauh Lyuu

    OriginalPaper Pages: 273 - 294

18. Routing multiple paths in hypercubes

    • David S. Greenberg
    • Sandeep N. Bhatt

    OriginalPaper Pages: 295 - 321