Graph Theory and Interactive Protocols for Reachability Problems on Finite Cellular Automata. - Andrea Clementi; Russell Impagliazzo (CIAC, 1994)

Fast Parallel Arithmetic on Cellular Automata. - Andrea Clementi; Giuseppe A. De Biase; Annalisa Massini (Complex Syst., 1994)

Some Results on Invertible Cellular Automata. - Andrea Clementi; Patrizia Mentrasti; Pierluigi Pierini (Complex Syst., 1995)

Hitting Sets Derandomize BPP - Alexander E. Andreev; Andrea E. F. Clementi; José D. P. Rolim (Electron. Colloquium Comput. Complex., 1995)

Optimum Schedule Problems in Store and Forward Networks. - Andrea Clementi; Miriam Di Ianni (Int. J. Found. Comput. Sci., 1995)

The Reachability Problem for Finite Cellular Automata. - Andrea Clementi; Russell Impagliazzo (Inf. Process. Lett., 1995)

Improved Non-approximability Results for Vertex Cover with Density Constraints. - Andrea E. F. Clementi; Luca Trevisan 001 (COCOON, 1996)

On the Parallel Computation of Boolean Functions on Unrelated inputs. - Alexander E. Andreev; Andrea E. F. Clementi; José D. P. Rolim (ISTCS, 1996)

Parallel approximation of optimization problems. - Daniel P. Bovet; Andrea Clementi; Pierluigi Crescenzi; Riccardo Silvestri (Solving Combinatorial Optimization Problems in Parallel, 1996)

Randomized parallel algorithms. - Andrea Clementi; José D. P. Rolim; Erik Urland (Solving Combinatorial Optimization Problems in Parallel, 1996)

Optimal Bounds on the Approximation of Boolean Functions with Consequences on the Concept of Hardware. - Alexander E. Andreev; Andrea E. F. Clementi; José D. P. Rolim (STACS, 1996)

Towards efficient constructions of hitting sets that derandomize BPP - Alexander E. Andreev; Andrea E. F. Clementi; José D. P. Rolim (Electron. Colloquium Comput. Complex., 1996)

Hitting Properties of Hard Boolean Operators and their Consequences on BPP - Alexander E. Andreev; Andrea E. F. Clementi; José D. P. Rolim (Electron. Colloquium Comput. Complex., 1996)

Constructing the Highest Degree Subgraph for Dense Graphs is in NCAS. - Alexander E. Andreev; Andrea E. F. Clementi; José D. P. Rolim (Theor. Comput. Sci., 1996)

On the hardness of approximating optimum schedule problems in store and forward networks. - Andrea E. F. Clementi; Miriam Di Ianni (IEEE/ACM Trans. Netw., 1996)

Efficient Construction of Hitting Sets for Systems of Linear Functions. - Alexander E. Andreev; Andrea E. F. Clementi; José D. P. Rolim (STACS, 1997)

Small Random Sets for Affine Spaces and Better Explicit Lower Bounds for Branching Programs - Alexander E. Andreev; Juri L. Baskakov; Andrea E. F. Clementi; José D. P. Rolim (Electron. Colloquium Comput. Complex., 1997)

Optimal Bounds for the Approximation of Boolean Functions and Some Applications. - Alexander E. Andreev; Andrea E. F. Clementi; José D. P. Rolim (Theor. Comput. Sci., 1997)

Recent Advances Towards Proving P = BPP. - Andrea E. F. Clementi; José D. P. Rolim; Luca Trevisan 001 (Bull. EATCS, 1998)

A New General Derandomization Method. - Alexander E. Andreev; Andrea E. F. Clementi; José D. P. Rolim (J. ACM, 1998)

The Parallel Complexity of Approximating the High Degree Subgraph Problem. - Alexander E. Andreev; Andrea E. F. Clementi; Pierluigi Crescenzi; Elias Dahlhaus; Sergio De Agostino; José D. P. Rolim (Theor. Comput. Sci., 1998)

