| Publication | Date of Publication | Type |
|---|
| Population Protocols for Exact Plurality Consensus | 2024-03-26 | Paper |
| A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States | 2022-07-21 | Paper |
| Breaking the \(\log n\) barrier on rumor spreading | 2022-02-15 | Paper |
| Time-space trade-offs in population protocols for the majority problem | 2021-05-17 | Paper |
| Positive Aging Admits Fast Asynchronous Plurality Consensus | 2021-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5207878 | 2020-01-13 | Paper |
| Fast consensus for voting on general expander graphs | 2018-08-24 | Paper |
| Ignore or Comply? | 2017-10-11 | Paper |
| Brief Announcement | 2017-10-11 | Paper |
| Brief Announcement | 2017-10-11 | Paper |
| Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems | 2017-04-04 | Paper |
| On the isomorphism of graphs having some eigenvalues of moderate multiplicity | 2015-12-14 | Paper |
| Communication complexity of quasirandom rumor spreading | 2015-07-10 | Paper |
| Discrete load balancing is (almost) as easy as continuous load balancing | 2015-03-02 | Paper |
| Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems | 2014-12-12 | Paper |
| Coalescing random walks and voting on graphs | 2014-12-05 | Paper |
| Faster Rumor Spreading: Breaking the logn Barrier | 2014-09-29 | Paper |
| The Power of Two Choices in Distributed Voting | 2014-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417718 | 2014-05-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417719 | 2014-05-22 | Paper |
| Coalescing Random Walks and Voting on Connected Graphs | 2014-04-10 | Paper |
| Randomised broadcasting: memory vs. randomness | 2014-01-13 | Paper |
| Fast message dissemination in random geometric networks | 2013-06-25 | Paper |
| Cover Time and Broadcast Time | 2012-04-24 | Paper |
| Faster Coupon Collecting via Replication with Applications in Gossiping | 2011-08-17 | Paper |
| Settling the Complexity of Local Max-Cut (Almost) Completely | 2011-07-06 | Paper |
| Tight bounds for the cover time of multiple random walks | 2011-06-07 | Paper |
| Efficient Broadcasting in Random Power Law Networks | 2010-11-16 | Paper |
| Efficient Information Exchange in the Random Phone-Call Model | 2010-09-07 | Paper |
| Communication Complexity of Quasirandom Rumor Spreading | 2010-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579471 | 2010-08-06 | Paper |
| Randomised Broadcasting: Memory vs. Randomness | 2010-04-27 | Paper |
| On the runtime and robustness of randomized broadcasting | 2009-08-21 | Paper |
| Tight Bounds for the Cover Time of Multiple Random Walks | 2009-07-14 | Paper |
| On randomized broadcasting in star graphs | 2009-03-04 | Paper |
| Distributing Unit Size Workload Packages in Heterogeneous Networks | 2009-01-19 | Paper |
| On Radio Broadcasting in Random Geometric Graphs | 2008-11-20 | Paper |
| On Randomized Broadcasting in Power Law Networks | 2008-09-09 | Paper |
| On the Runtime and Robustness of Randomized Broadcasting | 2008-04-24 | Paper |
| Toward the Eigenvalue Power Law | 2007-09-05 | Paper |
| Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs | 2007-09-03 | Paper |
| Agent-based randomized broadcasting in large networks | 2007-02-19 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| Radio communication in random graphs | 2006-06-30 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| Edge-isoperimetric problems for Cartesian powers of regular graphs | 2004-10-27 | Paper |
| Sparse topologies with small spectrum size | 2004-10-27 | Paper |
| On spectral bounds for the \(k\)-partitioning of graphs | 2004-09-22 | Paper |
| New spectral lower bounds on the bisection width of graphs | 2004-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448742 | 2004-02-18 | Paper |
| Diffusion schemes for load balancing on heterogeneous networks | 2002-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766666 | 2002-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762507 | 2002-01-09 | Paper |
| On Bounds for the k-Partitioning of Graphs | 2000-11-29 | Paper |
| An edge-isoperimetric problem for powers of the Petersen graph | 2000-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4944983 | 2000-10-18 | Paper |
| The spider poset is Macaulay | 2000-07-09 | Paper |
| On \(k\)-partitioning of Hamming graphs | 2000-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945781 | 2000-03-23 | Paper |
