Nicola Santoro

Proceedings of the Structural Information and Communication Complexity, 2005

Distributed Exploration of an Unknown Graph.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2005

Mobile Agents Computing: Security Issues and Algorithmic Solutions.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 9th Italian Conference, 2005

2004

Sorting and election in anonymous asynchronous rings.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2004

Fun with algorithms.

[BibT_eX]

[DOI]

Elena Lodi

Discret. Appl. Math., 2004

Dynamic monopolies in tori.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

Mobile Agents Rendezvous When Tokens Fail.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2004

Improved Bounds for Optimal Black Hole Search with a Network Map.

[BibT_eX]

[DOI]

Stefan Dobrev

Abdul-Rahman Mawlood-Yunis

Proceedings of the Structural Information and Communication Complexity, 2004

Computing All the Best Swap Edges Distributively.

[BibT_eX]

[DOI]

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

On the Performance of Distributed Search by Mobile Agents.

[BibT_eX]

[DOI]

Doron Nussbaum

Proceedings of the Mobility Aware Technologies and Applications, 2004

Multiple Mobile Agent Rendezvous in a Ring.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2004: Theoretical Informatics, 2004

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

[BibT_eX]

[DOI]

Antonio Mesa Enriques

Giuseppe Prencipe

Abdul-Rahman Mawlood-Yunis

Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

Comparing Performance of Two Mobile Agent Platforms in Distributed Search.

[BibT_eX]

[DOI]

Doron Nussbaum

Proceedings of the 2004 IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT 2004), 2004

2003

Computing on anonymous networks with sense of direction.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Sense of direction in distributed computing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Backward Consistency and Sense of Direction in Advanced Distributed Systems.

[BibT_eX]

[DOI]

SIAM J. Comput., 2003

On time versus size for monotone dynamic monopolies in regular topologies.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2003

Tight Bounds for Synchronous Communication of Information Using Bits, Silence.

[BibT_eX]

[DOI]

Una-May O'Reilly

Discret. Appl. Math., 2003

Searching Is Not Jumping.

[BibT_eX]

[DOI]

Lali Barrière

Pierre Fraigniaud

Dimitrios M. Thilikos

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

Can we elect if we cannot compare?

[BibT_eX]

[DOI]

Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

Election and Rendezvous in Fully Anonymous Systems with Sense of Direction.

[BibT_eX]

Proceedings of the SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, 2003

Multiple Agents RendezVous in a Ring in Spite of a Black Hole.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 7th International Conference, 2003

Mobile Agent Rendezvous in a Ring.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Distributed Computing Systems (ICDCS 2003), 2003

Solving the Robots Gathering Problem.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002

FUN with Algorithms - Foreword.

[BibT_eX]

[DOI]

Elena Lodi

Theor. Comput. Sci., 2002

Capture of an intruder by mobile agents.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2002

Searching for a black hole in arbitrary networks: optimal mobile agent protocols.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

Black Hole Search by Mobile Agents in Hypercubes and Related Networks.

[BibT_eX]

Proceedings of the Procedings of the 6th International Conference on Principles of Distributed Systems. OPODIS 2002, 2002

2001

Distributed computing on oriented anonymous hypercubes with faulty components.

[BibT_eX]

[DOI]

Evangelos Kranakis

Distributed Comput., 2001

Optimal irreversible dynamos in chordal rings.

[BibT_eX]

[DOI]

Frédéric Geurts

Discret. Appl. Math., 2001

Gathering of Asynchronous Oblivious Robots with Limited Visibility.

[BibT_eX]

[DOI]

Proceedings of the STACS 2001, 2001

Distributed Computations by Autonomous Mobile Robots.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2001: Theory and Practice of Informatics, 28th Conference on Current Trends in Theory and Practice of Informatics Piestany, Slovak Republic, November 24, 2001

On Finding Minimum Deadly Sets for Directed Networks.

[BibT_eX]

Norbert Zeh

Proceedings of the SIROCCO 8, 2001

Pattern Formation by Anonymous Robots Without Chirality.

