2008 | ||
---|---|---|
170 | EE | Yuri Gurevich, Itay Neeman: DKAL: Distributed-Knowledge Authorization Language. CSF 2008: 149-162 |
169 | EE | Andreas Blass, Yuri Gurevich: One Useful Logic That Defines Its Own Truth. MFCS 2008: 1-15 |
168 | EE | Andreas Blass, Yuri Gurevich: Abstract state machines capture parallel algorithms: Correction and extension. ACM Trans. Comput. Log. 9(3): (2008) |
167 | EE | Andreas Blass, Yuri Gurevich: Program termination and well partial orderings. ACM Trans. Comput. Log. 9(3): (2008) |
166 | EE | Andreas Blass, Nachum Dershowitz, Yuri Gurevich: When are two algorithms the same? CoRR abs/0811.0811: (2008) |
165 | EE | Andreas Blass, Yuri Gurevich: Persistent Queries CoRR abs/0811.0819: (2008) |
164 | EE | Andreas Blass, Yuri Gurevich: One useful logic that defines its own truth CoRR abs/0811.0964: (2008) |
163 | EE | Andreas Blass, Yuri Gurevich: Two Forms of One Useful Logic: Existential Fixed Point Logic and Liberal Datalog CoRR abs/0811.0977: (2008) |
162 | EE | Nikolaj Bjørner, Andreas Blass, Yuri Gurevich, Madan Musuvathi: Modular difference logic is hard CoRR abs/0811.0987: (2008) |
161 | EE | Bernd Finkbeiner, Yuri Gurevich, Alexander K. Petrenko: Preface. Electr. Notes Theor. Comput. Sci. 220(1): 1 (2008) |
2007 | ||
160 | Yuri Gurevich, Bertrand Meyer: Tests and Proofs, First International Conference, TAP 2007, Zurich, Switzerland, February 12-13, 2007. Revised Papers Springer 2007 | |
159 | EE | Yuri Gurevich: Proving Church's Thesis. CSR 2007: 1-3 |
158 | EE | Yuri Gurevich, Dirk Leinders, Jan Van den Bussche: A Theory of Stream Queries. DBPL 2007: 153-168 |
157 | EE | 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 |
156 | EE | Andreas Blass, Yuri Gurevich: Ordinary interactive small-step algorithms, II. ACM Trans. Comput. Log. 8(3): (2007) |
155 | EE | Andreas Blass, Yuri Gurevich: Ordinary interactive small-step algorithms, III. ACM Trans. Comput. Log. 8(3): (2007) |
154 | EE | Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman: Interactive Small-Step Algorithms I: Axiomatization CoRR abs/0707.3782: (2007) |
153 | EE | Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman: Interactive Small-Step Algorithms II: Abstract State Machines and the<br> Characterization Theorem CoRR abs/0707.3789: (2007) |
152 | EE | Bernd Finkbeiner, Yuri Gurevich, Alexander K. Petrenko: Preface. Electr. Notes Theor. Comput. Sci. 190(2): 1 (2007) |
151 | EE | Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman: Interactive Small-Step Algorithms I: Axiomatization. Logical Methods in Computer Science 3(4): (2007) |
150 | EE | 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) |
149 | EE | Yuri Gurevich, Paul Schupp: Membership Problem for the Modular Group. SIAM J. Comput. 37(2): 425-459 (2007) |
148 | EE | Yuri Gurevich, Margus Veanes, Charles Wallace: Can abstract state machines be useful in language theory? Theor. Comput. Sci. 376(1-2): 17-29 (2007) |
2006 | ||
147 | EE | Yuri Gurevich, Charles Wallace: Can Abstract State Machines Be Useful in Language Theory?. Developments in Language Theory 2006: 14-19 |
146 | EE | Andreas Blass, Yuri Gurevich: Ordinary interactive small-step algorithms, I. ACM Trans. Comput. Log. 7(2): 363-419 (2006) |
145 | EE | Howard Barringer, Bernd Finkbeiner, Yuri Gurevich, Henny B. Sipma: Preface. Electr. Notes Theor. Comput. Sci. 144(4): 1 (2006) |
144 | EE | Bernd Finkbeiner, Yuri Gurevich, Alexander K. Petrenko: Preface. Electr. Notes Theor. Comput. Sci. 164(4): 1 (2006) |
2005 | ||
143 | EE | Yuri Gurevich: Behavioral Computation Theory 2005. Abstract State Machines 2005: 72 |
142 | EE | Andreas Blass, Yuri Gurevich, Lev Nachmanson, Margus Veanes: Play to Test. FATES 2005: 32-46 |
141 | EE | Yuri Gurevich: Interactive Algorithms 2005. MFCS 2005: 26-38 |
140 | EE | Yuri Gurevich, Alexander K. Petrenko, Alexander Kossatchev: Preface. Electr. Notes Theor. Comput. Sci. 111: 1-3 (2005) |
139 | EE | Yuri Gurevich, Nikolai Tillmann: Partial updates. Theor. Comput. Sci. 336(2-3): 311-342 (2005) |
138 | EE | Yuri Gurevich, Benjamin Rossman, Wolfram Schulte: Semantic essence of AsmL. Theor. Comput. Sci. 343(3): 370-412 (2005) |
2004 | ||
137 | EE | Yuri Gurevich: Intra-step Interaction. Abstract State Machines 2004: 1-5 |
136 | EE | Yuri Gurevich, Rostislav Yavorskiy: Observations on the Decidability of Transitions. Abstract State Machines 2004: 161-168 |
135 | EE | Yuri Gurevich: Abstract State Machines: An Overview of the Project. FoIKS 2004: 6-13 |
134 | Andreas Blass, Yuri Gurevich: Why Sets? (Column: Logic in Computer Science). Bulletin of the EATCS 84: 139-156 (2004) | |
133 | EE | Uwe Glässer, Yuri Gurevich, Margus Veanes: Abstract Communication Model for Distributed Systems. IEEE Trans. Software Eng. 30(7): 458-472 (2004) |
2003 | ||
132 | EE | Yuri Gurevich, Nikolai Tillmann: Partial Updates Exploration II. Abstract State Machines 2003: 57-86 |
131 | EE | Yuri Gurevich, Benjamin Rossman, Wolfram Schulte: Semantic Essence of AsmL. FMCO 2003: 240-259 |
130 | EE | Yuri Gurevich, Saharon Shelah: Spectra of Monadic Second-Order Formulas with One Unary Function. LICS 2003: 291-300 |
129 | EE | Andreas Blass, Yuri Gurevich: Abstract state machines capture parallel algorithms. ACM Trans. Comput. Log. 4(4): 578-651 (2003) |
128 | Andreas Blass, Yuri Gurevich: Algorithms: A Quest for Absolute Definitions. Bulletin of the EATCS 81: 195-225 (2003) | |
127 | 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) | |
2002 | ||
126 | EE | Uwe Glässer, Yuri Gurevich, Margus Veanes: High-Level Executable Specification of the Universal Plug and Play Architecture. HICSS 2002: 283 |
125 | EE | Wolfgang Grieskamp, Yuri Gurevich, Wolfram Schulte, Margus Veanes: Generating finite state machines from abstract state machines. ISSTA 2002: 112-122 |
124 | EE | Anuj Dawar, Yuri Gurevich: Fixed point logics. Bulletin of Symbolic Logic 8(1): 65-88 (2002) |
123 | Andreas Blass, Yuri Gurevich: Algorithms vs. Machines. Bulletin of the EATCS 77: 96-119 (2002) | |
122 | Andreas Blass, Yuri Gurevich: Pairwise Testing. Bulletin of the EATCS 78: 100-132 (2002) | |
121 | EE | Andreas Blass, Yuri Gurevich, Jan Van den Bussche: Abstract State Machines and Computationally Complete Query Languages. Inf. Comput. 174(1): 20-36 (2002) |
120 | EE | Yuri Gurevich, Alexander Moshe Rabinovich: Definability in Rationals with Real Order in the Background. J. Log. Comput. 12(1): 1-11 (2002) |
119 | Andreas Blass, Yuri Gurevich, Saharon Shelah: On Polynomial Time Computation over Unordered Structures. J. Symb. Log. 67(3): 1093-1125 (2002) | |
2001 | ||
118 | EE | Yuri Gurevich: The Abstract State Machine Paradigm: What Is in and What Is out. Ershov Memorial Conference 2001: 24 |
117 | Yuri Gurevich: Logician in the Land of OS: Abstract State Machines in Microsoft. LICS 2001: 129-138 | |
116 | Yuri Gurevich: AMAST'91 Banquet Talk. Current Trends in Theoretical Computer Science 2001: 247-253 | |
115 | Yuri Gurevich: The Value, if Any, of Decidability. Current Trends in Theoretical Computer Science 2001: 274-280 | |
114 | Yuri Gurevich: Platonism, Constructivism, and Computer Proofs vs. Proofs by Hand. Current Trends in Theoretical Computer Science 2001: 281-302 | |
113 | Anatoli Degtyarev, Yuri Gurevich, Andrei Voronkov: Herbrand's Theorem and Equational Reasoning: Problems and Solutions. Current Trends in Theoretical Computer Science 2001: 303-326 | |
112 | Yuri Gurevich: From Invariants to Canonization. Current Trends in Theoretical Computer Science 2001: 327-331 | |
111 | Yuri Gurevich: The Sequential ASM Thesis. Current Trends in Theoretical Computer Science 2001: 363-392 | |
110 | Andreas Blass, Yuri Gurevich: The Underlying Logic of Hoare Logic. Current Trends in Theoretical Computer Science 2001: 409-436 | |
109 | EE | Andreas Blass, Yuri Gurevich: Inadequacy of computable loop invariants. ACM Trans. Comput. Log. 2(1): 1-11 (2001) |
108 | EE | Yuri Gurevich, Nikolai Tillmann: Partial Updates: Exploration. J. UCS 7(11): 917-951 (2001) |
2000 | ||
107 | Yuri Gurevich, Philipp W. Kutter, Martin Odersky, Lothar Thiele: Abstract State Machines, Theory and Applications, International Workshop, ASM 2000, Monte Verità, Switzerland, March 19-24, 2000, Proceedings Springer 2000 | |
106 | EE | Yuri Gurevich: Invited Talk: ASM Formalware in the Software Engineering Cycle. AMAST 2000: 197 |
105 | EE | Yuri Gurevich, Dean Rosenzweig: Partially Ordered Runs: A Case Study. Abstract State Machines 2000: 131-150 |
104 | EE | Yuri Gurevich, Wolfram Schulte, Charles Wallace: Investigating Java Concurrency Using Abstract State Machines. Abstract State Machines 2000: 151-176 |
103 | EE | Andreas Blass, Yuri Gurevich, Jan Van den Bussche: Abstract State Machines and Computationally Complete Query Languages. Abstract State Machines 2000: 22-33 |
102 | EE | 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 |
101 | EE | Andreas Blass, Yuri Gurevich: Background, Reserve, and Gandy Machines. CSL 2000: 1-17 |
100 | EE | Andreas Blass, Yuri Gurevich: Choiceless Polynominal Time Computation and the Zero-One Law. CSL 2000: 18-40 |
99 | EE | Yuri Gurevich: Sequential abstract-state machines capture sequential algorithms. ACM Trans. Comput. Log. 1(1): 77-111 (2000) |
98 | Andreas Blass, Yuri Gurevich: The Underlying Logic of Hoare Logic. Bulletin of the EATCS 70: 82-111 (2000) | |
97 | Andreas Blass, Yuri Gurevich: A New Zero-One Law and Strong Extension Axioms. Bulletin of the EATCS 72: 103-122 (2000) | |
96 | EE | Thomas Eiter, Yuri Gurevich, Georg Gottlob: Existential second-order logic over strings. J. ACM 47(1): 77-131 (2000) |
95 | Yuri Gurevich, Alexander Moshe Rabinovich: Definability and Undefinability with Real Order at The Background. J. Symb. Log. 65(2): 946-958 (2000) | |
94 | Andreas Blass, Yuri Gurevich: The Logic of Choice. J. Symb. Log. 65(3): 1264-1310 (2000) | |
93 | EE | 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) |
1999 | ||
92 | Andreas Blass, Yuri Gurevich, Saharon Shelah: Choiceless Polynomial Time. Ann. Pure Appl. Logic 100(1-3): 141-187 (1999) | |
91 | Yuri Gurevich: The Sequential ASM Thesis. Bulletin of the EATCS 67: 93 (1999) | |
90 | Yuri Gurevich, Margus Veanes: Logic with Equality: Partisan Corroboration and Shifted Pairing. Inf. Comput. 152(2): 205-235 (1999) | |
89 | EE | Yuri Gurevich, Andrei Voronkov: Monadic Simultaneous Rigid E-unification. Theor. Comput. Sci. 222(1-2): 133-152 (1999) |
1998 | ||
88 | Thomas Eiter, Georg Gottlob, Yuri Gurevich: Existential Second-Order Logic over Strings. LICS 1998: 16-27 | |
87 | EE | Erich Grädel, Yuri Gurevich, Colin Hirsch: The Complexity of Query Reliability. PODS 1998: 227-234 |
86 | EE | Anatoli Degtyarev, Yuri Gurevich, Paliath Narendran, Margus Veanes, Andrei Voronkov: The Decidability of Simultaneous Rigid E-Unification with One Variable. RTA 1998: 181-195 |
85 | EE | Yuri Gurevich, James K. Huggins: Equivalence is in the Eye of the Beholder CoRR cs.SE/9810023: (1998) |
84 | EE | Yuri Gurevich, James K. Huggins: Evolving Algebras and Partial Evaluation CoRR cs.SE/9810024: (1998) |
83 | EE | Yuri Gurevich, James K. Huggins: The Railroad Crossing Problem: An Experiment with Instantaneous Actions and Immediate Reactions CoRR cs.SE/9810026: (1998) |
82 | Erich Grädel, Yuri Gurevich: Metafinite Model Theory. Inf. Comput. 140(1): 26-81 (1998) | |
81 | EE | Andreas Blass, Yuri Gurevich, Vladik Kreinovich, Luc Longpré: A Variation on the Zero-One Law. Inf. Process. Lett. 67(1): 29-30 (1998) |
1997 | ||
80 | Egon Börger, Erich Grädel, Yuri Gurevich: The Classical Decision Problem Springer 1997 | |
79 | Yuri Gurevich, Andrei Voronkov: Monadic Simultaneous Rigid E-Unification and Related Problems. ICALP 1997: 154-165 | |
78 | Natasha Alechina, Yuri Gurevich: Syntax vs. Semantics on Finite Structures. Structures in Logic and Computer Science 1997: 14-33 | |
77 | Yuri Gurevich: From Invariants to Canonization. Bulletin of the EATCS 63: (1997) | |
76 | EE | Yuri Gurevich, Marc Spielmann: Recursive Abstract State Machines. J. UCS 3(4): 233-246 (1997) |
75 | EE | Andreas Blass, Yuri Gurevich: The Linear Time Hierarchy Theorems for Abstract State Machines and RAMs. J. UCS 3(4): 247-278 (1997) |
74 | EE | Scott Dexter, Patrick Doyle, Yuri Gurevich: Gurevich Abstract State Machines and Schoenhage Storage Modification Machines. J. UCS 3(4): 279-303 (1997) |
73 | EE | Yuri Gurevich, Nandit Soparkar, Charles Wallace: Formalizing Database Recovery. J. UCS 3(4): 320-340 (1997) |
72 | EE | Yuri Gurevich, James K. Huggins: Equivalence is in the Eye of the Beholder. Theor. Comput. Sci. 179(1-2): 353-380 (1997) |
1996 | ||
71 | 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) | |
70 | Anatoli Degtyarev, Yuri Gurevich, Andrei Voronkov: Herbrand's Theorem and Equational Reasoning: Problems and Solutions. Bulletin of the EATCS 60: 78-96 (1996) | |
69 | Yuri Gurevich, Saharon Shelah: On Finite Rigid Structures. J. Symb. Log. 61(2): 549-562 (1996) | |
1995 | ||
68 | Charles Wallace, Yuri Gurevich, Nandit Soparkar: Formalizing Recovery in Transaction-Oriented Database Systems. COMAD 1995: 0- | |
67 | Yuri Gurevich, James K. Huggins: The Railroad Crossing Problem: An Experiment with Instantaneous Actions and Immediate Reactions. CSL 1995: 266-290 | |
66 | Yuri Gurevich: A Tribute to Dirk van Dalen - Preface. Ann. Pure Appl. Logic 73(1): 1 (1995) | |
65 | Yuri Gurevich: The Value, if any, of Decidability. Bulletin of the EATCS 55: (1995) | |
64 | Yuri Gurevich: Platonism, Constructivism, and Computer Proofs vs. Proofs by Hand. Bulletin of the EATCS 57: (1995) | |
63 | Erich Grädel, Yuri Gurevich: Tailoring Recursion for Complexity. J. Symb. Log. 60(3): 952-969 (1995) | |
62 | Andreas Blass, Yuri Gurevich: Matrix Transformation Is Complete for the Average Case. SIAM J. Comput. 24(1): 3-29 (1995) | |
1994 | ||
61 | Egon Börger, Yuri Gurevich, Karl Meinke: Computer Science Logic, 7th Workshop, CSL '93, Swansea, United Kingdom, September 13-17, 1993, Selected Papers Springer 1994 | |
60 | Erich Grädel, Yuri Gurevich: Tailoring Recursing for Complexity. ICALP 1994: 118-129 | |
59 | Andreas Blass, Yuri Gurevich: Evolving Algebras and Linear Time Hierarchy. IFIP Congress (1) 1994: 383-390 | |
58 | Yuri Gurevich: Evolving Algebras. IFIP Congress (1) 1994: 423-427 | |
57 | Yuri Gurevich, James K. Huggins: Evolving Algebras and Partial Evaluation. IFIP Congress (1) 1994: 587-592 | |
56 | Erich Grädel, Yuri Gurevich: Metafinite Model Theory. LCC 1994: 313-366 | |
55 | Yuri Gurevich, Neil Immerman, Saharon Shelah: McColm's Conjecture LICS 1994: 10-19 | |
54 | Miklós Ajtai, Yuri Gurevich: Datalog vs First-Order Logic. J. Comput. Syst. Sci. 49(3): 562-588 (1994) | |
1993 | ||
53 | Yuri Gurevich, James K. Huggins: ERRATA to "The Semantics of the C Programming Language". CSL 1993: 334-336 | |
52 | Thomas Eiter, Georg Gottlob, Yuri Gurevich: Curb Your Theory! A Circumspective Approach for Inclusive Interpretation of Disjunctive Information. IJCAI 1993: 634-639 | |
51 | Andreas Blass, Yuri Gurevich: Randomizing Reductions of Search Problems. SIAM J. Comput. 22(5): 949-975 (1993) | |
1992 | ||
50 | Yuri Gurevich, James K. Huggins: The Semantics of the C Programming Language. CSL 1992: 274-308 | |
49 | Yuri Gurevich: Zero-One Laws. Bulletin of the EATCS 46: 90-106 (1992) | |
1991 | ||
48 | Andreas Blass, Yuri Gurevich: Randomizing Reductions of Search Problems. FSTTCS 1991: 10-24 | |
47 | Yuri Gurevich: Average Case Complexity. ICALP 1991: 615-628 | |
46 | Yuri Gurevich: Average Case Completeness. J. Comput. Syst. Sci. 42(3): 346-398 (1991) | |
1990 | ||
45 | Andreas Blass, Yuri Gurevich: On the Reduction Theory for Average Case Complexity. CSL 1990: 17-30 | |
44 | Yuri Gurevich: Matrix Decomposition Problem Is Complete for the Average Case FOCS 1990: 802-811 | |
43 | Yuri Gurevich: On the Classical Desicion Problem. Bulletin of the EATCS 42: 140-150 (1990) | |
42 | Yuri Gurevich: Preface Inf. Comput. 87(1/2): 1 (1990) | |
41 | EE | 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) |
1989 | ||
40 | Yuri Gurevich, Lawrence S. Moss: Algebraic Operational Semantics and Occam. CSL 1989: 176-192 | |
39 | Miklós Ajtai, Yuri Gurevich: Datalog vs. First-Order Logic FOCS 1989: 142-147 | |
38 | Yuri Gurevich, Saharon Shelah: Nearly Linear Time. Logic at Botik 1989: 108-118 | |
37 | Yuri Gurevich: The Logic in computer science Column. Bulletin of the EATCS 38: 93-100 (1989) | |
36 | Yuri Gurevich: Logic in Computer Science Column. Bulletin of the EATCS 39: 112-121 (1989) | |
35 | Andreas Blass, Yuri Gurevich: On Matijasevitch's Nontraditional Approach to Search Problems. Inf. Process. Lett. 32(1): 41-45 (1989) | |
34 | Yuri Gurevich, Saharon Shelah: On the Strength of the Interpretation Method. J. Symb. Log. 54(2): 305-323 (1989) | |
33 | Yuri Gurevich, Saharon Shelah: Time Polynomial in Input or Output. J. Symb. Log. 54(3): 1083-1088 (1989) | |
1988 | ||
32 | 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 | |
31 | Yuri Gurevich: Logic in computer Science Column. Bulletin of the EATCS 35: 71-81 (1988) | |
1987 | ||
30 | Yuri Gurevich, James M. Morris: Algebraic Operational Semantics and Modula-2. CSL 1987: 81-101 | |
29 | Andreas Blass, Yuri Gurevich: Existential Fixed-Point Logic. Computation Theory and Logic 1987: 20-36 | |
28 | Yuri Gurevich: Complete and Incomplete Randomized NP Problems FOCS 1987: 111-117 | |
27 | Yuri Gurevich: Algenraic Operational Semantics. FSTTCS 1987: 1-2 | |
26 | EE | Miklós Ajtai, Yuri Gurevich: Monotone versus positive. J. ACM 34(4): 1004-1015 (1987) |
25 | Yuri Gurevich, Saharon Shelah: Expected Computation Time for Hamiltonian Path Problem. SIAM J. Comput. 16(3): 486-502 (1987) | |
1986 | ||
24 | Larry Denenberg, Yuri Gurevich, Saharon Shelah: Definability by Constant-Depth Polynomial-Size Circuits Information and Control 70(2/3): 216-240 (1986) | |
1985 | ||
23 | Yuri Gurevich, Saharon Shelah: Fixed-Point Extensions of First-Order Logic FOCS 1985: 346-353 | |
22 | 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) | |
21 | Yuri Gurevich, Saharon Shelah: The Decision Problem for Branching Time Logic. J. Symb. Log. 50(3): 668-681 (1985) | |
1984 | ||
20 | Yuri Gurevich, Harry R. Lewis: A Logic for Constant-Depth Circuits Information and Control 61(1): 65-74 (1984) | |
19 | EE | 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) |
18 | Yuri Gurevich, Harry R. Lewis: The Word Problem for Cancellation Semigroups with Zero. J. Symb. Log. 49(1): 184-191 (1984) | |
17 | 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) | |
16 | Andreas Blass, Yuri Gurevich: Equivalence Relations, Invariants, and Normal Forms. SIAM J. Comput. 13(4): 682-689 (1984) | |
1983 | ||
15 | Yuri Gurevich: Algebras of Feasible Functions FOCS 1983: 210-214 | |
14 | Andreas Blass, Yuri Gurevich: Equivalence relations, invariants, and normal forms. Logic and Machines 1983: 24-42 | |
13 | Yuri Gurevich: Decision Problem for Separated Distributive Lattices. J. Symb. Log. 48(1): 193-196 (1983) | |
12 | Yuri Gurevich, Menachem Magidor, Saharon Shelah: The Monadic Theory of omega12. J. Symb. Log. 48(2): 387-398 (1983) | |
11 | Yuri Gurevich, Saharon Shelah: Interpreting Second-Order Logic in the Monadic Theory of Order. J. Symb. Log. 48(3): 816-828 (1983) | |
10 | Yuri Gurevich, Saharon Shelah: Rabin's Uniformization Problem. J. Symb. Log. 48(4): 1105-1119 (1983) | |
9 | Yuri Gurevich, Saharon Shelah: Random Models and the Godel Case of the Decision Problem. J. Symb. Log. 48(4): 1120-1124 (1983) | |
1982 | ||
8 | A. Prasad Sistla, Edmund M. Clarke, Nissim Francez, Yuri Gurevich: Can Message Buffers be Characterized in Linear Temporal Logic? PODC 1982: 148-156 | |
7 | EE | Yuri Gurevich, Harry R. Lewis: The Inference Problem for Template Dependencies. PODS 1982: 221-229 |
6 | Yuri Gurevich, Leo Harrington: Trees, Automata, and Games STOC 1982: 60-65 | |
5 | Yuri Gurevich, Harry R. Lewis: The Inference Problem for Template Dependencies Information and Control 55(1-3): 69-79 (1982) | |
4 | Andreas Blass, Yuri Gurevich: On the Unique Satisfiability Problem Information and Control 55(1-3): 80-88 (1982) | |
1979 | ||
3 | Yuri Gurevich: Modest Theory of Short Chains. I. J. Symb. Log. 44(4): 481-490 (1979) | |
2 | Yuri Gurevich, Saharon Shelah: Modest Theory of Short Chains. II. J. Symb. Log. 44(4): 491-502 (1979) | |
1976 | ||
1 | Yuri Gurevich: The Decision Problem for Standard Classes. J. Symb. Log. 41(2): 460-464 (1976) |