Daniel Moeller

I am a PhD student working in theoretical Computer Science at the University of California-San Diego. My advisor is Mohan Paturi. My current research focuses on structured stable marriage problems. I have also done work on competition in Social Networks.

I earned my M.S. in Computer Science from UCSD in 2013 and my B.S. in Honors Mathematics from the University of Notre Dame in 2010.

When not doing research I enjoy ultimate frisbee, volleyball, basketball, and surfing.

Hoffman, Moshe, Daniel Moeller, and Ramamohan Paturi. "Jealousy graphs: Structure and complexity of decentralized stable matching." International Conference on Web and Internet Economics. Springer Berlin Heidelberg, 2013.

Moeller, Daniel, Ramamohan Paturi, and Stefan Schneider. "Subquadratic Algorithms for Succinct Stable Matching." International Computer Science Symposium in Russia. Springer International Publishing, 2016.