Terminating iterative solution of simultaneous equations in distributed message passing systems

Authors:
B. Szymanski;Y. Shi;N. Prywes
Affiliations:
Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA;Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA;Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA
Venue:
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Year:
1985

Distributed Termination

ACM Transactions on Programming Languages and Systems (TOPLAS)

A Characterization of Families of Graphs in Which Election Is Possible

FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Termination Detection of Distributed Algorithms by Graph Relabelling Systems

ICGT '02 Proceedings of the First International Conference on Graph Transformation
Local Computations in Graphs: The Case of Cellular Edge Local Computations

Fundamenta Informaticae - SPECIAL ISSUE ON ICGT 2004
An Efficient Message Passing Election Algorithm based on Mazurkiewicz's Algorithm

Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Proving distributed algorithms for mobile agents: examples of spanning tree computation in anonymous networks

ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
An Efficient Message Passing Election Algorithm based on Mazurkiewicz's Algorithm

Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Local Computations in Graphs: The Case of Cellular Edge Local Computations

Fundamenta Informaticae - SPECIAL ISSUE ON ICGT 2004
Enumeration and Leader Election in Partially Anonymous and Multi-hop Broadcast Networks

Fundamenta Informaticae

Hi-index	0.00