Gary L. Miller

According to our database, Gary L. Miller authored at least 145 papers between 1976 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2023

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

2020

Functions that Preserve Manhattan Distances.

Timothy Chu, Gary L. Miller, Shyam Narayanan, Mark Sellke

CoRR, 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

Exact computation of a manifold metric, via Lipschitz Embeddings and Shortest Paths on a Graph.

Timothy Chu, Gary L. Miller, Donald R. Sheehy

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019

Hardy-Muckenhoupt Bounds for Laplacian Eigenvalues.

Gary L. Miller, Noel J. Walkington, Alex L. Wang

Proceedings of the Approximation, 2019

2018

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

Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017

On Computing Min-Degree Elimination Orderings.

Matthew Fahrbach, Gary L. Miller, Richard Peng, Saurabh Sawlani, Junxing Wang, Shen Chen Xu

CoRR, 2017

Intrinsic Metrics: Nearest Neighbor and Edge Squared Distances.

Timothy Chu, Gary L. Miller, Donald R. Sheehy

CoRR, 2017

2016

Scalable Constrained Clustering: A Generalized Spectral Method.

Mihai Cucuringu, Ioannis Koutis, Sanjay Chawla, Gary L. Miller, Richard Peng

CoRR, 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

Routing under balance.

Alina Ene, Gary L. Miller, Jakub Pachocki, Aaron Sidford

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Geometric median in nearly linear time.

Michael B. Cohen, Yin Tat Lee, Gary L. Miller, Jakub Pachocki, Aaron Sidford

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 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

Proceedings of the 2016 Proceedings of the Seventh SIAM Workshop on Combinatorial Scientific Computing, 2016

Simple and Scalable Constrained Clustering: a Generalized Spectral Method.

Mihai Cucuringu, Ioannis Koutis, Sanjay Chawla, Gary L. Miller, Richard Peng

Proceedings of the 19th International Conference on Artificial Intelligence and Statistics, 2016

2015

Approximating Nearest Neighbor Distances.

Michael B. Cohen, Brittany Terese Fasy, Gary L. Miller, Amir Nayyeri, Donald R. Sheehy, Ameya Velingker

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Improved Parallel Algorithms for Spanners and Hopsets.

Gary L. Miller, Richard Peng, Adrian Vladu, Shen Chen Xu

Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

The Revolution in Graph Theoretic Optimization Problems.

Gary L. Miller

Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

2014

Approaching Optimality for Solving SDD Linear Systems.

Ioannis Koutis, Gary L. Miller, Richard Peng

SIAM J. Comput., 2014

Nearly-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

Theory Comput. Syst., 2014

A New Approach to Output-Sensitive Construction of Voronoi Diagrams and Delaunay Triangulations.

Gary L. Miller, Donald R. Sheehy

Discret. Comput. Geom., 2014

A Generalized Cheeger Inequality.

Ioannis Koutis, Gary L. Miller, Richard Peng

CoRR, 2014

Stretching Stretch.

Michael B. Cohen, Gary L. Miller, Jakub W. Pachocki, Richard Peng, Shen Chen Xu

CoRR, 2014

The Role of Public Comprehensive Universities in Closing the Innovation Deficit.

Gary L. Miller, Robert R. Hoon

Computer, 2014

Solving SDD linear systems in nearly <i>m</i>log^1/2<i>n</i> time.

Michael B. Cohen, Rasmus Kyng, Gary L. Miller, Jakub W. Pachocki, Richard Peng, Anup B. Rao, Shen Chen Xu

Proceedings of the Symposium on Theory of Computing, 2014

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

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

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 large optimization problems using spectral graph theory.

Gary L. Miller

Proceedings of the Symposium on Theory of Computing Conference, 2013

Parallel graph decompositions using random shifts.

Gary L. Miller, Richard Peng, Shen Chen Xu

Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

Approximate Maximum Flow on Separable Undirected Graphs.

Gary L. Miller, Richard Peng

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Runtime guarantees for regression problems.

Hui Han Chin, Aleksander Madry, Gary L. Miller, Richard Peng

Proceedings of the Innovations in Theoretical Computer Science, 2013

Iterative Row Sampling.

