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

This shows you the differences between two versions of the page.

2010 [2014/08/19 11:57] (current)
ruppert created
Line 1: Line 1:
 +=== 2010 ===
 +
 +  * S. Chakraborty and [[http://www.cse.yorku.ca/~jeff|Jeff Edmonds]], Bounding Variance and Expectation of Longest Path Lengths in DAGs from Variance and Expectation of Edge Lengths, In //SODA, ACM Symp. on Discrete Algorithms//, 2010.
 +
 +  * [[http://www.cs.yorku.ca/~datta|Suprakash Datta]], [[http://www.cs.yorku.ca/~dymond|Patrick Dymond]] and [[http://www.cs.yorku.ca/~jeff|Jeff Edmonds]].  TCP is competitive with Resource Augmentation (against a limited adversary).  In //Theory of Computing
 + Systems//, Vol 47 pp.~174-183, 2010.
 +
 +  * [[http://www.cse.yorku.ca/~jeff|Jeff Edmonds]], A. Sidiropoulos, and A. Zouzias, Hardness of Embedding into <m>R^2</m> with Constant Distortion, In //SODA, ACM Symp. on Discrete Algorithms//, 2010.
 +
 +  * Faith Ellen, Panagiota Fatourou, [[http://www.cse.yorku.ca/~ruppert|Eric Ruppert]] and [[http://www.cse.yorku.ca/~franck|Franck van Breugel]].  Non-blocking binary search trees.  In //Proc. 29th ACM Symposium on Principles of Distributed Computing//, 2010.
 +
 +
Last modified:
2014/08/19 11:57