Yuri Gurevich

According to our database, Yuri Gurevich authored at least 234 papers between 1976 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2023

Software science view on quantum circuit algorithms.

Yuri Gurevich, Andreas Blass

Inf. Comput., June, 2023

What are kets?

Yuri Gurevich, Andreas Blass

Bull. EATCS, 2023

Obituary: Gregory Tseytin.

Yuri Gurevich

Bull. EATCS, 2023

The umbilical cord of finite model theory.

Yuri Gurevich

Bull. EATCS, 2023

Obituary: Yuri Manin.

Yuri Gurevich

Bull. EATCS, 2023

Primal logic of information.

Yuri Gurevich, Andreas Blass

CoRR, 2023

2022

Quantum circuits with classical channels and the principle of deferred measurements.

Yuri Gurevich, Andreas Blass

Theor. Comput. Sci., 2022

The 1966 International Congress of Mathematicians: A Micro-memoir.

Yuri Gurevich

Fundam. Informaticae, 2022

Wigner's quasidistribution and Dirac's kets.

Andreas Blass, Yuri Gurevich, Alexander Volberg

Bull. EATCS, 2022

A more abstract bounded exploration postulate.

Yuri Gurevich, Tatiana Yavorskaya

CoRR, 2022

2021

Reversify any sequential algorithm.

Yuri Gurevich

Bull. EATCS, 2021

Logical foundations: Personal perspective.

Yuri Gurevich

Bull. EATCS, 2021

Simple circuit simulations of classical and quantum Turing machines.

Yuri Gurevich, Andreas Blass

CoRR, 2021

2020

Braided distributivity.

Andreas Blass, Yuri Gurevich

Theor. Comput. Sci., 2020

Witness algebra and anyon braiding.

Andreas Blass, Yuri Gurevich

Math. Struct. Comput. Sci., 2020

Means-fit Effectivity.

Yuri Gurevich

Bull. EATCS, 2020

Circuits: An abstract viewpoint.

Andreas Blass, Yuri Gurevich

Bull. EATCS, 2020

Negative probabilities: What they are and what they are for.

Andreas Blass, Yuri Gurevich

CoRR, 2020

2019

Unconstrained Church-Turing thesis cannot possibly be true.

Yuri Gurevich

Bull. EATCS, 2019

Circuit pedantry.

Andreas Blass, Yuri Gurevich

Bull. EATCS, 2019

Test statistics and p-values.

Yuri Gurevich, Vladimir Vovk

Proceedings of the Conformal and Probabilistic Prediction and Applications, 2019

2018

An Invitation to Quantum Computing.

Andreas Blass, Yuri Gurevich

Bull. EATCS, 2018

Negative probabilities, II What they are and what they are for.

Andreas Blass, Yuri Gurevich

Bull. EATCS, 2018

Who needs category theory?

Andreas Blass, Yuri Gurevich

Bull. EATCS, 2018

Evolving Algebras 1993: Lipari Guide.

Yuri Gurevich

CoRR, 2018

Coherence for braided distributivity.

Andreas Blass, Yuri Gurevich

CoRR, 2018

2017

On the Rectilinear Steiner Problem.

Andreas Blass, Yuri Gurevich

Bull. EATCS, 2017

Common Denominator for Value and Expectation No-go Theorems: Extended Abstract.

Andreas Blass, Yuri Gurevich

Proceedings of the Proceedings 14th International Conference on Quantum Physics and Logic, 2017

2016

Basic primal infon logic.

Carlos Cotrini, Yuri Gurevich

J. Log. Comput., 2016

Past Present.

Yuri Gurevich

Int. J. Found. Comput. Sci., 2016

Fundamentals of p-values: Introduction.

Yuri Gurevich, Vladimir Vovk

Bull. EATCS, 2016

EATCS Fellows' Advice to the Young Theoretical Computer Scientist.

Luca Aceto, Mariangiola Dezani-Ciancaglini, Yuri Gurevich, David Harel, Monika Henzinger, Giuseppe F. Italiano, Scott A. Smolka, Paul G. Spirakis, Wolfgang Thomas

Bull. EATCS, 2016

Inverse privacy.

Yuri Gurevich, Jeannette M. Wing

Commun. ACM, 2016

