Computability in Anonymous Networks: Revocable vs. Irrecovable Outputs. Emek, Y., Seidel, J., & Wattenhofer, R. In Esparza, J., Fraigniaud, P., Husfeldt, T., & Koutsoupias, E., editors, Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II, volume 8573, of Lecture Notes in Computer Science, pages 183–195, 2014. Springer.
Computability in Anonymous Networks: Revocable vs. Irrecovable Outputs [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/icalp/EmekSW14,
  author    = {Yuval Emek and
               Jochen Seidel and
               Roger Wattenhofer},
  editor    = {Javier Esparza and
               Pierre Fraigniaud and
               Thore Husfeldt and
               Elias Koutsoupias},
  title     = {Computability in Anonymous Networks: Revocable vs. Irrecovable Outputs},
  booktitle = {Automata, Languages, and Programming - 41st International Colloquium,
               {ICALP} 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part
               {II}},
  series    = {Lecture Notes in Computer Science},
  volume    = {8573},
  pages     = {183--195},
  publisher = {Springer},
  year      = {2014},
  url       = {https://doi.org/10.1007/978-3-662-43951-7\_16},
  doi       = {10.1007/978-3-662-43951-7\_16},
  timestamp = {Tue, 14 May 2019 10:00:44 +0200},
  biburl    = {https://dblp.org/rec/conf/icalp/EmekSW14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0