- Home
- Best Scientists - Computer Science
- Gary L. Miller

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
63
Citations
13,267
225
World Ranking
1777
National Ranking
968

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.

- 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.

- 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)

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.

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

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

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.

- 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)

- 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.

Riemann's hypothesis and tests for primality

Gary L. Miller.

Journal of Computer and System Sciences **(1976)**

1126 Citations

Parallel tree contraction and its application

Gary L. Miller;John H. Reif.

foundations of computer science **(1985)**

557 Citations

Delaunay refinement mesh generation

Jonathan Richard Shewchuk;Gary L. Miller;David R. O'Hallaron.

Delaunay refinement mesh generation **(1997)**

531 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)**

523 Citations

Optimal route selection in a content delivery network

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

**(2002)**

445 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)**

383 Citations

Finding small simple cycle separators for 2-connected planar graphs

Gary L Miller.

Journal of Computer and System Sciences **(1986)**

350 Citations

Coordinating pebble motion on graphs, the diameter of permutation groups and applications

D. Kornhauser;G. Miller;P. Spirakis.

**(2011)**

303 Citations

Approaching Optimality for Solving SDD Linear Systems

Ioannis Koutis;Gary L. Miller;Richard Peng.

SIAM Journal on Computing **(2014)**

302 Citations

Separators for sphere-packings and nearest neighbor graphs

Gary L. Miller;Shang-Hua Teng;William Thurston;Stephen A. Vavasis.

Journal of the ACM **(1997)**

292 Citations

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

Contact us

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

University of Southern California

Carnegie Mellon University

Duke University

University of Waterloo

Duke University

Cornell University

Carnegie Mellon University

University of California, Santa Barbara

The University of Texas at Austin

University of California, Irvine

University of Freiburg

Sorbonne University

University of Wisconsin–Madison

Paul Scherrer Institute

Inserm

University of Aberdeen

Agricultural Research Service

University of California, Davis

University of Cologne

University of Potsdam

National and Kapodistrian University of Athens

University of Montreal

Karolinska Institute

Albert Einstein College of Medicine

University of Birmingham

Harvard University

Something went wrong. Please try again later.