Fabrizio Luccio

According to our database1, Fabrizio Luccio authored at least 128 papers between 1965 and 2019.

Collaborative distances:

Awards

IEEE Fellow

IEEE Fellow 1983, "For contributions to the theory of sequential switching networks and for leadership in computer science education.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Capture on Grids and Tori with Different Numbers of Cops.
Proceedings of the Parallel Computing Technologies, 2019

2018
Two Combinatorial Problems on the Layout of Switching Lattices.
Proceedings of the IFIP/IEEE International Conference on Very Large Scale Integration, 2018

The Connection Layout in a Lattice of Four-Terminal Switches.
Proceedings of the VLSI-SoC: Design and Engineering of Electronics Systems Based on New Computing Paradigms, 2018

Computational Thinking - First Algorithms, Then Code
Springer, ISBN: 978-3-319-97939-7, 2018

2017
Arithmetic for Rooted Trees.
Theory Comput. Syst., 2017

Cops and robber on grids and tori.
CoRR, 2017

2016
More agents may decrease global work: A case in butterfly decontamination.
Theor. Comput. Sci., 2016

Network decontamination under m-immunity.
Discrete Applied Mathematics, 2016

Complete Balancing via Rotation.
Comput. J., 2016

An Arithmetic for Rooted Trees.
Proceedings of the 8th International Conference on Fun with Algorithms, 2016

2015
Arithmetic for Rooted Trees.
CoRR, 2015

Soulmate Algorithms.
Proceedings of the Programming Languages with Applications to Biology and Security, 2015

2013
Compact DSOP and Partial DSOP Forms.
Theory Comput. Syst., 2013

Chain rotations: A new look at tree distance.
Inf. Process. Lett., 2013

Optimal Network Decontamination with Threshold Immunity.
Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

2012
Chain Rotations: a New Look at Tree Distance
CoRR, 2012

Compact DSOP and partial DSOP Forms
CoRR, 2012

2011
Mathematical and Algorithmic Foundations of the Internet.
Chapman and Hall / CRC Applied Algorithms and Data Structures Series, CRC Press, ISBN: 978-1-4398-3138-0, 2011

2010
Lower bounds on the rotation distance of binary trees.
Inf. Process. Lett., 2010

Fun at a Department Store: Data Mining Meets Switching Theory.
Proceedings of the Fun with Algorithms, 5th International Conference, 2010

2009
Foreword.
Theory Comput. Syst., 2009

Compressing and indexing labeled trees, with applications.
J. ACM, 2009

The Fermat star of binary trees.
Inf. Process. Lett., 2009

A general approach to toroidal mesh decontamination with local immunity.
Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

Two algorithms issues from a teacher's perspective.
Proceedings of the Theoretical Computer Science, 11th Italian Conference, 2009

2008
Synthesis of Autosymmetric Functions in a New Three-Level Form.
Theory Comput. Syst., 2008

2007
Refined upper bounds for right-arm rotation distances.
Theor. Comput. Sci., 2007

A data structure for a sequence of string accesses in external memory.
ACM Trans. Algorithms, 2007

k-Restricted rotation distance between binary trees.
Inf. Process. Lett., 2007

Network decontamination in Presence of Local Immunity.
Int. J. Found. Comput. Sci., 2007

Web Marshals Fighting Curly Link Farms.
Proceedings of the Fun with Algorithms, 4th International Conference, 2007

2006
Foreword.
Theory Comput. Syst., 2006

Exploiting Regularities for Boolean Function Synthesis.
Theory Comput. Syst., 2006

Dense trees: a new look at degenerate graphs.
J. Discrete Algorithms, 2006

Compressing and searching XML data via two zips.
Proceedings of the 15th international conference on World Wide Web, 2006

Network decontamination with local immunization.
Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 2006

2005
k-Restricted Rotation with an Application to Search Tree Rebalancing.
Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

Structuring labeled trees for optimal succinctness, and beyond.
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

2004
Dynamic monopolies in tori.
Discrete Applied Mathematics, 2004

2003
Three-level logic minimization based on function regularities.
IEEE Trans. on CAD of Integrated Circuits and Systems, 2003

PaTre: A Method for Paralogy Trees Construction.
Journal of Computational Biology, 2003

