| Publication | Date of Publication | Type |
|---|
| Revisiting the random subset sum problem | 2025-01-06 | Paper |
Search via Parallel Lévy Walks on Z2
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
| Consensus vs Broadcast, with and without Noise | 2023-02-03 | Paper |
Phase Transition of a Non-linear Opinion Dynamics with Noisy Interactions
Structural Information and Communication Complexity | 2022-09-01 | Paper |
Parallel load balancing on constrained client-server topologies
Theoretical Computer Science | 2021-11-18 | Paper |
Parallel load balancing on constrained client-server topologies
Theoretical Computer Science | 2021-11-18 | Paper |
Phase transition of the 2-choices dynamics on core-periphery networks
Distributed Computing | 2021-09-06 | Paper |
A tight analysis of the parallel undecided-state dynamics with two colors
(available as arXiv preprint) | 2021-08-04 | Paper |
Average whenever you meet: opportunistic protocols for community detection
(available as arXiv preprint) | 2021-08-04 | Paper |
Limits for rumor spreading in stochastic populations
(available as arXiv preprint) | 2021-06-15 | Paper |
Finding a bounded-degree expander inside a dense one
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Find Your Place: Simple Distributed Algorithms for Community Detection
SIAM Journal on Computing | 2020-08-18 | Paper |
On the necessary memory to compute the plurality in multi-agent systems
(available as arXiv preprint) | 2020-02-06 | Paper |
Noisy rumor spreading and plurality consensus
Distributed Computing | 2019-08-13 | Paper |
Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits
Distributed Computing | 2019-07-11 | Paper |
KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation
ACM Journal of Experimental Algorithmics | 2019-03-27 | Paper |
KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation
ACM Journal of Experimental Algorithmics | 2019-03-27 | Paper |
Self-stabilizing repeated balls-into-bins
Distributed Computing | 2019-03-21 | Paper |
Stabilizing Consensus with Many Opinions
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Stabilizing Consensus with Many Opinions
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Find your place: simple distributed algorithms for community detection
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
scientific article; zbMATH DE number 6851888 (Why is no real title available?)
(available as arXiv preprint) | 2018-03-21 | Paper |
| KADABRA is an adaptive algorithm for betweenness via random approximation | 2018-03-02 | Paper |
Ignore or comply? On breaking symmetry in consensus
Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
Plurality consensus in the gossip model
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Brief announcement: Self-stabilizing clock synchronization with 3-bit messages
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
Noisy rumor spreading and plurality consensus (extended abstract)
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
Simple dynamics for plurality consensus
Distributed Computing | 2017-09-04 | Paper |
Large peg-army maneuvers
(available as arXiv preprint) | 2017-07-17 | Paper |
Distributed community detection in dynamic graphs
Theoretical Computer Science | 2015-05-22 | Paper |
Distributed Community Detection in Dynamic Graphs
Structural Information and Communication Complexity | 2013-12-17 | Paper |
Revisiting the Random Subset Sum problem
(available as arXiv preprint) | N/A | Paper |
Polynomially Over-Parameterized Convolutional Neural Networks Contain Structured Strong Winning Lottery Tickets
(available as arXiv preprint) | N/A | Paper |
