Andreas Blass

According to our database1, Andreas Blass authored at least 120 papers between 1972 and 2020.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of one.



In proceedings 
PhD thesis 





Braided distributivity.
Theor. Comput. Sci., 2020

Witness algebra and anyon braiding.
Math. Struct. Comput. Sci., 2020

Circuits: An abstract viewpoint.
CoRR, 2020

Functional Thesauri, Classifying Topoi, Unification, and Flatness.
Proceedings of the Fields of Logic and Computation III, 2020

Circuit pedantry.
Bull. EATCS, 2019

An Invitation to Quantum Computing.
Bull. EATCS, 2018

Negative probabilities, II What they are and what they are for.
Bull. EATCS, 2018

Who needs category theory?
Bull. EATCS, 2018

Coherence for braided distributivity.
CoRR, 2018

On the Rectilinear Steiner Problem.
Bull. EATCS, 2017

Common Denominator for Value and Expectation No-go Theorems: Extended Abstract.
Proceedings of the Proceedings 14th International Conference on Quantum Physics and Logic, 2017

Symbioses between mathematical logic and computer science.
Ann. Pure Appl. Log., 2016

On Quantum Computation, Anyons, and Categories.
Proceedings of the Martin Davis on Computability, 2016

Introduction to Secret-Sharing.
Proceedings of the Dependence Logic, Theory and Applications, 2016

The Next Best Thing to a P-Point.
J. Symb. Log., 2015

Negative Probability.
Bull. EATCS, 2015

Existential Fixed-Point Logic as a Fragment of Second-Order Logic.
Proceedings of the Fields of Logic and Computation II, 2015

Abstract Hilbertian deductive systems, infon logic, and Datalog.
Inf. Comput., 2013

Persistent queries in the behavioral theory of algorithms.
ACM Trans. Comput. Log., 2011

Zero-One Laws: Thesauri and Parametric Conditions.
Proceedings of the Proof, Computation and Agency - Logic at the Crossroads., 2011

Content-dependent chunking for differential compression, the local maximum approach.
J. Comput. Syst. Sci., 2010

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

Hilbertian Deductive Systems, Infon Logic, and Datalog.
Bull. EATCS, 2010

Exact Exploration and Hanging Algorithms.
Proceedings of the Computer Science Logic, 24th International Workshop, 2010

Evidential Authorization.
Proceedings of the Future of Software Engineering., 2010

Yuri, Logic, and Computer Science.
Proceedings of the Fields of Logic and Computation, 2010

Existential Fixed-Point Logic, Universal Quantifiers, and Topoi.
Proceedings of the Fields of Logic and Computation, 2010

When are two algorithms the same?
Bull. Symb. Log., 2009

Ann. Pure Appl. Log., 2009

Partitions and Permutation Groups.
Proceedings of the Model Theoretic Methods in Finite Combinatorics, 2009

Abstract state machines capture parallel algorithms: Correction and extension.
ACM Trans. Comput. Log., 2008

Program termination and well partial orderings.
ACM Trans. Comput. Log., 2008

Two Forms of One Useful Logic: Existential Fixed Point Logic and Liberal Datalog.
Bull. EATCS, 2008

Modular difference logic is hard
CoRR, 2008

Persistent Queries
CoRR, 2008

One Useful Logic That Defines Its Own Truth.
Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

Why Sets?
Proceedings of the Pillars of Computer Science, 2008

Ordinary interactive small-step algorithms, III.
ACM Trans. Comput. Log., 2007

Ordinary interactive small-step algorithms, II.
ACM Trans. Comput. Log., 2007

Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem.
Log. Methods Comput. Sci., 2007

Interactive Small-Step Algorithms I: Axiomatization.
Log. Methods Comput. Sci., 2007

Background of Computation.
Bull. EATCS, 2007

Zero-One Laws: Thesauri and Parametric Conditions.
Bull. EATCS, 2007

Ordinary interactive small-step algorithms, I.
ACM Trans. Comput. Log., 2006

Adapting Logics.
Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 2006

Divisibility of Dedekind finite Sets.
J. Mathematical Logic, 2005

Explicit Graphs with Extension Properties.
Bull. EATCS, 2005

Random Orders and Gambler's Ruin.
Electron. J. Comb., 2005

NP-Completeness of Deciding Binary Genetic Encodability.
Proceedings of the Foundations of Genetic Algorithms, 8th International Workshop, 2005

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

Why Sets? (Column: Logic in Computer Science).
Bull. EATCS, 2004

Abstract state machines capture parallel algorithms.
ACM Trans. Comput. Log., 2003

Sperner spaces and first-order logic.
Math. Log. Q., 2003

Strong extension axioms and Shelah's zero-one law for choiceless polynomial time.
J. Symb. Log., 2003

Algorithms: A Quest for Absolute Definitions.
Bull. EATCS, 2003

Homotopy and Homology of Finite Lattices.
Electron. J. Comb., 2003

On Polynomial Time Computation over Unordered Structures.
J. Symb. Log., 2002

Abstract State Machines and Computationally Complete Query Languages.
Inf. Comput., 2002

Algorithms vs. Machines.
Bull. EATCS, 2002

