scientific article
From MaRDI portal
Publication:3504346
zbMath1137.68326MaRDI QIDQ3504346
Jérémie Chalopin, Yves Métivier
Publication date: 11 June 2008
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (10)
Election in partially anonymous networks with arbitrary knowledge in message passing systems ⋮ An optimal bit complexity randomized distributed MIS algorithm ⋮ Election and rendezvous with incomparable labels ⋮ On the power of synchronization between two adjacent processes ⋮ Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds ⋮ Snap-stabilizing tasks in anonymous networks ⋮ Graph labelings derived from models in distributed computing: A complete complexity classification ⋮ Setting Ports in an Anonymous Network: How to Reduce the Level of Symmetry? ⋮ Distinguishing views in symmetric networks: a tight lower bound ⋮ On labeled birooted tree languages: algebras, automata and logic
This page was built for publication:
