Stop the war!Остановите войну!
for scientists:
Google
Google Scholar
Semantic Scholar
IA Scholar
CiteSeerX
ORCIDYuri Gurevich
Person information
- affiliation: Microsoft Research
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j140]Yuri Gurevich
, Andreas Blass:
Quantum circuits with classical channels and the principle of deferred measurements. Theor. Comput. Sci. 920: 21-32 (2022)- [i27]Andreas Blass, Yuri Gurevich, Alexander Volberg:
Wigner's quasidistribution and Dirac's kets. CoRR abs/2201.05911 (2022) - 2021
- [j139]Yuri Gurevich:
Logical foundations: Personal perspective. Bull. EATCS 133 (2021) - [i26]Yuri Gurevich:
Logical foundations: Personal perspective. CoRR abs/2103.03930 (2021) - [i25]Yuri Gurevich:
Reversify any sequential algorithm. CoRR abs/2105.05626 (2021) - [i24]Yuri Gurevich, Andreas Blass:
Quantum circuits with classical channels and the principle of deferred measurements. CoRR abs/2107.08324 (2021) - [i23]Yuri Gurevich, Andreas Blass:
Simple circuit simulations of classical and quantum Turing machines. CoRR abs/2111.10830 (2021) - 2020
- [j138]Yuri Gurevich:
Means-fit Effectivity. Bull. EATCS 130 (2020) - [j137]Andreas Blass, Yuri Gurevich:
Circuits: An abstract viewpoint. Bull. EATCS 131 (2020) - [j136]Andreas Blass, Yuri Gurevich:
Witness algebra and anyon braiding. Math. Struct. Comput. Sci. 30(3): 234-270 (2020) - [j135]Andreas Blass, Yuri Gurevich:
Braided distributivity. Theor. Comput. Sci. 807: 73-94 (2020) - [i22]Yuri Gurevich:
Means-fit effectivity. CoRR abs/2002.03145 (2020) - [i21]Andreas Blass, Yuri Gurevich:
Circuits: An abstract viewpoint. CoRR abs/2006.09488 (2020) - [i20]Andreas Blass, Yuri Gurevich:
Negative probabilities: What they are and what they are for. CoRR abs/2009.10552 (2020)
2010 – 2019
- 2019
- [j134]Yuri Gurevich:
Unconstrained Church-Turing thesis cannot possibly be true. Bull. EATCS 127 (2019) - [j133]Andreas Blass, Yuri Gurevich:
Circuit pedantry. Bull. EATCS 129 (2019) - [c75]Yuri Gurevich, Vladimir Vovk:
Test statistics and p-values. COPA 2019: 89-104 - [i19]Yuri Gurevich:
Unconstrained Church-Turing thesis cannot possibly be true. CoRR abs/1901.04911 (2019) - [i18]Andreas Blass, Yuri Gurevich:
Circuit pedantry. CoRR abs/1910.06145 (2019) - 2018
- [j132]Andreas Blass, Yuri Gurevich:
Who needs category theory? Bull. EATCS 124 (2018) - [j131]Andreas Blass, Yuri Gurevich:
Negative probabilities, II What they are and what they are for. Bull. EATCS 125 (2018) - [j130]Andreas Blass, Yuri Gurevich:
An Invitation to Quantum Computing. Bull. EATCS 126 (2018) - [i17]Andreas Blass, Yuri Gurevich:
Witness Algebra and Anyon Braiding. CoRR abs/1807.10414 (2018) - [i16]Andreas Blass, Yuri Gurevich:
Who needs category theory? CoRR abs/1807.11399 (2018) - [i15]Andreas Blass, Yuri Gurevich:
Coherence for braided distributivity. CoRR abs/1807.11403 (2018) - [i14]Yuri Gurevich:
Evolving Algebras 1993: Lipari Guide. CoRR abs/1808.06255 (2018) - 2017
- [j129]Andreas Blass, Yuri Gurevich:
On the Rectilinear Steiner Problem. Bull. EATCS 121 (2017) - [c74]Andreas Blass, Yuri Gurevich:
Common Denominator for Value and Expectation No-go Theorems: Extended Abstract. QPL 2017: 98-103 - 2016
- [j128]Yuri Gurevich, Jeannette M. Wing:
Inverse privacy. Commun. ACM 59(7): 38-42 (2016) - [j127]Luca Aceto, Mariangiola Dezani-Ciancaglini, Yuri Gurevich, David Harel, Monika Henzinger, Giuseppe F. Italiano, Scott A. Smolka, Paul G. Spirakis, Wolfgang Thomas:
EATCS Fellows' Advice to the Young Theoretical Computer Scientist. Bull. EATCS 119 (2016) - [j126]Yuri Gurevich, Vladimir Vovk:
Fundamentals of p-values: Introduction. Bull. EATCS 119 (2016) - [j125]Yuri Gurevich:
The 1966 International Congress of Mathematicians: A micro-memoir. Bull. EATCS 120 (2016) - [j124]Yuri Gurevich:
Past Present. Int. J. Found. Comput. Sci. 27(2): 103-108 (2016) - [j123]Carlos Cotrini, Yuri Gurevich:
Basic primal infon logic. J. Log. Comput. 26(1): 117-141 (2016) - [p19]Andreas Blass, Yuri Gurevich:
On Quantum Computation, Anyons, and Categories. Martin Davis on Computability, Computational Logic, and Mathematical Foundations 2016: 209-241 - 2015
- [c73]Yuri Gurevich:
Impugning alleged randomness. NAFIPS/WConSC 2015: 1 - [i13]Yuri Gurevich, Efim Hudis, Jeannette M. Wing:
Inverse Privacy. CoRR abs/1510.03311 (2015) - 2014
- [j122]Lev D. Beklemishev, Yuri Gurevich:
Propositional primal logic with disjunction. J. Log. Comput. 24(1): 257-282 (2014) - [c72]Carlos Cotrini, Yuri Gurevich, Ori Lahav, Artem Melentyev:
Primal Infon Logic with Conjunctions as Sets. IFIP TCS 2014: 236-249 - 2013
- [j121]Andreas Blass, Yuri Gurevich:
Abstract Hilbertian deductive systems, infon logic, and Datalog. Inf. Comput. 231: 21-37 (2013) - [j120]Carlos Cotrini, Yuri Gurevich:
Transitive Primal Infon Logic. Rev. Symb. Log. 6(2): 281-304 (2013) - [j119]Carlos Cotrini, Yuri Gurevich:
Transitive Primal Infon Logic-ERRATUM. Rev. Symb. Log. 6(2): 366 (2013) - [c71]Jean-Baptiste Jeannin, Guido de Caso, Juan Chen, Yuri Gurevich, Prasad Naldurg, Nikhil Swamy:
dkal ⋆ : Constructing Executable Specifications of Authorization Protocols. ESSoS 2013: 139-154 - [c70]Rui Wang, Yuchen Zhou, Shuo Chen, Shaz Qadeer, David Evans, Yuri Gurevich:
Explicating SDKs: Uncovering Assumptions Underlying Secure Authentication and Authorization. USENIX Security Symposium 2013: 399-314 - 2012
- [j118]Yuri Gurevich, Grant Olney Passmore:
Impugning Randomness, Convincingly. Stud Logica 100(1-2): 193-222 (2012) - [c69]Nikolaj S. Bjørner, Guido de Caso, Yuri Gurevich:
From Primal Infon Logic with Individual Variables to Datalog. Correct Reasoning 2012: 72-86 - [c68]Yuri Gurevich:
Foundational Analyses of Computation. CiE 2012: 264-275 - [c67]Yuri Gurevich:
Datalog: A Perspective and the Potential. Datalog 2012: 9-20 - [c66]Yuri Gurevich:
What Is an Algorithm? SOFSEM 2012: 31-42 - 2011
- [j117]Yuri Gurevich, Grant Olney Passmore:
Impugning Randomness, Convincingly. Bull. EATCS 104: 112-137 (2011) - [j116]Yuri Gurevich, Itay Neeman:
Logic of infons: The propositional case. ACM Trans. Comput. Log. 12(2): 9:1-9:28 (2011) - [j115]Andreas Blass, Yuri Gurevich:
Persistent queries in the behavioral theory of algorithms. ACM Trans. Comput. Log. 12(2): 16:1-16:43 (2011) - [c65]Yuri Gurevich:
Impugning Randomness, Convincingly. FCT 2011: 38 - [p18]Andreas Blass, Yuri Gurevich:
Zero-One Laws: Thesauri and Parametric Conditions. Proof, Computation and Agency 2011: 99-114 - 2010
- [j114]Andreas Blass, Yuri Gurevich, Efim Hudis:
The Tower-of-Babel Problem, and Security Assesment Sharing. Bull. EATCS 101: 161-182 (2010) - [j113]Andreas Blass, Yuri Gurevich:
Hilbertian Deductive Systems, Infon Logic, and Datalog. Bull. EATCS 102: 122-150 (2010) - [j112]Bernd Finkbeiner, Yuri Gurevich, Alexander K. Petrenko:
Preface. Electron. Notes Theor. Comput. Sci. 264(3): 1 (2010) - [j111]Nikolaj S. Bjørner, Andreas Blass, Yuri Gurevich:
Content-dependent chunking for differential compression, the local maximum approach. J. Comput. Syst. Sci. 76(3-4): 154-203 (2010) - [c64]Andreas Blass, Yuri Gurevich, Michal Moskal, Itay Neeman:
Evidential Authorization. The Future of Software Engineering 2010: 73-99 - [c63]Andreas Blass, Nachum Dershowitz, Yuri Gurevich:
Exact Exploration and Hanging Algorithms. CSL 2010: 140-154
2000 – 2009
- 2009
- [j110]Andreas Blass, Nachum Dershowitz, Yuri Gurevich:
When are two algorithms the same? Bull. Symb. Log. 15(2): 145-168 (2009) - [j109]Yuri Gurevich, Itay Neeman:
Teh Logic of Infons. Bull. EATCS 98: 150-178 (2009) - [j108]Bernd Finkbeiner, Yuri Gurevich, Alexander K. Petrenko:
Preface. Electron. Notes Theor. Comput. Sci. 253(2): 1 (2009) - [j107]Margus Veanes, Nikolaj S. Bjørner, Yuri Gurevich, Wolfram Schulte:
Symbolic Bounded Model Checking of Abstract State Machines. Int. J. Softw. Informatics 3(2-3): 149-170 (2009) - [j106]Robert H. Gilman, Yuri Gurevich, Alexei D. Miasnikov:
A geometric zero-one law. J. Symb. Log. 74(3): 929-938 (2009) - [j105]Martin Grohe, Yuri Gurevich, Dirk Leinders, Nicole Schweikardt, Jerzy Tyszkiewicz, Jan Van den Bussche:
Database Query Processing Using Finite Cursor Machines. Theory Comput. Syst. 44(4): 533-560 (2009) - [c62]Yuri Gurevich, Arnab Roy:
Operational Semantics for DKAL: Application and Analysis. TrustBus 2009: 149-158 - 2008
- [j104]Nachum Dershowitz, Yuri Gurevich:
A Natural Axiomatization of Computability and Proof of Church's Thesis. Bull. Symb. Log. 14(3): 299-350 (2008) - [j103]Andreas Blass, Yuri Gurevich:
Two Forms of One Useful Logic: Existential Fixed Point Logic and Liberal Datalog. Bull. EATCS 95: 164-182 (2008) - [j102]Bernd Finkbeiner, Yuri Gurevich, Alexander K. Petrenko:
Preface. Electron. Notes Theor. Comput. Sci. 220(1): 1 (2008) - [j101]Andreas Blass, Yuri Gurevich:
Program termination and well partial orderings. ACM Trans. Comput. Log. 9(3): 18:1-18:26 (2008) - [j100]Andreas Blass, Yuri Gurevich:
Abstract state machines capture parallel algorithms: Correction and extension. ACM Trans. Comput. Log. 9(3): 19:1-19:32 (2008) - [c61]Andreas Blass, Yuri Gurevich:
Why Sets? Pillars of Computer Science 2008: 179-198 - [c60]Yuri Gurevich, Itay Neeman:
DKAL: Distributed-Knowledge Authorization Language. CSF 2008: 149-162 - [c59]Andreas Blass, Yuri Gurevich:
One Useful Logic That Defines Its Own Truth. MFCS 2008: 1-15 - [i12]Andreas Blass, Nachum Dershowitz, Yuri Gurevich:
When are two algorithms the same? CoRR abs/0811.0811 (2008) - [i11]Andreas Blass, Yuri Gurevich:
Persistent Queries. CoRR abs/0811.0819 (2008) - [i10]Andreas Blass, Yuri Gurevich:
One useful logic that defines its own truth. CoRR abs/0811.0964 (2008) - [i9]Andreas Blass, Yuri Gurevich:
Two Forms of One Useful Logic: Existential Fixed Point Logic and Liberal Datalog. CoRR abs/0811.0977 (2008) - [i8]Nikolaj S. Bjørner, Andreas Blass, Yuri Gurevich, Madan Musuvathi:
Modular difference logic is hard. CoRR abs/0811.0987 (2008) - 2007
- [j99]Andreas Blass, Yuri Gurevich:
Zero-One Laws: Thesauri and Parametric Conditions. Bull. EATCS 91: 125-144 (2007) - [j98]Andreas Blass, Yuri Gurevich:
Background of Computation. Bull. EATCS 92: 82-114 (2007) - [j97]Bernd Finkbeiner, Yuri Gurevich, Alexander K. Petrenko:
Preface. Electron. Notes Theor. Comput. Sci. 190(2): 1 (2007) - [j96]Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman:
Interactive Small-Step Algorithms I: Axiomatization. Log. Methods Comput. Sci. 3(4) (2007) - [j95]Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman:
Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem. Log. Methods Comput. Sci. 3(4) (2007) - [j94]Yuri Gurevich, Paul E. Schupp:
Membership Problem for the Modular Group. SIAM J. Comput. 37(2): 425-459 (2007) - [j93]Yuri Gurevich, Margus Veanes, Charles Wallace:
Can abstract state machines be useful in language theory? Theor. Comput. Sci. 376(1-2): 17-29 (2007) - [j92]Andreas Blass, Yuri Gurevich:
Ordinary interactive small-step algorithms, II. ACM Trans. Comput. Log. 8(3): 15 (2007) - [j91]Andreas Blass, Yuri Gurevich:
Ordinary interactive small-step algorithms, III. ACM Trans. Comput. Log. 8(3): 16 (2007) - [c58]Yuri Gurevich:
Proving Church's Thesis. CSR 2007: 1-3 - [c57]Yuri Gurevich, Dirk Leinders, Jan Van den Bussche:
A Theory of Stream Queries. DBPL 2007: 153-168 - [c56]Martin Grohe, Yuri Gurevich, Dirk Leinders, Nicole Schweikardt, Jerzy Tyszkiewicz, Jan Van den Bussche:
Database Query Processing Using Finite Cursor Machines. ICDT 2007: 284-298 - [e3]Yuri Gurevich, Bertrand Meyer:
Tests and Proofs - 1st International Conference, TAP 2007, Zurich, Switzerland, February 12-13, 2007. Revised Papers. Lecture Notes in Computer Science 4454, Springer 2007, ISBN 978-3-540-73769-8 [contents] - [i7]Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman:
Interactive Small-Step Algorithms I: Axiomatization. CoRR abs/0707.3782 (2007) - [i6]Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman:
Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem. CoRR abs/0707.3789 (2007) - 2006
- [j90]Howard Barringer, Bernd Finkbeiner, Yuri Gurevich, Henny B. Sipma:
Preface. Electron. Notes Theor. Comput. Sci. 144(4): 1 (2006) - [j89]Bernd Finkbeiner, Yuri Gurevich, Alexander K. Petrenko:
Preface. Electron. Notes Theor. Comput. Sci. 164(4): 1 (2006) - [j88]Andreas Blass, Yuri Gurevich:
Ordinary interactive small-step algorithms, I. ACM Trans. Comput. Log. 7(2): 363-419 (2006) - [c55]Yuri Gurevich, Charles Wallace:
Can Abstract State Machines Be Useful in Language Theory?. Developments in Language Theory 2006: 14-19 - 2005
- [j87]Yuri Gurevich, Alexander K. Petrenko, Alexander S. Kossatchev:
Preface. Electron. Notes Theor. Comput. Sci. 111: 1-3 (2005) - [j86]Yuri Gurevich, Nikolai Tillmann:
Partial updates. Theor. Comput. Sci. 336(2-3): 311-342 (2005) - [j85]Yuri Gurevich, Benjamin Rossman, Wolfram Schulte:
Semantic essence of AsmL. Theor. Comput. Sci. 343(3): 370-412 (2005) - [c54]Yuri Gurevich:
Behavioral Computation Theory 2005. Abstract State Machines 2005: 72 - [c53]Andreas Blass, Yuri Gurevich, Lev Nachmanson, Margus Veanes:
Play to Test. FATES 2005: 32-46 - [c52]Yuri Gurevich:
Interactive Algorithms 2005. MFCS 2005: 26-38 - 2004
- [j84]Andreas Blass, Yuri Gurevich:
Why Sets? (Column: Logic in Computer Science). Bull. EATCS 84: 139-156 (2004) - [j83]Uwe Glässer, Yuri Gurevich, Margus Veanes:
Abstract Communication Model for Distributed Systems. IEEE Trans. Software Eng. 30(7): 458-472 (2004) - [c51]Yuri Gurevich:
Intra-step Interaction. Abstract State Machines 2004: 1-5 - [c50]Yuri Gurevich, Rostislav Yavorskiy:
Observations on the Decidability of Transitions. Abstract State Machines 2004: 161-168 - [c49]Yuri Gurevich:
Abstract State Machines: An Overview of the Project. FoIKS 2004: 6-13 - 2003
- [j82]Andreas Blass, Yuri Gurevich:
Algorithms: A Quest for Absolute Definitions. Bull. EATCS 81: 195-225 (2003) - [j81]Andreas Blass, Yuri Gurevich:
Strong extension axioms and Shelah's zero-one law for choiceless polynomial time. J. Symb. Log. 68(1): 65-131 (2003) - [j80]Andreas Blass, Yuri Gurevich:
Abstract state machines capture parallel algorithms. ACM Trans. Comput. Log. 4(4): 578-651 (2003) - [c48]Yuri Gurevich, Nikolai Tillmann:
Partial Updates Exploration II. Abstract State Machines 2003: 57-86 - [c47]Yuri Gurevich, Benjamin Rossman, Wolfram Schulte:
Semantic Essence of AsmL. FMCO 2003: 240-259 - [c46]Yuri Gurevich, Saharon Shelah:
Spectra of Monadic Second-Order Formulas with One Unary Function. LICS 2003: 291-300 - 2002
- [j79]Anuj Dawar, Yuri Gurevich:
Fixed point logics. Bull. Symb. Log. 8(1): 65-88 (2002) - [j78]Andreas Blass, Yuri Gurevich:
Algorithms vs. Machines. Bull. EATCS 77: 96-119 (2002) - [j77]Andreas Blass, Yuri Gurevich:
Pairwise Testing. Bull. EATCS 78: 100-132 (2002) - [j76]Andreas Blass, Yuri Gurevich, Jan Van den Bussche:
Abstract State Machines and Computationally Complete Query Languages. Inf. Comput. 174(1): 20-36 (2002) - [j75]Andreas Blass, Yuri Gurevich, Saharon Shelah:
On Polynomial Time Computation over Unordered Structures. J. Symb. Log. 67(3): 1093-1125 (2002) - [j74]Yuri Gurevich, Alexander Moshe Rabinovich:
Definability in Rationals with Real Order in the Background. J. Log. Comput. 12(1): 1-11 (2002) - [c45]Uwe Glässer, Yuri Gurevich, Margus Veanes:
High-Level Executable Specification of the Universal Plug and Play Architecture. HICSS 2002: 283 - [c44]Wolfgang Grieskamp, Yuri Gurevich, Wolfram Schulte, Margus Veanes:
Generating finite state machines from abstract state machines. ISSTA 2002: 112-122 - 2001
- [j73]Andreas Blass, Yuri Gurevich, Saharon Shelah:
Addendum to "Choiceless Polynomial Time": Ann. Pure Appl. Logic 100 (1999) 141-187. Ann. Pure Appl. Log. 112(1): 117 (2001) - [j72]Yuri Gurevich, Nikolai Tillmann:
Partial Updates: Exploration. J. Univers. Comput. Sci. 7(11): 917-951 (2001) - [j71]Andreas Blass, Yuri Gurevich:
Inadequacy of computable loop invariants. ACM Trans. Comput. Log. 2(1): 1-11 (2001) - [c43]Yuri Gurevich:
The Abstract State Machine Paradigm: What Is in and What Is out. Ershov Memorial Conference 2001: 24 - [c42]Yuri Gurevich:
Logician in the Land of OS: Abstract State Machines in Microsoft. LICS 2001: 129-136 - [p17]Yuri Gurevich:
AMAST'91 Banquet Talk. Current Trends in Theoretical Computer Science 2001: 247-253