BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
1 × Czech Republic
1 × France
1 × Israel
1 × Japan
1 × Spain
2 × United Kingdom
3 × Italy
4 × Germany
7 × USA
Collaborated with:
A.Blass S.Shelah J.K.Huggins E.Grädel M.Veanes A.Voronkov C.Wallace L.S.Moss J.M.Morris H.R.Lewis L.Harrington N.Dershowitz T.Eiter G.Gottlob C.Hirsch N.Immerman L.Nachmanson W.Grieskamp W.Schulte A.Degtyarev P.Narendran
Talks about:
machin (5) complex (4) semant (4) state (4) abstract (3) languag (3) time (3) case (3) one (3) simultan (2)

Person: Yuri Gurevich

DBLP DBLP: Gurevich:Yuri

Facilitated 6 volumes:

MBT 2009Ed
MBT 2008Ed
MBT 2007Ed
TAP 2007Ed
MBT 2006Ed
CSL 1993Ed

Contributed to:

CSL 20102010
DLT 20062006
FATES 20052005
LICS 20032003
ISSTA 20022002
LICS 20012001
CSL 20002000
LICS 19981998
PODS 19981998
RTA 19981998
ICALP 19971997
ICALP 19941994
LICS 19941994
CSL 19931993
CSL 19921992
ICALP 19911991
CSL 19901990
CSL 19891989
STOC 19881988
CSL 19871987
PODS 19821982
STOC 19821982

Wrote 23 papers:

CSL-2010-BlassDG #algorithm
Exact Exploration and Hanging Algorithms (AB, ND, YG), pp. 140–154.
DLT-2006-GurevichW #question #state machine
Can Abstract State Machines Be Useful in Language Theory? (YG, CW), pp. 14–19.
FATES-2005-BlassGNV #game studies
Play to Test (AB, YG, LN, MV), pp. 32–46.
LICS-2003-GurevichS #higher-order #monad
Spectra of Monadic Second-Order Formulas with One Unary Function (YG, SS), pp. 291–300.
ISSTA-2002-GrieskampGSV #finite #generative #state machine
Generating finite state machines from abstract state machines (WG, YG, WS, MV), pp. 112–122.
LICS-2001-Gurevich #state machine
Logician in the Land of OS: Abstract State Machines in Microsoft (YG), pp. 129–136.
Background, Reserve, and Gandy Machines (AB, YG), pp. 1–17.
CSL-2000-BlassG00a #polynomial
Choiceless Polynomial Time Computation and the Zero-One Law (AB, YG), pp. 18–40.
LICS-1998-EiterGG #higher-order #logic #string
Existential Second-Order Logic over Strings (TE, GG, YG), pp. 16–27.
PODS-1998-GradelGH #complexity #query #reliability
The Complexity of Query Reliability (EG, YG, CH), pp. 227–234.
RTA-1998-DegtyarevGNVV #decidability
The Decidability of Simultaneous Rigid E-Unification with One Variable (AD, YG, PN, MV, AV), pp. 181–195.
ICALP-1997-GurevichV #monad #problem
Monadic Simultaneous Rigid E-Unification and Related Problems (YG, AV), pp. 154–165.
ICALP-1994-GradelG #complexity
Tailoring Recursing for Complexity (EG, YG), pp. 118–129.
McColm’s Conjecture (YG, NI, SS), pp. 10–19.
CSL-1993-GurevichH #c #programming language #semantics
ERRATA to “The Semantics of the C Programming Language” (YG, JKH), pp. 334–336.
CSL-1992-GurevichH #c #programming language #semantics
The Semantics of the C Programming Language (YG, JKH), pp. 274–308.
ICALP-1991-Gurevich #complexity
Average Case Complexity (YG), pp. 615–628.
CSL-1990-BlassG #complexity #on the #reduction
On the Reduction Theory for Average Case Complexity (AB, YG), pp. 17–30.
CSL-1989-GurevichM #algebra #semantics
Algebraic Operational Semantics and Occam (YG, LSM), pp. 176–192.
STOC-1988-GurevichS #linear #nondeterminism #sublinear
Nondeterministic Linear-Time Tasks May Require Substantially Nonlinear Deterministic Time in the Case of Sublinear Work Space (YG, SS), pp. 281–289.
CSL-1987-GurevichM #algebra #semantics
Algebraic Operational Semantics and Modula-2 (YG, JMM), pp. 81–101.
PODS-1982-GurevichL #dependence #problem
The Inference Problem for Template Dependencies (YG, HRL), pp. 221–229.
STOC-1982-GurevichH #automaton #game studies
Trees, Automata, and Games (YG, LH), pp. 60–65.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.