Ronald V. Book

Publication Activity (10 Years)

Years Active: 1968-1998
Publications (10 Years): 0

Publications

Ronald V. Book, Heribert Vollmer, Klaus W. Wagner
Probabilistic Type-2 Operators and "Almost"-Classes. Comput. Complex. 7 (3) (1998)
Ronald V. Book, Elvira Mayordomo
. RAIRO Theor. Informatics Appl. 30 (2) (1996)
Ronald V. Book, Osamu Watanabe
On Random Hard Sets for NP. Inf. Comput. 125 (1) (1996)
Ronald V. Book, Heribert Vollmer, Klaus W. Wagner
On Type-2 Probabilistic Quantifiers. ICALP (1996)
Ronald V. Book, Heribert Vollmer, Klaus W. Wagner
Probabilistic Type-2 Operators and "Almost"-Classes Electron. Colloquium Comput. Complex. 3 (35) (1996)
Ronald V. Book, Jack H. Lutz, David M. Martin Jr.
The Global Power of Additional Queries to Random Oracles Inf. Comput. 120 (1) (1995)
Ronald V. Book
On Collapsing the Polynomial-Time Hierarchy. Inf. Process. Lett. 52 (5) (1994)
Ronald V. Book
On Languages Reducible to Algorithmically Random Languages. SIAM J. Comput. 23 (6) (1994)
Ronald V. Book, Jack H. Lutz, David M. Martin Jr.
The Global Power of Additional Queries to Random Oracles. STACS (1994)
Ronald V. Book
Relativizations of the P =? NP and Other Problems: Developments in Structural Complexity Theory. SIAM Rev. 36 (2) (1994)
Ronald V. Book, Osamu Watanabe
On Random Hard Sets for NP. ISAAC (1994)
Ronald V. Book, Jack H. Lutz, Klaus W. Wagner
An Observation on Probability Versus Randomness with Applications to Complexity Classes. Math. Syst. Theory 27 (3) (1994)
Ronald V. Book
Relativizing Complexity Classes With Random Oracles. ISAAC (1993)
Ronald V. Book, Jack H. Lutz
On Languages With Very High Space-Bounded Kolmogorov Complexity. SIAM J. Comput. 22 (2) (1993)
Ronald V. Book, Jack H. Lutz, Klaus W. Wagner
On Complexity Classes and Algorithmically Random Languages (Extended Abstract). STACS (1992)
Ronald V. Book
Additional Queries and Algorithmically Random Languages. Complexity Theory: Current Research (1992)
Ronald V. Book
and other Problems: Some Developments in Structural Complexity Theory. ISAAC (1992)
Ronald V. Book, Jack H. Lutz
On Languages with Very High Information Content. Computational Complexity Conference (1992)
Shouwen Tang, Ronald V. Book
Reducibilities on tally and sparse sets. RAIRO Theor. Informatics Appl. 25 (1991)
Ronald V. Book
On Random Oracle Separations. Inf. Process. Lett. 39 (1) (1991)
Ronald V. Book
Some Observations on Separating Complexity Classes. SIAM J. Comput. 20 (2) (1991)
Shouwen Tang, Ronald V. Book
Polynomial-Time Reducibilities and "Almost All" Oracle Sets. Theor. Comput. Sci. 81 (1) (1991)
Volker Diekert, Ronald V. Book
On "Inherently Context-Sensitive" Languages - An Application of Complexity Cores. Inf. Process. Lett. 40 (1) (1991)
Ronald V. Book, Jack H. Lutz, Shouwen Tang
Additional Queries to Random and Pseudorandom Oracles. ICALP (1990)
Ronald V. Book
On Separating Complexity Classes. Computational Complexity Conference (1990)
Ronald V. Book
A Note on Confluent Thue Systems. IWWERT (1990)
Ronald V. Book, Shouwen Tang
Characterizing Polynomial Complexity Classes by Reducibilities. Math. Syst. Theory 23 (3) (1990)
Ronald V. Book, Osamu Watanabe
A view of structural complexity theory. Bull. EATCS 39 (1989)
Ding-Zhu Du, Ronald V. Book
On Inefficient Special Cases of NP-Complete Problems. Theor. Comput. Sci. 63 (3) (1989)
Ronald V. Book, Shouwen Tang
A Note on Sparse Sets and the Polynomial-Time Hierarchy. Inf. Process. Lett. 33 (3) (1989)
Ronald V. Book, Pekka Orponen, David A. Russo, Osamu Watanabe
Lowness Properties of Sets in the Exponential-Time Hierarchy. SIAM J. Comput. 17 (3) (1988)
Ronald V. Book, Ker-I Ko
On Sets Truth-Table Reducible to Sparse Sets. SIAM J. Comput. 17 (5) (1988)
Shouwen Tang, Ronald V. Book
Separating Polynomial-Time Turing and Truth-Table Reductions by Tally Sets. ICALP (1988)
Ronald V. Book, Ding-Zhu Du, David A. Russo
On polynomial and generalized complexity cores. Computational Complexity Conference (1988)
Ronald V. Book, Ding-Zhu Du
The Structure of Generalized Complexity Cores. Theor. Comput. Sci. 61 (1988)
Ronald V. Book
Sparse Sets, Tally Sets, and Polynomial Reducibilities. MFCS (1988)
Ronald V. Book, Ker-I Ko
On sets reducible to sparse sets. Computational Complexity Conference (1987)
Ronald V. Book, Ding-Zhu Du
The existence and density of generalized complexity cores. J. ACM 34 (3) (1987)
Ronald V. Book
Thue Systems as Rewriting Systems. J. Symb. Comput. 3 (1/2) (1987)
Ronald V. Book
Towards a Theory of Relativizations: Positive Relativizations. STACS (1987)
Ronald V. Book, Hai-Ning Liu
Rewriting Systems and Word Problems in a Free Partially Commutative Monoid. Inf. Process. Lett. 26 (1) (1987)
José L. Balcázar, Ronald V. Book
On Generalized Kolmogorov Complexity. STACS (1986)
Ronald V. Book, Jörg H. Siekmann
On Unification: Equational Theories Are Not Bounded. J. Symb. Comput. 2 (4) (1986)
Ronald V. Book, Pekka Orponen, David A. Russo, Osamu Watanabe
On Exponential Lowness. ICALP (1986)
José L. Balcázar, Ronald V. Book, Uwe Schöning
The polynomial-time hierarchy and sparse oracles. J. ACM 33 (3) (1986)
José L. Balcázar, Ronald V. Book
Sets with Small Generalized Kolmogorov Complexity. Acta Informatica 23 (6) (1986)
José L. Balcázar, Ronald V. Book, Uwe Schöning
Sparse Sets, Lowness and Highness. SIAM J. Comput. 15 (3) (1986)
Ronald V. Book, Friedrich Otto
Cancellation Rules and Extended Word Problems. Inf. Process. Lett. 20 (1) (1985)
Jean H. Gallier, Ronald V. Book
Reductions in Tree Replacement Systems. Theor. Comput. Sci. 37 (1985)
Ronald V. Book, Friedrich Otto
On the Verifiability of Two-Party Algebraic Protocols. Theor. Comput. Sci. 40 (1985)
Ronald V. Book
The base of the intersection of two free submonoids. Discret. Appl. Math. 12 (1) (1985)
Ronald V. Book, Friedrich Otto
On the Security of Name-Stamp Protocols. Theor. Comput. Sci. 39 (1985)
José L. Balcázar, Ronald V. Book, Uwe Schöning
On Bounded Query Machines. Theor. Comput. Sci. 40 (1985)
Ronald V. Book, Timothy J. Long, Alan L. Selman
Qualitative Relativizations of Complexity Classes. J. Comput. Syst. Sci. 30 (3) (1985)
Ronald V. Book, Jörg H. Siekmann
On the Unification Hierarchy. GWAI (1985)
Ronald V. Book
Thue Systems as Rewriting Systems. RTA (1985)
Ronald V. Book, Friedrich Otto
The Verifiability of Two-Party Protocols. EUROCRYPT (1985)
Ronald V. Book
Homogeneous Thue systems and the Church-Rosser property. Discret. Math. 48 (2-3) (1984)
Ronald V. Book, Timothy J. Long, Alan L. Selman
Quantitative Relativizations of Complexity Classes. SIAM J. Comput. 13 (3) (1984)
Ronald V. Book
Relativizations of complexity classes. SIGACT News 15 (4) (1984)
Ronald V. Book, Craig C. Squier
Almost all one-rule thue systems have decidable word problems. Discret. Math. 49 (3) (1984)
Ronald V. Book
Relativizations of complexity classes. SIGACT News 16 (1) (1984)
Jürgen Avenhaus, Ronald V. Book, Craig C. Squier
On Expressing Commutativity by Finite Church-Rosser Presentations: A Note on Commutative Monoids. RAIRO Theor. Informatics Appl. 18 (1) (1984)
Uwe Schöning, Ronald V. Book
Immunity, Relativizations, and Nondeterminism. SIAM J. Comput. 13 (2) (1984)
José L. Balcázar, Ronald V. Book, Timothy J. Long, Uwe Schöning, Alan L. Selman
Sparse Oracles and Uniform Complexity Classes FOCS (1984)
José L. Balcázar, Ronald V. Book, Uwe Schöning
Sparse Oracles, Lowness, and Highness. MFCS (1984)
Ronald V. Book, Alan L. Selman
Characterizations of Reduction Classes Modulo Oracle Conditions. Math. Syst. Theory 17 (4) (1984)
Ronald V. Book
Decidable Sentences of Church-Rosser Congruences. Theor. Comput. Sci. 24 (1983)
Ronald V. Book
A Note on Special Thue Systems with a Single Defining Relation. Math. Syst. Theory 16 (1) (1983)
Ronald V. Book, Timothy J. Long, Alan L. Selman
Controlled relativizations of P and NP. Theoretical Computer Science (1983)
Uwe Schöning, Ronald V. Book
Immunity (Extended Abstract). ICALP (1983)
Xu Mei-Rui, John E. Donner, Ronald V. Book
Refining Nondeterminism in Relativizations of Complexity Classes J. ACM 30 (3) (1983)
Alan L. Selman, Xu Mei-Rui, Ronald V. Book
Positive Relativizations of Complexity Classes. SIAM J. Comput. 12 (3) (1983)
Ronald V. Book, Christopher B. Wilson, Xu Mei-Rui
Relativizing Time, Space, and Time-Space. SIAM J. Comput. 11 (3) (1982)
Ronald V. Book, Matthias Jantzen, Celia Wrathall
Monadic Thue Systems. Theor. Comput. Sci. 19 (1982)
Ronald V. Book
The Power of the Church-Rosser Property for String Rewriting Systems. CADE (1982)
Ronald V. Book
Confluent and Other Types of Thue Systems. J. ACM 29 (1) (1982)
Ronald V. Book
When is a Monoid a Group? The Church-Rosser Case is Tractable. Theor. Comput. Sci. 18 (1982)
Ronald V. Book, Celia Wrathall
A Note on Complete Sets and Transitive Closure. Math. Syst. Theory 15 (4) (1982)
Ronald V. Book, Matthias Jantzen, Celia Wrathall
(Erasing)* Strings. Theoretical Computer Science (1981)
Ronald V. Book, Celia Wrathall
Bounded Query Machines: On NP( ) and NPQERY( ). Theor. Comput. Sci. 15 (1981)
Ronald V. Book
Bounded Query Machines: On NP and PSPACE. Theor. Comput. Sci. 15 (1981)
Ronald V. Book
NTS Grammars and Church-Rosser Systems. Inf. Process. Lett. 13 (2) (1981)
Ronald V. Book, Colm Ó'Dúnlaing
Testing for the Church-Rosser Property. Theor. Comput. Sci. 16 (1981)
Ronald V. Book, Matthias Jantzen, Burkhard Monien, Colm Ó'Dúnlaing, Celia Wrathall
On the Complexity of Word Problems in Certain Thue Systems (Preliminary Report). MFCS (1981)
Ronald V. Book
The Undecidability of a Word Problem: On a Conjecture of Strong, Maggiolo-Schettini and Rosen. Inf. Process. Lett. 12 (3) (1981)
Ronald V. Book, Christopher B. Wilson, Mei-rui Xu
Relativizing Time and Space (Preliminary Report) FOCS (1981)
Ronald V. Book, Franz-Josef Brandenburg
Equality Sets and Complexity Classes. SIAM J. Comput. 9 (4) (1980)
Ronald V. Book, Sai Choi Kwan
On Uniquely Decipherable Codes with Two Codewords. IEEE Trans. Computers 29 (4) (1980)
Ronald V. Book
A Remark on Tally Languages and Complexity Classes Inf. Control. 43 (2) (1979)
Ronald V. Book, Franz-Josef Brandenburg
Representing Complexity Classes by Equality Sets (Preliminary Report). ICALP (1979)
Ronald V. Book
On Languages Accepted by Space-Bounded Oracle Machines. Acta Informatica 12 (1979)
Ronald V. Book
Polynomial Space and Transitive Closure. SIAM J. Comput. 8 (3) (1979)
Ronald V. Book
Complexity Classes of Formal Languages (Preliminary Report). MFCS (1979)
Ronald V. Book, Sheila A. Greibach, Celia Wrathall
Reset Machines. J. Comput. Syst. Sci. 19 (3) (1979)
Ronald V. Book
Celia Wrathall: On Languages Specified by Relative Acceptance. Theor. Comput. Sci. 7 (1978)
Ronald V. Book, Sheila A. Greibach, Celia Wrathall
Comparisons and Reset Machines (Preliminary Report). ICALP (1978)
Ronald V. Book
On the Complexity of Formal Grammars. Acta Informatica 9 (1978)
Ronald V. Book, Sheila A. Greibach
The Independence of Certain Operations on semiAFLS. RAIRO Theor. Informatics Appl. 12 (4) (1978)
Ronald V. Book
Simple Representations of Certain Classes of Languages. J. ACM 25 (1) (1978)

Ronald V. Book.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Ronald V. Book