Learn More
This paper initiates the study of the impact of failures on the fundamental problem of information spreading in the Vertex-Congest model, in which in every round, each of the n nodes sends the same O(log n)-bit message to all of its neighbors. Our contribution to coping with failures is twofold. First, we prove that the randomized algorithm which chooses(More)
Acknowledgements I would like to express my deepest gratitude to my supervisor, Prof. Keren Censor-Hillel, for her devoted support, guidance and concern throughout this research. Thanks to my dear family for their love and support at all times. Thanks to Mohsen Ghaffari and Fabian Kuhn for useful discussions. Thanks to Shmuel Zaks and Yuval Emek for useful(More)
  • 1