Synthesis of integer multipliers in sum of pseudoproducts form.
Integration, 2003

2002
Algorithms, nymphs, and shepherds.
Theor. Comput. Sci., 2002

Two New Applications of Dynamos.
Proceedings of the SIROCCO 9, 2002

From Algorithms to Cryptography.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

Implicit Test of Regularity for Not Completely Specified Boolean Functions.
Proceedings of the 11th IEEE/ACM International Workshop on Logic & Synthesis, 2002

Static Optimality Theorem for External Memory String Access.
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

Fast three-level logic minimization based on autosymmetry.
Proceedings of the 39th Design Automation Conference, 2002

2000
Death of a monster.
SIGACT News, 2000

Masked Interval Routing: A New Routing Scheme.
Comput. J., 2000

Introduction: Distributed Data & Structures 3.
Proceedings of the Distributed Data & Structures 3, 2000

Decomposition of k-Dense Trees.
Proceedings of the Distributed Data & Structures 3, 2000

An algorithmic definition of interval with applications to routing.
Proceedings of the SIROCCO 7, 2000

1999
On a New Boolean Function with Applications.
IEEE Trans. Computers, 1999

String Search in Coarse-Grained Parallel Computers.
Algorithmica, 1999

Dese Trees: A New Structure for Interconnection.
Proceedings of the Distributed Data & Structures 2, 1999

Irreversible Dynamos in Butterflies.
Proceedings of the SIROCCO'99, 1999

Monotone Dynamos in Tori.
Proceedings of the SIROCCO'99, 1999

1998
Computing with Time-Varying Data: Sequential Complexity and Parallel Speed-Up.
Theory Comput. Syst., 1998

Dynamic Dictionary Matching in External Memory.
Inf. Comput., 1998

Routing with the use of masks.
Proceedings of the SIROCCO'98, 1998

Irreversible Dynamos in Tori.
Proceedings of the Euro-Par '98 Parallel Processing, 1998

1997
An Insight on PRAM Computational Bounds.
Inf. Process. Lett., 1997

Multi-string search in BSP.
Proceedings of the Compression and Complexity of SEQUENCES 1997, 1997

Design of Reliable Combinatorial Algorithms Using Certificates.
Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997

1996
Three Techniques for Parallel Maintenance of a Minimum Spanning Tree under Batch of Updates.
Parallel Processing Letters, 1996

On the Parallel Dynamic Dictionary Matching Problem: New Results with Applications.
Proceedings of the Algorithms, 1996

1995
Approximate Matching for Two Families of Trees.
Inf. Comput., 1995

1994
A Parallel List Update Problem.
Inf. Process. Lett., 1994

Computational bounds for the simple and the MRMW PRAM.
Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing, 1994

Batch Dynamic Algorithms for Two Graph Problems.
Proceedings of the PARLE '94: Parallel Architectures and Languages Europe, 1994

1993
A Model of Sequential Computation with Pipelines Access to Memory.
Mathematical Systems Theory, 1993

1992
The p-shovelers problem: (computing with time-varying data).
SIGACT News, 1992

Finding all the Palindromes in a Binary Tree in Linear Time and Space.
Inf. Process. Lett., 1992

Analysis and Implementation of Parallel Uniform Hashing.
Int. J. Found. Comput. Sci., 1992

The p-Shovelers Problem (Computing with Time-Varying Data).
Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing, 1992

Three non Conventional Paradigms of Parallel Computation.
Proceedings of the Parallel Architectures and Their Efficient Use, 1992

1991
Analysis of Parallel Uniform Hashing.
Inf. Process. Lett., 1991

An Efficient Algorithm for Some Tree Matching Problems.
Inf. Process. Lett., 1991

A 2d channel router for the diagonal model.
Integration, 1991

Simple Solutions for Approximate Tree Matching Problems.
Proceedings of the TAPSOFT'91: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1991

1990
String Matching with Weighted Errors.
Theor. Comput. Sci., 1990

Routing in Times Square Mode.
Inf. Process. Lett., 1990

Suboptimal solution for PLA multiple column folding.
Computer-Aided Design, 1990

A New Scheme for the Deterministic Simulation of PRAMs in VLSI.
Algorithmica, 1990

1989
On the Upper Bound on the Rotation Distance of Binary Trees.
Inf. Process. Lett., 1989

