Self-stabilizing Neighborhood Unique Naming under Unfair Scheduler

No abstract is available for this paper.

• Publication year

  2001

• Venue

  European Conference on Parallel Processing

• Publication date

  2001-08-28

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/3-540-44681-8_67
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study

  1997cited by this paper
• Modeling and verification of randomized distributed real-time systems

  1996cited by this paper
• Observations on self-stabilizing graph algorithms for anonymous networks

  1995cited by this paper
• Developing self - stabilizing coloring algorithms via systematic randomization

  1994cited by this paper
• Composition and Behaviors of Probabilistic I/O Automata

  1994cited by this paper
• Probabilistic Simulations for Probabilistic Processes

  1994cited by this paper
• A self-stabilizing algorithm for coloring bipartite graphs

  1993cited by this paper
• A Self-Stabilizing Algorithm for Maximal Matching

  1992influential reference
• Labelling Graphs with a Condition at Distance 2

  1992cited by this paper
• An O(v|v| c |E|) algoithm for finding maximum matching in general graphs

  1980cited by this paper
• Self-stabilizing systems in spite of distributed control

  1974cited by this paper

• Self-Stabilizing Fully Adaptive Maximal Matching

  2024cites this paper
• A self-stabilizing algorithm for b-matching

  2019cites this paper
• Evaluating Fault Tolerance Properties of Self-Stabilizing Matching Algorithms in Wireless Sensor Networks

  2018influential citation
• Compact Self-Stabilizing Leader Election for General Networks

  2018cites this paper
• Algorithme Auto-Stabilisant Compact d'Election pour les Graphes Arbitraires

  2017cites this paper
• Compact Self-Stabilizing Leader Election for Arbitrary Networks

  2017cites this paper
• Brief Announcement: Compact Self-Stabilizing Leader Election in Arbitrary Graphs

  2017cites this paper
• Self-Stabilizing Maximal Matching and Anonymous Networks

  2016cites this paper
• A Self-Stabilizing Algorithm for Maximal Matching in Anonymous Networks

  2016cites this paper
• On the Limits and Practice of Automatically Designing Self-Stabilization

  2016cites this paper
• Daemon Conversions in Distributed Self-stabilizing Algorithms

  2013cites this paper
• A Framework for Robust Address Assignment in WSNs Whispering to Avoid Intruders

  2013cites this paper
• Studying Network Optimization in the Context of Self-Stabilization

  2012cites this paper
• Improved Self-Stabilizing Algorithms for L(2, 1)-Labeling Tree Networks

  2011cites this paper
• A self-stabilizing 2/3-approximation algorithm for the maximum matching problem

  2011cites this paper
• WSN Self-Address Collision Detection and Solving

  2009cites this paper
• An efficient self-stabilizing distance-2 coloring algorithm

  2009influential citation
• Nonlinear optimization for adaptive antenna array receivers with a small data-record size

  2009cites this paper
• A Self-stabilizing -Approximation Algorithm for the Maximum Matching Problem

  2008cites this paper
• Anonymous Daemon Conversion in Self-stabilizing Algorithms by Randomization in Constant Space

  2008cites this paper
• A new self-stabilizing maximal matching algorithm

  2007cites this paper
• Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings

  2007cites this paper
• Conflict Managers for Self-stabilization without Fairness Assumption

  2007cites this paper
• Robust sensor self-initialization: Whispering to avoid intruders

  2007cites this paper
• A Self-stabilizing Weighted Matching Algorithm

  2007cites this paper
• Stabilizing Link-Coloration of Arbitrary Networks with Unbounded Byzantine Faults

  2007cites this paper
• Distributed systems of simple interacting agents

  2007cites this paper
• Distance-k Information in Self-stabilizing Algorithms

  2006cites this paper
• A Self-stabilizing Link-Coloring Protocol Resilient to Unbounded Byzantine Faults in Arbitrary Networks

  2005cites this paper
• Self-stabilizing population protocols

  2005cites this paper
• On Fast Randomized Colorings in Sensor Networks

  2005cites this paper
• On Fast Randomized Colorings in Sensor Networks 1

  2005cites this paper
• A Distributed TDMA Slot Assignment Algorithm for Wireless Sensor Networks

  2004influential citation
• Distance-two information in self-stabilizing algorithms

  2004cites this paper
• Brief announcement: self-stabilizing distance-d distinct labels via enriched fair composition

  2004cites this paper
• Un Algorithme TDMA R'eparti pour les r'eseaux de capteurs

  2004influential citation
• Dynamic and self-stabilizing distributed matching

  2002cites this paper