On the Complexity of Approximating Colored-Graph Problems. - Andrea E. F. Clementi; Pierluigi Crescenzi; Gianluca Rossi (COCOON, 1999)

Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs. - Alexander E. Andreev; Juri L. Baskakov; Andrea E. F. Clementi; José D. P. Rolim (ICALP, 1999)

Hardness Results for the Power Range Assignmet Problem in Packet Radio Networks. - Andrea E. F. Clementi; Paolo Penna; Riccardo Silvestri (RANDOM-APPROX, 1999)

Memory Organization Schemes for Large Shared Data: A Randomized Solution for Distributed Memory Machines. - Alexander E. Andreev; Andrea E. F. Clementi; Paolo Penna; José D. P. Rolim (STACS, 1999)

Weak Random Sources, Hitting Sets, and BPP Simulations. - Alexander E. Andreev; Andrea E. F. Clementi; José D. P. Rolim; Luca Trevisan 001 (SIAM J. Comput., 1999)

Worst-Case Hardness Suffices for Derandomization: A New Method for Hardness-Randomness Trade-offs. - Alexander E. Andreev; Andrea E. F. Clementi; José D. P. Rolim (Theor. Comput. Sci., 1999)

Improved Non-Approximability Results for Minimum Vertex Cover with Density Constraints. - Andrea E. F. Clementi; Luca Trevisan 001 (Theor. Comput. Sci., 1999)

A Note on Parallel Read Operations on Large Public Databases. - Gian Carlo Bongiovanni; Andrea E. F. Clementi; Paolo Penna (ICALP Satellite Workshops, 2000)

The Power Range Assignment Problem in Radio Networks on the Plane. - Andrea E. F. Clementi; Paolo Penna; Riccardo Silvestri (STACS, 2000)

Parallel Read Operations Without Memory Contention - Alexander E. Andreev; Andrea E. F. Clementi; Paolo Penna; José D. P. Rolim (Electron. Colloquium Comput. Complex., 2000)

Distributed multi-broadcast in unknown radio networks. - Andrea E. F. Clementi; Angelo Monti; Riccardo Silvestri (PODC, 2001)

On Computing Ad-hoc Selective Families. - Andrea E. F. Clementi; Pierluigi Crescenzi; Angelo Monti; Paolo Penna; Riccardo Silvestri (RANDOM-APPROX, 2001)

Selective families, superimposed codes, and broadcasting on unknown radio networks. - Andrea E. F. Clementi; Angelo Monti; Riccardo Silvestri (SODA, 2001)

On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs. - Andrea E. F. Clementi; Pierluigi Crescenzi; Paolo Penna; Gianluca Rossi; Paola Vocca (STACS, 2001)

Distributed Broadcast in Wireless Networks with Unknown Topology - Andrea E. F. Clementi; Angelo Monti; Riccardo Silvestri (CoRR, 2001)

Optimal F-Reliable Protocols for the Do-All Problem on Single-Hop Wireless Networks. - Andrea E. F. Clementi; Angelo Monti; Riccardo Silvestri (ISAAC, 2002)

On the Approximation Ratio of the MST-Based Heuristic for the Energy-Efficient Broadcast Problem in Static Ad-Hoc Radio Networks. - Andrea E. F. Clementi; Gurvan Huiban; Gianluca Rossi; Yann C. Verhoeven; Paolo Penna (IPDPS, 2003)

Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms. - Christoph Ambühl; Andrea E. F. Clementi; Paolo Penna; Gianluca Rossi; Riccardo Silvestri (WAOA, 2003)

The Minimum Range Assignment Problem on Linear Radio Networks. - Andrea E. F. Clementi; Paolo Penna; Afonso Ferreira; Stephane Perennes; Riccardo Silvestri (Algorithmica, 2003)

