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.
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 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.
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.
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)
Parallel tree contraction and its application
Gary L. Miller;John H. Reif.
foundations of computer science (1985)
Delaunay refinement mesh generation
Jonathan Richard Shewchuk;Gary L. Miller;David R. O'Hallaron.
Delaunay refinement mesh generation (1997)
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)
Optimal route selection in a content delivery network
Claudson F. Bornstein;Timothy K. Canfield;Gary L. Miller;Satish B. Rao.
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)
Finding small simple cycle separators for 2-connected planar graphs
Gary L Miller.
Journal of Computer and System Sciences (1986)
Coordinating pebble motion on graphs, the diameter of permutation groups and applications
D. Kornhauser;G. Miller;P. Spirakis.
Approaching Optimality for Solving SDD Linear Systems
Ioannis Koutis;Gary L. Miller;Richard Peng.
SIAM Journal on Computing (2014)
Separators for sphere-packings and nearest neighbor graphs
Gary L. Miller;Shang-Hua Teng;William Thurston;Stephen A. Vavasis.
Journal of the ACM (1997)
If you think any of the details on this page are incorrect, let us know.
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: