Andrea E. F. Clementi

ORCID

Publication Activity (10 Years)

Years Active: 1994-2023
Publications (10 Years): 48

Top Venues

Publications

Luca Becchetti, Andrea E. F. Clementi, Francesco Pasquale, Luca Trevisan, Robin Vacus, Isabella Ziccardi
The Minority Dynamics and the Power of Synchronicity. CoRR (2023)
Luca Becchetti, Andrea E. F. Clementi, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi
Expansion and flooding in dynamic random networks with node churn. Random Struct. Algorithms 63 (1) (2023)
Luca Becchetti, Andrea E. F. Clementi, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi
Bond Percolation in Small-World Graphs with Power-Law Distribution. SAND (2023)
Luca Becchetti, Andrea E. F. Clementi, Amos Korman, Francesco Pasquale, Luca Trevisan, Robin Vacus
On the Role of Memory in Robust Opinion Dynamics. IJCAI (2023)
Luca Becchetti, Andrea E. F. Clementi, Amos Korman, Francesco Pasquale, Luca Trevisan, Robin Vacus
On the Role of Memory in Robust Opinion Dynamics. CoRR (2023)
Luca Becchetti, Arthur Carvalho Walraven da Cuhna, Andrea E. F. Clementi, Francesco D'Amore, Hicham Lesfari, Emanuele Natale, Luca Trevisan
On the Multidimensional Random Subset Sum Problem. CoRR (2022)
Luca Becchetti, Andrea E. F. Clementi, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi
Bond Percolation in Small-World Graphs with Power-Law Distribution. CoRR (2022)
Francesco D'Amore, Andrea E. F. Clementi, Emanuele Natale
Phase transition of a nonlinear opinion dynamics with noisy interactions. Swarm Intell. 16 (4) (2022)
Luca Becchetti, Andrea E. F. Clementi, Riccardo Denni, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi
Percolation and Epidemic Processes in One-Dimensional Small-World Networks - (Extended Abstract). LATIN (2022)
Luca Becchetti, Andrea E. F. Clementi, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi
Expansion and Flooding in Dynamic Random Networks with Node Churn. ICDCS (2021)
Luca Becchetti, Andrea E. F. Clementi, Riccardo Denni, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi
Sharp Thresholds for a SIR Model on One-Dimensional Small-World Networks. CoRR (2021)
Andrea E. F. Clementi, Francesco D'Amore, George Giakkoupis, Emanuele Natale
Search via Parallel Lévy Walks on Z2. PODC (2021)
Andrea E. F. Clementi, Emanuele Natale, Isabella Ziccardi
Parallel Load Balancing on constrained client-server topologies. Theor. Comput. Sci. 895 (2021)
Francesco D'Amore, Andrea E. F. Clementi, Emanuele Natale
Phase Transition of a Non-Linear Opinion Dynamics with Noisy Interactions. CoRR (2020)
Francesco D'Amore, Andrea E. F. Clementi, Emanuele Natale
Phase Transition of a Non-linear Opinion Dynamics with Noisy Interactions - (Extended Abstract). SIROCCO (2020)
Andrea E. F. Clementi, Emanuele Natale, Isabella Ziccardi
Parallel Load Balancing on Constrained Client-Server Topologies. SPAA (2020)
Andrea E. F. Clementi, Francesco D'Amore, George Giakkoupis, Emanuele Natale
. CoRR (2020)
Luca Becchetti, Andrea E. F. Clementi, Emanuele Natale
Consensus Dynamics: An Overview. SIGACT News 51 (1) (2020)
Andrea E. F. Clementi, Emanuele Natale, Isabella Ziccardi
Parallel Load Balancing on Constrained Client-Server Topologies. CoRR (2020)
Andrea E. F. Clementi, Luciano Gualà, Emanuele Natale, Francesco Pasquale, Giacomo Scornavacca, Luca Trevisan
Consensus vs Broadcast, with and Without Noise (Extended Abstract). ITCS (2020)
Luca Becchetti, Andrea E. F. Clementi, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi
Expansion and Flooding in Dynamic Random Networks with Node Churn. CoRR (2020)
Luca Becchetti, Andrea E. F. Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan
Find Your Place: Simple Distributed Algorithms for Community Detection. SIAM J. Comput. 49 (4) (2020)
Luca Becchetti, Andrea E. F. Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan
Finding a Bounded-Degree Expander Inside a Dense One. SODA (2020)
Luca Becchetti, Andrea E. F. Clementi, Emanuele Natale, Francesco Pasquale, Gustavo Posta
Self-stabilizing repeated balls-into-bins. Distributed Comput. 32 (1) (2019)
Luca Becchetti, Andrea E. F. Clementi, Pasin Manurangsi, Emanuele Natale, Francesco Pasquale, Prasad Raghavendra, Luca Trevisan
Average Whenever You Meet: Opportunistic Protocols for Community Detection. ESA (2018)
Luca Becchetti, Andrea E. F. Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan
Finding a Bounded-Degree Expander Inside a Dense One. CoRR (2018)
Andrea E. F. Clementi, Mohsen Ghaffari, Luciano Gualà, Emanuele Natale, Francesco Pasquale, Giacomo Scornavacca
A Tight Analysis of the Parallel Undecided-State Dynamics with Two Colors. MFCS (2018)
Andrea E. F. Clementi, Luciano Gualà, Emanuele Natale, Francesco Pasquale, Giacomo Scornavacca, Luca Trevisan
Consensus Needs Broadcast in Noiseless Models but can be Exponentially Easier in the Presence of Noise. CoRR (2018)
Luca Becchetti, Andrea E. F. Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan
Find Your Place: Simple Distributed Algorithms for Community Detection. SODA (2017)
Andrea E. F. Clementi, Luciano Gualà, Guido Proietti, Giacomo Scornavacca
Rational Fair Consensus in the Gossip Model. IPDPS (2017)
Luca Becchetti, Andrea E. F. Clementi, Emanuele Natale, Francesco Pasquale, Prasad Raghavendra, Luca Trevisan
Friend or Foe? Population Protocols can perform Community Detection. CoRR (2017)
Andrea E. F. Clementi, Luciano Gualà, Francesco Pasquale, Giacomo Scornavacca
Brief Announcement: On the Parallel Undecided-State Dynamics with Two Colors. DISC (2017)
Petra Berenbrink, Andrea E. F. Clementi, Robert Elsässer, Peter Kling, Frederik Mallmann-Trenn, Emanuele Natale
Ignore or Comply?: On Breaking Symmetry in Consensus. PODC (2017)
Andrea E. F. Clementi, Luciano Gualà, Guido Proietti, Giacomo Scornavacca
Rational Fair Consensus in the GOSSIP Model. CoRR (2017)
Andrea E. F. Clementi, Luciano Gualà, Francesco Pasquale, Giacomo Scornavacca
On the Parallel Undecided-State Dynamics with Two Colors. CoRR (2017)
Petra Berenbrink, Andrea E. F. Clementi, Robert Elsässer, Peter Kling, Frederik Mallmann-Trenn, Emanuele Natale
Ignore or Comply? On Breaking Symmetry in Consensus. CoRR (2017)
Luca Becchetti, Andrea E. F. Clementi, Emanuele Natale, Francesco Pasquale, Riccardo Silvestri, Luca Trevisan
Simple dynamics for plurality consensus. Distributed Comput. 30 (4) (2017)
Andrea E. F. Clementi, Pierluigi Crescenzi, Carola Doerr, Pierre Fraigniaud, Francesco Pasquale, Riccardo Silvestri
Rumor spreading in random evolving graphs. Random Struct. Algorithms 48 (2) (2016)
Luca Becchetti, Andrea E. F. Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan
Stabilizing Consensus with Many Opinions. SODA (2016)
Luca Becchetti, Andrea E. F. Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan
Find Your Place: Simple Distributed Algorithms for Community Detection. CoRR (2015)
Luca Becchetti, Andrea E. F. Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan
Stabilizing Consensus with Many Opinions. CoRR (2015)
Andrea E. F. Clementi, Riccardo Silvestri
Parsimonious flooding in geometric random-walks. J. Comput. Syst. Sci. 81 (1) (2015)
Luca Becchetti, Andrea E. F. Clementi, Emanuele Natale, Francesco Pasquale, Gustavo Posta
Self-Stabilizing Repeated Balls-into-Bins. SPAA (2015)
Andrea E. F. Clementi, Riccardo Silvestri, Luca Trevisan
Information spreading in dynamic graphs. Distributed Comput. 28 (1) (2015)
Luca Becchetti, Andrea E. F. Clementi, Emanuele Natale, Francesco Pasquale, Riccardo Silvestri
Plurality Consensus in the Gossip Model. SODA (2015)
Luca Becchetti, Andrea E. F. Clementi, Emanuele Natale, Francesco Pasquale
Probabilistic Self-Stabilization. CoRR (2015)
Andrea E. F. Clementi, Miriam Di Ianni, Giorgio Gambosi, Emanuele Natale, Riccardo Silvestri
Distributed community detection in dynamic graphs. Theor. Comput. Sci. 584 (2015)
Luca Becchetti, Andrea E. F. Clementi, Emanuele Natale, Francesco Pasquale, Gustavo Posta
Self-Stabilizing Repeated Balls-into-Bins. CoRR (2015)
Luca Becchetti, Andrea E. F. Clementi, Francesco Pasquale, Giovanni Resta, Paolo Santi, Riccardo Silvestri
Flooding Time in Opportunistic Networks under Power Law and Exponential Intercontact Times. IEEE Trans. Parallel Distributed Syst. 25 (9) (2014)
Luca Becchetti, Andrea E. F. Clementi, Emanuele Natale, Francesco Pasquale, Riccardo Silvestri, Luca Trevisan
Simple dynamics for plurality consensus. SPAA (2014)
Luca Becchetti, Andrea E. F. Clementi, Emanuele Natale, Francesco Pasquale, Riccardo Silvestri
Plurality Consensus in the Gossip Model. CoRR (2014)
Andrea E. F. Clementi, Pierluigi Crescenzi, Carola Doerr, Pierre Fraigniaud, Marco Isopi, Alessandro Panconesi, Francesco Pasquale, Riccardo Silvestri
Rumor Spreading in Random Evolving Graphs. ESA (2013)
Andrea E. F. Clementi, Miriam Di Ianni, Giorgio Gambosi, Emanuele Natale, Riccardo Silvestri
Distributed Community Detection in Dynamic Graphs CoRR (2013)
Andrea E. F. Clementi, Francesco Pasquale, Riccardo Silvestri
Opportunistic MANETs: Mobility Can Make Up for Low Transmission Power. IEEE/ACM Trans. Netw. 21 (2) (2013)
Andrea E. F. Clementi, Miriam Di Ianni, Giorgio Gambosi, Emanuele Natale, Riccardo Silvestri
Distributed Community Detection in Dynamic Graphs - (Extended Abstract). SIROCCO (2013)
Luca Becchetti, Andrea E. F. Clementi, Emanuele Natale, Francesco Pasquale, Riccardo Silvestri, Luca Trevisan
Simple Dynamics for Majority Consensus. CoRR (2013)
Andrea E. F. Clementi, Pierluigi Crescenzi, Carola Doerr, Pierre Fraigniaud, Marco Isopi, Alessandro Panconesi, Francesco Pasquale, Riccardo Silvestri
Rumor Spreading in Random Evolving Graphs CoRR (2013)
Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
Fast flooding over Manhattan. Distributed Comput. 26 (1) (2013)
Andrea E. F. Clementi, Riccardo Silvestri, Luca Trevisan
Information spreading in dynamic graphs. PODC (2012)
Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri
Optimal gossiping in geometric radio networks in the presence of dynamical faults. Networks 59 (3) (2012)
Andrea E. F. Clementi, Riccardo Silvestri
Parsimonious Flooding in Geometric Random-Walks - (Extended Abstract). DISC (2011)
Andrea E. F. Clementi, Riccardo Silvestri
Parsimonious Flooding in Geometric Random-Walks CoRR (2011)
Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
Modelling mobility: A discrete revolution. Ad Hoc Networks 9 (6) (2011)
Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri
Information Spreading in Stationary Markovian Evolving Graphs. IEEE Trans. Parallel Distributed Syst. 22 (9) (2011)
Andrea E. F. Clementi, Riccardo Silvestri, Luca Trevisan
Information Spreading in Dynamic Graphs CoRR (2011)
Luca Becchetti, Andrea E. F. Clementi, Francesco Pasquale, Giovanni Resta, Paolo Santi, Riccardo Silvestri
Information Spreading in Opportunistic Networks is Fast CoRR (2011)
Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri
Information Spreading in Stationary Markovian Evolving Graphs CoRR (2011)
Tiziana Calamoneri, Andrea E. F. Clementi, Emanuele G. Fusco, Riccardo Silvestri
Maximizing the Number of Broadcast Operations in Random Geometric Ad Hoc Wireless Networks. IEEE Trans. Parallel Distributed Syst. 22 (2) (2011)
Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
Fast Flooding over Manhattan CoRR (2010)
Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
Modelling Mobility: A Discrete Revolution CoRR (2010)
Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
Revolution. ICALP (2) (2010)
Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
Fast flooding over Manhattan. PODC (2010)
Andrea E. F. Clementi, Claudio Macci, Angelo Monti, Francesco Pasquale, Riccardo Silvestri
Flooding Time of Edge-Markovian Evolving Graphs. SIAM J. Discret. Math. 24 (4) (2010)
Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri
Broadcasting in dynamic radio networks. J. Comput. Syst. Sci. 75 (4) (2009)
Andrea E. F. Clementi, Francesco Pasquale, Riccardo Silvestri
MANETS: High Mobility Can Make Up for Low Transmission Power. ICALP (2) (2009)
Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri
Information spreading in stationary Markovian evolving graphs. IPDPS (2009)
Andrea E. F. Clementi, Francesco Pasquale, Riccardo Silvestri
MANETS: High mobility can make up for low transmission power CoRR (2009)
Andrea E. F. Clementi, Claudio Macci, Angelo Monti, Francesco Pasquale, Riccardo Silvestri
Flooding time in edge-Markovian dynamic graphs. PODC (2008)
Tiziana Calamoneri, Andrea E. F. Clementi, Angelo Monti, Gianluca Rossi, Riccardo Silvestri
Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms CoRR (2008)
Tiziana Calamoneri, Andrea E. F. Clementi, Angelo Monti, Gianluca Rossi, Riccardo Silvestri
Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms. MSWiM (2008)
Tiziana Calamoneri, Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Riccardo Silvestri
Minimum-Energy Broadcast and disk cover in grid wireless networks. Theor. Comput. Sci. 399 (1-2) (2008)
Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Gianluca Rossi, Riccardo Silvestri
On the bounded-hop MST problem on random Euclidean instances. Theor. Comput. Sci. 384 (2-3) (2007)
Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri
Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults. MFCS (2007)
Andrea E. F. Clementi, Francesco Pasquale, Angelo Monti, Riccardo Silvestri
Communication in dynamic radio networks. PODC (2007)
Tiziana Calamoneri, Andrea E. F. Clementi, Emanuele G. Fusco, Riccardo Silvestri
Maximizing the Number of Broadcast Operations in Static Random Geometric Ad-Hoc Networks. OPODIS (2007)
Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Gianluca Rossi, Riccardo Silvestri
A Distributed Protocol for the Bounded-Hops Converge-Cast in Ad-Hoc Networks. ADHOC-NOW (2006)
Tiziana Calamoneri, Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Riccardo Silvestri
Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks. SIROCCO (2006)
Andrea E. F. Clementi, Miriam Di Ianni, Angelo Monti, Gianluca Rossi, Riccardo Silvestri
Experimental Analysis of Practically Efficient Algorithms for Bounded-Hop Accumulation in Ad-Hoc Wireless Networks. IPDPS (2005)
Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri
On the approximability of the range assignment problem on radio networks in presence of selfish agents. Theor. Comput. Sci. 343 (1-2) (2005)
Andrea E. F. Clementi, Miriam Di Ianni, Angelo Monti, Massimo Lauria, Gianluca Rossi, Riccardo Silvestri
Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances. SIROCCO (2005)
Christoph Ambühl, Andrea E. F. Clementi, Miriam Di Ianni, Nissan Lev-Tov, Angelo Monti, David Peleg, Gianluca Rossi, Riccardo Silvestri
Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks. STACS (2004)
Christoph Ambühl, Andrea E. F. Clementi, Miriam Di Ianni, Gianluca Rossi, Angelo Monti, Riccardo Silvestri
The Range Assignment Problem in Non-Homogeneous Static Ad-Hoc Networks. IPDPS (2004)
Andrea E. F. Clementi, Paolo Penna, Riccardo Silvestri
On the Power Assignment Problem in Radio Networks. Mob. Networks Appl. 9 (2) (2004)
Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
Round Robin is optimal for fault-tolerant broadcasting on wireless networks. J. Parallel Distributed Comput. 64 (1) (2004)
Andrea E. F. Clementi, Miriam Di Ianni, Riccardo Silvestri
The minimum broadcast range assignment problem on linear multi-hop wireless networks. Theor. Comput. Sci. 299 (1-3) (2003)
Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
Distributed broadcast in radio networks of unknown topology. Theor. Comput. Sci. 302 (1-3) (2003)
Andrea E. F. Clementi, Paolo Penna, Afonso Ferreira, Stephane Perennes, Riccardo Silvestri
The Minimum Range Assignment Problem on Linear Radio Networks. Algorithmica 35 (2) (2003)
Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri
Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms. WAOA (2003)
Andrea E. F. Clementi, Gurvan Huiban, Gianluca Rossi, Yann C. Verhoeven, Paolo Penna
On the Approximation Ratio of the MST-Based Heuristic for the Energy-Efficient Broadcast Problem in Static Ad-Hoc Radio Networks. IPDPS (2003)
Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri
Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms. SIROCCO (2003)

Andrea E. F. Clementi.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Andrea E. F. Clementi