The minimum broadcast range assignment problem on linear multi-hop wireless networks. - Andrea E. F. Clementi; Miriam Di Ianni; Riccardo Silvestri (Theor. Comput. Sci., 2003)

Distributed broadcast in radio networks of unknown topology. - Andrea E. F. Clementi; Angelo Monti; Riccardo Silvestri (Theor. Comput. Sci., 2003)

The Range Assignment Problem in Non-Homogeneous Static Ad-Hoc Networks. - Christoph Ambühl; Andrea E. F. Clementi; Miriam Di Ianni; Gianluca Rossi; Angelo Monti; Riccardo Silvestri (IPDPS, 2004)

Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks. - Christoph Ambühl; Andrea E. F. Clementi; Miriam Di Ianni; Nissan Lev-Tov; Angelo Monti; David Peleg; Gianluca Rossi; Riccardo Silvestri (STACS, 2004)

Round Robin is optimal for fault-tolerant broadcasting on wireless networks. - Andrea E. F. Clementi; Angelo Monti; Riccardo Silvestri (J. Parallel Distributed Comput., 2004)

On the Power Assignment Problem in Radio Networks. - Andrea E. F. Clementi; Paolo Penna; Riccardo Silvestri (Mob. Networks Appl., 2004)

Experimental Analysis of Practically Efficient Algorithms for Bounded-Hop Accumulation in Ad-Hoc Wireless Networks. - Andrea E. F. Clementi; Miriam Di Ianni; Angelo Monti; Gianluca Rossi; Riccardo Silvestri (IPDPS, 2005)

Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances. - Andrea E. F. Clementi; Miriam Di Ianni; Angelo Monti; Massimo Lauria; Gianluca Rossi; Riccardo Silvestri (SIROCCO, 2005)

On the approximability of the range assignment problem on radio networks in presence of selfish agents. - Christoph Ambühl; Andrea E. F. Clementi; Paolo Penna; Gianluca Rossi; Riccardo Silvestri (Theor. Comput. Sci., 2005)

A Distributed Protocol for the Bounded-Hops Converge-Cast in Ad-Hoc Networks. - Andrea E. F. Clementi; Miriam Di Ianni; Massimo Lauria; Angelo Monti; Gianluca Rossi; Riccardo Silvestri (ADHOC-NOW, 2006)

Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults. - Andrea E. F. Clementi; Angelo Monti; Francesco Pasquale; Riccardo Silvestri (MFCS, 2007)

Maximizing the Number of Broadcast Operations in Static Random Geometric Ad-Hoc Networks. - Tiziana Calamoneri; Andrea E. F. Clementi; Emanuele G. Fusco; Riccardo Silvestri (OPODIS, 2007)

Communication in dynamic radio networks. - Andrea E. F. Clementi; Francesco Pasquale; Angelo Monti; Riccardo Silvestri (PODC, 2007)

On the bounded-hop MST problem on random Euclidean instances. - Andrea E. F. Clementi; Miriam Di Ianni; Massimo Lauria; Angelo Monti; Gianluca Rossi; Riccardo Silvestri (Theor. Comput. Sci., 2007)

Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms. - Tiziana Calamoneri; Andrea E. F. Clementi; Angelo Monti; Gianluca Rossi; Riccardo Silvestri (MSWiM, 2008)

Flooding time in edge-Markovian dynamic graphs. - Andrea E. F. Clementi; Claudio Macci; Angelo Monti; Francesco Pasquale; Riccardo Silvestri (PODC, 2008)

Minimum-Energy Broadcast and disk cover in grid wireless networks. - Tiziana Calamoneri; Andrea E. F. Clementi; Miriam Di Ianni; Massimo Lauria; Angelo Monti; Riccardo Silvestri (Theor. Comput. Sci., 2008)

MANETS: High Mobility Can Make Up for Low Transmission Power. - Andrea E. F. Clementi; Francesco Pasquale; Riccardo Silvestri (ICALP (2), 2009)

