Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Yuri Gurevich
2010 – today
- 2013
[c69]Jean-Baptiste Jeannin, Guido de Caso, Juan Chen, Yuri Gurevich, Prasad Naldurg, Nikhil Swamy: dkal ⋆ : Constructing Executable Specifications of Authorization Protocols. ESSoS 2013: 139-154- 2012
- [j109]Yuri Gurevich, Grant Olney Passmore: Impugning Randomness, Convincingly. Studia Logica 100(1-2): 193-222 (2012)
- [c68]Nikolaj Bjørner, Guido de Caso, Yuri Gurevich: From Primal Infon Logic with Individual Variables to Datalog. Correct Reasoning 2012: 72-86
- [c67]
- [c66]
- [c65]
- 2011
- [j108]Yuri Gurevich, Grant Olney Passmore: Impugning Randomness, Convincingly. Bulletin of the EATCS 104: 112-137 (2011)
- [j107]Yuri Gurevich, Itay Neeman: Logic of infons: The propositional case. ACM Trans. Comput. Log. 12(2): 9 (2011)
- [j106]Andreas Blass, Yuri Gurevich: Persistent queries in the behavioral theory of algorithms. ACM Trans. Comput. Log. 12(2): 16 (2011)
- [p8]Andreas Blass, Yuri Gurevich: Zero-One Laws: Thesauri and Parametric Conditions. Proof, Computation and Agency 2011: 99-114
- [c64]
- 2010
- [j105]Andreas Blass, Yuri Gurevich, Efim Hudis: The Tower-of-Babel Problem, and Security Assesment Sharing. Bulletin of the EATCS 101: 161-182 (2010)
- [j104]Andreas Blass, Yuri Gurevich: Hilbertian Deductive Systems, Infon Logic, and Datalog. Bulletin of the EATCS 102: 122-150 (2010)
- [j103]Bernd Finkbeiner, Yuri Gurevich, Alexander K. Petrenko: Preface. Electr. Notes Theor. Comput. Sci. 264(3): 1 (2010)
- [j102]Nikolaj Bjørner, Andreas Blass, Yuri Gurevich: Content-dependent chunking for differential compression, the local maximum approach. J. Comput. Syst. Sci. 76(3-4): 154-203 (2010)
- [c63]Andreas Blass, Yuri Gurevich, Michal Moskal, Itay Neeman: Evidential Authorization. The Future of Software Engineering 2010: 73-99
- [c62]Andreas Blass, Nachum Dershowitz, Yuri Gurevich: Exact Exploration and Hanging Algorithms. CSL 2010: 140-154
2000 – 2009
- 2009
- [j101]Andreas Blass, Nachum Dershowitz, Yuri Gurevich: When are two algorithms the same? Bulletin of Symbolic Logic 15(2): 145-168 (2009)
- [j100]
- [j99]Bernd Finkbeiner, Yuri Gurevich, Alexander K. Petrenko: Preface. Electr. Notes Theor. Comput. Sci. 253(2): 1 (2009)
- [j98]Margus Veanes, Nikolaj Bjørner, Yuri Gurevich, Wolfram Schulte: Symbolic Bounded Model Checking of Abstract State Machines. Int. J. Software and Informatics 3(2-3): 149-170 (2009)
- [j97]Robert H. Gilman, Yuri Gurevich, Alexei D. Miasnikov: A geometric zero-one law. J. Symb. Log. 74(3): 929-938 (2009)
- [j96]Martin Grohe, Yuri Gurevich, Dirk Leinders, Nicole Schweikardt, Jerzy Tyszkiewicz, Jan Van den Bussche: Database Query Processing Using Finite Cursor Machines. Theory Comput. Syst. 44(4): 533-560 (2009)
- [c61]Yuri Gurevich, Arnab Roy: Operational Semantics for DKAL: Application and Analysis. TrustBus 2009: 149-158
- 2008
- [j95]Nachum Dershowitz, Yuri Gurevich: A Natural Axiomatization of Computability and Proof of Church's Thesis. Bulletin of Symbolic Logic 14(3): 299-350 (2008)
- [j94]Andreas Blass, Yuri Gurevich: Two Forms of One Useful Logic: Existential Fixed Point Logic and Liberal Datalog. Bulletin of the EATCS 95: 164-182 (2008)
- [j93]Bernd Finkbeiner, Yuri Gurevich, Alexander K. Petrenko: Preface. Electr. Notes Theor. Comput. Sci. 220(1): 1 (2008)
- [j92]Andreas Blass, Yuri Gurevich: Program termination and well partial orderings. ACM Trans. Comput. Log. 9(3) (2008)
- [j91]Andreas Blass, Yuri Gurevich: Abstract state machines capture parallel algorithms: Correction and extension. ACM Trans. Comput. Log. 9(3) (2008)
- [c60]
- [c59]
- [i10]Andreas Blass, Nachum Dershowitz, Yuri Gurevich: When are two algorithms the same? CoRR abs/0811.0811 (2008)
- [i9]
- [i8]Andreas Blass, Yuri Gurevich: One useful logic that defines its own truth. CoRR abs/0811.0964 (2008)
- [i7]Andreas Blass, Yuri Gurevich: Two Forms of One Useful Logic: Existential Fixed Point Logic and Liberal Datalog. CoRR abs/0811.0977 (2008)
- [i6]Nikolaj Bjørner, Andreas Blass, Yuri Gurevich, Madan Musuvathi: Modular difference logic is hard. CoRR abs/0811.0987 (2008)
- 2007
- [j90]Andreas Blass, Yuri Gurevich: Zero-One Laws: Thesauri and Parametric Conditions. Bulletin of the EATCS 91: 125-144 (2007)
- [j89]
- [j88]Bernd Finkbeiner, Yuri Gurevich, Alexander K. Petrenko: Preface. Electr. Notes Theor. Comput. Sci. 190(2): 1 (2007)
- [j87]Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman: Interactive Small-Step Algorithms I: Axiomatization. Logical Methods in Computer Science 3(4) (2007)
- [j86]Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman: Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem. Logical Methods in Computer Science 3(4) (2007)
- [j85]Yuri Gurevich, Paul Schupp: Membership Problem for the Modular Group. SIAM J. Comput. 37(2): 425-459 (2007)
- [j84]Yuri Gurevich, Margus Veanes, Charles Wallace: Can abstract state machines be useful in language theory? Theor. Comput. Sci. 376(1-2): 17-29 (2007)
- [j83]Andreas Blass, Yuri Gurevich: Ordinary interactive small-step algorithms, II. ACM Trans. Comput. Log. 8(3) (2007)
- [j82]Andreas Blass, Yuri Gurevich: Ordinary interactive small-step algorithms, III. ACM Trans. Comput. Log. 8(3) (2007)
- [c58]
- [c57]
- [c56]Martin Grohe, Yuri Gurevich, Dirk Leinders, Nicole Schweikardt, Jerzy Tyszkiewicz, Jan Van den Bussche: Database Query Processing Using Finite Cursor Machines. ICDT 2007: 284-298
- [e3]Yuri Gurevich, Bertrand Meyer (Eds.): Tests and Proofs, First International Conference, TAP 2007, Zurich, Switzerland, February 12-13, 2007. Revised Papers. Lecture Notes in Computer Science 4454, Springer 2007, ISBN 978-3-540-73769-8
- [i5]Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman: Interactive Small-Step Algorithms I: Axiomatization. CoRR abs/0707.3782 (2007)
- [i4]Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman: Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem. CoRR abs/0707.3789 (2007)
- 2006
- [j81]Howard Barringer, Bernd Finkbeiner, Yuri Gurevich, Henny B. Sipma: Preface. Electr. Notes Theor. Comput. Sci. 144(4): 1 (2006)
- [j80]Bernd Finkbeiner, Yuri Gurevich, Alexander K. Petrenko: Preface. Electr. Notes Theor. Comput. Sci. 164(4): 1 (2006)
- [j79]Andreas Blass, Yuri Gurevich: Ordinary interactive small-step algorithms, I. ACM Trans. Comput. Log. 7(2): 363-419 (2006)
- [c55]Yuri Gurevich, Charles Wallace: Can Abstract State Machines Be Useful in Language Theory?. Developments in Language Theory 2006: 14-19
- 2005
- [j78]Yuri Gurevich, Alexander K. Petrenko, Alexander Kossatchev: Preface. Electr. Notes Theor. Comput. Sci. 111: 1-3 (2005)
- [j77]
- [j76]Yuri Gurevich, Benjamin Rossman, Wolfram Schulte: Semantic essence of AsmL. Theor. Comput. Sci. 343(3): 370-412 (2005)
- [c54]
- [c53]
- [c52]
- 2004
- [j75]Andreas Blass, Yuri Gurevich: Why Sets? (Column: Logic in Computer Science). Bulletin of the EATCS 84: 139-156 (2004)
- [j74]Uwe Glässer, Yuri Gurevich, Margus Veanes: Abstract Communication Model for Distributed Systems. IEEE Trans. Software Eng. 30(7): 458-472 (2004)
- [c51]
- [c50]Yuri Gurevich, Rostislav Yavorskiy: Observations on the Decidability of Transitions. Abstract State Machines 2004: 161-168
- [c49]
- 2003
- [j73]Andreas Blass, Yuri Gurevich: Algorithms: A Quest for Absolute Definitions. Bulletin of the EATCS 81: 195-225 (2003)
- [j72]Andreas Blass, Yuri Gurevich: Strong extension axioms and Shelah's zero-one law for choiceless polynomial time. J. Symb. Log. 68(1): 65-131 (2003)
- [j71]Andreas Blass, Yuri Gurevich: Abstract state machines capture parallel algorithms. ACM Trans. Comput. Log. 4(4): 578-651 (2003)
- [c48]Yuri Gurevich, Nikolai Tillmann: Partial Updates Exploration II. Abstract State Machines 2003: 57-86
- [c47]
- [c46]Yuri Gurevich, Saharon Shelah: Spectra of Monadic Second-Order Formulas with One Unary Function. LICS 2003: 291-300
- 2002
- [j70]
- [j69]
- [j68]
- [j67]Andreas Blass, Yuri Gurevich, Jan Van den Bussche: Abstract State Machines and Computationally Complete Query Languages. Inf. Comput. 174(1): 20-36 (2002)
- [j66]Andreas Blass, Yuri Gurevich, Saharon Shelah: On Polynomial Time Computation over Unordered Structures. J. Symb. Log. 67(3): 1093-1125 (2002)
- [j65]Yuri Gurevich, Alexander Moshe Rabinovich: Definability in Rationals with Real Order in the Background. J. Log. Comput. 12(1): 1-11 (2002)
- [c45]Uwe Glässer, Yuri Gurevich, Margus Veanes: High-Level Executable Specification of the Universal Plug and Play Architecture. HICSS 2002: 283
- [c44]Wolfgang Grieskamp, Yuri Gurevich, Wolfram Schulte, Margus Veanes: Generating finite state machines from abstract state machines. ISSTA 2002: 112-122
- 2001
- [j64]
- [j63]Andreas Blass, Yuri Gurevich: Inadequacy of computable loop invariants. ACM Trans. Comput. Log. 2(1): 1-11 (2001)
- [p7]
- [p6]Yuri Gurevich: The Value, if Any, of Decidability. Current Trends in Theoretical Computer Science 2001: 274-280
- [p5]Yuri Gurevich: Platonism, Constructivism, and Computer Proofs vs. Proofs by Hand. Current Trends in Theoretical Computer Science 2001: 281-302
- [p4]Anatoli Degtyarev, Yuri Gurevich, Andrei Voronkov: Herbrand's Theorem and Equational Reasoning: Problems and Solutions. Current Trends in Theoretical Computer Science 2001: 303-326
- [p3]Yuri Gurevich: From Invariants to Canonization. Current Trends in Theoretical Computer Science 2001: 327-331
- [p2]Yuri Gurevich: The Sequential ASM Thesis. Current Trends in Theoretical Computer Science 2001: 363-392
- [p1]Andreas Blass, Yuri Gurevich: The Underlying Logic of Hoare Logic. Current Trends in Theoretical Computer Science 2001: 409-436
- [c43]Yuri Gurevich: The Abstract State Machine Paradigm: What Is in and What Is out. Ershov Memorial Conference 2001: 24
- [c42]
- 2000
- [j62]Andreas Blass, Yuri Gurevich: The Underlying Logic of Hoare Logic. Bulletin of the EATCS 70: 82-111 (2000)
- [j61]Andreas Blass, Yuri Gurevich: A New Zero-One Law and Strong Extension Axioms. Bulletin of the EATCS 72: 103-122 (2000)
- [j60]Thomas Eiter, Yuri Gurevich, Georg Gottlob: Existential second-order logic over strings. J. ACM 47(1): 77-131 (2000)
- [j59]Yuri Gurevich, Alexander Moshe Rabinovich: Definability and Undefinability with Real Order at The Background. J. Symb. Log. 65(2): 946-958 (2000)
- [j58]
- [j57]Anatoli Degtyarev, Yuri Gurevich, Paliath Narendran, Margus Veanes, Andrei Voronkov: Decidability and complexity of simultaneous rigid E-unification with one variable and related results. Theor. Comput. Sci. 243(1-2): 167-184 (2000)
- [j56]Yuri Gurevich: Sequential abstract-state machines capture sequential algorithms. ACM Trans. Comput. Log. 1(1): 77-111 (2000)
- [c41]
- [c40]Andreas Blass, Yuri Gurevich, Jan Van den Bussche: Abstract State Machines and Computationally Complete Query Languages. Abstract State Machines 2000: 22-33
- [c39]Yuri Gurevich, Dean Rosenzweig: Partially Ordered Runs: A Case Study. Abstract State Machines 2000: 131-150
- [c38]Yuri Gurevich, Wolfram Schulte, Charles Wallace: Investigating Java Concurrency Using Abstract State Machines. Abstract State Machines 2000: 151-176
- [c37]Michael Barnett, Egon Börger, Yuri Gurevich, Wolfram Schulte, Margus Veanes: Using Abstract State Machines at Microsoft: A Case Study. Abstract State Machines 2000: 367-379
- [c36]
- [c35]Andreas Blass, Yuri Gurevich: Choiceless Polynominal Time Computation and the Zero-One Law. CSL 2000: 18-40
- [e2]Yuri Gurevich, Philipp W. Kutter, Martin Odersky, Lothar Thiele (Eds.): Abstract State Machines, Theory and Applications, International Workshop, ASM 2000, Monte Verità, Switzerland, March 19-24, 2000, Proceedings. Lecture Notes in Computer Science 1912, Springer 2000, ISBN 3-540-67959-6
1990 – 1999
- 1999
- [j55]Andreas Blass, Yuri Gurevich, Saharon Shelah: Choiceless Polynomial Time. Ann. Pure Appl. Logic 100(1-3): 141-187 (1999)
- [j54]
- [j53]Yuri Gurevich, Margus Veanes: Logic with Equality: Partisan Corroboration and Shifted Pairing. Inf. Comput. 152(2): 205-235 (1999)
- [j52]Yuri Gurevich, Andrei Voronkov: Monadic Simultaneous Rigid E-unification. Theor. Comput. Sci. 222(1-2): 133-152 (1999)
- 1998
- [j51]
- [j50]Andreas Blass, Yuri Gurevich, Vladik Kreinovich, Luc Longpré: A Variation on the Zero-One Law. Inf. Process. Lett. 67(1): 29-30 (1998)
- [c34]Thomas Eiter, Georg Gottlob, Yuri Gurevich: Existential Second-Order Logic over Strings. LICS 1998: 16-27
- [c33]
- [c32]Anatoli Degtyarev, Yuri Gurevich, Paliath Narendran, Margus Veanes, Andrei Voronkov: The Decidability of Simultaneous Rigid E-Unification with One Variable. RTA 1998: 181-195
- [i3]Yuri Gurevich, James K. Huggins: Equivalence is in the Eye of the Beholder. CoRR cs.SE/9810023 (1998)
- [i2]Yuri Gurevich, James K. Huggins: Evolving Algebras and Partial Evaluation. CoRR cs.SE/9810024 (1998)
- [i1]Yuri Gurevich, James K. Huggins: The Railroad Crossing Problem: An Experiment with Instantaneous Actions and Immediate Reactions. CoRR cs.SE/9810026 (1998)
- 1997
- [b1]Egon Börger, Erich Grädel, Yuri Gurevich: The Classical Decision Problem. Perspectives in Mathematical Logic, Springer 1997
- [j49]
- [j48]
- [j47]Andreas Blass, Yuri Gurevich: The Linear Time Hierarchy Theorems for Abstract State Machines and RAMs. J. UCS 3(4): 247-278 (1997)
- [j46]Scott Dexter, Patrick Doyle, Yuri Gurevich: Gurevich Abstract State Machines and Schoenhage Storage Modification Machines. J. UCS 3(4): 279-303 (1997)
- [j45]Yuri Gurevich, Nandit Soparkar, Charles Wallace: Formalizing Database Recovery. J. UCS 3(4): 320-340 (1997)
- [j44]Yuri Gurevich, James K. Huggins: Equivalence is in the Eye of the Beholder. Theor. Comput. Sci. 179(1-2): 353-380 (1997)
- [c31]Natasha Alechina, Yuri Gurevich: Syntax vs. Semantics on Finite Structures. Structures in Logic and Computer Science 1997: 14-33
- [c30]Yuri Gurevich, Andrei Voronkov: Monadic Simultaneous Rigid E-Unification and Related Problems. ICALP 1997: 154-165
- 1996
- [j43]Thomas Eiter, Georg Gottlob, Yuri Gurevich: Normal Forms for Second-Order Logic over Finite Structures, and Classification of NP Optimization Problems. Ann. Pure Appl. Logic 78(1-3): 111-125 (1996)
- [j42]Anatoli Degtyarev, Yuri Gurevich, Andrei Voronkov: Herbrand's Theorem and Equational Reasoning: Problems and Solutions. Bulletin of the EATCS 60: 78-96 (1996)
- [j41]
- 1995
- [j40]
- [j39]
- [j38]Yuri Gurevich: Platonism, Constructivism, and Computer Proofs vs. Proofs by Hand. Bulletin of the EATCS 57 (1995)
- [j37]Erich Grädel, Yuri Gurevich: Tailoring Recursion for Complexity. J. Symb. Log. 60(3): 952-969 (1995)
- [j36]Andreas Blass, Yuri Gurevich: Matrix Transformation Is Complete for the Average Case. SIAM J. Comput. 24(1): 3-29 (1995)
- [c29]Charles Wallace, Yuri Gurevich, Nandit Soparkar: Formalizing Recovery in Transaction-Oriented Database Systems. COMAD 1995: 0-
- [c28]Yuri Gurevich, James K. Huggins: The Railroad Crossing Problem: An Experiment with Instantaneous Actions and Immediate Reactions. CSL 1995: 266-290
- 1994
- [j35]Miklós Ajtai, Yuri Gurevich: Datalog vs First-Order Logic. J. Comput. Syst. Sci. 49(3): 562-588 (1994)
- [j34]
- [c27]
- [c26]Andreas Blass, Yuri Gurevich: Evolving Algebras and Linear Time Hierarchy. IFIP Congress (1) 1994: 383-390
- [c25]
- [c24]Yuri Gurevich, James K. Huggins: Evolving Algebras and Partial Evaluation. IFIP Congress (1) 1994: 587-592
- [c23]
- [c22]
- [e1]Egon Börger, Yuri Gurevich, Karl Meinke (Eds.): Computer Science Logic, 7th Workshop, CSL '93, Swansea, United Kingdom, September 13-17, 1993, Selected Papers. Lecture Notes in Computer Science 832, Springer 1994, ISBN 3-540-58277-0
- 1993
- [j33]Andreas Blass, Yuri Gurevich: Randomizing Reductions of Search Problems. SIAM J. Comput. 22(5): 949-975 (1993)
- [c21]Yuri Gurevich, James K. Huggins: ERRATA to "The Semantics of the C Programming Language". CSL 1993: 334-336
- [c20]Thomas Eiter, Georg Gottlob, Yuri Gurevich: Curb Your Theory! A Circumspective Approach for Inclusive Interpretation of Disjunctive Information. IJCAI 1993: 634-639
- 1992
- [j32]
- [c19]
- 1991
- [j31]
- [c18]
- [c17]
- 1990
- [j30]
- [j29]
- [j28]Yuri Gurevich, Saharon Shelah: Nondeterministic Linear-Time Tasks May Require Substantially Nonlinear Deterministic Time in the Case of Sublinear Work Space. J. ACM 37(3): 674-687 (1990)
- [c16]
- [c15]
1980 – 1989
- 1989
- [j27]
- [j26]
- [j25]Andreas Blass, Yuri Gurevich: On Matijasevitch's Nontraditional Approach to Search Problems. Inf. Process. Lett. 32(1): 41-45 (1989)
- [j24]Yuri Gurevich, Saharon Shelah: On the Strength of the Interpretation Method. J. Symb. Log. 54(2): 305-323 (1989)
- [j23]Yuri Gurevich, Saharon Shelah: Time Polynomial in Input or Output. J. Symb. Log. 54(3): 1083-1088 (1989)
- [c14]
- [c13]
- [c12]
- 1988
- [j22]
- [c11]Yuri Gurevich, Saharon Shelah: Nondeterministic Linear-Time Tasks May Require Substantially Nonlinear Deterministic Time in the Case of Sublinear Work Space. STOC 1988: 281-289
- 1987
- [j21]
- [j20]Yuri Gurevich, Saharon Shelah: Expected Computation Time for Hamiltonian Path Problem. SIAM J. Comput. 16(3): 486-502 (1987)
- [c10]Andreas Blass, Yuri Gurevich: Existential Fixed-Point Logic. Computation Theory and Logic 1987: 20-36
- [c9]
- [c8]
- [c7]
- 1986
- [j19]Larry Denenberg, Yuri Gurevich, Saharon Shelah: Definability by Constant-Depth Polynomial-Size Circuits. Information and Control 70(2/3): 216-240 (1986)
- [j18]Amnon Barak, Zvi Drezner, Yuri Gurevich: On the number of active nodes in a multicomputer system. Networks 16(3): 275-282 (1986)
- 1985
- [j17]Andreas Blass, Yuri Gurevich, Dexter Kozen: A Zero-One Law for Logic with a Fixed-Point Operator. Information and Control 67(1-3): 70-90 (1985)
- [j16]Yuri Gurevich, Saharon Shelah: The Decision Problem for Branching Time Logic. J. Symb. Log. 50(3): 668-681 (1985)
- [c6]
- 1984
- [j15]Yuri Gurevich, Harry R. Lewis: A Logic for Constant-Depth Circuits. Information and Control 61(1): 65-74 (1984)
- [j14]Yuri Gurevich, Larry J. Stockmeyer, Uzi Vishkin: Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems. J. ACM 31(3): 459-473 (1984)
- [j13]Yuri Gurevich, Harry R. Lewis: The Word Problem for Cancellation Semigroups with Zero. J. Symb. Log. 49(1): 184-191 (1984)
- [j12]Warren D. Goldfarb, Yuri Gurevich, Saharon Shelah: A Decidable Subclass of the Minimal Godel Class with Identity. J. Symb. Log. 49(4): 1253-1261 (1984)
- [j11]Andreas Blass, Yuri Gurevich: Equivalence Relations, Invariants, and Normal Forms. SIAM J. Comput. 13(4): 682-689 (1984)
- 1983
- [j10]Yuri Gurevich: Decision Problem for Separated Distributive Lattices. J. Symb. Log. 48(1): 193-196 (1983)
- [j9]Yuri Gurevich, Menachem Magidor, Saharon Shelah: The Monadic Theory of omega12. J. Symb. Log. 48(2): 387-398 (1983)
- [j8]Yuri Gurevich, Saharon Shelah: Interpreting Second-Order Logic in the Monadic Theory of Order. J. Symb. Log. 48(3): 816-828 (1983)
- [j7]Yuri Gurevich, Saharon Shelah: Rabin's Uniformization Problem. J. Symb. Log. 48(4): 1105-1119 (1983)
- [j6]Yuri Gurevich, Saharon Shelah: Random Models and the Godel Case of the Decision Problem. J. Symb. Log. 48(4): 1120-1124 (1983)
- [c5]
- [c4]Andreas Blass, Yuri Gurevich: Equivalence relations, invariants, and normal forms. Logic and Machines 1983: 24-42
- 1982
- [j5]Yuri Gurevich, Harry R. Lewis: The Inference Problem for Template Dependencies. Information and Control 55(1-3): 69-79 (1982)
- [j4]Andreas Blass, Yuri Gurevich: On the Unique Satisfiability Problem. Information and Control 55(1-3): 80-88 (1982)
- [c3]A. Prasad Sistla, Edmund M. Clarke, Nissim Francez, Yuri Gurevich: Can Message Buffers be Characterized in Linear Temporal Logic? PODC 1982: 148-156
- [c2]
- [c1]
1970 – 1979
- 1979
- [j3]
- [j2]Yuri Gurevich, Saharon Shelah: Modest Theory of Short Chains. II. J. Symb. Log. 44(4): 491-502 (1979)
- 1976
- [j1]
Coauthor Index
[j106] [p8] [j105] [j104] [j102] [c63] [c62] [j101] [j94] [j92] [j91] [c59] [i10] [i9] [i8] [i7] [i6] [j90] [j89] [j87] [j86] [j83] [j82] [i5] [i4] [j79] [c53] [j75] [j73] [j72] [j71] [j69] [j68] [j67] [j66] [j63] [p1] [j62] [j61] [j58] [c40] [c36] [c35] [j55] [j50] [j47] [j36] [c26] [j33] [c18] [c16] [j25] [c10] [j17] [j11] [c4] [j4]
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-02-26 20:16 CET by the dblp team