Riemann's Hypothesis and Tests for Primality. - Gary L. Miller (J. Comput. Syst. Sci., 1976)

On Taking Roots in Finite Fields - Leonard M. Adleman; Kenneth L. Manders; Gary L. Miller (FOCS, 1977)

On the n^log n Isomorphism Technique: A Preliminary Report - Gary L. Miller (STOC, 1978)

On Determining the Genus of a Graph in O(v^O(g)) Steps - I. S. Filotti; Gary L. Miller; John H. Reif (STOC, 1979)

Graph Isomorphism, General Remarks. - Gary L. Miller (J. Comput. Syst. Sci., 1979)

Isomorphism Testing for Graphs of Bounded Genus - Gary L. Miller (STOC, 1980)

Regular groups of automorphisms of cubic graphs. - Dragomir Z. Djokovic; Gary L. Miller (J. Comb. Theory B, 1980)

New Layouts for the Shuffle-Exchange Graph (Extended Abstract) - Daniel J. Kleitman; Frank Thomson Leighton; Margaret Lepley; Gary L. Miller (STOC, 1981)

Isomorphism Testing and Canonical Forms for k-Contractable Graphs (A Generalization of Bounded Valence and Bounded Genus). - Gary L. Miller (FCT, 1983)

Isomorphism of k-Contractible Graphs. A Generalization of Bounded Valence and Bounded Genus - Gary L. Miller (Inf. Control., 1983)

Isomorphism of Graphs Which are Pairwise k-separable - Gary L. Miller (Inf. Control., 1983)

An Asymptotically Optimal Layout for the Shuffle-Exchange Graph. - Daniel J. Kleitman; Frank Thomson Leighton; Margaret Lepley; Gary L. Miller (J. Comput. Syst. Sci., 1983)

Coordinating Pebble Motion on Graphs, the Diameter of Permutation Groups, and Applications - Daniel Kornhauser; Gary L. Miller; Paul G. Spirakis (FOCS, 1984)

Sums of Divisors, Perfect Numbers, and Factoring (Extended Abstract) - Eric Bach 001; Gary L. Miller; Jeffrey O. Shallit (STOC, 1984)

Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number Fields. - Dennis Estes; Leonard M. Adleman; Kireeti Kompella; Kevin S. McCurley; Gary L. Miller (CRYPTO, 1985)

Parallel Tree Contraction and Its Application - Gary L. Miller; John H. Reif (FOCS, 1985)

Solvability by Radicals is in Polynomial Time. - Susan Landau 001; Gary L. Miller (J. Comput. Syst. Sci., 1985)

Efficient Parallel Evaluation of Straight-line Code and Arithmetric Circuits. - Gary L. Miller; Vijaya Ramachandran; Erich L. Kaltofen (Aegean Workshop on Computing, 1986)

Finding Small Simple Cycle Separators for 2-Connected Planar Graphs. - Gary L. Miller (J. Comput. Syst. Sci., 1986)

Sums of Divisors, Perfect Numbers and Factoring. - Eric Bach 001; Gary L. Miller; Jeffrey O. Shallit (SIAM J. Comput., 1986)

A Parallel Algorithm for Finding a Separator in Planar Graphs - Hillel Gazit; Gary L. Miller (FOCS, 1987)

An additivity theorem for the genus of a graph. - Gary L. Miller (J. Comb. Theory B, 1987)

Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers. - Ravindran Kannan; Gary L. Miller; Larry Rudolph (SIAM J. Comput., 1987)

An Improved Parallel Algorithm that Computes the BFS Numbering of a Directed Graph. - Hillel Gazit; Gary L. Miller (Inf. Process. Lett., 1988)

Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits. - Gary L. Miller; Vijaya Ramachandran; Erich L. Kaltofen (SIAM J. Comput., 1988)

Flow in Planar Graphs with Multiple Sources and Sinks (Extended Abstract) - Gary L. Miller; Joseph Naor (FOCS, 1989)