Broadcasting in dynamic radio networks. - Andrea E. F. Clementi; Angelo Monti; Francesco Pasquale; Riccardo Silvestri (J. Comput. Syst. Sci., 2009)

Modelling Mobility: A Discrete Revolution. - Andrea E. F. Clementi; Angelo Monti; Riccardo Silvestri (ICALP (2), 2010)

Flooding Time of Edge-Markovian Evolving Graphs. - Andrea E. F. Clementi; Claudio Macci; Angelo Monti; Francesco Pasquale; Riccardo Silvestri (SIAM J. Discret. Math., 2010)

Parsimonious Flooding in Geometric Random-Walks - (Extended Abstract). - Andrea E. F. Clementi; Riccardo Silvestri (DISC, 2011)

Modelling mobility: A discrete revolution. - Andrea Clementi; Angelo Monti; Riccardo Silvestri (Ad Hoc Networks, 2011)

Information Spreading in Opportunistic Networks is Fast - Luca Becchetti; Andrea Clementi; Francesco Pasquale; Giovanni Resta; Paolo Santi; Riccardo Silvestri (CoRR, 2011)

Maximizing the Number of Broadcast Operations in Random Geometric Ad Hoc Wireless Networks. - Tiziana Calamoneri; Andrea E. F. Clementi; Emanuele G. Fusco; Riccardo Silvestri (IEEE Trans. Parallel Distributed Syst., 2011)

Information Spreading in Stationary Markovian Evolving Graphs. - Andrea Clementi; Angelo Monti; Francesco Pasquale; Riccardo Silvestri (IEEE Trans. Parallel Distributed Syst., 2011)

Information Spreading in Dynamic Networks: An Analytical Approach. - Andrea Clementi; Francesco Pasquale (Theoretical Aspects of Distributed Computing in Sensor Networks, 2011)

Optimal gossiping in geometric radio networks in the presence of dynamical faults. - Andrea Clementi; Angelo Monti; Francesco Pasquale; Riccardo Silvestri (Networks, 2012)

Rumor Spreading in Random Evolving Graphs. - Andrea Clementi; Pierluigi Crescenzi; Carola Doerr; Pierre Fraigniaud; Marco Isopi; Alessandro Panconesi; Francesco Pasquale; Riccardo Silvestri (ESA, 2013)

Distributed Community Detection in Dynamic Graphs - (Extended Abstract). - Andrea Clementi; Miriam Di Ianni; Giorgio Gambosi; Emanuele Natale; Riccardo Silvestri (SIROCCO, 2013)

Simple Dynamics for Majority Consensus. - Luca Becchetti; Andrea Clementi; Emanuele Natale; Francesco Pasquale; Riccardo Silvestri; Luca Trevisan 001 (CoRR, 2013)

Fast flooding over Manhattan. - Andrea Clementi; Angelo Monti; Riccardo Silvestri (Distributed Comput., 2013)

Opportunistic MANETs: Mobility Can Make Up for Low Transmission Power. - Andrea Clementi; Francesco Pasquale; Riccardo Silvestri (IEEE/ACM Trans. Netw., 2013)

Flooding Time in Opportunistic Networks under Power Law and Exponential Intercontact Times. - Luca Becchetti; Andrea Clementi; Francesco Pasquale; Giovanni Resta; Paolo Santi; Riccardo Silvestri (IEEE Trans. Parallel Distributed Syst., 2014)

Plurality Consensus in the Gossip Model. - Luca Becchetti; Andrea Clementi; Emanuele Natale; Francesco Pasquale; Riccardo Silvestri (SODA, 2015)

Probabilistic Self-Stabilization. - Luca Becchetti; Andrea Clementi; Emanuele Natale; Francesco Pasquale (CoRR, 2015)

Information spreading in dynamic graphs. - Andrea Clementi; Riccardo Silvestri; Luca Trevisan 001 (Distributed Comput., 2015)

