HEIGHT-BALANCED MULTIWAY TREESPAGLI L.1979; INFORM. SYST.; GBR; DA. 1979; VOL. 4; NO 3; PP. 227-234; BIBL. 6 REF.Article

Self-adjusting Hash tablesPAGLI, L.Information processing letters. 1985, Vol 21, Num 1, pp 23-25, issn 0020-0190Article

A LINEAR ALGORITHM TO DETERMINE MINIMAL SPANNING FORESTS IN CHAIN GRAPHSLUCCIO F; PAGLI L.1982; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1982; VOL. 15; NO 1; PP. 1-4; BIBL. 3 REF.Article

REBALANCING HEIGHT BALANCED TREESLUCCIO F; PAGLI L.1978; I.E.E.E. TRANS. COMPUTERS; USA; DA. 1978; VOL. 27; NO 5; PP. 386-396; BIBL. 5 REF.Article

POWER TREESLUCCIO F; PAGLI L.1978; COMMUNIC. A.C.M.; USA; DA. 1978; VOL. 21; NO 11; PP. 941-947; BIBL. 9 REF.Article

RANDOM ACCESS IN A LIST ENVIRONMENT.LODI E; LUCCIO F; PAGLI L et al.1976; INFORM. SYST.; G.B.; DA. 1976; VOL. 2; NO 1; PP. 11-17; BIBL. 6 REF.Article

Counting the number of fault patterns in redundant VLSI arraysPAGLI, L; PUCCI, G.Information processing letters. 1994, Vol 50, Num 6, pp 337-342, issn 0020-0190Article

On the upper bound on the rotation distance of binary treesLUCCIO, F; PAGLI, L.Information processing letters. 1989, Vol 31, Num 2, pp 57-60, issn 0020-0190Article

On a new Boolean function with applicationsLUCCIO, F; PAGLI, L.IEEE transactions on computers. 1999, Vol 48, Num 3, pp 296-310, issn 0018-9340Article

A VLSI solution to the vertical segment visibility problemLODI, E; PAGLI, L.IEEE transactions on computers. 1986, Vol 35, Num 10, pp 923-928, issn 0018-9340Article

An insight on PRAM computational boundsLUCCIO, F; PAGLI, L.Information processing letters. 1997, Vol 63, Num 6, pp 331-336, issn 0020-0190Article

Approximate matching for two families of treesLUCCIO, F; PAGLI, L.Information and computation (Print). 1995, Vol 123, Num 1, pp 111-120, issn 0890-5401Article

Testing and reconfiguration of VLSI linear arraysDE PRISCO, R; MONTI, A; PAGLI, L et al.Theoretical computer science. 1998, Vol 197, Num 1-2, pp 171-188, issn 0304-3975Article

Routing in times square modeLODI, E; LUCCIO, F; PAGLI, L et al.Information processing letters. 1990, Vol 35, Num 1, pp 41-48, issn 0020-0190, 8 p.Article

External sorting in VLSIBONUCCELLI, M. A; LODI, E; PAGLI, L et al.IEEE transactions on computers. 1984, Vol 33, Num 10, pp 931-934, issn 0018-9340Article

Computing all the best swap edges distributivelyFLOCCHINI, P; PAGLI, L; PRENCIPE, G et al.Journal of parallel and distributed computing (Print). 2008, Vol 68, Num 7, pp 976-983, issn 0743-7315, 8 p.Article

A parallel solution to the approximate string matching problemBERTOSSI, A. A; LUCCIO, F; PAGLI, L et al.Computer journal (Print). 1992, Vol 35, Num 5, pp 524-526, issn 0010-4620Article

String matching with weighted errorsBERTOSSI, A. A; LUCCIO, F; LODI, E et al.Theoretical computer science. 1990, Vol 73, Num 3, pp 319-328, issn 0304-3975, 10 p.Article

Computing all the best swap edges distributivelyFLOCCHINI, P; PAGLI, L; PRENCIPE, G et al.Lecture notes in computer science. 2005, pp 154-168, issn 0302-9743, isbn 3-540-27324-7, 15 p.Conference Paper

Irreversible dynamos in ToriFLOCCHINI, P; LODI, E; LUCCIO, F et al.Lecture notes in computer science. 1998, pp 554-562, issn 0302-9743, isbn 3-540-64952-2Conference Paper