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 68 Citations 14,253 282 World Ranking 965 National Ranking 580

Research.com Recognitions

Awards & Achievements

2009 - IEEE Fellow For contributions to parallel and distributed algorithms for combinatorial and geometric problems

2009 - ACM Fellow For contributions to data structures and algorithms for combinatorial and geometric problems.

2007 - Fellow of the American Association for the Advancement of Science (AAAS)

2006 - ACM Distinguished Member

Overview

What is he best known for?

The fields of study he is best known for:

  • Algorithm
  • Operating system
  • Programming language

Michael T. Goodrich mainly investigates Combinatorics, Algorithm, Theoretical computer science, Discrete mathematics and Data structure. Michael T. Goodrich interconnects Planar, Parallel algorithm and Greedy algorithm in the investigation of issues within Combinatorics. His work carried out in the field of Algorithm brings together such families of science as Upper and lower bounds, Simple and Closest pair of points problem.

His Theoretical computer science study combines topics in areas such as Cryptographic protocol, Algorithm design, Logarithm, Degree and Structure. His work in the fields of Discrete mathematics, such as Planar graph, Graph drawing, Simplex graph and Factor-critical graph, intersects with other areas such as Greedy embedding. His work deals with themes such as Tree, Monotone polygon and Point location, which intersect with Data structure.

His most cited work include:

  • Almost optimal set covers in finite VC-dimension (376 citations)
  • External-memory graph algorithms (293 citations)
  • Data Structures and Algorithms in Java (255 citations)

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

Michael T. Goodrich mainly focuses on Combinatorics, Algorithm, Theoretical computer science, Discrete mathematics and Data structure. His Combinatorics study often links to related topics such as Voronoi diagram. His Algorithm study combines topics from a wide range of disciplines, such as Simple, Upper and lower bounds and Mathematical optimization.

His Theoretical computer science study integrates concerns from other disciplines, such as Set, Degree, Auxiliary memory, Hash function and Cuckoo hashing. His Discrete mathematics study frequently links to other fields, such as Computational geometry. His Data structure research is multidisciplinary, incorporating elements of Java and Point location.

He most often published in these fields:

  • Combinatorics (35.29%)
  • Algorithm (21.30%)
  • Theoretical computer science (20.28%)

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

  • Combinatorics (35.29%)
  • Algorithm (21.30%)
  • Theoretical computer science (20.28%)

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

Combinatorics, Algorithm, Theoretical computer science, Planar graph and Discrete mathematics are his primary areas of study. His Combinatorics study incorporates themes from Straight skeleton and Planar. His work in Algorithm tackles topics such as Voronoi diagram which are related to areas like Geometric primitive, Limit, Model of computation and Uniqueness.

His Theoretical computer science research focuses on Data structure and how it connects with Cuckoo hashing and Data retention. The various areas that Michael T. Goodrich examines in his Planar graph study include Class, Dijkstra's algorithm, Node and Polynomial expansion. As part of the same scientific family, he usually focuses on Set, concentrating on Sorting and intersecting with Parallel algorithm.

Between 2014 and 2021, his most popular works were:

  • Cascading Divide-and-conquer: A Technique for Designing Parallel Algorithms (38 citations)
  • Algorithm Design and Applications (26 citations)
  • Fully-Dynamic Verifiable Zero-Knowledge Order Queries for Network Data. (11 citations)

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

  • Algorithm
  • Operating system
  • Programming language

His primary areas of study are Algorithm, Theoretical computer science, Combinatorics, Planar and Time complexity. His research in Algorithm intersects with topics in Graph model, Random graph, Permutation graph and Digital watermarking. He interconnects Bounded function, Verifiable secret sharing, Dimension and Zero-knowledge proof in the investigation of issues within Theoretical computer science.

Michael T. Goodrich works in the field of Combinatorics, namely Arboricity. In his study, which falls under the umbrella issue of Planar, Arc, Differentiable function and Graph is strongly linked to Planarity testing. His work carried out in the field of Time complexity brings together such families of science as Sorting, Sequence, Clique and Planar graph.

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

Data Structures and Algorithms in Java

Michael T. Goodrich;Roberto Tamassia.
(1998)

640 Citations

Almost optimal set covers in finite VC-dimension

H. Brönnimann;M. T. Goodrich.
Discrete and Computational Geometry (1995)

567 Citations

External-memory graph algorithms

Yi-Jen Chiang;Michael T. Goodrich;Edward F. Grove;Roberto Tamassia.
symposium on discrete algorithms (1995)

412 Citations

Loud and Clear: Human-Verifiable Authentication Based on Audio

M.T. Goodrich;M. Sirivianos;J. Solis;G. Tsudik.
international conference on distributed computing systems (2006)

315 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

External-memory computational geometry

M.T. Goodrich;Jyh-Jong Tsay;D.E. Vengroff;J.S. Vitter.
foundations of computer science (1993)

277 Citations

Privacy-preserving access of outsourced data via oblivious RAM simulation

Michael T. Goodrich;Michael Mitzenmacher.
international colloquium on automata languages and programming (2011)

268 Citations

Privacy-preserving group data access via stateless oblivious RAM simulation

Michael T. Goodrich;Michael Mitzenmacher;Olga Ohrimenko;Roberto Tamassia.
symposium on discrete algorithms (2012)

246 Citations

Efficient packet marking for large-scale IP traceback

Michael T. Goodrich.
computer and communications security (2002)

244 Citations

Algorithm Design: Foundations, Analysis, and Internet Examples

Michael T. Goodrich;Roberto Tamassia.
(2001)

231 Citations

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

Contact us

Best Scientists Citing Michael T. Goodrich

Roberto Tamassia

Roberto Tamassia

Brown University

Publications: 78

David Eppstein

David Eppstein

University of California, Irvine

Publications: 61

Pankaj K. Agarwal

Pankaj K. Agarwal

Duke University

Publications: 58

Lars Arge

Lars Arge

Aarhus University

Publications: 54

Stephen G. Kobourov

Stephen G. Kobourov

University of Arizona

Publications: 49

Danny Z. Chen

Danny Z. Chen

University of Notre Dame

Publications: 48

Timothy M. Chan

Timothy M. Chan

University of Illinois at Urbana-Champaign

Publications: 46

Elaine Shi

Elaine Shi

Carnegie Mellon University

Publications: 42

Guy E. Blelloch

Guy E. Blelloch

Carnegie Mellon University

Publications: 39

Michael Kaufmann

Michael Kaufmann

University of Tübingen

Publications: 38

David M. Mount

David M. Mount

University of Maryland, College Park

Publications: 37

Mark de Berg

Mark de Berg

Eindhoven University of Technology

Publications: 36

Jeffrey Scott Vitter

Jeffrey Scott Vitter

University of Mississippi

Publications: 35

Micha Sharir

Micha Sharir

Tel Aviv University

Publications: 34

Mikhail J. Atallah

Mikhail J. Atallah

Purdue University West Lafayette

Publications: 33

Joseph S. B. Mitchell

Joseph S. B. Mitchell

Stony Brook University

Publications: 32

Trending Scientists

Ole Winther

Ole Winther

Technical University of Denmark

Gaetan L. Mathieu

Gaetan L. Mathieu

University of California System

Kazunari Sasaki

Kazunari Sasaki

Kyushu University

Bengt Gunnar Svensson

Bengt Gunnar Svensson

University of Oslo

Wanli Ma

Wanli Ma

Soochow University

Jeanne F. Loring

Jeanne F. Loring

Scripps Research Institute

Karl Forchhammer

Karl Forchhammer

University of Tübingen

Gary Sawers

Gary Sawers

Martin Luther University Halle-Wittenberg

Ole E. Sørensen

Ole E. Sørensen

Lund University

Doug Smith

Doug Smith

Met Office

Jean-Marie Besson

Jean-Marie Besson

Inserm : Institut national de la santé et de la recherche médicale

Bernardo Dell'Osso

Bernardo Dell'Osso

University of Milan

Lesley Fallowfield

Lesley Fallowfield

Brighton and Sussex Medical School

Achim Schneider

Achim Schneider

University of Ulm

Julian R. Betts

Julian R. Betts

University of California, San Diego

Bjarte Kileng

Bjarte Kileng

University of Bergen

Something went wrong. Please try again later.