Ben Birnbaum
Department of Computer Science and Engineering
University of Washington
Box 352350
Seattle, WA 98195-2350
Paul Allen Center, 310
(my last name) at cs dot washington dot edu
I am a third-year Ph.D. student in the
Department of Computer Science and Engineering
at the
University of Washington, Seattle.
I am interested in
online algorithms, approximation algorithms, and algorithmic game theory.
I am advised by Anna Karlin
and supported by an NSF Graduate Research Fellowship.
My CV is available here (last updated 12/8/08).
Papers
- Thinking Twice about Second-Price Ad Auctions,
with Yossi Azar, Anna Karlin, and C. Thach Nguyen.
Preprint available at arXiv.
- Improved Approximation Algorithms for Budgeted Allocations,
with Yossi Azar, Anna Karlin, Claire Mathieu, and C. Thach Nguyen.
ICALP 2008. Full version:
pdf
- On-line Bipartite Matching Made Simple,
with Claire Mathieu.
SIGACT News, 39(1):80-87, 2008.
pdf
- Competitive Analysis of On-line Traffic Grooming in WDM Rings,
with Karyn Benson, Esteban Molina-Estolano, and Ran Libeskind-Hadas.
To appear in IEEE/ACM Transactions on Networks.
- An Improved Analysis for a Greedy Remote-Clique Algorithm Using
Factor-Revealing LPs, with Ken Goldman. APPROX 06.
Journal Version: To appear in Algorithmica. pdf
- Achieving Flexibility in Direct-Manipulation Programming Environments by
Relaxing the Edit-Time Grammar, with Ken Goldman. VL/HCC 05.
pdf