Sariel Har-Peled

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

Sariel Har-Peled (born July 14, 1971, in Jerusalem)[1] is an Israeli–American computer scientist known for his research in computational geometry. He is a Donald Biggar Willett Professor in Engineering at the University of Illinois at Urbana–Champaign.[2]

Har-Peled was a student at Tel Aviv University, where he earned a bachelor's degree in mathematics and computer science in 1993, a master's degree in computer science in 1995, and a Ph.D. in 1999. His master's thesis, The Complexity of Many Cells in the Overlay of Many Arrangements, and his doctoral dissertation, Geometric Approximation Algorithms and Randomized Algorithms for Planar Arrangements, were both supervised by Micha Sharir.[1][3] After postdoctoral research at Duke University, he joined the University of Illinois in 2000.[1] He was named Willett Professor in 2016.[2]

Har-Peled is the author of a book on approximation algorithms in computational geometry, Geometric approximation algorithms (American Mathematical Society, 2011).[4][5]


  1. ^ a b c Curriculum vitae (PDF), July 30, 2018, retrieved 2018-09-22
  2. ^ a b Chairs and Professorships, Illinois Computer Science, retrieved 2018-09-22
  3. ^ Sariel Har-Peled at the Mathematics Genealogy Project
  4. ^ Har-Peled authors text on geometric approximation algorithms, =Illinois Computer Science, July 12, 2011, retrieved 2018-09-22
  5. ^ Stephen, Tamon, "Review of Geometric approximation algorithms", Mathematical Reviews, MR 2760023

External links[edit]