D-Index & Metrics Best Publications

D-Index & Metrics

Discipline name D-index D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines. Citations Publications World Ranking National Ranking
Computer Science D-index 51 Citations 11,027 116 World Ranking 2703 National Ranking 1433

Research.com Recognitions

Awards & Achievements

1998 - ACM Fellow Richard Cole has developed innovative and enabling paradigms, algorithms and methods of analysis: in computational geometry, parallel computing, and string and pattern matching.

1988 - Fellow of John Simon Guggenheim Memorial Foundation

Overview

What is he best known for?

The fields of study he is best known for:

  • Algorithm
  • Statistics
  • Combinatorics

Richard Cole mostly deals with Combinatorics, Algorithm, Parallel algorithm, Discrete mathematics and List ranking. Richard Cole combines subjects such as Bounded function and Approximate string matching with his study of Combinatorics. The Algorithm study combines topics in areas such as Polyhedron, Parallel processing, Binary logarithm, Simple and Order.

His Parallel algorithm study is associated with Parallel computing. His Discrete mathematics study combines topics from a wide range of disciplines, such as Search tree and Tree. His List ranking study incorporates themes from Spanning forest, Logarithm and Job shop scheduling.

His most cited work include:

  • Parallel merge sort (518 citations)
  • Deterministic coin tossing with applications to optimal parallel list ranking (362 citations)
  • Parallel merge sort (345 citations)

What are the main themes of his work throughout his whole career to date?

His scientific interests lie mostly in Combinatorics, Algorithm, Discrete mathematics, Upper and lower bounds and Time complexity. Richard Cole does research in Combinatorics, focusing on Binary logarithm specifically. His research in Algorithm intersects with topics in Asynchronous communication and Substring.

His Discrete mathematics course of study focuses on Splay tree and Conjecture. His Upper and lower bounds research integrates issues from Matching, Mathematical economics, Character, Mathematical optimization and Speedup. His Parallel algorithm research entails a greater understanding of Parallel computing.

He most often published in these fields:

  • Combinatorics (36.32%)
  • Algorithm (24.06%)
  • Discrete mathematics (16.98%)

What were the highlights of his more recent work (between 2016-2021)?

  • Mathematical economics (11.32%)
  • Asynchronous communication (6.13%)
  • Coordinate descent (4.25%)

In recent papers he was focusing on the following fields of study:

Richard Cole mainly investigates Mathematical economics, Asynchronous communication, Coordinate descent, Upper and lower bounds and Speedup. He works mostly in the field of Mathematical economics, limiting it down to concerns involving Rate of convergence and, occasionally, Cover and Distributed algorithm. His Speedup research is multidisciplinary, relying on both Discrete mathematics, Convex function and Parallelism.

His Discrete mathematics research incorporates themes from Partition and Half-space. His research integrates issues of Algorithm and Asynchrony in his study of Convex function. His Sublinear function study is concerned with the larger field of Combinatorics.

Between 2016 and 2021, his most popular works were:

  • Shape From Probing (121 citations)
  • Convex Program Duality, Fisher Markets, and Nash Social Welfare (55 citations)
  • Approximating the Nash Social Welfare with Indivisible Items (31 citations)

In his most recent research, the most cited papers focused on:

  • Algorithm
  • Statistics
  • Computer network

Richard Cole focuses on Mathematical economics, Combinatorics, Parallel computing, Rate of convergence and String searching algorithm. His work deals with themes such as Geometric mean, Cover and Approximation algorithm, which intersect with Mathematical economics. Richard Cole has researched Combinatorics in several fields, including Chain and Simple.

His Parallel computing research is multidisciplinary, incorporating elements of Sorting and Merge sort. His studies in Rate of convergence integrate themes in fields like Bregman divergence and Regular polygon. Richard Cole is interested in Boyer–Moore string search algorithm, which is a branch of String searching algorithm.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Best Publications

Parallel merge sort

Richard Cole.
SIAM Journal on Computing (1988)

1297 Citations

Deterministic coin tossing with applications to optimal parallel list ranking

Richard Cole;Uzi Vishkin;Uzi Vishkin.
(2011)

470 Citations

Slowing down sorting networks to obtain faster sorting algorithms

R. Cole.
Journal of the ACM (1987)

376 Citations

Dictionary matching and indexing with errors and don't cares

Richard Cole;Lee-Ad Gottlieb;Moshe Lewenstein.
symposium on the theory of computing (2004)

307 Citations

Faster optimal parallel prefix sums and list ranking

Richard Cole;Uzi Vishkin.
(2011)

297 Citations

Cascading divide-and-conquer: a technique for designing parallel algorithms

Mikhail J. Atallah;Richard Cole;Michael T. Goodrich.
SIAM Journal on Computing (1989)

296 Citations

Pricing network edges for heterogeneous selfish users

Richard Cole;Yevgeniy Dodis;Tim Roughgarden.
symposium on the theory of computing (2003)

292 Citations

Approximate and exact parallel scheduling with applications to list, tree and graph problems

Richard Cole;Uzi Vishkin.
foundations of computer science (1986)

264 Citations

Visibility Problems for Polyhedral Terrains

Richard Cole;Micha Sharir.
(2015)

259 Citations

Approximate parallel scheduling. Part I: the basic technique with applications to optimal parallel list ranking in logarithmic time

Richard Cole;Uzi Vishkin.
SIAM Journal on Computing (1988)

240 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

Best Scientists Citing Richard Cole

Micha Sharir

Micha Sharir

Tel Aviv University

Publications: 79

Michael T. Goodrich

Michael T. Goodrich

University of California, Irvine

Publications: 68

Amihood Amir

Amihood Amir

Bar-Ilan University

Publications: 68

Uzi Vishkin

Uzi Vishkin

University of Maryland, College Park

Publications: 53

Costas S. Iliopoulos

Costas S. Iliopoulos

King's College London

Publications: 49

Guy E. Blelloch

Guy E. Blelloch

Carnegie Mellon University

Publications: 47

Michael A. Bender

Michael A. Bender

Stony Brook University

Publications: 46

Danny Z. Chen

Danny Z. Chen

University of Notre Dame

Publications: 45

Pankaj K. Agarwal

Pankaj K. Agarwal

Duke University

Publications: 44

Robert E. Tarjan

Robert E. Tarjan

Princeton University

Publications: 39

Wing-Kin Sung

Wing-Kin Sung

National University of Singapore

Publications: 36

Tak-Wah Lam

Tak-Wah Lam

University of Hong Kong

Publications: 34

Vijaya Ramachandran

Vijaya Ramachandran

The University of Texas at Austin

Publications: 33

Bernard Chazelle

Bernard Chazelle

Princeton University

Publications: 32

Maxime Crochemore

Maxime Crochemore

King's College London

Publications: 31

Kurt Mehlhorn

Kurt Mehlhorn

Max Planck Institute for Informatics

Publications: 31

Something went wrong. Please try again later.