Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

SELF-STABILIZING DISTRIBUTED SORTING IN TREE NETWORKS

From MaRDI portal
Publication:2735236
Jump to:navigation, search

DOI10.1080/01495730108935263zbMath0976.68044OpenAlexW2037274096MaRDI QIDQ2735236

Sébastien Tixeuil, Ajoy K. Datta

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

tree networksself-stabilizing distributed sorting algorithm


Mathematics Subject Classification ID

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




Cites Work

  • A self-stabilizing algorithm for constructing spanning trees
  • Distributed Sorting
  • Optimal Distributed Algorithms for Sorting and Ranking
  • The complexity of sorting on distributed systems
  • Self-stabilizing systems in spite of distributed control
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2735236&oldid=15597156"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 15:06.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki