|
Professor of Computer Science
Ph.D., 1982 (Computer Science), Cornell; MS, 1980 (Computer Science), Cornell; BA, 1978 (Mathematics), Oxford University
Email:
Personal Homepage: http://www.cs.nyu.edu/cs/faculty/cole/
Research Interests: Algorithmics, string and pattern matching, approximate algorithms, algorithmic game theory.
Fellowships/Honors: Guggenheim fellow, 1988/89, ACM fellow, 1998-present.
Selected Works:
R. Cole. Slowing down sorting networks to obtain faster sorting algorithms. J. ACM 34(1987), 200-208.
R. Cole. Parallel merge sort. SIAM J. on Computing, 17(1988), 770-785.
R. Cole. Tight bounds on the complexity of the Boyer-Moore string matching algorithm. SIAM J. on Computing, 1994,1075-1091.
R. Cole, R. Hariharan, M. Lewenstein, E. Porat. A faster implementation of the Goemans-Williamson clustering algorithm. Twelth annual ACM-SIAM Symposium on discrete algorithms, 2001, 17-25.
R. Cole, R. Hariharan. Verifying candidate matches in sparse and wildcard matching. Thirty fourth annual Symposium on the theory of Computing 2002, 592-601.
R. Cole, Y. Dodis, T. Roughgarden. Pricing network edges for heterogeneous users. Submitted for publication.
 Update your faculty profile
|
