default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrancesco d'Amore 0001
Person information
- affiliation: Gran Sasso Science Institute, L'Aquila, Italy
- affiliation (former): Bocconi University, Milan, Italy
- affiliation (former): Aalto University, Department of Computer Science, Espoo, Finland
- affiliation (former, PhD 2022): Côte d'Azur University, Nice, France
Other persons with the same name
- Francesco D'Amore 0002
![[0000-0001-5176-5706]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0001-5176-5706")
— National Research Council of Italy, Institute for High Performance Computing and Networking (ICAR-CNR), Rende, Italy (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j3]Francesco d'Amore:
On the limits of distributed quantum computing. Bull. EATCS 145 (2025)- [j2]Francesco d'Amore, Isabella Ziccardi:
Phase transition of the 3-majority opinion dynamics with noisy interactions. Theor. Comput. Sci. 1028: 115030 (2025) - [c12]Alkida Balliu, Sebastian Brandt, Xavier Coiteux-Roy, Francesco d'Amore, Massimo Equi, François Le Gall, Henrik Lievonen, Augusto Modanese, Dennis Olivetti, Marc-Olivier Renou, Jukka Suomela, Lucas Tendick, Isadora Veeren:
Distributed Quantum Advantage for Local Problems. STOC 2025: 451-462 - [c11]Amirreza Akbari, Xavier Coiteux-Roy, Francesco d'Amore, François Le Gall, Henrik Lievonen, Darya Melnyk, Augusto Modanese, Shreyas Pai, Marc-Olivier Renou, Václav Rozhon, Jukka Suomela:
Online Locality Meets Distributed Quantum Computing. STOC 2025: 1295-1306 - [c10]Alkida Balliu, Corinna Coupette, Antonio Cruciani, Francesco d'Amore, Massimo Equi, Henrik Lievonen, Augusto Modanese, Dennis Olivetti, Jukka Suomela:
New Limits on Distributed Quantum Advantage: Dequantizing Linear Programs. DISC 2025: 11:1-11:22 - [c9]Francesco d'Amore, Niccolò D'Archivio, George Giakkoupis, Emanuele Natale:
On the h-Majority Dynamics with Many Opinions. DISC 2025: 27:1-27:24 - [i16]Francesco d'Amore:
On the Limits of Distributed Quantum Computing. CoRR abs/2503.11394 (2025) - [i15]Alkida Balliu, Filippo Casagrande, Francesco d'Amore, Massimo Equi, Barbara Keller, Henrik Lievonen, Dennis Olivetti, Gustav Schmid, Jukka Suomela:
Distributed Quantum Advantage in Locally Checkable Labeling Problems. CoRR abs/2504.05191 (2025) - [i14]Alkida Balliu, Corinna Coupette, Antonio Cruciani, Francesco d'Amore, Massimo Equi, Henrik Lievonen, Augusto Modanese, Dennis Olivetti, Jukka Suomela:
New Limits on Distributed Quantum Advantage: Dequantizing Linear Programs. CoRR abs/2506.07574 (2025) - [i13]Francesco d'Amore, Niccolò D'Archivio, George Giakkoupis, Emanuele Natale:
On the h-majority dynamics with many opinions. CoRR abs/2506.20218 (2025) - [i12]Alkida Balliu, Thomas Boudier, Francesco d'Amore, Dennis Olivetti, Gustav Schmid, Jukka Suomela:
Distributed Algorithms for Potential Problems. CoRR abs/2507.12038 (2025) - [i11]Alkida Balliu, Filippo Casagrande, Francesco d'Amore, Dennis Olivetti:
New Hardness Results for the LOCAL Model via a Simple Self-Reduction. CoRR abs/2510.19972 (2025) - 2024
- [c8]Xavier Coiteux-Roy, Francesco d'Amore, Rishikesh Gajjala, Fabian Kuhn, François Le Gall, Henrik Lievonen, Augusto Modanese, Marc-Olivier Renou, Gustav Schmid, Jukka Suomela:
No Distributed Quantum Advantage for Approximate Graph Coloring. STOC 2024: 1901-1910 - [i10]Amirreza Akbari, Xavier Coiteux-Roy, Francesco d'Amore, François Le Gall, Henrik Lievonen, Darya Melnyk, Augusto Modanese, Shreyas Pai, Marc-Olivier Renou, Václav Rozhon, Jukka Suomela:
Online Locality Meets Distributed Quantum Computing. CoRR abs/2403.01903 (2024) - [i9]Alkida Balliu, Sebastian Brandt, Xavier Coiteux-Roy, Francesco d'Amore, Massimo Equi, François Le Gall, Henrik Lievonen, Augusto Modanese, Dennis Olivetti, Marc-Olivier Renou, Jukka Suomela, Lucas Tendick, Isadora Veeren:
Distributed Quantum Advantage for Local Problems. CoRR abs/2411.03240 (2024) - 2023
- [c7]Arthur Carvalho Walraven da Cunha, Francesco d'Amore, Frédéric Giroire, Hicham Lesfari, Emanuele Natale, Laurent Viennot:
Revisiting the Random Subset Sum Problem. ESA 2023: 37:1-37:11 - [c6]Arthur da Cunha, Francesco d'Amore, Emanuele Natale:
Polynomially Over-Parameterized Convolutional Neural Networks Contain Structured Strong Winning Lottery Tickets. NeurIPS 2023 - [c5]Sameep Dahal, Francesco d'Amore, Henrik Lievonen, Timothé Picavet, Jukka Suomela:
Brief Announcement: Distributed Derandomization Revisited. DISC 2023: 40:1-40:5 - [i8]Sameep Dahal, Francesco d'Amore, Henrik Lievonen, Timothé Picavet, Jukka Suomela:
Distributed derandomization revisited. CoRR abs/2305.07351 (2023) - [i7]Xavier Coiteux-Roy, Francesco d'Amore, Rishikesh Gajjala, Fabian Kuhn, François Le Gall, Henrik Lievonen, Augusto Modanese, Marc-Olivier Renou, Gustav Schmid, Jukka Suomela:
No distributed quantum advantage for approximate graph coloring. CoRR abs/2307.09444 (2023) - [i6]Arthur da Cunha, Francesco d'Amore, Emanuele Natale:
Polynomially Over-Parameterized Convolutional Neural Networks Contain Structured Strong Winning Lottery Tickets. CoRR abs/2311.09858 (2023) - 2022
- [b1]Francesco d'Amore:
On the collective behaviors of bio-inspired distributed systems. (Sur les comportements collectifs de systèmes distribués bio-inspirés). Côte d'Azur University, Nice, France, 2022 - [j1]Francesco d'Amore, Andrea Clementi, Emanuele Natale:
Phase transition of a nonlinear opinion dynamics with noisy interactions. Swarm Intell. 16(4): 261-304 (2022) - [c4]Francesco d'Amore, Daniel Mitropolsky, Pierluigi Crescenzi, Emanuele Natale, Christos H. Papadimitriou:
Planning with Biological Neurons and Synapses. AAAI 2022: 21-28 - [c3]Francesco d'Amore, Isabella Ziccardi:
Phase Transition of the 3-Majority Dynamics with Uniform Communication Noise. SIROCCO 2022: 98-115 - [i5]Luca Becchetti, Arthur Carvalho Walraven da Cunha, Andrea Clementi, Francesco d'Amore, Hicham Lesfari, Emanuele Natale, Luca Trevisan:
On the Multidimensional Random Subset Sum Problem. CoRR abs/2207.13944 (2022) - 2021
- [c2]Andrea Clementi, Francesco d'Amore, George Giakkoupis, Emanuele Natale:
Search via Parallel Lévy Walks on Z2. PODC 2021: 81-91 - [i4]Francesco d'Amore, Isabella Ziccardi:
Phase Transition of the 3-Majority Dynamics with Uniform Communication Noise. CoRR abs/2112.03543 (2021) - [i3]Francesco d'Amore, Daniel Mitropolsky, Pierluigi Crescenzi, Emanuele Natale, Christos H. Papadimitriou:
Planning with Biological Neurons and Synapses. CoRR abs/2112.08186 (2021) - 2020
- [c1]Francesco d'Amore, Andrea Clementi, Emanuele Natale:
Phase Transition of a Non-linear Opinion Dynamics with Noisy Interactions - (Extended Abstract). SIROCCO 2020: 255-272 - [i2]Andrea Clementi, Francesco d'Amore, George Giakkoupis, Emanuele Natale:
On the Search Efficiency of Parallel Lévy Walks on Z2. CoRR abs/2004.01562 (2020) - [i1]Francesco d'Amore, Andrea Clementi, Emanuele Natale:
Phase Transition of a Non-Linear Opinion Dynamics with Noisy Interactions. CoRR abs/2005.07423 (2020)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-12-28 00:27 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
