From sequential layers to distributed processes

DOI10.1145/135419.135461MaRDI QIDQ5348853zbMATH OpenOpenAlexFDO

Authors Wil Janssen, Job Zwiers

Publication date 21 August 2017

Published in Proceedings of the eleventh annual ACM symposium on Principles of distributed computing - PODC '92 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/135419.135461

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 2088672
• A distributed approximation algorithm for the minimum degree minimum weight spanning trees
• A distributed algorithm for directed minimum-weight spanning tree
• A distributed algorithm for directed minimum-weight spanning tree
• A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees
• A near-tight lower bound on the time complexity of distributed minimum-weight spanning tree construction
• A distributed algorithm for constructing a minimum diameter spanning tree

Cited in

(5)

• Layered reasoning for randomized distributed algorithms
• Compositional transformational design for concurrent programs
• scientific article; zbMATH DE number 2088672 (Why is no real title available?)
• Causing communication closure: safe program composition with reliable non-FIFO channels
• A principle for sequential reasoning about distributed algorithms

This page was built for publication: From sequential layers to distributed processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5348853)