Elena Lodi

Math. Struct. Comput. Sci., 2017

2015

An inclusion hierarchy of irreversible dynamos.

[BibT_eX]

[DOI]

Sara Brunetti

Theor. Comput. Sci., 2015

2012

Minimum Weight Dynamo and Fast Opinion Spreading

[BibT_eX]

[DOI]

CoRR, 2012

Minimum Weight Dynamo and Fast Opinion Spreading - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

2011

Opinions within Media, Power and Gossip

[BibT_eX]

[DOI]

Rosaria Conte

CoRR, 2011

Simulating Opinion Dynamics in Heterogeneous Communication

[BibT_eX]

[DOI]

Rosaria Conte

CoRR, 2011

Opinions Manipulation: Media, Power and Gossip.

[BibT_eX]

[DOI]

Rosaria Conte

Adv. Complex Syst., 2011

Dynamic Monopolies in Colored Tori.

[BibT_eX]

[DOI]

Sara Brunetti

Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

2010

Dealing with Interaction for Complex Systems Modelling and Prediction.

[BibT_eX]

[DOI]

Daniela Latorre

Mirco Nanni

Int. J. Artif. Life Res., 2010

Multicolored Dynamos on Toroidal Meshes

[BibT_eX]

[DOI]

Sara Brunetti

CoRR, 2010

2008

Foreword.

[BibT_eX]

[DOI]

Mario Coppo

G. Michele Pinna

Theory Comput. Syst., 2008

PARPST: a PARallel algorithm to find peptide sequence tags.

[BibT_eX]

[DOI]

BMC Bioinform., 2008

2007

A parallel algorithm for de novo peptide sequencing.

[BibT_eX]

[DOI]

BMC Syst. Biol., 2007

2004

Fun with algorithms.

[BibT_eX]

[DOI]

Nicola Santoro

Discret. Appl. Math., 2004

Dynamic monopolies in tori.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

2003

Text sparsification via local maxima.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

2002

FUN with Algorithms - Foreword.

[BibT_eX]

[DOI]

Nicola Santoro

Theor. Comput. Sci., 2002

E-Commerce, Intermediation and Intelligent Software Agents.

[BibT_eX]

Davide Gualerzi

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

1999

Monotone Dynamos in Tori.

[BibT_eX]

Proceedings of the SIROCCO'99, 1999

1998

Simple Planar Graph Partition into Three Forests.

[BibT_eX]

[DOI]

Roberto Grossi

Discret. Appl. Math., 1998

Irreversible Dynamos in Tori.

[BibT_eX]

[DOI]

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

1995

Optimal approximation of monotone curves on a grid.

[BibT_eX]

[DOI]

Proceedings of the 7th Canadian Conference on Computational Geometry, 1995

1994

Parallel String Matching with Variable Length Don't Cares.

[BibT_eX]

[DOI]

Alan A. Bertossi

J. Parallel Distributed Comput., 1994

1992

A Parallel Solution to the Approximate String Matching Problem (Short Note).

[BibT_eX]

[DOI]

Comput. J., 1992

1991

A 2d channel router for the diagonal model.

[BibT_eX]

[DOI]

Xiaoyu Song

Integr., 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

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

A Heuristic for Channel Routing.

[BibT_eX]

[DOI]

Franco P. Preparata

Proceedings of the Foundations of Data Organization and Algorithms, 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

Split Sequence Hash Search.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1985

1984

External Sorting in VLSI.

[BibT_eX]

[DOI]

Maurizio A. Bonuccelli