Andreas Blass

ORCID

Publication Activity (10 Years)

Years Active: 1972-2024
Publications (10 Years): 27

Top Venues

Publications

Yuri Gurevich, Andreas Blass
What are kets? CoRR (2024)
Yuri Gurevich, Andreas Blass
Primal logic of information. CoRR (2023)
Yuri Gurevich, Andreas Blass
What are kets? Bull. EATCS 141 (2023)
Yuri Gurevich, Andreas Blass
Software science view on quantum circuit algorithms. Inf. Comput. 292 (2023)
Andreas Blass, Yuri Gurevich, Alexander Volberg
Wigner's quasidistribution and Dirac's kets. CoRR (2022)
Yuri Gurevich, Andreas Blass
Software science view on quantum circuit algorithms. CoRR (2022)
Yuri Gurevich, Andreas Blass
Quantum circuits with classical channels and the principle of deferred measurements. Theor. Comput. Sci. 920 (2022)
Andreas Blass, Yuri Gurevich, Alexander Volberg
Wigner's quasidistribution and Dirac's kets. Bull. EATCS 136 (2022)
Yuri Gurevich, Andreas Blass
Simple circuit simulations of classical and quantum Turing machines. CoRR (2021)
Yuri Gurevich, Andreas Blass
Quantum circuits with classical channels and the principle of deferred measurements. CoRR (2021)
Andreas Blass, Yuri Gurevich
Circuits: An abstract viewpoint. CoRR (2020)
Andreas Blass, Yuri Gurevich
Braided distributivity. Theor. Comput. Sci. 807 (2020)
Andreas Blass, Yuri Gurevich
Negative probabilities: What they are and what they are for. CoRR (2020)
Andreas Blass, Yuri Gurevich
Witness algebra and anyon braiding. Math. Struct. Comput. Sci. 30 (3) (2020)
Andreas Blass
Functional Thesauri, Classifying Topoi, Unification, and Flatness. Fields of Logic and Computation III (2020)
Andreas Blass, Yuri Gurevich
Circuits: An abstract viewpoint. Bull. EATCS 131 (2020)
Andreas Blass, Yuri Gurevich
Circuit pedantry. Bull. EATCS 129 (2019)
Andreas Blass, Yuri Gurevich
Circuit pedantry. CoRR (2019)
Andreas Blass, Yuri Gurevich
Witness Algebra and Anyon Braiding. CoRR (2018)
Andreas Blass, Yuri Gurevich
Who needs category theory? Bull. EATCS 124 (2018)
Andreas Blass, Yuri Gurevich
Negative probabilities, II What they are and what they are for. Bull. EATCS 125 (2018)
Andreas Blass, Yuri Gurevich
An Invitation to Quantum Computing. Bull. EATCS 126 (2018)
Andreas Blass, Yuri Gurevich
Coherence for braided distributivity. CoRR (2018)
Andreas Blass, Yuri Gurevich
Who needs category theory? CoRR (2018)
Andreas Blass, Yuri Gurevich
Common Denominator for Value and Expectation No-go Theorems: Extended Abstract. QPL (2017)
Andreas Blass, Yuri Gurevich
On the Rectilinear Steiner Problem. Bull. EATCS 121 (2017)
Andreas Blass
Symbioses between mathematical logic and computer science. Ann. Pure Appl. Log. 167 (10) (2016)
Andreas Blass
Negative Probability. Bull. EATCS 115 (2015)
Andreas Blass, Natasha Dobrinen, Dilip Raghavan
The Next Best Thing to a P-Point. J. Symb. Log. 80 (3) (2015)
Andreas Blass
Existential Fixed-Point Logic as a Fragment of Second-Order Logic. Fields of Logic and Computation II (2015)
Andreas Blass, Yuri Gurevich
Abstract Hilbertian deductive systems, infon logic, and Datalog. Inf. Comput. 231 (2013)
Andreas Blass, Yuri Gurevich
Persistent queries in the behavioral theory of algorithms. ACM Trans. Comput. Log. 12 (2) (2011)
Andreas Blass
Existential Fixed-Point Logic, Universal Quantifiers, and Topoi. Fields of Logic and Computation (2010)
Andreas Blass, Yuri Gurevich, Efim Hudis
The Tower-of-Babel Problem, and Security Assesment Sharing. Bull. EATCS 101 (2010)
Andreas Blass, Nachum Dershowitz, Yuri Gurevich
Exact Exploration and Hanging Algorithms. CSL (2010)
Nikolaj Bjørner, Andreas Blass, Yuri Gurevich
Content-dependent chunking for differential compression, the local maximum approach. J. Comput. Syst. Sci. 76 (3-4) (2010)
Andreas Blass, Nachum Dershowitz, Wolfgang Reisig
Yuri, Logic, and Computer Science. Fields of Logic and Computation (2010)
Andreas Blass, Yuri Gurevich, Michal Moskal, Itay Neeman
Evidential Authorization. The Future of Software Engineering (2010)
Andreas Blass, Yuri Gurevich
Hilbertian Deductive Systems, Infon Logic, and Datalog. Bull. EATCS 102 (2010)
Andreas Blass, Su Gao, Yi Zhang
Preface. Ann. Pure Appl. Log. 158 (3) (2009)
Andreas Blass, Nachum Dershowitz, Yuri Gurevich
When are two algorithms the same? Bull. Symb. Log. 15 (2) (2009)
Andreas Blass
Partitions and Permutation Groups. AMS-ASL Joint Special Session (2009)
Nikolaj Bjørner, Andreas Blass, Yuri Gurevich, Madan Musuvathi
Modular difference logic is hard CoRR (2008)
Andreas Blass, Yuri Gurevich
Two Forms of One Useful Logic: Existential Fixed Point Logic and Liberal Datalog. Bull. EATCS 95 (2008)
Andreas Blass, Yuri Gurevich
Program termination and well partial orderings. ACM Trans. Comput. Log. 9 (3) (2008)
Andreas Blass, Yuri Gurevich
Abstract state machines capture parallel algorithms: Correction and extension. ACM Trans. Comput. Log. 9 (3) (2008)
Andreas Blass, Nachum Dershowitz, Yuri Gurevich
When are two algorithms the same? CoRR (2008)
Andreas Blass, Yuri Gurevich
One Useful Logic That Defines Its Own Truth. MFCS (2008)
Andreas Blass, Yuri Gurevich
Two Forms of One Useful Logic: Existential Fixed Point Logic and Liberal Datalog CoRR (2008)
Andreas Blass, Yuri Gurevich
Persistent Queries CoRR (2008)
Andreas Blass, Yuri Gurevich
One useful logic that defines its own truth CoRR (2008)
Andreas Blass, Yuri Gurevich
Why Sets? Pillars of Computer Science (2008)
Andreas Blass, Yuri Gurevich
Ordinary interactive small-step algorithms, II. ACM Trans. Comput. Log. 8 (3) (2007)
Andreas Blass, Yuri Gurevich
Ordinary interactive small-step algorithms, III. ACM Trans. Comput. Log. 8 (3) (2007)
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)
Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman
Interactive Small-Step Algorithms I: Axiomatization CoRR (2007)
Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman
Interactive Small-Step Algorithms I: Axiomatization. Log. Methods Comput. Sci. 3 (4) (2007)
Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman
Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem CoRR (2007)
Andreas Blass, Yuri Gurevich
Zero-One Laws: Thesauri and Parametric Conditions. Bull. EATCS 91 (2007)
Andreas Blass, Yuri Gurevich
Background of Computation. Bull. EATCS 92 (2007)
Andreas Blass
Adapting Logics. LICS (2006)
Andreas Blass, Yuri Gurevich
Ordinary interactive small-step algorithms, I. ACM Trans. Comput. Log. 7 (2) (2006)
Andreas Blass, Benjamin Rossman
Explicit Graphs with Extension Properties. Bull. EATCS 86 (2005)
David Blair, Andreas Blass, Paul Howard
Divisibility of Dedekind finite Sets. J. Math. Log. 5 (1) (2005)
Andreas Blass, Gábor Braun
Random Orders and Gambler's Ruin. Electron. J. Comb. 12 (2005)
Andreas Blass, Boris Mitavskiy
NP-Completeness of Deciding Binary Genetic Encodability. FOGA (2005)
Andreas Blass, Yuri Gurevich, Lev Nachmanson, Margus Veanes
Play to Test. FATES (2005)
Andreas Blass, Yuri Gurevich
Why Sets? (Column: Logic in Computer Science). Bull. EATCS 84 (2004)
Andreas Blass, Yuri Gurevich
Algorithms: A Quest for Absolute Definitions. Bull. EATCS 81 (2003)
Andreas Blass, Yuri Gurevich
Abstract state machines capture parallel algorithms. ACM Trans. Comput. Log. 4 (4) (2003)
Andreas Blass, Victor Pambuccian
Sperner spaces and first-order logic. Math. Log. Q. 49 (2) (2003)
Andreas Blass
Homotopy and Homology of Finite Lattices. Electron. J. Comb. 10 (2003)
Andreas Blass, Yuri Gurevich
Strong extension axioms and Shelah's zero-one law for choiceless polynomial time. J. Symb. Log. 68 (1) (2003)
Andreas Blass, Yuri Gurevich
Pairwise Testing. Bull. EATCS 78 (2002)
Andreas Blass, Yuri Gurevich, Saharon Shelah
On Polynomial Time Computation over Unordered Structures. J. Symb. Log. 67 (3) (2002)
Andreas Blass, Yuri Gurevich, Jan Van den Bussche
Abstract State Machines and Computationally Complete Query Languages. Inf. Comput. 174 (1) (2002)
Andreas Blass, Yuri Gurevich
Algorithms vs. Machines. Bull. EATCS 77 (2002)
Andreas Blass
Needed reals and recursion in generic reals. Ann. Pure Appl. Log. 109 (1-2) (2001)
Andreas Blass, Yuri Gurevich
Inadequacy of computable loop invariants. ACM Trans. Comput. Log. 2 (1) (2001)
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) (2001)
Andreas Blass, Yuri Gurevich
A New Zero-One Law and Strong Extension Axioms. Bull. EATCS 72 (2000)
Andreas Blass
Abstract State Machines and Pure Mathematics. Abstract State Machines (2000)
Andreas Blass, Yuri Gurevich
The Logic of Choice. J. Symb. Log. 65 (3) (2000)
Andreas Blass, Yuri Gurevich
Choiceless Polynominal Time Computation and the Zero-One Law. CSL (2000)
Andreas Blass, Yuri Gurevich, Jan Van den Bussche
Abstract State Machines and Computationally Complete Query Languages. Abstract State Machines (2000)
Andreas Blass, Yuri Gurevich
The Underlying Logic of Hoare Logic. Bull. EATCS 70 (2000)
Andreas Blass, Yuri Gurevich
Background, Reserve, and Gandy Machines. CSL (2000)
Andreas Blass, Yuri Gurevich, Saharon Shelah
Choiceless Polynomial Time. Ann. Pure Appl. Log. 100 (1-3) (1999)
Andreas Blass, Heike Mildenberger
On The Confinality of Ultrapowers. J. Symb. Log. 64 (2) (1999)
Andreas Blass, Yuri Gurevich, Vladik Kreinovich, Luc Longpré
A Variation on the Zero-One Law. Inf. Process. Lett. 67 (1) (1998)
Andreas Blass
Some Semantical Aspects of Linear Logic. Log. J. IGPL 5 (4) (1997)
Andreas Blass, Yuri Gurevich
The Linear Time Hierarchy Theorems for Abstract State Machines and RAMs. J. Univers. Comput. Sci. 3 (4) (1997)
Andreas Blass, Yuri Gurevich
Matrix Transformation Is Complete for the Average Case. SIAM J. Comput. 24 (1) (1995)
Andreas Blass
An Induction Principle and Pigeonhole Principles for K-Finite Sets. J. Symb. Log. 60 (4) (1995)
Andreas Blass
On exponentiation of G-sets. Discret. Math. 135 (1-3) (1994)
Andreas Blass, Yuri Gurevich
Evolving Algebras and Linear Time Hierarchy. IFIP Congress (1) (1994)
Andreas Blass
Is Game Semantics Necessary? CSL (1993)
Andreas Blass, Yuri Gurevich
Randomizing Reductions of Search Problems. SIAM J. Comput. 22 (5) (1993)
Andreas Blass, Andre Scedrov
Complete Topoi Representing Models of Set Theory. Ann. Pure Appl. Log. 57 (1) (1992)
Andreas Blass, Paul Erdös, Alan D. Taylor
Diverse Homogeneous Sets. J. Comb. Theory, Ser. A 59 (2) (1992)

Andreas Blass.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Andreas Blass