Francesco Pasquale

Proceedings of the 24th International Conference on Distributed Computing and Networking, 2023

2022

Biased opinion dynamics: when the devil is in the details.

[BibT_eX]

[DOI]

Inf. Sci., 2022

Brief Announcement: Dynamic Graph Models for the Bitcoin P2P Network: Simulation Analysis for Expansion and Flooding Time.

[BibT_eX]

[DOI]

Antonio Cruciani

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2022

Percolation and Epidemic Processes in One-Dimensional Small-World Networks - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the LATIN 2022: Theoretical Informatics, 2022

2021

Sharp Thresholds for a SIR Model on One-Dimensional Small-World Networks.

[BibT_eX]

[DOI]

CoRR, 2021

2020

Step-by-step community detection in volume-regular graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Find Your Place: Simple Distributed Algorithms for Community Detection.

[BibT_eX]

[DOI]

Luca Becchetti

Emanuele Natale

Luca Trevisan

SIAM J. Comput., 2020

Finding a Bounded-Degree Expander Inside a Dense One.

[BibT_eX]

[DOI]

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Consensus vs Broadcast, with and Without Noise (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

2019

Self-stabilizing repeated balls-into-bins.

[BibT_eX]

[DOI]

Distributed Comput., 2019

2018

Randomness and Metastability in Game Theory and Distributed Computing.

[BibT_eX]

[DOI]

Bull. EATCS, 2018

Consensus Needs Broadcast in Noiseless Models but can be Exponentially Easier in the Presence of Noise.

[BibT_eX]

[DOI]

CoRR, 2018

Metastability of Logit Dynamics for Coordination Games.

[BibT_eX]

[DOI]

Algorithmica, 2018

A Tight Analysis of the Parallel Undecided-State Dynamics with Two Colors.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Average Whenever You Meet: Opportunistic Protocols for Community Detection.

[BibT_eX]

[DOI]

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017

Simple dynamics for plurality consensus.

[BibT_eX]

[DOI]

Distributed Comput., 2017

On the Parallel Undecided-State Dynamics with Two Colors.

[BibT_eX]

[DOI]

CoRR, 2017

Friend or Foe? Population Protocols can perform Community Detection.

[BibT_eX]

[DOI]

CoRR, 2017

Brief Announcement: On the Parallel Undecided-State Dynamics with Two Colors.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Distributed Computing, 2017

2016

Rumor spreading in random evolving graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2016

Convergence to Equilibrium of Logit Dynamics for Strategic Games.

[BibT_eX]

[DOI]

Algorithmica, 2016

Stabilizing Consensus with Many Opinions.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015

Probabilistic Self-Stabilization.

[BibT_eX]

[DOI]

CoRR, 2015

Logit Dynamics with Concurrent Updates for Local Interaction Potential Games.

[BibT_eX]

[DOI]

Algorithmica, 2015

Plurality Consensus in the Gossip Model.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014

Flooding Time in Opportunistic Networks under Power Law and Exponential Intercontact Times.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2014

2013

Opportunistic MANETs: Mobility Can Make Up for Low Transmission Power.

[BibT_eX]

[DOI]

Andrea Clementi

IEEE/ACM Trans. Netw., 2013

Mixing Time and Stationary Expected Social Welfare of Logit Dynamics.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2013

Simple Dynamics for Majority Consensus.

[BibT_eX]

[DOI]

CoRR, 2013

Rumor Spreading in Random Evolving Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2013, 2013

Logit Dynamics with Concurrent Updates for Local Interaction Games.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2013, 2013

2012

A note on uniform power connectivity in the physical signal to interference plus noise (SINR) model.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Optimal gossiping in geometric radio networks in the presence of dynamical faults.

[BibT_eX]

[DOI]

Networks, 2012

Reversibility and Mixing Time for Logit Dynamics with Concurrent Updates

[BibT_eX]

[DOI]

CoRR, 2012

2011

Information Spreading in Dynamic Networks: An Analytical Approach.

[BibT_eX]

[DOI]

Andrea Clementi

Proceedings of the Theoretical Aspects of Distributed Computing in Sensor Networks, 2011

Information Spreading in Stationary Markovian Evolving Graphs.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2011

Information Spreading in Opportunistic Networks is Fast

[BibT_eX]

[DOI]

CoRR, 2011

2010

Flooding Time of Edge-Markovian Evolving Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

2009

Broadcasting in dynamic radio networks.

[BibT_eX]

[DOI]

Angelo Monti

J. Comput. Syst. Sci., 2009

MANETS: High Mobility Can Make Up for Low Transmission Power.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

A Note on Uniform Power Connectivity in the SINR Model.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2009

2008

Flooding time in edge-Markovian dynamic graphs.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

2007

Communication in dynamic radio networks.

[BibT_eX]

[DOI]

Angelo Monti

Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults.

[BibT_eX]

[DOI]

Angelo Monti