An O ( n log n ) Unidirectional Algorithm for the Circular Extrema Problem
From MaRDI portal
Publication:3951541
DOI10.1145/69622.357194zbMath0489.68040OpenAlexW2017534864MaRDI QIDQ3951541
Publication date: 1982
Published in: ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/69622.357194
Related Items (45)
A near-optimal multistage distributed algorithm for finding leaders in clustered chordal rings ⋮ Strictly in-place algorithms for permuting and inverting permutations ⋮ New protocols for the election of a leader in a ring ⋮ Asymptotically optimal election on weighted rings ⋮ Language complexity on the synchronous anonymous ring ⋮ Some lower bound results for decentralized extrema-finding in rings of processors ⋮ An improved election algorithm in chordal ring networks ⋮ A better lower bound for distributed leader finding in bidirectional asynchronous rings of processors ⋮ Cost distribution of the Chang-Roberts leader election algorithm and related problems ⋮ Distributed tree comparison with nodes of limited memory ⋮ Move-optimal partial gathering of mobile agents in asynchronous trees ⋮ Move-optimal partial gathering of mobile agents without identifiers or global knowledge in asynchronous unidirectional rings ⋮ Time vs bits ⋮ Formal verification of a leader election protocol in process algebra ⋮ Four shades of deterministic leader election in anonymous networks ⋮ Fast leader election in anonymous rings with bounded expected delay ⋮ Partial gathering of mobile agents in asynchronous unidirectional rings ⋮ An automata-theoretic approach to the verification of distributed algorithms ⋮ Efficient parallel k selection algorithm ⋮ The communication complexity for decentralized evaluation of functions ⋮ Bit-optimal election in synchronous rings ⋮ Randomized function evaluation on a ring ⋮ Symmetry breaking in distributed networks ⋮ Design and analysis of dynamic leader election protocols in broadcast networks ⋮ Hundreds of impossibility results for distributed computing ⋮ Communication and time complexity of a distributed election protocol ⋮ A knowledge-based analysis of global function computation ⋮ How much memory is needed for leader election ⋮ Towards optimal distributed election on chordal rings ⋮ A simple, efficient algorithm for maximum finding on rings ⋮ Knowledge, level of symmetry, and time of leader election ⋮ Anonymous wireless rings ⋮ Leader election for anonymous asynchronous agents in arbitrary networks ⋮ Impact of knowledge on election time in anonymous networks ⋮ Distributed election in a circle without a global sense of orientation ⋮ On the message complexity of distributed problems ⋮ Topology recognition and leader election in colored networks ⋮ Efficient elections in chordal ring networks ⋮ Stabilizing time-adaptive protocols ⋮ Two lower bounds in asynchronous distributed computation ⋮ 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 ⋮ Topology recognition with advice ⋮ Electing a leader in a ring with link failures ⋮ Anonymous meeting in networks
This page was built for publication: An O ( n log n ) Unidirectional Algorithm for the Circular Extrema Problem
