Gary Miller
#31,590
Most Influential Person Now
American computer scientist
Gary Miller 's AcademicInfluence.com Rankings
Gary Miller computer-science Degrees
Computer Science
#1626
World Rank
#1681
Historical Rank
#792
USA Rank
Numerical Analysis
#33
World Rank
#35
Historical Rank
#17
USA Rank
Database
#3268
World Rank
#3405
Historical Rank
#616
USA Rank
Download Badge
Computer Science
Gary Miller 's Degrees
- PhD Computer Science Stanford University
- Masters Computer Science Stanford University
- Bachelors Computer Science Stanford University
Similar Degrees You Can Earn
Why Is Gary Miller Influential?
(Suggest an Edit or Addition)According to Wikipedia, Gary Lee Miller is a professor of Computer Science at Carnegie Mellon University, Pittsburgh, United States. In 2003 he won the ACM Paris Kanellakis Award for the Miller–Rabin primality test. He was made an ACM Fellow in 2002 and won the Knuth Prize in 2013.
Gary Miller 's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Riemann's Hypothesis and tests for primality (1975) (894)
- The Complexity of Coloring Circular Arcs and Chords (1980) (425)
- Parallel tree contraction and its application (1985) (409)
- Delaunay refinement mesh generation (1997) (343)
- DOULION: counting triangles in massive graphs with a coin (2009) (324)
- Coordinating Pebble Motion on Graphs, the Diameter of Permutation Groups, and Applications (2015) (284)
- Approaching Optimality for Solving SDD Linear Systems (2010) (281)
- A Nearly-m log n Time Solver for SDD Linear Systems (2011) (267)
- Separators for sphere-packings and nearest neighbor graphs (1997) (247)
- Geometric mesh partitioning: implementation and experiments (1995) (229)
- A unified geometric approach to graph separators (1991) (208)
- Automatic Mesh Partitioning (1992) (193)
- Regular groups of automorphisms of cubic graphs (1980) (182)
- Solving SDD linear systems in nearly mlog1/2n time (2014) (177)
- On the Quality of Spectral Separators (1998) (171)
- Isomorphism testing for graphs of bounded genus (1980) (165)
- Finding small simple cycle separators for 2-connected planar graphs. (1984) (163)
- A Delaunay based numerical method for three dimensions: generation, formulation, and partition (1995) (162)
- Proceedings of the twenty-eighth annual ACM symposium on Theory of computing (1996) (159)
- Iterative Row Sampling (2012) (151)
- On taking roots in finite fields (1977) (148)
- Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning (2010) (140)
- Combinatorial preconditioners and multilevel solvers for problems in computer vision and image processing (2009) (137)
- Flow in planar graphs with multiple sources and sinks (1989) (135)
- Solvability by radicals is in polynomial time (1983) (134)
- Control Volume Meshes Using Sphere Packing (1998) (131)
- Finding Small Simple Cycle Separators for 2-Connected Planar Graphs (1986) (130)
- Graph isomorphism, general remarks (1977) (130)
- Geometric Separators for Finite-Element Meshes (1998) (126)
- Geometric median in nearly linear time (2016) (123)
- Parallel graph decompositions using random shifts (2013) (109)
- Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits (1986) (108)
- Graph Partitioning by Spectral Rounding: Applications in Image Segmentation and Clustering (2006) (108)
- Design and Implementation of a Practical Parallel Delaunay Algorithm (1999) (101)
- Parallel Tree Contraction Part 1: Fundamentals (1989) (97)
- On the nlog n isomorphism technique (A Preliminary Report) (1978) (91)
- Optimal Tree Contraction in the EREW Model (1988) (90)
- Parallel Tree Contraction, Part 2: Further Applications (1991) (88)
- Separators in two and three dimensions (1990) (87)
- Smoothing and cleaning up slivers (2000) (86)
- On the performance of spectral graph partitioning methods (1995) (84)
- Graph Embeddings and Laplacian Eigenvalues (2000) (83)
- Approximating center points with iterative Radon points (1996) (79)
- Approaching optimality for solving SDD systems (2010) (78)
- An Improved Parallel Algorithm that Computes the BFS Numbering of a Directed Graph (1988) (78)
- Improved Parallel Algorithms for Spanners and Hopsets (2013) (76)
- Provably Good Channel Routing Algorithms (1981) (75)
- On determining the genus of a graph in O(v O(g)) steps(Preliminary Report) (1979) (74)
- A new graph triconnectivity algorithm and its parallelization (1992) (74)
- A Simple Randomized Parallel Algorithm for List-Ranking (1990) (71)
- A new graphy triconnectivity algorithm and its parallelization (1987) (67)
- A parallel algorithm for finding a separator in planar graphs (1987) (63)
- Sparse Voronoi Refinement (2006) (62)
- Approximating center points with iterated radon points (1993) (62)
- Constructing trees in parallel (1989) (61)
- A deterministic linear time algorithm for geometric separators and its applications (1993) (55)
- Triangle Sparsifiers (2011) (55)
- Runtime guarantees for regression problems (2011) (51)
- When and Why Ruppert's Algorithm Works (2003) (49)
- A fast solver for a class of linear systems (2012) (48)
- A linear work, O(n1/6) time, parallel algorithm for solving planar Laplacians (2007) (47)
- Performance evaluation of a new parallel preconditioner (1995) (47)
- Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers (1984) (46)
- Density graphs and separators (1991) (46)
- Nearly-Linear Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs (2011) (43)
- List ranking and parallel tree contraction (1993) (43)
- Sums of divisors, perfect numbers, and factoring (1984) (43)
- Deterministic parallel list ranking (1988) (42)
- Developing a practical projection-based parallel Delaunay algorithm (1996) (41)
- Optimal Coarsening of Unstructured Meshes (1999) (41)
- New layouts for the shuffle-exchange graph(Extended Abstract) (1981) (39)
- Approximate centerpoints with proofs (2010) (39)
- Simple and Scalable Constrained Clustering: a Generalized Spectral Method (2016) (39)
- Isomorphism of k-Contractible Graphs. A Generalization of Bounded Valence and Bounded Genus (1983) (39)
- On the Radius-Edge Condition in the Control Volume Method (1999) (39)
- Faster approximate multicommodity flow using quadratically coupled flows (2012) (37)
- A time efficient Delaunay refinement algorithm (2004) (36)
- A bézier-based approach to unstructured moving meshes (2004) (36)
- Isomorphism of Graphs Which are Pairwise k-separable (1983) (35)
- An additivity theorem for the genus of a graph (1987) (33)
- Planar Separators and the Euclidean Norm (1990) (33)
- Sparse parallel Delaunay mesh refinement (2007) (31)
- Topological inference via meshing (2010) (29)
- Dynamic parallel complexity of computational circuits (1987) (29)
- A PARALLEL DYNAMIC-MESH LAGRANGIAN METHOD FOR SIMULATION OF FLOWS WITH DYNAMIC INTERFACES (2000) (28)
- Graph partitioning into isolated, high conductance clusters: theory, computation and applications to preconditioning (2008) (26)
- Finding effective support-tree preconditioners (2005) (26)
- Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number Fields (1986) (25)
- Linear-Size Meshes (2008) (25)
- Optimal good-aspect-ratio coarsening for unstructured meshes (1997) (23)
- Approximate Maximum Flow on Separable Undirected Graphs (2012) (23)
- Size complexity of volume meshes vs. surface meshes (2009) (23)
- Separator based parallel divide and conquer in computational geometry (1992) (22)
- Subtree isomorphism is in random NC (1988) (21)
- Solving Symmetric Diagonally-Dominant Systems by Preconditioning (2003) (19)
- Nearly-Linear Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs (2011) (19)
- Data Generation for Geometric Algorithms on Non-Uniform Distributions (1999) (18)
- Nested Dissection: A survey and comparison of various nested dissection algorithms (1992) (18)
- SVR: Practical Engineering of a Fast 3D Meshing Algorithm* (2007) (18)
- Tree-Based Parallel Algorithm Design (1997) (17)
- Fully Incremental 3D Delaunay Refinement Mesh Generation (2002) (17)
- Approximate Triangle Counting (2009) (17)
- Combinatorial and algebraic tools for optimal multilevel algorithms (2007) (17)
- On deleting vertices to make a graph of positive genus planar (1987) (16)
- Solving 1-Laplacians in Nearly Linear Time: Collapsing and Expanding a Topological Ball (2014) (16)
- An Asymptotically Optimal Layout for the Shuffle-Exchange Graph (1983) (15)
- Moments of Inertia and Graph Separators (1994) (15)
- When and why delaunay refinement algorithms work (2005) (14)
- Routing under balance (2016) (14)
- Automatic Multiple Retinal Layer Segmentation in Spectral Domain OCT Scans via Spectral Rounding (2008) (14)
- Hierarchical Diagonal Blocking and Precision Reduction Applied to Combinatorial Multigrid (2010) (14)
- Beating the spread: time-optimal point meshing (2011) (13)
- Graph Sketching against Adaptive Adversaries Applied to the Minimum Degree Algorithm (2018) (12)
- A Bezier-Based Moving Mesh Framework for Simulation with Elastic Membranes (2004) (12)
- Measuring an ip network in situ (2005) (12)
- Layouts for the shuffle-exchange graph based on the complex plane diagram (1984) (12)
- Approximate center points with proofs (2009) (12)
- Solving Sdd Linear Systems in Time˜o (12)
- Stretching Stretch (2014) (11)
- Isomorphism Testing and Canonical Forms for k-Contractable Graphs (A Generalization of Bounded Valence and Bounded Genus) (1983) (11)
- The hidden cost of low bandwidth communication (1994) (11)
- Representing Topological Structures Using Cell-Chains (2006) (11)
- A fast algorithm for well-spaced points and approximate delaunay graphs (2013) (11)
- The Path Resistance Method for Bounding the Smallest Nontrivial Eigenvalue of a Laplacian (1997) (10)
- Dynamic mesh refinement (2007) (10)
- Approximating Nearest Neighbor Distances (2015) (10)
- Iterative Approaches to Row Sampling (2012) (10)
- Spectral rounding and image segmentation (2006) (9)
- Mesh generation and geometric persistent homology (2011) (9)
- A contraction procedure for planar directed graphs (1992) (8)
- The path resistance method for bounding λ2 of a Laplacian (1997) (8)
- Exact computation of a manifold metric, via Lipschitz Embeddings and Shortest Paths on a Graph (2017) (7)
- Estimating interpolation error: a combinatorial approach (1999) (7)
- Scalable Constrained Clustering: A Generalized Spectral Method (2015) (7)
- Solving SDD linear systems in time Õ(mlog nlog(1/ε)) (2011) (7)
- Corrected Laplacians: closer cuts and segmentation with shape priors (2005) (7)
- Size Competitive Meshing Without Large Angles (2007) (6)
- Solving SDD linear systems in time $\tilde{O}(m\log{n}\log(1/\epsilon))$ (2011) (6)
- Tradeoffs between parallelism and fill in nested dissection (1999) (6)
- Shape Context Algorithm Applied to Correct Eye Movement Artifacts on Three-Dimensional (3D) Spectral Domain Optical Coherence Tomography (SD-OCT) (2009) (6)
- An Empirical Study of Cycle Toggling Based Laplacian Solvers (2016) (6)
- Persistent triangulations Journal of Functional Programming (2001) (6)
- Lower bounds for graph embeddings and combinatorial preconditioners (2004) (5)
- Parallelizing elimination orders with linear fill (1997) (5)
- A new approach to output-sensitive voronoi diagrams and delaunay triangulations (2012) (4)
- An In-painting Method for Combining Multiple SD-OCT Scans With Applications to Z-motion Recovery, Noise Reduction and Longitudinal Studies (2009) (4)
- Nested Dissection: A Survey (1992) (4)
- A New Approach to Output-Sensitive Construction of Voronoi Diagrams and Delaunay Triangulations (2014) (4)
- The Dynamic Parallel Complexity of Computational Circuits (1999) (3)
- The Centervertex Theorem for Wedge Depth (2009) (3)
- Approximation algorithms for speeding up dynamic programming and denoising aCGH data (2011) (3)
- A Generalized Cheeger Inequality (2014) (3)
- Approximate dynamic programming using halfspace queries and multiscale Monge decomposition (2010) (3)
- Mesh Enhanced Persistent Homology (2009) (3)
- Exploration of a Graph-based Density-sensitive Metric (2017) (2)
- Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '99, Saint-Malo, France, June 27-30, 1999 (1999) (2)
- Fast Sizing Calculations for Meshing (2007) (2)
- Automated Parallel Solution of Unstructured PDE Problems (2007) (2)
- Electrical Flow Algorithms for Total Variation Minimization (2011) (2)
- Parallel Gaussian Elimination with Linear Work and Fill (1997) (2)
- Efficient mesh generation for piecewise linear complexes (2009) (2)
- Weighted Cheeger and Buser Inequalities, with Applications to Clustering and Cutting Probability Densities (2020) (1)
- Computer Science Performance Evaluation of a New Parallel Preconditioner (1)
- Approximating Voronoi Diagrams with Voronoi Diagrams (2009) (1)
- Using bistellar flips for rotations in point location structures (2004) (1)
- On Computing Min-Degree Elimination Orderings (2017) (1)
- Isomorphism of Graphs Which are k-Separable (2007) (1)
- Metric Transforms and Low Rank Matrices via Representation Theory of the Real Hyperrectangle (2020) (1)
- The Revolution in Graph Theoretic Optimization Problems (2015) (1)
- Solving large optimization problems using spectral graph theory (2013) (1)
- Intrinsic Metrics: Nearest Neighbor and Edge Squared Distances (2017) (1)
- Intrinsic Metrics: Exact Equality between a Geodesic Metric and a Graph metric (2017) (0)
- 2-7-2014 Stretching Stretch (2015) (0)
- Processor efficient parallel graph algorithms (1988) (0)
- P2NC: Speeding up the execution of programs via probabilistic evaluation of circuits (2001) (0)
- Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '98, Puerto Vallarta, Mexico, June 28 - July 2, 1998 (1998) (0)
- Sums of Divisors, Perfect Numbers, and Factoring (Extended Abstract) (1984) (0)
- Re from of Computer Riemann's Hypothesis and Tests for Tests for Primality Motivation Of (1975) (0)
- Groups Acting on Regular Graphs and Group Amalgams (1977) (0)
- Fast Meshing for Acute PLCs (2009) (0)
- Beyond Laplacians: Faster (2012) (0)
- Meshing log n Dimensions in Polynomial Time ∗ (2012) (0)
- A note on relative perturbations for positive definite matrices (2005) (0)
- Proceedings of the Twelfth annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2000, Bar Harbor, Maine, USA, July 9-13, 2000 (2000) (0)
- Parallel-tree contraction and its application. Technical report (1985) (0)
- A Quadratic Running Time Example for Ruppert's Refinement Algorithm (2013) (0)
- On the n(log2n) Isomorphism Technique (1977) (0)
- Functions that Preserve Manhattan Distances (2020) (0)
- Persistent Triangulations Guy Blelloch (1999) (0)
- Are Pointer-Based Parallel Algorithms Realistic? (1989) (0)
- Approximate Dynamic Programming for Fast Denoising of aCGH Data (2010) (0)
- TR-2005-003 Finding Effective Support-Tree Preconditioners (2007) (0)
- PARALLEL TREE CONTRACTIONAND ITS APPLICATION (1985) (0)
- Exact Local Pagerank on Cartesian Products of Graphs (2020) (0)
- Spectral Graph Theory and The Laplacian Paradigm Spring 2020 Lecture 9 : Bounding Eigenvalues , 2020 : Feb 5 (2020) (0)
- Efficient Parallel Algorithms for Planar DAGs (1995) (0)
- Parallel Algorithms for Approximate Undirected Shortest Paths in $m\log^{3+α}n$ Work (2013) (0)
- Redeeming Nested Dissection: Parallelism Implies Fill (1999) (0)
- Fat Voronoi Diagrams (2010) (0)
- Finding Cut On Spectral-Hard Graphs Using Local Algorithms (2020) (0)
- Weighted Cheeger-Buser Inequalities, with Applications to Cutting Probability Densities-as Easy as 1,2,3 (2020) (0)
- Runtime-Efficient Meshing for Piecewise-Linear Complexes (2010) (0)
- The Path Resistance Method for Bounding lambda2 of a Laplacian (1997) (0)
- Inversion of Quadratic Bézier Triangles ∗ (2010) (0)
- Reducing Multicore Bandwidth Requirements for Combinatorial Multigrid (2010) (0)
- Cone Depth and the Center Vertex Theorem (2008) (0)
- Beyond Laplacians: Faster Approximations of Multicommodity Flow in Undirected Graphs Using Quadratically Coupled Electrical Flows ∗ (2012) (0)
This paper list is powered by the following services:
Other Resources About Gary Miller
What Schools Are Affiliated With Gary Miller ?
Gary Miller is affiliated with the following schools:
