 | 2011 |
| 28 |  | Daniel Golovin,
Andreas Krause,
Beth Gardner,
Sarah J. Converse,
Steve Morey:
Dynamic Resource Allocation in Conservation Planning.
AAAI 2011 |
| 27 |  | Federico Echenique,
Daniel Golovin,
Adam Wierman:
A revealed preference approach to computational complexity in economics.
ACM Conference on Electronic Commerce 2011: 101-110 |
| 26 |  | Andreas Krause,
Alex Roper,
Daniel Golovin:
Randomized Sensing in Adversarial Environments.
IJCAI 2011: 2133-2139 |
| 25 |  | Daniel Golovin,
Andreas Krause:
Adaptive Submodular Optimization under Matroid Constraints
CoRR abs/1101.4450: (2011) |
| 24 |  | Daniel Golovin,
Andreas Krause:
Adaptive Submodularity: Theory and Applications in Active Learning and Stochastic Optimization.
J. Artif. Intell. Res. (JAIR) 42: 427-486 (2011) |
| 23 |  | Federico Echenique,
Daniel Golovin,
Adam Wierman:
Complexity and economics: computational constraints may not matter empirically.
SIGecom Exchanges 10(1): 2-5 (2011) |
| 2010 |
| 22 |  | Daniel Golovin,
Andreas Krause:
Adaptive Submodularity: A New Approach to Active Learning and Stochastic Optimization.
COLT 2010: 333-345 |
| 21 |  | Daniel Golovin,
Matthew Faulkner,
Andreas Krause:
Online distributed sensor selection.
IPSN 2010: 220-231 |
| 20 |  | Daniel Golovin,
Andreas Krause,
Debajyoti Ray:
Near-Optimal Bayesian Active Learning with Noisy Observations.
NIPS 2010: 766-774 |
| 19 |  | Daniel Golovin,
Matthew Faulkner,
Andreas Krause:
Online Distributed Sensor Selection
CoRR abs/1002.1782: (2010) |
| 18 |  | Daniel Golovin,
Andreas Krause:
Adaptive Submodularity: A New Approach to Active Learning and Stochastic Optimization
CoRR abs/1003.3967: (2010) |
| 17 |  | Daniel Golovin:
The B-Skip-List: A Simpler Uniquely Represented Alternative to B-Trees
CoRR abs/1005.0662: (2010) |
| 16 |  | Daniel Golovin,
Andreas Krause,
Debajyoti Ray:
Near-Optimal Bayesian Active Learning with Noisy Observations
CoRR abs/1010.3091: (2010) |
| 2009 |
| 15 |  | Daniel Golovin:
B-Treaps: A Uniquely Represented Alternative to B-Trees.
ICALP (1) 2009: 487-499 |
| 14 |  | Matthew J. Streeter,
Daniel Golovin,
Andreas Krause:
Online Learning of Assignments.
NIPS 2009: 1794-1802 |
| 13 |  | Konstantin Andreev,
Charles Garrod,
Daniel Golovin,
Bruce M. Maggs,
Adam Meyerson:
Simultaneous source location.
ACM Transactions on Algorithms 6(1): (2009) |
| 12 |  | Daniel Golovin,
Andreas Krause,
Matthew J. Streeter:
Online Learning of Assignments that Maximize Submodular Functions
CoRR abs/0908.0772: (2009) |
| 2008 |
| 11 |  | Daniel Golovin,
Anupam Gupta,
Amit Kumar,
Kanat Tangwongsan:
All-Norms and All-L_p-Norms Approximation Algorithms.
FSTTCS 2008: 199-210 |
| 10 |  | Matthew J. Streeter,
Daniel Golovin:
An Online Algorithm for Maximizing Submodular Functions.
NIPS 2008: 1577-1584 |
| 9 |  | 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 |  | Daniel Golovin:
Stochastic packing-market planning.
ACM Conference on Electronic Commerce 2007: 172-181 |
| 5 |  | Guy E. Blelloch,
Daniel Golovin:
Strongly History-Independent Hashing with Applications.
FOCS 2007: 272-282 |
| 4 |  | Daniel Golovin:
More expressive market models and the future of combinatorial auctions.
SIGecom Exchanges 7(1): 55-57 (2007) |
| 2006 |
| 3 |  | Daniel Golovin,
Anupam Gupta,
Bruce M. Maggs,
Florian Oprea,
Michael K. Reiter:
Quorum placement in networks: minimizing network congestion.
PODC 2006: 16-25 |
| 2 |  | Daniel Golovin,
Viswanath Nagarajan,
Mohit Singh:
Approximating the k-multicut problem.
SODA 2006: 621-630 |
| 1 |  | 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 |