Damon Mosk-Aoyama

According to our database, Damon Mosk-Aoyama authored at least 8 papers between 2005 and 2010.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2010

Fully Distributed Algorithms for Convex Optimization Problems.

Damon Mosk-Aoyama, Tim Roughgarden, Devavrat Shah

SIAM J. Optim., 2010

2009

Convergence to and quality of equilibria in distributed systems.

Damon Mosk-Aoyama

PhD thesis, 2009

Worst-Case Efficiency Analysis of Queueing Disciplines.

Damon Mosk-Aoyama, Tim Roughgarden

Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

2008

Fast Distributed Algorithms for Computing Separable Functions.

Damon Mosk-Aoyama, Devavrat Shah

IEEE Trans. Inf. Theory, 2008

Maximum algebraic connectivity augmentation is NP-hard.

Damon Mosk-Aoyama

Oper. Res. Lett., 2008

2006

Computing separable functions via gossip.

Damon Mosk-Aoyama, Devavrat Shah

Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

Information Dissemination via Network Coding.

Damon Mosk-Aoyama, Devavrat Shah

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005

Testing hierarchical systems.

Damon Mosk-Aoyama, Mihalis Yannakakis

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005