default search action
Google
Google Scholar
Semantic Scholar
Internet Archive 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
- 2024
[i34]Yuri Gurevich, Andreas Blass:
What are kets? CoRR abs/2405.10055 (2024)- [i33]Yuri Gurevich, Andreas Blass:
On logic and generative AI. CoRR abs/2409.14465 (2024) - [i32]Yuri Gurevich:
On a measure of intelligence. CoRR abs/2409.14496 (2024) - 2023
- [j142]Yuri Gurevich:
Obituary: Yuri Manin. Bull. EATCS 139 (2023) - [j141]Yuri Gurevich:
The umbilical cord of finite model theory. Bull. EATCS 139 (2023) - [j140]Yuri Gurevich:
Obituary: Gregory Tseytin. Bull. EATCS 141 (2023) - [j139]Yuri Gurevich, Andreas Blass:
What are kets? Bull. EATCS 141 (2023) - [j138]Yuri Gurevich
, Andreas Blass:
Software science view on quantum circuit algorithms. Inf. Comput. 292: 105024 (2023) - [j137]Yuri Gurevich:
Logical foundations: Personal perspective. Log. J. IGPL 31(6): 1192-1202 (2023) - [i31]Yuri Gurevich:
The umbilical cord of finite model theory. CoRR abs/2301.09145 (2023) - [i30]Yuri Gurevich, Andreas Blass:
Primal logic of information. CoRR abs/2307.06454 (2023) - 2022
- [j136]Andreas Blass, Yuri Gurevich, Alexander Volberg:
Wigner's quasidistribution and Dirac's kets. Bull. EATCS 136 (2022) - [j135]Yuri Gurevich:
The 1966 International Congress of Mathematicians: A Micro-memoir. Fundam. Informaticae 186(1-4): 133-141 (2022) - [j134]Yuri Gurevich, Andreas Blass:
Quantum circuits with classical channels and the principle of deferred measurements. Theor. Comput. Sci. 920: 21-32 (2022) - [i29]Andreas Blass, Yuri Gurevich, Alexander Volberg:
Wigner's quasidistribution and Dirac's kets. CoRR abs/2201.05911 (2022) - [i28]Yuri Gurevich, Tatiana Yavorskaya:
A more abstract bounded exploration postulate. CoRR abs/2206.01032 (2022) - [i27]Yuri Gurevich, Andreas Blass:
Software science view on quantum circuit algorithms. CoRR abs/2209.13731 (2022) - 2021
- [j133]Yuri Gurevich:
Logical foundations: Personal perspective. Bull. EATCS 133 (2021) - [j132]Yuri Gurevich:
Reversify any sequential algorithm. Bull. EATCS 134 (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
- [j131]Yuri Gurevich:
Means-fit Effectivity. Bull. EATCS 130 (2020) - [j130]Andreas Blass, Yuri Gurevich:
Circuits: An abstract viewpoint. Bull. EATCS 131 (2020) - [j129]Andreas Blass, Yuri Gurevich:
Witness algebra and anyon braiding. Math. Struct. Comput. Sci. 30(3): 234-270 (2020) - [j128]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
- [j127]Yuri Gurevich:
Unconstrained Church-Turing thesis cannot possibly be true. Bull. EATCS 127 (2019) - [j126]Andreas Blass, Yuri Gurevich:
Circuit pedantry. Bull. EATCS 129 (2019) - [c82]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
- [j125]Andreas Blass, Yuri Gurevich:
Who needs category theory? Bull. EATCS 124 (2018) - [j124]Andreas Blass, Yuri Gurevich:
Negative probabilities, II What they are and what they are for. Bull. EATCS 125 (2018) - [j123]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
- [j122]Andreas Blass, Yuri Gurevich:
On the Rectilinear Steiner Problem. Bull. EATCS 121 (2017) - [c81]Andreas Blass, Yuri Gurevich:
Common Denominator for Value and Expectation No-go Theorems: Extended Abstract. QPL 2017: 98-103 - 2016
- [j121]Yuri Gurevich, Jeannette M. Wing:
Inverse privacy. Commun. ACM 59(7): 38-42 (2016) - [j120]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) - [j119]Yuri Gurevich, Vladimir Vovk:
Fundamentals of p-values: Introduction. Bull. EATCS 119 (2016) - [j118]Yuri Gurevich:
The 1966 International Congress of Mathematicians: A micro-memoir. Bull. EATCS 120 (2016) - [j117]Yuri Gurevich:
Past Present. Int. J. Found. Comput. Sci. 27(2): 103-108 (2016) - [j116]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
- [c80]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
- [j115]Lev D. Beklemishev, Yuri Gurevich:
Propositional primal logic with disjunction. J. Log. Comput. 24(1): 257-282 (2014) - [c79]Carlos Cotrini, Yuri Gurevich, Ori Lahav, Artem Melentyev:
Primal Infon Logic with Conjunctions as Sets. IFIP TCS 2014: 236-249 - 2013
- [j114]Andreas Blass, Yuri Gurevich:
Abstract Hilbertian deductive systems, infon logic, and Datalog. Inf. Comput. 231: 21-37 (2013) - [j113]Carlos Cotrini, Yuri Gurevich:
Transitive Primal Infon Logic. Rev. Symb. Log. 6(2): 281-304 (2013) - [j112]Carlos Cotrini, Yuri Gurevich:
Transitive Primal Infon Logic-ERRATUM. Rev. Symb. Log. 6(2): 366 (2013) - [c78]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 - [c77]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
- [j111]Yuri Gurevich, Grant Olney Passmore:
Impugning Randomness, Convincingly. Stud Logica 100(1-2): 193-222 (2012) - [c76]Nikolaj S. Bjørner, Guido de Caso, Yuri Gurevich:
From Primal Infon Logic with Individual Variables to Datalog. Correct Reasoning 2012: 72-86 - [c75]Yuri Gurevich:
Foundational Analyses of Computation. CiE 2012: 264-275 - [c74]Yuri Gurevich:
Datalog: A Perspective and the Potential. Datalog 2012: 9-20 - [c73]Yuri Gurevich:
What Is an Algorithm? SOFSEM 2012: 31-42 - 2011
- [j110]Yuri Gurevich, Grant Olney Passmore:
Impugning Randomness, Convincingly. Bull. EATCS 104: 112-137 (2011) - [j109]Yuri Gurevich, Itay Neeman:
Logic of infons: The propositional case. ACM Trans. Comput. Log. 12(2): 9:1-9:28 (2011) - [j108]Andreas Blass, Yuri Gurevich:
Persistent queries in the behavioral theory of algorithms. ACM Trans. Comput. Log. 12(2): 16:1-16:43 (2011) - [c72]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
- [j107]Andreas Blass, Yuri Gurevich, Efim Hudis:
The Tower-of-Babel Problem, and Security Assesment Sharing. Bull. EATCS 101: 161-182 (2010) - [j106]Andreas Blass, Yuri Gurevich:
Hilbertian Deductive Systems, Infon Logic, and Datalog. Bull. EATCS 102: 122-150 (2010) - [j105]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) - [c71]Andreas Blass, Yuri Gurevich, Michal Moskal, Itay Neeman:
Evidential Authorization. The Future of Software Engineering 2010: 73-99 - [c70]Andreas Blass, Nachum Dershowitz, Yuri Gurevich:
Exact Exploration and Hanging Algorithms. CSL 2010: 140-154 - [c69]Bernd Finkbeiner, Yuri Gurevich, Alexander K. Petrenko:
Preface. MBT@ETAPS 2010: 1 - [e10]Bernd Finkbeiner, Yuri Gurevich, Alexander K. Petrenko:
Proceedings of the Sixth Workshop on Model-Based Testing, MBT@ETAPS 2010, Paphos, Cyprus, March 21, 2010. Electronic Notes in Theoretical Computer Science 264(3), Elsevier 2010 [contents]
2000 – 2009
- 2009
- [j104]Andreas Blass, Nachum Dershowitz, Yuri Gurevich:
When are two algorithms the same? Bull. Symb. Log. 15(2): 145-168 (2009) - [j103]Yuri Gurevich, Itay Neeman:
Teh Logic of Infons. Bull. EATCS 98: 150-178 (2009) - [j102]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) - [j101]Robert H. Gilman, Yuri Gurevich, Alexei D. Miasnikov:
A geometric zero-one law. J. Symb. Log. 74(3): 929-938 (2009) - [j100]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) - [c68]Yuri Gurevich, Arnab Roy:
Operational Semantics for DKAL: Application and Analysis. TrustBus 2009: 149-158 - [c67]Bernd Finkbeiner, Yuri Gurevich, Alexander K. Petrenko:
Preface. MBT@ETAPS 2009: 1 - [e9]Bernd Finkbeiner, Yuri Gurevich, Alexander K. Petrenko:
Proceedings of Fifth Workshop on Model Based Testing, MBT@ETAPS 2009, York, UK, March 22, 2009. Electronic Notes in Theoretical Computer Science 253(2), Elsevier 2009 [contents] - 2008
- [j99]Nachum Dershowitz, Yuri Gurevich:
A Natural Axiomatization of Computability and Proof of Church's Thesis. Bull. Symb. Log. 14(3): 299-350 (2008) - [j98]Andreas Blass, Yuri Gurevich:
Two Forms of One Useful Logic: Existential Fixed Point Logic and Liberal Datalog. Bull. EATCS 95: 164-182 (2008) - [j97]Andreas Blass, Yuri Gurevich:
Program termination and well partial orderings. ACM Trans. Comput. Log. 9(3): 18:1-18:26 (2008) - [j96]Andreas Blass, Yuri Gurevich:
Abstract state machines capture parallel algorithms: Correction and extension. ACM Trans. Comput. Log. 9(3): 19:1-19:32 (2008) - [c66]Andreas Blass, Yuri Gurevich:
Why Sets? Pillars of Computer Science 2008: 179-198 - [c65]Yuri Gurevich, Itay Neeman:
DKAL: Distributed-Knowledge Authorization Language. CSF 2008: 149-162 - [c64]Andreas Blass, Yuri Gurevich:
One Useful Logic That Defines Its Own Truth. MFCS 2008: 1-15 - [c63]Bernd Finkbeiner, Yuri Gurevich, Alexander K. Petrenko:
Preface. MBT@ETAPS 2008: 1 - [e8]Bernd Finkbeiner, Yuri Gurevich, Alexander K. Petrenko:
Proceedings of the Fourth Workshop on Model Based Testing, MBT@ETAPS 2008, Budapest, Hungary, March 30, 2008. Electronic Notes in Theoretical Computer Science 220(1), Elsevier 2008 [contents] - [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
- [j95]Andreas Blass, Yuri Gurevich:
Zero-One Laws: Thesauri and Parametric Conditions. Bull. EATCS 91: 125-144 (2007) - [j94]Andreas Blass, Yuri Gurevich:
Background of Computation. Bull. EATCS 92: 82-114 (2007) - [j93]Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman:
Interactive Small-Step Algorithms I: Axiomatization. Log. Methods Comput. Sci. 3(4) (2007) - [j92]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) - [j91]Yuri Gurevich, Paul E. Schupp:
Membership Problem for the Modular Group. SIAM J. Comput. 37(2): 425-459 (2007) - [j90]Yuri Gurevich, Margus Veanes, Charles Wallace:
Can abstract state machines be useful in language theory? Theor. Comput. Sci. 376(1-2): 17-29 (2007) - [j89]Andreas Blass, Yuri Gurevich:
Ordinary interactive small-step algorithms, II. ACM Trans. Comput. Log. 8(3): 15 (2007) - [j88]Andreas Blass, Yuri Gurevich:
Ordinary interactive small-step algorithms, III. ACM Trans. Comput. Log. 8(3): 16 (2007) - [c62]Yuri Gurevich:
Proving Church's Thesis. CSR 2007: 1-3 - [c61]Yuri Gurevich, Dirk Leinders, Jan Van den Bussche:
A Theory of Stream Queries. DBPL 2007: 153-168 - [c60]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 - [c59]Bernd Finkbeiner, Yuri Gurevich, Alexander K. Petrenko:
Preface. MBT 2007: 1 - [e7]Bernd Finkbeiner, Yuri Gurevich, Alexander K. Petrenko:
Proceedings of the Third Workshop on Model Based Testing, MBT 2007, Braga, Portugal, March 31 - April 1, 2007. Electronic Notes in Theoretical Computer Science 190(2), Elsevier 2007 [contents] - [e6]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
- [j87]Andreas Blass, Yuri Gurevich:
Ordinary interactive small-step algorithms, I. ACM Trans. Comput. Log. 7(2): 363-419 (2006) - [c58]Yuri Gurevich, Charles Wallace:
Can Abstract State Machines Be Useful in Language Theory?. Developments in Language Theory 2006: 14-19 - [c57]Bernd Finkbeiner, Yuri Gurevich, Alexander K. Petrenko:
Preface. MBT 2006: 1 - [e5]Bernd Finkbeiner, Yuri Gurevich, Alexander K. Petrenko:
Proceedings of the Second Workshop on Model Based Testing, MBT 2006, Vienna, Austria, March 25-26, 2006. Electronic Notes in Theoretical Computer Science 164(4), Elsevier 2006 [contents] - [e4]Howard Barringer, Bernd Finkbeiner, Yuri Gurevich, Henny Sipma:
Proceedings of the Fifth Workshop on Runtime Verification, RV@CAV 2005, Edinburgh, UK, July 12, 2005. Electronic Notes in Theoretical Computer Science 144(4), Elsevier 2006 [contents] - 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) - [c56]Yuri Gurevich:
Behavioral Computation Theory 2005. Abstract State Machines 2005: 72 - [c55]Andreas Blass, Yuri Gurevich, Lev Nachmanson, Margus Veanes:
Play to Test. FATES 2005: 32-46 - [c54]Yuri Gurevich:
Interactive Algorithms 2005. MFCS 2005: 26-38 - [c53]Howard Barringer, Bernd Finkbeiner, Yuri Gurevich, Henny B. Sipma:
Preface. RV@CAV 2005: 1 - [e3]Yuri Gurevich, Alexander K. Petrenko:
Proceedings of the Workshop on Model Based Testing, MBT 2004, Barcelona, Spain, March 27-28, 2004. Electronic Notes in Theoretical Computer Science 111, Elsevier 2005 [contents] - 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) - [c52]Yuri Gurevich:
Intra-step Interaction. Abstract State Machines 2004: 1-5 - [c51]Yuri Gurevich, Rostislav Yavorskiy:
Observations on the Decidability of Transitions. Abstract State Machines 2004: 161-168 - [c50]Yuri Gurevich:
Abstract State Machines: An Overview of the Project. FoIKS 2004: 6-13 - [c49]Yuri Gurevich, Alexander K. Petrenko, Alexander S. Kossatchev:
Preface. MBT 2004: 1-3 - 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 - [p16]Yuri Gurevich:
The Value, if Any, of Decidability. Current Trends in Theoretical Computer Science 2001: 274-280 - [p15]Yuri Gurevich:
Platonism, Constructivism, and Computer Proofs vs. Proofs by Hand. Current Trends in Theoretical Computer Science 2001: 281-302 - [p14]Anatoli Degtyarev, Yuri Gurevich, Andrei Voronkov:
Herbrand's Theorem and Equational Reasoning: Problems and Solutions. Current Trends in Theoretical Computer Science 2001: 303-326 - [p13]Yuri Gurevich:
From Invariants to Canonization. Current Trends in Theoretical Computer Science 2001: 327-331 - [p12]Yuri Gurevich:
The Sequential ASM Thesis. Current Trends in Theoretical Computer Science 2001: 363-392 - [p11]Andreas Blass, Yuri Gurevich:
The Underlying Logic of Hoare Logic. Current Trends in Theoretical Computer Science 2001: 409-436 - 2000
- [j70]Andreas Blass, Yuri Gurevich:
The Underlying Logic of Hoare Logic. Bull. EATCS 70: 82-111 (2000) - [j69]Andreas Blass, Yuri Gurevich:
A New Zero-One Law and Strong Extension Axioms. Bull. EATCS 72: 103-122 (2000) - [j68]Thomas Eiter, Yuri Gurevich, Georg Gottlob:
Existential second-order logic over strings. J. ACM 47(1): 77-131 (2000) - [j67]Yuri Gurevich, Alexander Moshe Rabinovich:
Definability and Undefinability with Real Order at The Background. J. Symb. Log. 65(2): 946-958 (2000) - [j66]Andreas Blass, Yuri Gurevich:
The Logic of Choice. J. Symb. Log. 65(3): 1264-1310 (2000) - [j65]Anatoli Degtyarev, Yuri Gurevich, Paliath Narendran, Margus Veanes, Andrei Voronkov:
Decidability and complexity of simultaneous rigid E-unification with one variable and related results. Theor. Comput. Sci. 243(1-2): 167-184 (2000) - [j64]Yuri Gurevich:
Sequential abstract-state machines capture sequential algorithms. ACM Trans. Comput. Log. 1(1): 77-111 (2000) - [c41]Yuri Gurevich:
Invited Talk: ASM Formalware in the Software Engineering Cycle. AMAST 2000: 197 - [c40]Andreas Blass, Yuri Gurevich, Jan Van den Bussche:
Abstract State Machines and Computationally Complete Query Languages. Abstract State Machines 2000: 22-33 - [c39]Yuri Gurevich, Dean Rosenzweig:
Partially Ordered Runs: A Case Study. Abstract State Machines 2000: 131-150 - [c38]Yuri Gurevich, Wolfram Schulte, Charles Wallace:
Investigating Java Concurrency Using Abstract State Machines. Abstract State Machines 2000: 151-176 - [c37]Michael Barnett, Egon Börger, Yuri Gurevich, Wolfram Schulte, Margus Veanes:
Using Abstract State Machines at Microsoft: A Case Study. Abstract State Machines 2000: 367-379 - [c36]Andreas Blass, Yuri Gurevich:
Background, Reserve, and Gandy Machines. CSL 2000: 1-17 - [c35]Andreas Blass, Yuri Gurevich:
Choiceless Polynominal Time Computation and the Zero-One Law. CSL 2000: 18-40 - [e2]Yuri Gurevich, Philipp W. Kutter, Martin Odersky, Lothar Thiele:
Abstract State Machines, Theory and Applications, International Workshop, ASM 2000, Monte Verità, Switzerland, March 19-24, 2000, Proceedings. Lecture Notes in Computer Science 1912, Springer 2000, ISBN 3-540-67959-6 [contents]
1990 – 1999
- 1999
- [j63]Andreas Blass, Yuri Gurevich, Saharon Shelah:
Choiceless Polynomial Time. Ann. Pure Appl. Log. 100(1-3): 141-187 (1999) - [j62]Yuri Gurevich:
The Sequential ASM Thesis. Bull. EATCS 67: 93 (1999) - [j61]Yuri Gurevich, Margus Veanes:
Logic with Equality: Partisan Corroboration and Shifted Pairing. Inf. Comput. 152(2): 205-235 (1999) - [j60]Yuri Gurevich, Andrei Voronkov:
Monadic Simultaneous Rigid E-unification. Theor. Comput. Sci. 222(1-2): 133-152 (1999) - 1998
- [j59]Erich Grädel, Yuri Gurevich:
Metafinite Model Theory. Inf. Comput. 140(1): 26-81 (1998) - [j58]Andreas Blass, Yuri Gurevich, Vladik Kreinovich, Luc Longpré:
A Variation on the Zero-One Law. Inf. Process. Lett. 67(1): 29-30 (1998) - [c34]Thomas Eiter, Georg Gottlob, Yuri Gurevich:
Existential Second-Order Logic over Strings. LICS 1998: 16-27 - [c33]Erich Grädel, Yuri Gurevich, Colin Hirsch:
The Complexity of Query Reliability. PODS 1998: 227-234 - [c32]Anatoli Degtyarev, Yuri Gurevich, Paliath Narendran, Margus Veanes, Andrei Voronkov:
The Decidability of Simultaneous Rigid E-Unification with One Variable. RTA 1998: 181-195 - [i5]Yuri Gurevich, James K. Huggins:
Equivalence is in the Eye of the Beholder. CoRR cs.SE/9810023 (1998) - [i4]Yuri Gurevich, James K. Huggins:
Evolving Algebras and Partial Evaluation. CoRR cs.SE/9810024 (1998) - [i3]Yuri Gurevich, James K. Huggins:
The Railroad Crossing Problem: An Experiment with Instantaneous Actions and Immediate Reactions. CoRR cs.SE/9810026 (1998) - 1997
- [b1]Egon Börger, Erich Grädel, Yuri Gurevich:
The Classical Decision Problem. Perspectives in Mathematical Logic, Springer 1997 - [j57]Yuri Gurevich:
From Invariants to Canonization. Bull. EATCS 63 (1997) - [j56]Yuri Gurevich, Marc Spielmann:
Recursive Abstract State Machines. J. Univers. Comput. Sci. 3(4): 233-246 (1997) - [j55]Andreas Blass, Yuri Gurevich:
The Linear Time Hierarchy Theorems for Abstract State Machines and RAMs. J. Univers. Comput. Sci. 3(4): 247-278 (1997) - [j54]Scott D. Dexter, Patrick Doyle, Yuri Gurevich:
Gurevich Abstract State Machines and Schoenhage Storage Modification Machines. J. Univers. Comput. Sci. 3(4): 279-303 (1997) - [j53]Yuri Gurevich, Nandit Soparkar, Charles Wallace:
Formalizing Database Recovery. J. Univers. Comput. Sci. 3(4): 320-340 (1997) - [j52]Yuri Gurevich, James K. Huggins:
Equivalence is in the Eye of the Beholder. Theor. Comput. Sci. 179(1-2): 353-380 (1997) - [c31]Natasha Alechina, Yuri Gurevich:
Syntax vs. Semantics on Finite Structures. Structures in Logic and Computer Science 1997: 14-33 - [c30]Yuri Gurevich, Andrei Voronkov:
Monadic Simultaneous Rigid E-Unification and Related Problems. ICALP 1997: 154-165 - 1996
- [j51]Thomas Eiter, Georg Gottlob, Yuri Gurevich:
Normal Forms for Second-Order Logic over Finite Structures, and Classification of NP Optimization Problems. Ann. Pure Appl. Log. 78(1-3): 111-125 (1996) - [j50]Anatoli Degtyarev, Yuri Gurevich, Andrei Voronkov:
Herbrand's Theorem and Equational Reasoning: Problems and Solutions. Bull. EATCS 60: 78-96 (1996) - [j49]Yuri Gurevich, Saharon Shelah:
On Finite Rigid Structures. J. Symb. Log. 61(2): 549-562 (1996) - 1995
- [j48]Yuri Gurevich:
A Tribute to Dirk van Dalen - Preface. Ann. Pure Appl. Log. 73(1): 1 (1995) - [j47]Yuri Gurevich:
The Value, if any, of Decidability. Bull. EATCS 55 (1995) - [j46]Yuri Gurevich:
Platonism, Constructivism, and Computer Proofs vs. Proofs by Hand. Bull. EATCS 57 (1995) - [j45]Erich Grädel, Yuri Gurevich:
Tailoring Recursion for Complexity. J. Symb. Log. 60(3): 952-969 (1995) - [j44]Andreas Blass, Yuri Gurevich:
Matrix Transformation Is Complete for the Average Case. SIAM J. Comput. 24(1): 3-29 (1995) - [c29]Charles Wallace, Yuri Gurevich, Nandit Soparkar:
Formalizing Recovery in Transaction-Oriented Database Systems. COMAD 1995 - [c28]Yuri Gurevich, James K. Huggins:
The Railroad Crossing Problem: An Experiment with Instantaneous Actions and Immediate Reactions. CSL 1995: 266-290 - 1994
- [j43]Miklós Ajtai, Yuri Gurevich:
Datalog vs First-Order Logic. J. Comput. Syst. Sci. 49(3): 562-588 (1994) - [j42]Yuri Gurevich:
Logic activities in Europe. SIGACT News 25(2): 11-24 (1994) - [c27]Erich Grädel, Yuri Gurevich:
Tailoring Recursing for Complexity. ICALP 1994: 118-129 - [c26]Andreas Blass, Yuri Gurevich:
Evolving Algebras and Linear Time Hierarchy. IFIP Congress (1) 1994: 383-390 - [c25]Yuri Gurevich:
Evolving Algebras. IFIP Congress (1) 1994: 423-427 - [c24]Yuri Gurevich, James K. Huggins:
Evolving Algebras and Partial Evaluation. IFIP Congress (1) 1994: 587-592 - [c23]Erich Grädel, Yuri Gurevich:
Metafinite Model Theory. LCC 1994: 313-366 - [c22]Yuri Gurevich, Neil Immerman, Saharon Shelah:
McColm's Conjecture. LICS 1994: 10-19 - [e1]Egon Börger, Yuri Gurevich, Karl Meinke:
Computer Science Logic, 7th Workshop, CSL '93, Swansea, United Kingdom, September 13-17, 1993, Selected Papers. Lecture Notes in Computer Science 832, Springer 1994, ISBN 3-540-58277-0 [contents] - [i2]Yuri Gurevich, Neil Immerman, Saharon Shelah:
McColm conjecture. CoRR abs/math/9411235 (1994) - [i1]Yuri Gurevich, Saharon Shelah:
On finite rigid structures. CoRR abs/math/9411236 (1994) - 1993
- [j41]Andreas Blass, Yuri Gurevich:
Randomizing Reductions of Search Problems. SIAM J. Comput. 22(5): 949-975 (1993) - [c21]Yuri Gurevich, James K. Huggins:
ERRATA to "The Semantics of the C Programming Language". CSL 1993: 334-336 - [c20]Thomas Eiter, Georg Gottlob, Yuri Gurevich:
Curb Your Theory! A Circumspective Approach for Inclusive Interpretation of Disjunctive Information. IJCAI 1993: 634-639 - [p10]Yuri Gurevich:
Evolving algebras 1993: Lipari guide. Specification and validation methods 1993: 9-36 - [p9]Dean Rosenzweig, Egon Börger, Yuri Gurevich:
The bakery algorithm: yet another specification and verification. Specification and validation methods 1993: 231-243 - [p8]Yuri Gurevich, Raghu Mani:
Group membership protocol: specification and verification. Specification and validation methods 1993: 295-328 - [p7]Yuri Gurevich:
Logic in Computer Science. Current Trends in Theoretical Computer Science 1993: 223-224 - [p6]Yuri Gurevich:
On Kolmogorov Machines and Related Issues. Current Trends in Theoretical Computer Science 1993: 225-234 - [p5]Yuri Gurevich:
Infinite Games. Current Trends in Theoretical Computer Science 1993: 235-244 - [p4]Yuri Gurevich:
The challenger-Solver Game: variations on the Theme of P=NP. Current Trends in Theoretical Computer Science 1993: 245-253 - [p3]Yuri Gurevich:
On the Classical Decision Problem. Current Trends in Theoretical Computer Science 1993: 254-265 - [p2]Yuri Gurevich:
Evolving Algebras: an Attempt to Discover Semantics. Current Trends in Theoretical Computer Science 1993: 266-292 - [p1]Yuri Gurevich:
Zero-One Laws. Current Trends in Theoretical Computer Science 1993: 293-309 - 1992
- [j40]Yuri Gurevich:
Zero-One Laws. Bull. EATCS 46: 90-106 (1992) - [c19]Yuri Gurevich, James K. Huggins:
The Semantics of the C Programming Language. CSL 1992: 274-308 - 1991
- [j39]Yuri Gurevich:
Average Case Completeness. J. Comput. Syst. Sci. 42(3): 346-398 (1991) - [c18]Andreas Blass, Yuri Gurevich:
Randomizing Reductions of Search Problems. FSTTCS 1991: 10-24 - [c17]Yuri Gurevich:
Average Case Complexity. ICALP 1991: 615-628 - 1990
- [j38]Yuri Gurevich:
On the Classical Desicion Problem. Bull. EATCS 42: 140-150 (1990) - [j37]Yuri Gurevich:
Preface. Inf. Comput. 87(1/2): 1 (1990) - [j36]Yuri Gurevich, Saharon Shelah:
Nondeterministic Linear-Time Tasks May Require Substantially Nonlinear Deterministic Time in the Case of Sublinear Work Space. J. ACM 37(3): 674-687 (1990) - [c16]Andreas Blass, Yuri Gurevich:
On the Reduction Theory for Average Case Complexity. CSL 1990: 17-30 - [c15]Yuri Gurevich:
Matrix Decomposition Problem Is Complete for the Average Case. FOCS 1990: 802-811
1980 – 1989
- 1989
- [j35]Yuri Gurevich:
The Logic in computer science Column. Bull. EATCS 38: 93-100 (1989) - [j34]Yuri Gurevich:
Logic in Computer Science Column. Bull. EATCS 39: 112-121 (1989) - [j33]Andreas Blass, Yuri Gurevich:
On Matijasevitch's Nontraditional Approach to Search Problems. Inf. Process. Lett. 32(1): 41-45 (1989) - [j32]Yuri Gurevich, Saharon Shelah:
On the Strength of the Interpretation Method. J. Symb. Log. 54(2): 305-323 (1989) - [j31]Yuri Gurevich, Saharon Shelah:
Time Polynomial in Input or Output. J. Symb. Log. 54(3): 1083-1088 (1989) - [c14]Yuri Gurevich, Lawrence S. Moss:
Algebraic Operational Semantics and Occam. CSL 1989: 176-192 - [c13]Yuri Gurevich, Saharon Shelah:
Nearly Linear Time. Logic at Botik 1989: 108-118 - [c12]Miklós Ajtai, Yuri Gurevich:
Datalog vs. First-Order Logic. FOCS 1989: 142-147 - 1988
- [j30]Yuri Gurevich:
Logic in computer Science Column. Bull. EATCS 35: 71-81 (1988) - [c11]Yuri Gurevich, Saharon Shelah:
Nondeterministic Linear-Time Tasks May Require Substantially Nonlinear Deterministic Time in the Case of Sublinear Work Space. STOC 1988: 281-289 - 1987
- [j29]Miklós Ajtai, Yuri Gurevich:
Monotone versus positive. J. ACM 34(4): 1004-1015 (1987) - [j28]Yuri Gurevich, Saharon Shelah:
Expected Computation Time for Hamiltonian Path Problem. SIAM J. Comput. 16(3): 486-502 (1987) - [c10]Andreas Blass, Yuri Gurevich:
Existential Fixed-Point Logic. Computation Theory and Logic 1987: 20-36 - [c9]Yuri Gurevich, James M. Morris:
Algebraic Operational Semantics and Modula-2. CSL 1987: 81-101 - [c8]Yuri Gurevich:
Complete and Incomplete Randomized NP Problems. FOCS 1987: 111-117 - [c7]Yuri Gurevich:
Algenraic Operational Semantics. FSTTCS 1987: 1-2 - 1986
- [j27]Andreas Blass, Yuri Gurevich:
Henkin quantifiers and complete problems. Ann. Pure Appl. Log. 32: 1-16 (1986) - [j26]Yuri Gurevich, Saharon Shelah:
Fixed-point extensions of first-order logic. Ann. Pure Appl. Log. 32: 265-280 (1986) - [j25]Larry Denenberg, Yuri Gurevich, Saharon Shelah:
Definability by Constant-Depth Polynomial-Size Circuits. Inf. Control. 70(2/3): 216-240 (1986) - [j24]Amnon Barak, Zvi Drezner, Yuri Gurevich:
On the number of active nodes in a multicomputer system. Networks 16(3): 275-282 (1986) - [j23]Yuri Gurevich:
What does O(n) mean. SIGACT News 17(4): 61-63 (1986) - 1985
- [j22]Andreas Blass, Yuri Gurevich, Dexter Kozen:
A Zero-One Law for Logic with a Fixed-Point Operator. Inf. Control. 67(1-3): 70-90 (1985) - [j21]Yuri Gurevich, Saharon Shelah:
The Decision Problem for Branching Time Logic. J. Symb. Log. 50(3): 668-681 (1985) - [j20]John P. Burgess, Yuri Gurevich:
The decision problem for linear temporal logic. Notre Dame J. Formal Log. 26(2): 115-128 (1985) - [c6]Yuri Gurevich, Saharon Shelah:
Fixed-Point Extensions of First-Order Logic. FOCS 1985: 346-353 - 1984
- [j19]Yuri Gurevich, Harry R. Lewis:
A Logic for Constant-Depth Circuits. Inf. Control. 61(1): 65-74 (1984) - [j18]Yuri Gurevich, Larry J. Stockmeyer, Uzi Vishkin:
Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems. J. ACM 31(3): 459-473 (1984) - [j17]Yuri Gurevich, Harry R. Lewis:
The Word Problem for Cancellation Semigroups with Zero. J. Symb. Log. 49(1): 184-191 (1984) - [j16]Warren D. Goldfarb, Yuri Gurevich, Saharon Shelah:
A Decidable Subclass of the Minimal Godel Class with Identity. J. Symb. Log. 49(4): 1253-1261 (1984) - [j15]Andreas Blass, Yuri Gurevich:
Equivalence Relations, Invariants, and Normal Forms. SIAM J. Comput. 13(4): 682-689 (1984) - 1983
- [j14]Yuri Gurevich:
Decision Problem for Separated Distributive Lattices. J. Symb. Log. 48(1): 193-196 (1983) - [j13]Yuri Gurevich, Menachem Magidor, Saharon Shelah:
The Monadic Theory of omega12. J. Symb. Log. 48(2): 387-398 (1983) - [j12]Yuri Gurevich, Saharon Shelah:
Interpreting Second-Order Logic in the Monadic Theory of Order. J. Symb. Log. 48(3): 816-828 (1983) - [j11]Yuri Gurevich, Saharon Shelah:
Rabin's Uniformization Problem. J. Symb. Log. 48(4): 1105-1119 (1983) - [j10]Yuri Gurevich, Saharon Shelah:
Random Models and the Godel Case of the Decision Problem. J. Symb. Log. 48(4): 1120-1124 (1983) - [c5]Yuri Gurevich:
Algebras of Feasible Functions. FOCS 1983: 210-214 - [c4]Andreas Blass, Yuri Gurevich:
Equivalence relations, invariants, and normal forms. Logic and Machines 1983: 24-42 - 1982
- [j9]Yuri Gurevich, Saharon Shelah:
Monadic theory of order and topology in ZFC. Ann. Math. Log. 23(2-3): 179-198 (1982) - [j8]Yuri Gurevich, Harry R. Lewis:
The Inference Problem for Template Dependencies. Inf. Control. 55(1-3): 69-79 (1982) - [j7]Andreas Blass, Yuri Gurevich:
On the Unique Satisfiability Problem. Inf. Control. 55(1-3): 80-88 (1982) - [c3]A. Prasad Sistla, Edmund M. Clarke, Nissim Francez, Yuri Gurevich:
Can Message Buffers be Characterized in Linear Temporal Logic? PODC 1982: 148-156 - [c2]Yuri Gurevich, Harry R. Lewis:
The Inference Problem for Template Dependencies. PODS 1982: 221-229 - [c1]Yuri Gurevich, Leo Harrington:
Trees, Automata, and Games. STOC 1982: 60-65 - 1980
- [j6]Stål O. Aanderaa, Egon Börger, Yuri Gurevich:
Prefix classes of krom formulae with identity. Arch. Math. Log. 22(1-2): 43-49 (1980) - [j5]Yuri Gurevich:
Existential interpretation. II. Arch. Math. Log. 22(3-4): 103-120 (1980)
1970 – 1979
- 1979
- [j4]Yuri Gurevich:
Modest Theory of Short Chains. I. J. Symb. Log. 44(4): 481-490 (1979) - [j3]Yuri Gurevich, Saharon Shelah:
Modest Theory of Short Chains. II. J. Symb. Log. 44(4): 491-502 (1979) - 1977
- [j2]Yuri Gurevich:
Semi-conservative reduction. Arch. Math. Log. 18(1): 23-25 (1977) - 1976
- [j1]Yuri Gurevich:
The Decision Problem for Standard Classes. J. Symb. Log. 41(2): 460-464 (1976)
Coauthor Index
[i34] [i33] [j139] [j138] [i30] [j136] [j134] [i29] [i27] [i24] [i23] [j130] [j129] [j128] [i21] [i20] [j126] [i18] [j125] [j124] [j123] [i17] [i16] [i15] [j122] [c81] [p19] [j114] [j108] [p18] [j107] [j106] [j105] [c71] [c70] [j104] [j98] [j97] [j96] [c66] [c64] [i12] [i11] [i10] [i9] [i8] [j95] [j94] [j93] [j92] [j89] [j88] [i7] [i6] [j87] [c55] [j84] [j82] [j81] [j80] [j78] [j77] [j76] [j75] [j73] [j71] [p11] [j70] [j69] [j66] [c40] [c36] [c35] [j63] [j58] [j55] [j44] [c26] [j41] [c18] [c16] [j33] [c10] [j27] [j22] [j15] [c4] [j7]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-16 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
