default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLinda Pagli
Person information
- affiliation: University of Pisa, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c45]Fabrizio Luccio, Linda Pagli, Nicola Santoro:
Variations on the Tournament Problem. FUN 2024: 20:1-20:11- 2021
- [j57]Fabrizio Luccio, Linda Pagli
:
Cops and robber on grids and tori: basic algorithms and their extension to a large number of cops. J. Supercomput. 77(9): 9746-9770 (2021) - [c44]Fabrizio Luccio, Linda Pagli:
Mobile Agents Operating on a Grid: Some Non-conventional Issues in Parallel Computing. PaCT 2021: 402-410 - 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)
2010 – 2019
- 2019
- [c43]Fabrizio Luccio, Linda Pagli:
Capture on Grids and Tori with Different Numbers of Cops. PaCT 2019: 431-444 - [c42]Shantanu Das, Giuseppe Antonio Di Luna, Linda Pagli, Giuseppe Prencipe:
Compacting and Grouping Mobile Agents on Dynamic Rings. TAMC 2019: 114-133 - 2018
- [c41]Anna Bernasconi, Antonio Boffa, Fabrizio Luccio, Linda Pagli:
The Connection Layout in a Lattice of Four-Terminal Switches. VLSI-SoC (Selected Papers) 2018: 32-52 - [c40]Anna Bernasconi, Antonio Boffa, Fabrizio Luccio, Linda Pagli:
Two Combinatorial Problems on the Layout of Switching Lattices. VLSI-SoC 2018: 137-142 - [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) - [i4]Fabrizio Luccio, Linda Pagli:
Cops and robber on grids and tori. CoRR abs/1708.08255 (2017) - 2016
- [j53]Fabrizio Luccio, Bernard Mans, Luke Mathieson, Linda Pagli:
Complete Balancing via Rotation. Comput. J. 59(8): 1252-1263 (2016) - [j52]Paola Flocchini, Fabrizio Luccio, Linda Pagli, Nicola Santoro:
Network decontamination under m-immunity. Discret. Appl. Math. 201: 114-129 (2016) - [j51]Fabrizio Luccio, Linda Pagli:
More agents may decrease global work: A case in butterfly decontamination. Theor. Comput. Sci. 655: 41-57 (2016) - [c38]Francesco Cambi, Pierluigi Crescenzi, Linda Pagli:
Analyzing and Comparing On-Line News Sources via (Two-Layer) Incremental Clustering. FUN 2016: 9:1-9:14 - 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) - [c37]Fabrizio Luccio, Linda Pagli:
Soulmate Algorithms. Programming Languages with Applications to Biology and Security 2015: 283-291 - [i3]Linda Pagli, Giuseppe Prencipe, Giovanni Viglietta:
Getting Close Without Touching: Near-Gathering for Autonomous Mobile Robots. CoRR abs/1505.07168 (2015) - 2013
- [j49]Fabrizio Luccio, Linda Pagli:
Chain rotations: A new look at tree distance. Inf. Process. Lett. 113(7): 201-204 (2013) - [j48]Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli:
Compact DSOP and Partial DSOP Forms. Theory Comput. Syst. 53(4): 583-608 (2013) - [c36]Ajoy Kumar Datta, Lawrence L. Larmore, Linda Pagli, Giuseppe Prencipe:
Linear Time Distributed Swap Edge Algorithms. CIAC 2013: 122-133 - [c35]Paola Flocchini, Fabrizio Luccio, Linda Pagli, Nicola Santoro:
Optimal Network Decontamination with Threshold Immunity. CIAC 2013: 234-245 - 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 - [i2]Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli:
Compact DSOP and partial DSOP Forms. CoRR abs/1204.5306 (2012) - [i1]Fabrizio Luccio, Linda Pagli:
Chain Rotations: a New Look at Tree Distance. CoRR abs/1204.5929 (2012) - 2011
- [b1]Fabrizio Luccio, Linda Pagli, Graham Steel:
Mathematical and Algorithmic Foundations of the Internet. Chapman and Hall / CRC Applied Algorithms and Data Structures Series, CRC Press 2011, ISBN 978-1-4398-3138-0, pp. I-XV, 1-205 - 2010
- [j46]Fabrizio Luccio, Antonio Mesa Enriques, Linda Pagli:
Lower bounds on the rotation distance of binary trees. Inf. Process. Lett. 110(21): 934-938 (2010) - [c33]Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli:
Fun at a Department Store: Data Mining Meets Switching Theory. FUN 2010: 41-52
2000 – 2009
- 2009
- [j45]Fabrizio Luccio, Linda Pagli:
The Fermat star of binary trees. Inf. Process. Lett. 109(11): 568-571 (2009) - [c32]Fabrizio Luccio, Linda Pagli:
A general approach to toroidal mesh decontamination with local immunity. IPDPS 2009: 1-8 - [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) - [j43]Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli:
Synthesis of Autosymmetric Functions in a New Three-Level Form. Theory Comput. Syst. 42(4): 450-464 (2008) - 2007
- [j42]Fabrizio Luccio, Linda Pagli, Nicola Santoro:
Network decontamination in Presence of Local Immunity. Int. J. Found. Comput. Sci. 18(3): 457-474 (2007) - [j41]Fabrizio Luccio, Antonio Mesa Enriques, Linda Pagli:
k-Restricted rotation distance between binary trees. Inf. Process. Lett. 102(5): 175-180 (2007) - [j40]Sean Cleary, Fabrizio Luccio, Linda Pagli:
Refined upper bounds for right-arm rotation distances. Theor. Comput. Sci. 377(1-3): 277-281 (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 - [c29]Anna Bernasconi, Chiara Bodei, Linda Pagli:
Knitting for Fun: A Recursive Sweater. FUN 2007: 53-65 - [c28]Fabrizio Luccio, Linda Pagli:
Web Marshals Fighting Curly Link Farms. FUN 2007: 240-248 - 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) - [j38]Gianni Franceschini, Fabrizio Luccio, Linda Pagli:
Dense trees: a new look at degenerate graphs. J. Discrete Algorithms 4(3): 455-474 (2006) - [j37]Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli:
Exploiting Regularities for Boolean Function Synthesis. Theory Comput. Syst. 39(4): 485-501 (2006) - [c27]Fabrizio Luccio, Linda Pagli, Nicola Santoro:
Network decontamination with local immunization. IPDPS 2006 - 2005
- [c26]Alejandro Almeida Ruiz, Fabrizio Luccio, Antonio Mesa Enriques, Linda Pagli:
k-Restricted Rotation with an Application to Search Tree Rebalancing. WADS 2005: 2-13 - 2004
- [j36]Paola Flocchini, Elena Lodi, Fabrizio Luccio, Linda Pagli, Nicola Santoro:
Dynamic monopolies in tori. Discret. Appl. Math. 137(2): 197-212 (2004) - [j35]Elena Lodi, Linda Pagli, Nicola Santoro:
Fun with algorithms. Discret. Appl. Math. 144(3): 229-230 (2004) - [j34]Gianni Franceschini, Roberto Grossi, J. Ian Munro, Linda Pagli:
Implicit B-trees: a new data structure for the dictionary problem. J. Comput. Syst. Sci. 68(4): 788-807 (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 - 2003
- [j33]Valentina Ciriani, Fabrizio Luccio, Linda Pagli:
Synthesis of integer multipliers in sum of pseudoproducts form. Integr. 36(3): 103-119 (2003) - [j32]Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli:
Three-level logic minimization based on function regularities. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 22(8): 1005-1016 (2003) - [j31]Pierluigi Crescenzi, Alberto Del Lungo, Roberto Grossi, Elena Lodi, Linda Pagli, Gianluca Rossi:
Text sparsification via local maxima. Theor. Comput. Sci. 304(1-3): 341-364 (2003) - 2002
- [j30]Elena Lodi, Linda Pagli, Nicola Santoro:
FUN with Algorithms - Foreword. Theor. Comput. Sci. 282(2): 221-222 (2002) - [c22]Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli:
Fast three-level logic minimization based on autosymmetry. DAC 2002: 425-430 - [c21]Gianni Franceschini, Roberto Grossi, J. Ian Munro, Linda Pagli:
Implicit B-Trees: New Results for the Dictionary Problem. FOCS 2002: 145-154 - [c20]Davide Gualerzi, Elena Lodi, Linda Pagli:
E-Commerce, Intermediation and Intelligent Software Agents. ICWI 2002: 515-519 - [c19]Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli:
Implicit Test of Regularity for Not Completely Specified Boolean Functions. IWLS 2002: 345-350 - [c18]Fabrizio Luccio, Linda Pagli:
From Algorithms to Cryptography. LATIN 2002: 15 - [c17]Fabrizio Luccio, Linda Pagli:
Two New Applications of Dynamos. SIROCCO 2002: 247-258 - 2000
- [j29]Fabrizio Luccio, Mohammed Mahafzah, Mahmoud Al-Omari, Linda Pagli:
Masked Interval Routing: A New Routing Scheme. Comput. J. 43(2): 121-129 (2000) - [j28]Fabrizio Luccio, Linda Pagli:
Death of a monster. SIGACT News 31(4): 130-133 (2000) - [c16]Pierluigi Crescenzi, Alberto Del Lungo, Roberto Grossi, Elena Lodi, Linda Pagli, Gianluca Rossi:
Text Sparsification via Local Maxima. FSTTCS 2000: 290-301 - [c15]Fabrizio Luccio, Linda Pagli:
An algorithmic definition of interval with applications to routing. SIROCCO 2000: 227-236 - [c14]Lino Flores Pacheco, Gianni Franceschini, Fabrizio Luccio, Linda Pagli:
Decomposition of k-Dense Trees. WDAS 2000: 11-23
1990 – 1999
- 1999
- [j27]Fabrizio Luccio, Linda Pagli:
On a New Boolean Function with Applications. IEEE Trans. Computers 48(3): 296-310 (1999) - [c13]Paola Flocchini, Elena Lodi, Fabrizio Luccio, Linda Pagli, Nicola Santoro:
Monotone Dynamos in Tori. SIROCCO 1999: 152-165 - [c12]Fabrizio Luccio, Linda Pagli, Hermineh Sanossian:
Irreversible Dynamos in Butterflies. SIROCCO 1999: 204-218 - [c11]Fabrizio Luccio, Linda Pagli:
Dese Trees: A New Structure for Interconnection. WDAS 1999: 56-72 - 1998
- [j26]Fabrizio Luccio, Linda Pagli:
Computing with Time-Varying Data: Sequential Complexity and Parallel Speed-Up. Theory Comput. Syst. 31(1): 5-26 (1998) - [j25]Roberto De Prisco, Angelo Monti, Linda Pagli:
Testing and Reconfiguration of VLSI Linear Arrays. Theor. Comput. Sci. 197(1-2): 171-188 (1998) - [c10]Fabrizio Luccio, Mohammed Mahafzah, Mahmoud Al-Omari, Linda Pagli:
Routing with the use of masks. SIROCCO 1998: 188-200 - 1997
- [j24]Fabrizio Luccio, Linda Pagli:
An Insight on PRAM Computational Bounds. Inf. Process. Lett. 63(6): 331-336 (1997) - 1996
- [j23]Amiya Nayak, Linda Pagli, Nicola Santoro:
On testing for catastrophic faults in reconfigurable arrays with arbitrary link redundancy. Integr. 20(3): 327-342 (1996) - 1995
- [j22]Fabrizio Luccio, Linda Pagli:
Approximate Matching for Two Families of Trees. Inf. Comput. 123(1): 111-120 (1995) - 1994
- [j21]Linda Pagli, Geppino Pucci:
Counting the Number of Fault Patterns in Redundant VLSI Arrays. Inf. Process. Lett. 50(6): 337-342 (1994) - [c9]Fabrizio Luccio, Linda Pagli:
Computational bounds for the simple and the MRMW PRAM. SPDP 1994: 552-557 - 1993
- [j20]Amiya Nayak, Linda Pagli, Nicola Santoro:
Efficient construction of catastrophic patterns for VLSI reconfigurable arrays. Integr. 15(2): 133-150 (1993) - [j19]Fabrizio Luccio, Linda Pagli:
A Model of Sequential Computation with Pipelines Access to Memory. Math. Syst. Theory 26(4): 343-356 (1993) - 1992
- [j18]Fabrizio Luccio, Linda Pagli:
The p-shovelers problem: (computing with time-varying data). SIGACT News 23(2): 72-75 (1992) - [c8]Amiya Nayak, Linda Pagli, Nicola Santoro:
Efficient Construction of Catastrophic Patterns for VLSI Reconfigurable Arrays with Bidirectional Links. ICCI 1992: 79-83 - [c7]Fabrizio Luccio, Linda Pagli, Geppino Pucci:
Three non Conventional Paradigms of Parallel Computation. Heinz Nixdorf Symposium 1992: 166-175 - [c6]Fabrizio Luccio, Linda Pagli:
The p-Shovelers Problem (Computing with Time-Varying Data). SPDP 1992: 188-193 - 1991
- [j17]Fabrizio Luccio, Linda Pagli:
An Efficient Algorithm for Some Tree Matching Problems. Inf. Process. Lett. 39(1): 51-57 (1991) - [c5]Fabrizio Luccio, Linda Pagli:
Simple Solutions for Approximate Tree Matching Problems. TAPSOFT, Vol.1 1991: 193-201 - 1990
- [j16]Elena Lodi, Fabrizio Luccio, Linda Pagli:
Routing in Times Square Mode. Inf. Process. Lett. 35(1): 41-48 (1990) - [j15]Alan A. Bertossi, Fabrizio Luccio, Elena Lodi, Linda Pagli:
String Matching with Weighted Errors. Theor. Comput. Sci. 73(3): 319-328 (1990)
1980 – 1989
- 1989
- [j14]Elena Lodi, Fabrizio Luccio, Linda Pagli:
A Preliminary Study of a Diagonal Channel-Routing Model. Algorithmica 4(4): 585-597 (1989) - [j13]Elena Lodi, Fabrizio Luccio, Linda Pagli:
Channel routing for strictly multiterminal nets. Integr. 8(2): 143-153 (1989) - [j12]Fabrizio Luccio, Linda Pagli:
On the Upper Bound on the Rotation Distance of Binary Trees. Inf. Process. Lett. 31(2): 57-60 (1989) - 1988
- [c4]Elena Lodi, Fabrizio Luccio, Linda Pagli:
A 4D Channel Router for a Two Layer Diagonal Model. AWOC 1988: 465-476 - 1986
- [j11]Elena Lodi, Linda Pagli:
A VLSI Solution to the Vertical Segment Visibility Problem. IEEE Trans. Computers 35(10): 923-928 (1986) - [c3]Elena Lodi, Linda Pagli:
Some New Results on a Restricted Channel Routing Problem. Aegean Workshop on Computing 1986: 133-143 - 1985
- [j10]Linda Pagli:
Self-Adjusting Hash Tables. Inf. Process. Lett. 21(1): 23-25 (1985) - 1984
- [j9]Maurizio A. Bonuccelli, Elena Lodi, Linda Pagli:
External Sorting in VLSI. IEEE Trans. Computers 33(10): 931-934 (1984) - 1983
- [c2]Maurizio A. Bonuccelli, Elena Lodi, Fabrizio Luccio, Piero Maestrini, Linda Pagli:
VLSI Mesh of Trees for Data Base Processing. CAAP 1983: 155-166 - [c1]Maurizio A. Bonuccelli, Elena Lodi, Fabrizio Luccio, Piero Maestrini, Linda Pagli:
A VLSI Tree Machine for Relational Data Bases. ISCA 1983: 67-73 - 1982
- [j8]Fabrizio Luccio, Linda Pagli:
A Linear Algorithm to Determine Minimal Spanning Forests in Chain Graphs. Inf. Process. Lett. 15(1): 1-4 (1982) - 1980
- [j7]Fabrizio Luccio, Linda Pagli:
Comment on Generalized AVL Trees. Commun. ACM 23(7): 394-395 (1980) - [j6]Michele Missikoff, Linda Pagli:
A note on optimal allocation of files in a symmetric and homogeneous network. Inf. Syst. 5(2): 149-150 (1980)
1970 – 1979
- 1979
- [j5]Linda Pagli:
Height-balanced multiway trees. Inf. Syst. 4(1): 227-234 (1979) - 1978
- [j4]Fabrizio Luccio, Linda Pagli:
Power Trees. Commun. ACM 21(11): 941-947 (1978) - [j3]Fabrizio Luccio, Linda Pagli:
Rebalancing Height Balanced Trees. IEEE Trans. Computers 27(5): 386-396 (1978) - 1976
- [j2]Elena Lodi, Fabrizio Luccio, Linda Pagli, Nicola Santoro:
Random access in a list environment. Inf. Syst. 2(1): 11-17 (1976) - [j1]Fabrizio Luccio, Linda Pagli:
On the Height of Height-Balanced Trees. IEEE Trans. Computers 25(1): 87-91 (1976)
Coauthor Index
[c45] [j57] [c44] [c43] [c41] [c40] [i4] [j53] [j52] [j51] [c37] [j49] [j48] [c35] [i2] [i1] [b1] [j46] [c33] [j45] [c32] [j43] [j42] [j41] [j40] [c28] [j38] [j37] [c27] [c26] [j36] [j33] [j32] [c22] [c19] [c18] [c17] [j29] [j28] [c15] [c14] [j27] [c13] [c12] [c11] [j26] [c10] [j24] [j22] [c9] [j19] [j18] [c7] [c6] [j17] [c5] [j16] [j15] [j14] [j13] [j12] [c4] [c2] [c1] [j8] [j7] [j4] [j3] [j2] [j1]
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 18:42 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:
