Russell Martin
Title
Cited by
Cited by
Year
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
125*
Markov chain comparison
M Dyer, LA Goldberg, M Jerrum, R Martin
Probability Surveys 3, 89-111, 2006
622006
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
612006
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
522000
On weighted balls-into-bins games
P Berenbrink, T Friedetzky, Z Hu, R Martin
Theoretical Computer Science 409 (3), 511-520, 2008
482008
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
402014
Strong spatial mixing with fewer colors for lattice graphs
LA Goldberg, R Martin, M Paterson
SIAM Journal on Computing 35 (2), 486-517, 2005
402005
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
382015
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
382008
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
382008
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
362013
Random sampling of 3‐colorings in ℤ2
LA Goldberg, R Martin, M Paterson
Random Structures & Algorithms 24 (3), 279-302, 2004
352004
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
242004
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
232012
Utilitarian resource assignment
P Berenbrink, LA Goldberg, PW Goldberg, R Martin
Journal of Discrete Algorithms 4 (4), 567-587, 2006
222006
REVERSE ENGINEEING OF WEB APPLICATIONS: A TECHNICAL REVIEW
R Patel, F Coenen, R Martin, L Archer
21*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
202006
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
192011
The complexity of approximately counting stable matchings
P Chebolu, LA Goldberg, R Martin
Theoretical Computer Science 437, 35-68, 2012
172012
Exact counting of Euler tours for generalized series-parallel graphs
P Chebolu, M Cryan, R Martin
Journal of Discrete Algorithms 10, 110-122, 2012
162012
The system can't perform the operation now. Try again later.
Articles 1–20