| Publication | Date of Publication | Type |
|---|
Payment scheduling in the interval debt model
Theoretical Computer Science | 2025-01-16 | Paper |
Payment scheduling in the interval debt model
Lecture Notes in Computer Science | 2023-08-14 | Paper |
A population protocol for exact majority with \(O(\log^{5/3} n)\) stabilization time and \(\Theta(\log n)\) states
| 2022-07-21 | Paper |
Time-space trade-offs in population protocols for the majority problem
Distributed Computing | 2021-05-17 | Paper |
Self-stabilizing balls and bins in batches. The power of leaky bins
Algorithmica | 2018-10-18 | Paper |
Plurality consensus in arbitrary graphs: lessons learned from load balancing
| 2018-03-02 | Paper |
Efficient plurality consensus, or: the benefits of cleaning up from time to time
| 2017-12-19 | Paper |
Brief announcement: Rapid asynchronous plurality consensus
Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
Self-stabilizing balls \& bins in batches: the power of leaky bins (extended abstract)
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
scientific article; zbMATH DE number 6783405 (Why is no real title available?)
| 2017-09-29 | Paper |
Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems
Distributed Computing | 2017-04-04 | Paper |
Balls into non-uniform bins
Journal of Parallel and Distributed Computing | 2015-12-18 | Paper |
Random walks which prefer unvisited edges: exploring high girth even degree expanders in linear time
Random Structures \& Algorithms | 2015-02-20 | 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 |
Random walks which prefer unvisited edges, exploring high girth even degree expanders in linear time
Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
Randomized diffusion for indivisible loads
Journal of Computer and System Sciences | 2014-09-22 | Paper |
Multiple-choice balanced allocation in (almost) parallel
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
Observe and remain silent (communication-less agent location discovery)
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
Balls into bins with related random choices
Journal of Parallel and Distributed Computing | 2012-07-13 | Paper |
Convergence to equilibria in distributed, selfish reallocation processes with weighted tasks
Algorithmica | 2012-04-26 | Paper |
Sublinear-time algorithms for tournament graphs
Journal of Combinatorial Optimization | 2011-12-15 | Paper |
Faster coupon collecting via replication with applications in gossiping
Mathematical Foundations of Computer Science 2011 | 2011-08-17 | Paper |
Distributed selfish load balancing
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Sublinear-Time Algorithms for Tournament Graphs
Lecture Notes in Computer Science | 2009-07-23 | Paper |
On weighted balls-into-bins games
Theoretical Computer Science | 2009-01-08 | Paper |
Convergence to Equilibria in Distributed, Selfish Reallocation Processes with Weighted Tasks
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Distributed Selfish Load Balancing
SIAM Journal on Computing | 2008-08-14 | Paper |
On the stability of dynamic diffusion load balancing
Algorithmica | 2008-04-03 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | 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 |
scientific article; zbMATH DE number 2087058 (Why is no real title available?)
| 2004-08-11 | Paper |
The Natural Work-Stealing Algorithm is Stable
SIAM Journal on Computing | 2003-09-28 | Paper |