Constructing Trees in Parallel. - Mikhail J. Atallah; S. Rao Kosaraju; Lawrence L. Larmore; Gary L. Miller; Shang-Hua Teng (SPAA, 1989)

Parallel Tree Contraction Part 1: Fundamentals. - Gary L. Miller; John H. Reif (Adv. Comput. Res., 1989)

Planar Separators and the Euclidean Norm. - Hillel Gazit; Gary L. Miller (SIGAL International Symposium on Algorithms, 1990)

Separators in Two and Three Dimensions - Gary L. Miller; William P. Thurston (STOC, 1990)

Subtree isomorphism is in random NC. - Phillip B. Gibbons; Richard M. Karp; Gary L. Miller; Danny Soroker (Discret. Appl. Math., 1990)

A Simple Randomized Parallel Algorithm for List-Ranking. - Richard J. Anderson 001; Gary L. Miller (Inf. Process. Lett., 1990)

A Unified Geometric Approach to Graph Separators - Gary L. Miller; Shang-Hua Teng; Stephen A. Vavasis (FOCS, 1991)

Density Graphs and Separators. - Gary L. Miller; Stephen A. Vavasis (SODA, 1991)

Deterministic Parallel List Ranking. - Richard J. Anderson 001; Gary L. Miller (Algorithmica, 1991)

Parallel Tree Contraction, Part 2: Further Applications. - Gary L. Miller; John H. Reif (SIAM J. Comput., 1991)

Separator Based Parallel Divide and Conquer in Computational Geometry. - Alan M. Frieze; Gary L. Miller; Shang-Hua Teng (SPAA, 1992)

A Contraction Procedure for Planar Directed Graphs. - Stephen Guattery; Gary L. Miller (SPAA, 1992)

A new graph triconnectivity algorithm and its parallelization. - Gary L. Miller; Vijaya Ramachandran (Comb., 1992)

Approximating Center Points with Iterated Radon Points. - Kenneth L. Clarkson; David Eppstein; Gary L. Miller; Carl Sturtivant; Shang-Hua Teng (SCG, 1993)

Performance evaluation of a new parallel preconditioner. - Keith D. Gremban; Gary L. Miller; Marco Zagha (IPPS, 1995)

On the Performance of Spectral Graph Partitioning Methods. - Stephen Guattery; Gary L. Miller (SODA, 1995)

A Delaunay based numerical method for three dimensions: generation, formulation, and partition. - Gary L. Miller; Dafna Talmor; Shang-Hua Teng; Noel Walkington (STOC, 1995)

A Deterministic Linear Time Algorithm for Geometric Separators and its Applications. - David Eppstein; Gary L. Miller; Shang-Hua Teng (Fundam. Informaticae, 1995)

Flow in Planar Graphs with Multiple Sources and Sinks. - Gary L. Miller; Joseph Naor (SIAM J. Comput., 1995)

Developing a Practical Projection-Based Parallel Delaunay Algorithm. - Guy E. Blelloch; Gary L. Miller; Dafna Talmor (SCG, 1996)

Approximating center points with iterative Radon points. - Kenneth L. Clarkson; David Eppstein; Gary L. Miller; Carl Sturtivant; Shang-Hua Teng (Int. J. Comput. Geom. Appl., 1996)

Parallelizing Elimination Orders with Linear Fill. - Claudson F. Bornstein; Bruce M. Maggs; Gary L. Miller; R. Ravi 001 (FOCS, 1997)

The Path Resistance Method for Bounding lambda2 of a Laplacian. - Stephen Guattery; Frank Thomson Leighton; Gary L. Miller (SODA, 1997)

Optimal Good-Aspect-Ratio Coarsening for Unstructured Meshes. - Gary L. Miller; Dafna Talmor; Shang-Hua Teng (SODA, 1997)

Tree-Based Parallel Algorithm Design. - Gary L. Miller; Shang-Hua Teng (Algorithmica, 1997)

