| Publication | Date of Publication | Type |
|---|
| Cover Time in Edge-Uniform Stochastically-Evolving Graphs | 2022-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5005125 | 2021-08-04 | Paper |
| Maximum rooted connected expansion | 2021-06-22 | Paper |
| Fast two-robot disk evacuation with wireless communication | 2020-11-06 | Paper |
| The Match-Maker: Constant-Space Distributed Majority via Random Walks | 2020-01-14 | Paper |
| Cover time in edge-uniform stochastically-evolving graphs | 2020-01-13 | Paper |
| Eternally dominating large grids | 2019-10-16 | Paper |
| Communication and location discovery in geometric ring networks | 2019-05-02 | Paper |
| Fast two-robot disk evacuation with wireless communication | 2018-08-16 | Paper |
| Deterministic Population Protocols for Exact Majority and Plurality. | 2018-07-18 | Paper |
| Eternally dominating large grids | 2017-07-21 | Paper |
| Geometric computations by broadcasting automata | 2016-03-09 | Paper |
| Group Search on the Line | 2015-02-20 | Paper |
| Evacuating Robots via Unknown Exit in a Disk | 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) | 2012-09-25 | Paper |
| The complexity of approximately counting stable roommate assignments | 2012-08-17 | Paper |
| More efficient periodic traversal in anonymous undirected graphs | 2012-08-10 | Paper |
| The complexity of approximately counting stable matchings | 2012-08-08 | Paper |
| Exact counting of Euler tours for generalized series-parallel graphs | 2012-05-11 | Paper |
| Synchronous Rendezvous for Location-Aware Agents | 2011-10-28 | Paper |
| Geometric Computations by Broadcasting Automata on the Integer Grid | 2011-06-17 | Paper |
| The Complexity of Approximately Counting Stable Matchings | 2010-09-10 | Paper |
| Distributed selfish load balancing | 2010-08-16 | Paper |
| Markov chain comparison | 2010-06-29 | Paper |
| More Efficient Periodic Traversal in Anonymous Undirected Graphs | 2010-02-24 | Paper |
| On weighted balls-into-bins games | 2009-01-08 | Paper |
| Distributed Selfish Load Balancing | 2008-08-14 | Paper |
| Fast periodic graph exploration with constant memory | 2008-06-26 | Paper |
| On the stability of dynamic diffusion load balancing | 2008-04-03 | Paper |
| Fast Periodic Graph Exploration with Constant Memory | 2007-11-15 | Paper |
| Improved Mixing Bounds for the Anti-Ferromagnetic Potts Model on Z2 | 2007-04-04 | Paper |
| Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows | 2007-03-27 | Paper |
| Utilitarian resource assignment | 2007-02-14 | Paper |
| Disjoint Decomposition of Markov Chains and Sampling Circuits in Cayley Graphs | 2006-07-06 | Paper |
| Strong Spatial Mixing with Fewer Colors for Lattice Graphs | 2006-06-01 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| Random sampling of 3‐colorings in ℤ2 | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941837 | 2000-07-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4863448 | 1996-02-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4277670 | 1994-09-11 | Paper |
