Skip Navigation
York U: Redefine the PossibleHOME | Current Students | Faculty & Staff | Research | International
Search »FacultiesLibrariesCampus MapsYork U OrganizationDirectorySite Index
Future Students, Alumni & Visitors
2007

2007

  • Dana Angluin, James Aspnes, David Eisenstat and Eric Ruppert. The computational power of population protocols. Distributed Computing, 20(4), pages 279-304, 2007.
  • Franck van Breugel, Claudio Hermida, Michael Makkai and James Worrell. Recursively defined metric spaces without contraction. Theoretical Computer Science, 380(1-2), pages 143-163, 2007.
  • Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui and Eric Ruppert. Secretive birds: Privacy in population protocols. In Proc. 11th International Conference on Principles of Distributed Systems, pages 329-342, 2007.
  • Jeff Edmonds. Embedding into l^2_infty is easy; Embedding into l^3_infty is NP-complete. In Proc. 18th ACM-SIAM Symposium on Discrete Algorithms, pages 522-531, 2007.
  • Faith Ellen, Panagiota Fatourou and Eric Ruppert. Time lower bounds for implementations of multi-writer snapshots. Journal of the ACM, 54(6), article 30, 2007.
  • Rachid Guerraoui and Eric Ruppert. Anonymous and fault-tolerant shared-memory computing. Distributed Computing, 20(3), pages 165-177, 2007.
  • Eric Ruppert. The anonymous consensus hierarchy and naming problems. In Proc. 11th International Conference on Principles of Distributed Systems, pages 386-400, 2007.
Last modified:
2014/08/19 11:55