Emanuele Natale

Laurent Viennot

Proceedings of the Optimization and Learning - 6th International Conference, 2023

Polynomially Over-Parameterized Convolutional Neural Networks Contain Structured Strong Winning Lottery Tickets.

[BibT_eX]

[DOI]

Arthur C. W. da Cunha

Arthur Carvalho Walraven da Cunha

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Revisiting the Random Subset Sum Problem.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

Phase transition of a nonlinear opinion dynamics with noisy interactions.

[BibT_eX]

[DOI]

Swarm Intell., 2022

On the Multidimensional Random Subset Sum Problem.

[BibT_eX]

[DOI]

Arthur Carvalho Walraven da Cunha

CoRR, 2022

Proving the Lottery Ticket Hypothesis for Convolutional Neural Networks.

[BibT_eX]

[DOI]

Arthur C. W. da Cunha

Christos H. Papadimitriou

Laurent Viennot

Proceedings of the Tenth International Conference on Learning Representations, 2022

Planning with Biological Neurons and Synapses.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Parallel Load Balancing on constrained client-server topologies.

[BibT_eX]

[DOI]

Isabella Ziccardi

Theor. Comput. Sci., 2021

Phase transition of the 2-Choices dynamics on core-periphery networks.

[BibT_eX]

[DOI]

Distributed Comput., 2021

Search via Parallel Lévy Walks on Z2.

[BibT_eX]

[DOI]

Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

2020

Consensus Dynamics: An Overview.

[BibT_eX]

[DOI]

SIGACT News, 2020

Find Your Place: Simple Distributed Algorithms for Community Detection.

[BibT_eX]

[DOI]

Andrea E. F. Clementi

Francesco Pasquale

Luca Trevisan

SIAM J. Comput., 2020

Phase Transition of a Non-Linear Opinion Dynamics with Noisy Interactions.

[BibT_eX]

[DOI]

CoRR, 2020

On the Search Efficiency of Parallel Lévy Walks on Z<sup>2</sup>.

[BibT_eX]

[DOI]

CoRR, 2020

Finding a Bounded-Degree Expander Inside a Dense One.

[BibT_eX]

[DOI]

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

Phase Transition of a Non-linear Opinion Dynamics with Noisy Interactions - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 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

KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation.

[BibT_eX]

[DOI]

Michele Borassi

ACM J. Exp. Algorithmics, 2019

Noisy rumor spreading and plurality consensus.

[BibT_eX]

[DOI]

Pierre Fraigniaud

Distributed Comput., 2019

Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits.

[BibT_eX]

[DOI]

Lucas Boczkowski

Amos Korman

Distributed Comput., 2019

Self-stabilizing repeated balls-into-bins.

[BibT_eX]

[DOI]

Distributed Comput., 2019

A Comparative Study of Neural Network Compression.

[BibT_eX]

[DOI]

Hossein Baktash

Laurent Viennot

CoRR, 2019

From Distributed Computing to Natural Algorithms and Beyond (text not included).

[BibT_eX]

Proceedings of the 20th Italian Conference on Theoretical Computer Science, 2019

On the Necessary Memory to Compute the Plurality in Multi-agent Systems.

[BibT_eX]

[DOI]

Iliad Ramezani

Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

Distributed Community Detection via Metastability of the 2-Choices Dynamics.

[BibT_eX]

[DOI]

Emilio Cruciani

Giacomo Scornavacca

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Limits on reliable information flows through stochastic populations.

[BibT_eX]

[DOI]

PLoS Comput. Biol., 2018

On the Computational Power of Simple Dynamics.

[BibT_eX]

[DOI]

Bull. EATCS, 2018

On the Metastability of Quadratic Majority Dynamics on Clustered Graphs and its Biological Implications.

[BibT_eX]

[DOI]

Emilio Cruciani

Giacomo Scornavacca

Bull. EATCS, 2018

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

[BibT_eX]

[DOI]

CoRR, 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

Limits for Rumor Spreading in Stochastic Populations.

[BibT_eX]

[DOI]

Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

On the Emergent Behavior of the 2-Choices Dynamics.

[BibT_eX]

[DOI]

Proceedings of the 19th Italian Conference on Theoretical 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

Pooling or Sampling: Collective Dynamics for Electrical Flow Estimation.

[BibT_eX]

[DOI]

Vincenzo Bonifaci

Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

2017

On the Computational Power of Simple Dynamics. (Sur la puissance de calcul de le dynamiques simples).

[BibT_eX]

[DOI]

PhD thesis, 2017

Simple dynamics for plurality consensus.

[BibT_eX]

[DOI]

Distributed Comput., 2017

Friend or Foe? Population Protocols can perform Community Detection.

[BibT_eX]

[DOI]

CoRR, 2017

Ignore or Comply?: On Breaking Symmetry in Consensus.

[BibT_eX]

[DOI]

Frederik Mallmann-Trenn

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

2016

Self-Stabilizing Clock Synchronization with 3-bit messages.

[BibT_eX]

[DOI]

Lucas Boczkowski

Amos Korman

CoRR, 2016

Stabilizing Consensus with Many Opinions.

[BibT_eX]

[DOI]

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

Brief Announcement: Self-stabilizing Clock Synchronization with 3-bit Messages.

[BibT_eX]

[DOI]

Lucas Boczkowski

Amos Korman

Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

On the Voting Time of the Deterministic Majority Process.

[BibT_eX]

[DOI]

Dominik Kaaser

Frederik Mallmann-Trenn

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Large Peg-Army Maneuvers.

[BibT_eX]

[DOI]

Proceedings of the 8th International Conference on Fun with Algorithms, 2016

2015

Distributed community detection in dynamic graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Noisy Information Spreading and Plurality Consensus.

[BibT_eX]

[DOI]

Pierre Fraigniaud

CoRR, 2015

Probabilistic Self-Stabilization.

[BibT_eX]

[DOI]

CoRR, 2015

Plurality Consensus in the Gossip Model.

[BibT_eX]

[DOI]

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

2014

Bejeweled, Candy Crush and other match-three games are (NP-)hard.

[BibT_eX]

[DOI]

Luciano Gualà

Stefano Leucci