Russell Martin

Orcid: 0000-0002-7043-503X

Affiliations:
  • University of Liverpool


According to our database1, Russell Martin authored at least 42 papers between 1999 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Maximum rooted connected expansion.
Theor. Comput. Sci., 2021

2020
Fast two-robot disk evacuation with wireless communication.
Theor. Comput. Sci., 2020

2019
Eternally dominating large grids.
Theor. Comput. Sci., 2019

Communication and location discovery in geometric ring networks.
Inf. Comput., 2019

2018
Cover Time in Edge-Uniform Stochastically-Evolving Graphs.
Algorithms, 2018

2017
Bounding the Cover Time in Edge-Uniform Stochastic Graphs.
CoRR, 2017

Perpetually Dominating Large Grids.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016
Banded Pattern Mining Algorithms in Multi-dimensional Zero-One Data.
Trans. Large Scale Data Knowl. Centered Syst., 2016

Deterministic Population Protocols for Exact Majority and Plurality.
Proceedings of the 20th International Conference on Principles of Distributed Systems, 2016

2015
Fundamentals of Computation Theory.
Theor. Comput. Sci., 2015

The Match-Maker: Constant-Space Distributed Majority via Random Walks.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2015

Group Search on the Line.
Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

Deterministic Symmetry Breaking in Ring Networks.
Proceedings of the 35th IEEE International Conference on Distributed Computing Systems, 2015

Finding Banded Patterns in Data: The Banded Pattern Mining Algorithm.
Proceedings of the Big Data Analytics and Knowledge Discovery, 2015

Finding banded patterns in big data using sampling.
Proceedings of the 2015 IEEE International Conference on Big Data (IEEE BigData 2015), Santa Clara, CA, USA, October 29, 2015

2014
Evacuating Robots via Unknown Exit in a Disk.
Proceedings of the Distributed Computing - 28th International Symposium, 2014

A Novel Approach for Identifying Banded Patterns in Zero-One Data Using Column and Row Banding Scores.
Proceedings of the Machine Learning and Data Mining in Pattern Recognition, 2014

A Scalable Algorithm for Banded Pattern Mining in Multi-dimensional Zero-One Data.
Proceedings of the Data Warehousing and Knowledge Discovery, 2014

2013
Exact counting of Euler Tours for Graphs of Bounded Treewidth.
CoRR, 2013

Optimal patrolling of fragmented boundaries.
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

2012
More efficient periodic traversal in anonymous undirected graphs.
Theor. Comput. Sci., 2012

The complexity of approximately counting stable matchings.
Theor. Comput. Sci., 2012

Geometric computations by broadcasting automata.
Nat. Comput., 2012

Exact counting of Euler tours for generalized series-parallel graphs.
J. Discrete Algorithms, 2012

The complexity of approximately counting stable roommate assignments.
J. Comput. Syst. Sci., 2012

Observe and Remain Silent (Communication-Less Agent Location Discovery).
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

2011
Synchronous Rendezvous for Location-Aware Agents.
Proceedings of the Distributed Computing - 25th International Symposium, 2011

Geometric Computations by Broadcasting Automata on the Integer Grid.
Proceedings of the Unconventional Computation - 10th International Conference, 2011

2008
On weighted balls-into-bins games.
Theor. Comput. Sci., 2008

Fast periodic graph exploration with constant memory.
J. Comput. Syst. Sci., 2008

On the Stability of Dynamic Diffusion Load Balancing.
Algorithmica, 2008

2007
Distributed Selfish Load Balancing.
SIAM J. Comput., 2007

2006
Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows.
SIAM J. Comput., 2006

Improved Mixing Bounds for the Anti-Ferromagnetic Potts Model on Z<sup>2</sup>.
LMS J. Comput. Math., 2006

Utilitarian resource assignment.
J. Discrete Algorithms, 2006

Disjoint Decomposition of Markov Chains and Sampling Circuits in Cayley Graphs.
Comb. Probab. Comput., 2006

2005
Strong Spatial Mixing with Fewer Colors for Lattice Graphs.
SIAM J. Comput., 2005

Dynamic Diffusion Load Balancing.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2004
Random sampling of 3-colorings in Z<sup>2</sup>.
Random Struct. Algorithms, 2004

trong Spatial Mixing for Lattice Graphs with Fewer Colours.
Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004

2000
Sampling Adsorbing Staircase Walks Using a New Markov Chain Decomposition Method.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999
Pfaffian Algorithms for Sampling Routings on Regions with Free Boundary Conditions.
Proceedings of the Randomization, 1999


  Loading...