Synchronized Distributed Termination
IEEE Transactions on Software Engineering
Topological graph theory
Networks and distributed computation: concepts, tools, and algorithms
Networks and distributed computation: concepts, tools, and algorithms
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases
IEEE Transactions on Parallel and Distributed Systems
Information Processing Letters
Computing anonymously with arbitrary knowledge
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
A taxonomy of distributed termination detection algorithms
Journal of Systems and Software
Leader Election Problem on Networks in which Processor Identity Numbers Are Not Distinct
IEEE Transactions on Parallel and Distributed Systems
Symmetry and similarity in distributed systems
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Discrete Mathematics
Introduction to Distributed Algorithms
Introduction to Distributed Algorithms
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Distributed Computing: Fundamentals, Simulations and Advanced Topics
Distributed Computing: Fundamentals, Simulations and Advanced Topics
Strong stable properties in distributed systems
Distributed Computing
Design and Analysis of Distributed Algorithms (Wiley Series on Parallel and Distributed Computing)
Design and Analysis of Distributed Algorithms (Wiley Series on Parallel and Distributed Computing)
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
What can be implemented anonymously?
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Efficient distributed snapshots in an anonymous asynchronous message-passing system
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
Most known snapshot algorithms assume that the vertices of the network have unique identifiers and/or that there is exactly one initiator. This paper concerns snapshot computation in an anonymous network and more generally what stable properties of a distributed system can be computed anonymously with local snapshots with multiple initiators when knowing an upper bound on the diameter of the network.