| * | 2009 |
|---|
| 13 | EE | Daniel Golovin:
B-Treaps: A Uniquely Represented Alternative to B-Trees.
ICALP (1) 2009: 487-499 |
| 12 | EE | Daniel Golovin,
Andreas Krause,
Matthew J. Streeter:
Online Learning of Assignments that Maximize Submodular Functions
CoRR abs/0908.0772: (2009) |
| 2008 |
|---|
| 11 | EE | Daniel Golovin,
Anupam Gupta,
Amit Kumar,
Kanat Tangwongsan:
All-Norms and All-L_p-Norms Approximation Algorithms.
FSTTCS 2008 |
| 10 | EE | Matthew J. Streeter,
Daniel Golovin:
An Online Algorithm for Maximizing Submodular Functions.
NIPS 2008: 1577-1584 |
| 9 | EE | Guy E. Blelloch,
Daniel Golovin,
Virginia Vassilevska:
Uniquely Represented Data Structures for Computational Geometry.
SWAT 2008: 17-28 |
| 2007 |
|---|
| 8 | | Matthew J. Streeter,
Daniel Golovin,
Stephen F. Smith:
Combining Multiple Heuristics Online.
AAAI 2007: 1197-1203 |
| 7 | | Matthew J. Streeter,
Daniel Golovin,
Stephen F. Smith:
Restart Schedules for Ensembles of Problem Instances.
AAAI 2007: 1204-1210 |
| 6 | EE | Daniel Golovin:
Stochastic packing-market planning.
ACM Conference on Electronic Commerce 2007: 172-181 |
| 5 | EE | Guy E. Blelloch,
Daniel Golovin:
Strongly History-Independent Hashing with Applications.
FOCS 2007: 272-282 |
| 4 | EE | Daniel Golovin:
More expressive market models and the future of combinatorial auctions.
SIGecom Exchanges 7(1): 55-57 (2007) |
| 2006 |
|---|
| 3 | EE | Daniel Golovin,
Anupam Gupta,
Bruce M. Maggs,
Florian Oprea,
Michael K. Reiter:
Quorum placement in networks: minimizing network congestion.
PODC 2006: 16-25 |
| 2 | EE | Daniel Golovin,
Viswanath Nagarajan,
Mohit Singh:
Approximating the k-multicut problem.
SODA 2006: 621-630 |
| 1 | EE | Daniel Golovin,
Vineet Goyal,
R. Ravi:
Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems.
STACS 2006: 206-217 |