Parsimonious flooding in geometric random-walks. - Andrea Clementi; Riccardo Silvestri (J. Comput. Syst. Sci., 2015)

Distributed community detection in dynamic graphs. - Andrea Clementi; Miriam Di Ianni; Giorgio Gambosi; Emanuele Natale; Riccardo Silvestri (Theor. Comput. Sci., 2015)

Stabilizing Consensus with Many Opinions. - Luca Becchetti; Andrea Clementi; Emanuele Natale; Francesco Pasquale; Luca Trevisan 001 (SODA, 2016)

Rumor spreading in random evolving graphs. - Andrea Clementi; Pierluigi Crescenzi; Carola Doerr; Pierre Fraigniaud; Francesco Pasquale; Riccardo Silvestri (Random Struct. Algorithms, 2016)

Rational Fair Consensus in the Gossip Model. - Andrea Clementi; Luciano Gualà; Guido Proietti; Giacomo Scornavacca (IPDPS, 2017)

Ignore or Comply?: On Breaking Symmetry in Consensus. - Petra Berenbrink; Andrea Clementi; Robert Elsässer; Peter Kling; Frederik Mallmann-Trenn; Emanuele Natale (PODC, 2017)

Brief Announcement: On the Parallel Undecided-State Dynamics with Two Colors. - Andrea Clementi; Luciano Gualà; Francesco Pasquale; Giacomo Scornavacca (DISC, 2017)

Friend or Foe? Population Protocols can perform Community Detection. - Luca Becchetti; Andrea Clementi; Emanuele Natale; Francesco Pasquale; Prasad Raghavendra; Luca Trevisan 001 (CoRR, 2017)

On the Parallel Undecided-State Dynamics with Two Colors. - Andrea Clementi; Luciano Gualà; Francesco Pasquale; Giacomo Scornavacca (CoRR, 2017)

Simple dynamics for plurality consensus. - Luca Becchetti; Andrea Clementi; Emanuele Natale; Francesco Pasquale; Riccardo Silvestri; Luca Trevisan 001 (Distributed Comput., 2017)

Average Whenever You Meet: Opportunistic Protocols for Community Detection. - Luca Becchetti; Andrea Clementi; Pasin Manurangsi; Emanuele Natale; Francesco Pasquale; Prasad Raghavendra; Luca Trevisan 001 (ESA, 2018)

A Tight Analysis of the Parallel Undecided-State Dynamics with Two Colors. - Andrea Clementi; Mohsen Ghaffari 001; Luciano Gualà; Emanuele Natale; Francesco Pasquale; Giacomo Scornavacca (MFCS, 2018)

Consensus Needs Broadcast in Noiseless Models but can be Exponentially Easier in the Presence of Noise. - Andrea Clementi; Luciano Gualà; Emanuele Natale; Francesco Pasquale; Giacomo Scornavacca; Luca Trevisan 001 (CoRR, 2018)

Self-stabilizing repeated balls-into-bins. - Luca Becchetti; Andrea Clementi; Emanuele Natale; Francesco Pasquale; Gustavo Posta (Distributed Comput., 2019)

Consensus vs Broadcast, with and Without Noise (Extended Abstract). - Andrea Clementi; Luciano Gualà; Emanuele Natale; Francesco Pasquale; Giacomo Scornavacca; Luca Trevisan 001 (ITCS, 2020)

Phase Transition of a Non-linear Opinion Dynamics with Noisy Interactions - (Extended Abstract). - Francesco D'Amore 001; Andrea Clementi; Emanuele Natale (SIROCCO, 2020)

Finding a Bounded-Degree Expander Inside a Dense One. - Luca Becchetti; Andrea Clementi; Emanuele Natale; Francesco Pasquale; Luca Trevisan 001 (SODA, 2020)

