H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science H-index 60 Citations 11,846 158 World Ranking 1528 National Ranking 853

Research.com Recognitions

Awards & Achievements

2003 - ACM Paris Kanellakis Theory and Practice Award Development of efficient randomized tests of primality

2002 - ACM Fellow For contributions to the design and analysis of algorithms in number theory and computational geometry.

Overview

What is he best known for?

The fields of study he is best known for:

  • Algorithm
  • Algebra
  • Combinatorics

Combinatorics, Discrete mathematics, Algorithm, Parallel algorithm and Polygon mesh are his primary areas of study. His studies link Upper and lower bounds with Combinatorics. The concepts of his Discrete mathematics study are interwoven with issues in Primality test, Symmetric matrix and Diagonally dominant matrix.

Gary L. Miller works mostly in the field of Algorithm, limiting it down to topics relating to Parallel mesh generation and, in certain cases, Pitteway triangulation and Ruppert's algorithm. His Parallel algorithm research is multidisciplinary, incorporating elements of Binary logarithm, Simple and Theoretical computer science. Structure, Mathematical proof, Finite difference method, Partition and Randomized algorithm is closely connected to Finite element method in his research, which is encompassed under the umbrella topic of Polygon mesh.

His most cited work include:

  • Riemann's hypothesis and tests for primality (585 citations)
  • Optimal route selection in a content delivery network (427 citations)
  • Parallel tree contraction and its application (364 citations)

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

His primary areas of investigation include Combinatorics, Discrete mathematics, Algorithm, Parallel algorithm and Theoretical computer science. His Combinatorics study frequently draws connections to adjacent fields such as Diagonally dominant matrix. His studies deal with areas such as Linear system and Spanning tree as well as Diagonally dominant matrix.

His Discrete mathematics study deals with Voronoi diagram intersecting with Subset and superset. His Algorithm research is multidisciplinary, incorporating perspectives in Graph, Mesh generation and Polygon mesh. The various areas that Gary L. Miller examines in his Parallel algorithm study include Tree, Graph algorithms and Parallel processing.

He most often published in these fields:

  • Combinatorics (48.26%)
  • Discrete mathematics (42.61%)
  • Algorithm (21.30%)

What were the highlights of his more recent work (between 2010-2020)?

  • Combinatorics (48.26%)
  • Discrete mathematics (42.61%)
  • Linear system (9.57%)

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

His main research concerns Combinatorics, Discrete mathematics, Linear system, Graph and Maximum flow problem. His Combinatorics research includes themes of Parallel algorithm and Exponential function. He does research in Discrete mathematics, focusing on Hopcroft–Karp algorithm specifically.

His Linear system research includes themes of Solver, Theoretical computer science and Diagonally dominant matrix. The Graph study combines topics in areas such as Algorithm, Mathematical optimization and Data structure. His work deals with themes such as Flow, Vertex, Bounded function and Isotropy, which intersect with Maximum flow problem.

Between 2010 and 2020, his most popular works were:

  • Coordinating Pebble Motion on Graphs, the Diameter of Permutation Groups and Applications (196 citations)
  • A Nearly-m log n Time Solver for SDD Linear Systems (132 citations)
  • Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning (115 citations)

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

  • Algorithm
  • Algebra
  • Combinatorics

Gary L. Miller focuses on Combinatorics, Linear system, Discrete mathematics, Diagonally dominant matrix and Mathematical optimization. His Combinatorics study integrates concerns from other disciplines, such as Parallel algorithm, Sequential algorithm and Algorithm design. His Linear system research incorporates elements of Solver and Theoretical computer science.

His studies in Discrete mathematics integrate themes in fields like Power diagram, Centroidal Voronoi tessellation and Dimension. His Diagonally dominant matrix study which covers Spanning tree that intersects with Chain and Matrix. His study in Mathematical optimization is interdisciplinary in nature, drawing from both Covering problems, Graph and Core.

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.

Top Publications

Riemann's hypothesis and tests for primality

Gary L. Miller.
Journal of Computer and System Sciences (1976)

1092 Citations

Optimal route selection in a content delivery network

Claudson F. Bornstein;Timothy K. Canfield;Gary L. Miller;Satish B. Rao.
(2002)

666 Citations

Parallel tree contraction and its application

Gary L. Miller;John H. Reif.
foundations of computer science (1985)

534 Citations

Delaunay refinement mesh generation

Jonathan Richard Shewchuk;Gary L. Miller;David R. O'Hallaron.
Delaunay refinement mesh generation (1997)

516 Citations

The Complexity of Coloring Circular Arcs and Chords

M. R. Garey;David S. Johnson;G. L. Miller;Christos H. Papadimitriou.
Siam Journal on Algebraic and Discrete Methods (1980)

504 Citations

DOULION: counting triangles in massive graphs with a coin

Charalampos E. Tsourakakis;U. Kang;Gary L. Miller;Christos Faloutsos.
knowledge discovery and data mining (2009)

364 Citations

Finding small simple cycle separators for 2-connected planar graphs

Gary L Miller.
Journal of Computer and System Sciences (1986)

335 Citations

Approaching Optimality for Solving SDD Linear Systems

Ioannis Koutis;Gary L. Miller;Richard Peng.
SIAM Journal on Computing (2014)

288 Citations

Coordinating Pebble Motion on Graphs, the Diameter of Permutation Groups and Applications

D. Kornhauser;G. Miller;P. Spirakis.
(2011)

287 Citations

Geometric Mesh Partitioning: Implementation and Experiments

John R. Gilbert;Gary L. Miller;Shang-Hua Teng.
SIAM Journal on Scientific Computing (1998)

283 Citations

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.

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

Contact us

Top Scientists Citing Gary L. Miller

Shang-Hua Teng

Shang-Hua Teng

University of Southern California

Publications: 59

David Eppstein

David Eppstein

University of California, Irvine

Publications: 47

Guy E. Blelloch

Guy E. Blelloch

Carnegie Mellon University

Publications: 44

Michael T. Goodrich

Michael T. Goodrich

University of California, Irvine

Publications: 34

Daniel A. Spielman

Daniel A. Spielman

Yale University

Publications: 31

Bradley E. Marshall

Bradley E. Marshall

Amazon (United States)

Publications: 30

Philip N. Klein

Philip N. Klein

Brown University

Publications: 30

C. Seshadhri

C. Seshadhri

University of California, Santa Cruz

Publications: 27

Satish Rao

Satish Rao

University of California, Berkeley

Publications: 27

Swaminathan Sivasubramanian

Swaminathan Sivasubramanian

Amazon (United States)

Publications: 25

Uzi Vishkin

Uzi Vishkin

University of Maryland, College Park

Publications: 25

John H. Reif

John H. Reif

Duke University

Publications: 25

Vijaya Ramachandran

Vijaya Ramachandran

The University of Texas at Austin

Publications: 23

Sariel Har-Peled

Sariel Har-Peled

University of Illinois at Urbana-Champaign

Publications: 20

Martin Grohe

Martin Grohe

RWTH Aachen University

Publications: 20

Something went wrong. Please try again later.