Richard J. Cole

Richard J. Cole
Born	(1957-05-24) 24 May 1957 (age 68) Oxford, England
Education	University College, Oxford (BA) Cornell University (PhD)
Relatives	G.D.H. Cole (grandfather) Margaret Cole (grandmother)
Awards	Fellow of the ACM [1] (1998)
Scientific career
Fields	Design and analysis of algorithms
Institutions	Courant Institute of Mathematical Sciences, New York University
Doctoral advisor	John Hopcroft [2]
Website	cs.nyu.edu/cole/

Richard J. Cole is a Silver Professor of Computer Science at the Courant Institute of Mathematical Sciences, New York University, and works on the Design and Analysis of Computer Algorithms.

Research

His research areas include algorithmic economic market theory and game theory, string and pattern matching, amortization, parallelism, and network and routing problems. His notable research contributions include an optimal parallel algorithm for sorting in the PRAM model, ^[3] and an optimal analysis of the Boyer–Moore string-search algorithm. ^{[4] [5]}

References

1. ACM Fellows 1998
2. Richard John Cole at the Mathematics Genealogy Project.
3. Cole, Richard (August 1988). "Parallel merge sort" (PDF). SIAM Journal on Computing. 17 (4): 770–785. CiteSeerX   10.1.1.464.7118 . doi:10.1137/0217049. S2CID   2416667.
4. Cole, Richard (September 1991). "Tight bounds on the complexity of the Boyer-Moore string matching algorithm". Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms (FTP). pp. 224–233. CiteSeerX   10.1.1.17.7823 . doi:10.1137/S0097539791195543. ISBN   978-0-89791-376-8. S2CID   5099809.^{[dead ftp link]}(To view documents see Help:FTP)
5. Cole, Richard; Hariharan, Ramesh; Paterson, Mike; Zwick, Uri (March 2002). "Tighter Lower Bounds on The Exact Complexity of String Matching". SIAM Journal on Computing. 24 (1): 30–45. CiteSeerX   10.1.1.20.2999 . doi:10.1137/S0097539793245829.

External links

• Official website