Daniel Golovin Postdoctoral Fellow Center for the Mathematics of Information Information Science and Technology Program California Institute of Technology 114 Annenberg Center (626) 395-1762 Additional Contact Info

I am a postdoctoral fellow in Caltech's Center for the Mathematics of Information. My current research focus is on online and approximation algorithms for machine learning and optimization. Ultimately I am interested in creating algorithms that provide principled solutions to important problems, whether in scheduling, machine learning, ecommerce, or other domains. Here are my (slightly dated) curriculum vitae. and research statement for the curious.

Before coming to Caltech, I obtained a doctorate in computer science at Carnegie Mellon University in 2008, under the supervision of Guy Blelloch, with a thesis on Uniquely Represented Data Structures with Applications to Privacy, and worked an additional year at Carnegie Mellon as a postdoctoral fellow in the Center for Computational Thinking. In the fall of 2008 I taught 15-853: Algorithms in the "Real World" with Guy Blelloch.

Prior to 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.