|
Search the dblp DataBase
Daniel Golovin:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Daniel Golovin, Anupam Gupta, Bruce M. Maggs, Florian Oprea, Michael K. Reiter
Quorum placement in networks: minimizing network congestion. [Citation Graph (0, 0)][DBLP] PODC, 2006, pp:16-25 [Conf]
- Daniel Golovin, Viswanath Nagarajan, Mohit Singh
Approximating the k-multicut problem. [Citation Graph (0, 0)][DBLP] SODA, 2006, pp:621-630 [Conf]
- Daniel Golovin, Vineet Goyal, R. Ravi
Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems. [Citation Graph (0, 0)][DBLP] STACS, 2006, pp:206-217 [Conf]
- Matthew J. Streeter, Daniel Golovin, Stephen F. Smith
Combining Multiple Heuristics Online. [Citation Graph (0, 0)][DBLP] AAAI, 2007, pp:1197-1203 [Conf]
- Matthew J. Streeter, Daniel Golovin, Stephen F. Smith
Restart Schedules for Ensembles of Problem Instances. [Citation Graph (0, 0)][DBLP] AAAI, 2007, pp:1204-1210 [Conf]
- Daniel Golovin
Stochastic packing-market planning. [Citation Graph (0, 0)][DBLP] ACM Conference on Electronic Commerce, 2007, pp:172-181 [Conf]
Strongly History-Independent Hashing with Applications. [Citation Graph (, )][DBLP]
All-Norms and All-L_p-Norms Approximation Algorithms. [Citation Graph (, )][DBLP]
B-Treaps: A Uniquely Represented Alternative to B-Trees. [Citation Graph (, )][DBLP]
Online distributed sensor selection. [Citation Graph (, )][DBLP]
An Online Algorithm for Maximizing Submodular Functions. [Citation Graph (, )][DBLP]
Uniquely Represented Data Structures for Computational Geometry. [Citation Graph (, )][DBLP]
Online Learning of Assignments that Maximize Submodular Functions [Citation Graph (, )][DBLP]
Online Distributed Sensor Selection [Citation Graph (, )][DBLP]
Adaptive Submodularity: A New Approach to Active Learning and Stochastic Optimization [Citation Graph (, )][DBLP]
The B-Skip-List: A Simpler Uniquely Represented Alternative to B-Trees [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
|