 |
Claire Mathieu
Professor of Computer ScienceContact Information
Box 1910Brown University
Providence, RI 02912
Email: claire at cs.brown.edu
Personal home page: http://www.cs.brown.edu/~claire/
Research Areas
| Design and Analysis of Algorithms |
| Combinatorial Optimization |
| Theory of Computation |
Research Themes
| Statistical Approaches |
Research Topics or Projects
Courses Taught
| CSCI1570 | Design and Analysis of Algorithms |
Research Interests
Claire Mathieu is primarily interested in the design and analysis of algorithms. She has also done work relating to average-case analysis of algorithms, computing with errors, models for DNA computing, analysis of statistical physics models, Monte Carlo Markov chains, computational geometry and online algorithms. Currently, her focus is on approximation algorithms for combinatorial optimization problems such as scheduling, packing, and clustering, with a particular focus on approximation schemes.
Selected Publications
de la Vega, W. F., and Kenyon-Mathieu, C. Linear Programming Relaxations of Maxcut. ACM-SIAM, ACM-SIAM Symposium on Discrete Algorithms.
Correa, J., and Kenyon, C. Asymptotic Approximation Schemes for Two-Dimensional Packing. In Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2004), pp. 186-195. [ pdf ]
Buchsbaum, A. L., Karloff, H., Kenyon, C., Reingold, N., and Thorup, M. OPT versus LOAD in Dynamic Storage Allocation. SIAM Journal on Computing 33, 3 (2003), 632-646. [ pdf ]
Csirik, J., Johnson, D. S., Kenyon, C., Orlin, J. B., Shor, P. W., and Weber, R. R. On the Sum-of-squares Algorithm for Bin Packing. In Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing (STOC) (May 2000). [ pdf ]
All publications by Claire Mathieu
| Page Owner: Claire Mathieu | Last Modified: Mon Aug 20 14:30:39 2007 |