Daniel Golovin

Google Publications

Previous Publications

  •  

    Hidden Technical Debt in Machine Learning Systems

    D. Sculley, Gary Holt, Daniel Golovin, Eugene Davydov, Todd Phillips, Dietmar Ebner, Vinay Chaudhary, Michael Young, Jean-Fran├žois Crespo, Dan Dennison

    NIPS (2015), pp. 2503-2511

  •  

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

    Daniel Golovin, Vineet Goyal, Valentin Polishchuk, R. Ravi 0001, Mikko Sysikaski

    Math. Program., vol. 149 (2015), pp. 167-194

  •  

    Online Submodular Maximization under a Matroid Constraint with Application to Learning Assignments

    Daniel Golovin, Andreas Krause, Matthew J. Streeter

    CoRR, vol. abs/1407.1082 (2014)

  •  

    Sequential Decision Making in Computational Sustainability via Adaptive Submodularity

    Andreas Krause, Daniel Golovin, Sarah J. Converse

    AI Magazine, vol. 35 (2014), pp. 8-18

  •  

    A revealed preference approach to computational complexity in economics

    Federico Echenique, Daniel Golovin, Adam Wierman

    EC (2011), pp. 101-110

  •  

    Adaptive Submodular Optimization under Matroid Constraints

    Daniel Golovin, Andreas Krause

    CoRR, vol. abs/1101.4450 (2011)

  •  

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

    Daniel Golovin, Andreas Krause

    J. Artif. Intell. Res. (JAIR), vol. 42 (2011), pp. 427-486

  •  

    Complexity and economics: computational constraints may not matter empirically

    Federico Echenique, Daniel Golovin, Adam Wierman

    SIGecom Exchanges, vol. 10 (2011), pp. 2-5

  •  

    Dynamic Resource Allocation in Conservation Planning

    Daniel Golovin, Andreas Krause, Beth Gardner, Sarah J. Converse, Steve Morey

    AAAI (2011)

  •  

    Randomized Sensing in Adversarial Environments

    Andreas Krause, Alex Roper, Daniel Golovin

    IJCAI (2011), pp. 2133-2139

  •  

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

    Daniel Golovin, Andreas Krause

    CoRR, vol. abs/1003.3967 (2010)

  •  

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

    Daniel Golovin, Andreas Krause

    COLT (2010), pp. 333-345

  •  

    Near-Optimal Bayesian Active Learning with Noisy Observations

    Daniel Golovin, Andreas Krause, Debajyoti Ray

    CoRR, vol. abs/1010.3091 (2010)

  •  

    Near-Optimal Bayesian Active Learning with Noisy Observations

    Daniel Golovin, Andreas Krause, Debajyoti Ray

    NIPS (2010), pp. 766-774

  •  

    Online Distributed Sensor Selection

    Daniel Golovin, Matthew Faulkner, Andreas Krause

    CoRR, vol. abs/1002.1782 (2010)

  •  

    Online distributed sensor selection

    Daniel Golovin, Matthew Faulkner, Andreas Krause

    IPSN (2010), pp. 220-231

  •  

    The B-Skip-List: A Simpler Uniquely Represented Alternative to B-Trees

    Daniel Golovin

    CoRR, vol. abs/1005.0662 (2010)

  •  

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

    Daniel Golovin

    ICALP (1) (2009), pp. 487-499

  •  

    Online Learning of Assignments

    Matthew J. Streeter, Daniel Golovin, Andreas Krause

    NIPS (2009), pp. 1794-1802

  •  

    Online Learning of Assignments that Maximize Submodular Functions

    Daniel Golovin, Andreas Krause, Matthew J. Streeter

    CoRR, vol. abs/0908.0772 (2009)

  •  

    Simultaneous source location

    Konstantin Andreev, Charles Garrod, Daniel Golovin, Bruce M. Maggs, Adam Meyerson

    ACM Transactions on Algorithms, vol. 6 (2009)

  •  

    All-Norms and All-L_p-Norms Approximation Algorithms

    Daniel Golovin, Anupam Gupta, Amit Kumar 0001, Kanat Tangwongsan

    FSTTCS (2008), pp. 199-210

  •  

    An Online Algorithm for Maximizing Submodular Functions

    Matthew J. Streeter, Daniel Golovin

    NIPS (2008), pp. 1577-1584

  •  

    Uniquely Represented Data Structures for Computational Geometry

    Guy E. Blelloch, Daniel Golovin, Virginia Vassilevska

    SWAT (2008), pp. 17-28

  •  

    Combining Multiple Heuristics Online

    Matthew J. Streeter, Daniel Golovin, Stephen F. Smith

    AAAI (2007), pp. 1197-1203

  •  

    More expressive market models and the future of combinatorial auctions

    Daniel Golovin

    SIGecom Exchanges, vol. 7 (2007), pp. 55-57

  •  

    Restart Schedules for Ensembles of Problem Instances

    Matthew J. Streeter, Daniel Golovin, Stephen F. Smith

    AAAI (2007), pp. 1204-1210

  •  

    Stochastic packing-market planning

    Daniel Golovin

    EC (2007), pp. 172-181

  •  

    Strongly History-Independent Hashing with Applications

    Guy E. Blelloch, Daniel Golovin

    FOCS (2007), pp. 272-282

  •  

    Approximating the k-multicut problem

    Daniel Golovin, Viswanath Nagarajan, Mohit Singh

    SODA (2006), pp. 621-630

  •  

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

    Daniel Golovin, Vineet Goyal, R. Ravi 0001

    STACS (2006), pp. 206-217

  •  

    Quorum placement in networks: minimizing network congestion

    Daniel Golovin, Anupam Gupta, Bruce M. Maggs, Florian Oprea, Michael K. Reiter

    PODC (2006), pp. 16-25