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.
QuickCheck
2011382 citationsKoen Claessen, John HughesACM SIGPLAN Noticesprofile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
This map shows the geographic impact of Koen Claessen'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 Koen Claessen with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Koen Claessen more than expected).
This network shows the impact of papers produced by Koen Claessen. 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 Koen Claessen. The network helps show where Koen Claessen may publish in the future.
Co-authorship network of co-authors of Koen Claessen
This figure shows the co-authorship network connecting the top 25 collaborators of Koen Claessen.
A scholar is included among the top collaborators of Koen Claessen 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 Koen Claessen. Koen Claessen is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Claessen, Koen, Viktor Kunčak, & Barbara Jobstmann. (2014). Proceedings of the 14th Conference on Formal Methods in Computer-Aided Design.1 indexed citations
7.
Claessen, Koen & Niklas Sörensson. (2012). A liveness checking algorithm that counts. 52–59.26 indexed citations
8.
Claessen, Koen. (2011). Proceedings of the 4th ACM symposium on Haskell.2 indexed citations
Claessen, Koen, et al.. (2010). GPGPU Kernel Implementation using an Embedded Language: a Status Report. Chalmers Publication Library (Chalmers University of Technology).2 indexed citations
Jones, Simon Peyton, et al.. (2009). Static contract checking for Haskell. Chalmers Research (Chalmers University of Technology). 41–52.63 indexed citations
13.
Claessen, Koen, Niklas Eén, Mary Sheeran, & Niklas Sörensson. (2008). SAT-solving in practice. Chalmers Research (Chalmers University of Technology). 61–67.20 indexed citations
Axelsson, Emil, Mary Sheeran, & Koen Claessen. (2004). Wired - a Language for Describing Non-Functional Properties of Digital Circuits. Chalmers Publication Library (Chalmers University of Technology).
16.
Claessen, Koen, Colin Runciman, Olaf Chitil, John Hughes, & Malcolm Wallace. (2003). Testing and tracing lazy functional programs using Quickcheck and Hat.4 indexed citations
Claessen, Koen. (1997). Graphs in Compilation.. 309.
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.