Random access in a list environment. - Elena Lodi; Fabrizio Luccio; Linda Pagli; Nicola Santoro (Inf. Syst., 1976)

On the Height of Height-Balanced Trees. - Fabrizio Luccio; Linda Pagli (IEEE Trans. Computers, 1976)

Power Trees. - Fabrizio Luccio; Linda Pagli (Commun. ACM, 1978)

Rebalancing Height Balanced Trees. - Fabrizio Luccio; Linda Pagli (IEEE Trans. Computers, 1978)

Height-balanced multiway trees. - Linda Pagli (Inf. Syst., 1979)

Comment on Generalized AVL Trees. - Fabrizio Luccio; Linda Pagli (Commun. ACM, 1980)

A note on optimal allocation of files in a symmetric and homogeneous network. - Michele Missikoff; Linda Pagli (Inf. Syst., 1980)

A Linear Algorithm to Determine Minimal Spanning Forests in Chain Graphs. - Fabrizio Luccio; Linda Pagli (Inf. Process. Lett., 1982)

VLSI Mesh of Trees for Data Base Processing. - Maurizio A. Bonuccelli; Elena Lodi; Fabrizio Luccio; Piero Maestrini; Linda Pagli (CAAP, 1983)

A VLSI Tree Machine for Relational Data Bases - Maurizio A. Bonuccelli; Elena Lodi; Fabrizio Luccio; Piero Maestrini; Linda Pagli (ISCA, 1983)

External Sorting in VLSI. - Maurizio A. Bonuccelli; Elena Lodi; Linda Pagli (IEEE Trans. Computers, 1984)

Self-Adjusting Hash Tables. - Linda Pagli (Inf. Process. Lett., 1985)

Some New Results on a Restricted Channel Routing Problem. - Elena Lodi; Linda Pagli (Aegean Workshop on Computing, 1986)

A VLSI Solution to the Vertical Segment Visibility Problem. - Elena Lodi; Linda Pagli (IEEE Trans. Computers, 1986)

A 4D Channel Router for a Two Layer Diagonal Model. - Elena Lodi; Fabrizio Luccio; Linda Pagli (AWOC, 1988)

A Preliminary Study of a Diagonal Channel-Routing Model. - Elena Lodi; Fabrizio Luccio; Linda Pagli (Algorithmica, 1989)

Channel routing for strictly multiterminal nets. - Elena Lodi; Fabrizio Luccio; Linda Pagli (Integr., 1989)

On the Upper Bound on the Rotation Distance of Binary Trees. - Fabrizio Luccio; Linda Pagli (Inf. Process. Lett., 1989)

Routing in Times Square Mode. - Elena Lodi; Fabrizio Luccio; Linda Pagli (Inf. Process. Lett., 1990)

String Matching with Weighted Errors. - Alan A. Bertossi; Fabrizio Luccio; Elena Lodi; Linda Pagli (Theor. Comput. Sci., 1990)

Simple Solutions for Approximate Tree Matching Problems. - Fabrizio Luccio; Linda Pagli (TAPSOFT, Vol.1, 1991)

An Efficient Algorithm for Some Tree Matching Problems. - Fabrizio Luccio; Linda Pagli (Inf. Process. Lett., 1991)

Efficient Construction of Catastrophic Patterns for VLSI Reconfigurable Arrays with Bidirectional Links. - Amiya Nayak; Linda Pagli; Nicola Santoro (ICCI, 1992)

Three non Conventional Paradigms of Parallel Computation. - Fabrizio Luccio; Linda Pagli; Geppino Pucci (Heinz Nixdorf Symposium, 1992)

The p-shovelers problem: (computing with time-varying data). - Fabrizio Luccio; Linda Pagli (SIGACT News, 1992)

Efficient construction of catastrophic patterns for VLSI reconfigurable arrays. - Amiya Nayak; Linda Pagli; Nicola Santoro (Integr., 1993)

A Model of Sequential Computation with Pipelines Access to Memory. - Fabrizio Luccio; Linda Pagli (Math. Syst. Theory, 1993)

Computational bounds for the simple and the MRMW PRAM. - Fabrizio Luccio; Linda Pagli (SPDP, 1994)

