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.
Random generation of combinatorial structures from a uniform distribution
1986479 citationsMark Jerrum, Leslie G. Valiant et al.Theoretical Computer Scienceprofile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
This map shows the geographic impact of Mark Jerrum'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 Mark Jerrum with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Mark Jerrum more than expected).
This network shows the impact of papers produced by Mark Jerrum. 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 Mark Jerrum. The network helps show where Mark Jerrum may publish in the future.
Co-authorship network of co-authors of Mark Jerrum
This figure shows the co-authorship network connecting the top 25 collaborators of Mark Jerrum.
A scholar is included among the top collaborators of Mark Jerrum 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 Mark Jerrum. Mark Jerrum is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Jerrum, Mark, et al.. (2015). . Theory of Computing. 11(1). 35–57.1 indexed citations
6.
Cai, Jin‐Yi, Leslie Ann Goldberg, Heng Guo, & Mark Jerrum. (2013). Approximating the Partition Function of Two-Spin Systems on Bipartite Graphs.. arXiv (Cornell University).1 indexed citations
7.
Jerrum, Mark, et al.. (2013). The Parameterised Complexity of Counting Connected Subgraphs.. arXiv (Cornell University).1 indexed citations
Bulatov, Andreĭ A., Martin Dyer, Leslie Ann Goldberg, et al.. (2011). The complexity of weighted and unweighted #CSP. Journal of Computer and System Sciences. 78(2). 681–688.22 indexed citations
Goldberg, Leslie Ann & Mark Jerrum. (1997). Randomly sampling molecules. Symposium on Discrete Algorithms. 183–192.1 indexed citations
12.
Jerrum, Mark & Alistair Sinclair. (1996). The Markov chain Monte Carlo method: an approach to approximate counting and integration. 482–520.292 indexed citations
13.
Jerrum, Mark. (1993). An analysis of a Monte Carlo algorithm for estimating the permanent.. OpenGrey (Institut de l'Information Scientifique et Technique). 171–182.7 indexed citations
14.
Jerrum, Mark & Alistair Sinclair. (1990). Polynomial-Time Approximation Algorithms for Ising Model (Extended Abstract). International Colloquium on Automata, Languages and Programming. 462–475.5 indexed citations
Jerrum, Mark. (1985). Random Generation of Combinatorial Structures from a Uniform Distribution (Extended Abstract). International Colloquium on Automata, Languages and Programming. 290–299.3 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.