| 2020 | SODA | Exact computation of a manifold metric, via Lipschitz Embeddings and Shortest Paths on a Graph. | Timothy Chu, Gary L. Miller, Donald R. Sheehy |
| 2018 | FOCS | Graph Sketching against Adaptive Adversaries Applied to the Minimum Degree Algorithm. | Matthew Fahrbach, Gary L. Miller, Richard Peng, Saurabh Sawlani, Junxing Wang, Shen Chen Xu |
| 2016 | AISTATS | Simple and Scalable Constrained Clustering: a Generalized Spectral Method. | Mihai Cucuringu, Ioannis Koutis, Sanjay Chawla, Gary L. Miller, Richard Peng |
| 2016 | STOC | Geometric median in nearly linear time. | Michael B. Cohen, Yin Tat Lee, Gary L. Miller, Jakub Pachocki, Aaron Sidford |
| 2016 | STOC | Routing under balance. | Alina Ene, Gary L. Miller, Jakub Pachocki, Aaron Sidford |
| 2015 | SPAA | The Revolution in Graph Theoretic Optimization Problems. | Gary L. Miller |
| 2015 | SPAA | Improved Parallel Algorithms for Spanners and Hopsets. | Gary L. Miller, Richard Peng, Adrian Vladu, Shen Chen Xu |
| 2015 | WADS | Approximating Nearest Neighbor Distances. | Michael B. Cohen, Brittany Terese Fasy, Gary L. Miller, Amir Nayyeri, Donald R. Sheehy, Ameya Velingker |
| 2014 | SODA | Solving 1-Laplacians in Nearly Linear Time: Collapsing and Expanding a Topological Ball. | Michael B. Cohen, Brittany Terese Fasy, Gary L. Miller, Amir Nayyeri, Richard Peng, Noel Walkington |
| 2014 | STOC | Solving SDD linear systems in nearly | Michael B. Cohen, Rasmus Kyng, Gary L. Miller, Jakub W. Pachocki, Richard Peng, Anup B. Rao, Shen Chen Xu |
| 2013 | FOCS | Iterative Row Sampling. | Mu Li, Gary L. Miller, Richard Peng |
| 2013 | SODA | Approximate Maximum Flow on Separable Undirected Graphs. | Gary L. Miller, Richard Peng |
| 2013 | STOC | Solving large optimization problems using spectral graph theory. | Gary L. Miller |
| 2013 | SPAA | Parallel graph decompositions using random shifts. | Gary L. Miller, Richard Peng, Shen Chen Xu |
| 2012 | STOC | Faster approximate multicommodity flow using quadratically coupled flows. | Jonathan A. Kelner, Gary L. Miller, Richard Peng |
| 2011 | FOCS | A Nearly-m log n Time Solver for SDD Linear Systems. | Ioannis Koutis, Gary L. Miller, Richard Peng |
| 2011 | SODA | Approximate Dynamic Programming using Halfspace Queries and Multiscale Monge Decomposition. | Gary L. Miller, Richard Peng, Russell Schwartz, Charalampos E. Tsourakakis |
| 2011 | SPAA | Near linear-work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs. | Guy E. Blelloch, Anupam Gupta, Ioannis Koutis, Gary L. Miller, Richard Peng, Kanat Tangwongsan |
| 2010 | FOCS | Approaching Optimality for Solving SDD Linear Systems. | Ioannis Koutis, Gary L. Miller, Richard Peng |
| 2010 | SC | Hierarchical Diagonal Blocking and Precision Reduction Applied to Combinatorial Multigrid. | Guy E. Blelloch, Ioannis Koutis, Gary L. Miller, Kanat Tangwongsan |
| 2010 | WAW | Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning. | Mihail N. Kolountzakis, Gary L. Miller, Richard Peng, Charalampos E. Tsourakakis |
| 2009 | ISVC | Combinatorial Preconditioners and Multilevel Solvers for Problems in Computer Vision and Image Processing. | Ioannis Koutis, Gary L. Miller, David Tolliver |
| 2009 | KDD | DOULION: counting triangles in massive graphs with a coin. | Charalampos E. Tsourakakis, U Kang, Gary L. Miller, Christos Faloutsos |
| 2009 | SODA | Size complexity of volume meshes vs. surface meshes. | Benot Hudson, Gary L. Miller, Todd Phillips, Don Sheehy |
| 2008 | SPAA | Graph partitioning into isolated, high conductance clusters: theory, computation and applications to preconditioning. | Ioannis Koutis, Gary L. Miller |
| 2007 | ICALP | Size Competitive Meshing Without Large Angles. | Gary L. Miller, Todd Phillips, Donald R. Sheehy |
| 2007 | SODA | A linear work, O(n | Ioannis Koutis, Gary L. Miller |
| 2007 | SPAA | Sparse parallel Delaunay mesh refinement. | Benot Hudson, Gary L. Miller, Todd Phillips |
| 2006 | CVPR | Graph Partitioning by Spectral Rounding: Applications in Image Segmentation and Clustering. | David Tolliver, Gary L. Miller |
| 2006 | GMP | Representing Topological Structures Using Cell-Chains. | David E. Cardoze, Gary L. Miller, Todd Phillips |
| 2005 | CVPR | Corrected Laplacians: Closer Cuts and Segmentation with Shape Priors. | David Tolliver, Gary L. Miller, Robert T. Collins |
| 2005 | SPAA | Finding effective support-tree preconditioners. | Bruce M. Maggs, Gary L. Miller, Ojas Parekh, R. Ravi, Shan Leung Maverick Woo |
| 2004 | SODA | A time efficient Delaunay refinement algorithm. | Gary L. Miller |
| 2004 | SPAA | Lower bounds for graph embeddings and combinatorial preconditioners. | Gary L. Miller, Peter C. Richter |
| 2000 | SC | A Parallel Dynamic-Mesh Lagrangian Method for Simulation of Flows with Dynamic Interfaces. | James F. Antaki, Guy E. Blelloch, Omar Ghattas, Ivan Malcevic, Gary L. Miller, Noel Walkington |
| 2000 | STOC | Smoothing and cleaning up slivers. | Herbert Edelsbrunner, Xiang-Yang Li, Gary L. Miller, Andreas Stathopoulos, Dafna Talmor, Shang-Hua Teng, Alper ngr, Noel Walkington |
| 1999 | SODA | Estimating Interpolation Error: A Combinatorial Approach. | Stephen Guattery, Gary L. Miller, Noel Walkington |
| 1999 | SPAA | Tradeoffs Between Parallelism and Fill in Nested Dissection. | Claudson F. Bornstein, Bruce M. Maggs, Gary L. Miller |
| 1997 | FOCS | Parallelizing Elimination Orders with Linear Fill. | Claudson F. Bornstein, Bruce M. Maggs, Gary L. Miller, R. Ravi |
| 1997 | SODA | The Path Resistance Method for Bounding lambda | Stephen Guattery, Frank Thomson Leighton, Gary L. Miller |
| 1997 | SODA | Optimal Good-Aspect-Ratio Coarsening for Unstructured Meshes. | Gary L. Miller, Dafna Talmor, Shang-Hua Teng |
| 1995 | SODA | On the Performance of Spectral Graph Partitioning Methods. | Stephen Guattery, Gary L. Miller |
| 1995 | STOC | A Delaunay based numerical method for three dimensions: generation, formulation, and partition. | Gary L. Miller, Dafna Talmor, Shang-Hua Teng, Noel Walkington |
| 1994 | SODA | Moments of Inertia and Graph Separators. | Keith D. Gremban, Gary L. Miller, Shang-Hua Teng |
| 1992 | SPAA | Separator Based Parallel Divide and Conquer in Computational Geometry. | Alan M. Frieze, Gary L. Miller, Shang-Hua Teng |
| 1992 | SPAA | A Contraction Procedure for Planar Directed Graphs. | Stephen Guattery, Gary L. Miller |
| 1991 | FOCS | A Unified Geometric Approach to Graph Separators | Gary L. Miller, Shang-Hua Teng, Stephen A. Vavasis |
| 1991 | SODA | Density Graphs and Separators. | Gary L. Miller, Stephen A. Vavasis |
| 1990 | STOC | Separators in Two and Three Dimensions | Gary L. Miller, William P. Thurston |
| 1989 | FOCS | Flow in Planar Graphs with Multiple Sources and Sinks (Extended Abstract) | Gary L. Miller, Joseph Naor |
| 1989 | SPAA | Constructing Trees in Parallel. | Mikhail J. Atallah, S. Rao Kosaraju, Lawrence L. Larmore, Gary L. Miller, Shang-Hua Teng |
| 1987 | FOCS | A Parallel Algorithm for Finding a Separator in Planar Graphs | Hillel Gazit, Gary L. Miller |
| 1987 | STOC | A New Graph Triconnectivity Algorithm and Its Parallelization | Gary L. Miller, Vijaya Ramachandran |
| 1987 | STOC | Dynamic Parallel Complexity of Computational Circuits | Gary L. Miller, Shang-Hua Teng |
| 1985 | CRYPTO | Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number Fields. | Dennis Estes, Leonard M. Adleman, Kireeti Kompella, Kevin S. McCurley, Gary L. Miller |
| 1985 | FOCS | Parallel Tree Contraction and Its Application | Gary L. Miller, John H. Reif |
| 1984 | FOCS | Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers | Ravindran Kannan, Gary L. Miller, Larry Rudolph |
| 1984 | FOCS | Coordinating Pebble Motion on Graphs, the Diameter of Permutation Groups, and Applications | Daniel Kornhauser, Gary L. Miller, Paul G. Spirakis |
| 1984 | STOC | Sums of Divisors, Perfect Numbers, and Factoring (Extended Abstract) | Eric Bach, Gary L. Miller, Jeffrey O. Shallit |
| 1984 | STOC | Finding Small Simple Cycle Separators for 2-Connected Planar Graphs | Gary L. Miller |
| 1983 | FCT | Isomorphism Testing and Canonical Forms for k-Contractable Graphs (A Generalization of Bounded Valence and Bounded Genus). | Gary L. Miller |
| 1983 | STOC | Solvability by Radicals is in Polynomial Time | Susan Landau, Gary L. Miller |
| 1981 | STOC | New Layouts for the Shuffle-Exchange Graph (Extended Abstract) | Daniel J. Kleitman, Frank Thomson Leighton, Margaret Lepley, Gary L. Miller |
| 1980 | STOC | Isomorphism Testing for Graphs of Bounded Genus | Gary L. Miller |
| 1979 | STOC | On Determining the Genus of a Graph in O(v^O(g)) Steps | I. S. Filotti, Gary L. Miller, John H. Reif |
| 1978 | STOC | On the n^log n Isomorphism Technique: A Preliminary Report | Gary L. Miller |
| 1977 | FOCS | On Taking Roots in Finite Fields | Leonard M. Adleman, Kenneth L. Manders, Gary L. Miller |
| 1977 | STOC | Graph Isomorphism, General Remarks | Gary L. Miller |
| 1975 | STOC | Riemann's Hypothesis and Tests for Primality | Gary L. Miller |