![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Fabrizio Luccio
Person information
- affiliation: University of Pisa, Italy
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c44]Fabrizio Luccio, Linda Pagli, Nicola Santoro:
Variations on the Tournament Problem. FUN 2024: 20:1-20:11 - 2021
- [j81]Fabrizio Luccio, Linda Pagli
:
Cops and robber on grids and tori: basic algorithms and their extension to a large number of cops. J. Supercomput. 77(9): 9746-9770 (2021) - [c43]Fabrizio Luccio, Linda Pagli:
Mobile Agents Operating on a Grid: Some Non-conventional Issues in Parallel Computing. PaCT 2021: 402-410
2010 – 2019
- 2019
- [c42]Fabrizio Luccio, Linda Pagli:
Capture on Grids and Tori with Different Numbers of Cops. PaCT 2019: 431-444 - 2018
- [b2]Paolo Ferragina, Fabrizio Luccio:
Computational Thinking - First Algorithms, Then Code. Springer 2018, ISBN 978-3-319-97939-7, pp. 1-174 - [c41]Anna Bernasconi, Antonio Boffa
, Fabrizio Luccio, Linda Pagli:
The Connection Layout in a Lattice of Four-Terminal Switches. VLSI-SoC (Selected Papers) 2018: 32-52 - [c40]Anna Bernasconi, Antonio Boffa
, Fabrizio Luccio, Linda Pagli:
Two Combinatorial Problems on the Layout of Switching Lattices. VLSI-SoC 2018: 137-142 - 2017
- [j80]Fabrizio Luccio:
Arithmetic for Rooted Trees. Theory Comput. Syst. 60(1): 33-52 (2017) - [i4]Fabrizio Luccio, Linda Pagli:
Cops and robber on grids and tori. CoRR abs/1708.08255 (2017) - 2016
- [j79]Fabrizio Luccio, Bernard Mans
, Luke Mathieson
, Linda Pagli:
Complete Balancing via Rotation. Comput. J. 59(8): 1252-1263 (2016) - [j78]Paola Flocchini, Fabrizio Luccio, Linda Pagli
, Nicola Santoro
:
Network decontamination under m-immunity. Discret. Appl. Math. 201: 114-129 (2016) - [j77]Fabrizio Luccio, Linda Pagli:
More agents may decrease global work: A case in butterfly decontamination. Theor. Comput. Sci. 655: 41-57 (2016) - [c39]Fabrizio Luccio:
An Arithmetic for Rooted Trees. FUN 2016: 23:1-23:14 - 2015
- [c38]Fabrizio Luccio, Linda Pagli
:
Soulmate Algorithms. Programming Languages with Applications to Biology and Security 2015: 283-291 - [i3]Fabrizio Luccio:
Arithmetic for Rooted Trees. CoRR abs/1510.05512 (2015) - 2014
- [e2]Alfredo Ferro, Fabrizio Luccio, Peter Widmayer:
Fun with Algorithms - 7th International Conference, FUN 2014, Lipari Island, Sicily, Italy, July 1-3, 2014. Proceedings. Lecture Notes in Computer Science 8496, Springer 2014, ISBN 978-3-319-07889-2 [contents] - 2013
- [j76]Fabrizio Luccio, Linda Pagli
:
Chain rotations: A new look at tree distance. Inf. Process. Lett. 113(7): 201-204 (2013) - [j75]Anna Bernasconi
, Valentina Ciriani
, Fabrizio Luccio, Linda Pagli
:
Compact DSOP and Partial DSOP Forms. Theory Comput. Syst. 53(4): 583-608 (2013) - [c37]Paola Flocchini, Fabrizio Luccio, Linda Pagli
, Nicola Santoro:
Optimal Network Decontamination with Threshold Immunity. CIAC 2013: 234-245 - 2012
- [i2]Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli:
Compact DSOP and partial DSOP Forms. CoRR abs/1204.5306 (2012) - [i1]Fabrizio Luccio, Linda Pagli:
Chain Rotations: a New Look at Tree Distance. CoRR abs/1204.5929 (2012) - 2011
- [b1]Fabrizio Luccio, Linda Pagli, Graham Steel:
Mathematical and Algorithmic Foundations of the Internet. Chapman and Hall / CRC Applied Algorithms and Data Structures Series, CRC Press 2011, ISBN 978-1-4398-3138-0, pp. I-XV, 1-205 - 2010
- [j74]Fabrizio Luccio, Antonio Mesa Enriques, Linda Pagli
:
Lower bounds on the rotation distance of binary trees. Inf. Process. Lett. 110(21): 934-938 (2010) - [c36]Anna Bernasconi
, Valentina Ciriani
, Fabrizio Luccio, Linda Pagli
:
Fun at a Department Store: Data Mining Meets Switching Theory. FUN 2010: 41-52
2000 – 2009
- 2009
- [j73]Fabrizio Luccio, Linda Pagli
:
The Fermat star of binary trees. Inf. Process. Lett. 109(11): 568-571 (2009) - [j72]Paolo Ferragina
, Fabrizio Luccio, Giovanni Manzini
, S. Muthukrishnan:
Compressing and indexing labeled trees, with applications. J. ACM 57(1): 4:1-4:33 (2009) - [j71]Pierluigi Crescenzi
, Fabrizio Luccio, Geppino Pucci
:
Foreword. Theory Comput. Syst. 44(2): 141-142 (2009) - [c35]Fabrizio Luccio:
Two algorithms issues from a teacher's perspective. ICTCS 2009: 4 - [c34]Fabrizio Luccio, Linda Pagli
:
A general approach to toroidal mesh decontamination with local immunity. IPDPS 2009: 1-8 - 2008
- [j70]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
- [j69]Fabrizio Luccio, Linda Pagli
, Nicola Santoro
:
Network decontamination in Presence of Local Immunity. Int. J. Found. Comput. Sci. 18(3): 457-474 (2007) - [j68]Fabrizio Luccio, Antonio Mesa Enriques, Linda Pagli
:
k-Restricted rotation distance between binary trees. Inf. Process. Lett. 102(5): 175-180 (2007) - [j67]Valentina Ciriani
, Paolo Ferragina, Fabrizio Luccio, S. Muthukrishnan:
A data structure for a sequence of string accesses in external memory. ACM Trans. Algorithms 3(1): 6:1-6:23 (2007) - [j66]Sean Cleary
, Fabrizio Luccio, Linda Pagli
:
Refined upper bounds for right-arm rotation distances. Theor. Comput. Sci. 377(1-3): 277-281 (2007) - [c33]Fabrizio Luccio, Linda Pagli:
Web Marshals Fighting Curly Link Farms. FUN 2007: 240-248 - 2006
- [j65]Gianni Franceschini, Fabrizio Luccio, Linda Pagli
:
Dense trees: a new look at degenerate graphs. J. Discrete Algorithms 4(3): 455-474 (2006) - [j64]Paolo Ferragina
, Roberto Grossi, Fabrizio Luccio:
Foreword. Theory Comput. Syst. 39(3): 389 (2006) - [j63]Anna Bernasconi
, Valentina Ciriani
, Fabrizio Luccio, Linda Pagli
:
Exploiting Regularities for Boolean Function Synthesis. Theory Comput. Syst. 39(4): 485-501 (2006) - [c32]Fabrizio Luccio, Linda Pagli
, Nicola Santoro:
Network decontamination with local immunization. IPDPS 2006 - [c31]Paolo Ferragina
, Fabrizio Luccio, Giovanni Manzini
, S. Muthukrishnan:
Compressing and searching XML data via two zips. WWW 2006: 751-760 - 2005
- [c30]Paolo Ferragina
, Fabrizio Luccio, Giovanni Manzini
, S. Muthukrishnan:
Structuring labeled trees for optimal succinctness, and beyond. FOCS 2005: 184-196 - [c29]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
- [j62]Paola Flocchini, Elena Lodi, Fabrizio Luccio, Linda Pagli
, Nicola Santoro
:
Dynamic monopolies in tori. Discret. Appl. Math. 137(2): 197-212 (2004) - 2003
- [j61]Valentina Ciriani
, Fabrizio Luccio, Linda Pagli
:
Synthesis of integer multipliers in sum of pseudoproducts form. Integr. 36(3): 103-119 (2003) - [j60]Nadia Pisanti
, Roberto Marangoni
, Paolo Ferragina
, Antonio Frangioni
, A. Savona, C. Pisanelli, Fabrizio Luccio:
PaTre: A Method for Paralogy Trees Construction. J. Comput. Biol. 10(5): 791-802 (2003) - [j59]Anna Bernasconi
, Valentina Ciriani
, Fabrizio Luccio, Linda Pagli
:
Three-level logic minimization based on function regularities. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 22(8): 1005-1016 (2003) - 2002
- [j58]Fabrizio Luccio:
Algorithms, nymphs, and shepherds. Theor. Comput. Sci. 282(2): 223-229 (2002) - [c28]Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli:
Fast three-level logic minimization based on autosymmetry. DAC 2002: 425-430 - [c27]Valentina Ciriani
, Paolo Ferragina, Fabrizio Luccio, S. Muthukrishnan:
Static Optimality Theorem for External Memory String Access. FOCS 2002: 219-227 - [c26]Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli:
Implicit Test of Regularity for Not Completely Specified Boolean Functions. IWLS 2002: 345-350 - [c25]Fabrizio Luccio, Linda Pagli:
From Algorithms to Cryptography. LATIN 2002: 15 - [c24]Fabrizio Luccio, Linda Pagli:
Two New Applications of Dynamos. SIROCCO 2002: 247-258 - 2001
- [e1]Adriano Di Pasquale, Fabrizio Luccio, Enrico Nardelli:
Distributed Data & Structures 3, Records of the 3rd International Meeting (WDAS 2000), L'Aquilia, Italy, 23 June 2000, in conjunction with SIROCCO 2000. Proceedings in Informatics 9, Carleton Scientific 2001, ISBN 1-894145-08-9 [contents] - 2000
- [j57]Fabrizio Luccio, Mohammed Mahafzah, Mahmoud Al-Omari, Linda Pagli:
Masked Interval Routing: A New Routing Scheme. Comput. J. 43(2): 121-129 (2000) - [j56]Fabrizio Luccio, Linda Pagli:
Death of a monster. SIGACT News 31(4): 130-133 (2000) - [c23]Fabrizio Luccio, Linda Pagli:
An algorithmic definition of interval with applications to routing. SIROCCO 2000: 227-236 - [c22]Lino Flores Pacheco, Gianni Franceschini, Fabrizio Luccio, Linda Pagli:
Decomposition of k-Dense Trees. WDAS 2000: 11-23 - [c21]Adriano Di Pasquale, Fabrizio Luccio, Enrico Nardelli:
Introduction: Distributed Data & Structures 3. WDAS 2000
1990 – 1999
- 1999
- [j55]Paolo Ferragina
, Fabrizio Luccio:
String Search in Coarse-Grained Parallel Computers. Algorithmica 24(3-4): 177-194 (1999) - [j54]Fabrizio Luccio, Linda Pagli
:
On a New Boolean Function with Applications. IEEE Trans. Computers 48(3): 296-310 (1999) - [c20]Paola Flocchini, Elena Lodi, Fabrizio Luccio, Linda Pagli, Nicola Santoro:
Monotone Dynamos in Tori. SIROCCO 1999: 152-165 - [c19]Fabrizio Luccio, Linda Pagli, Hermineh Sanossian:
Irreversible Dynamos in Butterflies. SIROCCO 1999: 204-218 - [c18]Fabrizio Luccio, Linda Pagli:
Dese Trees: A New Structure for Interconnection. WDAS 1999: 56-72 - 1998
- [j53]Paolo Ferragina
, Fabrizio Luccio:
Dynamic Dictionary Matching in External Memory. Inf. Comput. 146(2): 85-99 (1998) - [j52]Fabrizio Luccio, Linda Pagli:
Computing with Time-Varying Data: Sequential Complexity and Parallel Speed-Up. Theory Comput. Syst. 31(1): 5-26 (1998) - [c17]Paola Flocchini, Elena Lodi, Fabrizio Luccio, Nicola Santoro
:
Irreversible Dynamos in Tori. Euro-Par 1998: 554-562 - [c16]Fabrizio Luccio, Mohammed Mahafzah, Mahmoud Al-Omari, Linda Pagli:
Routing with the use of masks. SIROCCO 1998: 188-200 - 1997
- [j51]Fabrizio Luccio, Linda Pagli:
An Insight on PRAM Computational Bounds. Inf. Process. Lett. 63(6): 331-336 (1997) - [c15]Fabrizio Luccio, Alberto Pedrotti:
Design of Reliable Combinatorial Algorithms Using Certificates. CIAC 1997: 147-158 - [c14]Paolo Ferragina, Fabrizio Luccio:
Multi-string search in BSP. SEQUENCES 1997: 240-252 - 1996
- [j50]Paolo Ferragina
, Fabrizio Luccio:
Three Techniques for Parallel Maintenance of a Minimum Spanning Tree under Batch of Updates. Parallel Process. Lett. 6(2): 213-222 (1996) - [c13]Paolo Ferragina
, Fabrizio Luccio:
On the Parallel Dynamic Dictionary Matching Problem: New Results with Applications. ESA 1996: 261-275 - 1995
- [j49]Fabrizio Luccio, Linda Pagli
:
Approximate Matching for Two Families of Trees. Inf. Comput. 123(1): 111-120 (1995) - 1994
- [j48]Fabrizio Luccio, Alberto Pedrotti:
A Parallel List Update Problem. Inf. Process. Lett. 52(5): 277-284 (1994) - [c12]Paolo Ferragina, Fabrizio Luccio:
Batch Dynamic Algorithms for Two Graph Problems. PARLE 1994: 713-724 - [c11]Fabrizio Luccio, Linda Pagli:
Computational bounds for the simple and the MRMW PRAM. SPDP 1994: 552-557 - 1993
- [j47]Fabrizio Luccio, Linda Pagli
:
A Model of Sequential Computation with Pipelines Access to Memory. Math. Syst. Theory 26(4): 343-356 (1993) - 1992
- [j46]Fabrizio Luccio, Andrea Pietracaprina, Geppino Pucci:
Analysis and Implementation of Parallel Uniform Hashing. Int. J. Found. Comput. Sci. 3(1): 55-63 (1992) - [j45]Bettina De Iaco, Fabrizio Luccio:
Finding all the Palindromes in a Binary Tree in Linear Time and Space. Inf. Process. Lett. 44(2): 73-77 (1992) - [j44]Fabrizio Luccio, Linda Pagli:
The p-shovelers problem: (computing with time-varying data). SIGACT News 23(2): 72-75 (1992) - [c10]Fabrizio Luccio, Linda Pagli, Geppino Pucci
:
Three non Conventional Paradigms of Parallel Computation. Heinz Nixdorf Symposium 1992: 166-175 - [c9]Fabrizio Luccio, Linda Pagli:
The p-Shovelers Problem (Computing with Time-Varying Data). SPDP 1992: 188-193 - 1991
- [j43]Elena Lodi, Fabrizio Luccio, Xiaoyu Song:
A 2d channel router for the diagonal model. Integr. 11(2): 111-125 (1991) - [j42]Fabrizio Luccio, Andrea Pietracaprina, Geppino Pucci
:
Analysis of Parallel Uniform Hashing. Inf. Process. Lett. 37(2): 67-69 (1991) - [j41]Fabrizio Luccio, Linda Pagli
:
An Efficient Algorithm for Some Tree Matching Problems. Inf. Process. Lett. 39(1): 51-57 (1991) - [c8]Fabrizio Luccio, Linda Pagli:
Simple Solutions for Approximate Tree Matching Problems. TAPSOFT, Vol.1 1991: 193-201 - 1990
- [j40]Fabrizio Luccio, Andrea Pietracaprina, Geppino Pucci
:
A New Scheme for the Deterministic Simulation of PRAMs in VLSI. Algorithmica 5(4): 529-544 (1990) - [j39]Fabrizio Luccio, Maria Cristina Pinotti
:
Suboptimal solution for PLA multiple column folding. Comput. Aided Des. 22(8): 515-520 (1990) - [j38]Elena Lodi, Fabrizio Luccio, Linda Pagli
:
Routing in Times Square Mode. Inf. Process. Lett. 35(1): 41-48 (1990) - [j37]Alan A. Bertossi, Fabrizio Luccio, Elena Lodi, Linda Pagli
:
String Matching with Weighted Errors. Theor. Comput. Sci. 73(3): 319-328 (1990)
1980 – 1989
- 1989
- [j36]Elena Lodi, Fabrizio Luccio, Linda Pagli
:
A Preliminary Study of a Diagonal Channel-Routing Model. Algorithmica 4(4): 585-597 (1989) - [j35]Elena Lodi, Fabrizio Luccio, Linda Pagli
:
Channel routing for strictly multiterminal nets. Integr. 8(2): 143-153 (1989) - [j34]Fabrizio Luccio, Linda Pagli
:
On the Upper Bound on the Rotation Distance of Binary Trees. Inf. Process. Lett. 31(2): 57-60 (1989) - [j33]Roberto Grossi, Fabrizio Luccio:
Simple and Efficient String Matching with k Mismatches. Inf. Process. Lett. 33(3): 113-120 (1989) - [c7]Fabrizio Luccio, Mireille Régnier, René Schott:
Discs and Other Related Data Structures. WADS 1989: 192-205 - 1988
- [j32]Fabrizio Luccio, Geppino Pucci
, Andrea Pietracaprina:
A Probabilistic Simulation of PRAMs on a Bounded Degree Network. Inf. Process. Lett. 28(3): 141-147 (1988) - [c6]Elena Lodi, Fabrizio Luccio, Linda Pagli:
A 4D Channel Router for a Two Layer Diagonal Model. AWOC 1988: 465-476 - 1987
- [j31]Fabrizio Luccio, S. Mazzone, C. K. Wong:
A note on visibility graphs. Discret. Math. 64(2-3): 209-219 (1987) - 1985
- [j30]Fabrizio Luccio:
Access to rows and columns of a rectangular array in a concentricloop bubble memory. Integr. 3(4): 347-354 (1985) - [j29]Elena Lodi, Fabrizio Luccio:
Split Sequence Hash Search. Inf. Process. Lett. 20(3): 131-136 (1985) - [j28]Fabrizio Luccio:
Variations on a Method for Representing Data Items of Unlimited Length. IEEE Trans. Software Eng. 11(4): 439-441 (1985) - [c5]Fabrizio Luccio:
VLSI Trees for File Organization. FODO 1985: 265-277 - 1983
- [c4]Maurizio A. Bonuccelli, Elena Lodi, Fabrizio Luccio, Piero Maestrini, Linda Pagli:
VLSI Mesh of Trees for Data Base Processing. CAAP 1983: 155-166 - [c3]Maurizio A. Bonuccelli, Elena Lodi, Fabrizio Luccio, Piero Maestrini, Linda Pagli:
A VLSI Tree Machine for Relational Data Bases. ISCA 1983: 67-73 - 1982
- [j27]Fabrizio Luccio, Linda Pagli
:
A Linear Algorithm to Determine Minimal Spanning Forests in Chain Graphs. Inf. Process. Lett. 15(1): 1-4 (1982) - 1980
- [j26]Fabrizio Luccio, Linda Pagli:
Comment on Generalized AVL Trees. Commun. ACM 23(7): 394-395 (1980) - [j25]Kin-Man Chung, Fabrizio Luccio, Chak-Kuen Wong:
On the Complexity of Permuting Records in Magnetic Bubble Memory Systems. IBM J. Res. Dev. 24(1): 75-84 (1980) - [j24]Fabrizio Luccio, S. Mazzone:
A Cryptosystem for Multiple Communication. Inf. Process. Lett. 10(4/5): 180-183 (1980) - [j23]Kin-Man Chung, Fabrizio Luccio, C. K. Wong:
A New Permutation Algorithm for Bubble Memories. Inf. Process. Lett. 10(4/5): 226-230 (1980) - [j22]Kin-Man Chung, Fabrizio Luccio, C. K. Wong:
Minimum Number of Steps for Permutation in a Bubble Memory. Inf. Process. Lett. 11(2): 81-83 (1980) - [j21]Kin-Man Chung, Fabrizio Luccio, C. K. Wong:
On the Complexity of Sorting in Magnetic Bubble Memory Systems. IEEE Trans. Computers 29(7): 553-563 (1980) - [j20]Gian Carlo Bongiovanni, Fabrizio Luccio:
Maintaining Sorted Files in a Magnetic Bubble Memory. IEEE Trans. Computers 29(10): 855-863 (1980) - [j19]Kin-Man Chung, Fabrizio Luccio, C. K. Wong:
A Tree Storage Scheme for Magnetic Bubble Memories. IEEE Trans. Computers 29(10): 864-874 (1980) - [c2]Kin-Man Chung, Fabrizio Luccio, C. K. Wong:
Magnetic Bubble Memory Structures for Efficient Sorting and Searching. IFIP Congress 1980: 439-444
1970 – 1979
- 1979
- [j18]Gian Carlo Bongiovanni, Fabrizio Luccio:
Permutation of Data Blocks in a Bubble Memory. Commun. ACM 22(1): 21-25 (1979) - 1978
- [j17]Fabrizio Luccio, Linda Pagli
:
Power Trees. Commun. ACM 21(11): 941-947 (1978) - [j16]Gian Carlo Bongiovanni, Fabrizio Luccio:
On Cahit's Result on Graceful Permutations. Inf. Process. Lett. 7(4): 183-184 (1978) - [j15]Fabrizio Luccio, Linda Pagli
:
Rebalancing Height Balanced Trees. IEEE Trans. Computers 27(5): 386-396 (1978) - 1976
- [j14]Fabrizio Luccio, Franco P. Preparata:
Storage for Consecutive Retrieval. Inf. Process. Lett. 5(3): 68-71 (1976) - [j13]Elena Lodi, Fabrizio Luccio, Linda Pagli
, Nicola Santoro:
Random access in a list environment. Inf. Syst. 2(1): 11-17 (1976) - [j12]Fabrizio Luccio, Linda Pagli
:
On the Height of Height-Balanced Trees. IEEE Trans. Computers 25(1): 87-91 (1976) - 1975
- [j11]H. T. Kung, Fabrizio Luccio, Franco P. Preparata:
On Finding the Maxima of a Set of Vectors. J. ACM 22(4): 469-476 (1975) - [j10]Gian Carlo Bongiovanni, Fabrizio Luccio, Alessandro Zorat:
The Discrete Equation of the Straight Line. IEEE Trans. Computers 24(3): 310-313 (1975) - 1973
- [j9]Giorgio Levi, Fabrizio Luccio:
A technique for graph embedding with constraints on node and arc correspondences. Inf. Sci. 5: 1-24 (1973) - [j8]Pierluigi Della Vigna, Fabrizio Luccio:
Some aspects of the recognition of convex polyhedra from two plane projections - II. Inf. Sci. 6: 313-325 (1973) - 1972
- [j7]Fabrizio Luccio:
Weighted Increment Linear Search for Scatter Tables. Commun. ACM 15(12): 1045-1047 (1972) - 1970
- [j6]Pierluigi Della Vigna, Fabrizio Luccio:
Some aspects of the recognition of convex polyhedra from two plane projections. I. Inf. Sci. 2(2): 159-178 (1970)
1960 – 1969
- 1969
- [j5]Fabrizio Luccio:
Extending the Definition of Prime Compatibility Classes of States in Incomplete Sequential Machine Reduction. IEEE Trans. Computers 18(6): 537-540 (1969) - 1967
- [j4]Fabrizio Luccio:
A comment on index register allocation. Commun. ACM 10(9): 572-574 (1967) - 1966
- [j3]Fabrizio Luccio:
A Method for the Selection of Prime Implicants. IEEE Trans. Electron. Comput. 15(2): 205-212 (1966) - [j2]Fabrizio Luccio:
Reduction of the Number of Columns in Flow Table Minimization. IEEE Trans. Electron. Comput. 15(5): 803-805 (1966) - [c1]Antonio Grasselli, Fabrizio Luccio:
A Method for the Combined Row-Column Reduction of Flow Tables. SWAT 1966: 136-147 - 1965
- [j1]Antonio Grasselli, Fabrizio Luccio:
A Method for Minimizing the Number of Internal States in Incompletely Specified Sequential Networks. IEEE Trans. Electron. Comput. 14(3): 350-359 (1965)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-31 18:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint