| 2012 | CiE | Foundational Analyses of Computation. | Yuri Gurevich |
| 2012 | SOFSEM | What Is an Algorithm? | Yuri Gurevich |
| 2011 | FCT | Impugning Randomness, Convincingly. | Yuri Gurevich |
| 2010 | CSL | Exact Exploration and Hanging Algorithms. | Andreas Blass, Nachum Dershowitz, Yuri Gurevich |
| 2009 | TrustBus | Operational Semantics for DKAL: Application and Analysis. | Yuri Gurevich, Arnab Roy |
| 2008 | MFCS | One Useful Logic That Defines Its Own Truth. | Andreas Blass, Yuri Gurevich |
| 2007 | CSR | Proving Church's Thesis. | Yuri Gurevich |
| 2007 | ICDT | Database Query Processing Using Finite Cursor Machines. | Martin Grohe, Yuri Gurevich, Dirk Leinders, Nicole Schweikardt, Jerzy Tyszkiewicz, Jan Van den Bussche |
| 2006 | DLT | Can Abstract State Machines Be Useful in Language Theory?. | Yuri Gurevich, Charles Wallace |
| 2005 | MFCS | Interactive Algorithms 2005. | Yuri Gurevich |
| 2003 | LICS | Spectra of Monadic Second-Order Formulas with One Unary Function. | Yuri Gurevich, Saharon Shelah |
| 2002 | ISSTA | Generating finite state machines from abstract state machines. | Wolfgang Grieskamp, Yuri Gurevich, Wolfram Schulte, Margus Veanes |
| 2001 | LICS | Logician in the Land of OS: Abstract State Machines in Microsoft. | Yuri Gurevich |
| 2000 | CSL | Background, Reserve, and Gandy Machines. | Andreas Blass, Yuri Gurevich |
| 2000 | CSL | Choiceless Polynominal Time Computation and the Zero-One Law. | Andreas Blass, Yuri Gurevich |
| 1998 | LICS | Existential Second-Order Logic over Strings. | Thomas Eiter, Georg Gottlob, Yuri Gurevich |
| 1998 | PODS | The Complexity of Query Reliability. | Erich Grdel, Yuri Gurevich, Colin Hirsch |
| 1997 | ICALP | Monadic Simultaneous Rigid E-Unification and Related Problems. | Yuri Gurevich, Andrei Voronkov |
| 1995 | COMAD | Formalizing Recovery in Transaction-Oriented Database Systems. | Charles Wallace, Yuri Gurevich, Nandit Soparkar |
| 1995 | CSL | The Railroad Crossing Problem: An Experiment with Instantaneous Actions and Immediate Reactions. | Yuri Gurevich, James K. Huggins |
| 1994 | ICALP | Tailoring Recursing for Complexity. | Erich Grdel, Yuri Gurevich |
| 1994 | LICS | McColm's Conjecture | Yuri Gurevich, Neil Immerman, Saharon Shelah |
| 1993 | CSL | ERRATA to "The Semantics of the C Programming Language". | Yuri Gurevich, James K. Huggins |
| 1993 | IJCAI | Curb Your Theory! A Circumspective Approach for Inclusive Interpretation of Disjunctive Information. | Thomas Eiter, Georg Gottlob, Yuri Gurevich |
| 1992 | CSL | The Semantics of the C Programming Language. | Yuri Gurevich, James K. Huggins |
| 1991 | ICALP | Average Case Complexity. | Yuri Gurevich |
| 1990 | CSL | On the Reduction Theory for Average Case Complexity. | Andreas Blass, Yuri Gurevich |
| 1990 | FOCS | Matrix Decomposition Problem Is Complete for the Average Case | Yuri Gurevich |
| 1989 | CSL | Algebraic Operational Semantics and Occam. | Yuri Gurevich, Lawrence S. Moss |
| 1989 | FOCS | Datalog vs. First-Order Logic | Mikls Ajtai, Yuri Gurevich |
| 1988 | STOC | Nondeterministic Linear-Time Tasks May Require Substantially Nonlinear Deterministic Time in the Case of Sublinear Work Space | Yuri Gurevich, Saharon Shelah |
| 1987 | CSL | Algebraic Operational Semantics and Modula-2. | Yuri Gurevich, James M. Morris |
| 1987 | FOCS | Complete and Incomplete Randomized NP Problems | Yuri Gurevich |
| 1985 | FOCS | Fixed-Point Extensions of First-Order Logic | Yuri Gurevich, Saharon Shelah |
| 1983 | FOCS | Algebras of Feasible Functions | Yuri Gurevich |
| 1982 | PODC | Can Message Buffers be Characterized in Linear Temporal Logic? | A. Prasad Sistla, Edmund M. Clarke, Nissim Francez, Yuri Gurevich |
| 1982 | PODS | The Inference Problem for Template Dependencies. | Yuri Gurevich, Harry R. Lewis |
| 1982 | STOC | Trees, Automata, and Games | Yuri Gurevich, Leo Harrington |