Search the dblp DataBase
Ronald V. Book :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Brenda S. Baker , Ronald V. Book Reversal-Bounded Multipushdown Machines. [Citation Graph (1, 0)][DBLP ] J. Comput. Syst. Sci., 1974, v:8, n:3, pp:315-332 [Journal ] Ronald V. Book , Christopher B. Wilson , Xu Mei-Rui Relativizing Time, Space, and Time-Space. [Citation Graph (1, 0)][DBLP ] SIAM J. Comput., 1982, v:11, n:3, pp:571-581 [Journal ] Ronald V. Book Hauptvortrag: Formal language theory and theoretical computer science. [Citation Graph (0, 0)][DBLP ] Automata Theory and Formal Languages, 1975, pp:1-15 [Conf ] Ronald V. Book The Power of the Church-Rosser Property for String Rewriting Systems. [Citation Graph (0, 0)][DBLP ] CADE, 1982, pp:360-368 [Conf ] Ronald V. Book On Separating Complexity Classes. [Citation Graph (0, 0)][DBLP ] Structure in Complexity Theory Conference, 1990, pp:299-304 [Conf ] Ronald V. Book , Jack H. Lutz On Languages with Very High Information Content. [Citation Graph (0, 0)][DBLP ] Structure in Complexity Theory Conference, 1992, pp:255-259 [Conf ] Ronald V. Book Additional Queries and Algorithmically Random Languages. [Citation Graph (0, 0)][DBLP ] Complexity Theory: Current Research, 1992, pp:69-82 [Conf ] Ronald V. Book , Friedrich Otto The Verifiability of Two-Party Protocols. [Citation Graph (0, 0)][DBLP ] EUROCRYPT, 1985, pp:254-260 [Conf ] Brenda S. Baker , Ronald V. Book Reversal-Bounded Multi-Pushdown Machines: Extended Abstract [Citation Graph (0, 0)][DBLP ] FOCS, 1972, pp:207-211 [Conf ] José L. Balcázar , Ronald V. Book , Timothy J. Long , Uwe Schöning , Alan L. Selman Sparse Oracles and Uniform Complexity Classes [Citation Graph (0, 0)][DBLP ] FOCS, 1984, pp:308-311 [Conf ] Ronald V. Book Grammars with Linear Time Functions [Citation Graph (0, 0)][DBLP ] FOCS, 1968, pp:298-305 [Conf ] Ronald V. Book Language Representation Theorems: How to Generate the R. E. Sets from the Regular Sets [Citation Graph (0, 0)][DBLP ] FOCS, 1977, pp:58-61 [Conf ] Ronald V. Book , Christopher B. Wilson , Mei-rui Xu Relativizing Time and Space (Preliminary Report) [Citation Graph (0, 0)][DBLP ] FOCS, 1981, pp:254-259 [Conf ] Ronald V. Book Complexity Classes of Formal Languages (Extended Abstract). [Citation Graph (0, 0)][DBLP ] ICALP, 1972, pp:517-520 [Conf ] Ronald V. Book On the Structure of Complexity Classes. [Citation Graph (0, 0)][DBLP ] ICALP, 1974, pp:437-445 [Conf ] Ronald V. Book , Franz-Josef Brandenburg Representing Complexity Classes by Equality Sets (Preliminary Report). [Citation Graph (0, 0)][DBLP ] ICALP, 1979, pp:49-57 [Conf ] Ronald V. Book , Sheila A. Greibach , Celia Wrathall Comparisons and Reset Machines (Preliminary Report). [Citation Graph (0, 0)][DBLP ] ICALP, 1978, pp:113-124 [Conf ] Ronald V. Book , Jack H. Lutz , Shouwen Tang Additional Queries to Random and Pseudorandom Oracles. [Citation Graph (0, 0)][DBLP ] ICALP, 1990, pp:283-293 [Conf ] Ronald V. Book , Pekka Orponen , David A. Russo , Osamu Watanabe On Exponential Lowness. [Citation Graph (0, 0)][DBLP ] ICALP, 1986, pp:40-49 [Conf ] Ronald V. Book , Heribert Vollmer , Klaus W. Wagner On Type-2 Probabilistic Quantifiers. [Citation Graph (0, 0)][DBLP ] ICALP, 1996, pp:369-380 [Conf ] Ronald V. Book , Chee-Keng Yap On the Computational Power of Reversal-Bounded Machines. [Citation Graph (0, 0)][DBLP ] ICALP, 1977, pp:111-119 [Conf ] Uwe Schöning , Ronald V. Book Immunity (Extended Abstract). [Citation Graph (0, 0)][DBLP ] ICALP, 1983, pp:653-661 [Conf ] Shouwen Tang , Ronald V. Book Separating Polynomial-Time Turing and Truth-Table Reductions by Tally Sets. [Citation Graph (0, 0)][DBLP ] ICALP, 1988, pp:591-599 [Conf ] Ronald V. Book Relativizations of the P =?NP and other Problems: Some Developments in Structural Complexity Theory. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:175-186 [Conf ] Ronald V. Book Relativizing Complexity Classes With Random Oracles. [Citation Graph (0, 0)][DBLP ] ISAAC, 1993, pp:250-258 [Conf ] Ronald V. Book , Osamu Watanabe On Random Hard Sets for NP. [Citation Graph (0, 0)][DBLP ] ISAAC, 1994, pp:47-55 [Conf ] Ronald V. Book A Note on Confluent Thue Systems. [Citation Graph (0, 0)][DBLP ] IWWERT, 1990, pp:231-236 [Conf ] Ronald V. Book , Jörg H. Siekmann On the Unification Hierarchy. [Citation Graph (0, 0)][DBLP ] GWAI, 1985, pp:111-117 [Conf ] José L. Balcázar , Ronald V. Book , Uwe Schöning Sparse Oracles, Lowness, and Highness. [Citation Graph (0, 0)][DBLP ] MFCS, 1984, pp:185-193 [Conf ] Ronald V. Book Complexity Classes of Formal Languages (Preliminary Report). [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:43-56 [Conf ] Ronald V. Book Sparse Sets, Tally Sets, and Polynomial Reducibilities. [Citation Graph (0, 0)][DBLP ] MFCS, 1988, pp:1-13 [Conf ] Ronald V. Book , Matthias Jantzen , Burkhard Monien , Colm Ó'Dúnlaing , Celia Wrathall On the Complexity of Word Problems in Certain Thue Systems (Preliminary Report). [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:216-223 [Conf ] Ronald V. Book Thue Systems as Rewriting Systems. [Citation Graph (0, 0)][DBLP ] RTA, 1985, pp:63-94 [Conf ] José L. Balcázar , Ronald V. Book On Generalized Kolmogorov Complexity. [Citation Graph (0, 0)][DBLP ] STACS, 1986, pp:334-340 [Conf ] Ronald V. Book Towards a Theory of Relativizations: Positive Relativizations. [Citation Graph (0, 0)][DBLP ] STACS, 1987, pp:1-21 [Conf ] Ronald V. Book , Jack H. Lutz , David M. Martin Jr. The Global Power of Additional Queries to Random Oracles. [Citation Graph (0, 0)][DBLP ] STACS, 1994, pp:403-414 [Conf ] Ronald V. Book , Jack H. Lutz , Klaus W. Wagner On Complexity Classes and Algorithmically Random Languages (Extended Abstract). [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:319-328 [Conf ] Ronald V. Book , Sheila A. Greibach Quasi-Realtime Languages-Extended Abstract [Citation Graph (0, 0)][DBLP ] STOC, 1969, pp:15-18 [Conf ] Ronald V. Book , Sheila A. Greibach , Ben Wegbreit Tape- and Time-Bounded Turing Acceptors and AFLs: Extended Abstract [Citation Graph (0, 0)][DBLP ] STOC, 1970, pp:92-99 [Conf ] Ronald V. Book , Maurice Nivat , Mike Paterson Intersections of Linear Context-Free Languages and Reversal-Bounded Multipushdown Machines (Extended Abstract) [Citation Graph (0, 0)][DBLP ] STOC, 1974, pp:290-296 [Conf ] Ronald V. Book , Matthias Jantzen , Celia Wrathall (Erasing)* Strings. [Citation Graph (0, 0)][DBLP ] Theoretical Computer Science, 1981, pp:252-259 [Conf ] Ronald V. Book , Timothy J. Long , Alan L. Selman Controlled relativizations of P and NP. [Citation Graph (0, 0)][DBLP ] Theoretical Computer Science, 1983, pp:85-90 [Conf ] José L. Balcázar , Ronald V. Book Sets with Small Generalized Kolmogorov Complexity. [Citation Graph (0, 0)][DBLP ] Acta Inf., 1986, v:23, n:6, pp:679-688 [Journal ] Ronald V. Book On the Complexity of Formal Grammars. [Citation Graph (0, 0)][DBLP ] Acta Inf., 1978, v:9, n:, pp:171-181 [Journal ] Ronald V. Book On Languages Accepted by Space-Bounded Oracle Machines. [Citation Graph (0, 0)][DBLP ] Acta Inf., 1979, v:12, n:, pp:177-185 [Journal ] Ronald V. Book , Ashok K. Chandra Inherently Nonplanar Automata. [Citation Graph (0, 0)][DBLP ] Acta Inf., 1976, v:6, n:, pp:89-94 [Journal ] Ronald V. Book , Heribert Vollmer , Klaus W. Wagner Probabilistic Type-2 Operators and "Almost"-Classes. [Citation Graph (0, 0)][DBLP ] Computational Complexity, 1998, v:7, n:3, pp:265-289 [Journal ] Ronald V. Book , Osamu Watanabe A view of structural complexity theory. [Citation Graph (0, 0)][DBLP ] Bulletin of the EATCS, 1989, v:39, n:, pp:122-138 [Journal ] Ronald V. Book , Heribert Vollmer , Klaus W. Wagner Probabilistic Type-2 Operators and ``Almost''-Classes [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 1996, v:3, n:35, pp:- [Journal ] Ronald V. Book Tally Languages and Complexity Classes [Citation Graph (0, 0)][DBLP ] Information and Control, 1974, v:26, n:2, pp:186-193 [Journal ] Ronald V. Book A Remark on Tally Languages and Complexity Classes [Citation Graph (0, 0)][DBLP ] Information and Control, 1979, v:43, n:2, pp:198-201 [Journal ] Ronald V. Book , Jack H. Lutz , David M. Martin Jr. The Global Power of Additional Queries to Random Oracles [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1995, v:120, n:1, pp:49-54 [Journal ] Ronald V. Book , Ben Wegbreit A Note on AFLs and Bounding Erasing [Citation Graph (0, 0)][DBLP ] Information and Control, 1971, v:19, n:1, pp:18-29 [Journal ] Ronald V. Book , Osamu Watanabe On Random Hard Sets for NP. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1996, v:125, n:1, pp:70-76 [Journal ] Ronald V. Book The Undecidability of a Word Problem: On a Conjecture of Strong, Maggiolo-Schettini and Rosen. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1981, v:12, n:3, pp:121-122 [Journal ] Ronald V. Book NTS Grammars and Church-Rosser Systems. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1981, v:13, n:2, pp:73-76 [Journal ] Ronald V. Book On Random Oracle Separations. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:39, n:1, pp:7-10 [Journal ] Ronald V. Book On Collapsing the Polynomial-Time Hierarchy. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1994, v:52, n:5, pp:235-237 [Journal ] Ronald V. Book , Hai-Ning Liu Rewriting Systems and Word Problems in a Free Partially Commutative Monoid. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1987, v:26, n:1, pp:29-32 [Journal ] Ronald V. Book , Friedrich Otto Cancellation Rules and Extended Word Problems. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1985, v:20, n:1, pp:5-11 [Journal ] Ronald V. Book , Shouwen Tang A Note on Sparse Sets and the Polynomial-Time Hierarchy. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1989, v:33, n:3, pp:141-143 [Journal ] Volker Diekert , Ronald V. Book On ``Inherently Context-Sensitive'' Languages - An Application of Complexity Cores. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:40, n:1, pp:21-23 [Journal ] Ronald V. Book , Sheila A. Greibach The Independence of Certain Operations on semiAFLS. [Citation Graph (0, 0)][DBLP ] ITA, 1978, v:12, n:4, pp:- [Journal ] Ronald V. Book , Elvira Mayordomo On the Robustness of ALMOST-R . [Citation Graph (0, 0)][DBLP ] ITA, 1996, v:30, n:2, pp:123-133 [Journal ] Jürgen Avenhaus , Ronald V. Book , Craig C. Squier On Expressing Commutativity by Finite Church-Rosser Presentations: A Note on Commutative Monoids. [Citation Graph (0, 0)][DBLP ] ITA, 1984, v:18, n:1, pp:47-52 [Journal ] Shouwen Tang , Ronald V. Book Reducibilities on tally and sparse sets. [Citation Graph (0, 0)][DBLP ] ITA, 1991, v:25, n:, pp:293-304 [Journal ] José L. Balcázar , Ronald V. Book , Uwe Schöning The polynomial-time hierarchy and sparse oracles. [Citation Graph (0, 0)][DBLP ] J. ACM, 1986, v:33, n:3, pp:603-617 [Journal ] Ronald V. Book Simple Representations of Certain Classes of Languages. [Citation Graph (0, 0)][DBLP ] J. ACM, 1978, v:25, n:1, pp:23-31 [Journal ] Ronald V. Book Confluent and Other Types of Thue Systems. [Citation Graph (0, 0)][DBLP ] J. ACM, 1982, v:29, n:1, pp:171-182 [Journal ] Ronald V. Book , Ding-Zhu Du The existence and density of generalized complexity cores. [Citation Graph (0, 0)][DBLP ] J. ACM, 1987, v:34, n:3, pp:718-730 [Journal ] Xu Mei-Rui , John E. Donner , Ronald V. Book Refining Nondeterminism in Relativizations of Complexity Classes [Citation Graph (0, 0)][DBLP ] J. ACM, 1983, v:30, n:3, pp:677-685 [Journal ] Ronald V. Book Time-Bounded Grammars and Their Languages. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1971, v:5, n:4, pp:397-429 [Journal ] Ronald V. Book Comparing Complexity Classes. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1974, v:9, n:2, pp:213-229 [Journal ] Ronald V. Book , Sheila A. Greibach , Oscar H. Ibarra , Ben Wegbreit Tape-Bounded Turing Acceptors and Principal AFLs. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1970, v:4, n:6, pp:622-625 [Journal ] Ronald V. Book , Sheila A. Greibach , Ben Wegbreit Time- and Tape-Bounded Turing Acceptors and AFLs. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1970, v:4, n:6, pp:606-621 [Journal ] Ronald V. Book , Sheila A. Greibach , Celia Wrathall Reset Machines. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1979, v:19, n:3, pp:256-276 [Journal ] Ronald V. Book , Timothy J. Long , Alan L. Selman Qualitative Relativizations of Complexity Classes. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1985, v:30, n:3, pp:395-413 [Journal ] Ronald V. Book Thue Systems as Rewriting Systems. [Citation Graph (0, 0)][DBLP ] J. Symb. Comput., 1987, v:3, n:1/2, pp:39-68 [Journal ] Ronald V. Book , Jörg H. Siekmann On Unification: Equational Theories Are Not Bounded. [Citation Graph (0, 0)][DBLP ] J. Symb. Comput., 1986, v:2, n:4, pp:317-324 [Journal ] Ronald V. Book , Celia Wrathall , Alan L. Selman , David P. Dobkin Inclusion Complete Tally Languages and the Hartmanis-Berman Conjecture. [Citation Graph (0, 0)][DBLP ] Mathematical Systems Theory, 1977, v:11, n:, pp:1-8 [Journal ] Ronald V. Book Multi-Stack-Counter Languages. [Citation Graph (0, 0)][DBLP ] Mathematical Systems Theory, 1972, v:6, n:1, pp:37-48 [Journal ] Ronald V. Book On Languages With a Certain Prefix Property. [Citation Graph (0, 0)][DBLP ] Mathematical Systems Theory, 1977, v:10, n:, pp:229-237 [Journal ] Ronald V. Book A Note on Special Thue Systems with a Single Defining Relation. [Citation Graph (0, 0)][DBLP ] Mathematical Systems Theory, 1983, v:16, n:1, pp:57-60 [Journal ] Ronald V. Book , Sheila A. Greibach Quasi-Realtime Languages. [Citation Graph (0, 0)][DBLP ] Mathematical Systems Theory, 1970, v:4, n:2, pp:97-111 [Journal ] Ronald V. Book , Jack H. Lutz , Klaus W. Wagner An Observation on Probability Versus Randomness with Applications to Complexity Classes. [Citation Graph (0, 0)][DBLP ] Mathematical Systems Theory, 1994, v:27, n:3, pp:201-209 [Journal ] Ronald V. Book , Alan L. Selman Characterizations of Reduction Classes Modulo Oracle Conditions. [Citation Graph (0, 0)][DBLP ] Mathematical Systems Theory, 1984, v:17, n:4, pp:263-277 [Journal ] Ronald V. Book , Shouwen Tang Characterizing Polynomial Complexity Classes by Reducibilities. [Citation Graph (0, 0)][DBLP ] Mathematical Systems Theory, 1990, v:23, n:3, pp:165-174 [Journal ] Ronald V. Book , Celia Wrathall A Note on Complete Sets and Transitive Closure. [Citation Graph (0, 0)][DBLP ] Mathematical Systems Theory, 1982, v:15, n:4, pp:311-313 [Journal ] José L. Balcázar , Ronald V. Book , Uwe Schöning Sparse Sets, Lowness and Highness. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1986, v:15, n:3, pp:739-747 [Journal ] Ronald V. Book Terminal Context in Context-Sensitive Grammars. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1972, v:1, n:1, pp:20-30 [Journal ] Ronald V. Book On Languages Accepted in Polynomial Time. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1972, v:1, n:4, pp:281-287 [Journal ] Ronald V. Book Polynomial Apace and Transitive Closure. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1979, v:8, n:3, pp:434-439 [Journal ] Ronald V. Book Some Observations on Separating Complexity Classes. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1991, v:20, n:2, pp:246-258 [Journal ] Ronald V. Book On Languages Reducible to Algorithmically Random Languages. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1994, v:23, n:6, pp:1275-1282 [Journal ] Ronald V. Book , Franz-Josef Brandenburg Equality Sets and Complexity Classes. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1980, v:9, n:4, pp:729-743 [Journal ] Ronald V. Book , Ker-I Ko On Sets Truth-Table Reducible to Sparse Sets. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1988, v:17, n:5, pp:903-919 [Journal ] Ronald V. Book , Jack H. Lutz On Languages With Very High Space-Bounded Kolmogorov Complexity. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1993, v:22, n:2, pp:395-402 [Journal ] Ronald V. Book , Timothy J. Long , Alan L. Selman Quantitative Relativizations of Complexity Classes. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1984, v:13, n:3, pp:461-487 [Journal ] Ronald V. Book , Maurice Nivat Linear Languages and the Intersection Closures of Classes of Languages. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1978, v:7, n:2, pp:167-177 [Journal ] Ronald V. Book , Maurice Nivat , Mike Paterson Reversal-Bounded Acceptors and Intersections of Linear Languages. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1974, v:3, n:4, pp:283-295 [Journal ] Ronald V. Book , Pekka Orponen , David A. Russo , Osamu Watanabe Lowness Properties of Sets in the Exponential-Time Hierarchy. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1988, v:17, n:3, pp:504-516 [Journal ] Uwe Schöning , Ronald V. Book Immunity, Relativizations, and Nondeterminism. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1984, v:13, n:2, pp:329-337 [Journal ] Alan L. Selman , Xu Mei-Rui , Ronald V. Book Positive Relativizations of Complexity Classes. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1983, v:12, n:3, pp:565-579 [Journal ] Ronald V. Book , Sai Choi Kwan On Uniquely Decipherable Codes with Two Codewords. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 1980, v:29, n:4, pp:324-325 [Journal ] José L. Balcázar , Ronald V. Book , Uwe Schöning On Bounded Query Machines. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1985, v:40, n:, pp:237-243 [Journal ] Ronald V. Book Translational Lemmas, Polynomial Time, and (log n)^j-Space. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1976, v:1, n:3, pp:215-226 [Journal ] Ronald V. Book Celia Wrathall: On Languages Specified by Relative Acceptance. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1978, v:7, n:, pp:185-195 [Journal ] Ronald V. Book Bounded Query Machines: On NP and PSPACE. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1981, v:15, n:, pp:27-39 [Journal ] Ronald V. Book When is a Monoid a Group? The Church-Rosser Case is Tractable. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1982, v:18, n:, pp:325-331 [Journal ] Ronald V. Book Decidable Sentences of Church-Rosser Congruences. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1983, v:24, n:, pp:301-312 [Journal ] Ronald V. Book , Ding-Zhu Du The Structure of Generalized Complexity Cores. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1988, v:61, n:, pp:103-119 [Journal ] Ronald V. Book , Matthias Jantzen , Celia Wrathall Monadic Thue Systems. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1982, v:19, n:, pp:231-251 [Journal ] Ronald V. Book , Colm Ó'Dúnlaing Testing for the Church-Rosser Property. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1981, v:16, n:, pp:223-229 [Journal ] Ronald V. Book , Friedrich Otto On the Security of Name-Stamp Protocols. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1985, v:39, n:, pp:319-325 [Journal ] Ronald V. Book , Friedrich Otto On the Verifiability of Two-Party Algebraic Protocols. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1985, v:40, n:, pp:101-130 [Journal ] Ronald V. Book , Celia Wrathall Bounded Query Machines: On NP( ) and NPQERY( ). [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1981, v:15, n:, pp:41-50 [Journal ] Ding-Zhu Du , Ronald V. Book On Inefficient Special Cases of NP-Complete Problems. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1989, v:63, n:3, pp:239-252 [Journal ] Jean H. Gallier , Ronald V. Book Reductions in Tree Replacement Systems. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1985, v:37, n:, pp:123-150 [Journal ] Shouwen Tang , Ronald V. Book Polynomial-Time Reducibilities and ``Almost All'' Oracle Sets. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1991, v:81, n:1, pp:35-47 [Journal ] Ronald V. Book Homogeneous Thue systems and the Church-Rosser property. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1984, v:48, n:2-3, pp:137-145 [Journal ] Ronald V. Book , Craig C. Squier Almost all one-rule thue systems have decidable word problems. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1984, v:49, n:3, pp:237-240 [Journal ] Search in 0.007secs, Finished in 0.013secs