On Quantum Computation, Anyons, and Categories.

Andreas Blass, Yuri Gurevich

Proceedings of the Martin Davis on Computability, 2016

2015

Inverse Privacy.

Yuri Gurevich, Efim Hudis, Jeannette M. Wing

CoRR, 2015

Impugning alleged randomness.

Yuri Gurevich

Proceedings of the 2015 Annual Conference of the North American Fuzzy Information Processing Society (NAFIPS) held jointly with 2015 5th World Conference on Soft Computing (WConSC), 2015

2014

Propositional primal logic with disjunction.

Lev D. Beklemishev, Yuri Gurevich

J. Log. Comput., 2014

Primal Infon Logic with Conjunctions as Sets.

Carlos Cotrini, Yuri Gurevich, Ori Lahav, Artem Melentyev

Proceedings of the Theoretical Computer Science, 2014

2013

Transitive Primal Infon Logic-ERRATUM.

Carlos Cotrini, Yuri Gurevich

Rev. Symb. Log., 2013

Transitive Primal Infon Logic.

Carlos Cotrini, Yuri Gurevich

Rev. Symb. Log., 2013

Abstract Hilbertian deductive systems, infon logic, and Datalog.

Andreas Blass, Yuri Gurevich

Inf. Comput., 2013

Explicating SDKs: Uncovering Assumptions Underlying Secure Authentication and Authorization.

Rui Wang, Yuchen Zhou, Shuo Chen, Shaz Qadeer, David Evans, Yuri Gurevich

Proceedings of the 22th USENIX Security Symposium, Washington, DC, USA, August 14-16, 2013, 2013

dkal ⋆ : Constructing Executable Specifications of Authorization Protocols.

Jean-Baptiste Jeannin, Guido de Caso, Juan Chen, Yuri Gurevich, Prasad Naldurg, Nikhil Swamy

Proceedings of the Engineering Secure Software and Systems - 5th International Symposium, 2013

2012

Impugning Randomness, Convincingly.

Yuri Gurevich, Grant Olney Passmore

Stud Logica, 2012

What Is an Algorithm?

Yuri Gurevich

Proceedings of the SOFSEM 2012: Theory and Practice of Computer Science, 2012

Datalog: A Perspective and the Potential.

Yuri Gurevich

Proceedings of the Datalog in Academia and Industry - Second International Workshop, 2012

Foundational Analyses of Computation.

Yuri Gurevich

Proceedings of the How the World Computes, 2012

From Primal Infon Logic with Individual Variables to Datalog.

Nikolaj S. Bjørner, Guido de Caso, Yuri Gurevich

Proceedings of the Correct Reasoning, 2012

2011

Logic of infons: The propositional case.

Yuri Gurevich, Itay Neeman

ACM Trans. Comput. Log., 2011

Persistent queries in the behavioral theory of algorithms.

Andreas Blass, Yuri Gurevich

ACM Trans. Comput. Log., 2011

Impugning Randomness, Convincingly.

Yuri Gurevich

Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011

Zero-One Laws: Thesauri and Parametric Conditions.

Andreas Blass, Yuri Gurevich

Proceedings of the Proof, Computation and Agency - Logic at the Crossroads., 2011

2010

Content-dependent chunking for differential compression, the local maximum approach.

Nikolaj S. Bjørner, Andreas Blass, Yuri Gurevich

J. Comput. Syst. Sci., 2010

Preface.

Bernd Finkbeiner, Yuri Gurevich, Alexander K. Petrenko

Proceedings of the Sixth Workshop on Model-Based Testing, 2010

The Tower-of-Babel Problem, and Security Assesment Sharing.

Andreas Blass, Yuri Gurevich, Efim Hudis

Bull. EATCS, 2010

Hilbertian Deductive Systems, Infon Logic, and Datalog.

Andreas Blass, Yuri Gurevich

Bull. EATCS, 2010

Exact Exploration and Hanging Algorithms.

Andreas Blass, Nachum Dershowitz, Yuri Gurevich

Proceedings of the Computer Science Logic, 24th International Workshop, 2010

Evidential Authorization.

Andreas Blass, Yuri Gurevich, Michal Moskal, Itay Neeman

Proceedings of the Future of Software Engineering., 2010

