# Daniel Golovin

According to our database

Collaborative distances:

^{1}, Daniel Golovin authored at least 29 papers between 2006 and 2017.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2017

Google Vizier: A Service for Black-Box Optimization.

Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Halifax, NS, Canada, August 13, 2017

2015

Improved approximations for two-stage min-cut and shortest path problems under uncertainty.

Math. Program., 2015

Hidden Technical Debt in Machine Learning Systems.

Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

2014

Sequential Decision Making in Computational Sustainability via Adaptive Submodularity.

AI Magazine, 2014

Submodular Function Maximization.

Proceedings of the Tractability: Practical Approaches to Hard Problems, 2014

2013

Ad click prediction: a view from the trenches.

Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2013

Large-Scale Learning with Less RAM via Randomization.

Proceedings of the 30th International Conference on Machine Learning, 2013

2011

Complexity and economics: computational constraints may not matter empirically.

SIGecom Exchanges, 2011

Adaptive Submodularity: Theory and Applications in Active Learning and Stochastic Optimization.

J. Artif. Intell. Res., 2011

A revealed preference approach to computational complexity in economics.

Proceedings of the Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), 2011

Randomized Sensing in Adversarial Environments.

Proceedings of the IJCAI 2011, 2011

Dynamic Resource Allocation in Conservation Planning.

Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010

Near-Optimal Bayesian Active Learning with Noisy Observations.

Proceedings of the Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010. Proceedings of a meeting held 6-9 December 2010, 2010

Online distributed sensor selection.

Proceedings of the 9th International Conference on Information Processing in Sensor Networks, 2010

Adaptive Submodularity: A New Approach to Active Learning and Stochastic Optimization.

Proceedings of the COLT 2010, 2010

2009

Simultaneous source location.

ACM Trans. Algorithms, 2009

Online Learning of Assignments.

Proceedings of the Advances in Neural Information Processing Systems 22: 23rd Annual Conference on Neural Information Processing Systems 2009. Proceedings of a meeting held 7-10 December 2009, 2009

B-Treaps: A Uniquely Represented Alternative to B-Trees.

Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

2008

Uniquely Represented Data Structures for Computational Geometry.

Proceedings of the Algorithm Theory, 2008

An Online Algorithm for Maximizing Submodular Functions.

Proceedings of the Advances in Neural Information Processing Systems 21, 2008

All-Norms and All-L_p-Norms Approximation Algorithms.

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

2007

More expressive market models and the future of combinatorial auctions.

SIGecom Exchanges, 2007

Stochastic packing-market planning.

Proceedings of the Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), 2007

Strongly History-Independent Hashing with Applications.

Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

Restart Schedules for Ensembles of Problem Instances.

Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

Combining Multiple Heuristics Online.

Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006

Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems.

Proceedings of the STACS 2006, 2006

Approximating the

*k*-multicut problem.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Quorum placement in networks: minimizing network congestion.

Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006