On the Search Efficiency of Parallel Lévy Walks on Z2. - Andrea Clementi; Francesco D'Amore 001; George Giakkoupis; Emanuele Natale (CoRR, 2020)

Phase Transition of a Non-Linear Opinion Dynamics with Noisy Interactions. - Francesco D'Amore 001; Andrea Clementi; Emanuele Natale (CoRR, 2020)

Find Your Place: Simple Distributed Algorithms for Community Detection. - Luca Becchetti; Andrea E. F. Clementi; Emanuele Natale; Francesco Pasquale; Luca Trevisan 001 (SIAM J. Comput., 2020)

Consensus Dynamics: An Overview. - Luca Becchetti; Andrea Clementi; Emanuele Natale (SIGACT News, 2020)

Search via Parallel Lévy Walks on Z2. - Andrea Clementi; Francesco D'Amore 001; George Giakkoupis; Emanuele Natale (PODC, 2021)

Sharp Thresholds for a SIR Model on One-Dimensional Small-World Networks. - Luca Becchetti; Andrea Clementi; Riccardo Denni; Francesco Pasquale; Luca Trevisan 001; Isabella Ziccardi (CoRR, 2021)

Parallel Load Balancing on constrained client-server topologies. - Andrea Clementi; Emanuele Natale; Isabella Ziccardi (Theor. Comput. Sci., 2021)

Percolation and Epidemic Processes in One-Dimensional Small-World Networks - (Extended Abstract). - Luca Becchetti; Andrea Clementi; Riccardo Denni; Francesco Pasquale; Luca Trevisan 001; Isabella Ziccardi (LATIN, 2022)

On the Multidimensional Random Subset Sum Problem. - Luca Becchetti; Arthur Carvalho Walraven da Cunha; Andrea Clementi; Francesco D'Amore 001; Hicham Lesfari; Emanuele Natale; Luca Trevisan 001 (CoRR, 2022)

Phase transition of a nonlinear opinion dynamics with noisy interactions. - Francesco D'Amore 001; Andrea Clementi; Emanuele Natale (Swarm Intell., 2022)

On the Role of Memory in Robust Opinion Dynamics. - Luca Becchetti; Andrea Clementi; Amos Korman; Francesco Pasquale; Luca Trevisan 001; Robin Vacus (IJCAI, 2023)

Expansion and flooding in dynamic random networks with node churn. - Luca Becchetti; Andrea Clementi; Francesco Pasquale; Luca Trevisan 001; Isabella Ziccardi (Random Struct. Algorithms, 2023)

The Minority Dynamics and the Power of Synchronicity. - Luca Becchetti; Andrea Clementi; Francesco Pasquale; Luca Trevisan 001; Robin Vacus; Isabella Ziccardi (SODA, 2024)

Bond percolation in small-world graphs with power-law distribution. - Luca Becchetti; Andrea Clementi; Francesco Pasquale; Luca Trevisan 001; Isabella Ziccardi (Theor. Comput. Sci., 2024)

Maintaining k-MinHash Signatures over Fully-Dynamic Data Streams with Recovery. - Andrea Clementi; Luciano Gualà; Luca Pepè Sciarria; Alessandro Straziota (WSDM, 2025)

Obituary for Luca Trevisan. - Andrea Clementi; Venkatesan Guruswami; Kristin Kane; Alon Rosen; Nikhil Srivastava; Salil P. Vadhan; Riccardo Zecchina (Bull. EATCS, 2025)

Approximate 2-hop neighborhoods on incremental graphs: An efficient lazy approach. - Luca Becchetti; Andrea Clementi; Luciano Gualà; Luca Pepè Sciarria; Alessandro Straziota; Matteo Stromieri (CoRR, 2025)

Threshold-Driven Streaming Graph: Expansion and Rumor Spreading. - Flora Angileri; Andrea Clementi; Emanuele Natale; Michele Salvi; Isabella Ziccardi (CoRR, 2025)