| Publication | Date of Publication | Type |
|---|
| Fast consensus via the unconstrained undecided state dynamics | 2024-07-19 | Paper |
Population Protocols for Exact Plurality Consensus
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
| A population protocol for exact majority with \(O(\log^{5/3} n)\) stabilization time and \(\Theta(\log n)\) states | 2022-07-21 | Paper |
Breaking the \(\log n\) barrier on rumor spreading
Distributed Computing | 2022-02-15 | Paper |
Time-space trade-offs in population protocols for the majority problem
Distributed Computing | 2021-05-17 | Paper |
Positive Aging Admits Fast Asynchronous Plurality Consensus
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
Positive Aging Admits Fast Asynchronous Plurality Consensus
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
| Recent results in population protocols for exact majority and leader election | 2020-01-13 | Paper |
| Fast consensus for voting on general expander graphs | 2018-08-24 | Paper |
Brief announcement: Population protocols for leader election and exact majority with \(O(\log^{2} n)\) states and \(O(\log^{2}n)\) convergence time
Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
Ignore or comply? On breaking symmetry in consensus
Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
Brief announcement: Rapid asynchronous plurality consensus
Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems
Distributed Computing | 2017-04-04 | Paper |
On the isomorphism of graphs having some eigenvalues of moderate multiplicity
Linear Algebra and its Applications | 2015-12-14 | Paper |
Communication complexity of quasirandom rumor spreading
Algorithmica | 2015-07-10 | Paper |
Discrete load balancing is (almost) as easy as continuous load balancing
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | Paper |
Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing | 2014-12-12 | Paper |
Coalescing random walks and voting on graphs
Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
Faster Rumor Spreading: Breaking the logn Barrier
Lecture Notes in Computer Science | 2014-09-29 | Paper |
The Power of Two Choices in Distributed Voting
Automata, Languages, and Programming | 2014-07-01 | Paper |
| scientific article; zbMATH DE number 6297797 (Why is no real title available?) | 2014-05-22 | Paper |
| Speeding up random walks with neighborhood exploration | 2014-05-22 | Paper |
Coalescing random walks and voting on connected graphs
SIAM Journal on Discrete Mathematics | 2014-04-10 | Paper |
Randomised broadcasting: memory vs. randomness
Theoretical Computer Science | 2014-01-13 | Paper |
Fast message dissemination in random geometric networks
Distributed Computing | 2013-06-25 | Paper |
| Cover time and broadcast time | 2012-04-24 | Paper |
Cover time and broadcast time
(available as arXiv preprint) | 2012-04-24 | Paper |
Faster coupon collecting via replication with applications in gossiping
Mathematical Foundations of Computer Science 2011 | 2011-08-17 | Paper |
Settling the complexity of local max-cut (almost) completely
Automata, Languages and Programming | 2011-07-06 | Paper |
Tight bounds for the cover time of multiple random walks
Theoretical Computer Science | 2011-06-07 | Paper |
Efficient broadcasting in random power law networks
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
Efficient Information Exchange in the Random Phone-Call Model
Automata, Languages and Programming | 2010-09-07 | Paper |
Communication complexity of quasirandom rumor spreading
Algorithms – ESA 2010 | 2010-09-06 | Paper |
| scientific article; zbMATH DE number 5764878 (Why is no real title available?) | 2010-08-06 | Paper |
Randomised Broadcasting: Memory vs. Randomness
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
On the runtime and robustness of randomized broadcasting
Theoretical Computer Science | 2009-08-21 | Paper |
Tight Bounds for the Cover Time of Multiple Random Walks
Automata, Languages and Programming | 2009-07-14 | Paper |
On randomized broadcasting in star graphs
Discrete Applied Mathematics | 2009-03-04 | Paper |
Distributing Unit Size Workload Packages in Heterogeneous Networks
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
Distributing Unit Size Workload Packages in Heterogeneous Networks
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
On Radio Broadcasting in Random Geometric Graphs
Lecture Notes in Computer Science | 2008-11-20 | Paper |
On Randomized Broadcasting in Power Law Networks
Lecture Notes in Computer Science | 2008-09-09 | Paper |
On the Runtime and Robustness of Randomized Broadcasting
Algorithms and Computation | 2008-04-24 | Paper |
Toward the Eigenvalue Power Law
Lecture Notes in Computer Science | 2007-09-05 | Paper |
Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs
STACS 2007 | 2007-09-03 | Paper |
Agent-based randomized broadcasting in large networks
Discrete Applied Mathematics | 2007-02-19 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Radio communication in random graphs
Journal of Computer and System Sciences | 2006-06-30 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
Edge-isoperimetric problems for Cartesian powers of regular graphs
Theoretical Computer Science | 2004-10-27 | Paper |
Sparse topologies with small spectrum size
Theoretical Computer Science | 2004-10-27 | Paper |
On spectral bounds for the \(k\)-partitioning of graphs
Theory of Computing Systems | 2004-09-22 | Paper |
New spectral lower bounds on the bisection width of graphs
Theoretical Computer Science | 2004-08-10 | Paper |
| scientific article; zbMATH DE number 2044916 (Why is no real title available?) | 2004-02-18 | Paper |
Diffusion schemes for load balancing on heterogeneous networks
Theory of Computing Systems | 2002-12-01 | Paper |
| scientific article; zbMATH DE number 1696519 (Why is no real title available?) | 2002-07-22 | Paper |
| scientific article; zbMATH DE number 1688366 (Why is no real title available?) | 2002-01-09 | Paper |
On Bounds for the k-Partitioning of Graphs
Lecture Notes in Computer Science | 2000-11-29 | Paper |
An edge-isoperimetric problem for powers of the Petersen graph
Annals of Combinatorics | 2000-11-23 | Paper |
| scientific article; zbMATH DE number 1420913 (Why is no real title available?) | 2000-10-18 | Paper |
The spider poset is Macaulay
Journal of Combinatorial Theory. Series A | 2000-07-09 | Paper |
On \(k\)-partitioning of Hamming graphs
Discrete Applied Mathematics | 2000-04-09 | Paper |
| scientific article; zbMATH DE number 1424534 (Why is no real title available?) | 2000-03-23 | Paper |
