
Uniquely Represented Data Structures with Applications to Privacy
.
Summary
@phdthesis{golovin08,
author = {Daniel Golovin},
title = {Uniquely Represented Data Structures with Applications to Privacy},
school = {Carnegie Mellon University},
address = {Pittsburgh, PA},
year = {2008},
month = {August},
note = {Available as Technical Report CMUCS08135}
}

Dynamic Resource Allocation in Conservation Planning.
Summary
@inproceedings{aaai2011,
author = {Daniel Golovin and Andreas Krause and Beth Gardner
and Sarah J. Converse and Steve Morey},
title = {Dynamic Resource Allocation in Conservation Planning},
booktitle = {AAAI '07: Proceedings of the TwentySecond AAAI },
year = {2011},
pages = {},
note = {To appear},
}

Randomized Sensing in Adversarial Environments.
Summary
@inproceedings{ijcai2011,
author = {Andreas Krause and Alex Roper and Daniel Golovin},
title = {Randomized Sensing in Adversarial Environments},
booktitle = {Proceedings of the 22nd International Joint Conference
on Artificial Intelligence},
year = {2011},
pages = {},
note = {To appear},
}

Adaptive Submodular Optimization under Matroid Constraints.
Summary
@article{matroid2011_arxiv,
author = {Daniel Golovin and Andreas Krause},
title = {Adaptive Submodular Optimization under Matroid Constraints},
journal = {CoRR},
volume = {abs/1101.4450},
year = {2011},
ee = {http://arxiv.org/abs/1101.4450},
}

NearOptimal Bayesian Active Learning with Noisy Observations.
Summary
@incollection{NIPS2010_1100,
title = {NearOptimal Bayesian Active Learning with Noisy Observations},
author = {Daniel Golovin and Andreas Krause and Debajyoti Ray},
booktitle = {Advances in Neural Information Processing Systems 23},
editor = {J. Lafferty and C. K. I. Williams and J. ShaweTaylor and R.S. Zemel and A. Culotta},
pages = {766774},
year = {2010}
}

Adaptive Submodularity: Theory and Applications in Active Learning and Stochastic Optimization.
Summary
@article{jair2011,
author = {Daniel Golovin and Andreas Krause},
title = {Adaptive Submodularity: Theory and Applications in
Active Learning and Stochastic Optimization},
journal = {Journal of Artificial Intelligence Research (JAIR)},
volume = {42},
year = {2011},
pages = {427486},
ee = {http://dx.doi.org/10.1613/jair.3278},
}

Adaptive Submodularity: A New Approach to Active Learning and Stochastic Optimization.
Summary
@inproceedings{colt2010,
author = {Daniel Golovin and Andreas Krause},
title = {Adaptive Submodularity: A New Approach to Active Learning
and Stochastic Optimization},
booktitle = {23rd Annual Conference on Learning Theory},
year = {2010},
location = {Haifa, Israel},
pages = {333345},
}

Online Distributed Sensor Selection.
Summary
@inproceedings{ipsn2010,
author={Daniel Golovin and Matthew Faulkner and Andreas Krause},
title={Online Distributed Sensor Selection},
booktitle={Proc. of the 9th International Symposium on
Information Processing in Sensor Networks (IPSN'10)},
month={April},
year={2010},
location = {Stockholm, Sweden},
pages = {220231},
}

Online Learning of Assignments
.
Summary
@incollection{NIPS2009_0421,
title = {Online Learning of Assignments},
author = {Matthew Streeter and Daniel Golovin and Andreas Krause},
booktitle = {Advances in Neural Information Processing Systems 22},
editor = {Y. Bengio and D. Schuurmans and J. Lafferty and C. K. I. Williams and A. Culotta},
pages = {17941802},
year = {2009}
}

The BSkipList: A Simpler Uniquely Represented Alternative to BTrees.
Summary
@article{bskiplist,
author = {Daniel Golovin},
title = {The {B}SkipList: A Simpler Uniquely Represented Alternative
to {B}Trees},
journal = {CoRR},
volume = {abs/1005.0662},
year = {2010},
ee = {http://arxiv.org/abs/1005.0662},
bibsource = {DBLP, http://dblp.unitrier.de}
}

BTreaps: A Uniquely Represented Alternative to BTrees
.
Summary
@inproceedings{btreap,
author = {Daniel Golovin},
title = {BTreaps: A Uniquely Represented Alternative to BTrees},
booktitle = {ICALP '09: Proceedings of the 36th International Colloquium
on Automata, Languages and Programming},
year = {2009},
isbn = {9783642029264},
pages = {487499},
location = {Rhodes, Greece},
doi = {http://dx.doi.org/10.1007/9783642029271_41},
publisher = {SpringerVerlag},
address = {Berlin, Heidelberg},
}

Simultaneous Source Location
.
Summary
@article{ssl,
author = {Konstantin Andreev and
Charles Garrod and
Daniel Golovin and
Bruce M. Maggs and
Adam Meyerson},
title = {Simultaneous source location},
journal = {ACM Transactions on Algorithms},
volume = {6},
number = {1},
year = {2009},
pages = {117},
issn = {15496325},
doi = {http://doi.acm.org/10.1145/1644015.1644031},
publisher = {ACM},
address = {New York, NY, USA},
}

Uniquely Represented Data Structures for Computational Geometry
.
Summary
@inproceedings{urcg,
author = {Guy E. Blelloch and
Daniel Golovin and
Virginia Vassilevska},
title = {Uniquely Represented Data Structures for Computational Geometry},
booktitle = {{SWAT} '08: Proceedings of the 11th Scandinavian Workshop on Algorithm Theory},
year = {2008},
pages = {1728},
publisher = "Springer",
address = {Gothenburg, Sweden},
month = {July},
}
@techreport{BGV_techreport,
author = {Guy E. Blelloch and Daniel Golovin and Virginia Vassilevska},
title = {Uniquely Represented Data Structures for Computational Geometry},
institution = {Carnegie Mellon University},
year = {2008},
month = {April},
number = {CMUCS08115}
}

An Online Algorithm for Maximizing Submodular Functions
.
Summary
@incollection{NIPS2008_0729,
title = {An Online Algorithm for Maximizing Submodular Functions},
author = {Matthew Streeter and Daniel Golovin},
booktitle = {Advances in Neural Information Processing Systems 21},
editor = {D. Koller and D. Schuurmans and Y. Bengio and L. Bottou},
pages = {15771584},
year = {2008}
}
As it appears on DBLP:

@inproceedings{DBLP:conf/nips/StreeterG08,
author = {Matthew J. Streeter and
Daniel Golovin},
title = {An Online Algorithm for Maximizing Submodular Functions},
booktitle = {NIPS},
year = {2008},
pages = {15771584},
ee = {http://books.nips.cc/papers/files/nips21/NIPS2008_0729.pdf},
crossref = {DBLP:conf/nips/2008},
bibsource = {DBLP, http://dblp.unitrier.de}
}
@proceedings{DBLP:conf/nips/2008,
editor = {Daphne Koller and
Dale Schuurmans and
Yoshua Bengio and
L{\'e}on Bottou},
title = {Advances in Neural Information Processing Systems 21, Proceedings
of the TwentySecond Annual Conference on Neural Information
Processing Systems, Vancouver, British Columbia, Canada,
December 811, 2008},
booktitle = {NIPS},
publisher = {MIT Press},
year = {2009},
bibsource = {DBLP, http://dblp.unitrier.de}
}
The Technical Report Version:

@techreport{submod,
author = {Matthew Streeter and Daniel Golovin},
title = {An Online Algorithm for Maximizing Submodular Functions},
institution = {School of Computer Science, Carnegie Mellon University},
year = {2007},
month = {December},
number = {CMUCS07171},
}

AllNorms and AllL_{p}Norms Approximation
Algorithms.
Summary
@inproceedings{allnorms,
author ={Daniel Golovin and Anupam Gupta and Amit Kumar and Kanat Tangwongsan},
title ={AllNorms and AllL_pNorms Approximation Algorithms},
booktitle ={IARCS Annual Conference on Foundations of Software Technology
and Theoretical Computer Science (FSTTCS 2008)},
year ={2008},
editor ={Ramesh Hariharan and Madhavan Mukund and V Vinay},
publisher ={Schloss Dagstuhl  LeibnizZentrum fuer Informatik, Germany},
address ={Dagstuhl, Germany},
}
@techreport{allnormsTR,
author = {Daniel Golovin and Anupam Gupta and Amit Kumar and Kanat Tangwongsan},
title = {{AllNorms} and {All$L_p$Norms} Approximation Algorithms},
institution = {School of Computer Science, Carnegie Mellon University},
year = {2007},
month = {September},
number = {CMUCS07153},
}

Strongly History Independent Hashing with Applications.
Summary
@inproceedings{FOCS_SHI,
title={Strongly HistoryIndependent Hashing with Applications},
author={Guy E. Blelloch and Daniel Golovin},
booktitle = {48th Annual IEEE Symposium on Foundations of Computer Science},
pages={272282},
year=2007,
month=Oct,
publisher={IEEE},
}

Strongly History Independent Hashing with Deletion.
Summary
@techreport{SHI,
author = {Guy E. Blelloch and Daniel Golovin},
title = {Strongly History Independent Hashing with Deletion},
institution = {School of Computer Science, Carnegie Mellon University},
year = {2006},
month = {October},
number = {CMUCS06156},
}

Combining Multiple Heuristics Online.
Summary
@InProceedings{aaai07a,
author = {Matthew Streeter and Daniel Golovin and Stephen F. Smith},
title = {Combining Multiple Heuristics Online},
booktitle = {AAAI '07: Proceedings of the TwentySecond AAAI
Conference on Artificial Intelligence},
pages = {11971203},
year = {2007},
isbn = {9781577353232},
location = {Vancouver, British Columbia},
address = {Menlo Park, California},
publisher = {AAAI Press},
}

Combining Multiple Constraint Solvers: Results on the CPAI '06 Competition Data.
Summary
@InProceedings{cpai06,
author = {Matthew Streeter and Daniel Golovin and Stephen F. Smith},
title = {Combining Multiple Constraint Solvers: Results on the
{CPAI'06} Competition Data},
booktitle = {Proceedings of the Second International CSP Solver
Competition},
year = {2008},
pages = {1118},
}

Restart Schedules for Ensembles of Problem Instances.
Summary
@InProceedings{aaai07b,
author = {Matthew Streeter and Daniel Golovin and Stephen F. Smith},
title = {Restart Schedules for Ensembles of Problem Instances},
booktitle = {AAAI '07: Proceedings of the TwentySecond AAAI
Conference on Artificial Intelligence},
pages = {12041210},
year = {2007},
isbn = {9781577353232},
location = {Vancouver, British Columbia},
address = {Menlo Park, California},
publisher = {AAAI Press},
}

Stochastic PackingMarket Planning.
Summary
@inproceedings{SPMP,
author = {Daniel Golovin},
title = {Stochastic packingmarket planning},
booktitle = {EC '07: Proceedings of the 8th ACM conference on Electronic commerce},
year = {2007},
isbn = {9781595936530},
pages = {172181},
location = {San Diego, California, USA},
doi = {http://doi.acm.org/10.1145/1250910.1250936},
publisher = {ACM Press},
address = {New York, NY, USA},
}

Quorum Placement in Networks: Minimizing Network Congestion.
Summary
@inproceedings{quorums,
author = {Daniel Golovin and Anupam Gupta and Bruce M. Maggs
and Florian Oprea and Michael K. Reiter},
title = {Quorum placement in networks: minimizing network congestion},
booktitle = {PODC '06: Proceedings of the twentyfifth annual ACM
symposium on Principles of distributed computing},
year = {2006},
isbn = {1595933840},
pages = {1625},
location = {Denver, Colorado, USA},
doi = {http://doi.acm.org/10.1145/1146381.1146388},
publisher = {ACM Press},
address = {New York, NY, USA},
}

Pay Today for a Rainy Day: Improved Approximation Algorithms for DemandRobust
MinCut and Shortest Path Problems.
Summary
@inproceedings{robustcut,
author = {Daniel Golovin and Vineet Goyal and R. Ravi},
title = {Pay Today for a Rainy Day: Improved Approximation Algorithms
for DemandRobust MinCut and Shortest Path Problems},
booktitle = {Proceedings of the 23rd Symposium on
Theoretical Aspects of Computer Science, STACS 2006},
editor = {B. Durand and W. Thomas},
publisher = {SpringerVerlag},
series = {Lecture Notes in Computer Science},
volume = {3884},
year = {2006},
pages = {206217}
}

Approximating the kMulticut Problem.
Summary
@inproceedings{kmulticut,
author = {Daniel Golovin and Viswanath Nagarajan and Mohit Singh},
title = {Approximating the kMulticut Problem},
booktitle = {SODA '06: Proceedings of the seventeenth annual
ACMSIAM Symposium on Discrete Algorithms},
year = {2006},
isbn = {0898716055},
pages = {621630},
location = {Miami, Florida},
doi = {http://doi.acm.org/10.1145/1109557.1109625},
publisher = {ACM Press},
address = {New York, NY, USA},
}

MaxMin Fair Allocation of Indivisible Goods.
Summary
@techreport{TR05,
author = {Daniel Golovin},
title = {MaxMin Fair Allocation of Indivisible Goods},
institution = {School of Computer Science, Carnegie Mellon University},
year = {2005},
month = {June},
number = {CMUCS05144},
}