Distributed selfish load balancing P Berenbrink, T Friedetzky, LA Goldberg, P Goldberg, Z Hu, RA Martin Proc. of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA …, 0 | 140* | |
Markov chain comparison M Dyer, LA Goldberg, M Jerrum, R Martin | 80 | 2006 |
Evacuating robots via unknown exit in a disk J Czyzowicz, L Gąsieniec, T Gorry, E Kranakis, R Martin, D Pajak International Symposium on Distributed Computing, 122-136, 2014 | 78 | 2014 |
Group search on the line M Chrobak, L Gąsieniec, T Gorry, R Martin International conference on current trends in theory and practice of …, 2015 | 75 | 2015 |
On weighted balls-into-bins games P Berenbrink, T Friedetzky, Z Hu, R Martin Theoretical Computer Science 409 (3), 511-520, 2008 | 75 | 2008 |
Sampling adsorbing staircase walks using a new Markov chain decomposition method RA Martin, D Randall Proceedings 41st Annual Symposium on Foundations of Computer Science, 492-502, 2000 | 71 | 2000 |
Rapidly mixing Markov chains for sampling contingency tables with a constant number of rows M Cryan, M Dyer, LA Goldberg, M Jerrum, R Martin SIAM Journal on Computing 36 (1), 247-278, 2006 | 65 | 2006 |
Strong spatial mixing with fewer colors for lattice graphs LA Goldberg, R Martin, M Paterson SIAM Journal on Computing 35 (2), 486-517, 2005 | 60 | 2005 |
Optimal patrolling of fragmented boundaries A Collins, J Czyzowicz, L Gasieniec, A Kosowski, E Kranakis, D Krizanc, ... Proceedings of the twenty-fifth annual ACM symposium on Parallelism in …, 2013 | 51 | 2013 |
Fast periodic graph exploration with constant memory L Gąsieniec, R Klasing, R Martin, A Navarra, X Zhang Journal of Computer and System Sciences 74 (5), 808-822, 2008 | 48 | 2008 |
Random sampling of 3‐colorings in ℤ2 LA Goldberg, R Martin, M Paterson Random Structures & Algorithms 24 (3), 279-302, 2004 | 40 | 2004 |
Synchronous rendezvous for location-aware agents A Collins, J Czyzowicz, L Gąsieniec, A Kosowski, R Martin International Symposium on Distributed Computing, 447-459, 2011 | 33 | 2011 |
More efficient periodic traversal in anonymous undirected graphs J Czyzowicz, S Dobrev, L Gąsieniec, D Ilcinkas, J Jansson, R Klasing, ... Theoretical Computer Science 444, 60-76, 2012 | 29 | 2012 |
Deterministic population protocols for exact majority and plurality L Gasieniec, D Hamilton, R Martin, PG Spirakis, G Stachowiak 20th International Conference on Principles of Distributed Systems (OPODIS 2016), 2017 | 27 | 2017 |
Fast two-robot disk evacuation with wireless communication I Lamprou, R Martin, S Schewe International Symposium on Distributed Computing, 1-15, 2016 | 27* | 2016 |
Strong spatial mixing for lattice graphs with fewer colours LA Goldberg, R Martin, M Paterson 45th Annual IEEE Symposium on Foundations of Computer Science, 562-571, 2004 | 27 | 2004 |
REVERSE ENGINEEING OF WEB APPLICATIONS: A TECHNICAL REVIEW R Patel, F Coenen, R Martin, L Archer | 26* | 2007 |
Disjoint decomposition of Markov chains and sampling circuits in Cayley graphs R Martin, D Randall Combinatorics Probability and Computing 15 (3), 411-448, 2006 | 26 | 2006 |
The complexity of approximately counting stable matchings P Chebolu, LA Goldberg, R Martin Theoretical Computer Science 437, 35-68, 2012 | 25 | 2012 |
Utilitarian resource assignment P Berenbrink, LA Goldberg, PW Goldberg, R Martin Journal of Discrete Algorithms 4 (4), 567-587, 2006 | 22 | 2006 |