Gary L. Miller

177 papers A* 51A 4B 17C 2Journal 75Unranked 28

Year	Rank	Type	Title / Venue / Authors
2024	A*	`conf`	Metric Transforms and Low Rank Representations of Kernels for Fast Attention. NeurIPS Timothy Chu, Josh Alman, Gary L. Miller, Shyam Narayanan, Mark Sellke, Zhao Song
2023	J	`jnl`	Spectral Clustering on Large Datasets: When Does it Work? Theory from Continuous Clustering and Density Cheeger-Buser. CoRR Timothy Chu, Gary L. Miller, Noel Walkington
2020	A*	`conf`	Exact computation of a manifold metric, via Lipschitz Embeddings and Shortest Paths on a Graph. SODA Timothy Chu, Gary L. Miller, Donald R. Sheehy
2020	J	`jnl`	Functions that Preserve Manhattan Distances. CoRR Timothy Chu, Gary L. Miller, Shyam Narayanan, Mark Sellke
2020	J	`jnl`	Weighted Cheeger and Buser Inequalities, with Applications to Clustering and Cutting Probability Densities. CoRR Timothy Chu, Gary L. Miller, Noel J. Walkington, Alex L. Wang
2019	—	`conf`	Hardy-Muckenhoupt Bounds for Laplacian Eigenvalues. APPROX-RANDOM Gary L. Miller, Noel J. Walkington, Alex L. Wang
2018	J	`jnl`	Graph Sketching Against Adaptive Adversaries Applied to the Minimum Degree Algorithm. CoRR Matthew Fahrbach, Gary L. Miller, Richard Peng, Saurabh Sawlani, Junxing Wang, Shen Chen Xu
2018	A*	`conf`	Graph Sketching against Adaptive Adversaries Applied to the Minimum Degree Algorithm. FOCS Matthew Fahrbach, Gary L. Miller, Richard Peng, Saurabh Sawlani, Junxing Wang, Shen Chen Xu
2018	J	`jnl`	Hardy-Muckenhoupt Bounds for Laplacian Eigenvalues. CoRR Gary L. Miller, Noel J. Walkington, Alex L. Wang
2017	J	`jnl`	Intrinsic Metrics: Nearest Neighbor and Edge Squared Distances. CoRR Timothy Chu, Gary L. Miller, Donald R. Sheehy
2017	J	`jnl`	On Computing Min-Degree Elimination Orderings. CoRR Matthew Fahrbach, Gary L. Miller, Richard Peng, Saurabh Sawlani, Junxing Wang, Shen Chen Xu
2016	—	`conf`	An Empirical Study of Cycle Toggling Based Laplacian Solvers. CSC Kevin Deweese, John R. Gilbert, Gary L. Miller, Richard Peng, Hao Ran Xu, Shen Chen Xu
2016	J	`jnl`	An Empirical Study of Cycle Toggling Based Laplacian Solvers. CoRR Kevin Deweese, John R. Gilbert, Gary L. Miller, Richard Peng, Hao Ran Xu, Shen Chen Xu
2016	J	`jnl`	Geometric Median in Nearly Linear Time. CoRR Michael B. Cohen, Yin Tat Lee, Gary L. Miller, Jakub Pachocki, Aaron Sidford
2016	A*	`conf`	Geometric median in nearly linear time. STOC Michael B. Cohen, Yin Tat Lee, Gary L. Miller, Jakub Pachocki, Aaron Sidford
2016	J	`jnl`	Routing under Balance. CoRR Alina Ene, Gary L. Miller, Jakub Pachocki, Aaron Sidford
2016	A*	`conf`	Routing under balance. STOC Alina Ene, Gary L. Miller, Jakub Pachocki, Aaron Sidford
2016	J	`jnl`	Scalable Constrained Clustering: A Generalized Spectral Method. CoRR Mihai Cucuringu, Ioannis Koutis, Sanjay Chawla, Gary L. Miller, Richard Peng
2016	J	`jnl`	ScaleNet: a literature-based model of scale insect biology and systematics. Database J. Biol. Databases Curation Mayrolin García Morales, Barbara D. Denno, Douglass R. Miller, Gary L. Miller, Yair Ben-Dov, Nate B. Hardy
2016	A	`conf`	Simple and Scalable Constrained Clustering: a Generalized Spectral Method. AISTATS Mihai Cucuringu, Ioannis Koutis, Sanjay Chawla, Gary L. Miller, Richard Peng
2015	B	`conf`	Approximating Nearest Neighbor Distances. WADS Michael B. Cohen, Brittany Terese Fasy, Gary L. Miller, Amir Nayyeri, Donald R. Sheehy, Ameya Velingker
2015	J	`jnl`	Approximating Nearest Neighbor Distances. CoRR Michael B. Cohen, Brittany Terese Fasy, Gary L. Miller, Amir Nayyeri, Donald R. Sheehy, Ameya Velingker
2015	B	`conf`	Improved Parallel Algorithms for Spanners and Hopsets. SPAA Gary L. Miller, Richard Peng, Adrian Vladu, Shen Chen Xu
2015	B	`conf`	The Revolution in Graph Theoretic Optimization Problems. SPAA Gary L. Miller
2014	J	`jnl`	A Generalized Cheeger Inequality. CoRR Ioannis Koutis, Gary L. Miller, Richard Peng
2014	J	`jnl`	A New Approach to Output-Sensitive Construction of Voronoi Diagrams and Delaunay Triangulations. Discret. Comput. Geom. Gary L. Miller, Donald R. Sheehy
2014	J	`jnl`	Approaching Optimality for Solving SDD Linear Systems. SIAM J. Comput. Ioannis Koutis, Gary L. Miller, Richard Peng
2014	J	`jnl`	Nearly-Linear Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs. Theory Comput. Syst. Guy E. Blelloch, Anupam Gupta, Ioannis Koutis, Gary L. Miller, Richard Peng, Kanat Tangwongsan
2014	A*	`conf`	Solving 1-Laplacians in Nearly Linear Time: Collapsing and Expanding a Topological Ball. SODA Michael B. Cohen, Brittany Terese Fasy, Gary L. Miller, Amir Nayyeri, Richard Peng, Noel Walkington
2014	A*	`conf`	Solving SDD linear systems in nearly STOC Michael B. Cohen, Rasmus Kyng, Gary L. Miller, Jakub W. Pachocki, Richard Peng, Anup B. Rao, Shen Chen Xu
2014	J	`jnl`	Stretching Stretch. CoRR Michael B. Cohen, Gary L. Miller, Jakub W. Pachocki, Richard Peng, Shen Chen Xu
2014	J	`jnl`	The Role of Public Comprehensive Universities in Closing the Innovation Deficit. Computer Gary L. Miller, Robert R. Hoon
2013	J	`jnl`	A Fast Algorithm for Well-Spaced Points and Approximate Delaunay Graphs CoRR Gary L. Miller, Donald R. Sheehy, Ameya Velingker
2013	A*	`conf`	A fast algorithm for well-spaced points and approximate delaunay graphs. SoCG Gary L. Miller, Donald R. Sheehy, Ameya Velingker
2013	A*	`conf`	A new approach to output-sensitive voronoi diagrams and delaunay triangulations. SoCG Gary L. Miller, Donald R. Sheehy
2013	A*	`conf`	Approximate Maximum Flow on Separable Undirected Graphs. SODA Gary L. Miller, Richard Peng
2013	A*	`conf`	Iterative Row Sampling. FOCS Mu Li, Gary L. Miller, Richard Peng
2013	J	`jnl`	Parallel Algorithms for Approximate Undirected Shortest Paths in $m\log^{3+α}n$ Work. CoRR Gary L. Miller, Richard Peng, Shen Chen Xu
2013	J	`jnl`	Parallel Graph Decompositions Using Random Shifts. CoRR Gary L. Miller, Richard Peng, Shen Chen Xu
2013	B	`conf`	Parallel graph decompositions using random shifts. SPAA Gary L. Miller, Richard Peng, Shen Chen Xu
2013	A	`conf`	Runtime guarantees for regression problems. ITCS Hui Han Chin, Aleksander Madry, Gary L. Miller, Richard Peng
2013	A*	`conf`	Solving large optimization problems using spectral graph theory. STOC Gary L. Miller
2012	J	`jnl`	A New Approach to Output-Sensitive Voronoi Diagrams CoRR Gary L. Miller, Donald R. Sheehy
2012	J	`jnl`	A fast solver for a class of linear systems. Commun. ACM Ioannis Koutis, Gary L. Miller, Richard Peng
2012	J	`jnl`	Approximate Maximum Flow on Separable Undirected Graphs CoRR Gary L. Miller, Richard Peng
2012	J	`jnl`	Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning. Internet Math. Mihail N. Kolountzakis, Gary L. Miller, Richard Peng, Charalampos E. Tsourakakis
2012	J	`jnl`	Faster Approximate Multicommodity Flow Using Quadratically Coupled Flows. CoRR Jonathan A. Kelner, Gary L. Miller, Richard Peng
2012	A*	`conf`	Faster approximate multicommodity flow using quadratically coupled flows. STOC Jonathan A. Kelner, Gary L. Miller, Richard Peng
2012	J	`jnl`	Iterative Approaches to Row Sampling CoRR Gary L. Miller, Richard Peng
2011	A*	`conf`	A Nearly-m log n Time Solver for SDD Linear Systems. FOCS Ioannis Koutis, Gary L. Miller, Richard Peng
2011	A*	`conf`	Approximate Dynamic Programming using Halfspace Queries and Multiscale Monge Decomposition. SODA Gary L. Miller, Richard Peng, Russell Schwartz, Charalampos E. Tsourakakis
2011	J	`jnl`	Approximation algorithms for speeding up dynamic programming and denoising aCGH data. ACM J. Exp. Algorithmics Charalampos E. Tsourakakis, Richard Peng, Maria A. Tsiarli, Gary L. Miller, Russell Schwartz
2011	—	`conf`	Beating the spread: time-optimal point meshing. SCG Gary L. Miller, Todd Phillips, Don Sheehy
2011	J	`jnl`	Combinatorial preconditioners and multilevel solvers for problems in computer vision and image processing. Comput. Vis. Image Underst. Ioannis Koutis, Gary L. Miller, David Tolliver
2011	J	`jnl`	Electrical Flow Algorithms for Total Variation Minimization CoRR Aleksander Madry, Gary L. Miller, Richard Peng
2011	J	`jnl`	Near Linear-Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs CoRR Guy E. Blelloch, Anupam Gupta, Ioannis Koutis, Gary L. Miller, Richard Peng, Kanat Tangwongsan
2011	B	`conf`	Near linear-work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs. SPAA Guy E. Blelloch, Anupam Gupta, Ioannis Koutis, Gary L. Miller, Richard Peng, Kanat Tangwongsan
2011	J	`jnl`	Solving SDD linear systems in time Õ(mlog nlog(1/ε)) CoRR Ioannis Koutis, Gary L. Miller, Richard Peng
2011	J	`jnl`	Triangle Sparsifiers. J. Graph Algorithms Appl. Charalampos E. Tsourakakis, Mihail N. Kolountzakis, Gary L. Miller
2010	A*	`conf`	Approaching Optimality for Solving SDD Linear Systems. FOCS Ioannis Koutis, Gary L. Miller, Richard Peng
2010	J	`jnl`	Approaching optimality for solving SDD systems CoRR Ioannis Koutis, Gary L. Miller, Richard Peng
2010	J	`jnl`	Approximate Dynamic Programming for Fast Denoising of aCGH Data CoRR Gary L. Miller, Richard Peng, Russell Schwartz, Charalampos E. Tsourakakis
2010	J	`jnl`	Approximate centerpoints with proofs. Comput. Geom. Gary L. Miller, Donald R. Sheehy
2010	C	`conf`	Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning. WAW Mihail N. Kolountzakis, Gary L. Miller, Richard Peng, Charalampos E. Tsourakakis
2010	J	`jnl`	Efficient Triangle Counting in Large Graphs via Degree-based Vertex Partitioning CoRR Mihail N. Kolountzakis, Gary L. Miller, Richard Peng, Charalampos E. Tsourakakis
2010	A	`conf`	Hierarchical Diagonal Blocking and Precision Reduction Applied to Combinatorial Multigrid. SC Guy E. Blelloch, Ioannis Koutis, Gary L. Miller, Kanat Tangwongsan
2010	—	`conf`	Topological inference via meshing. SCG Benoît Hudson, Gary L. Miller, Steve Oudot, Donald R. Sheehy
2009	J	`jnl`	Approximate Triangle Counting CoRR Charalampos E. Tsourakakis, Mihail N. Kolountzakis, Gary L. Miller
2009	—	`conf`	Approximate center points with proofs. SCG Gary L. Miller, Donald R. Sheehy
2009	—	`conf`	Combinatorial Preconditioners and Multilevel Solvers for Problems in Computer Vision and Image Processing. ISVC (1) Ioannis Koutis, Gary L. Miller, David Tolliver
2009	A*	`conf`	DOULION: counting triangles in massive graphs with a coin. KDD Charalampos E. Tsourakakis, U Kang, Gary L. Miller, Christos Faloutsos
2009	A*	`conf`	Size complexity of volume meshes vs. surface meshes. SODA Benoît Hudson, Gary L. Miller, Todd Phillips, Don Sheehy
2009	—	`conf`	The Centervertex Theorem for Wedge Depth. CCCG Gary L. Miller, Todd Phillips, Donald R. Sheehy
2008	B	`conf`	Graph partitioning into isolated, high conductance clusters: theory, computation and applications to preconditioning. SPAA Ioannis Koutis, Gary L. Miller
2008	—	`conf`	Linear-Size Meshes. CCCG Don Sheehy, Gary L. Miller, Todd Phillips
2007	A*	`conf`	A linear work, O(n SODA Ioannis Koutis, Gary L. Miller
2007	—	`conf`	SVR: Practical Engineering of a Fast 3D Meshing Algorithm*. IMR Umut A. Acar, Benoît Hudson, Gary L. Miller, Todd Phillips
2007	A*	`conf`	Size Competitive Meshing Without Large Angles. ICALP Gary L. Miller, Todd Phillips, Donald R. Sheehy
2007	B	`conf`	Sparse parallel Delaunay mesh refinement. SPAA Benoît Hudson, Gary L. Miller, Todd Phillips
2006	—	`conf`	Graph Partitioning by Spectral Rounding: Applications in Image Segmentation and Clustering. CVPR (1) David Tolliver, Gary L. Miller
2006	C	`conf`	Representing Topological Structures Using Cell-Chains. GMP David E. Cardoze, Gary L. Miller, Todd Phillips
2006	—	`conf`	Sparse Voronoi Refinement. IMR Benoît Hudson, Gary L. Miller, Todd Phillips
2005	—	`conf`	Corrected Laplacians: Closer Cuts and Segmentation with Shape Priors. CVPR (2) David Tolliver, Gary L. Miller, Robert T. Collins
2005	B	`conf`	Finding effective support-tree preconditioners. SPAA Bruce M. Maggs, Gary L. Miller, Ojas Parekh, R. Ravi, Shan Leung Maverick Woo
2005	J	`jnl`	When and why delaunay refinement algorithms work. Int. J. Comput. Geom. Appl. Gary L. Miller, Steven E. Pav, Noel Walkington
2004	—	`conf`	A Bezier-Based Moving Mesh Framework for Simulation with Elastic Membranes. IMR David E. Cardoze, Gary L. Miller, Mark Olah, Todd Phillips
2004	—	`conf`	A Bézier-based approach to unstructured moving meshes. SCG David E. Cardoze, Alexandre Cunha, Gary L. Miller, Todd Phillips, Noel Walkington
2004	A*	`conf`	A time efficient Delaunay refinement algorithm. SODA Gary L. Miller
2004	B	`conf`	Lower bounds for graph embeddings and combinatorial preconditioners. SPAA Gary L. Miller, Peter C. Richter
2004	—	`conf`	Using bistellar flips for rotations in point location structures. CCCG Benoît Hudson, Gary L. Miller
2003	—	`conf`	When and Why Ruppert's Algorithm Works. IMR Gary L. Miller, Steven E. Pav, Noel Walkington
2002	—	`conf`	Fully Incremental 3D Delaunay Refinement Mesh Generation. IMR Gary L. Miller, Steven E. Pav, Noel Walkington
2001	J	`jnl`	Persistent triangulations Journal of Functional Programming. J. Funct. Program. Guy E. Blelloch, Hal Burch, Karl Crary, Robert Harper, Gary L. Miller, Noel Walkington
2000	A	`conf`	A Parallel Dynamic-Mesh Lagrangian Method for Simulation of Flows with Dynamic Interfaces. SC James F. Antaki, Guy E. Blelloch, Omar Ghattas, Ivan Malcevic, Gary L. Miller, Noel Walkington
2000	J	`jnl`	Graph Embeddings and Laplacian Eigenvalues. SIAM J. Matrix Anal. Appl. Stephen Guattery, Gary L. Miller
2000	B	`ed.`	Proceedings of the Twelfth annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2000, Bar Harbor, Maine, USA, July 9-13, 2000 SPAA Gary L. Miller, Shang-Hua Teng
2000	A*	`conf`	Smoothing and cleaning up slivers. STOC Herbert Edelsbrunner, Xiang-Yang Li, Gary L. Miller, Andreas Stathopoulos, Dafna Talmor, Shang-Hua Teng, Alper Üngör, Noel Walkington
1999	J	`jnl`	Data Generation for Geometric Algorithms on Non-Uniform Distributions. Int. J. Comput. Geom. Appl. Gary L. Miller, Dafna Talmor, Shang-Hua Teng
1999	J	`jnl`	Design and Implementation of a Practical Parallel Delaunay Algorithm. Algorithmica Guy E. Blelloch, Jonathan C. Hardwick, Gary L. Miller, Dafna Talmor
1999	A*	`conf`	Estimating Interpolation Error: A Combinatorial Approach. SODA Stephen Guattery, Gary L. Miller, Noel Walkington
1999	J	`jnl`	Optimal Coarsening of Unstructured Meshes. J. Algorithms Gary L. Miller, Dafna Talmor, Shang-Hua Teng
1999	B	`ed.`	Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '99, Saint-Malo, France, June 27-30, 1999 SPAA Gary L. Miller, Vijaya Ramachandran
1999	—	`conf`	Redeeming Nested Dissection: Parallelism Implies Fill. PP Claudson F. Bornstein, Bruce M. Maggs, Gary L. Miller, R. Ravi
1999	J	`jnl`	The Dynamic Parallel Complexity of Computational Circuits. SIAM J. Comput. Gary L. Miller, Shang-Hua Teng
1999	J	`jnl`	The Path Resistance Method For Bounding The Smallest Nontrivial Eigenvalue Of A Laplacian. Comb. Probab. Comput. Stephen Guattery, Frank Thomson Leighton, Gary L. Miller
1999	B	`conf`	Tradeoffs Between Parallelism and Fill in Nested Dissection. SPAA Claudson F. Bornstein, Bruce M. Maggs, Gary L. Miller
1998	—	`conf`	Control Volume Meshes Using Sphere Packing. IRREGULAR Gary L. Miller
1998	J	`jnl`	Geometric Mesh Partitioning: Implementation and Experiments. SIAM J. Sci. Comput. John R. Gilbert, Gary L. Miller, Shang-Hua Teng
1998	J	`jnl`	Geometric Separators for Finite-Element Meshes. SIAM J. Sci. Comput. Gary L. Miller, Shang-Hua Teng, William P. Thurston, Stephen A. Vavasis
1998	J	`jnl`	On the Quality of Spectral Separators. SIAM J. Matrix Anal. Appl. Stephen Guattery, Gary L. Miller
1998	B	`ed.`	Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '98, Puerto Vallarta, Mexico, June 28 - July 2, 1998 SPAA Gary L. Miller, Phillip B. Gibbons
1997	J	`jnl`	Moments of Inertia and Graph Separators. J. Comb. Optim. Keith D. Gremban, Gary L. Miller, Shang-Hua Teng
1997	A*	`conf`	Optimal Good-Aspect-Ratio Coarsening for Unstructured Meshes. SODA Gary L. Miller, Dafna Talmor, Shang-Hua Teng
1997	A*	`conf`	Parallelizing Elimination Orders with Linear Fill. FOCS Claudson F. Bornstein, Bruce M. Maggs, Gary L. Miller, R. Ravi
1997	J	`jnl`	Separators for sphere-packings and nearest neighbor graphs. J. ACM Gary L. Miller, Shang-Hua Teng, William P. Thurston, Stephen A. Vavasis
1997	A*	`conf`	The Path Resistance Method for Bounding lambda SODA Stephen Guattery, Frank Thomson Leighton, Gary L. Miller
1997	J	`jnl`	Tree-Based Parallel Algorithm Design. Algorithmica Gary L. Miller, Shang-Hua Teng
1996	J	`jnl`	Approximating center points with iterative Radon points. Int. J. Comput. Geom. Appl. Kenneth L. Clarkson, David Eppstein, Gary L. Miller, Carl Sturtivant, Shang-Hua Teng
1996	—	`conf`	Developing a Practical Projection-Based Parallel Delaunay Algorithm. SCG Guy E. Blelloch, Gary L. Miller, Dafna Talmor
1996	A*	`ed.`	Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, Pennsylvania, USA, May 22-24, 1996 STOC Gary L. Miller
1995	A*	`conf`	A Delaunay based numerical method for three dimensions: generation, formulation, and partition. STOC Gary L. Miller, Dafna Talmor, Shang-Hua Teng, Noel Walkington
1995	J	`jnl`	A Deterministic Linear Time Algorithm for Geometric Separators and its Applications. Fundam. Informaticae David Eppstein, Gary L. Miller, Shang-Hua Teng
1995	J	`jnl`	Flow in Planar Graphs with Multiple Sources and Sinks. SIAM J. Comput. Gary L. Miller, Joseph Naor
1995	—	`conf`	Geometric mesh partitioning: implementation and experiments. IPPS John R. Gilbert, Gary L. Miller, Shang-Hua Teng
1995	A*	`conf`	On the Performance of Spectral Graph Partitioning Methods. SODA Stephen Guattery, Gary L. Miller
1995	—	`conf`	Performance evaluation of a new parallel preconditioner. IPPS Keith D. Gremban, Gary L. Miller, Marco Zagha
1994	A*	`conf`	Moments of Inertia and Graph Separators. SODA Keith D. Gremban, Gary L. Miller, Shang-Hua Teng
1993	—	`conf`	A Deterministic Linear Time Algorithm for Geometric Separators and its Applications. SCG David Eppstein, Gary L. Miller, Shang-Hua Teng
1993	—	`conf`	Approximating Center Points with Iterated Radon Points. SCG Kenneth L. Clarkson, David Eppstein, Gary L. Miller, Carl Sturtivant, Shang-Hua Teng
1992	B	`conf`	A Contraction Procedure for Planar Directed Graphs. SPAA Stephen Guattery, Gary L. Miller
1992	J	`jnl`	A new graph triconnectivity algorithm and its parallelization. Comb. Gary L. Miller, Vijaya Ramachandran
1992	B	`conf`	Separator Based Parallel Divide and Conquer in Computational Geometry. SPAA Alan M. Frieze, Gary L. Miller, Shang-Hua Teng
1991	A*	`conf`	A Unified Geometric Approach to Graph Separators FOCS Gary L. Miller, Shang-Hua Teng, Stephen A. Vavasis
1991	A*	`conf`	Density Graphs and Separators. SODA Gary L. Miller, Stephen A. Vavasis
1991	J	`jnl`	Deterministic Parallel List Ranking. Algorithmica Richard J. Anderson, Gary L. Miller
1991	J	`jnl`	Parallel Tree Contraction, Part 2: Further Applications. SIAM J. Comput. Gary L. Miller, John H. Reif
1990	J	`jnl`	A Simple Randomized Parallel Algorithm for List-Ranking. Inf. Process. Lett. Richard J. Anderson, Gary L. Miller
1990	—	`conf`	Planar Separators and the Euclidean Norm. SIGAL International Symposium on Algorithms Hillel Gazit, Gary L. Miller
1990	A*	`conf`	Separators in Two and Three Dimensions STOC Gary L. Miller, William P. Thurston
1990	J	`jnl`	Subtree isomorphism is in random NC. Discret. Appl. Math. Phillip B. Gibbons, Richard M. Karp, Gary L. Miller, Danny Soroker
1989	B	`conf`	Constructing Trees in Parallel. SPAA Mikhail J. Atallah, S. Rao Kosaraju, Lawrence L. Larmore, Gary L. Miller, Shang-Hua Teng
1989	A*	`conf`	Flow in Planar Graphs with Multiple Sources and Sinks (Extended Abstract) FOCS Gary L. Miller, Joseph Naor
1989	J	`jnl`	Parallel Tree Contraction Part 1: Fundamentals. Adv. Comput. Res. Gary L. Miller, John H. Reif
1988	J	`jnl`	An Improved Parallel Algorithm that Computes the BFS Numbering of a Directed Graph. Inf. Process. Lett. Hillel Gazit, Gary L. Miller
1988	—	`conf`	Deterministic Parallel List Ranking. AWOC Richard J. Anderson, Gary L. Miller
1988	J	`jnl`	Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits. SIAM J. Comput. Gary L. Miller, Vijaya Ramachandran, Erich L. Kaltofen
1988	—	`conf`	Subtree Isomorphism is in Random NC. AWOC Phillip B. Gibbons, Richard M. Karp, Gary L. Miller, Danny Soroker
1987	A*	`conf`	A New Graph Triconnectivity Algorithm and Its Parallelization STOC Gary L. Miller, Vijaya Ramachandran
1987	A*	`conf`	A Parallel Algorithm for Finding a Separator in Planar Graphs FOCS Hillel Gazit, Gary L. Miller
1987	J	`jnl`	An additivity theorem for the genus of a graph. J. Comb. Theory B Gary L. Miller
1987	A*	`conf`	Dynamic Parallel Complexity of Computational Circuits STOC Gary L. Miller, Shang-Hua Teng
1987	J	`jnl`	Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers. SIAM J. Comput. Ravindran Kannan, Gary L. Miller, Larry Rudolph
1986	—	`conf`	Efficient Parallel Evaluation of Straight-line Code and Arithmetric Circuits. Aegean Workshop on Computing Gary L. Miller, Vijaya Ramachandran, Erich L. Kaltofen
1986	J	`jnl`	Finding Small Simple Cycle Separators for 2-Connected Planar Graphs. J. Comput. Syst. Sci. Gary L. Miller
1986	J	`jnl`	Sums of Divisors, Perfect Numbers and Factoring. SIAM J. Comput. Eric Bach, Gary L. Miller, Jeffrey O. Shallit
1985	A*	`conf`	Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number Fields. CRYPTO Dennis Estes, Leonard M. Adleman, Kireeti Kompella, Kevin S. McCurley, Gary L. Miller
1985	A*	`conf`	Parallel Tree Contraction and Its Application FOCS Gary L. Miller, John H. Reif
1985	J	`jnl`	Solvability by Radicals is in Polynomial Time. J. Comput. Syst. Sci. Susan Landau, Gary L. Miller
1984	A*	`conf`	Coordinating Pebble Motion on Graphs, the Diameter of Permutation Groups, and Applications FOCS Daniel Kornhauser, Gary L. Miller, Paul G. Spirakis
1984	A*	`conf`	Finding Small Simple Cycle Separators for 2-Connected Planar Graphs STOC Gary L. Miller
1984	A*	`conf`	Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers FOCS Ravindran Kannan, Gary L. Miller, Larry Rudolph
1984	A*	`conf`	Sums of Divisors, Perfect Numbers, and Factoring (Extended Abstract) STOC Eric Bach, Gary L. Miller, Jeffrey O. Shallit
1983	J	`jnl`	An Asymptotically Optimal Layout for the Shuffle-Exchange Graph. J. Comput. Syst. Sci. Daniel J. Kleitman, Frank Thomson Leighton, Margaret Lepley, Gary L. Miller
1983	B	`conf`	Isomorphism Testing and Canonical Forms for k-Contractable Graphs (A Generalization of Bounded Valence and Bounded Genus). FCT Gary L. Miller
1983	J	`jnl`	Isomorphism of Graphs Which are Pairwise k-separable Inf. Control. Gary L. Miller
1983	J	`jnl`	Isomorphism of k-Contractible Graphs. A Generalization of Bounded Valence and Bounded Genus Inf. Control. Gary L. Miller
1983	A*	`conf`	Solvability by Radicals is in Polynomial Time STOC Susan Landau, Gary L. Miller
1981	A*	`conf`	New Layouts for the Shuffle-Exchange Graph (Extended Abstract) STOC Daniel J. Kleitman, Frank Thomson Leighton, Margaret Lepley, Gary L. Miller
1980	A*	`conf`	Isomorphism Testing for Graphs of Bounded Genus STOC Gary L. Miller
1980	J	`jnl`	Regular groups of automorphisms of cubic graphs. J. Comb. Theory B Dragomir Z. Djokovic, Gary L. Miller
1979	J	`jnl`	Graph Isomorphism, General Remarks. J. Comput. Syst. Sci. Gary L. Miller
1979	A*	`conf`	On Determining the Genus of a Graph in O(v^O(g)) Steps STOC I. S. Filotti, Gary L. Miller, John H. Reif
1978	A*	`conf`	On the n^log n Isomorphism Technique: A Preliminary Report STOC Gary L. Miller
1977	A*	`conf`	Graph Isomorphism, General Remarks STOC Gary L. Miller
1977	A*	`conf`	On Taking Roots in Finite Fields FOCS Leonard M. Adleman, Kenneth L. Manders, Gary L. Miller
1976	J	`jnl`	Riemann's Hypothesis and Tests for Primality. J. Comput. Syst. Sci. Gary L. Miller
1975	A*	`conf`	Riemann's Hypothesis and Tests for Primality STOC Gary L. Miller