Yuri Gurevich - RankMe

294 papers A* 19A 3B 15C 3Misc 2Journal 182Unranked 42

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Basic interactive algorithms: Preview. CoRR Yuri Gurevich
2025	J	`jnl`	Primal Logic of Information. ACM Trans. Comput. Log. Yuri Gurevich, Andreas Blass
2025	J	`jnl`	The umbilical cord of finite model theory. J. Log. Comput. Yuri Gurevich
2024	J	`jnl`	Exact Exploration. CoRR Andreas Blass, Nachum Dershowitz, Yuri Gurevich
2024	J	`jnl`	On a measure of intelligence. CoRR Yuri Gurevich
2024	J	`jnl`	On a measure of intelligence. Bull. EATCS Yuri Gurevich
2024	J	`jnl`	On logic and generative AI. CoRR Yuri Gurevich, Andreas Blass
2024	J	`jnl`	On logic and generative AI. Bull. EATCS Yuri Gurevich, Andreas Blass
2024	J	`jnl`	What are kets? CoRR Yuri Gurevich, Andreas Blass
2023	J	`jnl`	Logical foundations: Personal perspective. Log. J. IGPL Yuri Gurevich
2023	J	`jnl`	Obituary: Gregory Tseytin. Bull. EATCS Yuri Gurevich
2023	J	`jnl`	Obituary: Yuri Manin. Bull. EATCS Yuri Gurevich
2023	J	`jnl`	Primal logic of information. CoRR Yuri Gurevich, Andreas Blass
2023	J	`jnl`	Software science view on quantum circuit algorithms. Inf. Comput. Yuri Gurevich, Andreas Blass
2023	J	`jnl`	The umbilical cord of finite model theory. CoRR Yuri Gurevich
2023	J	`jnl`	The umbilical cord of finite model theory. Bull. EATCS Yuri Gurevich
2023	J	`jnl`	What are kets? Bull. EATCS Yuri Gurevich, Andreas Blass
2022	J	`jnl`	A more abstract bounded exploration postulate. CoRR Yuri Gurevich, Tatiana Yavorskaya
2022	J	`jnl`	Quantum circuits with classical channels and the principle of deferred measurements. Theor. Comput. Sci. Yuri Gurevich, Andreas Blass
2022	J	`jnl`	Software science view on quantum circuit algorithms. CoRR Yuri Gurevich, Andreas Blass
2022	J	`jnl`	The 1966 International Congress of Mathematicians: A Micro-memoir. Fundam. Informaticae Yuri Gurevich
2022	J	`jnl`	Wigner's quasidistribution and Dirac's kets. CoRR Andreas Blass, Yuri Gurevich, Alexander Volberg
2022	J	`jnl`	Wigner's quasidistribution and Dirac's kets. Bull. EATCS Andreas Blass, Yuri Gurevich, Alexander Volberg
2021	J	`jnl`	Logical foundations: Personal perspective. CoRR Yuri Gurevich
2021	J	`jnl`	Logical foundations: Personal perspective. Bull. EATCS Yuri Gurevich
2021	J	`jnl`	Quantum circuits with classical channels and the principle of deferred measurements. CoRR Yuri Gurevich, Andreas Blass
2021	J	`jnl`	Reversify any sequential algorithm. CoRR Yuri Gurevich
2021	J	`jnl`	Reversify any sequential algorithm. Bull. EATCS Yuri Gurevich
2021	J	`jnl`	Simple circuit simulations of classical and quantum Turing machines. CoRR Yuri Gurevich, Andreas Blass
2020	J	`jnl`	Braided distributivity. Theor. Comput. Sci. Andreas Blass, Yuri Gurevich
2020	J	`jnl`	Circuits: An abstract viewpoint. CoRR Andreas Blass, Yuri Gurevich
2020	J	`jnl`	Circuits: An abstract viewpoint. Bull. EATCS Andreas Blass, Yuri Gurevich
2020	J	`jnl`	Means-fit Effectivity. Bull. EATCS Yuri Gurevich
2020	J	`jnl`	Means-fit effectivity. CoRR Yuri Gurevich
2020	J	`jnl`	Negative probabilities: What they are and what they are for. CoRR Andreas Blass, Yuri Gurevich
2020	J	`jnl`	Witness algebra and anyon braiding. Math. Struct. Comput. Sci. Andreas Blass, Yuri Gurevich
2019	J	`jnl`	Circuit pedantry. CoRR Andreas Blass, Yuri Gurevich
2019	J	`jnl`	Circuit pedantry. Bull. EATCS Andreas Blass, Yuri Gurevich
2019	—	`conf`	Test statistics and p-values. COPA Yuri Gurevich, Vladimir Vovk
2019	J	`jnl`	Unconstrained Church-Turing thesis cannot possibly be true. CoRR Yuri Gurevich
2019	J	`jnl`	Unconstrained Church-Turing thesis cannot possibly be true. Bull. EATCS Yuri Gurevich
2018	J	`jnl`	An Invitation to Quantum Computing. Bull. EATCS Andreas Blass, Yuri Gurevich
2018	J	`jnl`	Coherence for braided distributivity. CoRR Andreas Blass, Yuri Gurevich
2018	J	`jnl`	Evolving Algebras 1993: Lipari Guide. CoRR Yuri Gurevich
2018	J	`jnl`	Negative probabilities, II What they are and what they are for. Bull. EATCS Andreas Blass, Yuri Gurevich
2018	J	`jnl`	Who needs category theory? CoRR Andreas Blass, Yuri Gurevich
2018	J	`jnl`	Who needs category theory? Bull. EATCS Andreas Blass, Yuri Gurevich
2018	J	`jnl`	Witness Algebra and Anyon Braiding. CoRR Andreas Blass, Yuri Gurevich
2017	—	`conf`	Common Denominator for Value and Expectation No-go Theorems: Extended Abstract. QPL Andreas Blass, Yuri Gurevich
2017	J	`jnl`	On the Rectilinear Steiner Problem. Bull. EATCS Andreas Blass, Yuri Gurevich
2016	J	`jnl`	Basic primal infon logic. J. Log. Comput. Carlos Cotrini, Yuri Gurevich
2016	J	`jnl`	EATCS Fellows' Advice to the Young Theoretical Computer Scientist. Bull. EATCS Luca Aceto, Mariangiola Dezani-Ciancaglini, Yuri Gurevich, David Harel, Monika Henzinger, Giuseppe F. Italiano, Scott A. Smolka, Paul G. Spirakis, Wolfgang Thomas
2016	J	`jnl`	Fundamentals of p-values: Introduction. Bull. EATCS Yuri Gurevich, Vladimir Vovk
2016	J	`jnl`	Inverse privacy. Commun. ACM Yuri Gurevich, Jeannette M. Wing
2016	—	`ch.`	On Quantum Computation, Anyons, and Categories. Martin Davis on Computability, Computational Logic, and Mathematical Foundations Andreas Blass, Yuri Gurevich
2016	J	`jnl`	Past Present. Int. J. Found. Comput. Sci. Yuri Gurevich
2016	J	`jnl`	The 1966 International Congress of Mathematicians: A micro-memoir. Bull. EATCS Yuri Gurevich
2015	—	`conf`	Impugning alleged randomness. NAFIPS/WConSC Yuri Gurevich
2015	J	`jnl`	Inverse Privacy. CoRR Yuri Gurevich, Efim Hudis, Jeannette M. Wing
2014	—	`conf`	Primal Infon Logic with Conjunctions as Sets. IFIP TCS Carlos Cotrini, Yuri Gurevich, Ori Lahav, Artem Melentyev
2014	J	`jnl`	Propositional primal logic with disjunction. J. Log. Comput. Lev D. Beklemishev, Yuri Gurevich
2013	J	`jnl`	Abstract Hilbertian deductive systems, infon logic, and Datalog. Inf. Comput. Andreas Blass, Yuri Gurevich
2013	A*	`conf`	Explicating SDKs: Uncovering Assumptions Underlying Secure Authentication and Authorization. USENIX Security Symposium Rui Wang, Yuchen Zhou, Shuo Chen, Shaz Qadeer, David Evans, Yuri Gurevich
2013	J	`jnl`	Transitive Primal Infon Logic-ERRATUM. Rev. Symb. Log. Carlos Cotrini, Yuri Gurevich
2013	J	`jnl`	Transitive Primal Infon Logic. Rev. Symb. Log. Carlos Cotrini, Yuri Gurevich
2013	—	`conf`	dkal ⋆ : Constructing Executable Specifications of Authorization Protocols. ESSoS Jean-Baptiste Jeannin, Guido de Caso, Juan Chen, Yuri Gurevich, Prasad Naldurg, Nikhil Swamy
2012	—	`conf`	Datalog: A Perspective and the Potential. Datalog Yuri Gurevich
2012	C	`conf`	Foundational Analyses of Computation. CiE Yuri Gurevich
2012	—	`conf`	From Primal Infon Logic with Individual Variables to Datalog. Correct Reasoning Nikolaj S. Bjørner, Guido de Caso, Yuri Gurevich
2012	J	`jnl`	Impugning Randomness, Convincingly. Stud Logica Yuri Gurevich, Grant Olney Passmore
2012	B	`conf`	What Is an Algorithm? SOFSEM Yuri Gurevich
2011	B	`conf`	Impugning Randomness, Convincingly. FCT Yuri Gurevich
2011	J	`jnl`	Impugning Randomness, Convincingly. Bull. EATCS Yuri Gurevich, Grant Olney Passmore
2011	J	`jnl`	Logic of infons: The propositional case. ACM Trans. Comput. Log. Yuri Gurevich, Itay Neeman
2011	J	`jnl`	Persistent queries in the behavioral theory of algorithms. ACM Trans. Comput. Log. Andreas Blass, Yuri Gurevich
2011	—	`ch.`	Zero-One Laws: Thesauri and Parametric Conditions. Proof, Computation and Agency Andreas Blass, Yuri Gurevich
2010	J	`jnl`	Content-dependent chunking for differential compression, the local maximum approach. J. Comput. Syst. Sci. Nikolaj S. Bjørner, Andreas Blass, Yuri Gurevich
2010	—	`conf`	Evidential Authorization. The Future of Software Engineering Andreas Blass, Yuri Gurevich, Michal Moskal, Itay Neeman
2010	B	`conf`	Exact Exploration and Hanging Algorithms. CSL Andreas Blass, Nachum Dershowitz, Yuri Gurevich
2010	J	`jnl`	Hilbertian Deductive Systems, Infon Logic, and Datalog. Bull. EATCS Andreas Blass, Yuri Gurevich
2010	—	`conf`	Preface. MBT@ETAPS Bernd Finkbeiner, Yuri Gurevich, Alexander K. Petrenko
2010	—	`ed.`	Proceedings of the Sixth Workshop on Model-Based Testing, MBT@ETAPS 2010, Paphos, Cyprus, March 21, 2010 MBT@ETAPS Bernd Finkbeiner, Yuri Gurevich, Alexander K. Petrenko
2010	J	`jnl`	The Tower-of-Babel Problem, and Security Assesment Sharing. Bull. EATCS Andreas Blass, Yuri Gurevich, Efim Hudis
2009	J	`jnl`	A geometric zero-one law. J. Symb. Log. Robert H. Gilman, Yuri Gurevich, Alexei D. Miasnikov
2009	J	`jnl`	Database Query Processing Using Finite Cursor Machines. Theory Comput. Syst. Martin Grohe, Yuri Gurevich, Dirk Leinders, Nicole Schweikardt, Jerzy Tyszkiewicz, Jan Van den Bussche
2009	B	`conf`	Operational Semantics for DKAL: Application and Analysis. TrustBus Yuri Gurevich, Arnab Roy
2009	—	`conf`	Preface. MBT@ETAPS Bernd Finkbeiner, Yuri Gurevich, Alexander K. Petrenko
2009	—	`ed.`	Proceedings of Fifth Workshop on Model Based Testing, MBT@ETAPS 2009, York, UK, March 22, 2009 MBT@ETAPS Bernd Finkbeiner, Yuri Gurevich, Alexander K. Petrenko
2009	J	`jnl`	Symbolic Bounded Model Checking of Abstract State Machines. Int. J. Softw. Informatics Margus Veanes, Nikolaj S. Bjørner, Yuri Gurevich, Wolfram Schulte
2009	J	`jnl`	Teh Logic of Infons. Bull. EATCS Yuri Gurevich, Itay Neeman
2009	J	`jnl`	When are two algorithms the same? Bull. Symb. Log. Andreas Blass, Nachum Dershowitz, Yuri Gurevich
2008	J	`jnl`	A Natural Axiomatization of Computability and Proof of Church's Thesis. Bull. Symb. Log. Nachum Dershowitz, Yuri Gurevich
2008	J	`jnl`	Abstract state machines capture parallel algorithms: Correction and extension. ACM Trans. Comput. Log. Andreas Blass, Yuri Gurevich
2008	A	`conf`	DKAL: Distributed-Knowledge Authorization Language. CSF Yuri Gurevich, Itay Neeman
2008	J	`jnl`	Modular difference logic is hard CoRR Nikolaj S. Bjørner, Andreas Blass, Yuri Gurevich, Madan Musuvathi
2008	B	`conf`	One Useful Logic That Defines Its Own Truth. MFCS Andreas Blass, Yuri Gurevich
2008	J	`jnl`	One useful logic that defines its own truth CoRR Andreas Blass, Yuri Gurevich
2008	J	`jnl`	Persistent Queries CoRR Andreas Blass, Yuri Gurevich
2008	—	`conf`	Preface. MBT@ETAPS Bernd Finkbeiner, Yuri Gurevich, Alexander K. Petrenko
2008	—	`ed.`	Proceedings of the Fourth Workshop on Model Based Testing, MBT@ETAPS 2008, Budapest, Hungary, March 30, 2008 MBT@ETAPS Bernd Finkbeiner, Yuri Gurevich, Alexander K. Petrenko
2008	J	`jnl`	Program termination and well partial orderings. ACM Trans. Comput. Log. Andreas Blass, Yuri Gurevich
2008	J	`jnl`	Two Forms of One Useful Logic: Existential Fixed Point Logic and Liberal Datalog CoRR Andreas Blass, Yuri Gurevich
2008	J	`jnl`	Two Forms of One Useful Logic: Existential Fixed Point Logic and Liberal Datalog. Bull. EATCS Andreas Blass, Yuri Gurevich
2008	J	`jnl`	When are two algorithms the same? CoRR Andreas Blass, Nachum Dershowitz, Yuri Gurevich
2008	—	`conf`	Why Sets? Pillars of Computer Science Andreas Blass, Yuri Gurevich
2007	—	`conf`	A Theory of Stream Queries. DBPL Yuri Gurevich, Dirk Leinders, Jan Van den Bussche
2007	J	`jnl`	Background of Computation. Bull. EATCS Andreas Blass, Yuri Gurevich
2007	J	`jnl`	Can abstract state machines be useful in language theory? Theor. Comput. Sci. Yuri Gurevich, Margus Veanes, Charles Wallace
2007	A	`conf`	Database Query Processing Using Finite Cursor Machines. ICDT Martin Grohe, Yuri Gurevich, Dirk Leinders, Nicole Schweikardt, Jerzy Tyszkiewicz, Jan Van den Bussche
2007	J	`jnl`	Interactive Small-Step Algorithms I: Axiomatization CoRR Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman
2007	J	`jnl`	Interactive Small-Step Algorithms I: Axiomatization. Log. Methods Comput. Sci. Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman
2007	J	`jnl`	Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem CoRR Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman
2007	J	`jnl`	Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem. Log. Methods Comput. Sci. Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman
2007	J	`jnl`	Membership Problem for the Modular Group. SIAM J. Comput. Yuri Gurevich, Paul E. Schupp
2007	J	`jnl`	Ordinary interactive small-step algorithms, II. ACM Trans. Comput. Log. Andreas Blass, Yuri Gurevich
2007	J	`jnl`	Ordinary interactive small-step algorithms, III. ACM Trans. Comput. Log. Andreas Blass, Yuri Gurevich
2007	—	`conf`	Preface. MBT Bernd Finkbeiner, Yuri Gurevich, Alexander K. Petrenko
2007	—	`ed.`	Proceedings of the Third Workshop on Model Based Testing, MBT 2007, Braga, Portugal, March 31 - April 1, 2007 MBT Bernd Finkbeiner, Yuri Gurevich, Alexander K. Petrenko
2007	Misc	`conf`	Proving Church's Thesis. CSR Yuri Gurevich
2007	C	`ed.`	Tests and Proofs - 1st International Conference, TAP 2007, Zurich, Switzerland, February 12-13, 2007. Revised Papers TAP Yuri Gurevich, Bertrand Meyer
2007	J	`jnl`	Zero-One Laws: Thesauri and Parametric Conditions. Bull. EATCS Andreas Blass, Yuri Gurevich
2006	C	`conf`	Can Abstract State Machines Be Useful in Language Theory?. Developments in Language Theory Yuri Gurevich, Charles Wallace
2006	J	`jnl`	Ordinary interactive small-step algorithms, I. ACM Trans. Comput. Log. Andreas Blass, Yuri Gurevich
2006	—	`conf`	Preface. MBT Bernd Finkbeiner, Yuri Gurevich, Alexander K. Petrenko
2006	—	`ed.`	Proceedings of the Fifth Workshop on Runtime Verification, RV@CAV 2005, Edinburgh, UK, July 12, 2005 RV@CAV Howard Barringer, Bernd Finkbeiner, Yuri Gurevich, Henny Sipma
2006	—	`ed.`	Proceedings of the Second Workshop on Model Based Testing, MBT 2006, Vienna, Austria, March 25-26, 2006 MBT Bernd Finkbeiner, Yuri Gurevich, Alexander K. Petrenko
2005	—	`conf`	Behavioral Computation Theory 2005. Abstract State Machines Yuri Gurevich
2005	B	`conf`	Interactive Algorithms 2005. MFCS Yuri Gurevich
2005	J	`jnl`	Partial updates. Theor. Comput. Sci. Yuri Gurevich, Nikolai Tillmann
2005	—	`conf`	Play to Test. FATES Andreas Blass, Yuri Gurevich, Lev Nachmanson, Margus Veanes
2005	—	`conf`	Preface. RV@CAV Howard Barringer, Bernd Finkbeiner, Yuri Gurevich, Henny B. Sipma
2005	—	`ed.`	Proceedings of the Workshop on Model Based Testing, MBT 2004, Barcelona, Spain, March 27-28, 2004 MBT Yuri Gurevich, Alexander K. Petrenko
2005	J	`jnl`	Semantic essence of AsmL. Theor. Comput. Sci. Yuri Gurevich, Benjamin Rossman, Wolfram Schulte
2004	J	`jnl`	Abstract Communication Model for Distributed Systems. IEEE Trans. Software Eng. Uwe Glässer, Yuri Gurevich, Margus Veanes
2004	—	`conf`	Abstract State Machines: An Overview of the Project. FoIKS Yuri Gurevich
2004	—	`conf`	Intra-step Interaction. Abstract State Machines Yuri Gurevich
2004	—	`conf`	Observations on the Decidability of Transitions. Abstract State Machines Yuri Gurevich, Rostislav Yavorskiy
2004	—	`conf`	Preface. MBT Yuri Gurevich, Alexander K. Petrenko, Alexander S. Kossatchev
2004	J	`jnl`	Why Sets? (Column: Logic in Computer Science). Bull. EATCS Andreas Blass, Yuri Gurevich
2003	J	`jnl`	Abstract state machines capture parallel algorithms. ACM Trans. Comput. Log. Andreas Blass, Yuri Gurevich
2003	J	`jnl`	Algorithms: A Quest for Absolute Definitions. Bull. EATCS Andreas Blass, Yuri Gurevich
2003	—	`conf`	Partial Updates Exploration II. Abstract State Machines Yuri Gurevich, Nikolai Tillmann
2003	—	`conf`	Semantic Essence of AsmL. FMCO Yuri Gurevich, Benjamin Rossman, Wolfram Schulte
2003	A*	`conf`	Spectra of Monadic Second-Order Formulas with One Unary Function. LICS Yuri Gurevich, Saharon Shelah
2003	J	`jnl`	Strong extension axioms and Shelah's zero-one law for choiceless polynomial time. J. Symb. Log. Andreas Blass, Yuri Gurevich
2002	J	`jnl`	Abstract State Machines and Computationally Complete Query Languages. Inf. Comput. Andreas Blass, Yuri Gurevich, Jan Van den Bussche
2002	J	`jnl`	Algorithms vs. Machines. Bull. EATCS Andreas Blass, Yuri Gurevich
2002	J	`jnl`	Definability in Rationals with Real Order in the Background. J. Log. Comput. Yuri Gurevich, Alexander Moshe Rabinovich
2002	J	`jnl`	Fixed point logics. Bull. Symb. Log. Anuj Dawar, Yuri Gurevich
2002	A	`conf`	Generating finite state machines from abstract state machines. ISSTA Wolfgang Grieskamp, Yuri Gurevich, Wolfram Schulte, Margus Veanes
2002	—	`conf`	High-Level Executable Specification of the Universal Plug and Play Architecture. HICSS Uwe Glässer, Yuri Gurevich, Margus Veanes
2002	J	`jnl`	On Polynomial Time Computation over Unordered Structures. J. Symb. Log. Andreas Blass, Yuri Gurevich, Saharon Shelah
2002	J	`jnl`	Pairwise Testing. Bull. EATCS Andreas Blass, Yuri Gurevich
2001	—	`ch.`	AMAST'91 Banquet Talk. Current Trends in Theoretical Computer Science Yuri Gurevich
2001	J	`jnl`	Addendum to "Choiceless Polynomial Time": Ann. Pure Appl. Logic 100 (1999) 141-187. Ann. Pure Appl. Log. Andreas Blass, Yuri Gurevich, Saharon Shelah
2001	—	`ch.`	From Invariants to Canonization. Current Trends in Theoretical Computer Science Yuri Gurevich
2001	—	`ch.`	Herbrand's Theorem and Equational Reasoning: Problems and Solutions. Current Trends in Theoretical Computer Science Anatoli Degtyarev, Yuri Gurevich, Andrei Voronkov
2001	J	`jnl`	Inadequacy of computable loop invariants. ACM Trans. Comput. Log. Andreas Blass, Yuri Gurevich
2001	A*	`conf`	Logician in the Land of OS: Abstract State Machines in Microsoft. LICS Yuri Gurevich
2001	J	`jnl`	Partial Updates: Exploration. J. Univers. Comput. Sci. Yuri Gurevich, Nikolai Tillmann
2001	—	`ch.`	Platonism, Constructivism, and Computer Proofs vs. Proofs by Hand. Current Trends in Theoretical Computer Science Yuri Gurevich
2001	—	`conf`	The Abstract State Machine Paradigm: What Is in and What Is out. Ershov Memorial Conference Yuri Gurevich
2001	—	`ch.`	The Sequential ASM Thesis. Current Trends in Theoretical Computer Science Yuri Gurevich
2001	—	`ch.`	The Underlying Logic of Hoare Logic. Current Trends in Theoretical Computer Science Andreas Blass, Yuri Gurevich
2001	—	`ch.`	The Value, if Any, of Decidability. Current Trends in Theoretical Computer Science Yuri Gurevich
2000	J	`jnl`	A New Zero-One Law and Strong Extension Axioms. Bull. EATCS Andreas Blass, Yuri Gurevich
2000	—	`conf`	Abstract State Machines and Computationally Complete Query Languages. Abstract State Machines Andreas Blass, Yuri Gurevich, Jan Van den Bussche
2000	—	`ed.`	Abstract State Machines, Theory and Applications, International Workshop, ASM 2000, Monte Verità, Switzerland, March 19-24, 2000, Proceedings Abstract State Machines Yuri Gurevich, Philipp W. Kutter, Martin Odersky, Lothar Thiele
2000	B	`conf`	Background, Reserve, and Gandy Machines. CSL Andreas Blass, Yuri Gurevich
2000	B	`conf`	Choiceless Polynominal Time Computation and the Zero-One Law. CSL Andreas Blass, Yuri Gurevich
2000	J	`jnl`	Decidability and complexity of simultaneous rigid E-unification with one variable and related results. Theor. Comput. Sci. Anatoli Degtyarev, Yuri Gurevich, Paliath Narendran, Margus Veanes, Andrei Voronkov
2000	J	`jnl`	Definability and Undefinability with Real Order at The Background. J. Symb. Log. Yuri Gurevich, Alexander Moshe Rabinovich
2000	J	`jnl`	Existential second-order logic over strings. J. ACM Thomas Eiter, Yuri Gurevich, Georg Gottlob
2000	—	`conf`	Investigating Java Concurrency Using Abstract State Machines. Abstract State Machines Yuri Gurevich, Wolfram Schulte, Charles Wallace
2000	—	`conf`	Invited Talk: ASM Formalware in the Software Engineering Cycle. AMAST Yuri Gurevich
2000	—	`conf`	Partially Ordered Runs: A Case Study. Abstract State Machines Yuri Gurevich, Dean Rosenzweig
2000	J	`jnl`	Sequential abstract-state machines capture sequential algorithms. ACM Trans. Comput. Log. Yuri Gurevich
2000	J	`jnl`	The Logic of Choice. J. Symb. Log. Andreas Blass, Yuri Gurevich
2000	J	`jnl`	The Underlying Logic of Hoare Logic. Bull. EATCS Andreas Blass, Yuri Gurevich
2000	—	`conf`	Using Abstract State Machines at Microsoft: A Case Study. Abstract State Machines Michael Barnett, Egon Börger, Yuri Gurevich, Wolfram Schulte, Margus Veanes
1999	J	`jnl`	Choiceless Polynomial Time. Ann. Pure Appl. Log. Andreas Blass, Yuri Gurevich, Saharon Shelah
1999	J	`jnl`	Logic with Equality: Partisan Corroboration and Shifted Pairing. Inf. Comput. Yuri Gurevich, Margus Veanes
1999	J	`jnl`	Monadic Simultaneous Rigid E-unification. Theor. Comput. Sci. Yuri Gurevich, Andrei Voronkov
1999	J	`jnl`	The Sequential ASM Thesis. Bull. EATCS Yuri Gurevich
1998	J	`jnl`	A Variation on the Zero-One Law. Inf. Process. Lett. Andreas Blass, Yuri Gurevich, Vladik Kreinovich, Luc Longpré
1998	J	`jnl`	Equivalence is in the Eye of the Beholder CoRR Yuri Gurevich, James K. Huggins
1998	J	`jnl`	Evolving Algebras and Partial Evaluation CoRR Yuri Gurevich, James K. Huggins
1998	A*	`conf`	Existential Second-Order Logic over Strings. LICS Thomas Eiter, Georg Gottlob, Yuri Gurevich
1998	J	`jnl`	Metafinite Model Theory. Inf. Comput. Erich Grädel, Yuri Gurevich
1998	A*	`conf`	The Complexity of Query Reliability. PODS Erich Grädel, Yuri Gurevich, Colin Hirsch
1998	—	`conf`	The Decidability of Simultaneous Rigid RTA Anatoli Degtyarev, Yuri Gurevich, Paliath Narendran, Margus Veanes, Andrei Voronkov
1998	J	`jnl`	The Railroad Crossing Problem: An Experiment with Instantaneous Actions and Immediate Reactions CoRR Yuri Gurevich, James K. Huggins
1997	J	`jnl`	Equivalence is in the Eye of the Beholder. Theor. Comput. Sci. Yuri Gurevich, James K. Huggins
1997	J	`jnl`	Formalizing Database Recovery. J. Univers. Comput. Sci. Yuri Gurevich, Nandit Soparkar, Charles Wallace
1997	J	`jnl`	From Invariants to Canonization. Bull. EATCS Yuri Gurevich
1997	J	`jnl`	Gurevich Abstract State Machines and Schoenhage Storage Modification Machines. J. Univers. Comput. Sci. Scott D. Dexter, Patrick Doyle, Yuri Gurevich
1997	A*	`conf`	Monadic Simultaneous Rigid E-Unification and Related Problems. ICALP Yuri Gurevich, Andrei Voronkov
1997	J	`jnl`	Recursive Abstract State Machines. J. Univers. Comput. Sci. Yuri Gurevich, Marc Spielmann
1997	—	`conf`	Syntax vs. Semantics on Finite Structures. Structures in Logic and Computer Science Natasha Alechina, Yuri Gurevich
1997	—	`book`	The Classical Decision Problem Egon Börger, Erich Grädel, Yuri Gurevich
1997	J	`jnl`	The Linear Time Hierarchy Theorems for Abstract State Machines and RAMs. J. Univers. Comput. Sci. Andreas Blass, Yuri Gurevich
1996	J	`jnl`	Herbrand's Theorem and Equational Reasoning: Problems and Solutions. Bull. EATCS Anatoli Degtyarev, Yuri Gurevich, Andrei Voronkov
1996	J	`jnl`	Normal Forms for Second-Order Logic over Finite Structures, and Classification of NP Optimization Problems. Ann. Pure Appl. Log. Thomas Eiter, Georg Gottlob, Yuri Gurevich
1996	J	`jnl`	On Finite Rigid Structures. J. Symb. Log. Yuri Gurevich, Saharon Shelah
1995	J	`jnl`	A Tribute to Dirk van Dalen - Preface. Ann. Pure Appl. Log. Yuri Gurevich
1995	Misc	`conf`	Formalizing Recovery in Transaction-Oriented Database Systems. COMAD Charles Wallace, Yuri Gurevich, Nandit Soparkar
1995	J	`jnl`	Matrix Transformation Is Complete for the Average Case. SIAM J. Comput. Andreas Blass, Yuri Gurevich
1995	J	`jnl`	Platonism, Constructivism, and Computer Proofs vs. Proofs by Hand. Bull. EATCS Yuri Gurevich
1995	J	`jnl`	Tailoring Recursion for Complexity. J. Symb. Log. Erich Grädel, Yuri Gurevich
1995	B	`conf`	The Railroad Crossing Problem: An Experiment with Instantaneous Actions and Immediate Reactions. CSL Yuri Gurevich, James K. Huggins
1995	J	`jnl`	The Value, if any, of Decidability. Bull. EATCS Yuri Gurevich
1994	B	`ed.`	Computer Science Logic, 7th Workshop, CSL '93, Swansea, United Kingdom, September 13-17, 1993, Selected Papers CSL Egon Börger, Yuri Gurevich, Karl Meinke
1994	J	`jnl`	Datalog vs First-Order Logic. J. Comput. Syst. Sci. Miklós Ajtai, Yuri Gurevich
1994	—	`conf`	Evolving Algebras and Linear Time Hierarchy. IFIP Congress (1) Andreas Blass, Yuri Gurevich
1994	—	`conf`	Evolving Algebras and Partial Evaluation. IFIP Congress (1) Yuri Gurevich, James K. Huggins
1994	—	`conf`	Evolving Algebras. IFIP Congress (1) Yuri Gurevich
1994	J	`jnl`	Logic activities in Europe. SIGACT News Yuri Gurevich
1994	J	`jnl`	McColm conjecture. CoRR Yuri Gurevich, Neil Immerman, Saharon Shelah
1994	A*	`conf`	McColm's Conjecture LICS Yuri Gurevich, Neil Immerman, Saharon Shelah
1994	—	`conf`	Metafinite Model Theory. LCC Erich Grädel, Yuri Gurevich
1994	J	`jnl`	On finite rigid structures. CoRR Yuri Gurevich, Saharon Shelah
1994	A*	`conf`	Tailoring Recursing for Complexity. ICALP Erich Grädel, Yuri Gurevich
1993	A*	`conf`	Curb Your Theory! A Circumspective Approach for Inclusive Interpretation of Disjunctive Information. IJCAI Thomas Eiter, Georg Gottlob, Yuri Gurevich
1993	B	`conf`	ERRATA to "The Semantics of the C Programming Language". CSL Yuri Gurevich, James K. Huggins
1993	—	`ch.`	Evolving Algebras: an Attempt to Discover Semantics. Current Trends in Theoretical Computer Science Yuri Gurevich
1993	—	`ch.`	Evolving algebras 1993: Lipari guide. Specification and validation methods Yuri Gurevich
1993	—	`ch.`	Group membership protocol: specification and verification. Specification and validation methods Yuri Gurevich, Raghu Mani
1993	—	`ch.`	Infinite Games. Current Trends in Theoretical Computer Science Yuri Gurevich
1993	—	`ch.`	Logic in Computer Science. Current Trends in Theoretical Computer Science Yuri Gurevich
1993	—	`ch.`	On Kolmogorov Machines and Related Issues. Current Trends in Theoretical Computer Science Yuri Gurevich
1993	—	`ch.`	On the Classical Decision Problem. Current Trends in Theoretical Computer Science Yuri Gurevich
1993	J	`jnl`	Randomizing Reductions of Search Problems. SIAM J. Comput. Andreas Blass, Yuri Gurevich
1993	—	`ch.`	The bakery algorithm: yet another specification and verification. Specification and validation methods Dean Rosenzweig, Egon Börger, Yuri Gurevich
1993	—	`ch.`	The challenger-Solver Game: variations on the Theme of P=NP. Current Trends in Theoretical Computer Science Yuri Gurevich
1993	—	`ch.`	Zero-One Laws. Current Trends in Theoretical Computer Science Yuri Gurevich
1992	B	`conf`	The Semantics of the C Programming Language. CSL Yuri Gurevich, James K. Huggins
1992	J	`jnl`	Zero-One Laws. Bull. EATCS Yuri Gurevich
1991	J	`jnl`	Average Case Completeness. J. Comput. Syst. Sci. Yuri Gurevich
1991	A*	`conf`	Average Case Complexity. ICALP Yuri Gurevich
1991	—	`conf`	Randomizing Reductions of Search Problems. FSTTCS Andreas Blass, Yuri Gurevich
1990	A*	`conf`	Matrix Decomposition Problem Is Complete for the Average Case FOCS Yuri Gurevich
1990	J	`jnl`	Nondeterministic Linear-Time Tasks May Require Substantially Nonlinear Deterministic Time in the Case of Sublinear Work Space J. ACM Yuri Gurevich, Saharon Shelah
1990	J	`jnl`	On the Classical Desicion Problem. Bull. EATCS Yuri Gurevich
1990	B	`conf`	On the Reduction Theory for Average Case Complexity. CSL Andreas Blass, Yuri Gurevich
1990	J	`jnl`	Preface Inf. Comput. Yuri Gurevich
1989	B	`conf`	Algebraic Operational Semantics and Occam. CSL Yuri Gurevich, Lawrence S. Moss
1989	A*	`conf`	Datalog vs. First-Order Logic FOCS Miklós Ajtai, Yuri Gurevich
1989	J	`jnl`	Logic in Computer Science Column. Bull. EATCS Yuri Gurevich
1989	—	`conf`	Nearly Linear Time. Logic at Botik Yuri Gurevich, Saharon Shelah
1989	J	`jnl`	On Matijasevitch's Nontraditional Approach to Search Problems. Inf. Process. Lett. Andreas Blass, Yuri Gurevich
1989	J	`jnl`	On the Strength of the Interpretation Method. J. Symb. Log. Yuri Gurevich, Saharon Shelah
1989	J	`jnl`	The Logic in computer science Column. Bull. EATCS Yuri Gurevich
1989	J	`jnl`	Time Polynomial in Input or Output. J. Symb. Log. Yuri Gurevich, Saharon Shelah
1988	J	`jnl`	Logic in computer Science Column. Bull. EATCS Yuri Gurevich
1988	A*	`conf`	Nondeterministic Linear-Time Tasks May Require Substantially Nonlinear Deterministic Time in the Case of Sublinear Work Space STOC Yuri Gurevich, Saharon Shelah
1987	B	`conf`	Algebraic Operational Semantics and Modula-2. CSL Yuri Gurevich, James M. Morris
1987	—	`conf`	Algenraic Operational Semantics. FSTTCS Yuri Gurevich
1987	A*	`conf`	Complete and Incomplete Randomized NP Problems FOCS Yuri Gurevich
1987	—	`conf`	Existential Fixed-Point Logic. Computation Theory and Logic Andreas Blass, Yuri Gurevich
1987	J	`jnl`	Expected Computation Time for Hamiltonian Path Problem. SIAM J. Comput. Yuri Gurevich, Saharon Shelah
1987	J	`jnl`	Monotone versus positive. J. ACM Miklós Ajtai, Yuri Gurevich
1986	J	`jnl`	Definability by Constant-Depth Polynomial-Size Circuits Inf. Control. Larry Denenberg, Yuri Gurevich, Saharon Shelah
1986	J	`jnl`	Fixed-point extensions of first-order logic. Ann. Pure Appl. Log. Yuri Gurevich, Saharon Shelah
1986	J	`jnl`	Henkin quantifiers and complete problems. Ann. Pure Appl. Log. Andreas Blass, Yuri Gurevich
1986	J	`jnl`	On the number of active nodes in a multicomputer system. Networks Amnon Barak, Zvi Drezner, Yuri Gurevich
1986	J	`jnl`	What does O(n) mean. SIGACT News Yuri Gurevich
1985	J	`jnl`	A Zero-One Law for Logic with a Fixed-Point Operator Inf. Control. Andreas Blass, Yuri Gurevich, Dexter Kozen
1985	A*	`conf`	Fixed-Point Extensions of First-Order Logic FOCS Yuri Gurevich, Saharon Shelah
1985	J	`jnl`	The Decision Problem for Branching Time Logic. J. Symb. Log. Yuri Gurevich, Saharon Shelah
1985	J	`jnl`	The decision problem for linear temporal logic. Notre Dame J. Formal Log. John P. Burgess, Yuri Gurevich
1984	J	`jnl`	A Decidable Subclass of the Minimal Godel Class with Identity. J. Symb. Log. Warren D. Goldfarb, Yuri Gurevich, Saharon Shelah
1984	J	`jnl`	A Logic for Constant-Depth Circuits Inf. Control. Yuri Gurevich, Harry R. Lewis
1984	J	`jnl`	Equivalence Relations, Invariants, and Normal Forms. SIAM J. Comput. Andreas Blass, Yuri Gurevich
1984	J	`jnl`	Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems. J. ACM Yuri Gurevich, Larry J. Stockmeyer, Uzi Vishkin
1984	J	`jnl`	The Word Problem for Cancellation Semigroups with Zero. J. Symb. Log. Yuri Gurevich, Harry R. Lewis
1983	A*	`conf`	Algebras of Feasible Functions FOCS Yuri Gurevich
1983	J	`jnl`	Decision Problem for Separated Distributive Lattices. J. Symb. Log. Yuri Gurevich
1983	—	`conf`	Equivalence relations, invariants, and normal forms. Logic and Machines Andreas Blass, Yuri Gurevich
1983	J	`jnl`	Interpreting Second-Order Logic in the Monadic Theory of Order. J. Symb. Log. Yuri Gurevich, Saharon Shelah
1983	J	`jnl`	Rabin's Uniformization Problem. J. Symb. Log. Yuri Gurevich, Saharon Shelah
1983	J	`jnl`	Random Models and the Godel Case of the Decision Problem. J. Symb. Log. Yuri Gurevich, Saharon Shelah
1983	J	`jnl`	The Monadic Theory of omega J. Symb. Log. Yuri Gurevich, Menachem Magidor, Saharon Shelah
1982	A*	`conf`	Can Message Buffers be Characterized in Linear Temporal Logic? PODC A. Prasad Sistla, Edmund M. Clarke, Nissim Francez, Yuri Gurevich
1982	J	`jnl`	Monadic theory of order and topology in ZFC. Ann. Math. Log. Yuri Gurevich, Saharon Shelah
1982	J	`jnl`	On the Unique Satisfiability Problem Inf. Control. Andreas Blass, Yuri Gurevich
1982	J	`jnl`	The Inference Problem for Template Dependencies Inf. Control. Yuri Gurevich, Harry R. Lewis
1982	A*	`conf`	The Inference Problem for Template Dependencies. PODS Yuri Gurevich, Harry R. Lewis
1982	A*	`conf`	Trees, Automata, and Games STOC Yuri Gurevich, Leo Harrington
1980	J	`jnl`	Existential interpretation. II. Arch. Math. Log. Yuri Gurevich
1980	J	`jnl`	Prefix classes of krom formulae with identity. Arch. Math. Log. Stål O. Aanderaa, Egon Börger, Yuri Gurevich
1979	J	`jnl`	Modest Theory of Short Chains. I. J. Symb. Log. Yuri Gurevich
1979	J	`jnl`	Modest Theory of Short Chains. II. J. Symb. Log. Yuri Gurevich, Saharon Shelah
1977	J	`jnl`	Semi-conservative reduction. Arch. Math. Log. Yuri Gurevich
1976	J	`jnl`	The Decision Problem for Standard Classes. J. Symb. Log. Yuri Gurevich