 | 
| |
Online DBLP entries are available for Yuri Gurevich and the following references. (The DiSC DBLP references below have been taken from the Novemember 1998 DBLP.)
- Erich Grädel,
Yuri Gurevich,
Colin Hirch:
The Complexity of Query Reliability.
PODS 1998: 227-234
- Anatoli Degtyarev,
Yuri Gurevich,
Paliath Narendran,
Margus Veanes,
Andrei Voronkov:
The Decidability of Simultaneous Rigid E-Unification with One Variable.
RTA 1998: 181-195
- Andreas Blass,
Yuri Gurevich,
Vladik Kreinovich,
Luc Longpré:
A Variation on the Zero-One Law.
Information Processing Letters 67(1): 29-30 (1998)
- Erich Grädel,
Yuri Gurevich:
Metafinite Model Theory.
Information and Computation 140(1): 26-81 (1998)
- Yuri Gurevich,
Andrei Voronkov:
Monadic Simultaneous Rigid E-Unification and Related Problems.
ICALP 1997: 154-165
- Yuri Gurevich,
James K. Huggins:
Equivalence is in the Eye of the Beholder.
TCS 179(1-2): 353-380 (1997)
- Charles Wallace,
Yuri Gurevich,
Nandit Soparkar:
Formalizing Recovery in Transaction-Oriented Database Systems.
COMAD 1995: 0-
- Yuri Gurevich,
James K. Huggins:
The Railroad Crossing Problem: An Experiment with Instantaneous Actions and Immediate Reactions.
CSL 1995: 266-290
- Andreas Blass,
Yuri Gurevich:
Matrix Transformation Is Complete for the Average Case.
SIAM J. Comput. 24(1): 3-29 (1995)
- Erich Grädel,
Yuri Gurevich:
Tailoring Recursing for Complexity.
ICALP 1994: 118-129
- Andreas Blass,
Yuri Gurevich:
Evolving Algebras and Linear Time Hierarchy.
IFIP Congress, Vol. 1 1994: 383-390
- Yuri Gurevich:
Evolving Algebras.
IFIP Congress, Vol. 1 1994: 423-427
- Yuri Gurevich,
James K. Huggins:
Evolving Algebras and Partial Evaluation.
IFIP Congress, Vol. 1 1994: 587-592
- Yuri Gurevich,
Neil Immerman,
Saharon Shelah:
McColm's Conjecture.
LICS 1994: 10-19
- Miklós Ajtai,
Yuri Gurevich:
Datalog vs First-Order Logic.
JCSS 49(3): 562-588 (1994)
- Yuri Gurevich,
James K. Huggins:
ERRATA to "The Semantics of the C Programming Language".
CSL 1993: 334-336
- Andreas Blass,
Yuri Gurevich:
Randomizing Reductions of Search Problems.
SIAM J. Comput. 22(5): 949-975 (1993)
- Yuri Gurevich,
James K. Huggins:
The Semantics of the C Programming Language.
CSL 1992: 274-308
- Andreas Blass,
Yuri Gurevich:
Randomizing Reductions of Search Problems.
FSTTCS 1991: 10-24
- Yuri Gurevich:
Average Case Complexity.
ICALP 1991: 615-628
- Yuri Gurevich:
Average Case Completeness.
JCSS 42(3): 346-398 (1991)
- Andreas Blass,
Yuri Gurevich:
On the Reduction Theory for Average Case Complexity.
CSL 1990: 17-30
- Yuri Gurevich:
Matrix Decomposition Problem Is Complete for the Average Case.
FOCS 1990: 802-811
- Yuri Gurevich:
Preface.
Information and Computation 87(1/2): 1 (1990)
- Yuri Gurevich,
Saharon Shelah:
Nondeterministic Linear-Time Tasks May Require Substantially Nonlinear Deterministic Time in the Case of Sublinear Work Space.
JACM 37(3): 674-687 (1990)
- Yuri Gurevich,
Lawrence S. Moss:
Algebraic Operational Semantics and Occam.
CSL 1989: 176-192
- Miklós Ajtai,
Yuri Gurevich:
Datalog vs. First-Order Logic.
FOCS 1989: 142-147
- Andreas Blass,
Yuri Gurevich:
On Matijasevitch's Nontraditional Approach to Search Problems.
IPL 32(1): 41-45 (1989)
- 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
- Yuri Gurevich,
James M. Morris:
Algebraic Operational Semantics and Modula-2.
CSL 1987: 81-101
- Yuri Gurevich:
Complete and Incomplete Randomized NP Problems.
FOCS 1987: 111-117
- Yuri Gurevich:
Algenraic Operational Semantics.
FSTTCS 1987: 1-2
- Miklós Ajtai,
Yuri Gurevich:
Monotone versus Positive.
JACM 34(4): 1004-1015 (1987)
- Yuri Gurevich,
Saharon Shelah:
Expected Computation Time for Hamiltonian Path Problem.
SIAM J. Comput. 16(3): 486-502 (1987)
- Larry Denenberg,
Yuri Gurevich,
Saharon Shelah:
Definability by Constant-Depth Polynomial-Size Circuits.
Information and Control 70(2/3): 216-240 (1986)
- Yuri Gurevich,
Saharon Shelah:
Fixed-Point Extensions of First-Order Logic.
FOCS 1985: 346-353
- 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)
- Yuri Gurevich,
Harry R. Lewis:
A Logic for Constant-Depth Circuits.
Information and Control 61(1): 65-74 (1984)
- Yuri Gurevich,
Larry J. Stockmeyer,
Uzi Vishkin:
Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems.
JACM 31(3): 459-473 (1984)
- Andreas Blass,
Yuri Gurevich:
Equivalence Relations, Invariants, and Normal Forms.
SIAM J. Comput. 13(4): 682-689 (1984)
- Yuri Gurevich:
Algebras of Feasible Functions.
FOCS 1983: 210-214
- A. Prasad Sistla,
Edmund M. Clarke,
Nissim Francez,
Yuri Gurevich:
Can Message Buffers be Characterized in Linear Temporal Logic?
PODC 1982: 148-156
- Yuri Gurevich,
Harry R. Lewis:
The Inference Problem for Template Dependencies.
PODS 1982: 221-229
- Yuri Gurevich,
Leo Harrington:
Trees, Automata, and Games.
STOC 1982: 60-65
- Yuri Gurevich,
Harry R. Lewis:
The Inference Problem for Template Dependencies.
Information and Control 55(1-3): 69-79 (1982)
- Andreas Blass,
Yuri Gurevich:
On the Unique Satisfiability Problem.
Information and Control 55(1-3): 80-88 (1982)
DBLP: Copyright ©1999 by Michael Ley (ley@uni-trier.de).
|
|