Counting the Number of Fault Patterns in Redundant VLSI Arrays. - Linda Pagli; Geppino Pucci (Inf. Process. Lett., 1994)

Approximate Matching for Two Families of Trees. - Fabrizio Luccio; Linda Pagli (Inf. Comput., 1995)

On testing for catastrophic faults in reconfigurable arrays with arbitrary link redundancy. - Amiya Nayak; Linda Pagli; Nicola Santoro (Integr., 1996)

An Insight on PRAM Computational Bounds. - Fabrizio Luccio; Linda Pagli (Inf. Process. Lett., 1997)

Routing with the use of masks. - Fabrizio Luccio; Mohammed Mahafzah; Mahmoud Al-Omari; Linda Pagli (SIROCCO, 1998)

Computing with Time-Varying Data: Sequential Complexity and Parallel Speed-Up. - Fabrizio Luccio; Linda Pagli (Theory Comput. Syst., 1998)

Testing and Reconfiguration of VLSI Linear Arrays. - Roberto De Prisco; Angelo Monti; Linda Pagli (Theor. Comput. Sci., 1998)

Monotone Dynamos in Tori. - Paola Flocchini; Elena Lodi; Fabrizio Luccio; Linda Pagli; Nicola Santoro (SIROCCO, 1999)

Irreversible Dynamos in Butterflies. - Fabrizio Luccio; Linda Pagli; Hermineh Sanossian (SIROCCO, 1999)

Dese Trees: A New Structure for Interconnection. - Fabrizio Luccio; Linda Pagli (WDAS, 1999)

On a New Boolean Function with Applications. - Fabrizio Luccio; Linda Pagli (IEEE Trans. Computers, 1999)

An algorithmic definition of interval with applications to routing. - Fabrizio Luccio; Linda Pagli (SIROCCO, 2000)

Decomposition of k-Dense Trees. - Lino Flores Pacheco; Gianni Franceschini; Fabrizio Luccio; Linda Pagli (WDAS, 2000)

Masked Interval Routing: A New Routing Scheme. - Fabrizio Luccio; Mohammed Mahafzah; Mahmoud Al-Omari; Linda Pagli (Comput. J., 2000)

Death of a monster. - Fabrizio Luccio; Linda Pagli (SIGACT News, 2000)

Fast three-level logic minimization based on autosymmetry. - Anna Bernasconi 001; Valentina Ciriani; Fabrizio Luccio; Linda Pagli (DAC, 2002)

Implicit B-Trees: New Results for the Dictionary Problem. - Gianni Franceschini; Roberto Grossi; J. Ian Munro; Linda Pagli (FOCS, 2002)

E-Commerce, Intermediation and Intelligent Software Agents. - Davide Gualerzi; Elena Lodi; Linda Pagli (ICWI, 2002)

Implicit Test of Regularity for Not Completely Specified Boolean Functions. - Anna Bernasconi 001; Valentina Ciriani; Fabrizio Luccio; Linda Pagli (IWLS, 2002)

From Algorithms to Cryptography. - Fabrizio Luccio; Linda Pagli (LATIN, 2002)

Two New Applications of Dynamos. - Fabrizio Luccio; Linda Pagli (SIROCCO, 2002)

FUN with Algorithms - Foreword. - Elena Lodi; Linda Pagli; Nicola Santoro (Theor. Comput. Sci., 2002)

Synthesis of integer multipliers in sum of pseudoproducts form. - Valentina Ciriani; Fabrizio Luccio; Linda Pagli (Integr., 2003)

Three-level logic minimization based on function regularities. - Anna Bernasconi 001; Valentina Ciriani; Fabrizio Luccio; Linda Pagli (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2003)

Text sparsification via local maxima. - Pierluigi Crescenzi; Alberto Del Lungo; Roberto Grossi; Elena Lodi; Linda Pagli; Gianluca Rossi (Theor. Comput. Sci., 2003)

Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree. - Paola Flocchini; Antonio Mesa Enriques; Linda Pagli; Giuseppe Prencipe; Nicola Santoro (IFIP TCS, 2004)

Distributed Computation for Swapping a Failing Edge. - Linda Pagli; Giuseppe Prencipe; Tranos Zuva (IWDC, 2004)

