A polynomial algorithm for recognizing bounded cutwidth in hypergraphs Zevi MillerI. H. Sudborough OriginalPaper Pages: 11 - 40
On polynomial-time truth-table reducibility of intractable sets to P-selective sets Seinosuke Toda OriginalPaper Pages: 69 - 82
A computer-assisted optimal depth lower bound for nine-input sorting networks Ian Parberry OriginalPaper Pages: 101 - 116
A geometrical view of the determinization and minimization of finite-state automata Bruno CourcelleDamian NiwinskiAndreas Podelski OriginalPaper Pages: 117 - 146
On limitations of transformations between combinatorial problems William SloughKarl Winklmann OriginalPaper Pages: 149 - 168
Bandwidth Minimization: An approximation algorithm for caterpillars J. HaralambidesF. MakedonB. Monien OriginalPaper Pages: 169 - 177
Completeness for nondeterministic complexity classes Harry BuhrmanSteven HomerLeen Torenvliet OriginalPaper Pages: 179 - 200
Selection and sorting in totally monotone arrays Dina KravetsJames K. Park OriginalPaper Pages: 201 - 220
Tight bounds for oblivious routing in the hypercube Christos KaklamanisDanny KrizancThanasis Tsantilas OriginalPaper Pages: 223 - 232
A unified framework for off-line permutation routing in parallel networks Marc BaumslagFred Annexstein OriginalPaper Pages: 233 - 251
Fast algorithms for bit-serial routing on a hypercube William A. AielloF. T. LeightonMark Newman OriginalPaper Pages: 253 - 271
Fast fault-tolerant parallel communication and on-line maintenance for hypercubes using information dispersal Yuh-Dauh Lyuu OriginalPaper Pages: 273 - 294
Routing multiple paths in hypercubes David S. GreenbergSandeep N. Bhatt OriginalPaper Pages: 295 - 321