Pages that link to "Item:Q3888516"
From MaRDI portal
The following pages link to Decentralized extrema-finding in circular configurations of processors (Q3888516):
Displayed 29 items.
- Topology recognition with advice (Q259077) (← links)
- Anonymous meeting in networks (Q262278) (← links)
- Knowledge, level of symmetry, and time of leader election (Q498667) (← links)
- How much memory is needed for leader election (Q661049) (← links)
- A simple, efficient algorithm for maximum finding on rings (Q671266) (← links)
- Some problems in distributed computational geometry (Q719317) (← links)
- On the complexity of computation in the presence of link failures: The case of a ring (Q808251) (← 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)
- Symmetry breaking in distributed networks (Q918187) (← links)
- Computing on a partially eponymous ring (Q1004322) (← links)
- Electing a leader in a ring with link failures (Q1075046) (← links)
- Distributed algorithm for extrema-finding in circular configuration of processors (Q1083214) (← links)
- New protocols for the election of a leader in a ring (Q1092653) (← links)
- Communication and time complexity of a distributed election protocol (Q1176439) (← links)
- Impact of knowledge on election time in anonymous networks (Q1755789) (← links)
- Exact communication costs for consensus and leader in a tree (Q1827285) (← links)
- Fast leader election in anonymous rings with bounded expected delay (Q1944153) (← links)
- Leader election for anonymous asynchronous agents in arbitrary networks (Q2251147) (← links)
- Some lower bound results for decentralized extrema-finding in rings of processors (Q2640343) (← 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)
- AN IMPROVED ALGORITHM FOR SUBDIVISION TRAVERSAL WITHOUT EXTRA STORAGE (Q4818563) (← links)
- Distributed tree comparison with nodes of limited memory (Q5326772) (← links)
- Topology recognition and leader election in colored networks (Q5964025) (← links)
- Four shades of deterministic leader election in anonymous networks (Q6071119) (← links)