Computing All the Best Swap Edges Distributively. - Paola Flocchini; Linda Pagli; Giuseppe Prencipe; Nicola Santoro; Peter Widmayer; Tranos Zuva (OPODIS, 2004)

Dynamic monopolies in tori. - Paola Flocchini; Elena Lodi; Fabrizio Luccio; Linda Pagli; Nicola Santoro (Discret. Appl. Math., 2004)

Fun with algorithms. - Elena Lodi; Linda Pagli; Nicola Santoro (Discret. Appl. Math., 2004)

Implicit B-trees: a new data structure for the dictionary problem. - Gianni Franceschini; Roberto Grossi; J. Ian Munro; Linda Pagli (J. Comput. Syst. Sci., 2004)

k-Restricted Rotation with an Application to Search Tree Rebalancing. - Alejandro Almeida Ruiz; Fabrizio Luccio; Antonio Mesa Enriques; Linda Pagli (WADS, 2005)

Network decontamination with local immunization. - Fabrizio Luccio; Linda Pagli; Nicola Santoro (IPDPS, 2006)

Point-of-Failure Shortest-Path Rerouting: Computing the Optimal Swap Edges Distributively. - Paola Flocchini; Antonio Mesa Enriques; Linda Pagli; Giuseppe Prencipe; Nicola Santoro (IEICE Trans. Inf. Syst., 2006)

Dense trees: a new look at degenerate graphs. - Gianni Franceschini; Fabrizio Luccio; Linda Pagli (J. Discrete Algorithms, 2006)

Exploiting Regularities for Boolean Function Synthesis. - Anna Bernasconi 001; Valentina Ciriani; Fabrizio Luccio; Linda Pagli (Theory Comput. Syst., 2006)

Distributed Computation of All Node Replacements of a Minimum Spanning Tree. - Paola Flocchini; Toni Mesa Enriquez; Linda Pagli; Giuseppe Prencipe; Nicola Santoro (Euro-Par, 2007)

Knitting for Fun: A Recursive Sweater. - Anna Bernasconi 001; Chiara Bodei; Linda Pagli (FUN, 2007)

Web Marshals Fighting Curly Link Farms. - Fabrizio Luccio; Linda Pagli (FUN, 2007)

Network decontamination in Presence of Local Immunity. - Fabrizio Luccio; Linda Pagli; Nicola Santoro (Int. J. Found. Comput. Sci., 2007)

k-Restricted rotation distance between binary trees. - Fabrizio Luccio; Antonio Mesa Enriques; Linda Pagli (Inf. Process. Lett., 2007)

Refined upper bounds for right-arm rotation distances. - Sean Cleary; Fabrizio Luccio; Linda Pagli (Theor. Comput. Sci., 2007)

Computing all the best swap edges distributively. - Paola Flocchini; Linda Pagli; Giuseppe Prencipe; Nicola Santoro; Peter Widmayer (J. Parallel Distributed Comput., 2008)

Synthesis of Autosymmetric Functions in a New Three-Level Form. - Anna Bernasconi 001; Valentina Ciriani; Fabrizio Luccio; Linda Pagli (Theory Comput. Syst., 2008)

A general approach to toroidal mesh decontamination with local immunity. - Fabrizio Luccio; Linda Pagli (IPDPS, 2009)

Brief Annoucement: Distributed Swap Edges Computation for Minimum Routing Cost Spanning Trees. - Linda Pagli; Giuseppe Prencipe (OPODIS, 2009)

The Fermat star of binary trees. - Fabrizio Luccio; Linda Pagli (Inf. Process. Lett., 2009)

Fun at a Department Store: Data Mining Meets Switching Theory. - Anna Bernasconi 001; Valentina Ciriani; Fabrizio Luccio; Linda Pagli (FUN, 2010)

Lower bounds on the rotation distance of binary trees. - Fabrizio Luccio; Antonio Mesa Enriques; Linda Pagli (Inf. Process. Lett., 2010)

Mathematical and Algorithmic Foundations of the Internet. - Fabrizio Luccio; Linda Pagli; Graham Steel (CRC Press, 2011)