Separators for sphere-packings and nearest neighbor graphs. - Gary L. Miller; Shang-Hua Teng; William P. Thurston; Stephen A. Vavasis (J. ACM, 1997)

Moments of Inertia and Graph Separators. - Keith D. Gremban; Gary L. Miller; Shang-Hua Teng (J. Comb. Optim., 1997)

Control Volume Meshes Using Sphere Packing. - Gary L. Miller (IRREGULAR, 1998)

Geometric Mesh Partitioning: Implementation and Experiments. - John R. Gilbert; Gary L. Miller; Shang-Hua Teng (SIAM J. Sci. Comput., 1998)

Geometric Separators for Finite-Element Meshes. - Gary L. Miller; Shang-Hua Teng; William P. Thurston; Stephen A. Vavasis (SIAM J. Sci. Comput., 1998)

On the Quality of Spectral Separators. - Stephen Guattery; Gary L. Miller (SIAM J. Matrix Anal. Appl., 1998)

Redeeming Nested Dissection: Parallelism Implies Fill. - Claudson F. Bornstein; Bruce M. Maggs; Gary L. Miller; R. Ravi 001 (PP, 1999)

Estimating Interpolation Error: A Combinatorial Approach. - Stephen Guattery; Gary L. Miller; Noel Walkington (SODA, 1999)

Tradeoffs Between Parallelism and Fill in Nested Dissection. - Claudson F. Bornstein; Bruce M. Maggs; Gary L. Miller (SPAA, 1999)

Design and Implementation of a Practical Parallel Delaunay Algorithm. - Guy E. Blelloch; Jonathan C. Hardwick; Gary L. Miller; Dafna Talmor (Algorithmica, 1999)

The Path Resistance Method For Bounding The Smallest Nontrivial Eigenvalue Of A Laplacian. - Stephen Guattery; Frank Thomson Leighton; Gary L. Miller (Comb. Probab. Comput., 1999)

Data Generation for Geometric Algorithms on Non-Uniform Distributions. - Gary L. Miller; Dafna Talmor; Shang-Hua Teng (Int. J. Comput. Geom. Appl., 1999)

Optimal Coarsening of Unstructured Meshes. - Gary L. Miller; Dafna Talmor; Shang-Hua Teng (J. Algorithms, 1999)

The Dynamic Parallel Complexity of Computational Circuits. - Gary L. Miller; Shang-Hua Teng (SIAM J. Comput., 1999)

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 (SC, 2000)

Smoothing and cleaning up slivers. - Herbert Edelsbrunner; Xiang-Yang Li 001; Gary L. Miller; Andreas Stathopoulos; Dafna Talmor; Shang-Hua Teng; Alper Üngör; Noel Walkington (STOC, 2000)

Graph Embeddings and Laplacian Eigenvalues. - Stephen Guattery; Gary L. Miller (SIAM J. Matrix Anal. Appl., 2000)

Persistent triangulations Journal of Functional Programming. - Guy E. Blelloch; Hal Burch; Karl Crary; Robert Harper 001; Gary L. Miller; Noel Walkington (J. Funct. Program., 2001)

Fully Incremental 3D Delaunay Refinement Mesh Generation. - Gary L. Miller; Steven E. Pav; Noel Walkington (IMR, 2002)

When and Why Ruppert's Algorithm Works. - Gary L. Miller; Steven E. Pav; Noel Walkington (IMR, 2003)

Using bistellar flips for rotations in point location structures. - Benoît Hudson; Gary L. Miller (CCCG, 2004)

A Bézier-based approach to unstructured moving meshes. - David E. Cardoze; Alexandre Cunha; Gary L. Miller; Todd Phillips; Noel Walkington (SCG, 2004)

A Bezier-Based Moving Mesh Framework for Simulation with Elastic Membranes. - David E. Cardoze; Gary L. Miller; Mark Olah; Todd Phillips (IMR, 2004)

