| On finding the maxima of a set of vectors HT Kung, F Luccio, FP Preparata Journal of the ACM (JACM) 22 (4), 469-476, 1975 | 1248 | 1975 |
| A method for minimizing the number of internal states in incompletely specified sequential networks A Grasselli, F Luccio IEEE Transactions on Electronic Computers, 350-359, 1965 | 262 | 1965 |
| Compressing and indexing labeled trees, with applications P Ferragina, F Luccio, G Manzini, S Muthukrishnan Journal of the ACM (JACM) 57 (1), 1-33, 2009 | 183 | 2009 |
| Structuring labeled trees for optimal succinctness, and beyond P Ferragina, F Luccio, G Manzini, S Muthukrishnan 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 184-193, 2005 | 155 | 2005 |
| On the decomposition of networks in minimally interconnected subnetworks F Luccio, M Sami IEEE Transactions on Circuit Theory 16 (2), 184-188, 1969 | 130 | 1969 |
| A preliminary study of a diagonal channel-routing model E Lodi, F Luccio, L Pagli Algorithmica 4, 585-597, 1989 | 119 | 1989 |
| A 2d channel router for the diagonal model E Lodi, F Luccio, X Song Integration 11 (2), 111-125, 1991 | 100 | 1991 |
| Simple and efficient string matching with k mismatches R Grossi, F Luccio Information Processing Letters 33 (3), 113-120, 1989 | 96 | 1989 |
| Compressing and searching XML data via two zips P Ferragina, F Luccio, G Manzini, S Muthukrishnan Proceedings of the 15th international conference on World Wide Web, 751-760, 2006 | 95 | 2006 |
| On a new Boolean function with applications F Luccio, L Pagli IEEE transactions on computers 48 (3), 296-310, 1999 | 93 | 1999 |
| Routing in times square mode E Lodi, F Luccio, L Pagli Information processing letters 35 (1), 41-48, 1990 | 92 | 1990 |
| Dynamic monopolies in tori P Flocchini, E Lodi, F Luccio, L Pagli, N Santoro Discrete applied mathematics 137 (2), 197-212, 2004 | 91 | 2004 |
| On two-dimensional data organization II W Lipski Jr, E Lodi, F Luccio, C Mugnai, L Pagli Fundamenta Informaticae 2 (1), 245-260, 1978 | 89 | 1978 |
| A visibility problem in VLSI layout compaction M Schlag, F Luccio, P Maestrini, DT Lee, CK Wong IBM Thomas J. Watson Research Division, 1983 | 77 | 1983 |
| Exact rooted subtree matching in sublinear time F Luccio, A Mesa Enriquez, P Olivares Rieumont, L Pagli Università di Pisa, 2001 | 52 | 2001 |
| A note on visibility graphs F Luccio, S Mazzone, CK Wong Discrete Mathematics 64 (2-3), 209-219, 1987 | 51 | 1987 |
| Irreversible Dynamos in Butterflies. F Luccio, L Pagli, H Sanossian SIROCCO, 204-218, 1999 | 46 | 1999 |
| A new scheme for the deterministic simulation of PRAMs in VLSI F Luccio, A Pietracaprina, G Pucci Algorithmica 5, 529-544, 1990 | 46 | 1990 |
| On the upper bound on the rotation distance of binary trees F Luccio, L Pagli Information Processing Letters 31 (2), 57-60, 1989 | 42 | 1989 |
| Method of structuring and compressing labeled trees of arbitrary degree and shape P Ferragina, F Luccio, G Manzini, S Muthukrishnan US Patent 8,156,156, 2012 | 41 | 2012 |
