 | 2011 |
| 7 |  | David Buchfuhrer,
Christopher Umans:
The complexity of Boolean formula minimization.
J. Comput. Syst. Sci. 77(1): 142-153 (2011) |
| 2010 |
| 6 |  | David Buchfuhrer,
Michael Schapira,
Yaron Singer:
Computation and incentives in combinatorial public projects.
ACM Conference on Electronic Commerce 2010: 33-42 |
| 5 |  | David Buchfuhrer,
Shaddin Dughmi,
Hu Fu,
Robert Kleinberg,
Elchanan Mossel,
Christos H. Papadimitriou,
Michael Schapira,
Yaron Singer,
Christopher Umans:
Inapproximability for VCG-Based Combinatorial Auctions.
SODA 2010: 518-536 |
| 2009 |
| 4 |  | David Buchfuhrer,
Christopher Umans:
Limits on the Social Welfare of Maximal-In-Range Auction Mechanisms.
Electronic Colloquium on Computational Complexity (ECCC) 16: 68 (2009) |
| 2008 |
| 3 |  | Eui-woong Lee,
David Buchfuhrer,
Lachlan L. H. Andrew,
Ao Tang,
Steven H. Low:
Progress on pricing with peering.
CISS 2008: 286-291 |
| 2 |  | David Buchfuhrer,
Christopher Umans:
The Complexity of Boolean Formula Minimization.
ICALP (1) 2008: 24-35 |
| 1 |  | David Buchfuhrer:
The Complexity of SPP Formula Minimization.
ISAAC 2008: 580-591 |