A time efficient Delaunay refinement algorithm. - Gary L. Miller (SODA, 2004)

Lower bounds for graph embeddings and combinatorial preconditioners. - Gary L. Miller; Peter C. Richter (SPAA, 2004)

Corrected Laplacians: Closer Cuts and Segmentation with Shape Priors. - David Tolliver; Gary L. Miller; Robert T. Collins (CVPR (2), 2005)

Finding effective support-tree preconditioners. - Bruce M. Maggs; Gary L. Miller; Ojas Parekh; R. Ravi 001; Shan Leung Maverick Woo (SPAA, 2005)

When and why delaunay refinement algorithms work. - Gary L. Miller; Steven E. Pav; Noel Walkington (Int. J. Comput. Geom. Appl., 2005)

Graph Partitioning by Spectral Rounding: Applications in Image Segmentation and Clustering. - David Tolliver; Gary L. Miller (CVPR (1), 2006)

Representing Topological Structures Using Cell-Chains. - David E. Cardoze; Gary L. Miller; Todd Phillips (GMP, 2006)

Sparse Voronoi Refinement. - Benoît Hudson; Gary L. Miller; Todd Phillips (IMR, 2006)

Size Competitive Meshing Without Large Angles. - Gary L. Miller; Todd Phillips; Donald R. Sheehy (ICALP, 2007)

SVR: Practical Engineering of a Fast 3D Meshing Algorithm*. - Umut A. Acar; Benoît Hudson; Gary L. Miller; Todd Phillips (IMR, 2007)

A linear work, O(n1/6) time, parallel algorithm for solving planar Laplacians. - Ioannis Koutis; Gary L. Miller (SODA, 2007)

Sparse parallel Delaunay mesh refinement. - Benoît Hudson; Gary L. Miller; Todd Phillips (SPAA, 2007)

Linear-Size Meshes. - Don Sheehy; Gary L. Miller; Todd Phillips (CCCG, 2008)

Graph partitioning into isolated, high conductance clusters: theory, computation and applications to preconditioning. - Ioannis Koutis; Gary L. Miller (SPAA, 2008)

The Centervertex Theorem for Wedge Depth. - Gary L. Miller; Todd Phillips; Donald R. Sheehy (CCCG, 2009)

Approximate center points with proofs. - Gary L. Miller; Donald R. Sheehy (SCG, 2009)

DOULION: counting triangles in massive graphs with a coin. - Charalampos E. Tsourakakis; U Kang; Gary L. Miller; Christos Faloutsos (KDD, 2009)

Size complexity of volume meshes vs. surface meshes. - Benoît Hudson; Gary L. Miller; Todd Phillips; Don Sheehy (SODA, 2009)

Approximate Triangle Counting - Charalampos E. Tsourakakis; Mihail N. Kolountzakis; Gary L. Miller (CoRR, 2009)

Topological inference via meshing. - Benoît Hudson; Gary L. Miller; Steve Oudot; Donald R. Sheehy (SCG, 2010)

Hierarchical Diagonal Blocking and Precision Reduction Applied to Combinatorial Multigrid. - Guy E. Blelloch; Ioannis Koutis; Gary L. Miller; Kanat Tangwongsan (SC, 2010)

Approximate centerpoints with proofs. - Gary L. Miller; Donald R. Sheehy (Comput. Geom., 2010)

Approaching optimality for solving SDD systems - Ioannis Koutis; Gary L. Miller; Richard Peng (CoRR, 2010)

Approximate Dynamic Programming for Fast Denoising of aCGH Data - Gary L. Miller; Richard Peng; Russell Schwartz; Charalampos E. Tsourakakis (CoRR, 2010)

Beating the spread: time-optimal point meshing. - Gary L. Miller; Todd Phillips; Don Sheehy (SCG, 2011)

A Nearly-m log n Time Solver for SDD Linear Systems. - Ioannis Koutis; Gary L. Miller; Richard Peng (FOCS, 2011)

