David Buchfuhrer

The complexity of formula minimization

David Buchfuhrer, 2008 .

Inapproximability for VCG-based combinatorial auctions

Elchanan Mossel, Christos H. Papadimitriou, David Buchfuhrer, 2010, SODA '10.

Mechanisms for Combinatorial Auctions and Public Projects

David Buchfuhrer, David Buchfuhrer, 2011 .

Limits on computationally efficient vcg-based mechanisms for combinatorial auctions and public projects

David Buchfuhrer, Christopher Umans, C. Umans, 2011 .

Progress on pricing with peering

Lachlan L. H. Andrew, Ao Tang, David Buchfuhrer, 2008, 2008 42nd Annual Conference on Information Sciences and Systems.

The complexity of Boolean formula minimization

David Buchfuhrer, Christopher Umans, C. Umans, 2008, J. Comput. Syst. Sci..

Computation and incentives in combinatorial public projects

David Buchfuhrer, Yaron Singer, Michael Schapira, 2010, EC '10.

A Theory of Robust Hardness for Truthful Mechanism Design

Dave Buchfuhrer, David Buchfuhrer, 2011 .

Limits on the Social Welfare of Maximal-In-Range Auction Mechanisms

David Buchfuhrer, Christopher Umans, C. Umans, 2009, Electron. Colloquium Comput. Complex..

Traffic grooming for single-source multicast communication in WDM rings

Ran Libeskind-Hadas, David Buchfuhrer, Brian Tagiku, 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.