Shripad Thite

Department of Computer Science
Technische Universiteit Eindhoven
HG 7.37
Postbus 513
5600 MB Eindhoven
The Netherlands

s t h i t e @ w i n . t u e . n l

work: +31-40-247-3201
mobile: +31-62-901-8725
fax: +31-40-247-5361

I have moved to Caltech!
Please click here for my new contact information.

Research

I am a postdoc in the algorithms group of the Faculteit Wiskunde en Informatica (Department of Mathematics and Computer Science) at the Technische Universiteit Eindhoven. Pretty soon, I will join the Caltech Center for the Mathematics of Information as a Postdoctoral Fellow. Until 2005, I was a Ph.D. student in the Department of Computer Science at the University of Illinois at Urbana-Champaign.

My research interests include computational geometry, mesh generation, computational topology, and algorithms and data structures. In general, I am interested in problems in theoretical computer science and discrete mathematics, and their applications.

My Ph.D. thesis gives spacetime meshing algorithms; the meshes we generate are used to efficiently solve PDEs describing wavelike phenomena evolving over time, using novel spacetime-discontinuous Galerkin methods. My Ph.D. advisor is Prof. Jeff Erickson. My thesis research was done in collaboration with several colleagues at the Center for Process Simulation and Design at UIUC.

My M.S. thesis, titled "Optimum Binary Search Trees on the Hierarchical Memory Model", gives algorithms for computing binary search trees of minimum average weighted search cost on a non-uniform memory model of computation. Prof. Michael Loui is my M.S. thesis advisor.

I graduated in 1997 from the Government College of Engineering with a B.E. in Computer Engineering from the University of Pune, India. I grew up and spent the first 21 years of my life in Pune (18°30'N, 74°55'E, 1834 ft).

Publications

Please follow the link to view my papers. I am also maintaining an incomplete list of upcoming paper submission deadlines, and working on an annotated bibliography on computational topology.

Talks/other articles

1. Notes on Projective Geometry: CS 491 SML, Spring 2002 [May 2002]

2. Hardness of Robot Motion Planning, a talk in the CS theory seminar at UIUC. [April 12, 2000]

3. Parametric Search for Geometric Optimization, expository article and class presentation for Prof. Sariel Har-Peled. [December 2000]

4. Counting Complexity Classes: term paper for an independent study class with Prof. Michael Loui. [May 1998]

Java applets

1. Shortest paths on an arrangement of two intersecting families of rays. [October 2000]

2. Smallest enclosing circle of a set of points in the plane. [November 2000]

3. Two congruent circles of smallest radius enclosing a set of points in convex position in the plane. [November 2000]

4. Minimum dominating set in a geometric layout [November 2001]

5. Capturing a convex polygonal object with three disc-shaped robots. [October 2001]

Teaching

If you are writing a paper on Mesh Generation for 2IL40: Advanced Algorithms, I have a bibliography of recommended papers.

I was co-teaching the Seminar on I/O-efficient algorithms (same as last year), with Prof. Herman Haverkort. If you are a student in the class, email is the best way to schedule an appointment with me.

At the University of Illinois at Urbana-Champaign, I was a Teaching Assistant for various courses, ranging from programming labs for undergraduate and graduate students to some of the hardest theory courses offered by the department.

Volunteer

Did you know that you could Work An Hour and help support basic education of underprivileged children in India? Please consider contributing to your local chapter of ASHA for Education.

At UIUC, I had a great time volunteering with MathManiaCS.