1. Time and message bounds for election in synchronous and asynchronous complete networks;Afek Yehuda;SIAM J. Comput.,1991
2. Elections in anonymous networks;Afek Yehuda;Information and Computation,1994
3. Dana Angluin , James Aspnes , Zoë Diamadi , Michael J Fischer , and René Peralta . 2004 . Computation in networks of passively mobile finite-state sensors . In Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing. 290--299 . Dana Angluin, James Aspnes, Zoë Diamadi, Michael J Fischer, and René Peralta. 2004. Computation in networks of passively mobile finite-state sensors. In Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing. 290--299.
4. A trade-off between information and communication in broadcast protocols;Awerbuch Baruch;Journal of the ACM (JACM),1990
5. Zahra Derakhshandeh , Robert Gmyr , Thim Strothmann , Rida Bazzi , Andréa W Richa , and Christian Scheideler . 2015 . Leader election and shape formation with self-organizing programmable matter . In International Workshop on DNA-Based Computers. Springer, 117--132 . Zahra Derakhshandeh, Robert Gmyr, Thim Strothmann, Rida Bazzi, Andréa W Richa, and Christian Scheideler. 2015. Leader election and shape formation with self-organizing programmable matter. In International Workshop on DNA-Based Computers. Springer, 117--132.