The following pages link to Russell Martin (Q256429):
Displaying 39 items.
- Geometric computations by broadcasting automata (Q256432) (← links)
- Exact counting of Euler tours for generalized series-parallel graphs (Q414430) (← links)
- The complexity of approximately counting stable roommate assignments (Q440007) (← links)
- The complexity of approximately counting stable matchings (Q441846) (← links)
- More efficient periodic traversal in anonymous undirected graphs (Q442265) (← links)
- Utilitarian resource assignment (Q866544) (← links)
- Fast periodic graph exploration with constant memory (Q931724) (← links)
- Markov chain comparison (Q980750) (← links)
- Communication and location discovery in geometric ring networks (Q1740645) (← links)
- Maximum rooted connected expansion (Q2034397) (← links)
- Cover time in edge-uniform stochastically-evolving graphs (Q2283819) (← links)
- Eternally dominating large grids (Q2328863) (← links)
- On weighted balls-into-bins games (Q2378532) (← links)
- On the stability of dynamic diffusion load balancing (Q2479533) (← links)
- Observe and Remain Silent (Communication-Less Agent Location Discovery) (Q2912740) (← links)
- Geometric Computations by Broadcasting Automata on the Integer Grid (Q3007711) (← links)
- Synchronous Rendezvous for Location-Aware Agents (Q3095348) (← links)
- Deterministic Population Protocols for Exact Majority and Plurality. (Q3174938) (← links)
- More Efficient Periodic Traversal in Anonymous Undirected Graphs (Q3408168) (← links)
- Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows (Q3427745) (← links)
- Improved Mixing Bounds for the Anti-Ferromagnetic Potts Model on <b>Z</b><sup>2</sup> (Q3430817) (← links)
- Distributed Selfish Load Balancing (Q3519392) (← links)
- Distributed selfish load balancing (Q3581536) (← links)
- The Complexity of Approximately Counting Stable Matchings (Q3588401) (← links)
- (Q4277670) (← links)
- Random sampling of 3‐colorings in ℤ<sup>2</sup> (Q4736775) (← links)
- (Q4863448) (← links)
- (Q4941837) (← links)
- (Q5005125) (← links)
- Cover Time in Edge-Uniform Stochastically-Evolving Graphs (Q5045453) (← links)
- Group Search on the Line (Q5175102) (← links)
- The Match-Maker: Constant-Space Distributed Majority via Random Walks (Q5207899) (← links)
- Fast Periodic Graph Exploration with Constant Memory (Q5425957) (← links)
- Strong Spatial Mixing with Fewer Colors for Lattice Graphs (Q5470700) (← links)
- Disjoint Decomposition of Markov Chains and Sampling Circuits in Cayley Graphs (Q5479034) (← links)
- Evacuating Robots via Unknown Exit in a Disk (Q5498697) (← links)
- STACS 2005 (Q5710677) (← links)
- Automata, Languages and Programming (Q5716762) (← links)
- Fast two-robot disk evacuation with wireless communication (Q5915701) (← links)
