Grammars with Linear Time Functions - Ronald V. Book (SWAT, 1968)

Quasi-Realtime Languages-Extended Abstract - Ronald V. Book; Sheila A. Greibach (STOC, 1969)

Tape- and Time-Bounded Turing Acceptors and AFLs: Extended Abstract - Ronald V. Book; Sheila A. Greibach; Ben Wegbreit (STOC, 1970)

Tape-Bounded Turing Acceptors and Principal AFLs. - Ronald V. Book; Sheila A. Greibach; Oscar H. Ibarra; Ben Wegbreit (J. Comput. Syst. Sci., 1970)

Time- and Tape-Bounded Turing Acceptors and AFLs. - Ronald V. Book; Sheila A. Greibach; Ben Wegbreit (J. Comput. Syst. Sci., 1970)

Quasi-Realtime Languages. - Ronald V. Book; Sheila A. Greibach (Math. Syst. Theory, 1970)

Time-Bounded Grammars and Their Languages. - Ronald V. Book (J. Comput. Syst. Sci., 1971)

Ambiguity in Graphs and Expressions. - Ronald Vernon Book; Shimon Even; Sheila A. Greibach; Gene Ott (IEEE Trans. Computers, 1971)

A Note on AFLs and Bounding Erasing - Ronald V. Book; Ben Wegbreit (Inf. Control., 1971)

Reversal-Bounded Multi-Pushdown Machines: Extended Abstract - Brenda S. Baker; Ronald V. Book (SWAT, 1972)

Complexity Classes of Formal Languages (Extended Abstract). - Ronald V. Book (ICALP, 1972)

Multi-Stack-Counter Languages. - Ronald V. Book; Seymour Ginsburg (Math. Syst. Theory, 1972)

Terminal Context in Context-Sensitive Grammars. - Ronald V. Book (SIAM J. Comput., 1972)

On Languages Accepted in Polynomial Time. - Ronald V. Book (SIAM J. Comput., 1972)

Free and almost-free subsemigroups of a free semigroup. - Ronald V. Book (Discret. Math., 1973)

On the structure of context-sensitive grammars. - Ronald V. Book (Int. J. Parallel Program., 1973)

On the Structure of Complexity Classes. - Ronald V. Book (ICALP, 1974)

Intersections of Linear Context-Free Languages and Reversal-Bounded Multipushdown Machines (Extended Abstract) - Ronald V. Book; Maurice Nivat; Mike Paterson (STOC, 1974)

Mutually divisible semigroups. - Ronald V. Book; Michael A. Harrison (Discret. Math., 1974)

Reversal-Bounded Multipushdown Machines. - Brenda S. Baker; Ronald V. Book (J. Comput. Syst. Sci., 1974)

Comparing Complexity Classes. - Ronald V. Book (J. Comput. Syst. Sci., 1974)

Reversal-Bounded Acceptors and Intersections of Linear Languages. - Ronald V. Book; Maurice Nivat; Mike Paterson (SIAM J. Comput., 1974)

Tally Languages and Complexity Classes - Ronald V. Book (Inf. Control., 1974)

Hauptvortrag: Formal language theory and theoretical computer science. - Ronald V. Book (Automata Theory and Formal Languages, 1975)

Inherently Nonplanar Automata. - Ronald V. Book; Ashok K. Chandra (Acta Informatica, 1976)

Translational Lemmas, Polynomial Time, and (log n)^j-Space. - Ronald V. Book (Theor. Comput. Sci., 1976)

Language Representation Theorems: How to Generate the R. E. Sets from the Regular Sets - Ronald V. Book (FOCS, 1977)

On the Computational Power of Reversal-Bounded Machines. - Ronald V. Book; Chee-Keng Yap (ICALP, 1977)

On Languages With a Certain Prefix Property. - Ronald V. Book (Math. Syst. Theory, 1977)

Inclusion Complete Tally Languages and the Hartmanis-Berman Conjecture. - Ronald V. Book; Celia Wrathall; Alan L. Selman; David P. Dobkin (Math. Syst. Theory, 1977)

Comparisons and Reset Machines (Preliminary Report). - Ronald V. Book; Sheila A. Greibach; Celia Wrathall (ICALP, 1978)

On the Complexity of Formal Grammars. - Ronald V. Book (Acta Informatica, 1978)

