Decentralized extrema-finding in circular configurations of processors
From MaRDI portal
Publication:3888516
DOI10.1145/359024.359029zbMath0444.68022MaRDI QIDQ3888516
J. B. Sinclair, Daniel S. Hirschberg
Publication date: 1980
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/359024.359029
Related Items
AN IMPROVED ALGORITHM FOR SUBDIVISION TRAVERSAL WITHOUT EXTRA STORAGE, Distributed tree comparison with nodes of limited memory, Topology recognition and leader election in colored networks, Topology recognition with advice, Anonymous meeting in networks, Knowledge, level of symmetry, and time of leader election, How much memory is needed for leader election, A simple, efficient algorithm for maximum finding on rings, Some problems in distributed computational geometry, On the complexity of computation in the presence of link failures: The case of a ring, Cost distribution of the Chang-Roberts leader election algorithm and related problems, Efficient parallel k selection algorithm, The communication complexity for decentralized evaluation of functions, Symmetry breaking in distributed networks, Computing on a partially eponymous ring, Electing a leader in a ring with link failures, Distributed algorithm for extrema-finding in circular configuration of processors, New protocols for the election of a leader in a ring, Communication and time complexity of a distributed election protocol, Impact of knowledge on election time in anonymous networks, Exact communication costs for consensus and leader in a tree, Fast leader election in anonymous rings with bounded expected delay, Leader election for anonymous asynchronous agents in arbitrary networks, Some lower bound results for decentralized extrema-finding in rings of processors, Distributed election in a circle without a global sense of orientation, On the message complexity of distributed problems, An improved election algorithm in chordal ring networks
