Simple and efficient election algorithms for anonymous networks

This publication has 12 references indexed in Scilit:

• Calling names in nameless networks
  Published by Association for Computing Machinery (ACM) ,1989
• Probabilistic solitude verification on a ring
  Published by Association for Computing Machinery (ACM) ,1986
• Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms
  Published by Association for Computing Machinery (ACM) ,1986
• Breaking symmetry in synchronous networks
  Lecture Notes in Computer Science, 1986
• Estimating the multiplicities of conflicts in multiple access channels
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1983
• Distributed network protocols
  IEEE Transactions on Information Theory, 1983
• On the connectivity of randomm-orientable graphs and digraphs
  Combinatorica, 1982
• Local and global properties in networks of processors (Extended Abstract)
  Published by Association for Computing Machinery (ACM) ,1980
• Fast probabilistic algorithms for hamiltonian circuits and matchings
  Journal of Computer and System Sciences, 1979
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
  The Annals of Mathematical Statistics, 1952