|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 1 occurrences of 1 keywords
|
|
|
|
|
Results
Found 7 publication records. Showing 7 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | David Buchfuhrer, Christopher Umans |
The complexity of Boolean formula minimization.  |
J. Comput. Syst. Sci.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | David Buchfuhrer, Michael Schapira, Yaron Singer |
Computation and incentives in combinatorial public projects.  |
ACM Conference on Electronic Commerce  |
2010 |
DBLP DOI BibTeX RDF |
algorithmic mechanism design |
| 1 | David Buchfuhrer, Christopher Umans |
Limits on the Social Welfare of Maximal-In-Range Auction Mechanisms.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2009 |
DBLP BibTeX RDF |
|
| 1 | David Buchfuhrer, Christopher Umans |
The Complexity of Boolean Formula Minimization.  |
ICALP  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Eui-woong Lee, David Buchfuhrer, Lachlan L. H. Andrew, Ao Tang, Steven H. Low |
Progress on pricing with peering.  |
CISS  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | David Buchfuhrer |
The Complexity of SPP Formula Minimization.  |
ISAAC  |
2008 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #7 of 7 (100 per page; Change: )
|
|