2009

Database Query Processing Using Finite Cursor Machines.

Martin Grohe, Yuri Gurevich, Dirk Leinders, Nicole Schweikardt, Jerzy Tyszkiewicz, Jan Van den Bussche

Theory Comput. Syst., 2009

A geometric zero-one law.

Robert H. Gilman, Yuri Gurevich, Alexei D. Miasnikov

J. Symb. Log., 2009

Symbolic Bounded Model Checking of Abstract State Machines.

Margus Veanes, Nikolaj S. Bjørner, Yuri Gurevich, Wolfram Schulte

Int. J. Softw. Informatics, 2009

Teh Logic of Infons.

Yuri Gurevich, Itay Neeman

Bull. EATCS, 2009

When are two algorithms the same?

Andreas Blass, Nachum Dershowitz, Yuri Gurevich

Bull. Symb. Log., 2009

Operational Semantics for DKAL: Application and Analysis.

Yuri Gurevich, Arnab Roy

Proceedings of the Trust, 2009

2008

Abstract state machines capture parallel algorithms: Correction and extension.

Andreas Blass, Yuri Gurevich

ACM Trans. Comput. Log., 2008

Program termination and well partial orderings.

Andreas Blass, Yuri Gurevich

ACM Trans. Comput. Log., 2008

Two Forms of One Useful Logic: Existential Fixed Point Logic and Liberal Datalog.

Andreas Blass, Yuri Gurevich

Bull. EATCS, 2008

Modular difference logic is hard

Nikolaj S. Bjørner, Andreas Blass, Yuri Gurevich, Madan Musuvathi

CoRR, 2008

Persistent Queries

Andreas Blass, Yuri Gurevich

CoRR, 2008

A Natural Axiomatization of Computability and Proof of Church's Thesis.

Nachum Dershowitz, Yuri Gurevich

Bull. Symb. Log., 2008

One Useful Logic That Defines Its Own Truth.

Andreas Blass, Yuri Gurevich

Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

DKAL: Distributed-Knowledge Authorization Language.

Yuri Gurevich, Itay Neeman

Proceedings of the 21st IEEE Computer Security Foundations Symposium, 2008

Why Sets?

Andreas Blass, Yuri Gurevich

Proceedings of the Pillars of Computer Science, 2008

2007

Ordinary interactive small-step algorithms, III.

Andreas Blass, Yuri Gurevich

ACM Trans. Comput. Log., 2007

Ordinary interactive small-step algorithms, II.

Andreas Blass, Yuri Gurevich

ACM Trans. Comput. Log., 2007

Can abstract state machines be useful in language theory?

Yuri Gurevich, Margus Veanes, Charles Wallace

Theor. Comput. Sci., 2007

Membership Problem for the Modular Group.

Yuri Gurevich, Paul E. Schupp

SIAM J. Comput., 2007

Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem.

Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman

Log. Methods Comput. Sci., 2007

Interactive Small-Step Algorithms I: Axiomatization.

Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman

Log. Methods Comput. Sci., 2007

Background of Computation.

Andreas Blass, Yuri Gurevich

Bull. EATCS, 2007

Zero-One Laws: Thesauri and Parametric Conditions.

Andreas Blass, Yuri Gurevich

Bull. EATCS, 2007

A Theory of Stream Queries.

Yuri Gurevich, Dirk Leinders, Jan Van den Bussche

Proceedings of the Database Programming Languages, 11th International Symposium, 2007

Proving Church's Thesis.

Yuri Gurevich

Proceedings of the Computer Science, 2007

2006

Ordinary interactive small-step algorithms, I.

Andreas Blass, Yuri Gurevich

ACM Trans. Comput. Log., 2006

Can Abstract State Machines Be Useful in Language Theory?.

Yuri Gurevich, Charles Wallace

Proceedings of the Developments in Language Theory, 10th International Conference, 2006

2005

Partial updates.

Yuri Gurevich, Nikolai Tillmann

Theor. Comput. Sci., 2005

Semantic essence of AsmL.

Yuri Gurevich, Benjamin Rossman, Wolfram Schulte

Theor. Comput. Sci., 2005

Preface.

Howard Barringer, Bernd Finkbeiner, Yuri Gurevich, Henny B. Sipma

