Journal ArticleDOI
Better computing on the anonymous ring
Hagit Attiya,Marc Snir +1 more
Reads0
Chats0
TLDR
Tight bounds are given on the average complexity of various problems of a bidirectional ring of n processors, where processors are anonymous, i.e., are indistinguishable.About:
This article is published in Journal of Algorithms.The article was published on 1991-04-01. It has received 60 citations till now. The article focuses on the topics: Computable function & Time complexity.read more
Citations
More filters
Book
An Introduction to Distributed Algorithms
TL;DR: A senior undergraduate or graduate level computer science textbook on algorithm design for distributed computer systems.
Journal ArticleDOI
Computing on anonymous networks. I. Characterizing the solvable cases
Masafumi Yamashita,Tiko Kameda +1 more
TL;DR: The symmetricity of a network is related to its 1- and 2-factors in terms of a new graph property called "symmetricity" in each of the four cases (a)-(4) above, to characterize the class of networks on which each of these problems (a)(d) is solvable.
Journal ArticleDOI
Hundreds of impossibility results for distributed computing
Faith E. Fich,Eric Ruppert +1 more
TL;DR: Survey results from distributed computing that show tasks to be impossible, either outright or within given resource bounds, in various models are surveyed.
Journal ArticleDOI
Sorting and election in anonymous asynchronous rings
TL;DR: A complete characterization of the relationship with the problems of leader election for vertices and edges of an anonymous ring of n processors is given, and a lower bound and a reasonably close upper bound on the message complexity valid for sorting and leader election are established.
Proceedings ArticleDOI
Almost Logarithmic-Time Space Optimal Leader Election in Population Protocols
TL;DR: This is the fastest currently known leader election algorithm in which each agent utilises asymptotically optimal number of $\bigo(łogłog n)$ states and incorporates and amalgamates successfully the power of assorted synthetic coins with variable rate phase clocks.
References
More filters
Journal ArticleDOI
A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
TL;DR: In this paper, it was shown that the likelihood ratio test for fixed sample size can be reduced to this form, and that for large samples, a sample of size $n$ with the first test will give about the same probabilities of error as a sample with the second test.
Proceedings ArticleDOI
Probabilistic computations: Toward a unified measure of complexity
TL;DR: Two approaches to the study of expected running time of algoritruns lead naturally to two different definitions of intrinsic complexity of a problem, which are the distributional complexity and the randomized complexity, respectively.
Journal ArticleDOI
Fast probabilistic algorithms for hamiltonian circuits and matchings
Dana Angluin,Leslie G. Valiant +1 more
TL;DR: Three simple efficient algorithms with good probabilistic behaviour are described and an algorithm with a run time of O ( n log n ) which almost certainly finds a perfect matching in a random graph of at least cn log n edges is analyzed.
Book
Probabilistic Methods in Combinatorics
TL;DR: In this paper, Erdős [8] showed that the probabilistic method must exist for a graph G(n,.5) to be a random graph, and that a graph satisfying ∧( √ B_s) ≠ ∅ must exist.
Journal ArticleDOI
An improved algorithm for decentralized extrema-finding in circular configurations of processes
Ernest Chang,Rosemary Roberts +1 more
TL;DR: This note presents an improvement to LeLann's algorithm for finding the largest (or smallest) of a set of uniquely numbered processes arranged in a circle, in which no central controller exists and the number of processes is not known a priori.