Time and message bounds for election in synchronous and asynchronous complete networks

  • Authors:
  • Yehuda Afek;Eli Gafni

  • Affiliations:
  • Computer Science Department, University of California, Los Angeles, CA;Computer Science Department, University of California, Los Angeles, CA

  • Venue:
  • Proceedings of the fourth annual ACM symposium on Principles of distributed computing
  • Year:
  • 1985

Quantified Score

Hi-index 0.00

Visualization

Abstract