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.
Contents
Academic biography
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.[1][2] 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.[3]
Awerbuch's former doctoral students include UCSD professor George Varghese.[1]
Research contributions
Awerbuch has published many highly cited research papers on topics including
- Cryptographic primitives for verifiable secret sharing and fault tolerant broadcasting[4]
- Synchronization of asynchronous distributed systems[5]
- Network routing methods that are both fault-tolerant[6] and have a highly competitive throughput[7]
Awards and honors
Awerbuch and David Peleg were the 2008 winners of the Edsger W. Dijkstra Prize in Distributed Computing for their work on sparse partitions.[8]
References
- ↑ 1.0 1.1 Baruch Awerbuch at the Mathematics Genealogy Project.
- ↑ Short bio, Awebuch's JHU web site, retrieved 2012-02-18.
- ↑ Faculty profile, Johns Hopkins Univ., retrieved 2012-02-18.
- ↑ Lua error in package.lua at line 80: module 'strict' not found..
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ Lua error in package.lua at line 80: module 'strict' not found..
- ↑ Lua error in package.lua at line 80: module 'strict' not found..
- ↑ Lua error in package.lua at line 80: module 'strict' not found..
External links
- Home page at Johns Hopkins
- Publication list at DBLP