Sotabase

Career

· Former PhD Student, California Institute of Technology

Publications (12)

The complexity of Boolean formula minimization
Journal of computer and system sciences (Print) · 2008
93
cited
Inapproximability for VCG-based combinatorial auctions
ACM-SIAM Symposium on Discrete Algorithms · 2010
62
cited
Computation and incentives in combinatorial public projects
2010
40
cited
Limits on the Social Welfare of Maximal-In-Range Auction Mechanisms
Electron. Colloquium Comput. Complex. · 2009
6
cited
Pricing in the presence of peering
2007
3
cited
Progress on pricing with peering
Annual Conference on Information Sciences and Systems · 2008
3
cited
A Theory of Robust Hardness for Truthful Mechanism Design
2011
2
cited
The Complexity of SPP Formula Minimization
2008
1
cited
Traffic grooming for single-source multicast communication in WDM rings
2005
1
cited
Limits on Computationally Efficient VCG-Based Mechanisms for Combinatorial Auctions and Public Projects
2011
Mechanisms for Combinatorial Auctions and Public Projects
2011
The complexity of formula minimization
2008
Sotabase
David Buchfuhrer | Researcher Profile | Sotabase | Sotabase