scientific article; zbMATH DE number 2088672

MaRDI QIDQ3045272zbMATH OpenFDO

Authors Sibylle Peuker

Publication date 12 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2360/23600374.htm

Mathematics Subject Classification ID

Distributed algorithms (68W15) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• The verified incremental design of a distributed spanning tree algorithm: Extended abstract
• A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees
• A New Proof of the GHS Minimum Spanning Tree Algorithm
• From sequential layers to distributed processes
• Improving the Time Complexity of Message-Optimal Distributed Algorithms for Minimum-Weight Spanning Trees

Cited in

(3)

• Concurrency based transition refinement for the verification of distributed algorithms
• A New Proof of the GHS Minimum Spanning Tree Algorithm
• From sequential layers to distributed processes

This page was built for publication:

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