1. Distributed algorithms for election in unidirectional and complete networks;Afek,1985
2. Time and message bounds for election in synchronous and asynchronous complete networks;Afek,1985
3. A principle for resilient sharing of distributed resources;Alsberg,1976
4. Complexity of network synchronization;Awerbuch;J. Assoc. Comput. Mach.,1985
5. Optimal distributed algorithms for minimum weight spanning tree, counting leader election and related problems;Awerbuch,1987