Communicating processes, scheduling, and the complexity of nontermination Hsu-Chun Yen OriginalPaper Pages: 33 - 59
Optimal embeddings of butterfly-like graphs in the hypercube David S. GreenbergLenwood S. HeathArnold L. Rosenberg OriginalPaper Pages: 61 - 77
Single-exception sorting networks and the computational complexity of optimal sorting network verification Ian Parberry OriginalPaper Pages: 81 - 93
One-way multihead finite automata and 2-bounded languages Mirosław Kutyłowski OriginalPaper Pages: 107 - 139
Characterizing polynomial complexity classes by reducibilities Ronald V. BookShouwen Tang OriginalPaper Pages: 165 - 174
Unnecessary inferences in associative-commutative completion procedures Hantao ZhangDeepak Kapur OriginalPaper Pages: 175 - 206
Exposing graph uniformities via algebraic specification Arnold L. Rosenberg OriginalPaper Pages: 227 - 244
It is decidable whether a monadic thue system is canonical over a regular set Paliath Narendran OriginalPaper Pages: 245 - 254
