default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrancesco Pasquale
- > Home > Persons > Francesco Pasquale
Publications
- 2024
[j20]Luca Becchetti, Andrea Clementi, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi
:
Bond percolation in small-world graphs with power-law distribution. Theor. Comput. Sci. 1011: 114717 (2024)- [c32]Luca Becchetti, Andrea Clementi, Francesco Pasquale, Luca Trevisan, Robin Vacus, Isabella Ziccardi:
The Minority Dynamics and the Power of Synchronicity. SODA 2024: 4155-4176 - 2023
- [j19]Luca Becchetti, Andrea Clementi, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi:
Expansion and flooding in dynamic random networks with node churn. Random Struct. Algorithms 63(1): 61-101 (2023) - [c29]Luca Becchetti, Andrea Clementi, Amos Korman, Francesco Pasquale, Luca Trevisan, Robin Vacus:
On the Role of Memory in Robust Opinion Dynamics. IJCAI 2023: 29-37 - [c27]Luca Becchetti, Andrea Clementi, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi:
Bond Percolation in Small-World Graphs with Power-Law Distribution. SAND 2023: 3:1-3:22 - [i27]Luca Becchetti, Andrea Clementi, Amos Korman, Francesco Pasquale, Luca Trevisan, Robin Vacus:
On the Role of Memory in Robust Opinion Dynamics. CoRR abs/2302.08600 (2023) - [i25]Luca Becchetti, Andrea Clementi, Francesco Pasquale, Luca Trevisan, Robin Vacus, Isabella Ziccardi:
The Minority Dynamics and the Power of Synchronicity. CoRR abs/2310.13558 (2023) - 2022
- [c26]Luca Becchetti, Andrea Clementi, Riccardo Denni, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi:
Percolation and Epidemic Processes in One-Dimensional Small-World Networks - (Extended Abstract). LATIN 2022: 476-492 - [i24]Luca Becchetti, Andrea Clementi, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi:
Bond Percolation in Small-World Graphs with Power-Law Distribution. CoRR abs/2205.08774 (2022) - 2021
- [c24]Luca Becchetti, Andrea Clementi, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi:
Expansion and Flooding in Dynamic Random Networks with Node Churn. ICDCS 2021: 976-986 - [i23]Luca Becchetti, Andrea Clementi, Riccardo Denni, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi:
Sharp Thresholds for a SIR Model on One-Dimensional Small-World Networks. CoRR abs/2103.16398 (2021) - 2020
- [j17]Luca Becchetti, Andrea E. F. Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan:
Find Your Place: Simple Distributed Algorithms for Community Detection. SIAM J. Comput. 49(4): 821-864 (2020) - [c22]Andrea Clementi, Luciano Gualà, Emanuele Natale, Francesco Pasquale, Giacomo Scornavacca, Luca Trevisan:
Consensus vs Broadcast, with and Without Noise (Extended Abstract). ITCS 2020: 42:1-42:13 - [c21]Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan:
Finding a Bounded-Degree Expander Inside a Dense One. SODA 2020: 1320-1336 - [i22]Luca Becchetti, Andrea Clementi, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi:
Expansion and Flooding in Dynamic Random Networks with Node Churn. CoRR abs/2007.14681 (2020) - 2019
- [j15]Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Gustavo Posta:
Self-stabilizing repeated balls-into-bins. Distributed Comput. 32(1): 59-68 (2019) - 2018
- [c19]Luca Becchetti, Andrea Clementi, Pasin Manurangsi, Emanuele Natale, Francesco Pasquale, Prasad Raghavendra, Luca Trevisan:
Average Whenever You Meet: Opportunistic Protocols for Community Detection. ESA 2018: 7:1-7:13 - [c18]Andrea Clementi, Mohsen Ghaffari, Luciano Gualà, Emanuele Natale, Francesco Pasquale, Giacomo Scornavacca:
A Tight Analysis of the Parallel Undecided-State Dynamics with Two Colors. MFCS 2018: 28:1-28:15 - [i19]Andrea Clementi, Luciano Gualà, Emanuele Natale, Francesco Pasquale, Giacomo Scornavacca, Luca Trevisan:
Consensus Needs Broadcast in Noiseless Models but can be Exponentially Easier in the Presence of Noise. CoRR abs/1807.05626 (2018) - [i18]Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan:
Finding a Bounded-Degree Expander Inside a Dense One. CoRR abs/1811.10316 (2018) - 2017
- [j12]Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Riccardo Silvestri, Luca Trevisan:
Simple dynamics for plurality consensus. Distributed Comput. 30(4): 293-306 (2017) - [c17]Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan:
Find Your Place: Simple Distributed Algorithms for Community Detection. SODA 2017: 940-959 - [c16]Andrea Clementi, Luciano Gualà, Francesco Pasquale, Giacomo Scornavacca:
Brief Announcement: On the Parallel Undecided-State Dynamics with Two Colors. DISC 2017: 47:1-47:4 - [i17]Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Prasad Raghavendra, Luca Trevisan:
Friend or Foe? Population Protocols can perform Community Detection. CoRR abs/1703.05045 (2017) - [i16]Andrea Clementi, Luciano Gualà, Francesco Pasquale, Giacomo Scornavacca:
On the Parallel Undecided-State Dynamics with Two Colors. CoRR abs/1707.05135 (2017) - 2016
- [j10]Andrea Clementi, Pierluigi Crescenzi, Carola Doerr, Pierre Fraigniaud, Francesco Pasquale, Riccardo Silvestri:
Rumor spreading in random evolving graphs. Random Struct. Algorithms 48(2): 290-312 (2016) - [c15]Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan:
Stabilizing Consensus with Many Opinions. SODA 2016: 620-635 - 2015
- [c14]Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Riccardo Silvestri:
Plurality Consensus in the Gossip Model. SODA 2015: 371-390 - [c13]Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Gustavo Posta:
Self-Stabilizing Repeated Balls-into-Bins. SPAA 2015: 332-339 - [i15]Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Gustavo Posta:
Self-Stabilizing Repeated Balls-into-Bins. CoRR abs/1501.04822 (2015) - [i14]Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale:
Probabilistic Self-Stabilization. CoRR abs/1507.06707 (2015) - [i13]Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan:
Stabilizing Consensus with Many Opinions. CoRR abs/1508.06782 (2015) - [i12]Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan:
Find Your Place: Simple Distributed Algorithms for Community Detection. CoRR abs/1511.03927 (2015) - 2014
- [j8]Luca Becchetti, Andrea Clementi, Francesco Pasquale, Giovanni Resta, Paolo Santi, Riccardo Silvestri:
Flooding Time in Opportunistic Networks under Power Law and Exponential Intercontact Times. IEEE Trans. Parallel Distributed Syst. 25(9): 2297-2306 (2014) - [c12]Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Riccardo Silvestri, Luca Trevisan:
Simple dynamics for plurality consensus. SPAA 2014: 247-256 - [i11]Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Riccardo Silvestri:
Plurality Consensus in the Gossip Model. CoRR abs/1407.2565 (2014) - 2013
- [j6]Andrea Clementi, Francesco Pasquale, Riccardo Silvestri:
Opportunistic MANETs: Mobility Can Make Up for Low Transmission Power. IEEE/ACM Trans. Netw. 21(2): 610-620 (2013) - [c10]Andrea Clementi, Pierluigi Crescenzi, Carola Doerr, Pierre Fraigniaud, Marco Isopi, Alessandro Panconesi, Francesco Pasquale, Riccardo Silvestri:
Rumor Spreading in Random Evolving Graphs. ESA 2013: 325-336 - [i10]Andrea Clementi, Pierluigi Crescenzi, Carola Doerr, Pierre Fraigniaud, Marco Isopi, Alessandro Panconesi, Francesco Pasquale, Riccardo Silvestri:
Rumor Spreading in Random Evolving Graphs. CoRR abs/1302.3828 (2013) - [i9]Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Riccardo Silvestri, Luca Trevisan:
Simple Dynamics for Majority Consensus. CoRR abs/1310.2858 (2013) - 2012
- [j5]Andrea Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri:
Optimal gossiping in geometric radio networks in the presence of dynamical faults. Networks 59(3): 289-298 (2012) - 2011
- [j3]Andrea Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri:
Information Spreading in Stationary Markovian Evolving Graphs. IEEE Trans. Parallel Distributed Syst. 22(9): 1425-1432 (2011) - [p1]Andrea Clementi, Francesco Pasquale:
Information Spreading in Dynamic Networks: An Analytical Approach. Theoretical Aspects of Distributed Computing in Sensor Networks 2011: 591-619 - [i6]Andrea Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri:
Information Spreading in Stationary Markovian Evolving Graphs. CoRR abs/1103.0741 (2011) - [i4]Luca Becchetti, Andrea Clementi, Francesco Pasquale, Giovanni Resta, Paolo Santi, Riccardo Silvestri:
Information Spreading in Opportunistic Networks is Fast. CoRR abs/1107.5241 (2011) - 2010
- [j2]Andrea E. F. Clementi, Claudio Macci, Angelo Monti, Francesco Pasquale, Riccardo Silvestri:
Flooding Time of Edge-Markovian Evolving Graphs. SIAM J. Discret. Math. 24(4): 1694-1712 (2010) - 2009
- [j1]Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri:
Broadcasting in dynamic radio networks. J. Comput. Syst. Sci. 75(4): 213-230 (2009) - [c5]Andrea E. F. Clementi, Francesco Pasquale, Riccardo Silvestri:
MANETS: High Mobility Can Make Up for Low Transmission Power. ICALP (2) 2009: 387-398 - [c4]Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri:
Information spreading in stationary Markovian evolving graphs. IPDPS 2009: 1-12 - [i2]Andrea E. F. Clementi, Francesco Pasquale, Riccardo Silvestri:
MANETS: High mobility can make up for low transmission power. CoRR abs/0903.0520 (2009) - 2008
- [c3]Andrea E. F. Clementi, Claudio Macci, Angelo Monti, Francesco Pasquale, Riccardo Silvestri:
Flooding time in edge-Markovian dynamic graphs. PODC 2008: 213-222 - 2007
- [c2]Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri:
Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults. MFCS 2007: 430-441 - [c1]Andrea E. F. Clementi, Francesco Pasquale, Angelo Monti, Riccardo Silvestri:
Communication in dynamic radio networks. PODC 2007: 205-214
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 2024-07-20 21:24 CEST 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:
