Richard J. Cole

{{Infobox scientist

| name = Richard J. Cole

| image =

| caption =

| birth_date = 24 May 1957

| birth_place = Oxford, England

| death_date =

| death_place =

| nationality =

| 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 = University College, Oxford (BA)
Cornell University (PhD)

| doctoral_advisor = John Hopcroft{{mathgenealogy|name=Richard John Cole|id=105414}}.

| prizes = Fellow of the ACM[https://awards.acm.org/award_winners/cole_1895101 ACM Fellows 1998] (1998)

| website = {{URL|https://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,{{cite journal |last=Cole |first=Richard |title=Parallel merge sort |journal=SIAM Journal on Computing |volume=17 |issue=4 |date=August 1988 |pages=770–785 |doi=10.1137/0217049 |citeseerx=10.1.1.464.7118 |s2cid=2416667 |url=http://www.inf.fu-berlin.de/lehre/SS10/SP-Par/download/parmerge1.pdf}} and an optimal analysis of the Boyer–Moore string-search algorithm.{{Cite FTP |last=Cole |first=Richard |title=Tight bounds on the complexity of the Boyer-Moore string matching algorithm |pages=224–233 |date=September 1991 |volume=23 |issue=5 |url=ftp://cs.nyu.edu/pub/tech-reports/tr512.ps.Z |isbn=978-0-89791-376-8 |doi=10.1137/S0097539791195543 |citeseerx=10.1.1.17.7823|server=Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms |url-status=dead |s2cid=5099809 }}{{cite journal |first1=Richard |last1=Cole |first2=Ramesh |last2=Hariharan |first3=Mike |last3=Paterson |first4=Uri |last4=Zwick |title=Tighter Lower Bounds on The Exact Complexity of String Matching |journal=SIAM Journal on Computing |volume=24 |issue=1 |pages=30–45 |date=March 2002 |doi=10.1137/S0097539793245829 |citeseerx=10.1.1.20.2999 |url=http://www.cs.tau.ac.il/~zwick/papers/tighter-lower.ps.gz }}