| Publication | Date of Publication | Type |
|---|
Diversity, Fairness, and Sustainability in Population Protocols
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
A Massively Parallel Modularity-Maximizing Algorithm with Provable Guarantees
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Distributed Averaging in Opinion Dynamics
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Learning hierarchically-structured concepts. II: Overlapping concepts, and networks with feedback
Structural Information and Communication Complexity | 2024-01-11 | Paper |
On Coalescence Time in Graphs: When Is Coalescing as Fast as Meeting?
ACM Transactions on Algorithms | 2023-10-23 | Paper |
Learning hierarchically-structured concepts
Neural Networks | 2023-09-28 | Paper |
How large is your graph?
| 2023-02-03 | Paper |
Skyline Computation with Noisy Comparisons
Lecture Notes in Computer Science | 2022-10-13 | Paper |
How to color a French flag. Biologically inspired algorithms for scale-invariant patterning
LATIN 2020: Theoretical Informatics | 2022-10-13 | Paper |
Noidy conmunixatipn: on the convergence of the averaging population protocol
| 2022-07-21 | Paper |
Eigenvector Computation and Community Detection in Asynchronous Gossip Models
| 2021-07-28 | Paper |
Instance-Optimality in the Noisy Value-and Comparison-Model
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
How to Spread a Rumor
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
How to color a French flag. Biologically inspired algorithms for scale-invariant patterning
Structural Information and Communication Complexity | 2020-03-03 | Paper |
Hierarchical clustering. Objective functions and algorithms
Journal of the ACM | 2020-02-11 | Paper |
On coalescence time in graphs: when is coalescing as fast as meeting? Extended abstract
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Improved analysis of deterministic load-balancing schemes
ACM Transactions on Algorithms | 2019-03-28 | Paper |
Self-stabilizing balls and bins in batches. The power of leaky bins
Algorithmica | 2018-10-18 | Paper |
Distance in the Forest Fire Model How far are you from Eve?
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
scientific article; zbMATH DE number 6851888 (Why is no real title available?)
| 2018-03-21 | Paper |
Hierarchical clustering: objective functions and algorithms
| 2018-03-15 | Paper |
Plurality consensus in arbitrary graphs: lessons learned from load balancing
| 2018-03-02 | Paper |
Bounds on the Voter Model in Dynamic Networks
| 2017-12-19 | Paper |
Brief announcement: How large is your graph?
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 |
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 6691399 (Why is no real title available?)
| 2017-03-03 | Paper |
Improved analysis of deterministic load-balancing schemes
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
Estimating the number of connected components in sublinear time
Information Processing Letters | 2014-07-18 | Paper |
Slow down and sleep for profit in online deadline scheduling
Lecture Notes in Computer Science | 2013-04-19 | Paper |
