Founded in 1966
2006 ACM/SIAM Symposium on Algorithms
January 22-24, 2006
URL

Cake Cutting is Not a Piece of Cake


The press release for the 2006 ACM/SIAM Symposium on Algorithms highlights highlights Professor Pruhs'
paper (with Professor Jeff Edmonds of York University) showing that the classical Even and Paz algorithm for
Fair Division has optimal complexity.

You are using an older browser that does not support current Web standards. Although this site is viewable in all browsers, it will look much better in a browser that supports Web standards.