Yuri Gurevich - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

Publications with a 'Yuri Gurevich' as author, editor, or advisor:

The Decision Problem for Branching Time LogicYuri Gurevich, Saharon Shelah. JSYML, 50(3):668-681, 1985.
Herbrand s Theorem and Equational Reasoning: Problems and SolutionsAnatoli Degtyarev, Yuri Gurevich, Andrei Voronkov. eatcs, 60:78-96, 1996.
Sequential abstract-state machines capture sequential algorithmsYuri Gurevich. tocl, 1(1):77-111, 2000. [doi]
Algenraic Operational SemanticsYuri Gurevich. fsttcs 1987: 1-2
The Decision Problem for Standard ClassesYuri Gurevich. JSYML, 41(2):460-464, 1976.
Nondeterministic Linear-Time Tasks May Require Substantially Nonlinear Deterministic Time in the Case of Sublinear Work SpaceYuri Gurevich, Saharon Shelah. JACM, 37(3):674-687, July 1990. [doi]
Database Query Processing Using Finite Cursor MachinesMartin Grohe, Yuri Gurevich, Dirk Leinders, Nicole Schweikardt, Jerzy Tyszkiewicz, Jan Van den Bussche. icdt 2007: 284-298 [doi]
Equivalence Relations, Invariants, and Normal FormsAndreas Blass, Yuri Gurevich. SICOMP, 13(4):682-689, 1984.
Decidability and complexity of simultaneous rigid E-unification with one variable and related resultsAnatoli Degtyarev, Yuri Gurevich, Paliath Narendran, Margus Veanes, Andrei Voronkov. TCS, 243(1-2):167-184, 2000. [doi]
Program termination and well partial orderingsAndreas Blass, Yuri Gurevich. tocl, 9(3), 2008. [doi]
The Sequential ASM ThesisYuri Gurevich. eatcs, 67:93, 1999.
Using Quantum Computing to Learn PhysicsNathan Wiebe, Yuri Gurevich. eatcs, 112, 2014. [doi]
Zero-One LawsYuri Gurevich. In Grzegorz Rozenberg, Arto Salomaa, editors, Current Trends in Theoretical Computer Science - Essays and Tutorials. Volume 40 of World Scientific Series in Computer Science, pages 293-309, World Scientific, 1993. [doi]
On the Rectilinear Steiner ProblemAndreas Blass, Yuri Gurevich. eatcs, 121, 2017. [doi]
Impugning Randomness, ConvincinglyYuri Gurevich. fct 2011: 38 [doi]
Gurevich Abstract State Machines and Schoenhage Storage Modification MachinesScott Dexter, Patrick Doyle, Yuri Gurevich. jucs, 3(4):279-303, 1997. [doi]
Algebraic Operational Semantics and Modula-2Yuri Gurevich, James M. Morris. csl 1988: 81-101
Persistent queries in the behavioral theory of algorithmsAndreas Blass, Yuri Gurevich. tocl, 12(2):16, 2011. [doi]
The bakery algorithm: yet another specification and verificationDean Rosenzweig, Egon Börger, Yuri Gurevich. In Egon Börger, editor, Specification and validation methods. pages 231-243, Oxford University Press, 1993.
Propositional primal logic with disjunctionLev D. Beklemishev, Yuri Gurevich. logcom, 24(1):257-282, 2014. [doi]
Database Query Processing Using Finite Cursor MachinesMartin Grohe, Yuri Gurevich, Dirk Leinders, Nicole Schweikardt, Jerzy Tyszkiewicz, Jan Van den Bussche. mst, 44(4):533-560, 2009. [doi]
Evolving Algebras: an Attempt to Discover SemanticsYuri Gurevich. In Grzegorz Rozenberg, Arto Salomaa, editors, Current Trends in Theoretical Computer Science - Essays and Tutorials. Volume 40 of World Scientific Series in Computer Science, pages 266-292, World Scientific, 1993. [doi]
Abstract State Machines and Computationally Complete Query LanguagesAndreas Blass, Yuri Gurevich, Jan Van den Bussche. asmta 2000: 22-33 [doi]
The Monadic Theory of omega:::1:::::2::Yuri Gurevich, Menachem Magidor, Saharon Shelah. JSYML, 48(2):387-398, 1983.
Proceedings of Fifth Workshop on Model Based Testing, MBT@ETAPS 2009, York, UK, March 22, 2009Bernd Finkbeiner, Yuri Gurevich, Alexander K. Petrenko, editors, Volume 253 of Electronic Notes in Theoretical Computer Science, Elsevier, 2009. [doi]
A Variation on the Zero-One LawAndreas Blass, Yuri Gurevich, Vladik Kreinovich, Luc Longpré. ipl, 67(1):29-30, 1998. [doi]
Obituary: Gregory TseytinYuri Gurevich. eatcs, 141, 2023. [doi]
Existential interpretation. IIYuri Gurevich. AML, 22(3-4):103-120, 1980. [doi]
Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location ProblemsYuri Gurevich, Larry J. Stockmeyer, Uzi Vishkin. JACM, 31(3):459-473, 1984. [doi]
Definability by Constant-Depth Polynomial-Size CircuitsLarry Denenberg, Yuri Gurevich, Saharon Shelah. iandc, 70(2/3):216-240, August/September 1986.
Proceedings of the Sixth Workshop on Model-Based Testing, MBT@ETAPS 2010, Paphos, Cyprus, March 21, 2010Bernd Finkbeiner, Yuri Gurevich, Alexander K. Petrenko, editors, Volume 264 of Electronic Notes in Theoretical Computer Science, Elsevier, 2010. [doi]
Evidential AuthorizationAndreas Blass, Yuri Gurevich, Michal Moskal, Itay Neeman. BIRTHDAY 2011: 73-99 [doi]
Impugning alleged randomnessYuri Gurevich. nafips 2015: 1 [doi]
High-Level Executable Specification of the Universal Plug and Play ArchitectureUwe Glässer, Yuri Gurevich, Margus Veanes. hicss 2002: 283 [doi]
Logic in Computer ScienceYuri Gurevich. In Grzegorz Rozenberg, Arto Salomaa, editors, Current Trends in Theoretical Computer Science - Essays and Tutorials. Volume 40 of World Scientific Series in Computer Science, pages 223-224, World Scientific, 1993. [doi]
Partial updatesYuri Gurevich, Nikolai Tillmann. TCS, 336(2-3):311-342, 2005. [doi]
Operational Semantics for DKAL: Application and AnalysisYuri Gurevich, Arnab Roy. trustbus 2009: 149-158 [doi]
Equivalence relations, invariants, and normal formsAndreas Blass, Yuri Gurevich. prolamat 1984: 24-42
The Inference Problem for Template DependenciesYuri Gurevich, Harry R. Lewis. PODS 1982: 221-229 [doi]
Abstract Hilbertian deductive systems, infon logic, and DatalogAndreas Blass, Yuri Gurevich. iandc, 231:21-37, 2013. [doi]
Algorithms vs. MachinesAndreas Blass, Yuri Gurevich. eatcs, 77:96-119, 2002.
On Kolmogorov Machines and Related IssuesYuri Gurevich. In Grzegorz Rozenberg, Arto Salomaa, editors, Current Trends in Theoretical Computer Science - Essays and Tutorials. Volume 40 of World Scientific Series in Computer Science, pages 225-234, World Scientific, 1993. [doi]
Inverse privacyYuri Gurevich, Jeannette M. Wing. CACM, 59(7):38-42, 2016. [doi]
Can Message Buffers be Characterized in Linear Temporal Logic?A. Prasad Sistla, Edmund M. Clarke, Nissim Francez, Yuri Gurevich. podc 1982: 148-156
Transitive Primal Infon LogicCarlos Cotrini, Yuri Gurevich. rsl, 6(2):281-304, 2013. [doi]
PrefaceBernd Finkbeiner, Yuri Gurevich, Alexander K. Petrenko. ENTCS, 164(4):1, 2006. [doi]
What are kets?Yuri Gurevich, Andreas Blass. eatcs, 141, 2023. [doi]
Complete and Incomplete Randomized NP ProblemsYuri Gurevich. focs 1987: 111-117
Transitive Primal Infon Logic-ERRATUMCarlos Cotrini, Yuri Gurevich. rsl, 6(2):366, 2013. [doi]
Recursive Abstract State MachinesYuri Gurevich, Marc Spielmann. jucs, 3(4):233-246, 1997. [doi]
The Semantics of the C Programming LanguageYuri Gurevich, James K. Huggins. csl 1993: 274-308
The Value, if any, of DecidabilityYuri Gurevich. eatcs, 55, 1995.
A geometric zero-one lawRobert H. Gilman, Yuri Gurevich, Alexei D. Miasnikov. JSYML, 74(3):929-938, 2009. [doi]
On Quantum Computation, Anyons, and CategoriesAndreas Blass, Yuri Gurevich. In Eugenio G. Omodeo, Alberto Policriti, editors, Martin Davis on Computability, Computational Logic, and Mathematical Foundations. Volume 10 of Outstanding Contributions to Logic, pages 209-241, Springer, 2016. [doi]
On Finite Rigid StructuresYuri Gurevich, Saharon Shelah. JSYML, 61(2):549-562, 1996.
McColm s ConjectureYuri Gurevich, Neil Immerman, Saharon Shelah. lics 1994: 10-19
The challenger-Solver Game: variations on the Theme of P=NPYuri Gurevich. In Grzegorz Rozenberg, Arto Salomaa, editors, Current Trends in Theoretical Computer Science - Essays and Tutorials. Volume 40 of World Scientific Series in Computer Science, pages 245-253, World Scientific, 1993. [doi]
Abstract state machines capture parallel algorithmsAndreas Blass, Yuri Gurevich. tocl, 4(4):578-651, 2003. [doi]
Interpreting Second-Order Logic in the Monadic Theory of OrderYuri Gurevich, Saharon Shelah. JSYML, 48(3):816-828, 1983.
Impugning Randomness, ConvincinglyYuri Gurevich, Grant Olney Passmore. eatcs, 104:112-137, 2011. [doi]
PrefaceYuri Gurevich, Alexander K. Petrenko, Alexander Kossatchev. ENTCS, 111:1-3, 2005. [doi]
The Logic in computer science ColumnYuri Gurevich. eatcs, 38:93-100, 1989.
Computer Science Logic, 7th Workshop, CSL 93, Swansea, United Kingdom, September 13-17, 1993, Selected PapersEgon Börger, Yuri Gurevich, Karl Meinke, editors, Volume 832 of Lecture Notes in Computer Science, Springer, 1994.
Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization TheoremAndreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman. lmcs, 3(4), 2007. [doi]
Algorithms: A Quest for Absolute DefinitionsAndreas Blass, Yuri Gurevich. eatcs, 81:195-225, 2003.
The Linear Time Hierarchy Theorems for Abstract State Machines and RAMsAndreas Blass, Yuri Gurevich. jucs, 3(4):247-278, 1997. [doi]
Pairwise TestingAndreas Blass, Yuri Gurevich. eatcs, 78:100-132, 2002.
Membership Problem for the Modular GroupYuri Gurevich, Paul Schupp. SICOMP, 37(2):425-459, 2007. [doi]
Trees, Automata, and GamesYuri Gurevich, Leo Harrington. stoc 1982: 60-65
Reversify any sequential algorithmYuri Gurevich. eatcs, 134, 2021. [doi]
Test statistics and p-valuesYuri Gurevich, Vladimir Vovk. copa 2019: 89-104 [doi]
From Invariants to CanonizationYuri Gurevich. In Current Trends in Theoretical Computer Science. pages 327-331, 2001.
The Value, if Any, of DecidabilityYuri Gurevich. In Current Trends in Theoretical Computer Science. pages 274-280, 2001.
Infinite GamesYuri Gurevich. In Grzegorz Rozenberg, Arto Salomaa, editors, Current Trends in Theoretical Computer Science - Essays and Tutorials. Volume 40 of World Scientific Series in Computer Science, pages 235-244, World Scientific, 1993. [doi]
The decision problem for linear temporal logicJohn P. Burgess, Yuri Gurevich. ndjfl, 26(2):115-128, 1985. [doi]
Monadic Simultaneous Rigid E-Unification and Related ProblemsYuri Gurevich, Andrei Voronkov. icalp 1997: 154-165
Average Case CompletenessYuri Gurevich. jcss, 42(3):346-398, 1991.
Obituary: Yuri ManinYuri Gurevich. eatcs, 139, 2023. [doi]
Proceedings of the Fourth Workshop on Model Based Testing, MBT@ETAPS 2008, Budapest, Hungary, March 30, 2008Bernd Finkbeiner, Yuri Gurevich, Alexander K. Petrenko, editors, Volume 220 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008. [doi]
Teh Logic of InfonsYuri Gurevich, Itay Neeman. eatcs, 98:150-178, 2009.
Partially Ordered Runs: A Case StudyYuri Gurevich, Dean Rosenzweig. asmta 2000: 131-150 [doi]
Logic with Equality: Partisan Corroboration and Shifted PairingYuri Gurevich, Margus Veanes. iandc, 152(2):205-235, 1999.
Datalog vs First-Order LogicMiklós Ajtai, Yuri Gurevich. jcss, 49(3):562-588, 1994.
When are two algorithms the same?Andreas Blass, Nachum Dershowitz, Yuri Gurevich. bsl, 15(2):145-168, 2009. [doi]
Definability in Rationals with Real Order in the BackgroundYuri Gurevich, Alexander Moshe Rabinovich. logcom, 12(1):1-11, 2002. [doi]
Fixed point logicsAnuj Dawar, Yuri Gurevich. bsl, 8(1):65-88, 2002. [doi]
Formalizing Recovery in Transaction-Oriented Database SystemsCharles Wallace, Yuri Gurevich, Nandit Soparkar. comad 1995:
Addendum to "Choiceless Polynomial Time": Ann. Pure Appl. Logic 100 (1999) 141-187Andreas Blass, Yuri Gurevich, Saharon Shelah. APAL, 112(1):117, 2001. [doi]
PrefaceBernd Finkbeiner, Yuri Gurevich, Alexander K. Petrenko. ENTCS, 220(1):1, 2008. [doi]
Existential Fixed-Point LogicAndreas Blass, Yuri Gurevich. BIRTHDAY 1987: 20-36
Random Models and the Godel Case of the Decision ProblemYuri Gurevich, Saharon Shelah. JSYML, 48(4):1120-1124, 1983.
Exact Exploration and Hanging AlgorithmsAndreas Blass, Nachum Dershowitz, Yuri Gurevich. csl 2010: 140-154 [doi]
A Zero-One Law for Logic with a Fixed-Point OperatorAndreas Blass, Yuri Gurevich, Dexter Kozen. iandc, 67(1-3):70-90, October/November/December 1985.
Datalog vs. First-Order LogicMiklós Ajtai, Yuri Gurevich. focs 1989: 142-147
The Underlying Logic of Hoare LogicAndreas Blass, Yuri Gurevich. eatcs, 70:82-111, 2000.
Partial Updates: ExplorationYuri Gurevich, Nikolai Tillmann. jucs, 7(11):917-951, 2001. [doi]
Logic activities in EuropeYuri Gurevich. sigact, 25(2):11-24, 1994. [doi]
Inadequacy of computable loop invariantsAndreas Blass, Yuri Gurevich. tocl, 2(1):1-11, 2001. [doi]
Matrix Decomposition Problem Is Complete for the Average CaseYuri Gurevich. focs 1990: 802-811
The Railroad Crossing Problem: An Experiment with Instantaneous Actions and Immediate ReactionsYuri Gurevich, James K. Huggins. csl 1996: 266-290
Quantum circuits with classical channels and the principle of deferred measurementsYuri Gurevich, Andreas Blass. TCS, 920:21-32, 2022. [doi]
On Matijasevitch s Nontraditional Approach to Search ProblemsAndreas Blass, Yuri Gurevich. ipl, 32(1):41-45, 1989.
On the Unique Satisfiability ProblemAndreas Blass, Yuri Gurevich. iandc, 55(1-3):80-88, October/November/December 1982.
Algebraic Operational Semantics and OccamYuri Gurevich, Lawrence S. Moss. csl 1990: 176-192
Choiceless Polynominal Time Computation and the Zero-One LawAndreas Blass, Yuri Gurevich. csl 2000: 18-40 [doi]
Witness algebra and anyon braidingAndreas Blass, Yuri Gurevich. mscs, 30(3):234-270, 2020. [doi]
Abstract state machines capture parallel algorithms: Correction and extensionAndreas Blass, Yuri Gurevich. tocl, 9(3), 2008. [doi]
Braided distributivityAndreas Blass, Yuri Gurevich. TCS, 807:73-94, 2020. [doi]
Platonism, Constructivism, and Computer Proofs vs. Proofs by HandYuri Gurevich. eatcs, 57, 1995.
Normal Forms for Second-Order Logic over Finite Structures, and Classification of NP Optimization ProblemsThomas Eiter, Georg Gottlob, Yuri Gurevich. APAL, 78(1-3):111-125, 1996.
A New Zero-One Law and Strong Extension AxiomsAndreas Blass, Yuri Gurevich. eatcs, 72:103-122, 2000.
Abstract State Machines: An Overview of the ProjectYuri Gurevich. foiks 2004: 6-13 [doi]
PrefaceYuri Gurevich. iandc, 87(1/2):1, July/August 1990.
Tailoring Recursing for ComplexityErich Grädel, Yuri Gurevich. icalp 1994: 118-129
Algebras of Feasible FunctionsYuri Gurevich. focs 1983: 210-214
Interactive Algorithms 2005Yuri Gurevich. mfcs 2005: 26-38 [doi]
Choiceless Polynomial TimeAndreas Blass, Yuri Gurevich, Saharon Shelah. APAL, 100(1-3):141-187, 1999.
Group membership protocol: specification and verificationYuri Gurevich, Raghu Mani. In Egon Börger, editor, Specification and validation methods. pages 295-328, Oxford University Press, 1993.
Foundational Analyses of ComputationYuri Gurevich. CiE 2012: 264-275 [doi]
Content-dependent chunking for differential compression, the local maximum approachNikolaj Bjørner, Andreas Blass, Yuri Gurevich. jcss, 76(3-4):154-203, 2010. [doi]
A Natural Axiomatization of Computability and Proof of Church s ThesisNachum Dershowitz, Yuri Gurevich. bsl, 14(3):299-350, 2008. [doi]
A Tribute to Dirk van Dalen - PrefaceYuri Gurevich. APAL, 73(1):1, 1995.
The Abstract State Machine Paradigm: What Is in and What Is outYuri Gurevich. ershov 2001: 24 [doi]
Average Case ComplexityYuri Gurevich. icalp 1991: 615-628
Ordinary interactive small-step algorithms, IAndreas Blass, Yuri Gurevich. tocl, 7(2):363-419, 2006. [doi]
Past PresentYuri Gurevich. ijfcs, 27(2):103-108, 2016. [doi]
On the Reduction Theory for Average Case ComplexityAndreas Blass, Yuri Gurevich. csl 1991: 17-30
Wigner's quasidistribution and Dirac's ketsAndreas Blass, Yuri Gurevich, Alexander Volberg. eatcs, 136, 2022. [doi]
Evolving Algebras and Linear Time HierarchyAndreas Blass, Yuri Gurevich. ifip 1994: 383-390
The 1966 International Congress of Mathematicians: A Micro-memoirYuri Gurevich. FUIN, 186(1-4):133-141, 2022. [doi]
Observations on the Decidability of TransitionsYuri Gurevich, Rostislav Yavorskiy. asmta 2004: 161-168 [doi]
Negative probabilities, II What they are and what they are forAndreas Blass, Yuri Gurevich. eatcs, 125, 2018. [doi]
Evolving algebras 1993: Lipari guideYuri Gurevich. In Egon Börger, editor, Specification and validation methods. pages 9-36, Oxford University Press, 1993.
Can Abstract State Machines Be Useful in Language Theory?Yuri Gurevich, Charles Wallace. dlt 2006: 14-19 [doi]
Symbolic Bounded Model Checking of Abstract State MachinesMargus Veanes, Nikolaj Bjørner, Yuri Gurevich, Wolfram Schulte. ijsi, 3(2-3):149-170, 2009. [doi]
Decision Problem for Separated Distributive LatticesYuri Gurevich. JSYML, 48(1):193-196, 1983.
Expected Computation Time for Hamiltonian Path ProblemYuri Gurevich, Saharon Shelah. SICOMP, 16(3):486-502, 1987.
PrefaceBernd Finkbeiner, Yuri Gurevich, Alexander K. Petrenko. ENTCS, 253(2):1, 2009. [doi]
Proceedings of the Workshop on Model Based Testing, MBT 2004, Barcelona, Spain, March 27-28, 2004Yuri Gurevich, Alexander K. Petrenko, editors, Volume 111 of Electronic Notes in Theoretical Computer Science, Elsevier, 2005. [doi]
PrefaceBernd Finkbeiner, Yuri Gurevich, Alexander K. Petrenko. ENTCS, 264(3):1, 2010. [doi]
Means-fit EffectivityYuri Gurevich. eatcs, 130, 2020. [doi]
Ordinary interactive small-step algorithms, IIAndreas Blass, Yuri Gurevich. tocl, 8(3):15, 2007. [doi]
The Underlying Logic of Hoare LogicAndreas Blass, Yuri Gurevich. In Current Trends in Theoretical Computer Science. pages 409-436, 2001.
Spectra of Monadic Second-Order Formulas with One Unary FunctionYuri Gurevich, Saharon Shelah. lics 2003: 291-300 [doi]
Randomizing Reductions of Search ProblemsAndreas Blass, Yuri Gurevich. SICOMP, 22(5):949-975, 1993.
The Logic of ChoiceAndreas Blass, Yuri Gurevich. JSYML, 65(3):1264-1310, 2000.
On Polynomial Time Computation over Unordered StructuresAndreas Blass, Yuri Gurevich, Saharon Shelah. JSYML, 67(3):1093-1125, 2002.
Existential second-order logic over stringsThomas Eiter, Yuri Gurevich, Georg Gottlob. JACM, 47(1):77-131, 2000. [doi]
Ordinary interactive small-step algorithms, IIIAndreas Blass, Yuri Gurevich. tocl, 8(3):16, 2007. [doi]
Fixed-point extensions of first-order logicYuri Gurevich, Saharon Shelah. APAL, 32:265-280, 1986. [doi]
What does O(n) meanYuri Gurevich. sigact, 17(4):61-63, 1986. [doi]
Randomizing Reductions of Search ProblemsAndreas Blass, Yuri Gurevich. fsttcs 1991: 10-24
Can abstract state machines be useful in language theory?Yuri Gurevich, Margus Veanes, Charles Wallace. TCS, 376(1-2):17-29, 2007. [doi]
On the Strength of the Interpretation MethodYuri Gurevich, Saharon Shelah. JSYML, 54(2):305-323, 1989.
Proceedings of the Second Workshop on Model Based Testing, MBT 2006, Vienna, Austria, March 25-26, 2006Bernd Finkbeiner, Yuri Gurevich, Alexander K. Petrenko, editors, Volume 164 of Electronic Notes in Theoretical Computer Science, Elsevier, 2006. [doi]
Nearly Linear TimeYuri Gurevich, Saharon Shelah. ershov 1989: 108-118
Nondeterministic Linear-Time Tasks May Require Substantially Nonlinear Deterministic Time in the Case of Sublinear Work SpaceYuri Gurevich, Saharon Shelah. stoc 1988: 281-289
Logical foundations: Personal perspectiveYuri Gurevich. eatcs, 133, 2021. [doi]
Monadic theory of order and topology in ZFCYuri Gurevich, Saharon Shelah. APAL, 23(2-3):179-198, 1982. [doi]
AMAST 91 Banquet TalkYuri Gurevich. In Current Trends in Theoretical Computer Science. pages 247-253, 2001.
Software science view on quantum circuit algorithmsYuri Gurevich, Andreas Blass. iandc, 292:105024, June 2023. [doi]
Background, Reserve, and Gandy MachinesAndreas Blass, Yuri Gurevich. csl 2000: 1-17 [doi]
Fundamentals of p-values: IntroductionYuri Gurevich, Vladimir Vovk. eatcs, 119, 2016. [doi]
Two Forms of One Useful Logic: Existential Fixed Point Logic and Liberal DatalogAndreas Blass, Yuri Gurevich. eatcs, 95:164-182, 2008.
Proceedings of the Third Workshop on Model Based Testing, MBT 2007, Braga, Portugal, March 31 - April 1, 2007Bernd Finkbeiner, Yuri Gurevich, Alexander K. Petrenko, editors, Volume 190 of Electronic Notes in Theoretical Computer Science, Elsevier, 2007. [doi]
The Tower-of-Babel Problem, and Security Assesment SharingAndreas Blass, Yuri Gurevich, Efim Hudis. eatcs, 101:161-182, 2010. [doi]
The Decidability of Simultaneous Rigid ::::E::::-Unification with One VariableAnatoli Degtyarev, Yuri Gurevich, Paliath Narendran, Margus Veanes, Andrei Voronkov. RTA 1998: 181-195 [doi]
Curb Your Theory! A Circumspective Approach for Inclusive Interpretation of Disjunctive InformationThomas Eiter, Georg Gottlob, Yuri Gurevich. IJCAI 1993: 634-639
EATCS Fellows' Advice to the Young Theoretical Computer ScientistLuca Aceto, Mariangiola Dezani-Ciancaglini, Yuri Gurevich, David Harel, Monika Henzinger, Giuseppe F. Italiano, Scott A. Smolka, Paul G. Spirakis, Wolfgang Thomas. eatcs, 119, 2016. [doi]
When is A=B?Anja Gruenheid, Donald Kossmann, Besmira Nushi, Yuri Gurevich. eatcs, 111, 2013. [doi]
Logical foundations: Personal perspectiveYuri Gurevich. igpl, 31(6):1192-1202, November 2023. [doi]
On the number of active nodes in a multicomputer systemAmnon Barak, Zvi Drezner, Yuri Gurevich. networks, 16(3):275-282, 1986. [doi]
Zero-One LawsYuri Gurevich. eatcs, 46:90-106, 1992.
The 1966 International Congress of Mathematicians: A micro-memoirYuri Gurevich. eatcs, 120, 2016. [doi]
Strong extension axioms and Shelah s zero-one law for choiceless polynomial timeAndreas Blass, Yuri Gurevich. JSYML, 68(1):65-131, 2003.
Equivalence is in the Eye of the BeholderYuri Gurevich, James K. Huggins. TCS, 179(1-2):353-380, 1997. [doi]
The Classical Decision ProblemEgon Börger, Erich Grädel, Yuri Gurevich. Perspectives in Mathematical Logic, Springer, 1997.
On the Classical Decision ProblemYuri Gurevich. In Grzegorz Rozenberg, Arto Salomaa, editors, Current Trends in Theoretical Computer Science - Essays and Tutorials. Volume 40 of World Scientific Series in Computer Science, pages 254-265, World Scientific, 1993. [doi]
Circuits: An abstract viewpointAndreas Blass, Yuri Gurevich. eatcs, 131, 2020. [doi]
Syntax vs. Semantics on Finite StructuresNatasha Alechina, Yuri Gurevich. BIRTHDAY 1997: 14-33
Primal Infon Logic with Conjunctions as SetsCarlos Cotrini, Yuri Gurevich, Ori Lahav, Artem Melentyev. ifipTCS 2014: 236-249 [doi]
Definability and Undefinability with Real Order at The BackgroundYuri Gurevich, Alexander Moshe Rabinovich. JSYML, 65(2):946-958, 2000.
The umbilical cord of finite model theoryYuri Gurevich. eatcs, 139, 2023. [doi]
Partial Updates Exploration IIYuri Gurevich, Nikolai Tillmann. asmta 2003: 57-86 [doi]
Tailoring Recursion for ComplexityErich Grädel, Yuri Gurevich. JSYML, 60(3):952-969, 1995.
Unconstrained Church-Turing thesis cannot possibly be trueYuri Gurevich. eatcs, 127, 2019. [doi]
Formalizing Database RecoveryYuri Gurevich, Nandit Soparkar, Charles Wallace. jucs, 3(4):320-340, 1997. [doi]
Logic in computer Science ColumnYuri Gurevich. eatcs, 35:71-81, 1988.
Abstract Communication Model for Distributed SystemsUwe Glässer, Yuri Gurevich, Margus Veanes. TSE, 30(7):458-472, 2004. [doi]
The Inference Problem for Template DependenciesYuri Gurevich, Harry R. Lewis. iandc, 55(1-3):69-79, October/November/December 1982.
Herbrand s Theorem and Equational Reasoning: Problems and SolutionsAnatoli Degtyarev, Yuri Gurevich, Andrei Voronkov. In Current Trends in Theoretical Computer Science. pages 303-326, 2001.
Zero-One Laws: Thesauri and Parametric ConditionsAndreas Blass, Yuri Gurevich. In Johan van Benthem, Amitabha Gupta, Rohit Parikh, editors, Proof, Computation and Agency - Logic at the Crossroads. Volume 352 of Synthese library, pages 99-114, Springer, 2011. [doi]
Hilbertian Deductive Systems, Infon Logic, and DatalogAndreas Blass, Yuri Gurevich. eatcs, 102:122-150, 2010. [doi]
Who needs category theory?Andreas Blass, Yuri Gurevich. eatcs, 124, 2018. [doi]
Fixed-Point Extensions of First-Order LogicYuri Gurevich, Saharon Shelah. focs 1985: 346-353
Datalog: A Perspective and the PotentialYuri Gurevich. datalog 2012: 9-20 [doi]
Interactive Small-Step Algorithms I: AxiomatizationAndreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman. lmcs, 3(4), 2007. [doi]
Rabin s Uniformization ProblemYuri Gurevich, Saharon Shelah. JSYML, 48(4):1105-1119, 1983.
Impugning Randomness, ConvincinglyYuri Gurevich, Grant Olney Passmore. sLogica, 100(1-2):193-222, 2012. [doi]
Henkin quantifiers and complete problemsAndreas Blass, Yuri Gurevich. APAL, 32:1-16, 1986. [doi]
dkal ⋆ : Constructing Executable Specifications of Authorization ProtocolsJean-Baptiste Jeannin, Guido de Caso, Juan Chen, Yuri Gurevich, Prasad Naldurg, Nikhil Swamy. ESSoS 2013: 139-154 [doi]
From Primal Infon Logic with Individual Variables to DatalogNikolaj Bjørner, Guido de Caso, Yuri Gurevich. BIRTHDAY 2012: 72-86 [doi]
Proving Church s ThesisYuri Gurevich. csr 2007: 1-3 [doi]
A Theory of Stream QueriesYuri Gurevich, Dirk Leinders, Jan Van den Bussche. DBPL 2007: 153-168 [doi]
Invited Talk: ASM Formalware in the Software Engineering CycleYuri Gurevich. amast 2000: 197 [doi]
On the Classical Desicion ProblemYuri Gurevich. eatcs, 42:140-150, 1990.
A Decidable Subclass of the Minimal Godel Class with IdentityWarren D. Goldfarb, Yuri Gurevich, Saharon Shelah. JSYML, 49(4):1253-1261, 1984.
Evolving Algebras and Partial EvaluationYuri Gurevich, James K. Huggins. ifip 1994: 587-592
The Complexity of Query ReliabilityErich Grädel, Yuri Gurevich, Colin Hirsch. PODS 1998: 227-234 [doi]
Play to TestAndreas Blass, Yuri Gurevich, Lev Nachmanson, Margus Veanes. fates 2006: 32-46 [doi]
An Invitation to Quantum ComputingAndreas Blass, Yuri Gurevich. eatcs, 126, 2018. [doi]
A Logic for Constant-Depth CircuitsYuri Gurevich, Harry R. Lewis. iandc, 61(1):65-74, April 1984.
Logic in Computer Science ColumnYuri Gurevich. eatcs, 39:112-121, 1989.
Existential Second-Order Logic over StringsThomas Eiter, Georg Gottlob, Yuri Gurevich. lics 1998: 16-27
Time Polynomial in Input or OutputYuri Gurevich, Saharon Shelah. JSYML, 54(3):1083-1088, 1989.
Intra-step InteractionYuri Gurevich. asmta 2004: 1-5 [doi]
Metafinite Model TheoryErich Grädel, Yuri Gurevich. lcc 1995: 313-366
Logician in the Land of OS: Abstract State Machines in MicrosoftYuri Gurevich. lics 2001: 129-138
Abstract State Machines, Theory and Applications, International Workshop, ASM 2000, Monte Verità, Switzerland, March 19-24, 2000, ProceedingsYuri Gurevich, Philipp W. Kutter, Martin Odersky, Lothar Thiele, editors, Volume 1912 of Lecture Notes in Computer Science, Springer, 2000.
PrefaceBernd Finkbeiner, Yuri Gurevich, Alexander K. Petrenko. ENTCS, 190(2):1, 2007. [doi]
Modest Theory of Short Chains. IYuri Gurevich. JSYML, 44(4):481-490, 1979.
Basic primal infon logicCarlos Cotrini, Yuri Gurevich. logcom, 26(1):117-141, 2016. [doi]
Proceedings of the Fifth Workshop on Runtime Verification, RV@CAV 2005, Edinburgh, UK, July 12, 2005Howard Barringer, Bernd Finkbeiner, Yuri Gurevich, Henny Sipma, editors, Volume 144 of Electronic Notes in Theoretical Computer Science, Elsevier, 2006. [doi]
Circuit pedantryAndreas Blass, Yuri Gurevich. eatcs, 129, 2019. [doi]
Semi-conservative reductionYuri Gurevich. AML, 18(1):23-25, 1977. [doi]
Background of ComputationAndreas Blass, Yuri Gurevich. eatcs, 92:82-114, 2007.
The Word Problem for Cancellation Semigroups with ZeroYuri Gurevich, Harry R. Lewis. JSYML, 49(1):184-191, 1984.
Prefix classes of krom formulae with identityStål O. Aanderaa, Egon Börger, Yuri Gurevich. AML, 22(1-2):43-49, 1980. [doi]
Platonism, Constructivism, and Computer Proofs vs. Proofs by HandYuri Gurevich. In Current Trends in Theoretical Computer Science. pages 281-302, 2001.
Why Sets? (Column: Logic in Computer Science)Andreas Blass, Yuri Gurevich. eatcs, 84:139-156, 2004.
One Useful Logic That Defines Its Own TruthAndreas Blass, Yuri Gurevich. mfcs 2008: 1-15 [doi]
Tests and Proofs, First International Conference, TAP 2007, Zurich, Switzerland, February 12-13, 2007. Revised PapersYuri Gurevich, Bertrand Meyer, editors, Volume 4454 of Lecture Notes in Computer Science, Springer, 2007.
Explicating SDKs: Uncovering Assumptions Underlying Secure Authentication and AuthorizationRui Wang 0010, Yuchen Zhou, Shuo Chen, Shaz Qadeer, David Evans, Yuri Gurevich. uss 2013: 399-314 [doi]
Evolving AlgebrasYuri Gurevich. ifip 1994: 423-427
Logic of infons: The propositional caseYuri Gurevich, Itay Neeman. tocl, 12(2):9, 2011. [doi]
Monadic Simultaneous Rigid E-unificationYuri Gurevich, Andrei Voronkov. TCS, 222(1-2):133-152, 1999. [doi]
Modest Theory of Short Chains. IIYuri Gurevich, Saharon Shelah. JSYML, 44(4):491-502, 1979.
PrefaceHoward Barringer, Bernd Finkbeiner, Yuri Gurevich, Henny B. Sipma. ENTCS, 144(4):1, 2006. [doi]
What Is an Algorithm?Yuri Gurevich. sofsem 2012: 31-42 [doi]
Metafinite Model TheoryErich Grädel, Yuri Gurevich. iandc, 140(1):26-81, 1998.
The Sequential ASM ThesisYuri Gurevich. In Current Trends in Theoretical Computer Science. pages 363-392, 2001.
DKAL: Distributed-Knowledge Authorization LanguageYuri Gurevich, Itay Neeman. csfw 2008: 149-162 [doi]
From Invariants to CanonizationYuri Gurevich. eatcs, 63, 1997.
ERRATA to The Semantics of the C Programming Language Yuri Gurevich, James K. Huggins. csl 1994: 334-336
Matrix Transformation Is Complete for the Average CaseAndreas Blass, Yuri Gurevich. SICOMP, 24(1):3-29, 1995.
Behavioral Computation Theory 2005Yuri Gurevich. asmta 2005: 72 [doi]
Monotone versus positiveMiklós Ajtai, Yuri Gurevich. JACM, 34(4):1004-1015, 1987. [doi]
Abstract State Machines and Computationally Complete Query LanguagesAndreas Blass, Yuri Gurevich, Jan Van den Bussche. iandc, 174(1):20-36, 2002. [doi]
Zero-One Laws: Thesauri and Parametric ConditionsAndreas Blass, Yuri Gurevich. eatcs, 91:125-144, 2007.

All Publications

Filter by Year

Filter by Type

Filter by Topic

Filter by Venue

Filter by Co-author

Filter by Top terms

Download

External Links

Profile Name

Statistics

Aliases

Researchr

Yuri Gurevich's Profile

Unidentified Publications