Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
This map shows the geographic impact of Andreas Blass's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Andreas Blass with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Andreas Blass more than expected).
This network shows the impact of papers produced by Andreas Blass. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Andreas Blass. The network helps show where Andreas Blass may publish in the future.
Co-authorship network of co-authors of Andreas Blass
This figure shows the co-authorship network connecting the top 25 collaborators of Andreas Blass.
A scholar is included among the top collaborators of Andreas Blass based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Andreas Blass. Andreas Blass is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Blass, Andreas & Yuri Gurevich. (2013). Hilbertian Deductive Systems, Infon Logic, and Datalog. Bulletin of the European Association for Theoretical Computer Science. 3(102). 122–150.1 indexed citations
2.
Blass, Andreas, et al.. (2010). The Tower-of-Babel Problem, and Security Assesment Sharing. Bulletin of the European Association for Theoretical Computer Science. 101(101). 161–182.1 indexed citations
3.
Blass, Andreas & Yuri Gurevich. (2007). Zero-One Laws: Thesauri and Parametric Conditions.. Bulletin of the European Association for Theoretical Computer Science. 91. 125–144.1 indexed citations
4.
Blass, Andreas. (2005). SOME QUESTIONS ARISING FROM HINDMAN'S THEOREM. Scientiae mathematicae Japonicae. 62(2). 331–334.6 indexed citations
5.
Blass, Andreas & Benjamin Rossman. (2005). Explicit Graphs with Extension Properties.. Bulletin of the European Association for Theoretical Computer Science. 86. 166–175.6 indexed citations
Blass, Andreas & Yuri Gurevich. (2000). The Underlying Logic of Hoare Logic.. Bulletin of the European Association for Theoretical Computer Science. 70. 409–111.3 indexed citations
8.
Blass, Andreas. (1996). Propositional connectives and the set theory of the continuum. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 9(1). 25–30.2 indexed citations
9.
Blass, Andreas & Yuri Gurevich. (1994). Evolving Algebras and Linear Time Hierarchy.. IFIP Congress. 383–390.2 indexed citations
Blass, Andreas. (1973). Determinateness and Continuity. Proceedings of the American Mathematical Society. 37(2). 572–572.2 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.