Simple and Efficient String Matching with k Mismatches.
Inf. Process. Lett., 1989

Channel routing for strictly multiterminal nets.
Integration, 1989

A Preliminary Study of a Diagonal Channel-Routing Model.
Algorithmica, 1989

Discs and Other Related Data Structures.
Proceedings of the Algorithms and Data Structures, 1989

1988
A Probabilistic Simulation of PRAMs on a Bounded Degree Network.
Inf. Process. Lett., 1988

A 4D Channel Router for a Two Layer Diagonal Model.
Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

1987
A note on visibility graphs.
Discrete Mathematics, 1987

1985
Variations on a Method for Representing Data Items of Unlimited Length.
IEEE Trans. Software Eng., 1985

Split Sequence Hash Search.
Inf. Process. Lett., 1985

Access to rows and columns of a rectangular array in a concentricloop bubble memory.
Integration, 1985

VLSI Trees for File Organization.
Proceedings of the Foundations of Data Organization, 1985

1983
A VLSI Tree Machine for Relational Data Bases
Proceedings of the 10th Annual Symposium on Computer Architecture, 1983, 1983

VLSI Mesh of Trees for Data Base Processing.
Proceedings of the CAAP'83, 1983

1982
A Linear Algorithm to Determine Minimal Spanning Forests in Chain Graphs.
Inf. Process. Lett., 1982

1980
A Tree Storage Scheme for Magnetic Bubble Memories.
IEEE Trans. Computers, 1980

On the Complexity of Sorting in Magnetic Bubble Memory Systems.
IEEE Trans. Computers, 1980

Maintaining Sorted Files in a Magnetic Bubble Memory.
IEEE Trans. Computers, 1980

A Cryptosystem for Multiple Communication.
Inf. Process. Lett., 1980

Minimum Number of Steps for Permutation in a Bubble Memory.
Inf. Process. Lett., 1980

A New Permutation Algorithm for Bubble Memories.
Inf. Process. Lett., 1980

On the Complexity of Permuting Records in Magnetic Bubble Memory Systems.
IBM Journal of Research and Development, 1980

Comment on Generalized AVL Trees.
Commun. ACM, 1980

Magnetic Bubble Memory Structures for Efficient Sorting and Searching.
Proceedings of the Information Processing, Proceedings of the 8th IFIP Congress 1980, Tokyo, Japan - October 6-9, 1980 and Melbourne, Australia, 1980

1979
Permutation of Data Blocks in a Bubble Memory.
Commun. ACM, 1979

1978
Rebalancing Height Balanced Trees.
IEEE Trans. Computers, 1978

On Cahit's Result on Graceful Permutations.
Inf. Process. Lett., 1978

Power Trees.
Commun. ACM, 1978

1976
On the Height of Height-Balanced Trees.
IEEE Trans. Computers, 1976

Random access in a list environment.
Inf. Syst., 1976

Storage for Consecutive Retrieval.
Inf. Process. Lett., 1976

1975
The Discrete Equation of the Straight Line.
IEEE Trans. Computers, 1975

On Finding the Maxima of a Set of Vectors.
J. ACM, 1975

1973
Some aspects of the recognition of convex polyhedra from two plane projections - II.
Inf. Sci., 1973

A technique for graph embedding with constraints on node and arc correspondences.
Inf. Sci., 1973

1972
Weighted Increment Linear Search for Scatter Tables.
Commun. ACM, 1972

1970
Some aspects of the recognition of convex polyhedra from two plane projections. I.
Inf. Sci., 1970

1969
Extending the Definition of Prime Compatibility Classes of States in Incomplete Sequential Machine Reduction.
IEEE Trans. Computers, 1969

1967
A comment on index register allocation.
Commun. ACM, 1967

1966
Reduction of the Number of Columns in Flow Table Minimization.
IEEE Trans. Electronic Computers, 1966

A Method for the Selection of Prime Implicants.
IEEE Trans. Electronic Computers, 1966

A Method for the Combined Row-Column Reduction of Flow Tables
Proceedings of the 7th Annual Symposium on Switching and Automata Theory, 1966

1965
A Method for Minimizing the Number of Internal States in Incompletely Specified Sequential Networks.
IEEE Trans. Electronic Computers, 1965


  Loading...