Hagit Attiya, Rachid Guerraoui and Eric Ruppert. Partial snapshot objects. In Proc. 20th ACM Symposium on parallelism in Algorithms and Architectures, pages 336-343, 2008.
Franck van Breugel, Babita Sharma and James Worrell. Approximating a behavioural pseudometric without discount. Logical Methods in Computer Science, 4(2:2), 2008.
Jeff Edmonds. How to Think About Algorithms. Cambridge University Press, 2008.
Jeff Edmonds, Kirk Pruhs and Jaisingh Solanki. Confidently cutting a cake into approximately fair pieces. In Proc. Conference on Algorithmic Aspects in Information and Management, 2008.
Faith Ellen, Panagiota Fatourou and Eric Ruppert. The space complexity of unbounded timestamps. Distributed Computing, 21(2), pages 103-115, 2008.
Stuart MacLean and Suprakash Datta. A lower bound on range-free node localization algorithms. In Proc. IEEE International Symposium on Wireless Communication Systems, pages 628-632, 2008.
Jeff Edmonds. Embedding into <m>l^2_infty</m> is easy; Embedding into <m>l^3_infty</m> is NP-complete. In Discrete and Computational Geometry, pages 747-765 2008.
Jeff Edmonds. Scheduling with Equipartition; in Encyclopedia of Algorithms, Springer, Editor Ming-Yang Kao, 2008.