Approximate Dynamic Programming using Halfspace Queries and Multiscale Monge Decomposition. - Gary L. Miller; Richard Peng; Russell Schwartz; Charalampos E. Tsourakakis (SODA, 2011)

Near linear-work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs. - Guy E. Blelloch; Anupam Gupta 001; Ioannis Koutis; Gary L. Miller; Richard Peng; Kanat Tangwongsan (SPAA, 2011)

Solving SDD linear systems in time Õ(mlog nlog(1/ε)) - Ioannis Koutis; Gary L. Miller; Richard Peng (CoRR, 2011)

Electrical Flow Algorithms for Total Variation Minimization - Aleksander Madry; Gary L. Miller; Richard Peng (CoRR, 2011)

Combinatorial preconditioners and multilevel solvers for problems in computer vision and image processing. - Ioannis Koutis; Gary L. Miller; David Tolliver (Comput. Vis. Image Underst., 2011)

Approximation algorithms for speeding up dynamic programming and denoising aCGH data. - Charalampos E. Tsourakakis; Richard Peng; Maria A. Tsiarli; Gary L. Miller; Russell Schwartz (ACM J. Exp. Algorithmics, 2011)

Triangle Sparsifiers. - Charalampos E. Tsourakakis; Mihail N. Kolountzakis; Gary L. Miller (J. Graph Algorithms Appl., 2011)

Faster approximate multicommodity flow using quadratically coupled flows. - Jonathan A. Kelner; Gary L. Miller; Richard Peng (STOC, 2012)

A fast solver for a class of linear systems. - Ioannis Koutis; Gary L. Miller; Richard Peng (Commun. ACM, 2012)

Iterative Approaches to Row Sampling - Gary L. Miller; Richard Peng (CoRR, 2012)

A New Approach to Output-Sensitive Voronoi Diagrams - Gary L. Miller; Donald R. Sheehy (CoRR, 2012)

Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning. - Mihail N. Kolountzakis; Gary L. Miller; Richard Peng; Charalampos E. Tsourakakis (Internet Math., 2012)

A new approach to output-sensitive voronoi diagrams and delaunay triangulations. - Gary L. Miller; Donald R. Sheehy (SoCG, 2013)

A fast algorithm for well-spaced points and approximate delaunay graphs. - Gary L. Miller; Donald R. Sheehy; Ameya Velingker (SoCG, 2013)

Iterative Row Sampling. - Mu Li; Gary L. Miller; Richard Peng (FOCS, 2013)

Runtime guarantees for regression problems. - Hui Han Chin; Aleksander Madry; Gary L. Miller; Richard Peng (ITCS, 2013)

Approximate Maximum Flow on Separable Undirected Graphs. - Gary L. Miller; Richard Peng (SODA, 2013)

Parallel graph decompositions using random shifts. - Gary L. Miller; Richard Peng; Shen Chen Xu (SPAA, 2013)

Solving large optimization problems using spectral graph theory. - Gary L. Miller (STOC, 2013)

Parallel Algorithms for Approximate Undirected Shortest Paths in $m log^{3+α}n$ Work. - Gary L. Miller; Richard Peng; Shen Chen Xu (CoRR, 2013)

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 (SODA, 2014)

Solving SDD linear systems in nearly mlog1/2n time. - Michael B. Cohen; Rasmus Kyng; Gary L. Miller; Jakub W. Pachocki; Richard Peng; Anup B. Rao; Shen Chen Xu (STOC, 2014)

The Role of Public Comprehensive Universities in Closing the Innovation Deficit. - Gary L. Miller; Robert R. Hoon (Computer, 2014)

Stretching Stretch. - Michael B. Cohen; Gary L. Miller; Jakub W. Pachocki; Richard Peng; Shen Chen Xu (CoRR, 2014)

A Generalized Cheeger Inequality. - Ioannis Koutis; Gary L. Miller; Richard Peng (CoRR, 2014)

A New Approach to Output-Sensitive Construction of Voronoi Diagrams and Delaunay Triangulations. - Gary L. Miller; Donald R. Sheehy (Discret. Comput. Geom., 2014)

Nearly-Linear Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs. - Guy E. Blelloch; Anupam Gupta 001; Ioannis Koutis; Gary L. Miller; Richard Peng; Kanat Tangwongsan (Theory Comput. Syst., 2014)

Approaching Optimality for Solving SDD Linear Systems. - Ioannis Koutis; Gary L. Miller; Richard Peng (SIAM J. Comput., 2014)

The Revolution in Graph Theoretic Optimization Problems. - Gary L. Miller (SPAA, 2015)

Improved Parallel Algorithms for Spanners and Hopsets. - Gary L. Miller; Richard Peng; Adrian Vladu; Shen Chen Xu (SPAA, 2015)

Approximating Nearest Neighbor Distances. - Michael B. Cohen; Brittany Terese Fasy; Gary L. Miller; Amir Nayyeri; Donald R. Sheehy; Ameya Velingker (WADS, 2015)

Simple and Scalable Constrained Clustering: a Generalized Spectral Method. - Mihai Cucuringu; Ioannis Koutis; Sanjay Chawla; Gary L. Miller; Richard Peng (AISTATS, 2016)

An Empirical Study of Cycle Toggling Based Laplacian Solvers. - Kevin Deweese; John R. Gilbert; Gary L. Miller; Richard Peng; Hao Ran Xu; Shen Chen Xu (CSC, 2016)

Geometric median in nearly linear time. - Michael B. Cohen; Yin Tat Lee; Gary L. Miller; Jakub Pachocki; Aaron Sidford (STOC, 2016)

Routing under balance. - Alina Ene; Gary L. Miller; Jakub Pachocki; Aaron Sidford (STOC, 2016)

ScaleNet: a literature-based model of scale insect biology and systematics. - Mayrolin García Morales; Barbara D. Denno; Douglass R. Miller; Gary L. Miller; Yair Ben-Dov; Nate B. Hardy (Database J. Biol. Databases Curation, 2016)

Scalable Constrained Clustering: A Generalized Spectral Method. - Mihai Cucuringu; Ioannis Koutis; Sanjay Chawla; Gary L. Miller; Richard Peng (CoRR, 2016)

Intrinsic Metrics: Nearest Neighbor and Edge Squared Distances. - Timothy Chu; Gary L. Miller; Donald R. Sheehy (CoRR, 2017)

On Computing Min-Degree Elimination Orderings. - Matthew Fahrbach; Gary L. Miller; Richard Peng; Saurabh Sawlani; Junxing Wang; Shen Chen Xu (CoRR, 2017)

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 (FOCS, 2018)

Hardy-Muckenhoupt Bounds for Laplacian Eigenvalues. - Gary L. Miller; Noel J. Walkington; Alex L. Wang (APPROX-RANDOM, 2019)

Exact computation of a manifold metric, via Lipschitz Embeddings and Shortest Paths on a Graph. - Timothy Chu; Gary L. Miller; Donald R. Sheehy (SODA, 2020)

Weighted Cheeger and Buser Inequalities, with Applications to Clustering and Cutting Probability Densities. - Timothy Chu; Gary L. Miller; Noel J. Walkington; Alex L. Wang (CoRR, 2020)

Functions that Preserve Manhattan Distances. - Timothy Chu; Gary L. Miller; Shyam Narayanan; Mark Sellke (CoRR, 2020)

Spectral Clustering on Large Datasets: When Does it Work? Theory from Continuous Clustering and Density Cheeger-Buser. - Timothy Chu; Gary L. Miller; Noel Walkington (CoRR, 2023)

Metric Transforms and Low Rank Representations of Kernels for Fast Attention. - Timothy Chu; Josh Alman; Gary L. Miller; Shyam Narayanan; Mark Sellke; Zhao Song 002 (NeurIPS, 2024)