Proceedings of the Fifth Workshop on Runtime Verification, 2005

Interactive Algorithms 2005.

Yuri Gurevich

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

Play to Test.

Andreas Blass, Yuri Gurevich, Lev Nachmanson, Margus Veanes

Proceedings of the Formal Approaches to Software Testing, 5th International Workshop, 2005

Behavioral Computation Theory 2005.

Yuri Gurevich

Proceedings of the 12th International Workshop on Abstract State Machines, 2005

2004

Abstract Communication Model for Distributed Systems.

Uwe Glässer, Yuri Gurevich, Margus Veanes

IEEE Trans. Software Eng., 2004

Preface.

Yuri Gurevich, Alexander K. Petrenko, Alexander S. Kossatchev

Proceedings of the Workshop on Model Based Testing, 2004

Why Sets? (Column: Logic in Computer Science).

Andreas Blass, Yuri Gurevich

Bull. EATCS, 2004

Abstract State Machines: An Overview of the Project.

Yuri Gurevich

Proceedings of the Foundations of Information and Knowledge Systems, 2004

Observations on the Decidability of Transitions.

Yuri Gurevich, Rostislav Yavorskiy

Proceedings of the Abstract State Machines 2004. Advances in Theory and Practice, 2004

Intra-step Interaction.

Yuri Gurevich

Proceedings of the Abstract State Machines 2004. Advances in Theory and Practice, 2004

2003

Abstract state machines capture parallel algorithms.

Andreas Blass, Yuri Gurevich

ACM Trans. Comput. Log., 2003

Strong extension axioms and Shelah's zero-one law for choiceless polynomial time.

Andreas Blass, Yuri Gurevich

J. Symb. Log., 2003

Algorithms: A Quest for Absolute Definitions.

Andreas Blass, Yuri Gurevich

Bull. EATCS, 2003

Spectra of Monadic Second-Order Formulas with One Unary Function.

Yuri Gurevich, Saharon Shelah

Proceedings of the 18th IEEE Symposium on Logic in Computer Science (LICS 2003), 2003

Partial Updates Exploration II.

Yuri Gurevich, Nikolai Tillmann

Proceedings of the Abstract State Machines, 2003

2002

Definability in Rationals with Real Order in the Background.

Yuri Gurevich, Alexander Moshe Rabinovich

J. Log. Comput., 2002

On Polynomial Time Computation over Unordered Structures.

Andreas Blass, Yuri Gurevich, Saharon Shelah

J. Symb. Log., 2002

Abstract State Machines and Computationally Complete Query Languages.

Andreas Blass, Yuri Gurevich, Jan Van den Bussche

Inf. Comput., 2002

Algorithms vs. Machines.

Andreas Blass, Yuri Gurevich

Bull. EATCS, 2002

Pairwise Testing.

Andreas Blass, Yuri Gurevich

Bull. EATCS, 2002

Fixed point logics.

Anuj Dawar, Yuri Gurevich

Bull. Symb. Log., 2002

Generating finite state machines from abstract state machines.

Wolfgang Grieskamp, Yuri Gurevich, Wolfram Schulte, Margus Veanes

Proceedings of the International Symposium on Software Testing and Analysis, 2002

High-Level Executable Specification of the Universal Plug and Play Architecture.

Uwe Glässer, Yuri Gurevich, Margus Veanes

Proceedings of the 35th Hawaii International Conference on System Sciences (HICSS-35 2002), 2002

2001

Inadequacy of computable loop invariants.

Andreas Blass, Yuri Gurevich

ACM Trans. Comput. Log., 2001

Partial Updates: Exploration.

Yuri Gurevich, Nikolai Tillmann

J. Univers. Comput. Sci., 2001

Addendum to "Choiceless Polynomial Time": Ann. Pure Appl. Logic 100 (1999) 141-187.

Andreas Blass, Yuri Gurevich, Saharon Shelah

Ann. Pure Appl. Log., 2001

Logician in the Land of OS: Abstract State Machines in Microsoft.

Yuri Gurevich

Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, 2001

The Abstract State Machine Paradigm: What Is in and What Is out.

Yuri Gurevich

Proceedings of the Perspectives of System Informatics, 2001

