External Links

    Journal: Theory Comput. Syst.

    Volume 24, Issue 4

    223 -- 232Christos Kaklamanis, Danny Krizanc, Thanasis Tsantilas. Tight Bounds for Oblivious Routing in the Hypercube
    233 -- 251Marc Baumslag, Fred S. Annexstein. A Unified Framework for Off-Line Permutation Routing in Parallel Networks
    253 -- 271William Aiello, Frank Thomson Leighton, Bruce M. Maggs, Mark Newman. Fast Algorithms for Bit-Serial Routing on a Hypercube
    273 -- 294Yuh-Dauh Lyuu. Fast Fault-Tolerant Parallel Communication and On-Line Maintenance for Hypercubes Using Information Dispersal
    295 -- 321David S. Greenberg, Sandeep N. Bhatt. Routing Multiple Paths in Hypercubes

    Volume 24, Issue 3

    149 -- 168William Slough, Karl Winklmann. On Limitations of Transformations Between Combinatorial Problems
    169 -- 177James Haralambides, Fillia Makedon, Burkhard Monien. Bandwidth Minimization: An Approximation Algorithm for Caterpillars
    179 -- 200Harry Buhrman, Steven Homer, Leen Torenvliet. Completeness for Nondeterministic Complexity Classes
    201 -- 220Dina Kravets, James K. Park. Selection and Sorting in Totally Monotone Arrays

    Volume 24, Issue 2

    68 -- 82Seinosuke Toda. On Polynomial-Time Truth-Table Reducibility of Intractable Sets to P-Selective Sets
    83 -- 100Antoni Lozano, Jacobo Torán. Self-Reducible Sets of Small Sensity
    101 -- 116Ian Parberry. A Computer-Assisted Optimal Depth Lower Bound for Nine-Input Sorting Networks
    117 -- 146Bruno Courcelle, Damian Niwinski, Andreas Podelski. A Geometrical View of the Determinization and Minimization of Finite-State Automata

    Volume 24, Issue 1

    1 -- 10Osamu Watanabe. On Intractability of the Class UP
    11 -- 40Zevi Miller, Ivan Hal Sudborough. A Polynomial Algorithm for Recognizing Bounded Cutwidth in Hypergraphs
    41 -- 52Juraj Hromkovic. On Problems for Which no Oracle Can Help
    53 -- 67Eric Allender. Limitations of the Upward Separation Technique
    runs on