| Publication | Date of Publication | Type |
|---|
Cover time in edge-uniform stochastically-evolving graphs
Lecture Notes in Computer Science | 2022-11-04 | Paper |
Maximum rooted connected expansion
(available as arXiv preprint) | 2021-08-04 | Paper |
Maximum rooted connected expansion
Theoretical Computer Science | 2021-06-22 | Paper |
Fast two-robot disk evacuation with wireless communication
Theoretical Computer Science | 2020-11-06 | Paper |
The Match-Maker: Constant-Space Distributed Majority via Random Walks
Lecture Notes in Computer Science | 2020-01-14 | Paper |
Cover time in edge-uniform stochastically-evolving graphs
Algorithms | 2020-01-13 | Paper |
Eternally dominating large grids
Theoretical Computer Science | 2019-10-16 | Paper |
Communication and location discovery in geometric ring networks
Information and Computation | 2019-05-02 | Paper |
Fast two-robot disk evacuation with wireless communication
Lecture Notes in Computer Science | 2018-08-16 | Paper |
| Deterministic population protocols for exact majority and plurality | 2018-07-18 | Paper |
Perpetually dominating large grids
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Geometric computations by broadcasting automata
Natural Computing | 2016-03-09 | Paper |
Group search on the line
Lecture Notes in Computer Science | 2015-02-20 | Paper |
Evacuating robots via unknown exit in a disk
Lecture Notes in Computer Science | 2015-02-10 | Paper |
| Exact counting of Euler Tours for Graphs of Bounded Treewidth | 2013-10-01 | Paper |
Observe and remain silent (communication-less agent location discovery)
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
The complexity of approximately counting stable roommate assignments
Journal of Computer and System Sciences | 2012-08-17 | Paper |
More efficient periodic traversal in anonymous undirected graphs
Theoretical Computer Science | 2012-08-10 | Paper |
The complexity of approximately counting stable matchings
Theoretical Computer Science | 2012-08-08 | Paper |
Exact counting of Euler tours for generalized series-parallel graphs
Journal of Discrete Algorithms | 2012-05-11 | Paper |
Synchronous rendezvous for location-aware agents
Lecture Notes in Computer Science | 2011-10-28 | Paper |
Geometric computations by broadcasting automata on the integer grid
Lecture Notes in Computer Science | 2011-06-17 | Paper |
The Complexity of Approximately Counting Stable Matchings
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
Distributed selfish load balancing
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Markov chain comparison
Probability Surveys | 2010-06-29 | Paper |
Markov chain comparison
Probability Surveys | 2010-06-29 | Paper |
More efficient periodic traversal in anonymous undirected graphs
Structural Information and Communication Complexity | 2010-02-24 | Paper |
On weighted balls-into-bins games
Theoretical Computer Science | 2009-01-08 | Paper |
Distributed Selfish Load Balancing
SIAM Journal on Computing | 2008-08-14 | Paper |
Distributed Selfish Load Balancing
SIAM Journal on Computing | 2008-08-14 | Paper |
Fast periodic graph exploration with constant memory
Journal of Computer and System Sciences | 2008-06-26 | Paper |
On the stability of dynamic diffusion load balancing
Algorithmica | 2008-04-03 | Paper |
Fast Periodic Graph Exploration with Constant Memory
Structural Information and Communication Complexity | 2007-11-15 | Paper |
Improved Mixing Bounds for the Anti-Ferromagnetic Potts Model on Z2
LMS Journal of Computation and Mathematics | 2007-04-04 | Paper |
Improved Mixing Bounds for the Anti-Ferromagnetic Potts Model on Z2
LMS Journal of Computation and Mathematics | 2007-04-04 | Paper |
Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows
SIAM Journal on Computing | 2007-03-27 | Paper |
Utilitarian resource assignment
Journal of Discrete Algorithms | 2007-02-14 | Paper |
Disjoint Decomposition of Markov Chains and Sampling Circuits in Cayley Graphs
Combinatorics, Probability and Computing | 2006-07-06 | Paper |
Strong Spatial Mixing with Fewer Colors for Lattice Graphs
SIAM Journal on Computing | 2006-06-01 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
STACS 2005
Lecture Notes in Computer Science | 2005-12-02 | Paper |
Random sampling of 3‐colorings in ℤ2
Random Structures & Algorithms | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 1418277 (Why is no real title available?) | 2000-07-19 | Paper |
| scientific article; zbMATH DE number 841601 (Why is no real title available?) | 1996-02-06 | Paper |
| scientific article; zbMATH DE number 496022 (Why is no real title available?) | 1994-09-11 | Paper |
