dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Daniel Golovin Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

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

Coauthor Index

1Konstantin Andreev [13]
2Guy E. Blelloch [5] [9]
3Sarah J. Converse [28]
4Federico Echenique [23] [27]
5Matthew Faulkner [19] [21]
6Beth Gardner [28]
7Charles Garrod [13]
8Vineet Goyal [1]
9Anupam Gupta [3] [11]
10Andreas Krause [12] [14] [16] [18] [19] [20] [21] [22] [24] [25] [26] [28]
11Amit Kumar [11]
12Bruce M. Maggs [3] [13]
13Adam Meyerson [13]
14Steve Morey [28]
15Viswanath Nagarajan [2]
16Florian Oprea [3]
17R. Ravi [1]
18Debajyoti Ray [16] [20]
19Michael K. Reiter [3]
20Alex Roper [26]
21Mohit Singh [2]
22Stephen F. Smith [7] [8]
23Matthew J. Streeter [7] [8] [10] [12] [14]
24Kanat Tangwongsan [11]
25Adam Wierman [23] [27]
26Virginia Vassilevska Williams (Virginia Vassilevska) [9]

Colors in the list of coauthors

Last update Wed May 30 22:34:44 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page