Baruch Awerbuch
Baruch Awerbuch | |
|---|---|
| Born | 1958 |
| Nationality | Israeli-American |
| Alma mater | Technion – Israel Institute of Technology (BS, MS, PhD) |
| Known for | Research in distributed computing |
| Awards | Edsger W. Dijkstra Prize in Distributed Computing |
| Scientific career | |
| Fields | Computer science, Distributed computing |
| Institutions | Johns Hopkins University |
| Doctoral advisor | Shimon Even |
| Doctoral students | George Varghese |
Baruch Awerbuch (born 1958) is an Israeli-American computer scientist and a professor of computer science at Johns Hopkins University. He is known for his research on distributed computing.
Academic biography
[edit]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
[edit]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
[edit]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
[edit]- ^ a b 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.
- ^ 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, ISBN 978-0-8186-0644-1, S2CID 12004245.
- ^ Awerbuch, Baruch (1985), "Complexity of network synchronization", Journal of the ACM, 32 (4): 804–823, doi:10.1145/4221.4227, hdl:1721.1/149078, S2CID 14872212
- ^ 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, ISBN 978-1581135855, S2CID 8563202.
- ^ 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, ISBN 978-0-8186-4370-5, S2CID 7319638.
- ^ Taubenfeld, Gadi, ed. (2008), "The 2008 Edsger W. Dijkstra Prize in Distributed Computing", Distributed Computing: 22nd International Symposium, DISC 2008, Arcachon, France, September 2008, Proceedings, Lecture Notes in Computer Science, vol. 5218, Springer, p. vii, ISBN 9783540877783.
External links
[edit]- Home page at Johns Hopkins
- Baruch Awerbuch at DBLP Bibliography Server
