| 2008 |
|---|
| 68 | EE | Paola Flocchini,
Linda Pagli,
Giuseppe Prencipe,
Nicola Santoro,
Peter Widmayer:
Computing all the best swap edges distributively.
J. Parallel Distrib. Comput. 68(7): 976-983 (2008) |
| 67 | EE | 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 |
|---|
| 66 | EE | 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 |
| 65 | EE | Fabrizio Luccio,
Linda Pagli:
Web Marshals Fighting Curly Link Farms.
FUN 2007: 240-248 |
| 64 | EE | Anna Bernasconi,
Chiara Bodei,
Linda Pagli:
Knitting for Fun: A Recursive Sweater.
FUN 2007: 53-65 |
| 63 | EE | Fabrizio Luccio,
Antonio Mesa Enriques,
Linda Pagli:
k-Restricted rotation distance between binary trees.
Inf. Process. Lett. 102(5): 175-180 (2007) |
| 62 | EE | Fabrizio Luccio,
Linda Pagli,
Nicola Santoro:
Network decontamination in Presence of Local Immunity.
Int. J. Found. Comput. Sci. 18(3): 457-474 (2007) |
| 61 | EE | Sean Cleary,
Fabrizio Luccio,
Linda Pagli:
Refined upper bounds for right-arm rotation distances.
Theor. Comput. Sci. 377(1-3): 277-281 (2007) |
| 2006 |
|---|
| 60 | EE | Fabrizio Luccio,
Linda Pagli,
Nicola Santoro:
Network decontamination with local immunization.
IPDPS 2006 |
| 59 | EE | Paola Flocchini,
Antonio Mesa Enriques,
Linda Pagli,
Giuseppe Prencipe,
Nicola Santoro:
Point-of-Failure Shortest-Path Rerouting: Computing the Optimal Swap Edges Distributively.
IEICE Transactions 89-D(2): 700-708 (2006) |
| 58 | EE | Gianni Franceschini,
Fabrizio Luccio,
Linda Pagli:
Dense trees: a new look at degenerate graphs.
J. Discrete Algorithms 4(3): 455-474 (2006) |
| 57 | EE | Anna Bernasconi,
Valentina Ciriani,
Fabrizio Luccio,
Linda Pagli:
Exploiting Regularities for Boolean Function Synthesis.
Theory Comput. Syst. 39(4): 485-501 (2006) |
| 2005 |
|---|
| 56 | EE | 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 |
|---|
| 55 | | 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 |
| 54 | EE | Linda Pagli,
Giuseppe Prencipe,
Tranos Zuva:
Distributed Computation for Swapping a Failing Edge.
IWDC 2004: 28-39 |
| 53 | EE | Paola Flocchini,
Linda Pagli,
Giuseppe Prencipe,
Nicola Santoro,
Peter Widmayer,
Tranos Zuva:
Computing All the Best Swap Edges Distributively.
OPODIS 2004: 154-168 |
| 52 | EE | Paola Flocchini,
Elena Lodi,
Fabrizio Luccio,
Linda Pagli,
Nicola Santoro:
Dynamic monopolies in tori.
Discrete Applied Mathematics 137(2): 197-212 (2004) |
| 51 | EE | Elena Lodi,
Linda Pagli,
Nicola Santoro:
Fun with algorithms.
Discrete Applied Mathematics 144(3): 229-230 (2004) |
| 50 | EE | 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) |
| 2003 |
|---|
| 49 | EE | Anna Bernasconi,
Valentina Ciriani,
Fabrizio Luccio,
Linda Pagli:
Three-level logic minimization based on function regularities.
IEEE Trans. on CAD of Integrated Circuits and Systems 22(8): 1005-1016 (2003) |
| 48 | EE | Valentina Ciriani,
Fabrizio Luccio,
Linda Pagli:
Synthesis of integer multipliers in sum of pseudoproducts form.
Integration 36(3): 103-119 (2003) |
| 47 | EE | Pierluigi Crescenzi,
Alberto Del Lungo,
Roberto Grossi,
Elena Lodi,
Linda Pagli,
Gianluca Rossi:
Text sparsification via local maxima.
Theor. Comput. Sci. 1-3(304): 341-364 (2003) |
| 2002 |
|---|
| 46 | EE | Anna Bernasconi,
Valentina Ciriani,
Fabrizio Luccio,
Linda Pagli:
Fast three-level logic minimization based on autosymmetry.
DAC 2002: 425-430 |
| 45 | EE | Gianni Franceschini,
Roberto Grossi,
J. Ian Munro,
Linda Pagli:
Implicit B-Trees: New Results for the Dictionary Problem.
FOCS 2002: 145-154 |
| 44 | | Davide Gualerzi,
Elena Lodi,
Linda Pagli:
E-Commerce, Intermediation and Intelligent Software Agents.
ICWI 2002: 515-519 |
| 43 | | Anna Bernasconi,
Valentina Ciriani,
Fabrizio Luccio,
Linda Pagli:
Implicit Test of Regularity for Not Completely Specified Boolean Functions.
IWLS 2002: 345-350 |
| 42 | EE | Fabrizio Luccio,
Linda Pagli:
From Algorithms to Cryptography.
LATIN 2002: 15 |
| 41 | | Fabrizio Luccio,
Linda Pagli:
Two New Applications of Dynamos.
SIROCCO 2002: 247-258 |
| 40 | EE | Elena Lodi,
Linda Pagli,
Nicola Santoro:
FUN with Algorithms - Foreword.
Theor. Comput. Sci. 282(2): 221-222 (2002) |
| 2000 |
|---|
| 39 | EE | Pierluigi Crescenzi,
Alberto Del Lungo,
Roberto Grossi,
Elena Lodi,
Linda Pagli,
Gianluca Rossi:
Text Sparsification via Local Maxima.
FSTTCS 2000: 290-301 |
| 38 | | Fabrizio Luccio,
Linda Pagli:
An algorithmic definition of interval with applications to routing.
SIROCCO 2000: 227-236 |
| 37 | | Lino Flores Pacheco,
Gianni Franceschini,
Fabrizio Luccio,
Linda Pagli:
Decomposition of k-Dense Trees.
WDAS 2000: 11-23 |
| 36 | | Fabrizio Luccio,
Mohammed Mahafzah,
Mahmoud Al-Omari,
Linda Pagli:
Masked Interval Routing: A New Routing Scheme.
Comput. J. 43(2): 121-129 (2000) |
| 1999 |
|---|
| 35 | | Paola Flocchini,
Elena Lodi,
Fabrizio Luccio,
Linda Pagli,
Nicola Santoro:
Monotone Dynamos in Tori.
SIROCCO 1999: 152-165 |
| 34 | | Fabrizio Luccio,
Linda Pagli,
Hermineh Sanossian:
Irreversible Dynamos in Butterflies.
SIROCCO 1999: 204-218 |
| 33 | | Fabrizio Luccio,
Linda Pagli:
Dese Trees: A New Structure for Interconnection.
WDAS 1999: 56-72 |
| 32 | | Fabrizio Luccio,
Linda Pagli:
On a New Boolean Function with Applications.
IEEE Trans. Computers 48(3): 296-310 (1999) |
| 1998 |
|---|
| 31 | | Fabrizio Luccio,
Mohammed Mahafzah,
Mahmoud Al-Omari,
Linda Pagli:
Routing with the use of masks.
SIROCCO 1998: 188-200 |
| 30 | EE | Roberto De Prisco,
Angelo Monti,
Linda Pagli:
Testing and Reconfiguration of VLSI Linear Arrays.
Theor. Comput. Sci. 197(1-2): 171-188 (1998) |
| 29 | | Fabrizio Luccio,
Linda Pagli:
Computing with Time-Varying Data: Sequential Complexity and Parallel Speed-Up.
Theory Comput. Syst. 31(1): 5-26 (1998) |
| 1997 |
|---|
| 28 | EE | Fabrizio Luccio,
Linda Pagli:
An Insight on PRAM Computational Bounds.
Inf. Process. Lett. 63(6): 331-336 (1997) |
| 1995 |
|---|
| 27 | | Fabrizio Luccio,
Linda Pagli:
Approximate Matching for Two Families of Trees.
Inf. Comput. 123(1): 111-120 (1995) |
| 1994 |
|---|
| 26 | | Linda Pagli,
Geppino Pucci:
Counting the Number of Fault Patterns in Redundant VLSI Arrays.
Inf. Process. Lett. 50(6): 337-342 (1994) |
| 1993 |
|---|
| 25 | | Fabrizio Luccio,
Linda Pagli:
A Model of Sequential Computation with Pipelines Access to Memory.
Mathematical Systems Theory 26(4): 343-356 (1993) |
| 1992 |
|---|
| 24 | | Fabrizio Luccio,
Linda Pagli,
Geppino Pucci:
Three non Conventional Paradigms of Parallel Computation.
Heinz Nixdorf Symposium 1992: 166-175 |
| 23 | | Amiya Nayak,
Linda Pagli,
Nicola Santoro:
Efficient Construction of Catastrophic Patterns for VLSI Reconfigurable Arrays with Bidirectional Links.
ICCI 1992: 79-83 |
| 22 | | Fabrizio Luccio,
Linda Pagli:
The p-Shovelers Problem (Computing with Time-Varying Data).
SPDP 1992: 188-193 |
| 1991 |
|---|
| 21 | | Fabrizio Luccio,
Linda Pagli:
Simple Solutions for Approximate Tree Matching Problems.
TAPSOFT, Vol.1 1991: 193-201 |
| 20 | | Fabrizio Luccio,
Linda Pagli:
An Efficient Algorithm for Some Tree Matching Problems.
Inf. Process. Lett. 39(1): 51-57 (1991) |
| 1990 |
|---|
| 19 | | Elena Lodi,
Fabrizio Luccio,
Linda Pagli:
Routing in Times Square Mode.
Inf. Process. Lett. 35(1): 41-48 (1990) |
| 18 | | Alan A. Bertossi,
Fabrizio Luccio,
Elena Lodi,
Linda Pagli:
String Matching with Weighted Errors.
Theor. Comput. Sci. 73(3): 319-328 (1990) |
| 1989 |
|---|
| 17 | | Elena Lodi,
Fabrizio Luccio,
Linda Pagli:
A Preliminary Study of a Diagonal Channel-Routing Model.
Algorithmica 4(4): 585-597 (1989) |
| 16 | | Fabrizio Luccio,
Linda Pagli:
On the Upper Bound on the Rotation Distance of Binary Trees.
Inf. Process. Lett. 31(2): 57-60 (1989) |
| 1988 |
|---|
| 15 | | Elena Lodi,
Fabrizio Luccio,
Linda Pagli:
A 4D Channel Router for a Two Layer Diagonal Model.
AWOC 1988: 465-476 |
| 1986 |
|---|
| 14 | | Elena Lodi,
Linda Pagli:
Some New Results on a Restricted Channel Routing Problem.
Aegean Workshop on Computing 1986: 133-143 |
| 13 | | Elena Lodi,
Linda Pagli:
A VLSI Solution to the Vertical Segment Visibility Problem.
IEEE Trans. Computers 35(10): 923-928 (1986) |
| 1985 |
|---|
| 12 | | Linda Pagli:
Self-Adjusting Hash Tables.
Inf. Process. Lett. 21(1): 23-25 (1985) |
| 1984 |
|---|
| 11 | | Maurizio A. Bonuccelli,
Elena Lodi,
Linda Pagli:
External Sorting in VLSI.
IEEE Trans. Computers 33(10): 931-934 (1984) |
| 1983 |
|---|
| 10 | | Maurizio A. Bonuccelli,
Elena Lodi,
Fabrizio Luccio,
Piero Maestrini,
Linda Pagli:
VLSI Mesh of Trees for Data Base Processing.
CAAP 1983: 155-166 |
| 9 | | Maurizio A. Bonuccelli,
Elena Lodi,
Fabrizio Luccio,
Piero Maestrini,
Linda Pagli:
A VLSI Tree Machine for Relational Data Bases
ISCA 1983: 67-73 |
| 1982 |
|---|
| 8 | | Fabrizio Luccio,
Linda Pagli:
A Linear Algorithm to Determine Minimal Spanning Forests in Chain Graphs.
Inf. Process. Lett. 15(1): 1-4 (1982) |
| 1980 |
|---|
| 7 | | Fabrizio Luccio,
Linda Pagli:
Comment on Generalized AVL Trees.
Commun. ACM 23(7): 394-395 (1980) |
| 6 | | Michele Missikoff,
Linda Pagli:
A note on optimal allocation of files in a symmetric and homogeneous network.
Inf. Syst. 5(2): 149-150 (1980) |
| 1979 |
|---|
| 5 | | Linda Pagli:
Height-balanced multiway trees.
Inf. Syst. 4(1): 227-234 (1979) |
| 1978 |
|---|
| 4 | | Fabrizio Luccio,
Linda Pagli:
Power Trees.
Commun. ACM 21(11): 941-947 (1978) |
| 3 | | Fabrizio Luccio,
Linda Pagli:
Rebalancing Height Balanced Trees.
IEEE Trans. Computers 27(5): 386-396 (1978) |
| 1976 |
|---|
| 2 | | Fabrizio Luccio,
Linda Pagli:
On the Height of Height-Balanced Trees.
IEEE Trans. Computers 25(1): 87-91 (1976) |
| 1 | | Elena Lodi,
Fabrizio Luccio,
Linda Pagli,
Nicola Santoro:
Random access in a list environment.
Inf. Syst. 2(1): 11-17 (1976) |
