My esteemed coauthors

Selected Publications

  1. Adaptive Submodularity: Theory and Applications in Active Learning and Stochastic Optimization.
    Daniel Golovin and Andreas Krause. JAIR 2011.
    Winner of the 2013 IJCAI-JAIR Best Paper Prize [Toggle Abstract]
  2. An Online Algorithm for Maximizing Submodular Functions.
    Matthew Streeter and Daniel Golovin. NIPS 2008. [Toggle Abstract]
  3. Near-Optimal Bayesian Active Learning with Noisy Observations
    Daniel Golovin, Andreas Krause, and Debajyoti Ray. NIPS 2010. [Toggle Abstract]
  4. A Revealed Preference Approach to Computational Complexity in Economics.
    Federico Echenique, Daniel Golovin, and Adam Wierman. Working Paper, 2010. [Toggle Abstract]
  5. Strongly History-Independent Hashing with Applications.
    Guy Blelloch and Daniel Golovin. FOCS 2007. [Toggle Abstract]

Publications (reverse chronological order)

Papers I've published at Google can be found on my Google research page.
  1. Submodular Function Maximization. With Andreas Krause.
    Book chapter in Tractability: Practical Approaches to Hard Problems (To appear) .
    [Toggle Abstract]
  2. Dynamic Resource Allocation in Conservation Planning. With Andreas Krause and Beth Gardner and
    Sarah J. Converse and Steve Morey. AAAI 2011. (Outstanding Paper Award)
    [BibTeX]. [Toggle Abstract]
  3. Randomized Sensing in Adversarial Environments. With Andreas Krause and Alex Roper. IJCAI 2011.
    [BibTeX]. [Toggle Abstract]
  4. Adaptive Submodularity: Theory and Applications in Active Learning and Stochastic Optimization.
    Daniel Golovin and Andreas Krause. JAIR 2011.
    Winner of the 2013 IJCAI-JAIR Best Paper Prize
    There is also an earlier arXiv version and an even earlier COLT 2010 conference version. I recommend the JAIR version. [BibTeX], [video of a related invited talk], [Slides], [Toggle Abstract]
  5. Adaptive Submodular Optimization under Matroid Constraints. With Andreas Krause. Preprint on arXiv.
    [BibTeX]. [Toggle Abstract]
  6. Near-Optimal Bayesian Active Learning with Noisy Observations. With Debajyoti Ray and Andreas Krause. NIPS 2010. A longer version is available on arXiv. [BibTeX], [Poster], [video of a related invited talk]. [Toggle Abstract]
  7. A Revealed Preference Approach to Computational Complexity in Economics. With Federico Echenique and Adam Wierman. Working Paper SSWP-1333, 2010. [Toggle Abstract]
  8. The B-Skip-List: A Simpler Uniquely Represented Alternative to B-Trees. Working paper, 2010.
    Available as a preprint on arXiv. [BibTeX]. [Toggle Abstract]
  9. Online Distributed Sensor Selection. With Matthew Faulkner and Andreas Krause. IPSN 2010.
    A more detailed technical report version is available on arXiv. [BibTeX]. [Toggle Abstract]
  10. Online Learning of Assignments. With Matthew Streeter and Andreas Krause. NIPS 2009 (A NIPS Spotlight Paper).
    A more detailed technical report version is available on arXiv. [BibTeX]. [Toggle Abstract]
  11. B-Treaps: A Uniquely Represented Alternative to B-Trees. ICALP 2009. [BibTeX]. [Toggle Abstract]
  12. Simultaneous Source Location. With Konstantin Andreev, Charles Garrod, Bruce Maggs, and Adam Meyerson. TALG 2009. [BibTeX]. [Toggle Abstract]
  13. An Online Algorithm for Maximizing Submodular Functions. With Matthew Streeter. NIPS 2008 (A NIPS Spotlight Paper). A more detailed technical report version is available as well. [BibTeX]. [Toggle Abstract]
  14. All-Norms and All-L_p-Norms Approximation Algorithms. With Anupam Gupta, Amit Kumar, and Kanat Tangwongsan. FSTTCS 2008. A more detailed technical report version is available as well. [BibTeX]. [Toggle Abstract]
  15. My PhD thesis on Uniquely Represented Data Structures with Applications to Privacy, [Abstract, BibTeX]. [Toggle Abstract]
  16. Uniquely Represented Data Structures for Computational Geometry. With Guy Blelloch and Virginia Vassilevska Williams. SWAT 2008. A more detailed technical report version is available as well. [BibTeX]. [Toggle Abstract]
  17. Strongly History-Independent Hashing with Applications. With Guy Blelloch. FOCS 2007. [BibTeX], [pdf slides], [slides handout]. [Toggle Abstract]
    Strongly History Independent Hashing with Deletion. With Guy Blelloch. Tech Report CMU-CS-06-156. [BibTeX]. [Toggle Abstract]
  18. Combining Multiple Heuristics Online. With Matthew Streeter and Stephen F. Smith. AAAI 2007. [BibTeX]. [Toggle Abstract]
  19. Restart Schedules for Ensembles of Problem Instances. With Matthew Streeter and Stephen F. Smith. AAAI 2007. [BibTeX]. [Toggle Abstract]
  20. Combining Multiple Constraint Solvers: Results on the CPAI '06 Competition Data. With Matthew Streeter and Stephen F. Smith. Invited Paper, 2nd International CSP Solver Competition. [BibTeX]. (Download the full proceedings [PDF]).
    [Toggle Abstract]
  21. Stochastic Packing-Market Planning. EC 2007. [BibTeX], [pdf slides]. [Toggle Abstract]
  22. Quorum Placement in Networks: Minimizing Network Congestion. With Anupam Gupta, Bruce M. Maggs, Florian Oprea, and Michael K. Reiter. PODC 2006. [BibTeX]. [Toggle Abstract]
  23. Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems. With Vineet Goyal and R. Ravi. STACS 2006. [BibTeX]. [Toggle Abstract]
  24. Approximating the k-Multicut Problem. With Viswanath Nagarajan and Mohit Singh. SODA 2006. [BibTeX]. [Toggle Abstract]
  25. Max-Min Fair Allocation of Indivisible Goods. Tech Report CMU-CS-05-144. [BibTeX]. [Toggle Abstract]
  26. A Model for Optimal Path Planning for Self-Reconfigurable Robots, ICAR 2003. [Toggle Abstract]

Copyright Notices

The ACM copyright notice:

The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Copyright for STACS submissions is held by Springer-Verlag. These submissions can also be found via the LNCS series homepage