R. Cole, Y. Dodis, T. Roughgarden. The cost of taxes for selfish
routing. To appear, Proceedings of the Fourth Annual Symposium
on Electronic Commerce, 2003. postscript
R. Cole, Y. Dodis, T. Roughgarden. Pricing network edges for heterogeneous selfish users. To appear, Proceedings of the Thirty Fifth Annual ACM Symposium on Theory of Computing, 2003. postscript
R. Cole, R. Hariharan. A fast algorithm for computing Steiner edge connectivity. To appear, Proceedings of the Thirty Fifth Annual ACM Symposium on Theory of Computing, 2003. postscript
R. Cole, R. Hariharan, M. Lewenstein, E. Porat. A faster implementation of the Goemans-Williamson clustering algorithm. Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, 2001, 17-25. abstract postscript
R. Cole, K. Ost, S. Schirra. Edge-Coloring Bipartite Multigraphs in 0(E log D) Time. Combinatorica, 2001, Vol. 21, 5-12. abstract postscript
R. Cole, B. Mishra, J. Schmidt, A. Siegel. On the dynamic finger conjecture for splay trees. Part I: Splay sorting log n block sequences. SIAM Journal on Computing, 2000, Vol. 30, 1-43. abstract postscript
R. Cole. Part II: Finger searching. SIAM Journal on Computing, 2000, Vol. 30, 44-85. abstract postscript
R. Cole, M. Farach, R. Hariharan, T. Przytycka and M. Thorup. An O(n
log n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees.
(Prelimary version appeared in Proceedings of the Seventh Annual ACM-SIAM
Symposium on Discrete Algorithms (SODA), 1996, 323-332. abstract
postscript