Mu Li, Gary L. Miller, Richard Peng

Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

A fast algorithm for well-spaced points and approximate delaunay graphs.

Gary L. Miller, Donald R. Sheehy, Ameya Velingker

Proceedings of the Symposium on Computational Geometry 2013, 2013

A new approach to output-sensitive voronoi diagrams and delaunay triangulations.

Gary L. Miller, Donald R. Sheehy

Proceedings of the Symposium on Computational Geometry 2013, 2013

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

Gary L. Miller, Donald R. Sheehy

CoRR, 2012

Iterative Approaches to Row Sampling

Gary L. Miller, Richard Peng

CoRR, 2012

A fast solver for a class of linear systems.

Ioannis Koutis, Gary L. Miller, Richard Peng

Commun. ACM, 2012

Faster approximate multicommodity flow using quadratically coupled flows.

Jonathan A. Kelner, Gary L. Miller, Richard Peng

Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

2011

Triangle Sparsifiers.

Charalampos E. Tsourakakis, Mihail N. Kolountzakis, Gary L. Miller

J. Graph Algorithms Appl., 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

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

Electrical Flow Algorithms for Total Variation Minimization

Aleksander Madry, Gary L. Miller, Richard Peng

CoRR, 2011

Solving SDD linear systems in time Õ(mlog nlog(1/ε))

Ioannis Koutis, Gary L. Miller, Richard Peng

CoRR, 2011

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

Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

Approximate Dynamic Programming using Halfspace Queries and Multiscale Monge Decomposition.

Gary L. Miller, Richard Peng, Russell Schwartz, Charalampos E. Tsourakakis

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

A Nearly-m log n Time Solver for SDD Linear Systems.

Ioannis Koutis, Gary L. Miller, Richard Peng

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

Beating the spread: time-optimal point meshing.

Gary L. Miller, Todd Phillips, Don Sheehy

Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

2010

Approximate Dynamic Programming for Fast Denoising of aCGH Data

Gary L. Miller, Richard Peng, Russell Schwartz, Charalampos E. Tsourakakis

CoRR, 2010

Approaching optimality for solving SDD systems

Ioannis Koutis, Gary L. Miller, Richard Peng

CoRR, 2010

Approximate centerpoints with proofs.

Gary L. Miller, Donald R. Sheehy

Comput. Geom., 2010

Hierarchical Diagonal Blocking and Precision Reduction Applied to Combinatorial Multigrid.

Guy E. Blelloch, Ioannis Koutis, Gary L. Miller, Kanat Tangwongsan

Proceedings of the Conference on High Performance Computing Networking, 2010

Topological inference via meshing.

Benoît Hudson, Gary L. Miller, Steve Oudot, Donald R. Sheehy

Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

2009

Approximate Triangle Counting

Charalampos E. Tsourakakis, Mihail N. Kolountzakis, Gary L. Miller

CoRR, 2009

Size complexity of volume meshes vs. surface meshes.

Benoît Hudson, Gary L. Miller, Todd Phillips, Don Sheehy

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

DOULION: counting triangles in massive graphs with a coin.

Charalampos E. Tsourakakis, U Kang, Gary L. Miller, Christos Faloutsos

Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Paris, France, June 28, 2009

Approximate center points with proofs.

Gary L. Miller, Donald R. Sheehy

Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

The Centervertex Theorem for Wedge Depth.

Gary L. Miller, Todd Phillips, Donald R. Sheehy

Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

2008

Graph partitioning into isolated, high conductance clusters: theory, computation and applications to preconditioning.

Ioannis Koutis, Gary L. Miller

Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

Linear-Size Meshes.

Don Sheehy, Gary L. Miller, Todd Phillips

Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

2007

Sparse parallel Delaunay mesh refinement.

Benoît Hudson, Gary L. Miller, Todd Phillips

Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007

A linear work, O(n^1/6) time, parallel algorithm for solving planar Laplacians.

Ioannis Koutis, Gary L. Miller

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

SVR: Practical Engineering of a Fast 3D Meshing Algorithm*.

Umut A. Acar, Benoît Hudson, Gary L. Miller, Todd Phillips

Proceedings of the 16th International Meshing Roundtable, 2007

Size Competitive Meshing Without Large Angles.

