Dave Buchfuhrer

Papers

Game Theory

• A Theory of Robust Hardness for Truthful Mechanism Design.
  D. Buchfuhrer.
  In submission
• Computation and Incentives in Combinatorial Public Projects.
  D. Buchfuhrer, M. Schapira and Y. Singer.
  Proceedings 11th ACM Conference on Electronic Commerce (EC). p. 33-42. 2010.
• Limits on the Social Welfare of Maximal-In-Range Auction Mechanisms.
  D. Buchfuhrer and C. Umans.
  Part of: Inapproximability for VCG-Based Combinatorial Auctions.
  D. Buchfuhrer, S. Dughmi, H. Fu, R. Kleinberg, E. Mossel, C. Papadimitriou, M. Schapira, Y. Singer and C. Umans.
  Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). p. 518-536. 2010.

Computational Complexity

• The complexity of SPP formula minimization.
  D. Buchfuhrer.
  Proceedings of The 19th International Symposium on Algorithm and Computation (ISAAC). p. 580-591. 2008.
• The complexity of formula minimization.
  D. Buchfuhrer.
  Master's Thesis, California Institute of Technology. 2008.
• The complexity of Boolean formula minimization.
  D. Buchfuhrer and C. Umans.
  Journal of Computer and System Sciences (JCSS). p. 142-153. 2011.
  An earlier version appeared in Proceedings of Automata, Languages and Programming, 35th International Colloquium, (ICALP). p. 24-35. 2008. Won the Track A Best Paper Award.