Adam Meyerson

Assistant Professor
Computer Science
UCLA

3731J Boelter Hall
310-825-0866
awm at cs.ucla.edu

Classes

Prof. Meyerson runs the CS288 Theory Seminar and Reading Group. This quarter (Spring 08) the seminar will meet Fridays from 2-3. Currently Prof. Meyerson is traveling and giving talks; next seminar meeting will be May 9th.

Prof. Meyerson also teaches CS280A: Graduate Algorithms (next offered Fall 08), CS280AP: Approximation Algorithms (Fall 08), CS289A: Game Theory in Computer Science (Winter 09), and CS180: Introduction to Algorithms and Complexity (Spring 09). Other past (and future) courses taught include CS289OA: Online Algorithms.

Research Interests and Publications

Prof. Meyerson's main research area is the design and analysis of algorithms. Particular interests include approximation algorithms for NP-Hard problems, online algorithms, algorithmic game theory, and metric embedding. Prof. Meyerson is also interested in applications of algorithms to a wide range of areas, including networks, robotics, data privacy, and compilers.

Publications sorted by topic.

Short Bio

Adam Meyerson received his PhD from Stanford University in Fall 2002, with a thesis on approximation algorithms for design of minimum-cost computer networks. He spent the 2002-2003 academic year as a postdoctoral fellow of the Center for Algorithmic Adaptation, Dissemination, and Integration (Aladdin) at Carnegie-Mellon University. He joined the faculty of UCLA in Fall of 2003. Major research results include the first constant approximation for buy-at-bulk network design, the first online algorithm for the facility location problem, and the first constant approximation for orienteering. Recently he has focused on randomized online algorithms, making substantial progress towards the randomized k-server conjecture, devising a randomized algorithm for online matching, and introducing a new model for time-sensitive dynamic online problems.

Students

Prof. Meyerson's graduate advisees include Aaron Cote, Michael Shindler, and Brian Tagiku. Recent graduates (congratulations!) include Dr. Gunes Ercal (PhD 2008, now Assistant Prof. at University of Kansas), Tyler McHenry (MS 2008, currently at Teledyne Controls), Dr. Douglas Carroll (PhD, 2007, currently at Raytheon, Inc.) and Laura Poplawski (MS, 2006, currently completing a PhD at Northeastern under the supervision of Prof. Rajmohan Rajaraman).

Recent Talks

K-Server on Hierarchical Binary Trees given at U.W., Harvard, MIT, Stanford, Princeton, and Berkeley in Spring 2008. Based on the paper at STOC08.
Approximation Algorithms for Deadline-TSP given at the transportation seminar series at UC Berkeley, August 31, 2007.
Pricing Partially Compatible Products based on the paper at EC 2007. This talk was given at Stanford University in May of 2007.
Randomized Online Matching based on the paper at SODA 2006. This talk was given at Johns Hopkins, University of Maryland, and University of Pennsylvania in late March, 2006.
Online Network Design given at SPAA 2004.
Traveling Salesman with Deadlines given to Stanford University's Department of Management Science and Engineering, by invitation of Prof. Ashish Goel.