Sariel Har-Peled: Curriculum Vitæ

SC 3306, Computer Science, UIUC 201 N. Goodwin Avenue Urbana, IL 61801-2302 USA   Phone: (217) 333-4219 Fax : (217) 265-6591

Home address: 713 W. Indiana   Urbana, IL 61801   USA   (217) 367-7439   E-mail: sariel  @cs.uiuc.edu WWW: http://www.uiuc.edu/~sariel/

Research & Teaching Interests

Discrete and computational geometry, geometric computing, computer graphics, randomized algorithms, approximation algorithms, routing & networking.

Personal Data

Education

• 1995-1999
  Ph.D., Computer Science, Tel Aviv University, Israel
  Research supervised by Prof. Micha Sharir
  Thesis title: Geometric Approximation Algorithms and Randomized Algorithms for Planar Arrangements
  Submitted: Summer 1999
  Graduated with distinction
• 1993-1995
  M.Sc., Computer Science, Tel Aviv University, Israel
  Graduated with honors (Summa Cum Laude)
  Thesis title: The Complexity of Many Cells in the Overlay of Many Arrangements
  Research supervised by Prof. Micha Sharir
• 1989-1993
  B.Sc., Mathematics and Computer Science, Tel Aviv University, Israel
  Graduated with honors (Magna Cum Laude)

Employment

• Current
  Assistant Professor
  University of Illinois, Urbana-Champaign
• 1999-2000
  Post-Doctorate
  Center for Geometric Computing
  Duke University
• 1996-1999
  Teaching Assistant:
  Computer Science Department,
  Tel-Aviv University.
• 1993-1995
  Programmer:
  Capella Computers Ltd. 34A Nahlat Itzhak St., Tel Aviv 67448, Israel

Publications

Have a look at my papers webpage.

Teaching

• UIUC
  • Spring 2001, Randomized Algorithms
    See http://www.uiuc.edu/~sariel/teach/2000/b/.
  • Fall 2001, Clustering and Similarity Search in Low dimension
    See http://www.uiuc.edu/~sariel/teach/2000/a/.
• Duke University
  Spring 2000, Advanced Computational Geometry
  See http://www.cs.duke.edu/~sariel/teach/course.html.
• Tel-Aviv University
  TA of courses in Computer Science at Tel Aviv University: Assembly Language (x86), 96-97
  Compilation, 96-97, 97-98
  Efficiency of Computation 96-97
  Introduction to Computer Science in Scheme 96-97
  Programming Lab (C & Unix), 96-97
  Software I (C & Unix) 97-98
  Software II (Project in C++) 97-98
  Workshop on Computational Geometry & Java 97-98

Community Service

• Committees:
  SoCG 01
  STOC 05
• Refereeing Journals: Algorithmica, Discrete & Computational Geometry, Int. J. of Computational Geometry and Applications, SIAM J. of Computing. Conferences: Ann. ACM Symp. on Computational Geometry, ACM-SIAM Symp. on Discrete Algorithms.
• Publicly-Available Software
  • A collection of Java applets demonstrating algorithms in Computational Geometry. Available at http://www.uiuc.edu/~sariel/research/CG/applets/main.html
  • An implementation of an algorithm for constructing planar cuttings (see publications: ``Constructing Cuttings in Theory and Practice''); Available at http://www.math.tau.ac.il/~sariel/research/CG/cutting/cuttings.html
  • An implementation of -trees in the CGAL library. Available at http://www.cs.ruu.nl/CGAL/