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

A self-stabilizing algorithm for strong fairness

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

DOI10.1007/BF02684333zbMath0897.68053OpenAlexW2013723883MaRDI QIDQ1387705

Mehmet Hakan Karaata, Pranay Chaudhuri

Publication date: 5 October 1998

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02684333


zbMATH Keywords

distributed systemsself-stabilization


Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed algorithms (68W15)


Related Items (2)

A self-stabilizing algorithm for strong fairness ⋮ A self-stabilizing algorithm for detecting fundamental cycles in a graph




Cites Work

  • Unnamed Item
  • Appraising fairness in languages for distributed programming
  • A self-stabilizing algorithm for constructing spanning trees
  • Self-stabilizing depth-first token circulation on networks
  • Self-stabilizing depth-first search
  • A self-stabilizing algorithm for strong fairness
  • An iterative and starvation-free solution for a general class of distributed control problems based on interaction primitives
  • Self-stabilizing systems in spite of distributed control
  • The mutual exclusion problem




This page was built for publication: A self-stabilizing algorithm for strong fairness

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1387705&oldid=13542503"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 15:56.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki