Home - Publications - CV - Material - Research - Contact

Teaching

A.A. 2021/2022

• Elements of Computational Modeling in Julia, at Gran Sasso Science Institute
• (In Italian) Elements of Computational Modeling in Julia, at Università di Roma “Tor Vergata”

A.A. 2019/2020 (in Italian)

• Natural Distributed Algorithms, at Università di Roma “Tor Vergata”

2018

• MPII Forschungstage Informatik miniworkshop - Harvesting Planted Solutions: Experiments in Average-Case Complexity, at Max Planck Institute for Informatics

2017

• Guest lecture in the Theory of Distributed Systems course (slides), at Max Planck Institute for Informatics
• Reading Group Algorithms - Seminar, at Max Planck Institute for Informatics
• MPII Forschungstage Informatik miniworkshop - Ghostbusters in Matrix: Experiments in Spectral Graph Theory, at Max Planck Institute for Informatics

A.A. 2015/2016 (in Italian)

• Teoria dei codici e informazione - Esercitazioni, at Università di Roma “Tor Vergata”
• Algoritmi Distribuiti e Reti Complesse - Seminario, at Università di Roma “Tor Vergata”

A.A. 2014/2015 (in Italian)

• Teoria dei codici e informazione - Esercitazioni, at Università di Roma “Tor Vergata”
• Algoritmi Distribuiti e Reti Complesse - Seminario, at Università di Roma “Tor Vergata”

A.A. 2013/2014 (in Italian)

• Olimpiadi di Informatica - Corso preparatorio per le selezioni territoriali, at Sapienza University of Rome
• Teoria dei codici e informazione - Esercitazioni, at Università di Roma “Tor Vergata”

---

Talks

2021

• Biological Distributed Algorithms and Lévy Walks, INRIA Evaluation, virtual talk. PDF.

2020

• Algorithms for Simplifying Neural Networks, Innovation Defense Lab, Paris (FR). Cancelled (COVID-19). PDF.

• SEA 2021 Trailer, at SEA 2021, virtual conference. PDF.

2019

• From Distributed Computing to Natural Algorithms and Beyond, Invited talk at the 18th ICTCS, Como (IT). PDF.
• Computing through Simplicity: Computational Dynamics and Applications, at INRIA Sophia Antipolis (FR). PDF.
• On the Necessary Memory to Compute the Plurality in Multi-Agent Systems, at CIAC19, Rome (IT). PDF.
• Smart Contracts and Blockchain, Minicorso su Blockchain, University of Rome Tor Vergata - Rome (IT). PDF.
• Finding a Bounded-Degree Expander Inside a Dense One, COATI Group Seminar, I3S - Sophia Antipolis (FR). PDF.
• Finding a Bounded-Degree Expander Inside a Dense One, IRISA, Rennes (FR). PDF.

2018

• Computing through Simplicity: Towards a Theory of Dynamics, at the Assemblée Générale, I3S. - Sophia Antipolis (FR). PDF.
• Consensus needs Broadcast in Noiseless Models but can be Exponentially Easier in the Presence of Noise, at ADFOCS18, MPII - Saarbrücken (DE). PDF.
• Computing with Simple Dynamics and Biological Applications, Saarland Informatics Campus Lecture Series, Saarbrücken (DE). PDF.
• Pooling or Sampling: Collective Dynamics for Electrical Flow Estimation, at BDA18, London (UK). PDF.
• On the Metastability of Quadratic Majority Dynamics on Clustered Graphs and its Biological Implications, at BDA18, London (UK). PDF.
• “An optimal brain can be composed of conflicting agents” by Adi Livnat and Nicholas Pippenger, MPII D1 Reading Group, Blackboard talk.
• Pooling or Sampling: Collective Dynamics for Electrical Flow Estimation, at AAMAS18, Stockholm (SE). PDF.
• Pooling or Sampling: Collective Dynamics for Electrical Flow Estimation, MPII AG1 Mittagsseminar, Saarbrücken (DE). PDF.
• Pooling or Sampling: Collective Dynamics for Electrical Flow Estimation, I3S, Sophia Antipolis (FR). PDF.
• Pooling or Sampling: Collective Dynamics for Electrical Flow Estimation, IRIF, Paris (FR). PDF.
• State-Efficient Plurality Consensus in Population Protocols, TCS Lunch Seminar at U.C. Berkeley. Whiteboard talk.

