Linda Pagli

ORCID

Publication Activity (10 Years)

Years Active: 1976-2024
Publications (10 Years): 20

Top Venues

Publications

Fabrizio Luccio, Linda Pagli, Nicola Santoro
Variations on the Tournament Problem. FUN (2024)
Fabrizio Luccio, Linda Pagli
Mobile Agents Operating on a Grid: Some Non-conventional Issues in Parallel Computing. PaCT (2021)
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) (2021)
Ajoy K. Datta, Paolo Ferragina, Lawrence L. Larmore, Linda Pagli, Giuseppe Prencipe
Linear time distributed swap edge algorithms. Inf. Process. Lett. 161 (2020)
Giuseppe Antonio Di Luna, Paola Flocchini, Linda Pagli, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta
Gathering in dynamic rings. Theor. Comput. Sci. 811 (2020)
Hiro Ito, Stefano Leonardi, Linda Pagli, Giuseppe Prencipe
FUN editorial. Theor. Comput. Sci. 842 (2020)
Shantanu Das, Giuseppe Antonio Di Luna, Linda Pagli, Giuseppe Prencipe
Compacting and Grouping Mobile Agents on Dynamic Rings. TAMC (2019)
Fabrizio Luccio, Linda Pagli
Capture on Grids and Tori with Different Numbers of Cops. PaCT (2019)
Anna Bernasconi, Antonio Boffa, Fabrizio Luccio, Linda Pagli
Two Combinatorial Problems on the Layout of Switching Lattices. VLSI-SoC (2018)
Anna Bernasconi, Antonio Boffa, Fabrizio Luccio, Linda Pagli
The Connection Layout in a Lattice of Four-Terminal Switches. VLSI-SoC (Selected Papers) (2018)
Fabrizio Luccio, Linda Pagli
Cops and robber on grids and tori. CoRR (2017)
Giuseppe Antonio Di Luna, Paola Flocchini, Linda Pagli, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta
Gathering in Dynamic Rings. CoRR (2017)
Giuseppe Antonio Di Luna, Paola Flocchini, Linda Pagli, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta
Gathering in Dynamic Rings. SIROCCO (2017)
Fabrizio Luccio, Linda Pagli
More agents may decrease global work: A case in butterfly decontamination. Theor. Comput. Sci. 655 (2016)
Paola Flocchini, Fabrizio Luccio, Linda Pagli, Nicola Santoro
Network decontamination under m-immunity. Discret. Appl. Math. 201 (2016)
Francesco Cambi, Pierluigi Crescenzi, Linda Pagli
Analyzing and Comparing On-Line News Sources via (Two-Layer) Incremental Clustering. FUN (2016)
Fabrizio Luccio, Bernard Mans, Luke Mathieson, Linda Pagli
Complete Balancing via Rotation. Comput. J. 59 (8) (2016)
Linda Pagli, Giuseppe Prencipe, Giovanni Viglietta
Getting close without touching: near-gathering for autonomous mobile robots. Distributed Comput. 28 (5) (2015)
Linda Pagli, Giuseppe Prencipe, Giovanni Viglietta
Getting Close Without Touching: Near-Gathering for Autonomous Mobile Robots. CoRR (2015)
Fabrizio Luccio, Linda Pagli
Soulmate Algorithms. Programming Languages with Applications to Biology and Security (2015)
Ajoy Kumar Datta, Lawrence L. Larmore, Linda Pagli, Giuseppe Prencipe
Linear Time Distributed Swap Edge Algorithms. CIAC (2013)
Paola Flocchini, Fabrizio Luccio, Linda Pagli, Nicola Santoro
Optimal Network Decontamination with Threshold Immunity. CIAC (2013)
Fabrizio Luccio, Linda Pagli
Chain rotations: A new look at tree distance. Inf. Process. Lett. 113 (7) (2013)
Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli
Compact DSOP and Partial DSOP Forms. Theory Comput. Syst. 53 (4) (2013)
Fabrizio Luccio, Linda Pagli
Chain Rotations: a New Look at Tree Distance CoRR (2012)
Linda Pagli, Giuseppe Prencipe, Giovanni Viglietta
Getting Close without Touching. SIROCCO (2012)
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) (2012)
Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli
Compact DSOP and partial DSOP Forms CoRR (2012)
Fabrizio Luccio, Antonio Mesa Enriques, Linda Pagli
Lower bounds on the rotation distance of binary trees. Inf. Process. Lett. 110 (21) (2010)
Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli
Fun at a Department Store: Data Mining Meets Switching Theory. FUN (2010)
Linda Pagli, Giuseppe Prencipe
Brief Annoucement: Distributed Swap Edges Computation for Minimum Routing Cost Spanning Trees. OPODIS (2009)
Fabrizio Luccio, Linda Pagli
The Fermat star of binary trees. Inf. Process. Lett. 109 (11) (2009)
Fabrizio Luccio, Linda Pagli
A general approach to toroidal mesh decontamination with local immunity. IPDPS (2009)
Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli
Synthesis of Autosymmetric Functions in a New Three-Level Form. Theory Comput. Syst. 42 (4) (2008)
Paola Flocchini, Linda Pagli, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer
Computing all the best swap edges distributively. J. Parallel Distributed Comput. 68 (7) (2008)
Anna Bernasconi, Chiara Bodei, Linda Pagli
Knitting for Fun: A Recursive Sweater. FUN (2007)
Sean Cleary, Fabrizio Luccio, Linda Pagli
Refined upper bounds for right-arm rotation distances. Theor. Comput. Sci. 377 (1-3) (2007)
Fabrizio Luccio, Linda Pagli, Nicola Santoro
Network decontamination in Presence of Local Immunity. Int. J. Found. Comput. Sci. 18 (3) (2007)
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)
Fabrizio Luccio, Antonio Mesa Enriques, Linda Pagli
k-Restricted rotation distance between binary trees. Inf. Process. Lett. 102 (5) (2007)
Fabrizio Luccio, Linda Pagli
Web Marshals Fighting Curly Link Farms. FUN (2007)
Gianni Franceschini, Fabrizio Luccio, Linda Pagli
Dense trees: a new look at degenerate graphs. J. Discrete Algorithms 4 (3) (2006)
Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli
Exploiting Regularities for Boolean Function Synthesis. Theory Comput. Syst. 39 (4) (2006)
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. (2) (2006)
Fabrizio Luccio, Linda Pagli, Nicola Santoro
Network decontamination with local immunization. IPDPS (2006)
Alejandro Almeida Ruiz, Fabrizio Luccio, Antonio Mesa Enriques, Linda Pagli
k-Restricted Rotation with an Application to Search Tree Rebalancing. WADS (2005)
Paola Flocchini, Linda Pagli, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer, Tranos Zuva
Computing All the Best Swap Edges Distributively. OPODIS (2004)
Paola Flocchini, Elena Lodi, Fabrizio Luccio, Linda Pagli, Nicola Santoro
Dynamic monopolies in tori. Discret. Appl. Math. 137 (2) (2004)
Linda Pagli, Giuseppe Prencipe, Tranos Zuva
Distributed Computation for Swapping a Failing Edge. IWDC (2004)
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)
Elena Lodi, Linda Pagli, Nicola Santoro
Fun with algorithms. Discret. Appl. Math. 144 (3) (2004)
Gianni Franceschini, Roberto Grossi, J. Ian Munro, Linda Pagli
-trees: a new data structure for the dictionary problem. J. Comput. Syst. Sci. 68 (4) (2004)
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) (2003)
Pierluigi Crescenzi, Alberto Del Lungo, Roberto Grossi, Elena Lodi, Linda Pagli, Gianluca Rossi
Text sparsification via local maxima. Theor. Comput. Sci. 304 (1-3) (2003)
Valentina Ciriani, Fabrizio Luccio, Linda Pagli
Synthesis of integer multipliers in sum of pseudoproducts form. Integr. 36 (3) (2003)
Elena Lodi, Linda Pagli, Nicola Santoro
FUN with Algorithms - Foreword. Theor. Comput. Sci. 282 (2) (2002)
Gianni Franceschini, Roberto Grossi, J. Ian Munro, Linda Pagli
Implicit B-Trees: New Results for the Dictionary Problem. FOCS (2002)
Davide Gualerzi, Elena Lodi, Linda Pagli
E-Commerce, Intermediation and Intelligent Software Agents. ICWI (2002)
Fabrizio Luccio, Linda Pagli
Two New Applications of Dynamos. SIROCCO (2002)
Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli
Fast three-level logic minimization based on autosymmetry. DAC (2002)
Fabrizio Luccio, Linda Pagli
From Algorithms to Cryptography. LATIN (2002)
Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli
Implicit Test of Regularity for Not Completely Specified Boolean Functions. IWLS (2002)
Fabrizio Luccio, Mohammed Mahafzah, Mahmoud Al-Omari, Linda Pagli
Masked Interval Routing: A New Routing Scheme. Comput. J. 43 (2) (2000)
Fabrizio Luccio, Linda Pagli
An algorithmic definition of interval with applications to routing. SIROCCO (2000)
Fabrizio Luccio, Linda Pagli
Death of a monster. SIGACT News 31 (4) (2000)
Pierluigi Crescenzi, Alberto Del Lungo, Roberto Grossi, Elena Lodi, Linda Pagli, Gianluca Rossi
Text Sparsification via Local Maxima. FSTTCS (2000)
Lino Flores Pacheco, Gianni Franceschini, Fabrizio Luccio, Linda Pagli
Decomposition of k-Dense Trees. WDAS (2000)
Fabrizio Luccio, Linda Pagli
Dese Trees: A New Structure for Interconnection. WDAS (1999)
Paola Flocchini, Elena Lodi, Fabrizio Luccio, Linda Pagli, Nicola Santoro
Monotone Dynamos in Tori. SIROCCO (1999)
Fabrizio Luccio, Linda Pagli, Hermineh Sanossian
Irreversible Dynamos in Butterflies. SIROCCO (1999)
Fabrizio Luccio, Linda Pagli
On a New Boolean Function with Applications. IEEE Trans. Computers 48 (3) (1999)
Fabrizio Luccio, Linda Pagli
Computing with Time-Varying Data: Sequential Complexity and Parallel Speed-Up. Theory Comput. Syst. 31 (1) (1998)
Fabrizio Luccio, Mohammed Mahafzah, Mahmoud Al-Omari, Linda Pagli
Routing with the use of masks. SIROCCO (1998)
Roberto De Prisco, Angelo Monti, Linda Pagli
Testing and Reconfiguration of VLSI Linear Arrays. Theor. Comput. Sci. 197 (1-2) (1998)
Fabrizio Luccio, Linda Pagli
An Insight on PRAM Computational Bounds. Inf. Process. Lett. 63 (6) (1997)
Amiya Nayak, Linda Pagli, Nicola Santoro
On testing for catastrophic faults in reconfigurable arrays with arbitrary link redundancy. Integr. 20 (3) (1996)
Fabrizio Luccio, Linda Pagli
Approximate Matching for Two Families of Trees. Inf. Comput. 123 (1) (1995)
Fabrizio Luccio, Linda Pagli
Computational bounds for the simple and the MRMW PRAM. SPDP (1994)
Linda Pagli, Geppino Pucci
Counting the Number of Fault Patterns in Redundant VLSI Arrays. Inf. Process. Lett. 50 (6) (1994)
Fabrizio Luccio, Linda Pagli
A Model of Sequential Computation with Pipelines Access to Memory. Math. Syst. Theory 26 (4) (1993)
Amiya Nayak, Linda Pagli, Nicola Santoro
Efficient construction of catastrophic patterns for VLSI reconfigurable arrays. Integr. 15 (2) (1993)
Amiya Nayak, Linda Pagli, Nicola Santoro
Efficient Construction of Catastrophic Patterns for VLSI Reconfigurable Arrays with Bidirectional Links. ICCI (1992)
Fabrizio Luccio, Linda Pagli
The p-shovelers problem: (computing with time-varying data). SIGACT News 23 (2) (1992)
Fabrizio Luccio, Linda Pagli, Geppino Pucci
Three non Conventional Paradigms of Parallel Computation. Heinz Nixdorf Symposium (1992)
Fabrizio Luccio, Linda Pagli
The p-Shovelers Problem (Computing with Time-Varying Data). SPDP (1992)
Fabrizio Luccio, Linda Pagli
Simple Solutions for Approximate Tree Matching Problems. TAPSOFT, Vol.1 (1991)
Fabrizio Luccio, Linda Pagli
An Efficient Algorithm for Some Tree Matching Problems. Inf. Process. Lett. 39 (1) (1991)
Alan A. Bertossi, Fabrizio Luccio, Elena Lodi, Linda Pagli
String Matching with Weighted Errors. Theor. Comput. Sci. 73 (3) (1990)
Elena Lodi, Fabrizio Luccio, Linda Pagli
Routing in Times Square Mode. Inf. Process. Lett. 35 (1) (1990)
Fabrizio Luccio, Linda Pagli
On the Upper Bound on the Rotation Distance of Binary Trees. Inf. Process. Lett. 31 (2) (1989)
Elena Lodi, Fabrizio Luccio, Linda Pagli
A Preliminary Study of a Diagonal Channel-Routing Model. Algorithmica 4 (4) (1989)
Elena Lodi, Fabrizio Luccio, Linda Pagli
Channel routing for strictly multiterminal nets. Integr. 8 (2) (1989)
Elena Lodi, Fabrizio Luccio, Linda Pagli
A 4D Channel Router for a Two Layer Diagonal Model. AWOC (1988)
Elena Lodi, Linda Pagli
A VLSI Solution to the Vertical Segment Visibility Problem. IEEE Trans. Computers 35 (10) (1986)
Elena Lodi, Linda Pagli
Some New Results on a Restricted Channel Routing Problem. Aegean Workshop on Computing (1986)
Linda Pagli
Self-Adjusting Hash Tables. Inf. Process. Lett. 21 (1) (1985)
Maurizio A. Bonuccelli, Elena Lodi, Linda Pagli
External Sorting in VLSI. IEEE Trans. Computers 33 (10) (1984)
Maurizio A. Bonuccelli, Elena Lodi, Fabrizio Luccio, Piero Maestrini, Linda Pagli
VLSI Mesh of Trees for Data Base Processing. CAAP (1983)
Maurizio A. Bonuccelli, Elena Lodi, Fabrizio Luccio, Piero Maestrini, Linda Pagli
A VLSI Tree Machine for Relational Data Bases ISCA (1983)
Fabrizio Luccio, Linda Pagli
A Linear Algorithm to Determine Minimal Spanning Forests in Chain Graphs. Inf. Process. Lett. 15 (1) (1982)

Linda Pagli.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Linda Pagli