Getting Close without Touching. - Linda Pagli; Giuseppe Prencipe; Giovanni Viglietta (SIROCCO, 2012)

Distributed Minimum Spanning Tree Maintenance for Transient Node Failures. - Paola Flocchini; Toni Mesa Enriquez; Linda Pagli; Giuseppe Prencipe; Nicola Santoro (IEEE Trans. Computers, 2012)

Linear Time Distributed Swap Edge Algorithms. - Ajoy Kumar Datta; Lawrence L. Larmore; Linda Pagli; Giuseppe Prencipe (CIAC, 2013)

Optimal Network Decontamination with Threshold Immunity. - Paola Flocchini; Fabrizio Luccio; Linda Pagli; Nicola Santoro (CIAC, 2013)

Chain rotations: A new look at tree distance. - Fabrizio Luccio; Linda Pagli (Inf. Process. Lett., 2013)

Compact DSOP and Partial DSOP Forms. - Anna Bernasconi 001; Valentina Ciriani; Fabrizio Luccio; Linda Pagli (Theory Comput. Syst., 2013)

Soulmate Algorithms. - Fabrizio Luccio; Linda Pagli (Programming Languages with Applications to Biology and Security, 2015)

Getting close without touching: near-gathering for autonomous mobile robots. - Linda Pagli; Giuseppe Prencipe; Giovanni Viglietta (Distributed Comput., 2015)

Analyzing and Comparing On-Line News Sources via (Two-Layer) Incremental Clustering. - Francesco Cambi; Pierluigi Crescenzi; Linda Pagli (FUN, 2016)

Complete Balancing via Rotation. - Fabrizio Luccio; Bernard Mans; Luke Mathieson; Linda Pagli (Comput. J., 2016)

Network decontamination under m-immunity. - Paola Flocchini; Fabrizio Luccio; Linda Pagli; Nicola Santoro (Discret. Appl. Math., 2016)

More agents may decrease global work: A case in butterfly decontamination. - Fabrizio Luccio; Linda Pagli (Theor. Comput. Sci., 2016)

Cops and robber on grids and tori. - Fabrizio Luccio; Linda Pagli (CoRR, 2017)

The Connection Layout in a Lattice of Four-Terminal Switches. - Anna Bernasconi 001; Antonio Boffa; Fabrizio Luccio; Linda Pagli (VLSI-SoC (Selected Papers), 2018)

Two Combinatorial Problems on the Layout of Switching Lattices. - Anna Bernasconi 001; Antonio Boffa; Fabrizio Luccio; Linda Pagli (VLSI-SoC, 2018)

Capture on Grids and Tori with Different Numbers of Cops. - Fabrizio Luccio; Linda Pagli (PaCT, 2019)

Compacting and Grouping Mobile Agents on Dynamic Rings. - Shantanu Das 001; Giuseppe Antonio Di Luna; Linda Pagli; Giuseppe Prencipe (TAMC, 2019)

Linear time distributed swap edge algorithms. - Ajoy K. Datta; Paolo Ferragina; Lawrence L. Larmore; Linda Pagli; Giuseppe Prencipe (Inf. Process. Lett., 2020)

FUN editorial. - Hiro Ito; Stefano Leonardi 001; Linda Pagli; Giuseppe Prencipe (Theor. Comput. Sci., 2020)

Gathering in dynamic rings. - Giuseppe Antonio Di Luna; Paola Flocchini; Linda Pagli; Giuseppe Prencipe; Nicola Santoro; Giovanni Viglietta (Theor. Comput. Sci., 2020)

Mobile Agents Operating on a Grid: Some Non-conventional Issues in Parallel Computing. - Fabrizio Luccio; Linda Pagli (PaCT, 2021)

Cops and robber on grids and tori: basic algorithms and their extension to a large number of cops. - Fabrizio Luccio; Linda Pagli (J. Supercomput., 2021)

Variations on the Tournament Problem. - Fabrizio Luccio; Linda Pagli; Nicola Santoro (FUN, 2024)

"Strutture Di Dati e Algoritmi. Progettazione, Analisi e Visualizzazione", a Book Beating Its Own Drum. - Anna Bernasconi 001; Linda Pagli (From Strings to Graphs, and Back Again, 2025)