The Sequential ASM Thesis.

Yuri Gurevich

Proceedings of the Current Trends in Theoretical Computer Science, 2001

From Invariants to Canonization.

Yuri Gurevich

Proceedings of the Current Trends in Theoretical Computer Science, 2001

Platonism, Constructivism, and Computer Proofs vs. Proofs by Hand.

Yuri Gurevich

Proceedings of the Current Trends in Theoretical Computer Science, 2001

The Value, if Any, of Decidability.

Yuri Gurevich

Proceedings of the Current Trends in Theoretical Computer Science, 2001

AMAST'91 Banquet Talk.

Yuri Gurevich

Proceedings of the Current Trends in Theoretical Computer Science, 2001

Herbrand's Theorem and Equational Reasoning: Problems and Solutions.

Anatoli Degtyarev, Yuri Gurevich, Andrei Voronkov

Proceedings of the Current Trends in Theoretical Computer Science, 2001

The Underlying Logic of Hoare Logic.

Andreas Blass, Yuri Gurevich

Proceedings of the Current Trends in Theoretical Computer Science, 2001

2000

Sequential abstract-state machines capture sequential algorithms.

Yuri Gurevich

ACM Trans. Comput. Log., 2000

Decidability and complexity of simultaneous rigid E-unification with one variable and related results.

Anatoli Degtyarev, Yuri Gurevich, Paliath Narendran, Margus Veanes, Andrei Voronkov

Theor. Comput. Sci., 2000

Definability and Undefinability with Real Order at The Background.

Yuri Gurevich, Alexander Moshe Rabinovich

J. Symb. Log., 2000

The Logic of Choice.

Andreas Blass, Yuri Gurevich

J. Symb. Log., 2000

Existential second-order logic over strings.

Thomas Eiter, Yuri Gurevich, Georg Gottlob

J. ACM, 2000

The Underlying Logic of Hoare Logic.

Andreas Blass, Yuri Gurevich

Bull. EATCS, 2000

A New Zero-One Law and Strong Extension Axioms.

Andreas Blass, Yuri Gurevich

Bull. EATCS, 2000

Choiceless Polynominal Time Computation and the Zero-One Law.

Andreas Blass, Yuri Gurevich

Proceedings of the Computer Science Logic, 2000

Background, Reserve, and Gandy Machines.

Andreas Blass, Yuri Gurevich

Proceedings of the Computer Science Logic, 2000

Investigating Java Concurrency Using Abstract State Machines.

Yuri Gurevich, Wolfram Schulte, Charles Wallace

Proceedings of the Abstract State Machines, 2000

Partially Ordered Runs: A Case Study.

Yuri Gurevich, Dean Rosenzweig

Proceedings of the Abstract State Machines, 2000

Using Abstract State Machines at Microsoft: A Case Study.

Michael Barnett, Egon Börger, Yuri Gurevich, Wolfram Schulte, Margus Veanes

Proceedings of the Abstract State Machines, 2000

Invited Talk: ASM Formalware in the Software Engineering Cycle.

Yuri Gurevich

Proceedings of the Algebraic Methodology and Software Technology. 8th International Conference, 2000

1999

Monadic Simultaneous Rigid E-unification.

Yuri Gurevich, Andrei Voronkov

Theor. Comput. Sci., 1999

Logic with Equality: Partisan Corroboration and Shifted Pairing.

Yuri Gurevich, Margus Veanes

Inf. Comput., 1999

The Sequential ASM Thesis.

Yuri Gurevich

Bull. EATCS, 1999

Choiceless Polynomial Time.

Andreas Blass, Yuri Gurevich, Saharon Shelah

Ann. Pure Appl. Log., 1999

1998

A Variation on the Zero-One Law.

Andreas Blass, Yuri Gurevich, Vladik Kreinovich, Luc Longpré

Inf. Process. Lett., 1998

Metafinite Model Theory.

Erich Grädel, Yuri Gurevich

Inf. Comput., 1998

The Decidability of Simultaneous Rigid <i>E</i>-Unification with One Variable.

Anatoli Degtyarev, Yuri Gurevich, Paliath Narendran, Margus Veanes, Andrei Voronkov

Proceedings of the Rewriting Techniques and Applications, 9th International Conference, 1998

