Journal: Theory Comput. Syst.

Volume 23, Issue 4

207 -- 0Mukkai S. Krishnamoorthy, Robert Ingalls. Guest Editors Note: Special Issue in Honor of Robert McNaughton
209 -- 225Richard Edwin Stearns, Harry B. Hunt III. Power Indices and Easier Hard Problems
227 -- 244Arnold L. Rosenberg. Exposing Graph Uniformities via Algebraic Specification
245 -- 254Paliath Narendran. It is Decidable Whether a Monadic Thue System is Canonical Over a Regular Set

Volume 23, Issue 3

143 -- 0Mukkai S. Krishnamoorthy, Robert Ingalls. Guest Editors Note: Special Issue in Honor of Robert McNaughton
145 -- 146Robert McNaughton. Some Remarks
147 -- 164David A. Mix Barrington. Extensions of an Idea of McNaughton
165 -- 174Ronald V. Book, Shouwen Tang. Characterizing Polynomial Complexity Classes by Reducibilities
175 -- 206Hantao Zhang, Deepak Kapur. Unnecessary Inferences in Associative-Commutative Completion Procedures

Volume 23, Issue 2

81 -- 93Ian Parberry. Single-Exception Sorting Networks and the Computational Complexity of Optimal Sorting Network Verification
95 -- 106Jin-yi Cai, Lane A. Hemachandra. On the Power of Parity Polynomial Time
107 -- 139Miroslaw Kutylowski. One-Way Multihead Finite Automata and 2-Bounded Languages

Volume 23, Issue 1

1 -- 19Dung T. Huynh. The Complexity of Ranking Simple Languages
21 -- 32Josep Díaz, Jacobo Torán. Classes of Bounded Nondeterminism
33 -- 59Hsu-Chun Yen. Communicating Processes, Scheduling, and the Complexity of Nondeterminism
61 -- 77David S. Greenberg, Lenwood S. Heath, Arnold L. Rosenberg. Optimal Embeddings of Butterfly-Like Graphs in the Hypercube