Baruch AwerbuchProfessor Computer Science baruch@cs.jhu.edu (primary) ResearcherID webpage >> |
Education
| D.Sc. 1984, Technion, Haifa, Israel |
| M.Sc. 1982, Technion, Haifa, Israel |
| B.Sc. 1978, Technion, Haifa, Israel |
Experience
| 1995: Full Professor of Computer Science, The Johns Hopkins University |
| 1994-1995: Associate Professor of Computer Science, The Johns Hopkins University |
| 1992-1994: Research Associate, Laboratory for Computer Science, MIT |
| 1989-1992: Associate Professor, Applied Mathematics Department, MIT |
| 1986-1989: Assistant Professor, Applied Mathematics Department, MIT |
| 1984-1986: Postdoctorate Fellow, Laboratory for Computer Science, MIT |
| 1983-1984: Research Fellow, IBM Israel Scientific Center, Haifa |
| 1981-1983: Teaching Assistant, Electrical Engineering Department, Technion, Haifa |
Journal Articles
| Awerbuch, B., Yossi, A., Khandekar, R. (2008). Fast load balancing via bounded best response. SODA 2008: 314-322. |
| Awerbuch, B., Israel, C., Kutten:, S. (2008). Optimal maintenance of a spanning tree.. J. ACM 55(4):. |
| Awerbuch, B., Khandekar:, R. (2008). Cost sharing mechanisms for near-optimal traffic aggregation and network design. SPAA 2008: 85-90. |
| Awerbuch, B., Kleinberg:, R. (2008). Online linear optimization and adaptive routing. J. Comput. Syst. Sci. 74(1): 97-114. |
| Awerbuch, B., Khandekar:, R. (2008). Greedy distributed optimization of unsplittable multicommodity flows. PODC. |
Conference Proceedings
| Awerbuch, B., Richa, A., Scheideler, C. "A jamming-resistant MAC protocol for single-hop wireless networks.", PODC 2008: 45-54, 2008. |
| Awerbuch, B., Yossi, A., Khandekar, R. "Fast Load Balancing via Bounded Best Response", ACM-SIAM SODA, 2008. |
| Awerbuch, B., Khandekar, R. "Stateless distributed algorithms for near optimal maximum multicommodity flows.", PODC 2008: 440, 2008. |
| Awerbuch, B., Khandekar, R. "Stateless distributed gradient descent for positive linear programs.", STOC 2008: 691-700, 2008. |
| Awerbuch, B., Khandekar:, R. "Stateless Near Optimal Flow Control with Poly-logarithmic Convergence", LATIN 2008: 580-592, 2008. |
Awards & Honors
| The Dijkstra Award Committee has selected Baruch Awerbuch and David Peleg as the recipients of this year Edsger W. Dijkstra Prize in Distributed Computing. The price is given to them for their outstanding paper: "Sparse Partitions" published in FOCS 1 |
| 2004 - 2005: APL - APPLICATION OF RESILIENT SECURE ROUTING PROTOCOLS TO MILITARY NETWORKS 12/10/03 - 9/30/04 $50,000.00 TOTAL. |
| 2004 - 2005: APL - USARL COLLABORATIVE TECHNOLOGY ALLLIANCE 12/01/2003 - 12/31/2004 $30,000.00 TOTAL. |
Committees
| 2003 - 2004: Member of Mobihoc 2004 program committee |