Boaz Barak

Boaz Barak (בועז ברק, born 1974) is an Israeli-American professor of computer science.[1]

He graduated in 1999 with a B.Sc. in mathematics and computer science from Tel Aviv University[2] He received in 2004 his Ph.D. from the Weizmann Institute of Science with thesis Non-Black-Box Techniques in Cryptography under the supervision of Oded Goldreich.[3] Barak was at the Institute for Advanced Study for two years from 2003 to 2005. In the computer science department of Princeton University he was an assistant professor from 2005 to 2010 and an associate professor from 2010 to 2011. From 2010 to 2016 he was a researcher at Microsoft's New England research laboratory. He is, since 2016, Harvard University's Gordon McKay Professor of Computer Science in the Harvard John A. Paulson School of Engineering and Applied Sciences. He is a citizen of Israel and the U.S.A.[2]

He co-authored, with Sanjeev Arora, Computational Complexity: A Modern Approach, published by Cambridge University Press in 2009.[4] Barak also wrote, with David Steurer, extensive notes on the sum of squares algorithm and occasionally blogs on the Windows on Theory blog.[2]

In 2014 Barak was an invited speaker at the International Congress of Mathematics at Seoul. He was selected for Foreign Policy's Top 100 Global Thinkers issue for 2014. With Mark Braverman, Xi Chen, and Anup Rao, he won the 2016 SIAM Outstanding Paper Prize for the paper How to “Compress Interactive Communication”.[2][5]

Patents
  • U.S. Patent 7,003,677, “Method for operating proactively secured applications on an insecure system” with Amir Herzberg, Dalit Naor and Eldad Shai of IBM Haifa Research Lab. Filed November 1999, granted February 2006.
gollark: You could just receive that information via candles, faster.
gollark: That seems worse, then. Lower bitrate than candles.
gollark: Interesting. How fast can they write on that?
gollark: Cool, what?
gollark: You really should try and make them factor semiprimes, and develop a better communications link than those candles.

References
  1. "Boaz Barak, homepage". boazbarak.
  2. "Boaz Barak — Curriculum Vitae" (PDF).
  3. Boaz Barak at the Mathematics Genealogy Project
  4. Arora, Sanjeev; Barak, Boaz (20 April 2009). Computational Complexity: A Modern Approach. Cambridge University Press. ISBN 978-0-521-42426-4.
  5. Barak, Boaz; Braverman, Mark; Chen, Xi; Rao, Anup (2013). "How to Compress Interactive Communication". SIAM Journal on Computing. 42 (3): 1327–1363. doi:10.1137/100811969. ISSN 0097-5397.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.