Fabrizio Luccio

Nicola Santoro

Proceedings of the 12th International Conference on Fun with Algorithms, 2024

2021

Cops and robber on grids and tori: basic algorithms and their extension to a large number of cops.

[BibT_eX]

[DOI]

J. Supercomput., 2021

Mobile Agents Operating on a Grid: Some Non-conventional Issues in Parallel Computing.

[BibT_eX]

[DOI]

Proceedings of the Parallel Computing Technologies, 2021

2019

Capture on Grids and Tori with Different Numbers of Cops.

[BibT_eX]

[DOI]

Proceedings of the Parallel Computing Technologies, 2019

2018

Two Combinatorial Problems on the Layout of Switching Lattices.

[BibT_eX]

[DOI]

Proceedings of the IFIP/IEEE International Conference on Very Large Scale Integration, 2018

The Connection Layout in a Lattice of Four-Terminal Switches.

[BibT_eX]

[DOI]

Proceedings of the VLSI-SoC: Design and Engineering of Electronics Systems Based on New Computing Paradigms, 2018

Computational Thinking - First Algorithms, Then Code

[BibT_eX]

[DOI]

Springer, ISBN: 978-3-319-97939-7, 2018

2017

Arithmetic for Rooted Trees.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2017

Cops and robber on grids and tori.

[BibT_eX]

[DOI]

CoRR, 2017

2016

More agents may decrease global work: A case in butterfly decontamination.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Network decontamination under m-immunity.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Complete Balancing via Rotation.

[BibT_eX]

[DOI]

Comput. J., 2016

An Arithmetic for Rooted Trees.

[BibT_eX]

[DOI]

Proceedings of the 8th International Conference on Fun with Algorithms, 2016

2015

Soulmate Algorithms.

[BibT_eX]

[DOI]

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

2013

Compact DSOP and Partial DSOP Forms.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2013

Chain rotations: A new look at tree distance.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2013

Optimal Network Decontamination with Threshold Immunity.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

2011

Mathematical and Algorithmic Foundations of the Internet.

[BibT_eX]

[DOI]

Graham Steel

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.

[BibT_eX]

[DOI]

Antonio Mesa Enriques

Inf. Process. Lett., 2010

Fun at a Department Store: Data Mining Meets Switching Theory.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms, 5th International Conference, 2010

2009

Foreword.

[BibT_eX]

[DOI]

Pierluigi Crescenzi

Theory Comput. Syst., 2009

Compressing and indexing labeled trees, with applications.

[BibT_eX]

[DOI]

J. ACM, 2009

The Fermat star of binary trees.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

A general approach to toroidal mesh decontamination with local immunity.

[BibT_eX]

[DOI]

Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

Two algorithms issues from a teacher's perspective.

[BibT_eX]

Proceedings of the Theoretical Computer Science, 11th Italian Conference, 2009

2008

Synthesis of Autosymmetric Functions in a New Three-Level Form.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2008

2007

Refined upper bounds for right-arm rotation distances.

[BibT_eX]

[DOI]

Sean Cleary

Theor. Comput. Sci., 2007

A data structure for a sequence of string accesses in external memory.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2007

k-Restricted rotation distance between binary trees.

[BibT_eX]

[DOI]

Antonio Mesa Enriques

Inf. Process. Lett., 2007

Network decontamination in Presence of Local Immunity.

[BibT_eX]

[DOI]

Nicola Santoro

Int. J. Found. Comput. Sci., 2007

Web Marshals Fighting Curly Link Farms.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms, 4th International Conference, 2007

2006

Foreword.

[BibT_eX]

[DOI]

Roberto Grossi

Theory Comput. Syst., 2006

Exploiting Regularities for Boolean Function Synthesis.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2006

Dense trees: a new look at degenerate graphs.

[BibT_eX]

[DOI]

Gianni Franceschini

J. Discrete Algorithms, 2006

Compressing and searching XML data via two zips.

[BibT_eX]

[DOI]

Proceedings of the 15th international conference on World Wide Web, 2006

Network decontamination with local immunization.

[BibT_eX]

[DOI]

Nicola Santoro

Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 2006

2005

k-Restricted Rotation with an Application to Search Tree Rebalancing.

[BibT_eX]

[DOI]

Alejandro Almeida Ruiz

Antonio Mesa Enriques

Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

Structuring labeled trees for optimal succinctness, and beyond.

[BibT_eX]

[DOI]

Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

2004

Dynamic monopolies in tori.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

2003

Three-level logic minimization based on function regularities.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2003

PaTre: A Method for Paralogy Trees Construction.

[BibT_eX]

[DOI]

J. Comput. Biol., 2003

Synthesis of integer multipliers in sum of pseudoproducts form.

[BibT_eX]

[DOI]

Valentina Ciriani

