An improved algorithm for decentralized extrema-finding in circular configurations of processes
From MaRDI portal
Lua error in Module:PublicationMSCList at line 28: attempt to call field 'getDbData' (a nil value).
Lua error in Module:PublicationShowAbstract at line 21: attempt to call field 'getDbData' (a nil value).
Cited in
(35)- Electing a leader in a ring with link failures
- Distributed algorithm for extrema-finding in circular configuration of processors
- A better lower bound for distributed leader finding in bidirectional asynchronous rings of processors
- Communication and time complexity of a distributed election protocol
- Pardinus: a temporal relational model finder
- Drags: a compositional algebraic framework for graph rewriting
- Some lower bound results for decentralized extrema-finding in rings of processors
- Leader election in well-connected graphs
- On the expressive power of polyadic synchronisation in -calculus
- An abstraction technique for parameterized model checking of leader election protocols: application to FTSP
- Bounded quantifier instantiation for checking inductive invariants
- Distributed election in a circle without a global sense of orientation
- On the message complexity of distributed problems
- Assertion-Based Proof Checking of Chang-Roberts Leader Election in PVS
- An improved election algorithm in chordal ring networks
- Randomized self-stabilizing leader election in preference-based anonymous trees
- Design and analysis of dynamic leader election protocols in broadcast networks
- Snap-stabilizing tasks in anonymous networks
- Why3-do: the way of harmonious distributed system proofs
- Model checking LTL using constraint programming
- Error diagnosis in finite communicating systems
- Sense of direction in processor networks
- A knowledge-based analysis of global function computation
- A simple, efficient algorithm for maximum finding on rings
- Anonymous wireless rings
- Brief announcement: Content-oblivious leader election on rings
- Content-oblivious leader election on rings
- On the complexity of computation in the presence of link failures: The case of a ring
- New lower bound techniques for distributed leader finding and other problems on rings of processors
- Sound verification procedures for temporal properties of infinite-state systems
- Cost distribution of the Chang-Roberts leader election algorithm and related problems
- Asynchronous distributed termination-parallel and symmetric solutions with echo algorithms
- The communication complexity for decentralized evaluation of functions
- Bit-optimal election in synchronous rings
- Symmetry breaking in distributed networks
This page was built for publication: An improved algorithm for decentralized extrema-finding in circular configurations of processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4176960)