The Independence of Certain Operations on semiAFLS. - Ronald V. Book; Sheila A. Greibach (RAIRO Theor. Informatics Appl., 1978)

Simple Representations of Certain Classes of Languages. - Ronald V. Book (J. ACM, 1978)

Linear Languages and the Intersection Closures of Classes of Languages. - Ronald V. Book; Maurice Nivat (SIAM J. Comput., 1978)

Celia Wrathall: On Languages Specified by Relative Acceptance. - Ronald V. Book (Theor. Comput. Sci., 1978)

Representing Complexity Classes by Equality Sets (Preliminary Report). - Ronald V. Book; Franz-Josef Brandenburg (ICALP, 1979)

Complexity Classes of Formal Languages (Preliminary Report). - Ronald V. Book (MFCS, 1979)

On Languages Accepted by Space-Bounded Oracle Machines. - Ronald V. Book (Acta Informatica, 1979)

Reset Machines. - Ronald V. Book; Sheila A. Greibach; Celia Wrathall (J. Comput. Syst. Sci., 1979)

Polynomial Space and Transitive Closure. - Ronald V. Book (SIAM J. Comput., 1979)

A Remark on Tally Languages and Complexity Classes - Ronald V. Book (Inf. Control., 1979)

Equality Sets and Complexity Classes. - Ronald V. Book; Franz-Josef Brandenburg (SIAM J. Comput., 1980)

On Uniquely Decipherable Codes with Two Codewords. - Ronald V. Book; Sai Choi Kwan (IEEE Trans. Computers, 1980)

Relativizing Time and Space (Preliminary Report) - Ronald V. Book; Christopher B. Wilson; Mei-rui Xu (FOCS, 1981)

On the Complexity of Word Problems in Certain Thue Systems (Preliminary Report). - Ronald V. Book; Matthias Jantzen; Burkhard Monien; Colm Ó'Dúnlaing; Celia Wrathall (MFCS, 1981)

(Erasing)* Strings. - Ronald V. Book; Matthias Jantzen; Celia Wrathall (Theoretical Computer Science, 1981)

The Undecidability of a Word Problem: On a Conjecture of Strong, Maggiolo-Schettini and Rosen. - Ronald V. Book (Inf. Process. Lett., 1981)

NTS Grammars and Church-Rosser Systems. - Ronald V. Book (Inf. Process. Lett., 1981)

Bounded Query Machines: On NP and PSPACE. - Ronald V. Book (Theor. Comput. Sci., 1981)

Testing for the Church-Rosser Property. - Ronald V. Book; Colm Ó'Dúnlaing (Theor. Comput. Sci., 1981)

Bounded Query Machines: On NP( ) and NPQERY( ). - Ronald V. Book; Celia Wrathall (Theor. Comput. Sci., 1981)

The Power of the Church-Rosser Property for String Rewriting Systems. - Ronald V. Book (CADE, 1982)

Confluent and Other Types of Thue Systems. - Ronald V. Book (J. ACM, 1982)

A Note on Complete Sets and Transitive Closure. - Ronald V. Book; Celia Wrathall (Math. Syst. Theory, 1982)

Relativizing Time, Space, and Time-Space. - Ronald V. Book; Christopher B. Wilson; Xu Mei-Rui (SIAM J. Comput., 1982)

When is a Monoid a Group? The Church-Rosser Case is Tractable. - Ronald V. Book (Theor. Comput. Sci., 1982)

Monadic Thue Systems. - Ronald V. Book; Matthias Jantzen; Celia Wrathall (Theor. Comput. Sci., 1982)

Immunity (Extended Abstract). - Uwe Schöning; Ronald V. Book (ICALP, 1983)

Controlled relativizations of P and NP. - Ronald V. Book; Timothy J. Long; Alan L. Selman (Theoretical Computer Science, 1983)

A Note on Special Thue Systems with a Single Defining Relation. - Ronald V. Book (Math. Syst. Theory, 1983)

Positive Relativizations of Complexity Classes. - Alan L. Selman; Xu Mei-Rui; Ronald V. Book (SIAM J. Comput., 1983)

Decidable Sentences of Church-Rosser Congruences. - Ronald V. Book (Theor. Comput. Sci., 1983)

Refining Nondeterminism in Relativizations of Complexity Classes - Xu Mei-Rui; John E. Donner; Ronald V. Book (J. ACM, 1983)