Gary L. Miller, Todd Phillips, Donald R. Sheehy

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

2006

Sparse Voronoi Refinement.

Benoît Hudson, Gary L. Miller, Todd Phillips

Proceedings of the 15th International Meshing Roundtable, 2006

Representing Topological Structures Using Cell-Chains.

David E. Cardoze, Gary L. Miller, Todd Phillips

Proceedings of the Geometric Modeling and Processing, 2006

Graph Partitioning by Spectral Rounding: Applications in Image Segmentation and Clustering.

David Tolliver, Gary L. Miller

Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2006), 2006

2005

When and why delaunay refinement algorithms work.

Gary L. Miller, Steven E. Pav, Noel Walkington

Int. J. Comput. Geom. Appl., 2005

Finding effective support-tree preconditioners.

Bruce M. Maggs, Gary L. Miller, Ojas Parekh, R. Ravi, Shan Leung Maverick Woo

Proceedings of the SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2005

Corrected Laplacians: Closer Cuts and Segmentation with Shape Priors.

David Tolliver, Gary L. Miller, Robert T. Collins

Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2005), 2005

2004

Lower bounds for graph embeddings and combinatorial preconditioners.

Gary L. Miller, Peter C. Richter

Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004

A time efficient Delaunay refinement algorithm.

Gary L. Miller

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

A Bezier-Based Moving Mesh Framework for Simulation with Elastic Membranes.

David E. Cardoze, Gary L. Miller, Mark Olah, Todd Phillips

Proceedings of the 13th International Meshing Roundtable, 2004

A Bézier-based approach to unstructured moving meshes.

David E. Cardoze, Alexandre Cunha, Gary L. Miller, Todd Phillips, Noel Walkington

Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

Using bistellar flips for rotations in point location structures.

Benoît Hudson, Gary L. Miller

Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2003

When and Why Ruppert's Algorithm Works.

Gary L. Miller, Steven E. Pav, Noel Walkington

Proceedings of the 12th International Meshing Roundtable, 2003

2002

Fully Incremental 3D Delaunay Refinement Mesh Generation.

Gary L. Miller, Steven E. Pav, Noel Walkington

Proceedings of the 11th International Meshing Roundtable, 2002

2001

Persistent triangulations Journal of Functional Programming.

Guy E. Blelloch, Hal Burch, Karl Crary, Robert Harper, Gary L. Miller, Noel Walkington

J. Funct. Program., 2001

2000

Graph Embeddings and Laplacian Eigenvalues.

Stephen Guattery, Gary L. Miller

SIAM J. Matrix Anal. Appl., 2000

Smoothing and cleaning up slivers.

Herbert Edelsbrunner, Xiang-Yang Li, Gary L. Miller, Andreas Stathopoulos, Dafna Talmor, Shang-Hua Teng, Alper Üngör, Noel Walkington

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

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

Proceedings of the Proceedings Supercomputing 2000, 2000

1999

The Dynamic Parallel Complexity of Computational Circuits.

Gary L. Miller, Shang-Hua Teng

SIAM J. Comput., 1999

Optimal Coarsening of Unstructured Meshes.

Gary L. Miller, Dafna Talmor, Shang-Hua Teng

J. Algorithms, 1999

Data Generation for Geometric Algorithms on Non-Uniform Distributions.

Gary L. Miller, Dafna Talmor, Shang-Hua Teng

Int. J. Comput. Geom. Appl., 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

Design and Implementation of a Practical Parallel Delaunay Algorithm.

Guy E. Blelloch, Jonathan C. Hardwick, Gary L. Miller, Dafna Talmor

Algorithmica, 1999

Tradeoffs Between Parallelism and Fill in Nested Dissection.

Claudson F. Bornstein, Bruce M. Maggs, Gary L. Miller

Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, 1999

Estimating Interpolation Error: A Combinatorial Approach.

Stephen Guattery, Gary L. Miller, Noel Walkington

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Redeeming Nested Dissection: Parallelism Implies Fill.

Claudson F. Bornstein, Bruce M. Maggs, Gary L. Miller, R. Ravi

Proceedings of the Ninth SIAM Conference on Parallel Processing for Scientific Computing, 1999

