|
Graduate applications: I regularly receive emails from students who might be interested in Brown. However, by university policy, I cannot look at resumes until receiving the application through the official channel.
Summer internships and postdocs: I am usually gone for much of the summer, and have no funding for postdocs. Sorry!
Teaching
Fall 2009: CSCI
2950-w, Online Algorithms.
Fall 2008: CSCI
2510, Approximation Algorithms.
Spring 2008: CSCI
1570, Design and Analysis of Algorithms.
Research
There are two directions to my research: combinatorial
optimization with a focus on approximation algorithms; and probabilistic techniques
for the design
and analysis of algorithms. In addition to work with my PhD students and several collaborators, I am currently thinking about applications of Sherali-Adams lift-and-project techniques to approximation algorithms.
Online publications.
PhD Students
Warren Schudy (will defend Spring 2010)
Aparna Das
Nicolas Schabanel (graduated 2000)
Jeremy Barbay (graduated 2002)
Veronique Unger
Talks
Online Multicast with Egalitarian Cost Sharing (SPAA 2008),
Theorie Algorithmique des Jeux (INRIA 2008),
Presentation to new PHD students (2006,
2007).
Ski rental (Brown Theory lunch, 2007).
Low distortion maps (Yale 2006),
Oblivious medians via online bidding (Harvard 2006),
How to rank with few errors (Wics 2007, Toronto 2007),
Linear programming relaxations for Maxcut,
Profit-maximizing envy-free pricing (Bertinoro 2005),
Vita
Vita and Publication list (last updated in January 2008)
Service
Are you on this page because I ...
... am editor of
Algorithmica?
... am guest editor of the SODA'09 special issue of ACM Transactions on Algorithms (TALG)?
... am on the Brown University Committee on Academic Standing (CAS)?
... participate in the Meiklejohn advising program for a group of students of the class of 2012?
... am chairing the CS department PhD Admissions committee?
|
Claire Mathieu