| 2008 |
|---|
| 13 | EE | Aaron Archer,
Robert Kleinberg:
Truthful germs are contagious: a local to global characterization of truthfulness.
ACM Conference on Electronic Commerce 2008: 21-30 |
| 12 | EE | Aaron Archer,
Shankar Krishnan:
Importance Sampling via Load-Balanced Facility Location.
IPCO 2008: 316-330 |
| 11 | EE | Aaron Archer,
Asaf Levin,
David P. Williamson:
A Faster, Better Approximation Algorithm for the Minimum Latency Problem.
SIAM J. Comput. 37(5): 1472-1498 (2008) |
| 2007 |
|---|
| 10 | EE | Aaron Archer,
Éva Tardos:
Frugal path mechanisms.
ACM Transactions on Algorithms 3(1): (2007) |
| 2004 |
|---|
| 9 | EE | Aaron Archer,
Jittat Fakcharoenphol,
Chris Harrelson,
Robert Krauthgamer,
Kunal Talwar,
Éva Tardos:
Approximate classification via earthmover metrics.
SODA 2004: 1079-1087 |
| 2003 |
|---|
| 8 | EE | Aaron Archer,
Ranjithkumar Rajagopalan,
David B. Shmoys:
Lagrangian Relaxation for the k-Median Problem: New Insights and Continuity Properties.
ESA 2003: 31-42 |
| 7 | EE | Aaron Archer,
Christos H. Papadimitriou,
Kunal Talwar,
Éva Tardos:
An approximate truthful mechanism for combinatorial auctions with single parameter agents.
SODA 2003: 205-214 |
| 6 | EE | Aaron Archer,
David P. Williamson:
Faster approximation algorithms for the minimum latency problem.
SODA 2003: 88-96 |
| 5 | | Aaron Archer,
Christos H. Papadimitriou,
Kunal Talwar,
Éva Tardos:
An Approximate Truthful Mechanism for Combinatorial Auctions with Single Parameter Agents.
Internet Mathematics 1(2): (2003) |
| 2002 |
|---|
| 4 | EE | Aaron Archer,
Éva Tardos:
Frugal path mechanisms.
SODA 2002: 991-999 |
| 2001 |
|---|
| 3 | | Aaron Archer,
Éva Tardos:
Truthful Mechanisms for One-Parameter Agents.
FOCS 2001: 482-491 |
| 2 | EE | Aaron Archer:
Two O (log* k)-Approximation Algorithms for the Asymmetric k-Center Problem.
IPCO 2001: 1-14 |
| 2000 |
|---|
| 1 | EE | Aaron Archer:
On the upper chromatic numbers of the reals.
Discrete Mathematics 214(1-3): 65-75 (2000) |
