The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Daniel Golovin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Daniel Golovin, Viswanath Nagarajan, Mohit Singh
    Approximating the k-multicut problem. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:621-630 [Conf]
  3. 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]
  4. Matthew J. Streeter, Daniel Golovin, Stephen F. Smith
    Combining Multiple Heuristics Online. [Citation Graph (0, 0)][DBLP]
    AAAI, 2007, pp:1197-1203 [Conf]
  5. 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]
  6. Daniel Golovin
    Stochastic packing-market planning. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2007, pp:172-181 [Conf]

  7. Strongly History-Independent Hashing with Applications. [Citation Graph (, )][DBLP]


  8. All-Norms and All-L_p-Norms Approximation Algorithms. [Citation Graph (, )][DBLP]


  9. B-Treaps: A Uniquely Represented Alternative to B-Trees. [Citation Graph (, )][DBLP]


  10. Online distributed sensor selection. [Citation Graph (, )][DBLP]


  11. An Online Algorithm for Maximizing Submodular Functions. [Citation Graph (, )][DBLP]


  12. Uniquely Represented Data Structures for Computational Geometry. [Citation Graph (, )][DBLP]


  13. Online Learning of Assignments that Maximize Submodular Functions [Citation Graph (, )][DBLP]


  14. Online Distributed Sensor Selection [Citation Graph (, )][DBLP]


  15. Adaptive Submodularity: A New Approach to Active Learning and Stochastic Optimization [Citation Graph (, )][DBLP]


  16. The B-Skip-List: A Simpler Uniquely Represented Alternative to B-Trees [Citation Graph (, )][DBLP]


Search in 0.092secs, Finished in 0.093secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002