|
Daniel Golovin
PhD Candidate
8104 Wean Hall |
I'm currently pursuing a doctorate in computer science at Carnegie Mellon University in the School of Computer Science, under the supervision of Guy Blelloch. I plan to graduate this coming summer, with a thesis on Uniquely Represented Data Structures with Applications to Privacy. Here is my curriculum vitae.
In addition to uniquely represented data structures, I am interested in theoretical computer science broadly and algorithms in particular. This includes online algorithms, approximation algorithms, and combinatorial optimization, among other things. I am also interested in machine learning and algorithmic game theory.
Before coming to CMU for graduate school, I attended Cornell University, and did some research on a few algorithmic questions motivated by economics, under Jon Kleinberg. More on that and some other undergraduate CS research going on at Cornell is briefly described here. I've also worked on some challenging algorithmic problems as an research intern at Amazon.com in Seattle, as well as some interesting planning problems as an intern in the modular robotics lab at the Palo Alto Research Center, (formerly known as Xerox PARC) in beautiful Palo Alto, CA.