Kevin L. Chang

About me

I recently finished a PhD from the Computer Science Department at Yale. Previously, I was an undergraduate math major at Princeton.

I'm currently a postdoctoral fellow at the Max Planck Institute for Computer Science in Saarbruecken, Germany. This page is no longer being maintained as carefully. In 30 seconds, you will be redirected to my current homepage.

Research

My many research interests include:

Massive data set algorithms and data mining
Optimization
Machine learning

My thesis advisor was Professor Ravi Kannan.

My thesis. (Please read!)
[Postcript version] [PDF version]
[Defense slides in PowerPoint]

Here is the webpage of the theory student reading group.

Publications

Approximation schemes for degree-restricted MST and Red-Blue separation problem.
with Sanjeev Arora.
Algorithmica, 40(3):189-210, 2004. A preliminary version appeared in ICALP 2003.
[Postscript of journal version]

Inoculation strategies for victims of viruses and sum-of-squares partition problem.
with James Aspnes and Aleksandr Yampolskiy.
Journal of Computer and System Sciences, 72(6):1077-1093, 2006. A preliminary version appeared in SODA 2005.
[Postcript of journal version] [Postscript of SODA version]
[PowerPoint slides]

The Space Complexity of Pass Efficient Algorithms for Clustering.
with Ravi Kannan.
in SODA 2006.
[Postscript of SODA version] [Postscript of full version (12-29-2006 draft) ]
[PDF slides]

Pass Efficient Algorithms for Facility Location
Manuscript.
[Postcript of Yale/DCS/TR-1337]

Check out my DBLP entry.

There's always more in the pipeline. Watch this space!

Miscellaneous

My Erdös number is 3.

Paradiso:

Manuel Antonio National Park, Costa Rica

Inferno:

Hawai`i Volcanoes National Park

Last updated: December, 2006