Linda Pagli

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

2020

Gathering in dynamic rings.

[BibT_eX]

[DOI]

Giuseppe Antonio Di Luna

Theor. Comput. Sci., 2020

FUN editorial.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Linear time distributed swap edge algorithms.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2020

2019

Compacting and Grouping Mobile Agents on Dynamic Rings.

[BibT_eX]

[DOI]

Shantanu Das

Giuseppe Antonio Di Luna

Proceedings of the Theory and Applications of Models of Computation, 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

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

Analyzing and Comparing On-Line News Sources via (Two-Layer) Incremental Clustering.

[BibT_eX]

[DOI]

Francesco Cambi

Pierluigi Crescenzi

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

2015

Getting close without touching: near-gathering for autonomous mobile robots.

[BibT_eX]

[DOI]

Giovanni Viglietta

Distributed Comput., 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

Linear Time Distributed Swap Edge Algorithms.

[BibT_eX]

[DOI]

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

2012

Distributed Minimum Spanning Tree Maintenance for Transient Node Failures.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2012

Getting Close without Touching.

[BibT_eX]

[DOI]

Giovanni Viglietta

Proceedings of the Structural Information and Communication Complexity, 2012

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]

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

The Fermat star of binary trees.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

Brief Annoucement: Distributed Swap Edges Computation for Minimum Routing Cost Spanning Trees.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 13th International Conference, 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

2008

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

[BibT_eX]

[DOI]

Theory Comput. Syst., 2008

Computing all the best swap edges distributively.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2008

2007

Refined upper bounds for right-arm rotation distances.

[BibT_eX]

[DOI]

Sean Cleary

Theor. Comput. Sci., 2007

k-Restricted rotation distance between binary trees.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2007

Network decontamination in Presence of Local Immunity.

[BibT_eX]

[DOI]

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

Knitting for Fun: A Recursive Sweater.

[BibT_eX]

[DOI]

Anna Bernasconi

Chiara Bodei

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

Distributed Computation of All Node Replacements of a Minimum Spanning Tree.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2007, 2007

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

Point-of-Failure Shortest-Path Rerouting: Computing the Optimal Swap Edges Distributively.

[BibT_eX]

[DOI]

Paola Flocchini

IEICE Trans. Inf. Syst., 2006

Network decontamination with local immunization.

[BibT_eX]

[DOI]

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

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

2004

Implicit <i>B</i>-trees: a new data structure for the dictionary problem.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2004

Fun with algorithms.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

Dynamic monopolies in tori.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

Computing All the Best Swap Edges Distributively.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 8th International Conference, 2004

Distributed Computation for Swapping a Failing Edge.

[BibT_eX]

[DOI]

Tranos Zuva

Proceedings of the Distributed Computing, 2004

Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree.

[BibT_eX]

[DOI]

Paola Flocchini

Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

2003

Text sparsification via local maxima.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Three-level logic minimization based on function regularities.

[BibT_eX]

[DOI]

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

Synthesis of integer multipliers in sum of pseudoproducts form.

[BibT_eX]

[DOI]

Valentina Ciriani

Integr., 2003

2002

FUN with Algorithms - Foreword.

[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

E-Commerce, Intermediation and Intelligent Software Agents.

[BibT_eX]

Davide Gualerzi

Proceedings of the IADIS International Conference WWW/Internet 2002, 2002

Implicit B-Trees: New Results for the Dictionary Problem.

[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

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

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

Testing and Reconfiguration of VLSI Linear Arrays.

[BibT_eX]

[DOI]

Roberto De Prisco

Angelo Monti

Theor. Comput. Sci., 1998

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

[BibT_eX]

[DOI]

Theory Comput. Syst., 1998

Routing with the use of masks.

[BibT_eX]

Proceedings of the SIROCCO'98, 1998

1997

An Insight on PRAM Computational Bounds.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

1996

On testing for catastrophic faults in reconfigurable arrays with arbitrary link redundancy.

[BibT_eX]

[DOI]

Amiya Nayak

Integr., 1996

1995

Approximate Matching for Two Families of Trees.

[BibT_eX]

[DOI]

Inf. Comput., 1995

1994

Counting the Number of Fault Patterns in Redundant VLSI Arrays.

[BibT_eX]

[DOI]

Geppino Pucci

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

1993

A Model of Sequential Computation with Pipelines Access to Memory.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1993

Efficient construction of catastrophic patterns for VLSI reconfigurable arrays.

[BibT_eX]

[DOI]

Amiya Nayak

Integr., 1993

1992

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

[BibT_eX]

[DOI]

SIGACT News, 1992

Three non Conventional Paradigms of Parallel Computation.

[BibT_eX]

[DOI]

Geppino Pucci

Proceedings of the Parallel Architectures and Their Efficient Use, 1992

Efficient Construction of Catastrophic Patterns for VLSI Reconfigurable Arrays with Bidirectional Links.

[BibT_eX]

Amiya Nayak

Proceedings of the Computing and Information, 1992

1991

An Efficient Algorithm for Some Tree Matching Problems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 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

1989

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

[BibT_eX]

[DOI]

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

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

1986

A VLSI Solution to the Vertical Segment Visibility Problem.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1986

Some New Results on a Restricted Channel Routing Problem.

[BibT_eX]

[DOI]

Proceedings of the VLSI Algorithms and Architectures, 1986

1985

Self-Adjusting Hash Tables.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1985

1984

External Sorting in VLSI.

[BibT_eX]

[DOI]

Maurizio A. Bonuccelli

IEEE Trans. Computers, 1984

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 note on optimal allocation of files in a symmetric and homogeneous network.

[BibT_eX]

[DOI]

Michele Missikoff

Inf. Syst., 1980

Comment on Generalized AVL Trees.

[BibT_eX]

Commun. ACM, 1980

1979

Height-balanced multiway trees.

[BibT_eX]

[DOI]

Inf. Syst., 1979

1978

Rebalancing Height Balanced Trees.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1978

Power Trees.

[BibT_eX]

[DOI]

Commun. ACM, 1978

1976

On the Height of Height-Balanced Trees.

[BibT_eX]

[DOI]