default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLinda Pagli
- > Home > Persons > Linda Pagli
Publications
- 2020
[j56]Ajoy K. Datta, Paolo Ferragina, Lawrence L. Larmore, Linda Pagli, Giuseppe Prencipe
:
Linear time distributed swap edge algorithms. Inf. Process. Lett. 161: 105979 (2020)- [j55]Giuseppe Antonio Di Luna, Paola Flocchini, Linda Pagli, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta:
Gathering in dynamic rings. Theor. Comput. Sci. 811: 79-98 (2020) - [j54]Hiro Ito, Stefano Leonardi, Linda Pagli, Giuseppe Prencipe:
FUN editorial. Theor. Comput. Sci. 842: 131 (2020) - 2019
- [c42]Shantanu Das, Giuseppe Antonio Di Luna, Linda Pagli, Giuseppe Prencipe:
Compacting and Grouping Mobile Agents on Dynamic Rings. TAMC 2019: 114-133 - 2018
- [e1]Hiro Ito, Stefano Leonardi, Linda Pagli, Giuseppe Prencipe:
9th International Conference on Fun with Algorithms, FUN 2018, June 13-15, 2018, La Maddalena, Italy. LIPIcs 100, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-067-5 [contents] - 2017
- [c39]Giuseppe Antonio Di Luna, Paola Flocchini, Linda Pagli, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta:
Gathering in Dynamic Rings. SIROCCO 2017: 339-355 - [i5]Giuseppe Antonio Di Luna, Paola Flocchini, Linda Pagli, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta:
Gathering in Dynamic Rings. CoRR abs/1704.02427 (2017) - 2015
- [j50]Linda Pagli, Giuseppe Prencipe, Giovanni Viglietta:
Getting close without touching: near-gathering for autonomous mobile robots. Distributed Comput. 28(5): 333-349 (2015) - [i3]Linda Pagli, Giuseppe Prencipe, Giovanni Viglietta:
Getting Close Without Touching: Near-Gathering for Autonomous Mobile Robots. CoRR abs/1505.07168 (2015) - 2013
- [c36]Ajoy Kumar Datta, Lawrence L. Larmore, Linda Pagli, Giuseppe Prencipe:
Linear Time Distributed Swap Edge Algorithms. CIAC 2013: 122-133 - 2012
- [j47]Paola Flocchini, Toni Mesa Enriquez, Linda Pagli, Giuseppe Prencipe, Nicola Santoro:
Distributed Minimum Spanning Tree Maintenance for Transient Node Failures. IEEE Trans. Computers 61(3): 408-414 (2012) - [c34]Linda Pagli, Giuseppe Prencipe, Giovanni Viglietta:
Getting Close without Touching. SIROCCO 2012: 315-326 - 2009
- [c31]Linda Pagli, Giuseppe Prencipe:
Brief Annoucement: Distributed Swap Edges Computation for Minimum Routing Cost Spanning Trees. OPODIS 2009: 365-371 - 2008
- [j44]Paola Flocchini, Linda Pagli, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer:
Computing all the best swap edges distributively. J. Parallel Distributed Comput. 68(7): 976-983 (2008) - 2007
- [c30]Paola Flocchini, Toni Mesa Enriquez, Linda Pagli, Giuseppe Prencipe, Nicola Santoro:
Distributed Computation of All Node Replacements of a Minimum Spanning Tree. Euro-Par 2007: 598-607 - 2006
- [j39]Paola Flocchini, Antonio Mesa Enriques, Linda Pagli, Giuseppe Prencipe, Nicola Santoro:
Point-of-Failure Shortest-Path Rerouting: Computing the Optimal Swap Edges Distributively. IEICE Trans. Inf. Syst. 89-D(2): 700-708 (2006) - 2004
- [c25]Paola Flocchini, Antonio Mesa Enriques, Linda Pagli, Giuseppe Prencipe, Nicola Santoro:
Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree. IFIP TCS 2004: 153-166 - [c24]Linda Pagli, Giuseppe Prencipe, Tranos Zuva:
Distributed Computation for Swapping a Failing Edge. IWDC 2004: 28-39 - [c23]Paola Flocchini, Linda Pagli, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer, Tranos Zuva:
Computing All the Best Swap Edges Distributively. OPODIS 2004: 154-168
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-05-31 17:55 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:
