Theory Group

This page is read only. You can view the source, but not change it. Ask your administrator if you think this is wrong.
=== 2007 ===

  * Dana Angluin, James Aspnes, David Eisenstat and [[http://www.cs.yorku.ca/~ruppert|Eric Ruppert]]. The computational power of population protocols. //Distributed Computing//, 20(4), pages 279-304, 2007.

  * [[http://www.cs.yorku.ca/~franck|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.

  * [[http://www.cse.yorku.ca/~massomeh>|Masoomeh Rudafshani]] and [[http://www.cse.yorku.ca/~datta|Suprakash Datta]]. In //Proc. 6th International Conference on Information Processing in Sensor Networks//, pages 51-60, 2007.

  * Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui and [[http://www.cse.yorku.ca/~ruppert|Eric Ruppert]]. Secretive birds:  Privacy in population protocols. In //Proc. 11th International Conference on Principles of Distributed Systems, pages 329-342//, 2007.

  * [[http://www.cs.yorku.ca/~jeff|Jeff Edmonds]].  Embedding into <m>l^2_infty</m> is easy; Embedding into <m>l^3_infty</m> is NP-complete.  In //Proc. 18th ACM-SIAM Symposium on Discrete Algorithms//, pages 522-531, 2007.

  * Faith Ellen, Panagiota Fatourou and [[http://www.cs.yorku.ca/~ruppert|Eric Ruppert]]. Time lower bounds for implementations of multi-writer snapshots. //Journal of the ACM//, 54(6), article 30, 2007.

  * Rachid Guerraoui and [[http://www.cs.yorku.ca/~ruppert|Eric Ruppert]].  Anonymous and fault-tolerant shared-memory computing. //Distributed Computing//, 20(3), pages 165-177, 2007.  

  * [[http://www.cse.yorku.ca/~ruppert|Eric Ruppert]].  The anonymous consensus hierarchy and naming problems. In //Proc. 11th International Conference on Principles of Distributed Systems//, pages 386-400, 2007.