Shripad Thite


California Institute of Technology
Center for the Mathematics of Information
1200 East California Boulevard, MC 136-93
Pasadena, CA 91125

s h r i p a d @ c a l t e c h . e d u

office: (626) 395-1762
fax: (626) 795-4765
location: 335 Moore

Ph.D., Computer Science, University of Illinois at Urbana-Champaign
M.S., Computer Science, University of Illinois at Urbana-Champaign
B.E., Computer Engineering, University of Pune, India

Resume | LinkedIn profile
Curriculum vitæ | Research summary | Research statement | Teaching statement
List of publications


Teaching

I am teaching CS 101.4: Algorithms in Geometry and Topology in the 2nd term, winter 2008-09. Please feel free to drop by the class and to take it for credit!


Research

I am a Postdoctoral Fellow at Caltech. I am a member of the Center for the Mathematics of Information, in Information Science and Technology.

I am a computer scientist. My research is in algorithms, specifically in computational geometry and topology. I work on designing and analyzing algorithms for fundamental problems in computational geometry as well as algorithms for geometric problems in applied areas, including scientific computing, graphics and visualization, wireless networking, robotics, and economic simulation. In general, I am excited to work on problems in theoretical computer science and discrete mathematics, often motivated by their applications.


Publications

My most recent papers are:

  1. The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains. With Boris Aronov and Mark de Berg. Appeared at ESA 2008.
  2. Cache-Oblivious Selection in Sorted X+Y Matrices. With Mark de Berg. In Information Processing Letters.
  3. Walking Your Dog in the Woods in Polynomial Time. With Erin Wolf Chambers, Eric Colin de Verdiere, Jeff Erickson, Sylvain Lazard, and Francis Lazarus. Appeared at SoCG 2008, invited to CGTA.
  4. I/O-Efficient Point Location and Map Overlay in Low-Density Subdivisions. With Mark de Berg, Herman Haverkort, and Laura Toma. Appeared at ISAAC 2007.
  5. Adaptive Spacetime Meshing for Discontinuous Galerkin Methods. In Computational Geometry: Theory and Applications.

Please see my publications page for a complete list of my papers.


Links

Journals online (with full articles)
ELSEVIER: CGTA | Disc. Appl. Math | Comp. Appl. Math | Info. Proc. Lett. | Theoret. Comput. Sci.

WorldSciNet: IJCGA

ScienceDirect: JCSS

SPRINGER: Acta Informatica | Algorithmica | Annals Combinatorics | Combinatorica | Comput. Complexity | Disc. Comput. Geom. | Numerische Mathematik | LNCS

SIAM: SICOMP | SIAM J.Disc.Math.
ACM: TALG | JACM | Digital Library
JSTOR | ECCC

Computational Geometry pages
Jeff Erickson | Open Problems Project

Bibliography search
ResearchIndex | MathSciNet | DBLP | Google Scholar

Resources
MathWorld | eFunda | Graphics software | Euclid's Elements | Topology | Algebraic Topology | Math Miscellany | Math books online

Research groups
UIUC: CS Theory | TCS+Comb | CPSD
TU/e: Algoritmiek
Caltech: CMI | Computer Science

Conferences
Midwest Theory Day: Fall 2001