[BibT_eX]

Proceedings of the SIROCCO 8, 2001

A Mobile Agent Prototype for Distributed Search.

[BibT_eX]

[DOI]

Elio Velazquez

Proceedings of the Mobile Agents for Telecommunication Applications, 2001

2000

An improved testing scheme for catastrophic fault patterns.

[BibT_eX]

[DOI]

Jiajun Ren

Inf. Process. Lett., 2000

Asynchronous to Synchronous transformations.

[BibT_eX]

Una-May O'Reilly

Proceedings of the Procedings of the 4th International Conference on Principles of Distributed Systems, 2000

Sorting Multisets in Anonymous Rings.

[BibT_eX]

[DOI]

Proceedings of the 14th International Parallel & Distributed Processing Symposium (IPDPS'00), 2000

1999

Informatica, Scoula, Communità: Uno Sguardo dall' Occhio del Ciclone.

[BibT_eX]

[DOI]

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

Introduction: Distributed Data & Structures 2.

[BibT_eX]

Proceedings of the Distributed Data & Structures 2, 1999

Monotone Dynamos in Tori.

[BibT_eX]

Proceedings of the SIROCCO'99, 1999

Biconsistency and Homonymy in Distributed Systems with Edge Symmetry.

[BibT_eX]

Proceedings of the Procedings of the 3rd International Conference on Principles of Distributed Systems. OPODIS 99, 1999

Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

1998

Optimal Elections in Faulty Loop Networks and Applications.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1998

Sense of direction: Definitions, properties, and classes.

[BibT_eX]

[DOI]

Alberto Marchetti-Spaccamela

Networks, 1998

Efficient Token-Based Control in Rings.

[BibT_eX]

[DOI]

Esteban Feuerstein

Stefano Leonardi

Inf. Process. Lett., 1998

Topological Constraints for Sense of Direction.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1998

Symmetries and Sense of Direction in Labeled Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1998

Introduction: Distributed Data and Structures 1.

[BibT_eX]

Proceedings of the Distributed Data & Structures, 1998

Irreversible Dynamos in Tori.

[BibT_eX]

[DOI]

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

1997

Efficient Distributed Selection with Bounded Messages.

[BibT_eX]

[DOI]

Alberto Negro

IEEE Trans. Parallel Distributed Syst., 1997

CA-Like Error Propagation in Fuzzy CA.

[BibT_eX]

[DOI]

Frédéric Geurts

Parallel Comput., 1997

Time-Message Trade-Offs for the Weak Unison Problem.

[BibT_eX]

Nord. J. Comput., 1997

On the Impact of Sense of Direction on Message Complexity.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

Improved Bounds for Electing a Leader in a Synchronous Ring.

[BibT_eX]

[DOI]

Mark H. Overmars

Algorithmica, 1997

Levels of Sense of Direction in Distributed Systems.

[BibT_eX]

Proceedings of the On Principles Of Distributed Systems, 1997

Efficient Parallel Graph Algorithms For Coarse Grained Multicomputers and BSP.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1996

Finding the Extrema of a Distributed Multiset.

[BibT_eX]

[DOI]

Paola Alimonti

J. Parallel Distributed Comput., 1996

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

[BibT_eX]

[DOI]

Alberto Marchetti-Spaccamela

Integr., 1996

Efficient Token-Based Control in Rings (Abstract).

[BibT_eX]

[DOI]

Esteban Feuerstein

Stefano Leonardi

Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

Ring reconfiguration in presence of close fault cuts.

[BibT_eX]

[DOI]

Quanhu Xue

Proceedings of the 1996 International Symposium on Parallel Architectures, 1996

1995

On Reliability Analysis of Chordal Rings.

[BibT_eX]

[DOI]

J. Circuits Syst. Comput., 1995

Translation Capabilities of Sense of Direction.

[BibT_eX]

Proceedings of the Structure, Information and Communication Complexity, 1995

On the Complexity of Testing for Catastrophic Faults.

[BibT_eX]

[DOI]

Jiajun Ren

Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

Efficient reconfiguration technique for redundant ring networks.

[BibT_eX]

[DOI]

Quanhu Xue

Proceedings of the 28th Annual Hawaii International Conference on System Sciences (HICSS-28), 1995

1994

Trade-Offs in Non-Reversing Diameter.

[BibT_eX]

Hans L. Bodlaender

Gerard Tel

Nord. J. Comput., 1994

Guarding rectangular art galleries.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1994

Sense of Direction: Formal Definitions and Properties.

[BibT_eX]

Proceedings of the Structural Information and Communication Complexity, 1994

Preface.

[BibT_eX]

Proceedings of the Structural Information and Communication Complexity, 1994

On the Impact of Sense of Direction in Arbitrary Networks.

[BibT_eX]

[DOI]

Proceedings of the 14th International Conference on Distributed Computing Systems, 1994

Optimal Fault-Tolerant Leader Election in Chordal Rings.

[BibT_eX]

[DOI]

Proceedings of the Digest of Papers: FTCS/24, 1994

1993

Efficient construction of catastrophic patterns for VLSI reconfigurable arrays.

[BibT_eX]

[DOI]

Integr., 1993

1992

A Distributed Selection Algorithm and its Expected Communication Complexity.

[BibT_eX]

[DOI]

Stuart J. Sidney

Theor. Comput. Sci., 1992

The Expressiveness of Silence: Tight Bounds for Synchronous Communication of Information Using Bits and Silence.

[BibT_eX]

[DOI]

Una-May O'Reilly

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

Distributed Computing on Anonymous Hypercubes with Faulty Components (Extended Abstract).

[BibT_eX]

[DOI]

Evangelos Kranakis

Proceedings of the Distributed Algorithms, 6th International Workshop, 1992

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

[BibT_eX]

Proceedings of the Computing and Information, 1992

1991

Computational Geometry Algorithms for the Systolic Screen.

[BibT_eX]

[DOI]

Frank K. H. A. Dehne

Anne-Lise Hassenklover

Jörg-Rüdiger Sack

Algorithmica, 1991

Tight Bounds for the Rectangualr Art Gallery Problem.

[BibT_eX]

[DOI]

Proceedings of the 17th International Workshop, 1991

Bounds on Performance of VLSI Processor Arrays.

[BibT_eX]

[DOI]

Proceedings of the Fifth International Parallel Processing Symposium, Proceedings, Anaheim, California, USA, April 30, 1991

1990

Sums of lexicographically ordered sets.

[BibT_eX]

[DOI]

M. D. Atkinson

Alberto Negro

Discret. Math., 1990

Distributed Function Evaluation in the Presence of Transmission Faults.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1990

Fault-intolerance of reconfigurable systolic arrays.

[BibT_eX]

[DOI]

Richard Tan

Proceedings of the 20th International Symposium on Fault-Tolerant Computing, 1990

1989

Reduction Techniques for Selection in Distributed Files.

[BibT_eX]

[DOI]

Ed Suen

IEEE Trans. Computers, 1989

Geometric Containment and Partial Orders.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1989

Efficient Elections in Chordal Ring Networks.

[BibT_eX]

[DOI]

Algorithmica, 1989

Time is Not a Healer.

[BibT_eX]

[DOI]

Proceedings of the STACS 89, 1989

TIME vs BITS.

[BibT_eX]

[DOI]

Mark H. Overmars

Proceedings of the STACS 89, 1989

1988

On the Expected Complexity of Distributed Selection.

[BibT_eX]

[DOI]

Michael Scheutzow

J. Parallel Distributed Comput., 1988

A Practical Algorithm for Boolean Matrix Multiplication.

[BibT_eX]

[DOI]

M. D. Atkinson

Inf. Process. Lett., 1988

(Time × Space)-Efficient Implementations of Hierarchical Conceptual Models.

[BibT_eX]

[DOI]

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

Geometric Containment, Common Roots of Polynomials and Partial Orders.

[BibT_eX]

[DOI]

Stuart J. Sidney

Proceedings of the STACS 88, 1988

1987

Geometric Containment and Vector Dominance.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1987

Optimal Parallel Merging and Sorting Without Memory Conflicts.

[BibT_eX]

[DOI]

Selim G. Akl

IEEE Trans. Computers, 1987

Analysis of a Distributed Algorithm for Extrema Finding in a Ring.

[BibT_eX]

[DOI]

Ephraim Korach

J. Parallel Distributed Comput., 1987

On the Packet Complexity of Distributed Selection.

[BibT_eX]

[DOI]

Alberto Negro

Proceedings of the Distributed Algorithms, 1987

On the Expected Complexity of Distributed Selection.

[BibT_eX]

[DOI]

Stuart J. Sidney

Proceedings of the STACS 87, 1987

Computing on a Systolic Screen: Hulls, Contours and Applications.

[BibT_eX]

[DOI]

Frank K. H. A. Dehne

Jörg-Rüdiger Sack

Proceedings of the PARLE, 1987

Optimal VLSI Dictionary Machines on Meshes.

[BibT_eX]

Frank K. H. A. Dehne

Proceedings of the International Conference on Parallel Processing, 1987

Improving Semi-Join Evaluation in Distributed Query Processing.

[BibT_eX]

Ekow J. Otoo

Proceedings of the 7th International Conference on Distributed Computing Systems, 1987

Guessing Games and Distributed Computations in Synchronous Networks.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

1986

Integer Sets with Distinct Sums and Differences and Carrier Frequency Assignments for Nonlinear Repeaters.

[BibT_eX]

[DOI]

Michael D. Atkinson

IEEE Trans. Commun., 1986

On the integer complexity of Boolean matrix multiplication.

[BibT_eX]

[DOI]

Mike D. Atkinson

SIGACT News, 1986

Shout echo selection in distributed files.

[BibT_eX]

[DOI]

Networks, 1986

Uniquely colourable m-dichromatic oriented graphs.

[BibT_eX]

[DOI]

Victor Neumann-Lara

Discret. Math., 1986

An improved algorithm for Boolean matrix multiplication.

[BibT_eX]

[DOI]

Computing, 1986

Min-Max Heaps and Generalized Priority Queues.

[BibT_eX]

[DOI]

Commun. ACM, 1986

Breaking Symmetry in Synchronous Networks.

[BibT_eX]

[DOI]

Greg N. Frederickson

Proceedings of the VLSI Algorithms and Architectures, 1986

1985

Distributed Sorting.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1985

The un-merging problem.

[BibT_eX]

[DOI]

SIGACT News, 1985

Interpolation-Binary Search.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1985

Labelling and Implicit Routing in Networks.

[BibT_eX]

[DOI]

Ramez Khatib

Comput. J., 1985

Geometric Containment is not Reducible to Pareto Dominance.

[BibT_eX]

[DOI]

Proceedings of the STACS 85, 1985

1984

Distributed Algorithms for Finding Centers and Medians in Networks.

[BibT_eX]

[DOI]

Ephraim Korach

ACM Trans. Program. Lang. Syst., 1984

Sense of direction, topological awareness and communication complexity.

[BibT_eX]

[DOI]

SIGACT News, 1984

On the message complexity of distributed problems.

[BibT_eX]

[DOI]

Int. J. Parallel Program., 1984

Chain Multiplication of Matrices of Approximately or Exactly the Same Size.

[BibT_eX]

[DOI]

Commun. ACM, 1984

1980

Extending the Four Russians' Bound to General Matrix Multiplication.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1980

1979

Distributed Control of Updates in Multiple-Copy Databases: A Time Optimal Algorithm.

[BibT_eX]

Raúl J. Ramírez

Proceedings of the Fourth Berkeley Workshop on Distributed Data Management and Computer Networks, 1979

1976

Random access in a list environment.

[BibT_eX]

[DOI]

Inf. Syst., 1976

Full Table Search by Polynomial Functions.

[BibT_eX]

[DOI]