BibTeX records: Damon Mosk-Aoyama

download as .bib file

@article{DBLP:journals/siamjo/Mosk-AoyamaRS10,
  author       = {Damon Mosk{-}Aoyama and
                  Tim Roughgarden and
                  Devavrat Shah},
  title        = {Fully Distributed Algorithms for Convex Optimization Problems},
  journal      = {{SIAM} J. Optim.},
  volume       = {20},
  number       = {6},
  pages        = {3260--3279},
  year         = {2010},
  url          = {https://doi.org/10.1137/080743706},
  doi          = {10.1137/080743706},
  timestamp    = {Mon, 08 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamjo/Mosk-AoyamaRS10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@phdthesis{DBLP:phd/us/Mosk-Aoyama09,
  author       = {Damon Mosk{-}Aoyama},
  title        = {Convergence to and quality of equilibria in distributed systems},
  school       = {Stanford University, {USA}},
  year         = {2009},
  url          = {https://searchworks.stanford.edu/view/7947077},
  timestamp    = {Fri, 02 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/phd/us/Mosk-Aoyama09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/icalp/Mosk-AoyamaR09,
  author       = {Damon Mosk{-}Aoyama and
                  Tim Roughgarden},
  editor       = {Susanne Albers and
                  Alberto Marchetti{-}Spaccamela and
                  Yossi Matias and
                  Sotiris E. Nikoletseas and
                  Wolfgang Thomas},
  title        = {Worst-Case Efficiency Analysis of Queueing Disciplines},
  booktitle    = {Automata, Languages and Programming, 36th Internatilonal Colloquium,
                  {ICALP} 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part {II}},
  series       = {Lecture Notes in Computer Science},
  volume       = {5556},
  pages        = {546--557},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-02930-1\_45},
  doi          = {10.1007/978-3-642-02930-1\_45},
  timestamp    = {Tue, 14 May 2019 10:00:44 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/Mosk-AoyamaR09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/orl/Mosk-Aoyama08,
  author       = {Damon Mosk{-}Aoyama},
  title        = {Maximum algebraic connectivity augmentation is NP-hard},
  journal      = {Oper. Res. Lett.},
  volume       = {36},
  number       = {6},
  pages        = {677--679},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.orl.2008.09.001},
  doi          = {10.1016/J.ORL.2008.09.001},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/orl/Mosk-Aoyama08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tit/Mosk-AoyamaS08,
  author       = {Damon Mosk{-}Aoyama and
                  Devavrat Shah},
  title        = {Fast Distributed Algorithms for Computing Separable Functions},
  journal      = {{IEEE} Trans. Inf. Theory},
  volume       = {54},
  number       = {7},
  pages        = {2997--3007},
  year         = {2008},
  url          = {https://doi.org/10.1109/TIT.2008.924648},
  doi          = {10.1109/TIT.2008.924648},
  timestamp    = {Tue, 10 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tit/Mosk-AoyamaS08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/wdag/Mosk-AoyamaRS07,
  author       = {Damon Mosk{-}Aoyama and
                  Tim Roughgarden and
                  Devavrat Shah},
  editor       = {Andrzej Pelc},
  title        = {Fully Distributed Algorithms for Convex Optimization Problems},
  booktitle    = {Distributed Computing, 21st International Symposium, {DISC} 2007,
                  Lemesos, Cyprus, September 24-26, 2007, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4731},
  pages        = {492--493},
  publisher    = {Springer},
  year         = {2007},
  url          = {https://doi.org/10.1007/978-3-540-75142-7\_41},
  doi          = {10.1007/978-3-540-75142-7\_41},
  timestamp    = {Tue, 14 May 2019 10:00:54 +0200},
  biburl       = {https://dblp.org/rec/conf/wdag/Mosk-AoyamaRS07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/isit/Mosk-AoyamaS06,
  author       = {Damon Mosk{-}Aoyama and
                  Devavrat Shah},
  title        = {Information Dissemination via Network Coding},
  booktitle    = {Proceedings 2006 {IEEE} International Symposium on Information Theory,
                  {ISIT} 2006, The Westin Seattle, Seattle, Washington, USA, July 9-14,
                  2006},
  pages        = {1748--1752},
  publisher    = {{IEEE}},
  year         = {2006},
  url          = {https://doi.org/10.1109/ISIT.2006.261654},
  doi          = {10.1109/ISIT.2006.261654},
  timestamp    = {Wed, 16 Oct 2019 14:14:48 +0200},
  biburl       = {https://dblp.org/rec/conf/isit/Mosk-AoyamaS06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/podc/Mosk-AoyamaS06,
  author       = {Damon Mosk{-}Aoyama and
                  Devavrat Shah},
  editor       = {Eric Ruppert and
                  Dahlia Malkhi},
  title        = {Computing separable functions via gossip},
  booktitle    = {Proceedings of the Twenty-Fifth Annual {ACM} Symposium on Principles
                  of Distributed Computing, {PODC} 2006, Denver, CO, USA, July 23-26,
                  2006},
  pages        = {113--122},
  publisher    = {{ACM}},
  year         = {2006},
  url          = {https://doi.org/10.1145/1146381.1146401},
  doi          = {10.1145/1146381.1146401},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/podc/Mosk-AoyamaS06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/soda/Mosk-AoyamaY05,
  author       = {Damon Mosk{-}Aoyama and
                  Mihalis Yannakakis},
  title        = {Testing hierarchical systems},
  booktitle    = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January
                  23-25, 2005},
  pages        = {1126--1135},
  publisher    = {{SIAM}},
  year         = {2005},
  url          = {http://dl.acm.org/citation.cfm?id=1070432.1070593},
  timestamp    = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/Mosk-AoyamaY05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-cs-0504029,
  author       = {Damon Mosk{-}Aoyama and
                  Devavrat Shah},
  title        = {Fast Distributed Algorithms for Computing Separable Functions},
  journal      = {CoRR},
  volume       = {abs/cs/0504029},
  year         = {2005},
  url          = {http://arxiv.org/abs/cs/0504029},
  eprinttype    = {arXiv},
  eprint       = {cs/0504029},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-cs-0504029.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.