default search action
Gary L. Miller
Person information
- affiliation: Carnegie Mellon University, Pittsburgh, USA
- award (2013): Knuth Prize
- award (2003): Paris Kanellakis Award
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
- [i28]Timothy Chu, Gary L. Miller, Noel Walkington:
Spectral Clustering on Large Datasets: When Does it Work? Theory from Continuous Clustering and Density Cheeger-Buser. CoRR abs/2305.06541 (2023) - 2020
- [c97]Timothy Chu, Gary L. Miller, Donald R. Sheehy:
Exact computation of a manifold metric, via Lipschitz Embeddings and Shortest Paths on a Graph. SODA 2020: 411-425 - [i27]Timothy Chu, Gary L. Miller, Noel J. Walkington, Alex L. Wang:
Weighted Cheeger and Buser Inequalities, with Applications to Clustering and Cutting Probability Densities. CoRR abs/2004.09589 (2020) - [i26]Timothy Chu, Gary L. Miller, Shyam Narayanan, Mark Sellke:
Functions that Preserve Manhattan Distances. CoRR abs/2011.11503 (2020)
2010 – 2019
- 2019
- [c96]Gary L. Miller, Noel J. Walkington, Alex L. Wang:
Hardy-Muckenhoupt Bounds for Laplacian Eigenvalues. APPROX-RANDOM 2019: 8:1-8:19 - 2018
- [c95]Matthew Fahrbach, Gary L. Miller, Richard Peng, Saurabh Sawlani, Junxing Wang, Shen Chen Xu:
Graph Sketching against Adaptive Adversaries Applied to the Minimum Degree Algorithm. FOCS 2018: 101-112 - [i25]Matthew Fahrbach, Gary L. Miller, Richard Peng, Saurabh Sawlani, Junxing Wang, Shen Chen Xu:
Graph Sketching Against Adaptive Adversaries Applied to the Minimum Degree Algorithm. CoRR abs/1804.04239 (2018) - [i24]Gary L. Miller, Noel J. Walkington, Alex L. Wang:
Hardy-Muckenhoupt Bounds for Laplacian Eigenvalues. CoRR abs/1812.02841 (2018) - 2017
- [i23]Timothy Chu, Gary L. Miller, Donald R. Sheehy:
Intrinsic Metrics: Nearest Neighbor and Edge Squared Distances. CoRR abs/1709.07797 (2017) - [i22]Matthew Fahrbach, Gary L. Miller, Richard Peng, Saurabh Sawlani, Junxing Wang, Shen Chen Xu:
On Computing Min-Degree Elimination Orderings. CoRR abs/1711.08446 (2017) - 2016
- [j47]Mayrolin García Morales, Barbara D. Denno, Douglass R. Miller, Gary L. Miller, Yair Ben-Dov, Nate B. Hardy:
ScaleNet: a literature-based model of scale insect biology and systematics. Database J. Biol. Databases Curation 2016 (2016) - [c94]Mihai Cucuringu, Ioannis Koutis, Sanjay Chawla, Gary L. Miller, Richard Peng:
Simple and Scalable Constrained Clustering: a Generalized Spectral Method. AISTATS 2016: 445-454 - [c93]Kevin Deweese, John R. Gilbert, Gary L. Miller, Richard Peng, Hao Ran Xu, Shen Chen Xu:
An Empirical Study of Cycle Toggling Based Laplacian Solvers. CSC 2016: 33-41 - [c92]Michael B. Cohen, Yin Tat Lee, Gary L. Miller, Jakub Pachocki, Aaron Sidford:
Geometric median in nearly linear time. STOC 2016: 9-21 - [c91]Alina Ene, Gary L. Miller, Jakub Pachocki, Aaron Sidford:
Routing under balance. STOC 2016: 598-611 - [i21]Mihai Cucuringu, Ioannis Koutis, Sanjay Chawla, Gary L. Miller, Richard Peng:
Scalable Constrained Clustering: A Generalized Spectral Method. CoRR abs/1601.04746 (2016) - [i20]Alina Ene, Gary L. Miller, Jakub Pachocki, Aaron Sidford:
Routing under Balance. CoRR abs/1603.09009 (2016) - [i19]Michael B. Cohen, Yin Tat Lee, Gary L. Miller, Jakub Pachocki, Aaron Sidford:
Geometric Median in Nearly Linear Time. CoRR abs/1606.05225 (2016) - [i18]Kevin Deweese, John R. Gilbert, Gary L. Miller, Richard Peng, Hao Ran Xu, Shen Chen Xu:
An Empirical Study of Cycle Toggling Based Laplacian Solvers. CoRR abs/1609.02957 (2016) - 2015
- [c90]Gary L. Miller:
The Revolution in Graph Theoretic Optimization Problems. SPAA 2015: 181 - [c89]Gary L. Miller, Richard Peng, Adrian Vladu, Shen Chen Xu:
Improved Parallel Algorithms for Spanners and Hopsets. SPAA 2015: 192-201 - [c88]Michael B. Cohen, Brittany Terese Fasy, Gary L. Miller, Amir Nayyeri, Donald R. Sheehy, Ameya Velingker:
Approximating Nearest Neighbor Distances. WADS 2015: 200-211 - [i17]Michael B. Cohen, Brittany Terese Fasy, Gary L. Miller, Amir Nayyeri, Donald R. Sheehy, Ameya Velingker:
Approximating Nearest Neighbor Distances. CoRR abs/1502.08048 (2015) - 2014
- [j46]Gary L. Miller, Robert R. Hoon:
The Role of Public Comprehensive Universities in Closing the Innovation Deficit. Computer 47(8): 22-27 (2014) - [j45]Gary L. Miller, Donald R. Sheehy:
A New Approach to Output-Sensitive Construction of Voronoi Diagrams and Delaunay Triangulations. Discret. Comput. Geom. 52(3): 476-491 (2014) - [j44]Guy E. Blelloch, Anupam Gupta, Ioannis Koutis, Gary L. Miller, Richard Peng, Kanat Tangwongsan:
Nearly-Linear Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs. Theory Comput. Syst. 55(3): 521-554 (2014) - [j43]Ioannis Koutis, Gary L. Miller, Richard Peng:
Approaching Optimality for Solving SDD Linear Systems. SIAM J. Comput. 43(1): 337-354 (2014) - [c87]Michael B. Cohen, Brittany Terese Fasy, Gary L. Miller, Amir Nayyeri, Richard Peng, Noel Walkington:
Solving 1-Laplacians in Nearly Linear Time: Collapsing and Expanding a Topological Ball. SODA 2014: 204-216 - [c86]Michael B. Cohen, Rasmus Kyng, Gary L. Miller, Jakub W. Pachocki, Richard Peng, Anup B. Rao, Shen Chen Xu:
Solving SDD linear systems in nearly mlog1/2n time. STOC 2014: 343-352 - [i16]Michael B. Cohen, Gary L. Miller, Jakub W. Pachocki, Richard Peng, Shen Chen Xu:
Stretching Stretch. CoRR abs/1401.2454 (2014) - [i15]Ioannis Koutis, Gary L. Miller, Richard Peng:
A Generalized Cheeger Inequality. CoRR abs/1412.6075 (2014) - 2013
- [c85]Gary L. Miller, Donald R. Sheehy:
A new approach to output-sensitive voronoi diagrams and delaunay triangulations. SoCG 2013: 281-288 - [c84]Gary L. Miller, Donald R. Sheehy, Ameya Velingker:
A fast algorithm for well-spaced points and approximate delaunay graphs. SoCG 2013: 289-298 - [c83]Mu Li, Gary L. Miller, Richard Peng:
Iterative Row Sampling. FOCS 2013: 127-136 - [c82]Hui Han Chin, Aleksander Madry, Gary L. Miller, Richard Peng:
Runtime guarantees for regression problems. ITCS 2013: 269-282 - [c81]Gary L. Miller, Richard Peng:
Approximate Maximum Flow on Separable Undirected Graphs. SODA 2013: 1151-1170 - [c80]Gary L. Miller, Richard Peng, Shen Chen Xu:
Parallel graph decompositions using random shifts. SPAA 2013: 196-203 - [c79]Gary L. Miller:
Solving large optimization problems using spectral graph theory. STOC 2013: 981 - [i14]Gary L. Miller, Donald R. Sheehy, Ameya Velingker:
A Fast Algorithm for Well-Spaced Points and Approximate Delaunay Graphs. CoRR abs/1304.0524 (2013) - [i13]Gary L. Miller, Richard Peng, Shen Chen Xu:
Parallel Graph Decompositions Using Random Shifts. CoRR abs/1307.3692 (2013) - [i12]Gary L. Miller, Richard Peng, Shen Chen Xu:
Parallel Algorithms for Approximate Undirected Shortest Paths in $m\log^{3+α}n$ Work. CoRR abs/1309.3545 (2013) - 2012
- [j42]Ioannis Koutis, Gary L. Miller, Richard Peng:
A fast solver for a class of linear systems. Commun. ACM 55(10): 99-107 (2012) - [j41]Mihail N. Kolountzakis, Gary L. Miller, Richard Peng, Charalampos E. Tsourakakis:
Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning. Internet Math. 8(1-2): 161-185 (2012) - [c78]Jonathan A. Kelner, Gary L. Miller, Richard Peng:
Faster approximate multicommodity flow using quadratically coupled flows. STOC 2012: 1-18 - [i11]Jonathan A. Kelner, Gary L. Miller, Richard Peng:
Faster Approximate Multicommodity Flow Using Quadratically Coupled Flows. CoRR abs/1202.3367 (2012) - [i10]Gary L. Miller, Richard Peng:
Approximate Maximum Flow on Separable Undirected Graphs. CoRR abs/1210.5227 (2012) - [i9]Gary L. Miller, Richard Peng:
Iterative Approaches to Row Sampling. CoRR abs/1211.2713 (2012) - [i8]Gary L. Miller, Donald R. Sheehy:
A New Approach to Output-Sensitive Voronoi Diagrams. CoRR abs/1212.5098 (2012) - 2011
- [j40]Ioannis Koutis, Gary L. Miller, David Tolliver:
Combinatorial preconditioners and multilevel solvers for problems in computer vision and image processing. Comput. Vis. Image Underst. 115(12): 1638-1646 (2011) - [j39]Charalampos E. Tsourakakis, Richard Peng, Maria A. Tsiarli, Gary L. Miller, Russell Schwartz:
Approximation algorithms for speeding up dynamic programming and denoising aCGH data. ACM J. Exp. Algorithmics 16 (2011) - [j38]Charalampos E. Tsourakakis, Mihail N. Kolountzakis, Gary L. Miller:
Triangle Sparsifiers. J. Graph Algorithms Appl. 15(6): 703-726 (2011) - [c77]Gary L. Miller, Todd Phillips, Don Sheehy:
Beating the spread: time-optimal point meshing. SCG 2011: 321-330 - [c76]Ioannis Koutis, Gary L. Miller, Richard Peng:
A Nearly-m log n Time Solver for SDD Linear Systems. FOCS 2011: 590-598 - [c75]Gary L. Miller, Richard Peng, Russell Schwartz, Charalampos E. Tsourakakis:
Approximate Dynamic Programming using Halfspace Queries and Multiscale Monge Decomposition. SODA 2011: 1675-1682 - [c74]Guy E. Blelloch, Anupam Gupta, Ioannis Koutis, Gary L. Miller, Richard Peng, Kanat Tangwongsan:
Near linear-work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs. SPAA 2011: 13-22 - [i7]Ioannis Koutis, Gary L. Miller, Richard Peng:
Solving SDD linear systems in time Õ(mlog nlog(1/ε)). CoRR abs/1102.4842 (2011) - [i6]Aleksander Madry, Gary L. Miller, Richard Peng:
Electrical Flow Algorithms for Total Variation Minimization. CoRR abs/1110.1358 (2011) - [i5]Guy E. Blelloch, Anupam Gupta, Ioannis Koutis, Gary L. Miller, Richard Peng, Kanat Tangwongsan:
Near Linear-Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs. CoRR abs/1111.1750 (2011) - 2010
- [j37]Gary L. Miller, Donald R. Sheehy:
Approximate centerpoints with proofs. Comput. Geom. 43(8): 647-654 (2010) - [c73]Benoît Hudson, Gary L. Miller, Steve Oudot, Donald R. Sheehy:
Topological inference via meshing. SCG 2010: 277-286 - [c72]Ioannis Koutis, Gary L. Miller, Richard Peng:
Approaching Optimality for Solving SDD Linear Systems. FOCS 2010: 235-244 - [c71]Guy E. Blelloch, Ioannis Koutis, Gary L. Miller, Kanat Tangwongsan:
Hierarchical Diagonal Blocking and Precision Reduction Applied to Combinatorial Multigrid. SC 2010: 1-12 - [c70]Mihail N. Kolountzakis, Gary L. Miller, Richard Peng, Charalampos E. Tsourakakis:
Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning. WAW 2010: 15-24 - [i4]Ioannis Koutis, Gary L. Miller, Richard Peng:
Approaching optimality for solving SDD systems. CoRR abs/1003.2958 (2010) - [i3]Gary L. Miller, Richard Peng, Russell Schwartz, Charalampos E. Tsourakakis:
Approximate Dynamic Programming for Fast Denoising of aCGH Data. CoRR abs/1003.4942 (2010) - [i2]Mihail N. Kolountzakis, Gary L. Miller, Richard Peng, Charalampos E. Tsourakakis:
Efficient Triangle Counting in Large Graphs via Degree-based Vertex Partitioning. CoRR abs/1011.0468 (2010)
2000 – 2009
- 2009
- [c69]Gary L. Miller, Todd Phillips, Donald R. Sheehy:
The Centervertex Theorem for Wedge Depth. CCCG 2009: 79-82 - [c68]Gary L. Miller, Donald R. Sheehy:
Approximate center points with proofs. SCG 2009: 153-158 - [c67]Ioannis Koutis, Gary L. Miller, David Tolliver:
Combinatorial Preconditioners and Multilevel Solvers for Problems in Computer Vision and Image Processing. ISVC (1) 2009: 1067-1078 - [c66]Charalampos E. Tsourakakis, U Kang, Gary L. Miller, Christos Faloutsos:
DOULION: counting triangles in massive graphs with a coin. KDD 2009: 837-846 - [c65]Benoît Hudson, Gary L. Miller, Todd Phillips, Don Sheehy:
Size complexity of volume meshes vs. surface meshes. SODA 2009: 1041-1047 - [i1]Charalampos E. Tsourakakis, Mihail N. Kolountzakis, Gary L. Miller:
Approximate Triangle Counting. CoRR abs/0904.3761 (2009) - 2008
- [c64]Don Sheehy, Gary L. Miller, Todd Phillips:
Linear-Size Meshes. CCCG 2008 - [c63]Ioannis Koutis, Gary L. Miller:
Graph partitioning into isolated, high conductance clusters: theory, computation and applications to preconditioning. SPAA 2008: 137-145 - 2007
- [c62]Gary L. Miller, Todd Phillips, Donald R. Sheehy:
Size Competitive Meshing Without Large Angles. ICALP 2007: 655-666 - [c61]Umut A. Acar, Benoît Hudson, Gary L. Miller, Todd Phillips:
SVR: Practical Engineering of a Fast 3D Meshing Algorithm*. IMR 2007: 45-62 - [c60]Ioannis Koutis, Gary L. Miller:
A linear work, O(n1/6) time, parallel algorithm for solving planar Laplacians. SODA 2007: 1002-1011 - [c59]Benoît Hudson, Gary L. Miller, Todd Phillips:
Sparse parallel Delaunay mesh refinement. SPAA 2007: 339-347 - 2006
- [c58]David Tolliver, Gary L. Miller:
Graph Partitioning by Spectral Rounding: Applications in Image Segmentation and Clustering. CVPR (1) 2006: 1053-1060 - [c57]David E. Cardoze, Gary L. Miller, Todd Phillips:
Representing Topological Structures Using Cell-Chains. GMP 2006: 248-266 - [c56]Benoît Hudson, Gary L. Miller, Todd Phillips:
Sparse Voronoi Refinement. IMR 2006: 339-356 - 2005
- [j36]Gary L. Miller, Steven E. Pav, Noel Walkington:
When and why delaunay refinement algorithms work. Int. J. Comput. Geom. Appl. 15(1): 25-54 (2005) - [c55]David Tolliver, Gary L. Miller, Robert T. Collins:
Corrected Laplacians: Closer Cuts and Segmentation with Shape Priors. CVPR (2) 2005: 92-98 - [c54]Bruce M. Maggs, Gary L. Miller, Ojas Parekh, R. Ravi, Shan Leung Maverick Woo:
Finding effective support-tree preconditioners. SPAA 2005: 176-185 - 2004
- [c53]Benoît Hudson, Gary L. Miller:
Using bistellar flips for rotations in point location structures. CCCG 2004: 29-32 - [c52]David E. Cardoze, Alexandre Cunha, Gary L. Miller, Todd Phillips, Noel Walkington:
A Bézier-based approach to unstructured moving meshes. SCG 2004: 310-319 - [c51]David E. Cardoze, Gary L. Miller, Mark Olah, Todd Phillips:
A Bezier-Based Moving Mesh Framework for Simulation with Elastic Membranes. IMR 2004: 71-80 - [c50]Gary L. Miller:
A time efficient Delaunay refinement algorithm. SODA 2004: 400-409 - [c49]Gary L. Miller, Peter C. Richter:
Lower bounds for graph embeddings and combinatorial preconditioners. SPAA 2004: 112-119 - 2003
- [c48]Gary L. Miller, Steven E. Pav, Noel Walkington:
When and Why Ruppert's Algorithm Works. IMR 2003: 91-102 - 2002
- [c47]Gary L. Miller, Steven E. Pav, Noel Walkington:
Fully Incremental 3D Delaunay Refinement Mesh Generation. IMR 2002: 75-86 - 2001
- [j35]Guy E. Blelloch, Hal Burch, Karl Crary, Robert Harper, Gary L. Miller, Noel Walkington:
Persistent triangulations Journal of Functional Programming. J. Funct. Program. 11(5): 441-466 (2001) - 2000
- [j34]Stephen Guattery, Gary L. Miller:
Graph Embeddings and Laplacian Eigenvalues. SIAM J. Matrix Anal. Appl. 21(3): 703-723 (2000) - [c46]James F. Antaki, Guy E. Blelloch, Omar Ghattas, Ivan Malcevic, Gary L. Miller, Noel Walkington:
A Parallel Dynamic-Mesh Lagrangian Method for Simulation of Flows with Dynamic Interfaces. SC 2000: 26 - [c45]Herbert Edelsbrunner, Xiang-Yang Li, Gary L. Miller, Andreas Stathopoulos, Dafna Talmor, Shang-Hua Teng, Alper Üngör, Noel Walkington:
Smoothing and cleaning up slivers. STOC 2000: 273-277 - [e4]Gary L. Miller, Shang-Hua Teng:
Proceedings of the Twelfth annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2000, Bar Harbor, Maine, USA, July 9-13, 2000. ACM 2000, ISBN 1-58113-185-2 [contents]
1990 – 1999
- 1999
- [j33]Guy E. Blelloch, Jonathan C. Hardwick, Gary L. Miller, Dafna Talmor:
Design and Implementation of a Practical Parallel Delaunay Algorithm. Algorithmica 24(3-4): 243-269 (1999) - [j32]Stephen Guattery, Frank Thomson Leighton, Gary L. Miller:
The Path Resistance Method For Bounding The Smallest Nontrivial Eigenvalue Of A Laplacian. Comb. Probab. Comput. 8(5): 441-460 (1999) - [j31]Gary L. Miller, Dafna Talmor, Shang-Hua Teng:
Data Generation for Geometric Algorithms on Non-Uniform Distributions. Int. J. Comput. Geom. Appl. 9(6): 577-598 (1999) - [j30]Gary L. Miller, Dafna Talmor, Shang-Hua Teng:
Optimal Coarsening of Unstructured Meshes. J. Algorithms 31(1): 29-65 (1999) - [j29]Gary L. Miller, Shang-Hua Teng:
The Dynamic Parallel Complexity of Computational Circuits. SIAM J. Comput. 28(5): 1664-1688 (1999) - [c44]Claudson F. Bornstein, Bruce M. Maggs, Gary L. Miller, R. Ravi:
Redeeming Nested Dissection: Parallelism Implies Fill. PP 1999 - [c43]Stephen Guattery, Gary L. Miller, Noel Walkington:
Estimating Interpolation Error: A Combinatorial Approach. SODA 1999: 406-413 - [c42]Claudson F. Bornstein, Bruce M. Maggs, Gary L. Miller:
Tradeoffs Between Parallelism and Fill in Nested Dissection. SPAA 1999: 191-200 - [e3]Gary L. Miller, Vijaya Ramachandran:
Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '99, Saint-Malo, France, June 27-30, 1999. ACM 1999, ISBN 1-58113-124-0 [contents] - 1998
- [j28]Stephen Guattery, Gary L. Miller:
On the Quality of Spectral Separators. SIAM J. Matrix Anal. Appl. 19(3): 701-719 (1998) - [j27]Gary L. Miller, Shang-Hua Teng, William P. Thurston, Stephen A. Vavasis:
Geometric Separators for Finite-Element Meshes. SIAM J. Sci. Comput. 19(2): 364-386 (1998) - [j26]John R. Gilbert, Gary L. Miller, Shang-Hua Teng:
Geometric Mesh Partitioning: Implementation and Experiments. SIAM J. Sci. Comput. 19(6): 2091-2110 (1998) - [c41]Gary L. Miller:
Control Volume Meshes Using Sphere Packing. IRREGULAR 1998: 128-131 - [e2]Gary L. Miller, Phillip B. Gibbons:
Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '98, Puerto Vallarta, Mexico, June 28 - July 2, 1998. ACM 1998, ISBN 0-89791-989-0 [contents] - 1997
- [j25]Gary L. Miller, Shang-Hua Teng:
Tree-Based Parallel Algorithm Design. Algorithmica 19(4): 369-389 (1997) - [j24]Gary L. Miller, Shang-Hua Teng, William P. Thurston, Stephen A. Vavasis:
Separators for sphere-packings and nearest neighbor graphs. J. ACM 44(1): 1-29 (1997) - [j23]Keith D. Gremban, Gary L. Miller, Shang-Hua Teng:
Moments of Inertia and Graph Separators. J. Comb. Optim. 1(1): 79-104 (1997) - [c40]Claudson F. Bornstein, Bruce M. Maggs, Gary L. Miller, R. Ravi:
Parallelizing Elimination Orders with Linear Fill. FOCS 1997: 274-283 - [c39]Stephen Guattery, Frank Thomson Leighton, Gary L. Miller:
The Path Resistance Method for Bounding lambda2 of a Laplacian. SODA 1997: 201-210 - [c38]Gary L. Miller, Dafna Talmor, Shang-Hua Teng:
Optimal Good-Aspect-Ratio Coarsening for Unstructured Meshes. SODA 1997: 538-547 - 1996
- [j22]Kenneth L. Clarkson, David Eppstein, Gary L. Miller, Carl Sturtivant, Shang-Hua Teng:
Approximating center points with iterative Radon points. Int. J. Comput. Geom. Appl. 6(3): 357-377 (1996) - [c37]Guy E. Blelloch, Gary L. Miller, Dafna Talmor:
Developing a Practical Projection-Based Parallel Delaunay Algorithm. SCG 1996: 186-195 - [e1]Gary L. Miller:
Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, Pennsylvania, USA, May 22-24, 1996. ACM 1996, ISBN 0-89791-785-5 [contents] - 1995
- [j21]David Eppstein, Gary L. Miller, Shang-Hua Teng:
A Deterministic Linear Time Algorithm for Geometric Separators and its Applications. Fundam. Informaticae 22(4): 309-329 (1995) - [j20]