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.
=== 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.
 
  * Yehuda Schwartz, [[http://www.cse.yorku.ca/~gt|George Tourlakis]].  On the proof-theory of two formalisations of modal first-order logic.  In //Studia Logica// 96:349-373, 2010.