The Complexity of Query Reliability.

Erich Grädel, Yuri Gurevich, Colin Hirsch

Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1998

1997

Equivalence is in the Eye of the Beholder.

Yuri Gurevich, James K. Huggins

Theor. Comput. Sci., 1997

Formalizing Database Recovery.

Yuri Gurevich, Nandit Soparkar, Charles Wallace

J. Univers. Comput. Sci., 1997

Recursive Abstract State Machines.

Yuri Gurevich, Marc Spielmann

J. Univers. Comput. Sci., 1997

Gurevich Abstract State Machines and Schoenhage Storage Modification Machines.

Scott D. Dexter, Patrick Doyle, Yuri Gurevich

J. Univers. Comput. Sci., 1997

The Linear Time Hierarchy Theorems for Abstract State Machines and RAMs.

Andreas Blass, Yuri Gurevich

J. Univers. Comput. Sci., 1997

From Invariants to Canonization.

Yuri Gurevich

Bull. EATCS, 1997

Monadic Simultaneous Rigid E-Unification and Related Problems.

Yuri Gurevich, Andrei Voronkov

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

Syntax vs. Semantics on Finite Structures.

Natasha Alechina, Yuri Gurevich

Proceedings of the Structures in Logic and Computer Science, 1997

The Classical Decision Problem

Egon Börger, Erich Grädel, Yuri Gurevich

Perspectives in Mathematical Logic, Springer, 1997

1996

On Finite Rigid Structures.

Yuri Gurevich, Saharon Shelah

J. Symb. Log., 1996

Herbrand's Theorem and Equational Reasoning: Problems and Solutions.

Anatoli Degtyarev, Yuri Gurevich, Andrei Voronkov

Bull. EATCS, 1996

Normal Forms for Second-Order Logic over Finite Structures, and Classification of NP Optimization Problems.

Thomas Eiter, Georg Gottlob, Yuri Gurevich

Ann. Pure Appl. Log., 1996

1995

Matrix Transformation Is Complete for the Average Case.

Andreas Blass, Yuri Gurevich

SIAM J. Comput., 1995

Tailoring Recursion for Complexity.

Erich Grädel, Yuri Gurevich

J. Symb. Log., 1995

The Value, if any, of Decidability.

Yuri Gurevich

Bull. EATCS, 1995

Platonism, Constructivism, and Computer Proofs vs. Proofs by Hand.

Yuri Gurevich

Bull. EATCS, 1995

A Tribute to Dirk van Dalen - Preface.

Yuri Gurevich

Ann. Pure Appl. Log., 1995

The Railroad Crossing Problem: An Experiment with Instantaneous Actions and Immediate Reactions.

Yuri Gurevich, James K. Huggins

Proceedings of the Computer Science Logic, 9th International Workshop, 1995

Formalizing Recovery in Transaction-Oriented Database Systems.

Charles Wallace, Yuri Gurevich, Nandit Soparkar

Proceedings of the Advances in Data Management, 1995

1994

Logic activities in Europe.

Yuri Gurevich

SIGACT News, 1994

Datalog vs First-Order Logic.

Miklós Ajtai, Yuri Gurevich

J. Comput. Syst. Sci., 1994

McColm conjecture.

Yuri Gurevich, Neil Immerman, Saharon Shelah

CoRR, 1994

McColm's Conjecture

Yuri Gurevich, Neil Immerman, Saharon Shelah