1998

On the Quality of Spectral Separators.

Stephen Guattery, Gary L. Miller

SIAM J. Matrix Anal. Appl., July, 1998

Geometric Separators for Finite-Element Meshes.

Gary L. Miller, Shang-Hua Teng, William P. Thurston, Stephen A. Vavasis

SIAM J. Sci. Comput., 1998

Geometric Mesh Partitioning: Implementation and Experiments.

John R. Gilbert, Gary L. Miller, Shang-Hua Teng

SIAM J. Sci. Comput., 1998

Control Volume Meshes Using Sphere Packing.

Gary L. Miller

Proceedings of the Solving Irregularly Structured Problems in Parallel, 1998

1997

Moments of Inertia and Graph Separators.

Keith D. Gremban, Gary L. Miller, Shang-Hua Teng

J. Comb. Optim., 1997

Separators for sphere-packings and nearest neighbor graphs.

Gary L. Miller, Shang-Hua Teng, William P. Thurston, Stephen A. Vavasis

J. ACM, 1997

Tree-Based Parallel Algorithm Design.

Gary L. Miller, Shang-Hua Teng

Algorithmica, 1997

Optimal Good-Aspect-Ratio Coarsening for Unstructured Meshes.

Gary L. Miller, Dafna Talmor, Shang-Hua Teng

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

The Path Resistance Method for Bounding lambda₂ of a Laplacian.

Stephen Guattery, Frank Thomson Leighton, Gary L. Miller

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Parallelizing Elimination Orders with Linear Fill.

Claudson F. Bornstein, Bruce M. Maggs, Gary L. Miller, R. Ravi

Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

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

Developing a Practical Projection-Based Parallel Delaunay Algorithm.

Guy E. Blelloch, Gary L. Miller, Dafna Talmor

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

1995

Flow in Planar Graphs with Multiple Sources and Sinks.

Gary L. Miller, Joseph Naor

SIAM J. Comput., 1995

A Deterministic Linear Time Algorithm for Geometric Separators and its Applications.

David Eppstein, Gary L. Miller, Shang-Hua Teng

Fundam. Informaticae, 1995

A Delaunay based numerical method for three dimensions: generation, formulation, and partition.

Gary L. Miller, Dafna Talmor, Shang-Hua Teng, Noel Walkington

Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

On the Performance of Spectral Graph Partitioning Methods.

Stephen Guattery, Gary L. Miller

Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

Performance evaluation of a new parallel preconditioner.

Keith D. Gremban, Gary L. Miller, Marco Zagha

Proceedings of IPPS '95, 1995

1993

Approximating Center Points with Iterated Radon Points.

Kenneth L. Clarkson, David Eppstein, Gary L. Miller, Carl Sturtivant, Shang-Hua Teng

Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

1992

A new graph triconnectivity algorithm and its parallelization.

Gary L. Miller, Vijaya Ramachandran

Comb., 1992

A Contraction Procedure for Planar Directed Graphs.

Stephen Guattery, Gary L. Miller

Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, 1992

Separator Based Parallel Divide and Conquer in Computational Geometry.

Alan M. Frieze, Gary L. Miller, Shang-Hua Teng

Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, 1992

1991

Parallel Tree Contraction, Part 2: Further Applications.

Gary L. Miller, John H. Reif

SIAM J. Comput., 1991

Deterministic Parallel List Ranking.

Richard J. Anderson, Gary L. Miller

Algorithmica, 1991

Density Graphs and Separators.

Gary L. Miller, Stephen A. Vavasis

Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

A Unified Geometric Approach to Graph Separators

Gary L. Miller, Shang-Hua Teng, Stephen A. Vavasis

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990

A Simple Randomized Parallel Algorithm for List-Ranking.

Richard J. Anderson, Gary L. Miller

Inf. Process. Lett., 1990

Subtree isomorphism is in random NC.

Phillip B. Gibbons, Richard M. Karp, Gary L. Miller, Danny Soroker

Discret. Appl. Math., 1990

Separators in Two and Three Dimensions

Gary L. Miller, William P. Thurston

Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

Planar Separators and the Euclidean Norm.

Hillel Gazit, Gary L. Miller

