Variations on a method for representing data items of unlimited lengthLUCCIO, F.IEEE transactions on software engineering. 1985, Vol 11, Num 4, pp 439-441, issn 0098-5589Article

A TECHNIQUE FOR GRAPH EMBEDDING WITH CONSTRAINTS ON NODE AND ARC CORRESPONDENCESLEVI G; LUCCIO F.1973; INFORM. SCI.; U.S.A.; DA. 1973; VOL. 5; PP. 1-24; BIBL. 6 REF.Serial Issue

Access to rows and columns of a rectangular array in a concentric-loop bubble memoryLUCCIO, F.Integration (Amsterdam). 1985, Vol 3, Num 4, pp 347-354, issn 0167-9260Article

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

A CRYPTOSYSTEM FOR MULTIPLE COMMUNICATIONLUCCIO F; MAZZONE S.1980; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1980; VOL. 10; NO 4-5; PP. 180-183; BIBL. 9 REF.Article

ON CAHIT'S RESULT ON GRACEFUL PERMUTATIONSBONGIOVANNI G; LUCCIO F.1978; INFORM. PROCESSG LETTERS; NLD; DA. 1978; VOL. 7; NO 4; PP. 183-184; 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

A NOTE ON COMPACT SETS IN GRAPHSLODI E; LUCCIO F.1978; RIC. DI AUTOMAT.; ITA; DA. 1978; VOL. 9; NO 1; PP. 86-91; BIBL. 1 REF.Article

I-SETS IN HYPERGRAPHS.LODI E; LUCCIO F.1974; RIC. DI AUTOMAT.; ITAL.; DA. 1974; VOL. 5; NO 1; PP. 30-40; BIBL. 3 REF.Article

PERMUTATION OF DATA BLOCKS IN A BUBBLE MEMORYBONGIOVANNI GC; LUCCIO F.1979; COMMUNIC. A.C.M.; USA; DA. 1979; VOL. 22; NO 1; PP. 21-25; BIBL. 8 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

STORAGE FOR CONSECUTIVE RETRIEVAL.LUCCIO F; PREPARATA FP.1976; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1976; VOL. 5; NO 3; PP. 68-71; BIBL. 2 REF.Article

Almost exact minimum feedback vertex set in meshes and butterfliesLUCCIO, F. L.Information processing letters. 1998, Vol 66, Num 2, pp 59-64, issn 0020-0190Article

ON THE COMPLEXITY OF SORTING IN MAGNETIC BUBBLE MEMORY SYSTEMSKIN MAN CHUNG; LUCCIO F; WONG CK et al.1980; IEEE TRANS. COMPUT.; ISSN 0018-9340; USA; DA. 1980; VOL. 29; NO 7; PP. 553-563; BIBL. 15 REF.Article

ON THE COMPLEXITY OF PERMUTING RECORDS IN MAGNETIC BUBBLE MEMORY SYSTEMSCHUNG KM; LUCCIO F; WONG CK et al.1980; I.B.M. J. RES. DEVELOP.; USA; DA. 1980; VOL. 24; NO 1; PP. 75-84; BIBL. 17 REF.Article

A NEW PERMUTATION ALGORITHM FOR BUBBLE MEMORIESCHUNG KM; LUCCIO F; WONG CK et al.1980; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1980; VOL. 10; NO 4-5; PP. 226-230; BIBL. 10 REF.Article

ON FINDING THE MAXIMA OF A SET OF VECTORS.KUNG HT; LUCCIO F; PREPARATA FP et al.1975; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1975; VOL. 22; NO 4; PP. 469-476; BIBL. 4 REF.Article

MINIMUM NUMBER OF STEPS FOR PERMUTATION IN A BUBBLE MEMORYCHUNG KM; LUCCIO F; WONG CK et al.1980; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1980; VOL. 11; NO 2; PP. 81-83; BIBL. 4 REF.Article

Suboptimal solution for PLA multiple column foldingLUCCIO, F; PINOTTI, M. C.Computer-aided design. 1990, Vol 22, Num 8, pp 515-520, issn 0010-4485Article

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

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

Minimal synthesis of multivalued functions with new operatorsLUCCIO, F; PINOTTI, M. C.IEE proceedings. Part E. Computers and digital techniques. 1991, Vol 138, Num 6, pp 419-423, issn 0143-7062Article

A parallel list update problemLUCCIO, F; PEDROTTI, A.Information processing letters. 1994, Vol 52, Num 5, pp 277-284, issn 0020-0190Article

Finding all the palindromes in a binary tree in linear time and spaceDE IACO, B; LUCCIO, F.Information processing letters. 1992, Vol 44, Num 2, pp 73-77, 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