1. D. Aingworth, C. Chekuri, P. Indyk, and, R. Motwani, Fast estimation of diameter and shortest paths (without matrix multiplication), unpublished manuscript.
2. D. Aingworth, C. Chekuri, and R. Motwani, Fast estimation of diameter and shortest paths (without matrix multiplication), inProceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, Atlanta, Georgia, Jan. 28–30, 1996, pp. 547–553.
3. Complexity of network synchronization;Awerbuch;J. Assoc. Comput. Mach.,1985
4. Compact distributed data structures for adaptive network routing;Awerbuch,1989
5. Improved routing strategies with succinct tables;Awerbuch;J. Algorithms,1990