The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Yuri Gurevich: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  148. DKAL: Distributed-Knowledge Authorization Language. [Citation Graph (, )][DBLP]


  149. Exact Exploration and Hanging Algorithms. [Citation Graph (, )][DBLP]


  150. One Useful Logic That Defines Its Own Truth. [Citation Graph (, )][DBLP]


  151. Operational Semantics for DKAL: Application and Analysis. [Citation Graph (, )][DBLP]


  152. A Natural Axiomatization of Computability and Proof of Church's Thesis. [Citation Graph (, )][DBLP]


  153. When are two algorithms the same? [Citation Graph (, )][DBLP]


  154. Persistent Queries [Citation Graph (, )][DBLP]


  155. One useful logic that defines its own truth [Citation Graph (, )][DBLP]


  156. Two Forms of One Useful Logic: Existential Fixed Point Logic and Liberal Datalog [Citation Graph (, )][DBLP]


  157. Modular difference logic is hard [Citation Graph (, )][DBLP]


  158. Preface. [Citation Graph (, )][DBLP]


  159. Preface. [Citation Graph (, )][DBLP]


Search in 0.069secs, Finished in 0.079secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002