Richard J. Cole
American computer scientist
From Wikipedia, the free encyclopedia
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.
Born24 May 1957
Oxford, England
EducationUniversity College, Oxford (BA)
Cornell University (PhD)
Cornell University (PhD)
RelativesG. D. H. Cole (grandfather)
Margaret Cole (grandmother)
Margaret Cole (grandmother)
AwardsFellow of the ACM[1] (1998)
Richard J. Cole | |
|---|---|
| Born | 24 May 1957 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 |
| Workplaces | Courant Institute of Mathematical Sciences, New York University |
| John E. Hopcroft[2] | |
| Website | cs |
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]