Baruch Awerbuch

Baruch Awerbuch (born 1958) is an Israeli-American computer scientist, a professor of computer science at Johns Hopkins University. He is known for his research on distributed computing.

Awerbuch was educated at the Technion in Haifa, Israel, earning a bachelor's degree in 1978, a master's degree in 1982, and a Ph.D. in 1984 under the supervision of Shimon Even. He worked at the Massachusetts Institute of Technology as a postdoctoral researcher, faculty member in applied mathematics, and research associate in computer science from 1984 until 1994, when he joined the Johns Hopkins faculty.

Awerbuch's former doctoral students include UCSD professor George Varghese.

Awerbuch has published many highly cited research papers on topics including

• Cryptographic primitives for verifiable secret sharing and fault tolerant broadcasting
• Synchronization of asynchronous distributed systems
• Network routing methods that are both fault-tolerant and have a highly competitive throughput

• Chor, Benny; Goldwasser, Shafi; Micali, Silvio; Awerbuch, Baruch (1985), "Verifiable secret sharing and achieving simultaneity in the presence of faults", 26th IEEE Symposium on Foundations of Computer Science (FOCS '85), pp. 383–395, doi:10.1109/SFCS.1985.64 .
• Awerbuch, Baruch (1985), "Complexity of network synchronization", Journal of the ACM, 32 (4): 804–823, doi:10.1145/4221.4227 
• Awerbuch, Baruch; Holmer, David; Nita-Rotaru, Cristina; Rubens, Herbert (2002), "An on-demand secure routing protocol resilient to byzantine failures", Proceedings of the 1st ACM Workshop on Wireless Security (WiSE '02), pp. 21–30, doi:10.1145/570681.570684 .
• Awerbuch, B.; Azar, Y.; Plotkin, S. (1993), "Throughput-competitive on-line routing", Proc. 34th IEEE Symposium on Foundations of Computer Science (FOCS '93), pp. 32–40, doi:10.1109/SFCS.1993.366884 .

Awerbuch and David Peleg were the 2008 winners of the Edsger W. Dijkstra Prize in Distributed Computing for their work on sparse partitions.