Andreas Blass
According to our database^{1},
Andreas Blass
authored at least 110 papers
between 1972 and 2018.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at zbmath.org

at id.loc.gov

at dnb.info
On csauthors.net:
Bibliography
2018
An Invitation to Quantum Computing.
Bulletin of the EATCS, 2018
Negative probabilities, II What they are and what they are for.
Bulletin of the EATCS, 2018
Who needs category theory?
Bulletin of the EATCS, 2018
2017
On the Rectilinear Steiner Problem.
Bulletin of the EATCS, 2017
Common Denominator for Value and Expectation Nogo Theorems: Extended Abstract.
Proceedings of the Proceedings 14th International Conference on Quantum Physics and Logic, 2017
2016
Symbioses between mathematical logic and computer science.
Ann. Pure Appl. Logic, 2016
On Quantum Computation, Anyons, and Categories.
Proceedings of the Martin Davis on Computability, 2016
Introduction to SecretSharing.
Proceedings of the Dependence Logic, Theory and Applications, 2016
2015
The Next Best Thing to a PPoint.
J. Symb. Log., 2015
Negative Probability.
Bulletin of the EATCS, 2015
Existential FixedPoint Logic as a Fragment of SecondOrder Logic.
Proceedings of the Fields of Logic and Computation II, 2015
2013
Abstract Hilbertian deductive systems, infon logic, and Datalog.
Inf. Comput., 2013
2011
Persistent queries in the behavioral theory of algorithms.
ACM Trans. Comput. Log., 2011
ZeroOne Laws: Thesauri and Parametric Conditions.
Proceedings of the Proof, Computation and Agency  Logic at the Crossroads., 2011
2010
Contentdependent chunking for differential compression, the local maximum approach.
J. Comput. Syst. Sci., 2010
The TowerofBabel Problem, and Security Assesment Sharing.
Bulletin of the EATCS, 2010
Hilbertian Deductive Systems, Infon Logic, and Datalog.
Bulletin of the 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 FixedPoint Logic, Universal Quantifiers, and Topoi.
Proceedings of the Fields of Logic and Computation, 2010
2009
When are two algorithms the same?
Bulletin of Symbolic Logic, 2009
Preface.
Ann. Pure Appl. Logic, 2009
2008
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.
Bulletin of the EATCS, 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
2007
Ordinary interactive smallstep algorithms, III.
ACM Trans. Comput. Log., 2007
Ordinary interactive smallstep algorithms, II.
ACM Trans. Comput. Log., 2007
Interactive SmallStep Algorithms II: Abstract State Machines and the Characterization Theorem.
Logical Methods in Computer Science, 2007
Interactive SmallStep Algorithms I: Axiomatization.
Logical Methods in Computer Science, 2007
Background of Computation.
Bulletin of the EATCS, 2007
ZeroOne Laws: Thesauri and Parametric Conditions.
Bulletin of the EATCS, 2007
2006
Ordinary interactive smallstep algorithms, I.
ACM Trans. Comput. Log., 2006
Adapting Logics.
Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 2006
2005
Explicit Graphs with Extension Properties.
Bulletin of the EATCS, 2005
Random Orders and Gambler's Ruin.
Electr. J. Comb., 2005
NPCompleteness 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
2004
Why Sets? (Column: Logic in Computer Science).
Bulletin of the EATCS, 2004
2003
Abstract state machines capture parallel algorithms.
ACM Trans. Comput. Log., 2003
Sperner spaces and firstorder logic.
Math. Log. Q., 2003
Strong extension axioms and Shelah's zeroone law for choiceless polynomial time.
J. Symb. Log., 2003
Algorithms: A Quest for Absolute Definitions.
Bulletin of the EATCS, 2003
Homotopy and Homology of Finite Lattices.
Electr. J. Comb., 2003
2002
On Polynomial Time Computation over Unordered Structures.
J. Symb. Log., 2002
Algorithms vs. Machines.
Bulletin of the EATCS, 2002
Pairwise Testing.
Bulletin of the EATCS, 2002
2001
Inadequacy of computable loop invariants.
ACM Trans. Comput. Log., 2001
Addendum to "Choiceless Polynomial Time": Ann. Pure Appl. Logic 100 (1999) 141187.
Ann. Pure Appl. Logic, 2001
Needed reals and recursion in generic reals.
Ann. Pure Appl. Logic, 2001
The Underlying Logic of Hoare Logic.
Current Trends in Theoretical Computer Science, 2001
2000
The Logic of Choice.
J. Symb. Log., 2000
The Underlying Logic of Hoare Logic.
Bulletin of the EATCS, 2000
A New ZeroOne Law and Strong Extension Axioms.
Bulletin of the EATCS, 2000
Choiceless Polynominal Time Computation and the ZeroOne Law.
Proceedings of the Computer Science Logic, 2000
Background, Reserve, and Gandy Machines.
Proceedings of the Computer Science Logic, 2000
Abstract State Machines and Computationally Complete Query Languages.
Proceedings of the Abstract State Machines, 2000
Abstract State Machines and Pure Mathematics.
Proceedings of the Abstract State Machines, 2000
1999
On The Confinality of Ultrapowers.
J. Symb. Log., 1999
Choiceless Polynomial Time.
Ann. Pure Appl. Logic, 1999
1998
A Variation on the ZeroOne Law.
Inf. Process. Lett., 1998
1997
The Linear Time Hierarchy Theorems for Abstract State Machines and RAMs.
J. UCS, 1997
Some Semantical Aspects of Linear Logic.
Logic Journal of the IGPL, 1997
1995
Matrix Transformation Is Complete for the Average Case.
SIAM J. Comput., 1995
An Induction Principle and Pigeonhole Principles for KFinite Sets.
J. Symb. Log., 1995
1994
On exponentiation of Gsets.
Discrete Mathematics, 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
1993
Topoi and Computation.
Proceedings of the Current Trends in Theoretical Computer Science  Essays and Tutorials, 1993
Is Game Semantics Necessary?
Proceedings of the Computer Science Logic, 7th Workshop, 1993
1992
Diverse Homogeneous Sets.
J. Comb. Theory, Ser. A, 1992
Complete Topoi Representing Models of Set Theory.
Ann. Pure Appl. Logic, 1992
A Game Semantics for Linear Logic.
Ann. Pure Appl. Logic, 1992
1991
Randomizing Reductions of Search Problems.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1991
1990
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
1989
Near Coherence of Filters III: A Simplified Consistency Proof.
Notre Dame Journal of Formal Logic, 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
1988
Logic in Computer Ccience Column, guest authors.
Bulletin of the EATCS, 1988
Selective ultrafilters and homogeneity.
Ann. Pure Appl. Logic, 1988
1987
There may be simple Paleph_{1} and Paleph_{2}points and the RudinKeisler ordering may be downward directed.
Ann. Pure Appl. Logic, 1987
Existential FixedPoint Logic.
Proceedings of the Computation Theory and Logic, In Memory of Dieter Rödding, 1987
1986
Near coherence of filters. I. Cofinal equivalence of models of arithmetic.
Notre Dame Journal of Formal Logic, 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. Logic, 1986
1985
Acknowledgement of Priority.
J. Symb. Log., 1985
A ZeroOne Law for Logic with a FixedPoint Operator
Information and Control, 1985
1984
There are not Exactly Five Objects.
J. Symb. Log., 1984
1983
Equivalence relations, invariants, and normal forms.
Proceedings of the Logic and Machines: Decision Problems and Complexity, 1983
1982
On the Unique Satisfiability Problem
Information and Control, 1982
1981
The Model of Set Theory Generated by Countably Many Generic Reals.
J. Symb. Log., 1981
Some Initial Segments of the RudinKeisler Ordering.
J. Symb. Log., 1981
Paley graphs satisfy all firstorder adjacency axioms.
Journal of Graph Theory, 1981
1980
Which trees are link graphs?
J. Comb. Theory, Ser. B, 1980
Conservative extensions of models of arithmetic.
Arch. Math. Log., 1980
1979
Properties of almost all graphs and complexes.
Journal of Graph Theory, 1979
1978
Graphs with unique maximal clumpings.
Journal of Graph Theory, 1978
1977
Ramsey's Theorem in the Hierarchy of Choice Principles.
J. Symb. Log., 1977
Amalgamation of Nonstandard Models of Arithmetic.
J. Symb. Log., 1977
1974
Cores of pi^{1}_{1} Sets of Reals.
J. Symb. Log., 1974
On Certain Types and Models for Arithmetic.
J. Symb. Log., 1974
1972
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.
Discrete Mathematics, 1972