Pages that link to "Item:Q3956422"
From MaRDI portal
The following pages link to An O(n log n) unidirectional distributed algorithm for extrema finding in a circle (Q3956422):
Displayed 38 items.
- A simple, efficient algorithm for maximum finding on rings (Q671266) (← links)
- Anonymous wireless rings (Q673090) (← links)
- Two lower bounds in asynchronous distributed computation (Q808249) (← links)
- On the complexity of computation in the presence of link failures: The case of a ring (Q808251) (← links)
- New lower bound techniques for distributed leader finding and other problems on rings of processors (Q808701) (← links)
- Strictly in-place algorithms for permuting and inverting permutations (Q832874) (← links)
- Cost distribution of the Chang-Roberts leader election algorithm and related problems (Q861286) (← links)
- Efficient parallel k selection algorithm (Q912623) (← links)
- The communication complexity for decentralized evaluation of functions (Q915467) (← links)
- Bit-optimal election in synchronous rings (Q916342) (← links)
- Randomized function evaluation on a ring (Q916384) (← links)
- Symmetry breaking in distributed networks (Q918187) (← links)
- Electing a leader in a ring with link failures (Q1075046) (← links)
- New protocols for the election of a leader in a ring (Q1092653) (← links)
- On the bit complexity of distributed computations in a ring with a leader (Q1098291) (← links)
- Language complexity on the synchronous anonymous ring (Q1102125) (← links)
- A better lower bound for distributed leader finding in bidirectional asynchronous rings of processors (Q1107315) (← links)
- Distributed algorithms for selection in sets (Q1112607) (← links)
- Towards optimal distributed election on chordal rings (Q1178237) (← links)
- Efficient elections in chordal ring networks (Q1262125) (← links)
- Formal verification of a leader election protocol in process algebra (Q1391796) (← links)
- An automata-theoretic approach to the verification of distributed algorithms (Q1706162) (← links)
- An efficient algorithm for computing bisimulation equivalence (Q1884935) (← links)
- Fast leader election in anonymous rings with bounded expected delay (Q1944153) (← links)
- Data flow analysis of asynchronous systems using infinite abstract domains (Q2233447) (← links)
- Some lower bound results for decentralized extrema-finding in rings of processors (Q2640343) (← links)
- Exploiting interleaving semantics in symbolic state-space generation (Q2642670) (← links)
- AN EFFICIENT FULLY SYMBOLIC BISIMULATION ALGORITHM FOR NON-DETERMINISTIC SYSTEMS (Q2842000) (← links)
- (Q2851053) (← links)
- Quasi-Monotonic Sequences: Theory, Algorithms and Applications (Q3033808) (← links)
- An Abstraction Technique for Parameterized Model Checking of Leader Election Protocols: Application to FTSP (Q3303889) (← links)
- Distributed election in a circle without a global sense of orientation (Q3339287) (← links)
- On the message complexity of distributed problems (Q3345763) (← links)
- An improved election algorithm in chordal ring networks (Q3991122) (← links)
- Asymptotically Optimal Election on Weighted Rings (Q4210174) (← links)
- Asymptotically optimal election on weighted rings (Q5054762) (← links)
- Time vs bits (Q5096162) (← links)
- Hundreds of impossibility results for distributed computing (Q5138488) (← links)