Andreas Blass - RankMe

150 papers A* 1A 1B 6Journal 119Unranked 15

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Primal Logic of Information. ACM Trans. Comput. Log. Yuri Gurevich, Andreas Blass
2024	J	`jnl`	Exact Exploration. CoRR Andreas Blass, Nachum Dershowitz, Yuri Gurevich
2024	J	`jnl`	On logic and generative AI. CoRR Yuri Gurevich, Andreas Blass
2024	J	`jnl`	On logic and generative AI. Bull. EATCS Yuri Gurevich, Andreas Blass
2024	J	`jnl`	What are kets? CoRR Yuri Gurevich, Andreas Blass
2023	J	`jnl`	Primal logic of information. CoRR Yuri Gurevich, Andreas Blass
2023	J	`jnl`	Software science view on quantum circuit algorithms. Inf. Comput. Yuri Gurevich, Andreas Blass
2023	J	`jnl`	What are kets? Bull. EATCS Yuri Gurevich, Andreas Blass
2022	J	`jnl`	Quantum circuits with classical channels and the principle of deferred measurements. Theor. Comput. Sci. Yuri Gurevich, Andreas Blass
2022	J	`jnl`	Software science view on quantum circuit algorithms. CoRR Yuri Gurevich, Andreas Blass
2022	J	`jnl`	Wigner's quasidistribution and Dirac's kets. CoRR Andreas Blass, Yuri Gurevich, Alexander Volberg
2022	J	`jnl`	Wigner's quasidistribution and Dirac's kets. Bull. EATCS Andreas Blass, Yuri Gurevich, Alexander Volberg
2021	J	`jnl`	Quantum circuits with classical channels and the principle of deferred measurements. CoRR Yuri Gurevich, Andreas Blass
2021	J	`jnl`	Simple circuit simulations of classical and quantum Turing machines. CoRR Yuri Gurevich, Andreas Blass
2020	J	`jnl`	Braided distributivity. Theor. Comput. Sci. Andreas Blass, Yuri Gurevich
2020	J	`jnl`	Circuits: An abstract viewpoint. CoRR Andreas Blass, Yuri Gurevich
2020	J	`jnl`	Circuits: An abstract viewpoint. Bull. EATCS Andreas Blass, Yuri Gurevich
2020	—	`ed.`	Fields of Logic and Computation III - Essays Dedicated to Yuri Gurevich on the Occasion of His 80th Birthday Fields of Logic and Computation III Andreas Blass, Patrick Cégielski, Nachum Dershowitz, Manfred Droste, Bernd Finkbeiner
2020	—	`conf`	Functional Thesauri, Classifying Topoi, Unification, and Flatness. Fields of Logic and Computation III Andreas Blass
2020	J	`jnl`	Negative probabilities: What they are and what they are for. CoRR Andreas Blass, Yuri Gurevich
2020	J	`jnl`	Witness algebra and anyon braiding. Math. Struct. Comput. Sci. Andreas Blass, Yuri Gurevich
2019	J	`jnl`	Circuit pedantry. CoRR Andreas Blass, Yuri Gurevich
2019	J	`jnl`	Circuit pedantry. Bull. EATCS Andreas Blass, Yuri Gurevich
2018	J	`jnl`	An Invitation to Quantum Computing. Bull. EATCS Andreas Blass, Yuri Gurevich
2018	J	`jnl`	Coherence for braided distributivity. CoRR Andreas Blass, Yuri Gurevich
2018	J	`jnl`	Negative probabilities, II What they are and what they are for. Bull. EATCS Andreas Blass, Yuri Gurevich
2018	J	`jnl`	Who needs category theory? CoRR Andreas Blass, Yuri Gurevich
2018	J	`jnl`	Who needs category theory? Bull. EATCS Andreas Blass, Yuri Gurevich
2018	J	`jnl`	Witness Algebra and Anyon Braiding. CoRR Andreas Blass, Yuri Gurevich
2017	—	`conf`	Common Denominator for Value and Expectation No-go Theorems: Extended Abstract. QPL Andreas Blass, Yuri Gurevich
2017	J	`jnl`	On the Rectilinear Steiner Problem. Bull. EATCS Andreas Blass, Yuri Gurevich
2016	—	`ch.`	Introduction to Secret-Sharing. Dependence Logic Andreas Blass
2016	—	`ch.`	On Quantum Computation, Anyons, and Categories. Martin Davis on Computability, Computational Logic, and Mathematical Foundations Andreas Blass, Yuri Gurevich
2016	J	`jnl`	Symbioses between mathematical logic and computer science. Ann. Pure Appl. Log. Andreas Blass
2015	—	`conf`	Existential Fixed-Point Logic as a Fragment of Second-Order Logic. Fields of Logic and Computation II Andreas Blass
2015	—	`ed.`	Fields of Logic and Computation II - Essays Dedicated to Yuri Gurevich on the Occasion of His 75th Birthday Fields of Logic and Computation II Lev D. Beklemishev, Andreas Blass, Nachum Dershowitz, Bernd Finkbeiner, Wolfram Schulte
2015	J	`jnl`	Negative Probability. Bull. EATCS Andreas Blass
2015	J	`jnl`	The Next Best Thing to a P-Point. J. Symb. Log. Andreas Blass, Natasha Dobrinen, Dilip Raghavan
2013	J	`jnl`	Abstract Hilbertian deductive systems, infon logic, and Datalog. Inf. Comput. Andreas Blass, Yuri Gurevich
2011	J	`jnl`	Persistent queries in the behavioral theory of algorithms. ACM Trans. Comput. Log. Andreas Blass, Yuri Gurevich
2011	—	`ch.`	Zero-One Laws: Thesauri and Parametric Conditions. Proof, Computation and Agency Andreas Blass, Yuri Gurevich
2010	J	`jnl`	Content-dependent chunking for differential compression, the local maximum approach. J. Comput. Syst. Sci. Nikolaj S. Bjørner, Andreas Blass, Yuri Gurevich
2010	—	`conf`	Evidential Authorization. The Future of Software Engineering Andreas Blass, Yuri Gurevich, Michal Moskal, Itay Neeman
2010	B	`conf`	Exact Exploration and Hanging Algorithms. CSL Andreas Blass, Nachum Dershowitz, Yuri Gurevich
2010	—	`conf`	Existential Fixed-Point Logic, Universal Quantifiers, and Topoi. Fields of Logic and Computation Andreas Blass
2010	—	`ed.`	Fields of Logic and Computation, Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday Fields of Logic and Computation Andreas Blass, Nachum Dershowitz, Wolfgang Reisig
2010	J	`jnl`	Hilbertian Deductive Systems, Infon Logic, and Datalog. Bull. EATCS Andreas Blass, Yuri Gurevich
2010	J	`jnl`	The Tower-of-Babel Problem, and Security Assesment Sharing. Bull. EATCS Andreas Blass, Yuri Gurevich, Efim Hudis
2010	—	`conf`	Yuri, Logic, and Computer Science. Fields of Logic and Computation Andreas Blass, Nachum Dershowitz, Wolfgang Reisig
2009	—	`conf`	Partitions and Permutation Groups. AMS-ASL Joint Special Session Andreas Blass
2009	J	`jnl`	Preface. Ann. Pure Appl. Log. Andreas Blass, Su Gao, Yi Zhang
2009	J	`jnl`	When are two algorithms the same? Bull. Symb. Log. Andreas Blass, Nachum Dershowitz, Yuri Gurevich
2008	J	`jnl`	Abstract state machines capture parallel algorithms: Correction and extension. ACM Trans. Comput. Log. Andreas Blass, Yuri Gurevich
2008	J	`jnl`	Modular difference logic is hard CoRR Nikolaj S. Bjørner, Andreas Blass, Yuri Gurevich, Madan Musuvathi
2008	B	`conf`	One Useful Logic That Defines Its Own Truth. MFCS Andreas Blass, Yuri Gurevich
2008	J	`jnl`	One useful logic that defines its own truth CoRR Andreas Blass, Yuri Gurevich
2008	J	`jnl`	Persistent Queries CoRR Andreas Blass, Yuri Gurevich
2008	J	`jnl`	Program termination and well partial orderings. ACM Trans. Comput. Log. Andreas Blass, Yuri Gurevich
2008	J	`jnl`	Two Forms of One Useful Logic: Existential Fixed Point Logic and Liberal Datalog CoRR Andreas Blass, Yuri Gurevich
2008	J	`jnl`	Two Forms of One Useful Logic: Existential Fixed Point Logic and Liberal Datalog. Bull. EATCS Andreas Blass, Yuri Gurevich
2008	J	`jnl`	When are two algorithms the same? CoRR Andreas Blass, Nachum Dershowitz, Yuri Gurevich
2008	—	`conf`	Why Sets? Pillars of Computer Science Andreas Blass, Yuri Gurevich
2007	J	`jnl`	Background of Computation. Bull. EATCS Andreas Blass, Yuri Gurevich
2007	J	`jnl`	Interactive Small-Step Algorithms I: Axiomatization CoRR Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman
2007	J	`jnl`	Interactive Small-Step Algorithms I: Axiomatization. Log. Methods Comput. Sci. Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman
2007	J	`jnl`	Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem CoRR Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman
2007	J	`jnl`	Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem. Log. Methods Comput. Sci. Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman
2007	J	`jnl`	Ordinary interactive small-step algorithms, II. ACM Trans. Comput. Log. Andreas Blass, Yuri Gurevich
2007	J	`jnl`	Ordinary interactive small-step algorithms, III. ACM Trans. Comput. Log. Andreas Blass, Yuri Gurevich
2007	J	`jnl`	Zero-One Laws: Thesauri and Parametric Conditions. Bull. EATCS Andreas Blass, Yuri Gurevich
2006	A*	`conf`	Adapting Logics. LICS Andreas Blass
2006	J	`jnl`	Ordinary interactive small-step algorithms, I. ACM Trans. Comput. Log. Andreas Blass, Yuri Gurevich
2005	J	`jnl`	Divisibility of Dedekind finite Sets. J. Math. Log. David Blair, Andreas Blass, Paul E. Howard
2005	J	`jnl`	Explicit Graphs with Extension Properties. Bull. EATCS Andreas Blass, Benjamin Rossman
2005	A	`conf`	NP-Completeness of Deciding Binary Genetic Encodability. FOGA Andreas Blass, Boris Mitavskiy
2005	—	`conf`	Play to Test. FATES Andreas Blass, Yuri Gurevich, Lev Nachmanson, Margus Veanes
2005	J	`jnl`	Random Orders and Gambler's Ruin. Electron. J. Comb. Andreas Blass, Gábor Braun
2004	J	`jnl`	Why Sets? (Column: Logic in Computer Science). Bull. EATCS Andreas Blass, Yuri Gurevich
2003	J	`jnl`	Abstract state machines capture parallel algorithms. ACM Trans. Comput. Log. Andreas Blass, Yuri Gurevich
2003	J	`jnl`	Algorithms: A Quest for Absolute Definitions. Bull. EATCS Andreas Blass, Yuri Gurevich
2003	J	`jnl`	Homotopy and Homology of Finite Lattices. Electron. J. Comb. Andreas Blass
2003	J	`jnl`	Sperner spaces and first-order logic. Math. Log. Q. Andreas Blass, Victor Pambuccian
2003	J	`jnl`	Strong extension axioms and Shelah's zero-one law for choiceless polynomial time. J. Symb. Log. Andreas Blass, Yuri Gurevich
2002	J	`jnl`	Abstract State Machines and Computationally Complete Query Languages. Inf. Comput. Andreas Blass, Yuri Gurevich, Jan Van den Bussche
2002	J	`jnl`	Algorithms vs. Machines. Bull. EATCS Andreas Blass, Yuri Gurevich
2002	J	`jnl`	On Polynomial Time Computation over Unordered Structures. J. Symb. Log. Andreas Blass, Yuri Gurevich, Saharon Shelah
2002	J	`jnl`	Pairwise Testing. Bull. EATCS Andreas Blass, Yuri Gurevich
2001	J	`jnl`	Addendum to "Choiceless Polynomial Time": Ann. Pure Appl. Logic 100 (1999) 141-187. Ann. Pure Appl. Log. Andreas Blass, Yuri Gurevich, Saharon Shelah
2001	J	`jnl`	Inadequacy of computable loop invariants. ACM Trans. Comput. Log. Andreas Blass, Yuri Gurevich
2001	J	`jnl`	Needed reals and recursion in generic reals. Ann. Pure Appl. Log. Andreas Blass
2001	—	`ch.`	The Underlying Logic of Hoare Logic. Current Trends in Theoretical Computer Science Andreas Blass, Yuri Gurevich
2000	J	`jnl`	A New Zero-One Law and Strong Extension Axioms. Bull. EATCS Andreas Blass, Yuri Gurevich
2000	—	`conf`	Abstract State Machines and Computationally Complete Query Languages. Abstract State Machines Andreas Blass, Yuri Gurevich, Jan Van den Bussche
2000	—	`conf`	Abstract State Machines and Pure Mathematics. Abstract State Machines Andreas Blass
2000	B	`conf`	Background, Reserve, and Gandy Machines. CSL Andreas Blass, Yuri Gurevich
2000	B	`conf`	Choiceless Polynominal Time Computation and the Zero-One Law. CSL Andreas Blass, Yuri Gurevich
2000	J	`jnl`	The Logic of Choice. J. Symb. Log. Andreas Blass, Yuri Gurevich
2000	J	`jnl`	The Underlying Logic of Hoare Logic. Bull. EATCS Andreas Blass, Yuri Gurevich
1999	J	`jnl`	Choiceless Polynomial Time. Ann. Pure Appl. Log. Andreas Blass, Yuri Gurevich, Saharon Shelah
1999	J	`jnl`	On The Confinality of Ultrapowers. J. Symb. Log. Andreas Blass, Heike Mildenberger
1998	J	`jnl`	A Variation on the Zero-One Law. Inf. Process. Lett. Andreas Blass, Yuri Gurevich, Vladik Kreinovich, Luc Longpré
1997	J	`jnl`	Some Semantical Aspects of Linear Logic. Log. J. IGPL Andreas Blass
1997	J	`jnl`	The Linear Time Hierarchy Theorems for Abstract State Machines and RAMs. J. Univers. Comput. Sci. Andreas Blass, Yuri Gurevich
1995	J	`jnl`	An Induction Principle and Pigeonhole Principles for K-Finite Sets. J. Symb. Log. Andreas Blass
1995	J	`jnl`	Matrix Transformation Is Complete for the Average Case. SIAM J. Comput. Andreas Blass, Yuri Gurevich
1994	—	`conf`	Evolving Algebras and Linear Time Hierarchy. IFIP Congress (1) Andreas Blass, Yuri Gurevich
1994	J	`jnl`	On exponentiation of G-sets. Discret. Math. Andreas Blass
1993	B	`conf`	Is Game Semantics Necessary? CSL Andreas Blass
1993	J	`jnl`	Randomizing Reductions of Search Problems. SIAM J. Comput. Andreas Blass, Yuri Gurevich
1993	—	`ch.`	Topoi and Computation. Current Trends in Theoretical Computer Science Andreas Blass
1992	J	`jnl`	A Game Semantics for Linear Logic. Ann. Pure Appl. Log. Andreas Blass
1992	J	`jnl`	Complete Topoi Representing Models of Set Theory. Ann. Pure Appl. Log. Andreas Blass, Andre Scedrov
1992	J	`jnl`	Diverse Homogeneous Sets. J. Comb. Theory A Andreas Blass, Paul Erdös, Alan D. Taylor
1991	—	`conf`	Randomizing Reductions of Search Problems. FSTTCS Andreas Blass, Yuri Gurevich
1990	J	`jnl`	Groupwise density and related cardinals. Arch. Math. Log. Andreas Blass
1990	J	`jnl`	Infinitary Combinatorics and Modal Logic. J. Symb. Log. Andreas Blass
1990	B	`conf`	On the Reduction Theory for Average Case Complexity. CSL Andreas Blass, Yuri Gurevich
1989	J	`jnl`	Consistency Results About Filters and the Number of Inequivalent Growth Types. J. Symb. Log. Andreas Blass, Claude Laflamme
1989	J	`jnl`	Near Coherence of Filters III: A Simplified Consistency Proof. Notre Dame J. Formal Log. Andreas Blass, Saharon Shelah
1989	J	`jnl`	On Matijasevitch's Nontraditional Approach to Search Problems. Inf. Process. Lett. Andreas Blass, Yuri Gurevich
1988	J	`jnl`	Logic in Computer Ccience Column, guest authors. Bull. EATCS Andreas Blass
1988	J	`jnl`	Selective ultrafilters and homogeneity. Ann. Pure Appl. Log. Andreas Blass
1987	—	`conf`	Existential Fixed-Point Logic. Computation Theory and Logic Andreas Blass, Yuri Gurevich
1987	J	`jnl`	There may be simple Paleph Ann. Pure Appl. Log. Andreas Blass, Saharon Shelah
1986	J	`jnl`	Bijective proofs of two broken circuit theorems. J. Graph Theory Andreas Blass, Bruce E. Sagan
1986	J	`jnl`	Henkin quantifiers and complete problems. Ann. Pure Appl. Log. Andreas Blass, Yuri Gurevich
1986	J	`jnl`	Meeting of the Association for Symbolic Logic: Chicago, 1985. J. Symb. Log. Andreas Blass, Louise Hay, Peter G. Hinman
1986	J	`jnl`	Near coherence of filters. I. Cofinal equivalence of models of arithmetic. Notre Dame J. Formal Log. Andreas Blass
1986	J	`jnl`	Small Decidable Sheaves. J. Symb. Log. Andreas Blass, Andre Scedrov
1985	J	`jnl`	A Zero-One Law for Logic with a Fixed-Point Operator Inf. Control. Andreas Blass, Yuri Gurevich, Dexter Kozen
1985	J	`jnl`	Acknowledgement of Priority. J. Symb. Log. Andreas Blass
1984	J	`jnl`	Equivalence Relations, Invariants, and Normal Forms. SIAM J. Comput. Andreas Blass, Yuri Gurevich
1984	J	`jnl`	There are not Exactly Five Objects. J. Symb. Log. Andreas Blass
1983	—	`conf`	Equivalence relations, invariants, and normal forms. Logic and Machines Andreas Blass, Yuri Gurevich
1982	J	`jnl`	On the Unique Satisfiability Problem Inf. Control. Andreas Blass, Yuri Gurevich
1981	J	`jnl`	Paley graphs satisfy all first-order adjacency axioms. J. Graph Theory Andreas Blass, Geoffrey Exoo, Frank Harary
1981	J	`jnl`	Some Initial Segments of the Rudin-Keisler Ordering. J. Symb. Log. Andreas Blass
1981	J	`jnl`	The Model of Set Theory Generated by Countably Many Generic Reals. J. Symb. Log. Andreas Blass
1980	J	`jnl`	Conservative extensions of models of arithmetic. Arch. Math. Log. Andreas Blass
1980	J	`jnl`	Which trees are link graphs? J. Comb. Theory B Andreas Blass, Frank Harary, Zevi Miller
1979	J	`jnl`	Properties of almost all graphs and complexes. J. Graph Theory Andreas Blass, Frank Harary
1978	J	`jnl`	Graphs with unique maximal clumpings. J. Graph Theory Andreas Blass
1977	J	`jnl`	Amalgamation of Nonstandard Models of Arithmetic. J. Symb. Log. Andreas Blass
1977	J	`jnl`	Ramsey's Theorem in the Hierarchy of Choice Principles. J. Symb. Log. Andreas Blass
1974	J	`jnl`	Cores of pi J. Symb. Log. Andreas Blass, Douglas A. Cenzer
1974	J	`jnl`	On Certain Types and Models for Arithmetic. J. Symb. Log. Andreas Blass
1972	J	`jnl`	Complexity of winning strategies. Discret. Math. Andreas Blass
1972	J	`jnl`	On the Inadequacy of Inner Models. J. Symb. Log. Andreas Blass
1972	J	`jnl`	The Intersection of Nonstandard Models of Arithmetic. J. Symb. Log. Andreas Blass
1972	J	`jnl`	Theories without Countable Models. J. Symb. Log. Andreas Blass