Baruch_Awerbuch

Baruch Awerbuch

Baruch Awerbuch

Israeli-American computer scientist

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

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

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. [1]
    Baruch Awerbuch at the Mathematics Genealogy Project.
  2. [2]
    Short bio, Awebuch's JHU web site, retrieved 2012-02-18.
  3. [3]
    Faculty profile, Johns Hopkins Univ., retrieved 2012-02-18.
  4. [4]
    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.
  5. [5]
    Awerbuch, Baruch (1985), "Complexity of network synchronization", Journal of the ACM, 32 (4): 804–823, doi:10.1145/4221.4227, S2CID 14872212
  6. [6]
    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.
  7. [7]
    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.
  8. [8]
    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.
Share this article:

This article uses material from the Wikipedia article Baruch_Awerbuch, and is written by contributors. Text is available under a CC BY-SA 4.0 International License; additional terms may apply. Images, videos and audio are available under their respective licenses.