iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://dblp.dagstuhl.de/pid/58/2261.rss
dblp: Ronald V. Book https://dblp.org/pid/58/2261.html dblp person page RSS feed Thu, 25 Apr 2024 05:56:58 +0200 en-US daily 1 released under the CC0 1.0 license dblp@dagstuhl.de (dblp team) dblp@dagstuhl.de (dblp team) Computers/Computer_Science/Publications/Bibliographies http://www.rssboard.org/rss-specification https://dblp.org/img/logo.144x51.pngdblp: Ronald V. Bookhttps://dblp.org/pid/58/2261.html14451 Probabilistic Type-2 Operators and "Almost"-Classes.https://doi.org/10.1007/s000370050012, , :
Probabilistic Type-2 Operators and "Almost"-Classes. Comput. Complex. 7(3): 265-289 ()]]>https://dblp.org/rec/journals/cc/BookVW98Thu, 01 Jan 1998 00:00:00 +0100 On Random Hard Sets for NP.https://doi.org/10.1006/inco.1996.0022, :
On Random Hard Sets for NP. Inf. Comput. 125(1): 70-76 ()]]>https://dblp.org/rec/journals/iandc/BookW96Mon, 01 Jan 1996 00:00:00 +0100 On the Robustness of ALMOST-R.https://doi.org/10.1051/ita/1996300201231, :
On the Robustness of ALMOST-R. RAIRO Theor. Informatics Appl. 30(2): 123-133 ()]]>https://dblp.org/rec/journals/ita/BookM96Mon, 01 Jan 1996 00:00:00 +0100 On Type-2 Probabilistic Quantifiers.https://doi.org/10.1007/3-540-61440-0_143, , :
On Type-2 Probabilistic Quantifiers. ICALP : 369-380]]>https://dblp.org/rec/conf/icalp/BookVW96Mon, 01 Jan 1996 00:00:00 +0100 Probabilistic Type-2 Operators and "Almost"-Classes.https://eccc.weizmann.ac.il/eccc-reports/1996/TR96-035/index.html, , :
Probabilistic Type-2 Operators and "Almost"-Classes. Electron. Colloquium Comput. Complex. TR96 ()]]>https://dblp.org/rec/journals/eccc/ECCC-TR96-035Mon, 01 Jan 1996 00:00:00 +0100 The Global Power of Additional Queries to Random Oracles.https://doi.org/10.1006/inco.1995.1097, , :
The Global Power of Additional Queries to Random Oracles. Inf. Comput. 120(1): 49-54 ()]]>https://dblp.org/rec/journals/iandc/BookLM95Sat, 01 Jul 1995 01:00:00 +0200 On Collapsing the Polynomial-Time Hierarchy.https://doi.org/10.1016/0020-0190(94)00157-X:
On Collapsing the Polynomial-Time Hierarchy. Inf. Process. Lett. 52(5): 235-237 ()]]>https://dblp.org/rec/journals/ipl/Book94Sat, 01 Jan 1994 00:00:00 +0100 An Observation on Probability Versus Randomness with Applications to Complexity Classes.https://doi.org/10.1007/BF01578842, , :
An Observation on Probability Versus Randomness with Applications to Complexity Classes. Math. Syst. Theory 27(3): 201-209 ()]]>https://dblp.org/rec/journals/mst/BookLW94Sat, 01 Jan 1994 00:00:00 +0100 On Languages Reducible to Algorithmically Random Languages.https://doi.org/10.1137/S0097539793238140:
On Languages Reducible to Algorithmically Random Languages. SIAM J. Comput. 23(6): 1275-1282 ()]]>https://dblp.org/rec/journals/siamcomp/Book94Sat, 01 Jan 1994 00:00:00 +0100 Relativizations of the P =? NP and Other Problems: Developments in Structural Complexity Theory.https://doi.org/10.1137/1036051:
Relativizations of the P =? NP and Other Problems: Developments in Structural Complexity Theory. SIAM Rev. 36(2): 157-175 ()]]>https://dblp.org/rec/journals/siamrev/Book94Sat, 01 Jan 1994 00:00:00 +0100 On Random Hard Sets for NP.https://doi.org/10.1007/3-540-58325-4_165, :
On Random Hard Sets for NP. ISAAC : 47-55]]>https://dblp.org/rec/conf/isaac/BookW94Sat, 01 Jan 1994 00:00:00 +0100 The Global Power of Additional Queries to Random Oracles.https://doi.org/10.1007/3-540-57785-8_158, , :
The Global Power of Additional Queries to Random Oracles. STACS : 403-414]]>https://dblp.org/rec/conf/stacs/BookLM94Sat, 01 Jan 1994 00:00:00 +0100 String-Rewriting Systems.https://doi.org/10.1007/978-1-4613-9771-7, :
String-Rewriting Systems. Texts and Monographs in Computer Science, Springer , ISBN 978-3-540-97965-4, pp. I-VIII, 1-189]]>https://dblp.org/rec/books/daglib/0069623Fri, 01 Jan 1993 00:00:00 +0100 On Languages With Very High Space-Bounded Kolmogorov Complexity.https://doi.org/10.1137/0222029, :
On Languages With Very High Space-Bounded Kolmogorov Complexity. SIAM J. Comput. 22(2): 395-402 ()]]>https://dblp.org/rec/journals/siamcomp/BookL93Fri, 01 Jan 1993 00:00:00 +0100 Relativizing Complexity Classes With Random Oracles.https://doi.org/10.1007/3-540-57568-5_255:
Relativizing Complexity Classes With Random Oracles. ISAAC : 250-258]]>https://dblp.org/rec/conf/isaac/Book93Fri, 01 Jan 1993 00:00:00 +0100 A View of Structural Complexity Theory.https://doi.org/10.1142/9789812794499_0034, :
A View of Structural Complexity Theory. Current Trends in Theoretical Computer Science : 451-468]]>https://dblp.org/rec/series/wsscs/Book093Fri, 01 Jan 1993 00:00:00 +0100 On Languages with Very High Information Content.https://doi.org/10.1109/SCT.1992.215400, :
On Languages with Very High Information Content. SCT : 255-259]]>https://dblp.org/rec/conf/coco/BookL92Wed, 01 Jan 1992 00:00:00 +0100 Additional Queries and Algorithmically Random Languages.https://dblp.org/pid/58/2261.html:
Additional Queries and Algorithmically Random Languages. Complexity Theory: Current Research : 69-82]]>https://dblp.org/rec/conf/dagstuhl/Book92Wed, 01 Jan 1992 00:00:00 +0100 Relativizations of the P =?NP and other Problems: Some Developments in Structural Complexity Theory.https://doi.org/10.1007/3-540-56279-6_70:
Relativizations of the P =?NP and other Problems: Some Developments in Structural Complexity Theory. ISAAC : 175-186]]>https://dblp.org/rec/conf/isaac/Book92Wed, 01 Jan 1992 00:00:00 +0100 On Complexity Classes and Algorithmically Random Languages (Extended Abstract).https://doi.org/10.1007/3-540-55210-3_193, , :
On Complexity Classes and Algorithmically Random Languages (Extended Abstract). STACS : 319-328]]>https://dblp.org/rec/conf/stacs/BookLW92Wed, 01 Jan 1992 00:00:00 +0100 On Random Oracle Separations.https://doi.org/10.1016/0020-0190(91)90054-L:
On Random Oracle Separations. Inf. Process. Lett. 39(1): 7-10 ()]]>https://dblp.org/rec/journals/ipl/Book91Tue, 01 Jan 1991 00:00:00 +0100 On "Inherently Context-Sensitive" Languages - An Application of Complexity Cores.https://doi.org/10.1016/S0020-0190(05)80005-5, :
On "Inherently Context-Sensitive" Languages - An Application of Complexity Cores. Inf. Process. Lett. 40(1): 21-23 ()]]>https://dblp.org/rec/journals/ipl/DiekertB91Tue, 01 Jan 1991 00:00:00 +0100 Reducibilities on tally and sparse sets.https://doi.org/10.1051/ita/1991250302931, :
Reducibilities on tally and sparse sets. RAIRO Theor. Informatics Appl. 25: 293-302 ()]]>https://dblp.org/rec/journals/ita/TangB91Tue, 01 Jan 1991 00:00:00 +0100 Some Observations on Separating Complexity Classes.https://doi.org/10.1137/0220015:
Some Observations on Separating Complexity Classes. SIAM J. Comput. 20(2): 246-258 ()]]>https://dblp.org/rec/journals/siamcomp/Book91Tue, 01 Jan 1991 00:00:00 +0100 Polynomial-Time Reducibilities and "Almost All" Oracle Sets.https://doi.org/10.1016/0304-3975(91)90314-R, :
Polynomial-Time Reducibilities and "Almost All" Oracle Sets. Theor. Comput. Sci. 81(1): 35-47 ()]]>https://dblp.org/rec/journals/tcs/TangB91Tue, 01 Jan 1991 00:00:00 +0100 Rewriting Techniques and Applications, 4th International Conference, RTA-91, Como, Italy, April 10-12, 1991, Proceedings.https://doi.org/10.1007/3-540-53904-2:
Rewriting Techniques and Applications, 4th International Conference, RTA-91, Como, Italy, April 10-12, 1991, Proceedings. Lecture Notes in Computer Science 488, Springer , ISBN 3-540-53904-2 [contents]]]>https://dblp.org/rec/conf/rta/1991Tue, 01 Jan 1991 00:00:00 +0100 Characterizing Polynomial Complexity Classes by Reducibilities.https://doi.org/10.1007/BF02090773, :
Characterizing Polynomial Complexity Classes by Reducibilities. Math. Syst. Theory 23(3): 165-174 ()]]>https://dblp.org/rec/journals/mst/BookT90Mon, 01 Jan 1990 00:00:00 +0100 On Separating Complexity Classes.https://doi.org/10.1109/SCT.1990.113978:
On Separating Complexity Classes. SCT : 299-304]]>https://dblp.org/rec/conf/coco/Book90Mon, 01 Jan 1990 00:00:00 +0100 Additional Queries to Random and Pseudorandom Oracles.https://doi.org/10.1007/BFb0032039, , :
Additional Queries to Random and Pseudorandom Oracles. ICALP : 283-293]]>https://dblp.org/rec/conf/icalp/BookLT90Mon, 01 Jan 1990 00:00:00 +0100 A Note on Confluent Thue Systems.https://doi.org/10.1007/3-540-55124-7_10:
A Note on Confluent Thue Systems. IWWERT : 231-236]]>https://dblp.org/rec/conf/iwwert/Book90Mon, 01 Jan 1990 00:00:00 +0100 A view of structural complexity theory.https://dblp.org/pid/58/2261.html, :
A view of structural complexity theory. Bull. EATCS 39: 122-138 ()]]>https://dblp.org/rec/journals/eatcs/BookW89Sun, 01 Jan 1989 00:00:00 +0100 A Note on Sparse Sets and the Polynomial-Time Hierarchy.https://doi.org/10.1016/0020-0190(89)90193-2, :
A Note on Sparse Sets and the Polynomial-Time Hierarchy. Inf. Process. Lett. 33(3): 141-143 ()]]>https://dblp.org/rec/journals/ipl/BookT89Sun, 01 Jan 1989 00:00:00 +0100 On Inefficient Special Cases of NP-Complete Problems.https://doi.org/10.1016/0304-3975(89)90015-7, :
On Inefficient Special Cases of NP-Complete Problems. Theor. Comput. Sci. 63(3): 239-252 ()]]>https://dblp.org/rec/journals/tcs/DuB89Sun, 01 Jan 1989 00:00:00 +0100 Lowness Properties of Sets in the Exponential-Time Hierarchy.https://doi.org/10.1137/0217030, , , :
Lowness Properties of Sets in the Exponential-Time Hierarchy. SIAM J. Comput. 17(3): 504-516 ()]]>https://dblp.org/rec/journals/siamcomp/BookORW88Fri, 01 Jan 1988 00:00:00 +0100 On Sets Truth-Table Reducible to Sparse Sets.https://doi.org/10.1137/0217056, :
On Sets Truth-Table Reducible to Sparse Sets. SIAM J. Comput. 17(5): 903-919 ()]]>https://dblp.org/rec/journals/siamcomp/BookK88Fri, 01 Jan 1988 00:00:00 +0100 The Structure of Generalized Complexity Cores.https://doi.org/10.1016/0304-3975(88)90119-3, :
The Structure of Generalized Complexity Cores. Theor. Comput. Sci. 61: 103-119 ()]]>https://dblp.org/rec/journals/tcs/BookD88Fri, 01 Jan 1988 00:00:00 +0100 On polynomial and generalized complexity cores.https://doi.org/10.1109/SCT.1988.5283, , :
On polynomial and generalized complexity cores. SCT : 236-250]]>https://dblp.org/rec/conf/coco/BookDR88Fri, 01 Jan 1988 00:00:00 +0100 Separating Polynomial-Time Turing and Truth-Table Reductions by Tally Sets.https://doi.org/10.1007/3-540-19488-6_144, :
Separating Polynomial-Time Turing and Truth-Table Reductions by Tally Sets. ICALP : 591-599]]>https://dblp.org/rec/conf/icalp/TangB88Fri, 01 Jan 1988 00:00:00 +0100 Sparse Sets, Tally Sets, and Polynomial Reducibilities.https://doi.org/10.1007/BFb0017127:
Sparse Sets, Tally Sets, and Polynomial Reducibilities. MFCS : 1-13]]>https://dblp.org/rec/conf/mfcs/Book88Fri, 01 Jan 1988 00:00:00 +0100 Rewriting Systems and Word Problems in a Free Partially Commutative Monoid.https://doi.org/10.1016/0020-0190(87)90032-9, :
Rewriting Systems and Word Problems in a Free Partially Commutative Monoid. Inf. Process. Lett. 26(1): 29-32 ()]]>https://dblp.org/rec/journals/ipl/BookL87Thu, 01 Jan 1987 00:00:00 +0100 The existence and density of generalized complexity cores.https://doi.org/10.1145/28869.28880, :
The existence and density of generalized complexity cores. J. ACM 34(3): 718-730 ()]]>https://dblp.org/rec/journals/jacm/BookD87Thu, 01 Jan 1987 00:00:00 +0100 Thue Systems as Rewriting Systems.https://doi.org/10.1016/S0747-7171(87)80021-4:
Thue Systems as Rewriting Systems. J. Symb. Comput. 3(1/2): 39-68 ()]]>https://dblp.org/rec/journals/jsc/Book87Thu, 01 Jan 1987 00:00:00 +0100 On sets reducible to sparse sets.https://ieeexplore.ieee.org/document/10319264, :
On sets reducible to sparse sets. SCT : 147-154]]>https://dblp.org/rec/conf/coco/BookK87Thu, 01 Jan 1987 00:00:00 +0100 Towards a Theory of Relativizations: Positive Relativizations.https://doi.org/10.1007/BFb0039591:
Towards a Theory of Relativizations: Positive Relativizations. STACS : 1-21]]>https://dblp.org/rec/conf/stacs/Book87Thu, 01 Jan 1987 00:00:00 +0100 Sets with Small Generalized Kolmogorov Complexity.https://doi.org/10.1007/BF00264313, :
Sets with Small Generalized Kolmogorov Complexity. Acta Informatica 23(6): 679-688 ()]]>https://dblp.org/rec/journals/acta/BalcazarB86Wed, 01 Jan 1986 00:00:00 +0100 The polynomial-time hierarchy and sparse oracles.https://doi.org/10.1145/5925.5937, , :
The polynomial-time hierarchy and sparse oracles. J. ACM 33(3): 603-617 ()]]>https://dblp.org/rec/journals/jacm/BalcazarBS86Wed, 01 Jan 1986 00:00:00 +0100 On Unification: Equational Theories Are Not Bounded.https://doi.org/10.1016/S0747-7171(86)80001-3, :
On Unification: Equational Theories Are Not Bounded. J. Symb. Comput. 2(4): 317-324 ()]]>https://dblp.org/rec/journals/jsc/BookS86Wed, 01 Jan 1986 00:00:00 +0100 Sparse Sets, Lowness and Highness.https://doi.org/10.1137/0215053, , :
Sparse Sets, Lowness and Highness. SIAM J. Comput. 15(3): 739-747 ()]]>https://dblp.org/rec/journals/siamcomp/BalcazarBS86Wed, 01 Jan 1986 00:00:00 +0100 On Exponential Lowness.https://doi.org/10.1007/3-540-16761-7_53, , , :
On Exponential Lowness. ICALP : 40-49]]>https://dblp.org/rec/conf/icalp/BookORW86Wed, 01 Jan 1986 00:00:00 +0100 On Generalized Kolmogorov Complexity.https://doi.org/10.1007/3-540-16078-7_87, :
On Generalized Kolmogorov Complexity. STACS : 334-340]]>https://dblp.org/rec/conf/stacs/BalcazarB86Wed, 01 Jan 1986 00:00:00 +0100 The base of the intersection of two free submonoids.https://doi.org/10.1016/0166-218X(85)90036-8:
The base of the intersection of two free submonoids. Discret. Appl. Math. 12(1): 13-20 ()]]>https://dblp.org/rec/journals/dam/Book85Tue, 01 Jan 1985 00:00:00 +0100 Cancellation Rules and Extended Word Problems.https://doi.org/10.1016/0020-0190(85)90122-X, :
Cancellation Rules and Extended Word Problems. Inf. Process. Lett. 20(1): 5-11 ()]]>https://dblp.org/rec/journals/ipl/BookO85Tue, 01 Jan 1985 00:00:00 +0100 Qualitative Relativizations of Complexity Classes.https://doi.org/10.1016/0022-0000(85)90053-4, , :
Qualitative Relativizations of Complexity Classes. J. Comput. Syst. Sci. 30(3): 395-413 ()]]>https://dblp.org/rec/journals/jcss/BookLS85Tue, 01 Jan 1985 00:00:00 +0100 Reductions in Tree Replacement Systems.https://doi.org/10.1016/0304-3975(85)90089-1, :
Reductions in Tree Replacement Systems. Theor. Comput. Sci. 37: 123-150 ()]]>https://dblp.org/rec/journals/tcs/GallierB85Tue, 01 Jan 1985 00:00:00 +0100 On the Security of Name-Stamp Protocols.https://doi.org/10.1016/0304-3975(85)90146-X, :
On the Security of Name-Stamp Protocols. Theor. Comput. Sci. 39: 319-325 ()]]>https://dblp.org/rec/journals/tcs/BookO85Tue, 01 Jan 1985 00:00:00 +0100 On the Verifiability of Two-Party Algebraic Protocols.https://doi.org/10.1016/0304-3975(85)90161-6, :
On the Verifiability of Two-Party Algebraic Protocols. Theor. Comput. Sci. 40: 101-130 ()]]>https://dblp.org/rec/journals/tcs/BookO85aTue, 01 Jan 1985 00:00:00 +0100 On Bounded Query Machines.https://doi.org/10.1016/0304-3975(85)90168-9, , :
On Bounded Query Machines. Theor. Comput. Sci. 40: 237-243 ()]]>https://dblp.org/rec/journals/tcs/BalcazarBS85Tue, 01 Jan 1985 00:00:00 +0100 The Verifiability of Two-Party Protocols.https://doi.org/10.1007/3-540-39805-8_30, :
The Verifiability of Two-Party Protocols. EUROCRYPT : 254-260]]>https://dblp.org/rec/conf/eurocrypt/BookO85Tue, 01 Jan 1985 00:00:00 +0100 On the Unification Hierarchy.https://doi.org/10.1007/978-3-642-71145-9_8, :
On the Unification Hierarchy. GWAI : 111-117]]>https://dblp.org/rec/conf/ki/BookS85Tue, 01 Jan 1985 00:00:00 +0100 Thue Systems as Rewriting Systems.https://doi.org/10.1007/3-540-15976-2_3:
Thue Systems as Rewriting Systems. RTA : 63-94]]>https://dblp.org/rec/conf/rta/Book85Tue, 01 Jan 1985 00:00:00 +0100 Homogeneous Thue systems and the Church-Rosser property.https://doi.org/10.1016/0012-365X(84)90177-8:
Homogeneous Thue systems and the Church-Rosser property. Discret. Math. 48(2-3): 137-145 ()]]>https://dblp.org/rec/journals/dm/Book84Sun, 01 Jan 1984 00:00:00 +0100 Almost all one-rule thue systems have decidable word problems.https://doi.org/10.1016/0012-365X(84)90160-2, :
Almost all one-rule thue systems have decidable word problems. Discret. Math. 49(3): 237-240 ()]]>https://dblp.org/rec/journals/dm/BookS84Sun, 01 Jan 1984 00:00:00 +0100 On Expressing Commutativity by Finite Church-Rosser Presentations: A Note on Commutative Monoids.https://doi.org/10.1051/ita/1984180100471, , :
On Expressing Commutativity by Finite Church-Rosser Presentations: A Note on Commutative Monoids. RAIRO Theor. Informatics Appl. 18(1): 47-52 ()]]>https://dblp.org/rec/journals/ita/AvenhausBS84Sun, 01 Jan 1984 00:00:00 +0100 Characterizations of Reduction Classes Modulo Oracle Conditions.https://doi.org/10.1007/BF01744444, :
Characterizations of Reduction Classes Modulo Oracle Conditions. Math. Syst. Theory 17(4): 263-277 ()]]>https://dblp.org/rec/journals/mst/BookS84Sun, 01 Jan 1984 00:00:00 +0100 Immunity, Relativizations, and Nondeterminism.https://doi.org/10.1137/0213023, :
Immunity, Relativizations, and Nondeterminism. SIAM J. Comput. 13(2): 329-337 ()]]>https://dblp.org/rec/journals/siamcomp/SchoningB84Sun, 01 Jan 1984 00:00:00 +0100 Quantitative Relativizations of Complexity Classes.https://doi.org/10.1137/0213030, , :
Quantitative Relativizations of Complexity Classes. SIAM J. Comput. 13(3): 461-487 ()]]>https://dblp.org/rec/journals/siamcomp/BookLS84Sun, 01 Jan 1984 00:00:00 +0100 Relativizations of complexity classes.https://doi.org/10.1145/1008939.1008945:
Relativizations of complexity classes. SIGACT News 15(4): 61 ()]]>https://dblp.org/rec/journals/sigact/Book84aSun, 01 Jan 1984 00:00:00 +0100 Relativizations of complexity classes.https://doi.org/10.1145/1008949.1008955:
Relativizations of complexity classes. SIGACT News 16(1): 61 ()]]>https://dblp.org/rec/journals/sigact/Book84Sun, 01 Jan 1984 00:00:00 +0100 Sparse Oracles and Uniform Complexity Classes.https://doi.org/10.1109/SFCS.1984.715929, , , , :
Sparse Oracles and Uniform Complexity Classes. FOCS : 308-311]]>https://dblp.org/rec/conf/focs/BalcazarBLSS84Sun, 01 Jan 1984 00:00:00 +0100 Sparse Oracles, Lowness, and Highness.https://doi.org/10.1007/BFb0030298, , :
Sparse Oracles, Lowness, and Highness. MFCS : 185-193]]>https://dblp.org/rec/conf/mfcs/BalcazarBS84Sun, 01 Jan 1984 00:00:00 +0100 Refining Nondeterminism in Relativizations of Complexity Classes.https://doi.org/10.1145/2402.322399, , :
Refining Nondeterminism in Relativizations of Complexity Classes. J. ACM 30(3): 677-685 ()]]>https://dblp.org/rec/journals/jacm/Mei-ruiDB83Fri, 01 Jul 1983 01:00:00 +0200 A Note on Special Thue Systems with a Single Defining Relation.https://doi.org/10.1007/BF01744568:
A Note on Special Thue Systems with a Single Defining Relation. Math. Syst. Theory 16(1): 57-60 ()]]>https://dblp.org/rec/journals/mst/Book83Sat, 01 Jan 1983 00:00:00 +0100 Positive Relativizations of Complexity Classes.https://doi.org/10.1137/0212037, , :
Positive Relativizations of Complexity Classes. SIAM J. Comput. 12(3): 565-579 ()]]>https://dblp.org/rec/journals/siamcomp/SelmanMB83Sat, 01 Jan 1983 00:00:00 +0100 Decidable Sentences of Church-Rosser Congruences.https://doi.org/10.1016/0304-3975(83)90005-1:
Decidable Sentences of Church-Rosser Congruences. Theor. Comput. Sci. 24: 301-312 ()]]>https://dblp.org/rec/journals/tcs/Book83Sat, 01 Jan 1983 00:00:00 +0100 Immunity (Extended Abstract).https://doi.org/10.1007/BFb0036945, :
Immunity (Extended Abstract). ICALP : 653-661]]>https://dblp.org/rec/conf/icalp/SchoningB83Sat, 01 Jan 1983 00:00:00 +0100 Controlled relativizations of P and NP.https://doi.org/10.1007/BFb0009635, , :
Controlled relativizations of P and NP. Theoretical Computer Science : 85-90]]>https://dblp.org/rec/conf/tcs/BookLS83Sat, 01 Jan 1983 00:00:00 +0100 Confluent and Other Types of Thue Systems.https://doi.org/10.1145/322290.322301:
Confluent and Other Types of Thue Systems. J. ACM 29(1): 171-182 ()]]>https://dblp.org/rec/journals/jacm/Book82Fri, 01 Jan 1982 00:00:00 +0100 A Note on Complete Sets and Transitive Closure.https://doi.org/10.1007/BF01786987, :
A Note on Complete Sets and Transitive Closure. Math. Syst. Theory 15(4): 311-313 ()]]>https://dblp.org/rec/journals/mst/BookW82Fri, 01 Jan 1982 00:00:00 +0100 Relativizing Time, Space, and Time-Space.https://doi.org/10.1137/0211048, , :
Relativizing Time, Space, and Time-Space. SIAM J. Comput. 11(3): 571-581 ()]]>https://dblp.org/rec/journals/siamcomp/BookWM82Fri, 01 Jan 1982 00:00:00 +0100 When is a Monoid a Group? The Church-Rosser Case is Tractable.https://doi.org/10.1016/0304-3975(82)90072-X:
When is a Monoid a Group? The Church-Rosser Case is Tractable. Theor. Comput. Sci. 18: 325-331 ()]]>https://dblp.org/rec/journals/tcs/Book82Fri, 01 Jan 1982 00:00:00 +0100 Monadic Thue Systems.https://doi.org/10.1016/0304-3975(82)90036-6, , :
Monadic Thue Systems. Theor. Comput. Sci. 19: 231-251 ()]]>https://dblp.org/rec/journals/tcs/BookJW82Fri, 01 Jan 1982 00:00:00 +0100 The Power of the Church-Rosser Property for String Rewriting Systems.https://doi.org/10.1007/BFb0000070:
The Power of the Church-Rosser Property for String Rewriting Systems. CADE : 360-368]]>https://dblp.org/rec/conf/cade/Book82Fri, 01 Jan 1982 00:00:00 +0100 The Undecidability of a Word Problem: On a Conjecture of Strong, Maggiolo-Schettini and Rosen.https://doi.org/10.1016/0020-0190(81)90108-3:
The Undecidability of a Word Problem: On a Conjecture of Strong, Maggiolo-Schettini and Rosen. Inf. Process. Lett. 12(3): 121-122 ()]]>https://dblp.org/rec/journals/ipl/Book81Thu, 01 Jan 1981 00:00:00 +0100 NTS Grammars and Church-Rosser Systems.https://doi.org/10.1016/0020-0190(81)90036-3:
NTS Grammars and Church-Rosser Systems. Inf. Process. Lett. 13(2): 73-76 ()]]>https://dblp.org/rec/journals/ipl/Book81aThu, 01 Jan 1981 00:00:00 +0100 Bounded Query Machines: On NP and PSPACE.https://doi.org/10.1016/0304-3975(81)90061-X:
Bounded Query Machines: On NP and PSPACE. Theor. Comput. Sci. 15: 27-39 ()]]>https://dblp.org/rec/journals/tcs/Book81Thu, 01 Jan 1981 00:00:00 +0100 Bounded Query Machines: On NP( ) and NPQERY( ).https://doi.org/10.1016/0304-3975(81)90062-1, :
Bounded Query Machines: On NP( ) and NPQERY( ). Theor. Comput. Sci. 15: 41-50 ()]]>https://dblp.org/rec/journals/tcs/BookW81Thu, 01 Jan 1981 00:00:00 +0100 Testing for the Church-Rosser Property.https://doi.org/10.1016/0304-3975(81)90078-5, :
Testing for the Church-Rosser Property. Theor. Comput. Sci. 16: 223-229 ()]]>https://dblp.org/rec/journals/tcs/BookO81Thu, 01 Jan 1981 00:00:00 +0100 Relativizing Time and Space (Preliminary Report).https://doi.org/10.1109/SFCS.1981.39, , :
Relativizing Time and Space (Preliminary Report). FOCS : 254-259]]>https://dblp.org/rec/conf/focs/BookWX81Thu, 01 Jan 1981 00:00:00 +0100 On the Complexity of Word Problems in Certain Thue Systems (Preliminary Report).https://doi.org/10.1007/3-540-10856-4_87, , , , :
On the Complexity of Word Problems in Certain Thue Systems (Preliminary Report). MFCS : 216-223]]>https://dblp.org/rec/conf/mfcs/BookJMOW81Thu, 01 Jan 1981 00:00:00 +0100 (Erasing)* Strings.https://doi.org/10.1007/BFb0017317, , :
(Erasing)* Strings. Theoretical Computer Science : 252-259]]>https://dblp.org/rec/conf/tcs/BookJW81Thu, 01 Jan 1981 00:00:00 +0100 Equality Sets and Complexity Classes.https://doi.org/10.1137/0209057, :
Equality Sets and Complexity Classes. SIAM J. Comput. 9(4): 729-743 ()]]>https://dblp.org/rec/journals/siamcomp/BookB80Tue, 01 Jan 1980 00:00:00 +0100 On Uniquely Decipherable Codes with Two Codewords.https://doi.org/10.1109/TC.1980.1675571, :
On Uniquely Decipherable Codes with Two Codewords. IEEE Trans. Computers 29(4): 324-325 ()]]>https://dblp.org/rec/journals/tc/BookK80Tue, 01 Jan 1980 00:00:00 +0100 On Languages Accepted by Space-Bounded Oracle Machines.https://doi.org/10.1007/BF00266049:
On Languages Accepted by Space-Bounded Oracle Machines. Acta Informatica 12: 177-185 ()]]>https://dblp.org/rec/journals/acta/Book79Mon, 01 Jan 1979 00:00:00 +0100 A Remark on Tally Languages and Complexity Classes.https://doi.org/10.1016/S0019-9958(79)90697-1:
A Remark on Tally Languages and Complexity Classes. Inf. Control. 43(2): 198-201 ()]]>https://dblp.org/rec/journals/iandc/Book79Thu, 01 Nov 1979 00:00:00 +0100 Reset Machines.https://doi.org/10.1016/0022-0000(79)90004-7, , :
Reset Machines. J. Comput. Syst. Sci. 19(3): 256-276 ()]]>https://dblp.org/rec/journals/jcss/BookGW79Mon, 01 Jan 1979 00:00:00 +0100 Polynomial Space and Transitive Closure.https://doi.org/10.1137/0208035:
Polynomial Space and Transitive Closure. SIAM J. Comput. 8(3): 434-439 ()]]>https://dblp.org/rec/journals/siamcomp/Book79Mon, 01 Jan 1979 00:00:00 +0100 Representing Complexity Classes by Equality Sets (Preliminary Report).https://doi.org/10.1007/3-540-09510-1_5, :
Representing Complexity Classes by Equality Sets (Preliminary Report). ICALP : 49-57]]>https://dblp.org/rec/conf/icalp/BookB79Mon, 01 Jan 1979 00:00:00 +0100 Complexity Classes of Formal Languages (Preliminary Report).https://doi.org/10.1007/3-540-09526-8_4:
Complexity Classes of Formal Languages (Preliminary Report). MFCS : 43-56]]>https://dblp.org/rec/conf/mfcs/Book79Mon, 01 Jan 1979 00:00:00 +0100 On the Complexity of Formal Grammars.https://doi.org/10.1007/BF00289076:
On the Complexity of Formal Grammars. Acta Informatica 9: 171-181 ()]]>https://dblp.org/rec/journals/acta/Book78Sun, 01 Jan 1978 00:00:00 +0100 The Independence of Certain Operations on semiAFLS.https://doi.org/10.1051/ita/1978120403691, :
The Independence of Certain Operations on semiAFLS. RAIRO Theor. Informatics Appl. 12(4): 369-385 ()]]>https://dblp.org/rec/journals/ita/BookG78Sun, 01 Jan 1978 00:00:00 +0100 Simple Representations of Certain Classes of Languages.https://doi.org/10.1145/322047.322050:
Simple Representations of Certain Classes of Languages. J. ACM 25(1): 23-31 ()]]>https://dblp.org/rec/journals/jacm/Book78Sun, 01 Jan 1978 00:00:00 +0100 Linear Languages and the Intersection Closures of Classes of Languages.https://doi.org/10.1137/0207016, :
Linear Languages and the Intersection Closures of Classes of Languages. SIAM J. Comput. 7(2): 167-177 ()]]>https://dblp.org/rec/journals/siamcomp/BookN78Sun, 01 Jan 1978 00:00:00 +0100 Celia Wrathall: On Languages Specified by Relative Acceptance.https://doi.org/10.1016/0304-3975(78)90048-8:
Celia Wrathall: On Languages Specified by Relative Acceptance. Theor. Comput. Sci. 7: 185-195 ()]]>https://dblp.org/rec/journals/tcs/Book78Sun, 01 Jan 1978 00:00:00 +0100 Comparisons and Reset Machines (Preliminary Report).https://doi.org/10.1007/3-540-08860-1_10, , :
Comparisons and Reset Machines (Preliminary Report). ICALP : 113-124]]>https://dblp.org/rec/conf/icalp/BookGW78Sun, 01 Jan 1978 00:00:00 +0100 On Languages With a Certain Prefix Property.https://doi.org/10.1007/BF01683274:
On Languages With a Certain Prefix Property. Math. Syst. Theory 10: 229-237 ()]]>https://dblp.org/rec/journals/mst/Book77Sat, 01 Jan 1977 00:00:00 +0100 Inclusion Complete Tally Languages and the Hartmanis-Berman Conjecture.https://doi.org/10.1007/BF01768464, , , :
Inclusion Complete Tally Languages and the Hartmanis-Berman Conjecture. Math. Syst. Theory 11: 1-8 ()]]>https://dblp.org/rec/journals/mst/BookWSD77Sat, 01 Jan 1977 00:00:00 +0100 Language Representation Theorems: How to Generate the R. E. Sets from the Regular Sets.https://doi.org/10.1109/SFCS.1977.15:
Language Representation Theorems: How to Generate the R. E. Sets from the Regular Sets. FOCS : 58-61]]>https://dblp.org/rec/conf/focs/Book77Sat, 01 Jan 1977 00:00:00 +0100 On the Computational Power of Reversal-Bounded Machines.https://doi.org/10.1007/3-540-08342-1_9, :
On the Computational Power of Reversal-Bounded Machines. ICALP : 111-119]]>https://dblp.org/rec/conf/icalp/BookY77Sat, 01 Jan 1977 00:00:00 +0100 Inherently Nonplanar Automata.https://doi.org/10.1007/BF00263745, :
Inherently Nonplanar Automata. Acta Informatica 6: 89-94 ()]]>https://dblp.org/rec/journals/acta/BookC76Thu, 01 Jan 1976 00:00:00 +0100 Translational Lemmas, Polynomial Time, and (log n)^j-Space.https://doi.org/10.1016/0304-3975(76)90057-8:
Translational Lemmas, Polynomial Time, and (log n)^j-Space. Theor. Comput. Sci. 1(3): 215-226 ()]]>https://dblp.org/rec/journals/tcs/Book76Thu, 01 Jan 1976 00:00:00 +0100 Hauptvortrag: Formal language theory and theoretical computer science.https://doi.org/10.1007/3-540-07407-4_1:
Hauptvortrag: Formal language theory and theoretical computer science. Automata Theory and Formal Languages : 1-15]]>https://dblp.org/rec/conf/automata/Book75Wed, 01 Jan 1975 00:00:00 +0100 Mutually divisible semigroups.https://doi.org/10.1016/0012-365X(74)90079-X, :
Mutually divisible semigroups. Discret. Math. 9(4): 329-332 ()]]>https://dblp.org/rec/journals/dm/BookH74Tue, 01 Jan 1974 00:00:00 +0100 Tally Languages and Complexity Classes.https://doi.org/10.1016/S0019-9958(74)90473-2:
Tally Languages and Complexity Classes. Inf. Control. 26(2): 186-193 ()]]>https://dblp.org/rec/journals/iandc/Book74Tue, 01 Oct 1974 00:00:00 +0100 Reversal-Bounded Multipushdown Machines.https://doi.org/10.1016/S0022-0000(74)80027-9, :
Reversal-Bounded Multipushdown Machines. J. Comput. Syst. Sci. 8(3): 315-332 ()]]>https://dblp.org/rec/journals/jcss/BakerB74Tue, 01 Jan 1974 00:00:00 +0100 Comparing Complexity Classes.https://doi.org/10.1016/S0022-0000(74)80008-5:
Comparing Complexity Classes. J. Comput. Syst. Sci. 9(2): 213-229 ()]]>https://dblp.org/rec/journals/jcss/Book74Tue, 01 Jan 1974 00:00:00 +0100 Reversal-Bounded Acceptors and Intersections of Linear Languages.https://doi.org/10.1137/0203023, , :
Reversal-Bounded Acceptors and Intersections of Linear Languages. SIAM J. Comput. 3(4): 283-295 ()]]>https://dblp.org/rec/journals/siamcomp/BookNP74Tue, 01 Jan 1974 00:00:00 +0100 On the Structure of Complexity Classes.https://doi.org/10.1007/3-540-06841-4_80:
On the Structure of Complexity Classes. ICALP : 437-445]]>https://dblp.org/rec/conf/icalp/Book74Tue, 01 Jan 1974 00:00:00 +0100 Intersections of Linear Context-Free Languages and Reversal-Bounded Multipushdown Machines (Extended Abstract).https://doi.org/10.1145/800119.803906, , :
Intersections of Linear Context-Free Languages and Reversal-Bounded Multipushdown Machines (Extended Abstract). STOC : 290-296]]>https://dblp.org/rec/conf/stoc/BookNP74Tue, 01 Jan 1974 00:00:00 +0100 Free and almost-free subsemigroups of a free semigroup.https://doi.org/10.1016/S0012-365X(73)80004-4:
Free and almost-free subsemigroups of a free semigroup. Discret. Math. 4(3): 233-241 ()]]>https://dblp.org/rec/journals/dm/Book73Mon, 01 Jan 1973 00:00:00 +0100 On the structure of context-sensitive grammars.https://doi.org/10.1007/BF00976059:
On the structure of context-sensitive grammars. Int. J. Parallel Program. 2(2): 129-139 ()]]>https://dblp.org/rec/journals/ijpp/Book73Mon, 01 Jan 1973 00:00:00 +0100 Multi-Stack-Counter Languages.https://doi.org/10.1007/BF01706072, :
Multi-Stack-Counter Languages. Math. Syst. Theory 6(1): 37-48 ()]]>https://dblp.org/rec/journals/mst/Book72Sat, 01 Jan 1972 00:00:00 +0100 Terminal Context in Context-Sensitive Grammars.https://doi.org/10.1137/0201003:
Terminal Context in Context-Sensitive Grammars. SIAM J. Comput. 1(1): 20-30 ()]]>https://dblp.org/rec/journals/siamcomp/Book72Sat, 01 Jan 1972 00:00:00 +0100 On Languages Accepted in Polynomial Time.https://doi.org/10.1137/0201019:
On Languages Accepted in Polynomial Time. SIAM J. Comput. 1(4): 281-287 ()]]>https://dblp.org/rec/journals/siamcomp/Book72aSat, 01 Jan 1972 00:00:00 +0100 Reversal-Bounded Multi-Pushdown Machines: Extended Abstract.https://doi.org/10.1109/SWAT.1972.21, :
Reversal-Bounded Multi-Pushdown Machines: Extended Abstract. SWAT : 207-211]]>https://dblp.org/rec/conf/focs/BakerB72Sat, 01 Jan 1972 00:00:00 +0100 Complexity Classes of Formal Languages (Extended Abstract).https://dblp.org/pid/58/2261.html:
Complexity Classes of Formal Languages (Extended Abstract). ICALP : 517-520]]>https://dblp.org/rec/conf/icalp/Book72Sat, 01 Jan 1972 00:00:00 +0100 A Note on AFLs and Bounding Erasing.https://doi.org/10.1016/S0019-9958(71)80004-9, :
A Note on AFLs and Bounding Erasing. Inf. Control. 19(1): 18-29 ()]]>https://dblp.org/rec/journals/iandc/BookW71Sun, 01 Aug 1971 00:00:00 +0100 Time-Bounded Grammars and Their Languages.https://doi.org/10.1016/S0022-0000(71)80025-9:
Time-Bounded Grammars and Their Languages. J. Comput. Syst. Sci. 5(4): 397-429 ()]]>https://dblp.org/rec/journals/jcss/Book71Fri, 01 Jan 1971 00:00:00 +0100 Ambiguity in Graphs and Expressions.https://doi.org/10.1109/T-C.1971.223204, , , :
Ambiguity in Graphs and Expressions. IEEE Trans. Computers 20(2): 149-153 ()]]>https://dblp.org/rec/journals/tc/BookEGO71Fri, 01 Jan 1971 00:00:00 +0100 Time- and Tape-Bounded Turing Acceptors and AFLs.https://doi.org/10.1016/S0022-0000(70)80031-9, , :
Time- and Tape-Bounded Turing Acceptors and AFLs. J. Comput. Syst. Sci. 4(6): 606-621 ()]]>https://dblp.org/rec/journals/jcss/BookGW70Thu, 01 Jan 1970 00:00:00 +0100 Tape-Bounded Turing Acceptors and Principal AFLs.https://doi.org/10.1016/S0022-0000(70)80032-0, , , :
Tape-Bounded Turing Acceptors and Principal AFLs. J. Comput. Syst. Sci. 4(6): 622-625 ()]]>https://dblp.org/rec/journals/jcss/BookGIW70Thu, 01 Jan 1970 00:00:00 +0100 Quasi-Realtime Languages.https://doi.org/10.1007/BF01705890, :
Quasi-Realtime Languages. Math. Syst. Theory 4(2): 97-111 ()]]>https://dblp.org/rec/journals/mst/BookG70Thu, 01 Jan 1970 00:00:00 +0100 Tape- and Time-Bounded Turing Acceptors and AFLs: Extended Abstract.https://doi.org/10.1145/800161.805154, , :
Tape- and Time-Bounded Turing Acceptors and AFLs: Extended Abstract. STOC : 92-99]]>https://dblp.org/rec/conf/stoc/BookGW70Thu, 01 Jan 1970 00:00:00 +0100 Quasi-Realtime Languages-Extended Abstract.https://doi.org/10.1145/800169.805416, :
Quasi-Realtime Languages-Extended Abstract. STOC : 15-18]]>https://dblp.org/rec/conf/stoc/BookG69Wed, 01 Jan 1969 00:00:00 +0100 Grammars with Linear Time Functions.https://doi.org/10.1109/SWAT.1968.11:
Grammars with Linear Time Functions. SWAT : 298-305]]>https://dblp.org/rec/conf/focs/Book68Mon, 01 Jan 1968 00:00:00 +0100