David Buchfuhrer

According to our database, David Buchfuhrer authored at least 8 papers between 2005 and 2011.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2011

Limits on Computationally Efficient VCG-Based Mechanisms for Combinatorial Auctions and Public Projects.

David Buchfuhrer

PhD thesis, 2011

The complexity of Boolean formula minimization.

David Buchfuhrer, Christopher Umans

J. Comput. Syst. Sci., 2011

2010

Inapproximability for VCG-Based Combinatorial Auctions.

David Buchfuhrer, Shaddin Dughmi, Hu Fu, Robert Kleinberg, Elchanan Mossel, Christos H. Papadimitriou, Michael Schapira, Yaron Singer, Christopher Umans

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Computation and incentives in combinatorial public projects.

David Buchfuhrer, Michael Schapira, Yaron Singer

Proceedings of the Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), 2010

2009

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

David Buchfuhrer, Christopher Umans

Electron. Colloquium Comput. Complex., 2009

2008

The Complexity of SPP Formula Minimization.

David Buchfuhrer

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Progress on pricing with peering.

Euiwoong Lee, David Buchfuhrer, Lachlan L. H. Andrew, Ao Tang, Steven H. Low

Proceedings of the 42nd Annual Conference on Information Sciences and Systems, 2008

2005

Traffic grooming for single-source multicast communication in WDM rings.

David Buchfuhrer, Timothy Carnes, Brian Tagiku, Laura Celis, Ran Libeskind-Hadas

Proceedings of IEEE International Conference on Communications, 2005