Proceedings of the Ninth Annual Symposium on Logic in Computer Science (LICS '94), 1994

Evolving Algebras and Partial Evaluation.

Yuri Gurevich, James K. Huggins

Proceedings of the Technology and Foundations - Information Processing '94, Volume 1, Proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 28 August, 1994

Evolving Algebras.

Yuri Gurevich

Proceedings of the Technology and Foundations - Information Processing '94, Volume 1, Proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 28 August, 1994

Evolving Algebras and Linear Time Hierarchy.

Andreas Blass, Yuri Gurevich

Proceedings of the Technology and Foundations - Information Processing '94, Volume 1, Proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 28 August, 1994

Tailoring Recursing for Complexity.

Erich Grädel, Yuri Gurevich

Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

1993

Zero-One Laws.

Yuri Gurevich

Proceedings of the Current Trends in Theoretical Computer Science - Essays and Tutorials, 1993

Evolving Algebras: an Attempt to Discover Semantics.

Yuri Gurevich

Proceedings of the Current Trends in Theoretical Computer Science - Essays and Tutorials, 1993

On the Classical Decision Problem.

Yuri Gurevich

Proceedings of the Current Trends in Theoretical Computer Science - Essays and Tutorials, 1993

The challenger-Solver Game: variations on the Theme of P=NP.

Yuri Gurevich

Proceedings of the Current Trends in Theoretical Computer Science - Essays and Tutorials, 1993

Infinite Games.

Yuri Gurevich

Proceedings of the Current Trends in Theoretical Computer Science - Essays and Tutorials, 1993

On Kolmogorov Machines and Related Issues.

Yuri Gurevich

Proceedings of the Current Trends in Theoretical Computer Science - Essays and Tutorials, 1993

Logic in Computer Science.

Yuri Gurevich

Proceedings of the Current Trends in Theoretical Computer Science - Essays and Tutorials, 1993

Randomizing Reductions of Search Problems.

Andreas Blass, Yuri Gurevich

SIAM J. Comput., 1993

Curb Your Theory! A Circumspective Approach for Inclusive Interpretation of Disjunctive Information.

Thomas Eiter, Georg Gottlob, Yuri Gurevich

Proceedings of the 13th International Joint Conference on Artificial Intelligence. Chambéry, France, August 28, 1993

ERRATA to "The Semantics of the C Programming Language".

Yuri Gurevich, James K. Huggins

Proceedings of the Computer Science Logic, 7th Workshop, 1993

The bakery algorithm: yet another specification and verification.

Dean Rosenzweig, Egon Börger, Yuri Gurevich

Proceedings of the Specification and validation methods, 1993

Group membership protocol: specification and verification.

Yuri Gurevich, Raghu Mani

Proceedings of the Specification and validation methods, 1993

Evolving algebras 1993: Lipari guide.

Yuri Gurevich

Proceedings of the Specification and validation methods, 1993

1992

Zero-One Laws.

Yuri Gurevich

Bull. EATCS, 1992

The Semantics of the C Programming Language.

Yuri Gurevich, James K. Huggins

Proceedings of the Computer Science Logic, 6th Workshop, 1992

1991

Average Case Completeness.

Yuri Gurevich

J. Comput. Syst. Sci., 1991

Average Case Complexity.

Yuri Gurevich

Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

1990

Nondeterministic Linear-Time Tasks May Require Substantially Nonlinear Deterministic Time in the Case of Sublinear Work Space

Yuri Gurevich, Saharon Shelah

J. ACM, July, 1990

Preface

Yuri Gurevich

Inf. Comput., 1990

On the Classical Desicion Problem.

Yuri Gurevich

Bull. EATCS, 1990

Matrix Decomposition Problem Is Complete for the Average Case

Yuri Gurevich

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

On the Reduction Theory for Average Case Complexity.

Andreas Blass, Yuri Gurevich

Proceedings of the Computer Science Logic, 4th Workshop, 1990

1989

Time Polynomial in Input or Output.

Yuri Gurevich, Saharon Shelah

J. Symb. Log., 1989

On the Strength of the Interpretation Method.

Yuri Gurevich, Saharon Shelah

J. Symb. Log., 1989

On Matijasevitch's Nontraditional Approach to Search Problems.

Andreas Blass, Yuri Gurevich

Inf. Process. Lett., 1989

Nearly Linear Time.

Yuri Gurevich, Saharon Shelah

Proceedings of the Logic at Botik '89, 1989

Algebraic Operational Semantics and Occam.

Yuri Gurevich, Lawrence S. Moss

Proceedings of the CSL '89, 1989

1988

Logic in computer Science Column.

Yuri Gurevich

Bull. EATCS, 1988

1987

Expected Computation Time for Hamiltonian Path Problem.

Yuri Gurevich, Saharon Shelah

SIAM J. Comput., 1987

Monotone versus positive.

Miklós Ajtai, Yuri Gurevich

J. ACM, 1987

Algenraic Operational Semantics.

Yuri Gurevich

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1987

Complete and Incomplete Randomized NP Problems

Yuri Gurevich

Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

Algebraic Operational Semantics and Modula-2.

Yuri Gurevich, James M. Morris

Proceedings of the CSL '87, 1987

Existential Fixed-Point Logic.

Andreas Blass, Yuri Gurevich

Proceedings of the Computation Theory and Logic, In Memory of Dieter Rödding, 1987

1986

What does O(n) mean.

Yuri Gurevich

SIGACT News, 1986

On the number of active nodes in a multicomputer system.

Amnon Barak, Zvi Drezner, Yuri Gurevich

Networks, 1986

Definability by Constant-Depth Polynomial-Size Circuits

Larry Denenberg, Yuri Gurevich, Saharon Shelah

Inf. Control., 1986

Fixed-point extensions of first-order logic.

Yuri Gurevich, Saharon Shelah

Ann. Pure Appl. Log., 1986

Henkin quantifiers and complete problems.

Andreas Blass, Yuri Gurevich

Ann. Pure Appl. Log., 1986

1985

The decision problem for linear temporal logic.

John P. Burgess, Yuri Gurevich

Notre Dame J. Formal Log., 1985

The Decision Problem for Branching Time Logic.

Yuri Gurevich, Saharon Shelah

J. Symb. Log., 1985

A Zero-One Law for Logic with a Fixed-Point Operator

Andreas Blass, Yuri Gurevich, Dexter Kozen

Inf. Control., 1985

1984

A Logic for Constant-Depth Circuits

Yuri Gurevich, Harry R. Lewis

Inf. Control., April, 1984

Equivalence Relations, Invariants, and Normal Forms.

Andreas Blass, Yuri Gurevich

SIAM J. Comput., 1984

The Word Problem for Cancellation Semigroups with Zero.

Yuri Gurevich, Harry R. Lewis

J. Symb. Log., 1984

A Decidable Subclass of the Minimal Godel Class with Identity.

Warren D. Goldfarb, Yuri Gurevich, Saharon Shelah

J. Symb. Log., 1984

Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems.

Yuri Gurevich, Larry J. Stockmeyer, Uzi Vishkin

J. ACM, 1984

1983

Random Models and the Godel Case of the Decision Problem.

Yuri Gurevich, Saharon Shelah

J. Symb. Log., 1983

Rabin's Uniformization Problem.

Yuri Gurevich, Saharon Shelah

J. Symb. Log., 1983

Interpreting Second-Order Logic in the Monadic Theory of Order.

Yuri Gurevich, Saharon Shelah

J. Symb. Log., 1983

The Monadic Theory of omega¹₂.

Yuri Gurevich, Menachem Magidor, Saharon Shelah

J. Symb. Log., 1983

Decision Problem for Separated Distributive Lattices.

Yuri Gurevich

J. Symb. Log., 1983

Algebras of Feasible Functions

Yuri Gurevich

Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

1982

The Inference Problem for Template Dependencies

Yuri Gurevich, Harry R. Lewis

Inf. Control., 1982

On the Unique Satisfiability Problem

Andreas Blass, Yuri Gurevich

Inf. Control., 1982

Monadic theory of order and topology in ZFC.

Yuri Gurevich, Saharon Shelah

Ann. Math. Log., 1982

Trees, Automata, and Games

Yuri Gurevich, Leo Harrington

Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982

Can Message Buffers be Characterized in Linear Temporal Logic?

A. Prasad Sistla, Edmund M. Clarke, Nissim Francez, Yuri Gurevich

Proceedings of the ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 1982

1980

Existential interpretation. II.

Yuri Gurevich

Arch. Math. Log., 1980

Prefix classes of krom formulae with identity.

Stål O. Aanderaa, Egon Börger, Yuri Gurevich

Arch. Math. Log., 1980

1979

Modest Theory of Short Chains. II.

Yuri Gurevich, Saharon Shelah

J. Symb. Log., 1979

Modest Theory of Short Chains. I.

Yuri Gurevich

J. Symb. Log., 1979

1977

Semi-conservative reduction.

Yuri Gurevich

Arch. Math. Log., 1977

1976

The Decision Problem for Standard Classes.

Yuri Gurevich

J. Symb. Log., 1976