Andreas Blass
According to our database^{1},
Andreas Blass
authored at least 125 papers
between 1972 and 2022.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:

on zbmath.org

on id.loc.gov

on dnb.info
On csauthors.net:
Bibliography
2022
Quantum circuits with classical channels and the principle of deferred measurements.
Theor. Comput. Sci., 2022
Bull. EATCS, 2022
CoRR, 2022
2021
CoRR, 2021
2020
Theor. Comput. Sci., 2020
Math. Struct. Comput. Sci., 2020
Bull. EATCS, 2020
CoRR, 2020
Proceedings of the Fields of Logic and Computation III, 2020
2019
Bull. EATCS, 2019
2018
Bull. EATCS, 2018
Bull. EATCS, 2018
Bull. EATCS, 2018
CoRR, 2018
2017
Bull. EATCS, 2017
Proceedings of the Proceedings 14th International Conference on Quantum Physics and Logic, 2017
2016
Ann. Pure Appl. Log., 2016
Proceedings of the Martin Davis on Computability, 2016
Proceedings of the Dependence Logic, Theory and Applications, 2016
2015
J. Symb. Log., 2015
Bull. EATCS, 2015
Proceedings of the Fields of Logic and Computation II, 2015
2013
Inf. Comput., 2013
2011
ACM Trans. Comput. Log., 2011
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
Bull. EATCS, 2010
Bull. EATCS, 2010
Proceedings of the Computer Science Logic, 24th International Workshop, 2010
Proceedings of the Future of Software Engineering., 2010
Proceedings of the Fields of Logic and Computation, 2010
Proceedings of the Fields of Logic and Computation, 2010
2009
Bull. Symb. Log., 2009
Ann. Pure Appl. Log., 2009
Partitions and Permutation Groups.
Proceedings of the Model Theoretic Methods in Finite Combinatorics, 2009
2008
ACM Trans. Comput. Log., 2008
ACM Trans. Comput. Log., 2008
Two Forms of One Useful Logic: Existential Fixed Point Logic and Liberal Datalog.
Bull. EATCS, 2008
CoRR, 2008
CoRR, 2008
Proceedings of the Mathematical Foundations of Computer Science 2008, 2008
Proceedings of the Pillars of Computer Science, 2008
2007
ACM Trans. Comput. Log., 2007
ACM Trans. Comput. Log., 2007
Interactive SmallStep Algorithms II: Abstract State Machines and the Characterization Theorem.
Log. Methods Comput. Sci., 2007
Log. Methods Comput. Sci., 2007
Background of Computation.
Bull. EATCS, 2007
ZeroOne Laws: Thesauri and Parametric Conditions.
Bull. EATCS, 2007
2006
ACM Trans. Comput. Log., 2006
Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 2006
2005
J. Math. Log., 2005
Explicit Graphs with Extension Properties.
Bull. EATCS, 2005
Electron. J. Comb., 2005
Proceedings of the Foundations of Genetic Algorithms, 8th International Workshop, 2005
Proceedings of the Formal Approaches to Software Testing, 5th International Workshop, 2005
2004
Why Sets? (Column: Logic in Computer Science).
Bull. EATCS, 2004
2003
ACM Trans. Comput. Log., 2003
Math. Log. Q., 2003
J. Symb. Log., 2003
Algorithms: A Quest for Absolute Definitions.
Bull. EATCS, 2003
Electron. J. Comb., 2003
2002
J. Symb. Log., 2002
Inf. Comput., 2002
Algorithms vs. Machines.
Bull. EATCS, 2002
Pairwise Testing.
Bull. EATCS, 2002
2001
ACM Trans. Comput. Log., 2001
Addendum to "Choiceless Polynomial Time": Ann. Pure Appl. Logic 100 (1999) 141187.
Ann. Pure Appl. Log., 2001
Ann. Pure Appl. Log., 2001
The Underlying Logic of Hoare Logic.
Proceedings of the Current Trends in Theoretical Computer Science, 2001
2000
J. Symb. Log., 2000
The Underlying Logic of Hoare Logic.
Bull. EATCS, 2000
A New ZeroOne Law and Strong Extension Axioms.
Bull. EATCS, 2000
Proceedings of the Computer Science Logic, 2000
Proceedings of the Computer Science Logic, 2000
Proceedings of the Abstract State Machines, 2000
1999
J. Symb. Log., 1999
Ann. Pure Appl. Log., 1999
1998
Inf. Process. Lett., 1998
1997
J. Univers. Comput. Sci., 1997
Log. J. IGPL, 1997
1995
SIAM J. Comput., 1995
J. Symb. Log., 1995
1994
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
1993
Proceedings of the Current Trends in Theoretical Computer Science  Essays and Tutorials, 1993
SIAM J. Comput., 1993
Proceedings of the Computer Science Logic, 7th Workshop, 1993
1992
Diverse Homogeneous Sets.
J. Comb. Theory, Ser. A, 1992
Ann. Pure Appl. Log., 1992
Ann. Pure Appl. Log., 1992
1990
J. Symb. Log., 1990
Arch. Math. Log., 1990
Proceedings of the Computer Science Logic, 4th Workshop, 1990
1989
Notre Dame J. Formal Log., 1989
J. Symb. Log., 1989
Inf. Process. Lett., 1989
1988
Logic in Computer Ccience Column, guest authors.
Bull. EATCS, 1988
Ann. Pure Appl. Log., 1988
1987
There may be simple Paleph<sub>1</sub> and Paleph<sub>2</sub>points and the RudinKeisler ordering may be downward directed.
Ann. Pure Appl. Log., 1987
Proceedings of the Computation Theory and Logic, In Memory of Dieter Rödding, 1987
1986
Notre Dame J. Formal Log., 1986
J. Symb. Log., 1986
J. Symb. Log., 1986
J. Graph Theory, 1986
Ann. Pure Appl. Log., 1986
1985
J. Symb. Log., 1985
Inf. Control., 1985
1984
SIAM J. Comput., 1984
J. Symb. Log., 1984
1982
Inf. Control., 1982
1981
J. Symb. Log., 1981
J. Symb. Log., 1981
J. Graph Theory, 1981
1980
J. Comb. Theory, Ser. B, 1980
Arch. Math. Log., 1980
1979
J. Graph Theory, 1979
1978
J. Graph Theory, 1978
1977
J. Symb. Log., 1977
J. Symb. Log., 1977
1974
J. Symb. Log., 1974
J. Symb. Log., 1974
1972
J. Symb. Log., 1972
J. Symb. Log., 1972
J. Symb. Log., 1972
Discret. Math., 1972