SELF-STABILIZING DISTRIBUTED SORTING IN TREE NETWORKS

DOI10.1080/01495730108935263MaRDI QIDQ2735236zbMATH OpenOpenAlexFDO

Authors Ajoy K. Datta, Sébastien Tixeuil

Publication date 30 August 2001

Published in Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/01495730108935263

zbMATH Keywords

self-stabilizing distributed sorting algorithmtree networks

Mathematics Subject Classification ID

Distributed systems (68M14) Searching and sorting (68P10)

Recommendations

• Distributed Tree Rearrangements for Reachability and Robust Connectivity
• Distributed Tree Rearrangements for Reachability and Robust Connectivity
• scientific article; zbMATH DE number 1760042
• A self-stabilizing distributed algorithm to construct an arbitrary spanning tree of a connected graph
• SELF-STABILIZING DEPTH-FIRST MULTI-TOKEN CIRCULATION IN TREE NETWORKS
• A sorting network on trees
• A self-stabilizing distributed algorithm to find the median of a tree graph
• Self-stabilizing algorithms for efficient sets of graphs and trees

Cites work

• A self-stabilizing algorithm for constructing spanning trees
• Distributed Sorting
• Optimal Distributed Algorithms for Sorting and Ranking
• Self-stabilizing systems in spite of distributed control
• The complexity of sorting on distributed systems

Cited in

(6)

• A self-stabilizing distributed algorithm to find the median of a tree graph
• Time complexity of distributed topological self-stabilization: the case of graph linearization
• scientific article; zbMATH DE number 2061546 (Why is no real title available?)
• Distributed Tree Rearrangements for Reachability and Robust Connectivity
• scientific article; zbMATH DE number 7561459 (Why is no real title available?)
• Linearization: locally self-stabilizing sorting in graphs

This page was built for publication: SELF-STABILIZING DISTRIBUTED SORTING IN TREE NETWORKS

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