Network synchronization with polylogarithmic overhead

This publication has 16 references indexed in Scilit:

• A single source shortest path algorithm for a planar distributed network
  Published by Springer Nature ,2005
• Sparse partitions
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• The use of a synchronizer yields maximum computation rate in distributed networks
  Published by Association for Computing Machinery (ACM) ,1990
• A modular proof of correctness for a network synchronizer
  Published by Springer Nature ,1988
• A new distributed algorithm to find breadth first search trees
  IEEE Transactions on Information Theory, 1987
• Complexity of network synchronization
  Journal of the ACM, 1985
• Distributed BFS algorithms
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1985
• Distributed snapshots
  ACM Transactions on Computer Systems, 1985
• A Distributed Algorithm for Minimum-Weight Spanning Trees
  ACM Transactions on Programming Languages and Systems, 1983
• Distributed Minimum Hop Algorithms
  Published by Defense Technical Information Center (DTIC) ,1982