researchr
explore
Tags
Journals
Conferences
Authors
Profiles
Groups
calendar
New Conferences
Events
Deadlines
search
search
You are not signed in
Sign in
Sign up
External Links
Journal: Theory Comput. Syst.
Home
Index
Info
Volume
Volume
23
, Issue
4
207
--
0
Mukkai S. Krishnamoorthy
,
Robert Ingalls
.
Guest Editors Note: Special Issue in Honor of Robert McNaughton
209
--
225
Richard Edwin Stearns
,
Harry B. Hunt III
.
Power Indices and Easier Hard Problems
227
--
244
Arnold L. Rosenberg
.
Exposing Graph Uniformities via Algebraic Specification
245
--
254
Paliath Narendran
.
It is Decidable Whether a Monadic Thue System is Canonical Over a Regular Set
Volume
23
, Issue
3
143
--
0
Mukkai S. Krishnamoorthy
,
Robert Ingalls
.
Guest Editors Note: Special Issue in Honor of Robert McNaughton
145
--
146
Robert McNaughton
.
Some Remarks
147
--
164
David A. Mix Barrington
.
Extensions of an Idea of McNaughton
165
--
174
Ronald V. Book
,
Shouwen Tang
.
Characterizing Polynomial Complexity Classes by Reducibilities
175
--
206
Hantao Zhang
,
Deepak Kapur
.
Unnecessary Inferences in Associative-Commutative Completion Procedures
Volume
23
, Issue
2
81
--
93
Ian Parberry
.
Single-Exception Sorting Networks and the Computational Complexity of Optimal Sorting Network Verification
95
--
106
Jin-yi Cai
,
Lane A. Hemachandra
.
On the Power of Parity Polynomial Time
107
--
139
Miroslaw Kutylowski
.
One-Way Multihead Finite Automata and 2-Bounded Languages
Volume
23
, Issue
1
1
--
19
Dung T. Huynh
.
The Complexity of Ranking Simple Languages
21
--
32
Josep Díaz
,
Jacobo Torán
.
Classes of Bounded Nondeterminism
33
--
59
Hsu-Chun Yen
.
Communicating Processes, Scheduling, and the Complexity of Nondeterminism
61
--
77
David S. Greenberg
,
Lenwood S. Heath
,
Arnold L. Rosenberg
.
Optimal Embeddings of Butterfly-Like Graphs in the Hypercube