Pairwise Testing.
Bull. EATCS, 2002

Inadequacy of computable loop invariants.
ACM Trans. Comput. Log., 2001

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

Needed reals and recursion in generic reals.
Ann. Pure Appl. Log., 2001

The Underlying Logic of Hoare Logic.
Proceedings of the Current Trends in Theoretical Computer Science, 2001

The Logic of Choice.
J. Symb. Log., 2000

The Underlying Logic of Hoare Logic.
Bull. EATCS, 2000

A New Zero-One Law and Strong Extension Axioms.
Bull. EATCS, 2000

Choiceless Polynominal Time Computation and the Zero-One Law.
Proceedings of the Computer Science Logic, 2000

Background, Reserve, and Gandy Machines.
Proceedings of the Computer Science Logic, 2000

Abstract State Machines and Pure Mathematics.
Proceedings of the Abstract State Machines, 2000

On The Confinality of Ultrapowers.
J. Symb. Log., 1999

Choiceless Polynomial Time.
Ann. Pure Appl. Log., 1999

A Variation on the Zero-One Law.
Inf. Process. Lett., 1998

The Linear Time Hierarchy Theorems for Abstract State Machines and RAMs.
J. UCS, 1997

Some Semantical Aspects of Linear Logic.
Log. J. IGPL, 1997

Matrix Transformation Is Complete for the Average Case.
SIAM J. Comput., 1995

An Induction Principle and Pigeonhole Principles for K-Finite Sets.
J. Symb. Log., 1995

On exponentiation of G-sets.
Discret. Math., 1994

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

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

Randomizing Reductions of Search Problems.
SIAM J. Comput., 1993

Is Game Semantics Necessary?
Proceedings of the Computer Science Logic, 7th Workshop, 1993

Diverse Homogeneous Sets.
J. Comb. Theory, Ser. A, 1992

Complete Topoi Representing Models of Set Theory.
Ann. Pure Appl. Log., 1992

A Game Semantics for Linear Logic.
Ann. Pure Appl. Log., 1992

Infinitary Combinatorics and Modal Logic.
J. Symb. Log., 1990

Groupwise density and related cardinals.
Arch. Math. Log., 1990

On the Reduction Theory for Average Case Complexity.
Proceedings of the Computer Science Logic, 4th Workshop, 1990

Near Coherence of Filters III: A Simplified Consistency Proof.
Notre Dame J. Formal Log., 1989

Consistency Results About Filters and the Number of Inequivalent Growth Types.
J. Symb. Log., 1989

On Matijasevitch's Nontraditional Approach to Search Problems.
Inf. Process. Lett., 1989

Logic in Computer Ccience Column, guest authors.
Bull. EATCS, 1988

Selective ultrafilters and homogeneity.
Ann. Pure Appl. Log., 1988

There may be simple Paleph<sub>1</sub> and Paleph<sub>2</sub>-points and the Rudin-Keisler ordering may be downward directed.
Ann. Pure Appl. Log., 1987

Existential Fixed-Point Logic.
Proceedings of the Computation Theory and Logic, In Memory of Dieter Rödding, 1987

Near coherence of filters. I. Cofinal equivalence of models of arithmetic.
Notre Dame J. Formal Log., 1986

Small Decidable Sheaves.
J. Symb. Log., 1986

Meeting of the Association for Symbolic Logic: Chicago, 1985.
J. Symb. Log., 1986

Bijective proofs of two broken circuit theorems.
Journal of Graph Theory, 1986

Henkin quantifiers and complete problems.
Ann. Pure Appl. Log., 1986

Acknowledgement of Priority.
J. Symb. Log., 1985

A Zero-One Law for Logic with a Fixed-Point Operator
Inf. Control., 1985

Equivalence Relations, Invariants, and Normal Forms.
SIAM J. Comput., 1984

There are not Exactly Five Objects.
J. Symb. Log., 1984

On the Unique Satisfiability Problem
Inf. Control., 1982

The Model of Set Theory Generated by Countably Many Generic Reals.
J. Symb. Log., 1981

Some Initial Segments of the Rudin-Keisler Ordering.
J. Symb. Log., 1981

Paley graphs satisfy all first-order adjacency axioms.
Journal of Graph Theory, 1981

Which trees are link graphs?
J. Comb. Theory, Ser. B, 1980

Conservative extensions of models of arithmetic.
Arch. Math. Log., 1980

Properties of almost all graphs and complexes.
Journal of Graph Theory, 1979

Graphs with unique maximal clumpings.
Journal of Graph Theory, 1978

Ramsey's Theorem in the Hierarchy of Choice Principles.
J. Symb. Log., 1977

Amalgamation of Nonstandard Models of Arithmetic.
J. Symb. Log., 1977

Cores of pi<sup>1</sup><sub>1</sub> Sets of Reals.
J. Symb. Log., 1974

On Certain Types and Models for Arithmetic.
J. Symb. Log., 1974

On the Inadequacy of Inner Models.
J. Symb. Log., 1972

Theories without Countable Models.
J. Symb. Log., 1972

The Intersection of Nonstandard Models of Arithmetic.
J. Symb. Log., 1972

Complexity of winning strategies.
Discret. Math., 1972