Sparse Oracles and Uniform Complexity Classes - José L. Balcázar; Ronald V. Book; Timothy J. Long; Uwe Schöning; Alan L. Selman (FOCS, 1984)

Sparse Oracles, Lowness, and Highness. - José L. Balcázar; Ronald V. Book; Uwe Schöning (MFCS, 1984)

Homogeneous Thue systems and the Church-Rosser property. - Ronald V. Book (Discret. Math., 1984)

Almost all one-rule thue systems have decidable word problems. - Ronald V. Book; Craig C. Squier (Discret. Math., 1984)

On Expressing Commutativity by Finite Church-Rosser Presentations: A Note on Commutative Monoids. - Jürgen Avenhaus; Ronald V. Book; Craig C. Squier (RAIRO Theor. Informatics Appl., 1984)

Characterizations of Reduction Classes Modulo Oracle Conditions. - Ronald V. Book; Alan L. Selman (Math. Syst. Theory, 1984)

Quantitative Relativizations of Complexity Classes. - Ronald V. Book; Timothy J. Long; Alan L. Selman (SIAM J. Comput., 1984)

Immunity, Relativizations, and Nondeterminism. - Uwe Schöning; Ronald V. Book (SIAM J. Comput., 1984)

Relativizations of complexity classes. - Ronald V. Book (SIGACT News, 1984)

The Verifiability of Two-Party Protocols. - Ronald V. Book; Friedrich Otto (EUROCRYPT, 1985)

On the Unification Hierarchy. - Ronald V. Book; Jörg H. Siekmann (GWAI, 1985)

The base of the intersection of two free submonoids. - Ronald V. Book (Discret. Appl. Math., 1985)

Cancellation Rules and Extended Word Problems. - Ronald V. Book; Friedrich Otto (Inf. Process. Lett., 1985)

Qualitative Relativizations of Complexity Classes. - Ronald V. Book; Timothy J. Long; Alan L. Selman (J. Comput. Syst. Sci., 1985)

On Bounded Query Machines. - José L. Balcázar; Ronald V. Book; Uwe Schöning (Theor. Comput. Sci., 1985)

On the Security of Name-Stamp Protocols. - Ronald V. Book; Friedrich Otto (Theor. Comput. Sci., 1985)

On the Verifiability of Two-Party Algebraic Protocols. - Ronald V. Book; Friedrich Otto (Theor. Comput. Sci., 1985)

Reductions in Tree Replacement Systems. - Jean H. Gallier; Ronald V. Book (Theor. Comput. Sci., 1985)

On Exponential Lowness. - Ronald V. Book; Pekka Orponen; David A. Russo; Osamu Watanabe 001 (ICALP, 1986)

On Generalized Kolmogorov Complexity. - José L. Balcázar; Ronald V. Book (STACS, 1986)

Sets with Small Generalized Kolmogorov Complexity. - José L. Balcázar; Ronald V. Book (Acta Informatica, 1986)

The polynomial-time hierarchy and sparse oracles. - José L. Balcázar; Ronald V. Book; Uwe Schöning (J. ACM, 1986)

On Unification: Equational Theories Are Not Bounded. - Ronald V. Book; Jörg H. Siekmann (J. Symb. Comput., 1986)

Sparse Sets, Lowness and Highness. - José L. Balcázar; Ronald V. Book; Uwe Schöning (SIAM J. Comput., 1986)

On sets reducible to sparse sets. - Ronald V. Book; Ker-I Ko (SCT, 1987)

Towards a Theory of Relativizations: Positive Relativizations. - Ronald V. Book (STACS, 1987)

Rewriting Systems and Word Problems in a Free Partially Commutative Monoid. - Ronald V. Book; Hai-Ning Liu (Inf. Process. Lett., 1987)

The existence and density of generalized complexity cores. - Ronald V. Book; Ding-Zhu Du (J. ACM, 1987)

Thue Systems as Rewriting Systems. - Ronald V. Book (J. Symb. Comput., 1987)

On polynomial and generalized complexity cores. - Ronald V. Book; Ding-Zhu Du; David A. Russo (SCT, 1988)

Separating Polynomial-Time Turing and Truth-Table Reductions by Tally Sets. - Shouwen Tang; Ronald V. Book (ICALP, 1988)

Sparse Sets, Tally Sets, and Polynomial Reducibilities. - Ronald V. Book (MFCS, 1988)

