| Publication | Date of Publication | Type |
|---|
| Weak random sources, hitting sets, and BPP simulations | 2026-05-21 | Paper |
Obituary for Luca Trevisan
Bulletin of the European Association for Theoretical Computer Science EATCS | 2025-04-22 | Paper |
| The minority dynamics and the power of synchronicity | 2024-11-28 | Paper |
Bond percolation in small-world graphs with power-law distribution
Theoretical Computer Science | 2024-08-21 | Paper |
| Randomized parallel algorithms | 2024-06-21 | Paper |
| Parallel approximation of optimization problems | 2024-06-21 | Paper |
Search via Parallel Lévy Walks on Z2
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Improved non-approximability results for vertex cover with density constraints
Lecture Notes in Computer Science | 2024-01-29 | Paper |
Expansion and flooding in dynamic random networks with node churn
Random Structures & Algorithms | 2023-10-12 | Paper |
Percolation and epidemic processes in one-dimensional small-world networks (extended abstract)
LATIN 2022: Theoretical Informatics | 2023-07-26 | Paper |
| The parallel complexity of approximating the High Degree Subgraph problem | 2023-03-21 | Paper |
| Consensus vs Broadcast, with and without Noise | 2023-02-03 | Paper |
Efficient constructions of hitting sets for systems of linear functions
Lecture Notes in Computer Science | 2022-11-09 | Paper |
Phase Transition of a Non-linear Opinion Dynamics with Noisy Interactions
Structural Information and Communication Complexity | 2022-09-01 | Paper |
| Bond Percolation in Small-World Graphs with Power-Law Distribution | 2022-05-18 | 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 |
Average whenever you meet: opportunistic protocols for community detection
(available as arXiv preprint) | 2021-08-04 | Paper |
A tight analysis of the parallel undecided-state dynamics with two colors
(available as arXiv preprint) | 2021-08-04 | 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 |
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 |
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 |
Worst-case hardness suffices for derandomization: a new method for hardness-randomness trade-offs
Automata, Languages and Programming | 2018-07-04 | Paper |
Optimal bounds on the approximation of Boolean functions with consequences on the concept of hardness
STACS 96 | 2017-11-16 | 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 |
Simple dynamics for plurality consensus
Distributed Computing | 2017-09-04 | Paper |
Rumor spreading in random evolving graphs
Random Structures & Algorithms | 2016-03-22 | Paper |
Distributed multi-broadcast in unknown radio networks
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing | 2016-03-04 | Paper |
Distributed community detection in dynamic graphs
Theoretical Computer Science | 2015-05-22 | Paper |
Information spreading in dynamic graphs
Distributed Computing | 2015-03-25 | Paper |
Fast flooding over Manhattan
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | Paper |
Flooding time in edge-Markovian dynamic graphs
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing | 2014-12-12 | Paper |
Information spreading in dynamic graphs
Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
Parsimonious flooding in geometric random-walks
Journal of Computer and System Sciences | 2014-09-22 | Paper |
Communication in dynamic radio networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
Distributed Community Detection in Dynamic Graphs
Structural Information and Communication Complexity | 2013-12-17 | Paper |
Rumor spreading in random evolving graphs
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Fast flooding over Manhattan
Distributed Computing | 2013-06-25 | Paper |
Optimal gossiping in geometric radio networks in the presence of dynamical faults
Networks | 2012-06-29 | Paper |
Parsimonious flooding in geometric random-walks (extended abstract)
Lecture Notes in Computer Science | 2011-10-28 | Paper |
Flooding time of edge-Markovian evolving graphs
SIAM Journal on Discrete Mathematics | 2011-07-18 | Paper |
Information spreading in dynamic networks: an analytical approach
Monographs in Theoretical Computer Science. An EATCS Series | 2011-04-05 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2009-08-11 | Paper |
MANETS: High Mobility Can Make Up for Low Transmission Power
Automata, Languages and Programming | 2009-07-14 | Paper |
Broadcasting in dynamic radio networks
Journal of Computer and System Sciences | 2009-04-30 | Paper |
Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks
Structural Information and Communication Complexity | 2009-03-12 | Paper |
Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
Minimum-energy broadcast and disk cover in grid wireless networks
Theoretical Computer Science | 2008-06-24 | Paper |
On the bounded-hop MST problem on random Euclidean instances
Theoretical Computer Science | 2007-10-02 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-11-30 | Paper |
On the approximability of the range assignment problem on radio networks in presence of selfish agents
Theoretical Computer Science | 2005-10-26 | Paper |
| scientific article; zbMATH DE number 2102761 (Why is no real title available?) | 2004-09-24 | Paper |
Round robin is optimal for fault-tolerant broadcasting on wireless networks
Journal of Parallel and Distributed Computing | 2004-09-08 | Paper |
| scientific article; zbMATH DE number 1979510 (Why is no real title available?) | 2003-09-14 | Paper |
Distributed broadcast in radio networks of unknown topology.
Theoretical Computer Science | 2003-08-17 | Paper |
The minimum range assignment problem on linear radio networks
Algorithmica | 2003-06-02 | Paper |
The minimum broadcast range assignment problem on linear multi-hop wireless networks.
Theoretical Computer Science | 2003-05-25 | Paper |
| scientific article; zbMATH DE number 1875436 (Why is no real title available?) | 2003-03-02 | Paper |
| scientific article; zbMATH DE number 1848288 (Why is no real title available?) | 2003-02-04 | Paper |
| Selective families, superimposed codes, and broadcasting on unknown radio networks. (Extended abstract) | 2002-03-24 | Paper |
| scientific article; zbMATH DE number 1688358 (Why is no real title available?) | 2002-01-09 | Paper |
| scientific article; zbMATH DE number 1670654 (Why is no real title available?) | 2001-12-18 | Paper |
| scientific article; zbMATH DE number 1500550 (Why is no real title available?) | 2001-12-05 | Paper |
| scientific article; zbMATH DE number 1405644 (Why is no real title available?) | 2000-07-10 | Paper |
Improved non-approximability results for minimum vertex cover with density constraints
Theoretical Computer Science | 2000-01-12 | Paper |
Worst-case hardness suffices for derandomization: a new method for hardness-randomness trade-offs
Theoretical Computer Science | 2000-01-12 | Paper |
Weak Random Sources, Hitting Sets, and BPP Simulations
SIAM Journal on Computing | 1999-10-28 | Paper |
The parallel complexity of approximating the high degree subgraph problem
Theoretical Computer Science | 1999-01-12 | Paper |
A new general derandomization method
Journal of the ACM | 1999-01-05 | Paper |
Optimal bounds for the approximation of Boolean functions and some applications
Theoretical Computer Science | 1998-07-22 | Paper |
| scientific article; zbMATH DE number 1156868 (Why is no real title available?) | 1998-05-26 | Paper |
The reachability problem for finite cellular automata
Information Processing Letters | 1997-02-28 | Paper |
Constructing the highest degree subgraph for dense graphs is in \({\mathcal N}{\mathcal C}{\mathcal A}{\mathcal S}\)
Theoretical Computer Science | 1997-02-27 | Paper |
| scientific article; zbMATH DE number 934538 (Why is no real title available?) | 1997-01-22 | Paper |
OPTIMUM SCHEDULE PROBLEMS IN STORE AND FORWARD NETWORKS
International Journal of Foundations of Computer Science | 1996-01-28 | Paper |
| scientific article; zbMATH DE number 798683 (Why is no real title available?) | 1995-09-20 | Paper |