Integr., 2003

2002

Algorithms, nymphs, and shepherds.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Two New Applications of Dynamos.

[BibT_eX]

Proceedings of the SIROCCO 9, 2002

From Algorithms to Cryptography.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2002: Theoretical Informatics, 2002

Implicit Test of Regularity for Not Completely Specified Boolean Functions.

[BibT_eX]

Proceedings of the 11th IEEE/ACM International Workshop on Logic & Synthesis, 2002

Static Optimality Theorem for External Memory String Access.

[BibT_eX]

[DOI]

Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

Fast three-level logic minimization based on autosymmetry.

[BibT_eX]

[DOI]

Proceedings of the 39th Design Automation Conference, 2002

2000

Death of a monster.

[BibT_eX]

[DOI]

SIGACT News, 2000

Masked Interval Routing: A New Routing Scheme.

[BibT_eX]

[DOI]

Comput. J., 2000

Introduction: Distributed Data & Structures 3.

[BibT_eX]

Adriano Di Pasquale

Enrico Nardelli

Proceedings of the Distributed Data & Structures 3, 2000

Decomposition of k-Dense Trees.

[BibT_eX]

Proceedings of the Distributed Data & Structures 3, 2000

An algorithmic definition of interval with applications to routing.

[BibT_eX]

Proceedings of the SIROCCO 7, 2000

1999

On a New Boolean Function with Applications.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1999

String Search in Coarse-Grained Parallel Computers.

[BibT_eX]

[DOI]

Algorithmica, 1999

Dese Trees: A New Structure for Interconnection.

[BibT_eX]

Proceedings of the Distributed Data & Structures 2, 1999

Irreversible Dynamos in Butterflies.

[BibT_eX]

Hermineh Sanossian

Proceedings of the SIROCCO'99, 1999

Monotone Dynamos in Tori.

[BibT_eX]

Proceedings of the SIROCCO'99, 1999

1998

Computing with Time-Varying Data: Sequential Complexity and Parallel Speed-Up.

[BibT_eX]

[DOI]

Theory Comput. Syst., 1998

Dynamic Dictionary Matching in External Memory.

[BibT_eX]

[DOI]

Inf. Comput., 1998

Routing with the use of masks.

[BibT_eX]

Proceedings of the SIROCCO'98, 1998

Irreversible Dynamos in Tori.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par '98 Parallel Processing, 1998

1997

An Insight on PRAM Computational Bounds.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

Multi-string search in BSP.

[BibT_eX]

[DOI]

Proceedings of the Compression and Complexity of SEQUENCES 1997, 1997

Design of Reliable Combinatorial Algorithms Using Certificates.

[BibT_eX]

[DOI]

Alberto Pedrotti

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.

[BibT_eX]

[DOI]

Parallel Process. Lett., 1996

On the Parallel Dynamic Dictionary Matching Problem: New Results with Applications.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1996

1995

Approximate Matching for Two Families of Trees.

[BibT_eX]

[DOI]

Inf. Comput., 1995

1994

A Parallel List Update Problem.

[BibT_eX]

[DOI]

Alberto Pedrotti

Inf. Process. Lett., 1994

Computational bounds for the simple and the MRMW PRAM.

[BibT_eX]

[DOI]

Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing, 1994

Batch Dynamic Algorithms for Two Graph Problems.

[BibT_eX]

[DOI]

Proceedings of the PARLE '94: Parallel Architectures and Languages Europe, 1994

1993

A Model of Sequential Computation with Pipelines Access to Memory.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1993

1992

The p-shovelers problem: (computing with time-varying data).

[BibT_eX]

[DOI]

SIGACT News, 1992

Finding all the Palindromes in a Binary Tree in Linear Time and Space.

[BibT_eX]

[DOI]

Bettina De Iaco

Inf. Process. Lett., 1992

Analysis and Implementation of Parallel Uniform Hashing.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1992

Three non Conventional Paradigms of Parallel Computation.

[BibT_eX]

[DOI]

Proceedings of the Parallel Architectures and Their Efficient Use, 1992

1991

Analysis of Parallel Uniform Hashing.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1991

An Efficient Algorithm for Some Tree Matching Problems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1991

A 2d channel router for the diagonal model.

[BibT_eX]

[DOI]

Xiaoyu Song

Integr., 1991

Simple Solutions for Approximate Tree Matching Problems.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1990

Routing in Times Square Mode.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1990

Suboptimal solution for PLA multiple column folding.

[BibT_eX]

[DOI]

Maria Cristina Pinotti

Comput. Aided Des., 1990

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

[BibT_eX]

[DOI]

Algorithmica, 1990

1989

On the Upper Bound on the Rotation Distance of Binary Trees.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1989

Simple and Efficient String Matching with k Mismatches.

[BibT_eX]

