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


  • James Aspnes, Faith Ellen Fich and Eric Ruppert. Relationships between broadcast and shared memory in reliable anonymous distributed systems. Distributed Computing, 18(3), pages 209-219, 2006.
  • Franck van Breugel and James Worrell. Approximating and computing behavioural distances in probabilistic transition systems. Theoretical Computer Science, 360(1-3), pages 373-385, 2006.
  • Sashka Davis, Jeff Edmonds and Russell Impagliazzo. Online algorithms to minimize resource reallocations and network communication. In Proc. 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, pages 104-115, 2006.
  • Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui and Eric Ruppert. When birds die: Making population protocols fault-tolerant. In Proc. IEEE International Conference on Distributed Computing in Sensor Systems, pages 51-66, 2006.
  • Jeff Edmonds and Kirk Pruhs. Balanced allocations of cake. In Proc. 47th IEEE Symposium on Foundations of Computer Science, pages 623-634, 2006.
  • Jeff Edmonds and Kirk Pruhs. Cake cutting really is not a piece of cake. In Proc. 17th ACM-SIAM Symposium on Discrete Algorithms, pages 271-278, 2006.
  • Panagiota Fatourou, Faith Ellen Fich and Eric Ruppert. Time-space tradeoffs for implementations of snapshots. In Proc. 38th ACM Symposium on Theory of Computing, pages 169-178, 2006.
  • Francisco Kibedi and George Tourlakis. A modal extension of weak generalisation predicate logic. Logic Journal of the IGPL, 14(4), pages 591-621, 2006.
Last modified:
2010/06/12 11:55