On Sets Truth-Table Reducible to Sparse Sets. - Ronald V. Book; Ker-I Ko (SIAM J. Comput., 1988)

Lowness Properties of Sets in the Exponential-Time Hierarchy. - Ronald V. Book; Pekka Orponen; David A. Russo; Osamu Watanabe 001 (SIAM J. Comput., 1988)

The Structure of Generalized Complexity Cores. - Ronald V. Book; Ding-Zhu Du (Theor. Comput. Sci., 1988)

A view of structural complexity theory. - Ronald V. Book; Osamu Watanabe 001 (Bull. EATCS, 1989)

A Note on Sparse Sets and the Polynomial-Time Hierarchy. - Ronald V. Book; Shouwen Tang (Inf. Process. Lett., 1989)

On Inefficient Special Cases of NP-Complete Problems. - Ding-Zhu Du; Ronald V. Book (Theor. Comput. Sci., 1989)

On Separating Complexity Classes. - Ronald V. Book (SCT, 1990)

Additional Queries to Random and Pseudorandom Oracles. - Ronald V. Book; Jack H. Lutz; Shouwen Tang (ICALP, 1990)

A Note on Confluent Thue Systems. - Ronald V. Book (IWWERT, 1990)

Characterizing Polynomial Complexity Classes by Reducibilities. - Ronald V. Book; Shouwen Tang (Math. Syst. Theory, 1990)

On Random Oracle Separations. - Ronald V. Book (Inf. Process. Lett., 1991)

On "Inherently Context-Sensitive" Languages - An Application of Complexity Cores. - Volker Diekert; Ronald V. Book (Inf. Process. Lett., 1991)

Reducibilities on tally and sparse sets. - Shouwen Tang; Ronald V. Book (RAIRO Theor. Informatics Appl., 1991)

Some Observations on Separating Complexity Classes. - Ronald V. Book (SIAM J. Comput., 1991)

Polynomial-Time Reducibilities and "Almost All" Oracle Sets. - Shouwen Tang; Ronald V. Book (Theor. Comput. Sci., 1991)

On Languages with Very High Information Content. - Ronald V. Book; Jack H. Lutz (SCT, 1992)

Additional Queries and Algorithmically Random Languages. - Ronald V. Book (Complexity Theory: Current Research, 1992)

Relativizations of the P =?NP and other Problems: Some Developments in Structural Complexity Theory. - Ronald V. Book (ISAAC, 1992)

On Complexity Classes and Algorithmically Random Languages (Extended Abstract). - Ronald V. Book; Jack H. Lutz; Klaus W. Wagner (STACS, 1992)

String-Rewriting Systems. - Ronald V. Book; Friedrich Otto (Springer, 1993)

Relativizing Complexity Classes With Random Oracles. - Ronald V. Book (ISAAC, 1993)

On Languages With Very High Space-Bounded Kolmogorov Complexity. - Ronald V. Book; Jack H. Lutz (SIAM J. Comput., 1993)

A View of Structural Complexity Theory. - Ronald V. Book; Osamu Watanabe 001 (Current Trends in Theoretical Computer Science, 1993)

On Collapsing the Polynomial-Time Hierarchy. - Ronald V. Book (Inf. Process. Lett., 1994)

An Observation on Probability Versus Randomness with Applications to Complexity Classes. - Ronald V. Book; Jack H. Lutz; Klaus W. Wagner (Math. Syst. Theory, 1994)

On Languages Reducible to Algorithmically Random Languages. - Ronald V. Book (SIAM J. Comput., 1994)

Relativizations of the P =? NP and Other Problems: Developments in Structural Complexity Theory. - Ronald V. Book (SIAM Rev., 1994)

The Global Power of Additional Queries to Random Oracles - Ronald V. Book; Jack H. Lutz; David M. Martin Jr. (Inf. Comput., 1995)

On Type-2 Probabilistic Quantifiers. - Ronald V. Book; Heribert Vollmer; Klaus W. Wagner (ICALP, 1996)

On Random Hard Sets for NP. - Ronald V. Book; Osamu Watanabe 001 (Inf. Comput., 1996)

On the Robustness of ALMOST-R. - Ronald V. Book; Elvira Mayordomo (RAIRO Theor. Informatics Appl., 1996)

Probabilistic Type-2 Operators and "Almost"-Classes. - Ronald V. Book; Heribert Vollmer; Klaus W. Wagner (Comput. Complex., 1998)