2010
This is an old revision of the document!
2010
- S. Chakraborty and 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.
- Suprakash Datta, Patrick Dymond and Jeff Edmonds. TCP is competitive with Resource Augmentation (against a limited adversary). In Theory of Computing Systems, Vol 47 pp.~174-183, 2010.
- 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, Eric Ruppert and Franck van Breugel. Non-blocking binary search trees. In Proc. 29th ACM Symposium on Principles of Distributed Computing, 2010.
2010.1408463838.txt.gz · Last modified: 2014/08/19 15:57 by ruppert