| |
| 2008 | ||
|---|---|---|
| 6 | EE | Damon Mosk-Aoyama, Devavrat Shah: Fast Distributed Algorithms for Computing Separable Functions. IEEE Transactions on Information Theory 54(7): 2997-3007 (2008) |
| 5 | EE | Damon Mosk-Aoyama: Maximum algebraic connectivity augmentation is NP-hard. Oper. Res. Lett. 36(6): 677-679 (2008) |
| 2007 | ||
| 4 | EE | Damon Mosk-Aoyama, Tim Roughgarden, Devavrat Shah: Fully Distributed Algorithms for Convex Optimization Problems. DISC 2007: 492-493 |
| 2006 | ||
| 3 | EE | Damon Mosk-Aoyama, Devavrat Shah: Computing separable functions via gossip. PODC 2006: 113-122 |
| 2005 | ||
| 2 | EE | Damon Mosk-Aoyama, Mihalis Yannakakis: Testing hierarchical systems. SODA 2005: 1126-1135 |
| 1 | EE | Damon Mosk-Aoyama, Devavrat Shah: Fast Distributed Algorithms for Computing Separable Functions CoRR abs/cs/0504029: (2005) |
| 1 | Tim Roughgarden | [4] |
| 2 | Devavrat Shah | [1] [3] [4] [6] |
| 3 | Mihalis Yannakakis | [2] |