[DOI]

Roberto Grossi

Inf. Process. Lett., 1989

Channel routing for strictly multiterminal nets.

[BibT_eX]

[DOI]

Integr., 1989

A Preliminary Study of a Diagonal Channel-Routing Model.

[BibT_eX]

[DOI]

Algorithmica, 1989

Discs and Other Related Data Structures.

[BibT_eX]

[DOI]

Mireille Régnier

René Schott

Proceedings of the Algorithms and Data Structures, 1989

1988

A Probabilistic Simulation of PRAMs on a Bounded Degree Network.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1988

A 4D Channel Router for a Two Layer Diagonal Model.

[BibT_eX]

[DOI]

Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

1987

A note on visibility graphs.

[BibT_eX]

[DOI]

S. Mazzone

Discret. Math., 1987

1985

Variations on a Method for Representing Data Items of Unlimited Length.

[BibT_eX]

[DOI]

IEEE Trans. Software Eng., 1985

Split Sequence Hash Search.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1985

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

[BibT_eX]

[DOI]

Integr., 1985

VLSI Trees for File Organization.

[BibT_eX]

Proceedings of the Foundations of Data Organization, 1985

1983

A VLSI Tree Machine for Relational Data Bases

[BibT_eX]

[DOI]

Maurizio A. Bonuccelli

Proceedings of the 10th Annual Symposium on Computer Architecture, 1983, 1983

VLSI Mesh of Trees for Data Base Processing.

[BibT_eX]

[DOI]

Maurizio A. Bonuccelli

Proceedings of the CAAP'83, 1983

1982

A Linear Algorithm to Determine Minimal Spanning Forests in Chain Graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1982

1980

A Tree Storage Scheme for Magnetic Bubble Memories.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1980

On the Complexity of Sorting in Magnetic Bubble Memory Systems.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1980

Maintaining Sorted Files in a Magnetic Bubble Memory.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1980

A Cryptosystem for Multiple Communication.

[BibT_eX]

[DOI]

S. Mazzone

Inf. Process. Lett., 1980

Minimum Number of Steps for Permutation in a Bubble Memory.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1980

A New Permutation Algorithm for Bubble Memories.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1980

On the Complexity of Permuting Records in Magnetic Bubble Memory Systems.

[BibT_eX]

[DOI]

Chak-Kuen Wong

IBM J. Res. Dev., 1980

Comment on Generalized AVL Trees.

[BibT_eX]

Commun. ACM, 1980

Magnetic Bubble Memory Structures for Efficient Sorting and Searching.

[BibT_eX]

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.

[BibT_eX]

[DOI]

Commun. ACM, 1979

1978

Rebalancing Height Balanced Trees.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1978

On Cahit's Result on Graceful Permutations.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1978

Power Trees.

[BibT_eX]

[DOI]

Commun. ACM, 1978

1976

On the Height of Height-Balanced Trees.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1976

Random access in a list environment.

[BibT_eX]

[DOI]

Inf. Syst., 1976

Storage for Consecutive Retrieval.

[BibT_eX]

[DOI]

Franco P. Preparata

Inf. Process. Lett., 1976

1975

The Discrete Equation of the Straight Line.

[BibT_eX]

[DOI]

Alessandro Zorat

IEEE Trans. Computers, 1975

On Finding the Maxima of a Set of Vectors.

[BibT_eX]

[DOI]

H. T. Kung

Franco P. Preparata

J. ACM, 1975

1973

Some aspects of the recognition of convex polyhedra from two plane projections - II.

[BibT_eX]

[DOI]

Pierluigi Della Vigna

Inf. Sci., 1973

A technique for graph embedding with constraints on node and arc correspondences.

[BibT_eX]

[DOI]

Giorgio Levi

Inf. Sci., 1973

1972

Weighted Increment Linear Search for Scatter Tables.

[BibT_eX]

[DOI]

Commun. ACM, 1972

1970

Some aspects of the recognition of convex polyhedra from two plane projections. I.

[BibT_eX]

[DOI]

Pierluigi Della Vigna

Inf. Sci., 1970

1969

Extending the Definition of Prime Compatibility Classes of States in Incomplete Sequential Machine Reduction.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1969

1967

A comment on index register allocation.

[BibT_eX]

[DOI]

Commun. ACM, 1967

1966

Reduction of the Number of Columns in Flow Table Minimization.

[BibT_eX]

[DOI]

IEEE Trans. Electron. Comput., 1966

A Method for the Selection of Prime Implicants.

[BibT_eX]

[DOI]

IEEE Trans. Electron. Comput., 1966

A Method for the Combined Row-Column Reduction of Flow Tables

[BibT_eX]

[DOI]

Antonio Grasselli

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.

[BibT_eX]

[DOI]

Antonio Grasselli