David Richerby
Impact in
- Statistics and Probability top 5%
- Markov Chains and Monte Carlo Methods
-
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Graph Labeling and Dimension Problems
Papers in
-
- Advanced Graph Theory Research 16
- Complexity and Algorithms in Graphs 10
- Graph Labeling and Dimension Problems 4
-
- Bayesian Modeling and Causal Inference 4
- Co-authors
- Martin Dyer (9 shared papers)Leslie Ann Goldberg (16 shared papers)Markus Jalsenius (4 shared papers)Dimitrios M. Thilikos (2 shared papers)Marı́a Serna (4 shared papers)Josep Dı́az (4 shared papers)Anuj Dawar (2 shared papers)Mark Jerrum (4 shared papers)
- Journals
- Theoretical Computer Science (3 papers)Journal of Computer and System Sciences (2 papers)SIAM Journal on Computing (2 papers)SIAM Journal on Discrete Mathematics (2 papers)Annals of Pure and Applied Logic (1 paper)
- Partner nations
- United KingdomUnited StatesSpain
In The Last Decade
David Richerby
25 papers receiving 186 citations
Peers
Comparison fields: 5 of 28
- Statistics and Probability 78
- Computational Theory and Mathematics 137
- Discrete Mathematics and Combinatorics 27
- Computational Mathematics 5
- Geometry and Topology 19
Countries citing papers authored by David Richerby
This map shows the geographic impact of David Richerby'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 David Richerby with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites David Richerby more than expected).
Fields of papers citing papers by David Richerby
This network shows the impact of papers produced by David Richerby. 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 David Richerby. The network helps show where David Richerby may publish in the future.
Co-authors
The 20 scholars most cited alongside David Richerby, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 28 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2013 | 34 | |
| 2 | 2010 | 24 | |
| 3 | 2011 | 23 | |
| 4 | 2012 | 21 | |
| 5 | 2009 | 20 | |
| 6 | 2008 | 11 | |
| 7 | 2011 | 10 | |
| 8 | 2009 | 9 | |
| 9 | Approximating Fixation Probabilities in the Generalized Moran Process | 2012 | 8 |
| 10 | 2010 | 7 | |
| 11 | 2020 | 5 | |
| 12 | 2014 | 5 | |
| 13 | 2012 | 5 | |
| 14 | 2020 | 4 | |
| 15 | 2011 | 3 | |
| 16 | 2005 | 3 | |
| 17 | 2012 | 3 | |
| 18 | 2017 | 2 | |
| 19 | 2014 | 2 | |
| 20 | 2014 | 1 |
About David Richerby
David Richerby is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Computer Networks and Communications, Mathematical Physics and Geometry and Topology, having authored 28 papers that have together received 205 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (16 papers), Complexity and Algorithms in Graphs (10 papers), Stochastic processes and statistical mechanics (4 papers), Bayesian Modeling and Causal Inference (4 papers), Graph Labeling and Dimension Problems (4 papers), Graph Theory and Algorithms (4 papers), Complex Network Analysis Techniques (4 papers) and Graph theory and applications (3 papers). The work is most often cited by research in Statistics and Probability (78 citations), Computational Theory and Mathematics (137 citations), Discrete Mathematics and Combinatorics (27 citations), Computational Mathematics (5 citations) and Geometry and Topology (19 citations). David Richerby has collaborated with scholars based in United Kingdom, United States and Spain. Frequent co-authors include Martin Dyer, Leslie Ann Goldberg, Markus Jalsenius, Dimitrios M. Thilikos, Marı́a Serna, Josep Dı́az, Anuj Dawar, Mark Jerrum, Paul G. Spirakis and George B. Mertzios. Their work appears in journals such as Theoretical Computer Science, Journal of Computer and System Sciences, SIAM Journal on Computing, SIAM Journal on Discrete Mathematics and Annals of Pure and Applied Logic.
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.