Richard J. Cole Explained

Honorific Prefix:Professor
Richard J. Cole
Birth Date:24 May 1957
Birth Place:Oxford, England
Relatives:G.D.H. Cole (grandfather)
Margaret Cole (grandmother)
Field:Design and analysis of algorithms
Work Institution:Courant Institute of Mathematical Sciences, New York University
Education:B.A. in Mathematics, University College, Oxford, 1978
Ph.D. in Computer Science, Cornell University, 1982
Doctoral Advisor:John Hopcroft[1]
Prizes:Fellow of the ACM[2] (1998)

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]

Notes and References

  1. .
  2. https://awards.acm.org/award_winners/cole_1895101 ACM Fellows 1998
  3. Cole . Richard . Parallel merge sort . SIAM Journal on Computing . 17 . 4 . August 1988 . 770–785 . 10.1137/0217049 . 10.1.1.464.7118 . 2416667 .
  4. Cole . Richard . [ftp://cs.nyu.edu/pub/tech-reports/tr512.ps.Z Tight bounds on the complexity of the Boyer-Moore string matching algorithm ]. Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms . 224–233 . September 1991 . 23 . 5 . 978-0-89791-376-8 . 10.1137/S0097539791195543 . 10.1.1.17.7823. 5099809 .
  5. Richard . Cole . Ramesh . Hariharan . Mike . Paterson . Uri . Zwick . Tighter Lower Bounds on The Exact Complexity of String Matching . SIAM Journal on Computing . 24 . 1 . 30–45 . March 2002 . 10.1137/S0097539793245829 . 10.1.1.20.2999 .