Differences

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

--- 2010-2014 [2023/12/14 19:26] – created eruppert
+++ 2010-2014 [2023/12/14 19:27] (current) – eruppert
@@ Line 71: / Line 71: @@
   * Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Anne-Marie Kermarrec, [[http://www.cse.yorku.ca/~ruppert|Eric Ruppert]] and Hung Tran-The.  Byzantine Agreement with Homonyms.  In //Proc. 30th ACM Symposium on Principles of Distribued Computing//, pages 21-30, 2011.
-  * [[http://www.cse.yorku.ca/~jeff|Jeff Edmonds]], Sungjin Im, Benjamin Moseley. Online scalable scheduling for the <m>l_k</m>-norms of flow time without conservation of work. In //Proc. ACM-SIAM Symposium on Discrete Algorithms//, 2011.
+  * [[http://www.cse.yorku.ca/~jeff|Jeff Edmonds]], Sungjin Im, Benjamin Moseley. Online scalable scheduling for the l_k-norms of flow time without conservation of work. In //Proc. ACM-SIAM Symposium on Discrete Algorithms//, 2011.
   * [[http://www.cse.yorku.ca/~jeff|Jeff Edmonds]], Kirk Pruhs. Cake cutting really is not a piece of cake. //ACM Transactions on Algorithms//, 7(4): 51, 2011.
@@ Line 92: / Line 92: @@
  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.
+  * [[http://www.cse.yorku.ca/~jeff|Jeff Edmonds]], A. Sidiropoulos, and A. Zouzias, Hardness of Embedding into R^2 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.