Proceedings of the Algorithms, 1990

1989

Parallel Tree Contraction Part 1: Fundamentals.

Gary L. Miller, John H. Reif

Adv. Comput. Res., 1989

Constructing Trees in Parallel.

Mikhail J. Atallah, S. Rao Kosaraju, Lawrence L. Larmore, Gary L. Miller, Shang-Hua Teng

Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1989

Flow in Planar Graphs with Multiple Sources and Sinks (Extended Abstract)

Gary L. Miller, Joseph Naor

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

1988

Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits.

Gary L. Miller, Vijaya Ramachandran, Erich L. Kaltofen

SIAM J. Comput., 1988

An Improved Parallel Algorithm that Computes the BFS Numbering of a Directed Graph.

Hillel Gazit, Gary L. Miller

Inf. Process. Lett., 1988

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 additivity theorem for the genus of a graph.

Gary L. Miller

J. Comb. Theory B, 1987

A Parallel Algorithm for Finding a Separator in Planar Graphs

Hillel Gazit, Gary L. Miller

Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1986

Sums of Divisors, Perfect Numbers and Factoring.

Eric Bach, Gary L. Miller, Jeffrey O. Shallit

SIAM J. Comput., 1986

Finding Small Simple Cycle Separators for 2-Connected Planar Graphs.

Gary L. Miller

J. Comput. Syst. Sci., 1986

Efficient Parallel Evaluation of Straight-line Code and Arithmetric Circuits.

Gary L. Miller, Vijaya Ramachandran, Erich L. Kaltofen

Proceedings of the VLSI Algorithms and Architectures, 1986

1985

Solvability by Radicals is in Polynomial Time.

Susan Landau, Gary L. Miller

J. Comput. Syst. Sci., 1985

Parallel Tree Contraction and Its Application

Gary L. Miller, John H. Reif

Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number Fields.

Dennis Estes, Leonard M. Adleman, Kireeti Kompella, Kevin S. McCurley, Gary L. Miller

Proceedings of the Advances in Cryptology, 1985

1984

Sums of Divisors, Perfect Numbers, and Factoring (Extended Abstract)

Eric Bach, Gary L. Miller, Jeffrey O. Shallit

Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

Coordinating Pebble Motion on Graphs, the Diameter of Permutation Groups, and Applications

Daniel Kornhauser, Gary L. Miller, Paul G. Spirakis

Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984

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

Isomorphism of Graphs Which are Pairwise k-separable

Gary L. Miller

Inf. Control., 1983

Isomorphism of k-Contractible Graphs. A Generalization of Bounded Valence and Bounded Genus

Gary L. Miller

Inf. Control., 1983

Isomorphism Testing and Canonical Forms for k-Contractable Graphs (A Generalization of Bounded Valence and Bounded Genus).

Gary L. Miller

Proceedings of the Fundamentals of Computation Theory, 1983

1981

New Layouts for the Shuffle-Exchange Graph (Extended Abstract)

Daniel J. Kleitman, Frank Thomson Leighton, Margaret Lepley, Gary L. Miller

Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981

1980

Regular groups of automorphisms of cubic graphs.

Dragomir Z. Djokovic, Gary L. Miller

J. Comb. Theory B, 1980

Isomorphism Testing for Graphs of Bounded Genus

Gary L. Miller

Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980

1979

Graph Isomorphism, General Remarks.

Gary L. Miller

J. Comput. Syst. Sci., 1979

On Determining the Genus of a Graph in O(v^O(g)) Steps

I. S. Filotti, Gary L. Miller, John H. Reif

Proceedings of the 11h Annual ACM Symposium on Theory of Computing, April 30, 1979

1978

On the n^log n Isomorphism Technique: A Preliminary Report

Gary L. Miller

Proceedings of the 10th Annual ACM Symposium on Theory of Computing, 1978

1977

On Taking Roots in Finite Fields

Leonard M. Adleman, Kenneth L. Manders, Gary L. Miller

Proceedings of the 18th Annual Symposium on Foundations of Computer Science, Providence, Rhode Island, USA, 31 October, 1977

1976

Riemann's Hypothesis and Tests for Primality.

Gary L. Miller

J. Comput. Syst. Sci., 1976