Average and Randomized Complexity of Distributed Problems

Nechama Allenberg-Navony, Alon Itai, Shlomo Moran. Average and Randomized Complexity of Distributed Problems. In Gerard Tel, Paul M. B. Vitányi, editors, Distributed Algorithms, 8th International Workshop, WDAG 94, Terschelling, The Netherlands, September 29 - October 1, 1994, Proceedings. Volume 857 of Lecture Notes in Computer Science, pages 311-325, Springer, 1994.

@inproceedings{Allenberg-NavonyIM94,
  title = {Average and Randomized Complexity of Distributed Problems},
  author = {Nechama Allenberg-Navony and Alon Itai and Shlomo Moran},
  year = {1994},
  researchr = {https://researchr.org/publication/Allenberg-NavonyIM94},
  cites = {0},
  citedby = {0},
  pages = {311-325},
  booktitle = {Distributed Algorithms, 8th International Workshop, WDAG  94, Terschelling, The Netherlands, September 29 - October 1, 1994, Proceedings},
  editor = {Gerard Tel and Paul M. B. Vitányi},
  volume = {857},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-58449-8},
}