Damon Mosk-Aoyama

I am a former Ph.D. student in the Department of Computer Science at Stanford University. My research interests include distributed computation, graph algorithms, and approximation algorithms.

Papers

• Damon Mosk-Aoyama and Tim Roughgarden
  Worst-Case Efficiency Analysis of Queueing Disciplines
  ICALP 2009 (PS, PDF)
• Damon Mosk-Aoyama
  Maximum Algebraic Connectivity Augmentation is NP-Hard
  Operations Research Letters, November 2008 (PS, PDF)
• Damon Mosk-Aoyama, Tim Roughgarden, and Devavrat Shah
  Fully Distributed Algorithms for Convex Optimization Problems
  SIAM Journal on Optimization, 2010 (PDF)
  Brief announcement: DISC 2007 (PS, PDF)
• Damon Mosk-Aoyama and Devavrat Shah
  Fast Distributed Algorithms for Computing Separable Functions
  IEEE Transactions on Information Theory, July 2008 (PS, PDF)
  Conference version: Computing Separable Functions via Gossip, PODC 2006 (PS, PDF)
• Damon Mosk-Aoyama and Devavrat Shah
  Information Dissemination via Network Coding
  ISIT 2006 (PS, PDF)
• Damon Mosk-Aoyama and Mihalis Yannakakis
  Testing Hierarchical Systems
  SODA 2005 (PS, PDF)

Theses

• Damon Mosk-Aoyama
  Convergence to and Quality of Equilibria in Distributed Systems
  Ph.D. thesis, Department of Computer Science, Stanford University, December 2008
  (PS, PDF)
• Damon Mosk-Aoyama
  A Computational Exploration of Rounding Algorithms for the Multiway Cut Problem
  M.Eng. thesis, Department of Electrical Engineering and Computer Science, MIT, May 2002
  (PS, PDF)

Last updated: February 12, 2011