2017

• Computing through Dynamics: Principles for Distributed Coordination, IRIF, Paris (FR). PDF.
• What can be Computed in a Simple Chaotic Way?, Invited talk at the 18th ICTCS, Naples (IT). PDF, Published extended abstract.
• What can be Computed in a Simple Chaotic Way?, Seminar at the 18th ADFOCS, Saarbrücken (DE). PDF.
• POSTER: Community Detection in Population Protocols. MPII poster session for the Scientific Advisory Board visit, Saarbrücken (DE). PDF.
• Friend or Foe? Population Protocols can perform Community Detection, Algorithms and Complexity Seminar, at IRIF, Paris (FR). PDF.
• On the Computational Power of Simple Dynamics, Hamburg Universität, Hamburg (DE). PDF.
• On the Computational Power of Simple Dynamics, Final PhD Thesis Defense, Sapienza University of Rome, Rome (IT). PDF.
• Find Your Place: Simple Distributed Algorithms for Community Detection, at SODA 2017, Barcelona (ES). PDF.

2016

• On the Computational Power of Simple Dynamics, Internal PhD Thesis Defense, Sapienza University of Rome, Rome (IT). PDF.
• Find Your Place: Simple Distributed Algorithms for Community Detection, Mittagsseminar of the MMPI, Saarbrücken (DE). PDF.
• Find Your Place: Simple Distributed Algorithms for Community Detection, at the Workshop on Random Processes in Discrete Structures. University of Warwick, Coventry (UK). PDF.
• KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation, at ESA 2016. Aarhus (Denmark). PDF.
• Brief Announcement: Self-Stabilizing Clock Synchronization with 3-bit Messages, at PODC 2016. Chicago (IL, USA). PDF.
• Noisy Rumor Spreading and Plurality Consensus, at PODC 2016. Chicago (IL, USA). PDF.
• Self-Stabilizing Broadcast with O(1)-Bit Messages, at BDA 2016. Chicago (IL, USA). PDF.
• Dynamics, Consensus, and Distributed Community Detection, at HALG 2016. Paris (France). PDF.
• Stabilizing Consensus with Many Opinions, at SODA 2016. Arlington (VA, USA). PDF.

2015

• Congestion and Consensus on non-Complete Graphs, at Research Retreat on Graph Analytics. Bertinoro (FC, Italy). PDF.
• Gossip Algorithms for Majority Consensus, Talk required in order to be admitted to the 3rd year of PhD school in CS at Sapienza University. Rome (Italy). PDF.
• Probabilistic Self Stabilization, at ICTCS 2015. Firenze (Italy). PDF.
• Noisy Rumor Spreading and Plurality Consensus, at BDA 2015. Boston (MA, USA). PDF.
• Self-stabilizing Repeated Balls-into-Bins, at SPAA 2015. Portland (OR, USA). PDF.
• Plurality Consensus in the Gossip Model, Efficient Algorithms Group of Salzburg University, CS Department. Salzburg (Austria). PDF.
• Plurality Consensus in the Gossip Model, at PRIN Project Meeting 2015. Bertinoro (FC, Italy). Source, PDF.
• Plurality Consensus in the Gossip Model, at SODA 2015. San Diego (CA, USA). Source, PDF.

2014

• Plurality Dynamics in Distributed Synchronous Systems, at Processi stocastici su grafi 2014. Dipartimento di Matematica, Sapienza University of Rome. Source, PDF.
• Bejeweled, Candy Crush and other Match-Three Games are (NP-)Hard, at CIG 2014. Dortmund (Germany). Source, PDF.

2013

• Open Mathematics with Sage, at Linux Day Roma 2013, Rome (Italy). Sage notebook.