Gary L. Miller's Publications

• Sorted by Date • Classified by Research Category • Classified by Author Last Name •

Sorted by Date

• 2020 • 2019 • 2018 • 2017 • 2016 • 2015 • 2014 • 2013 • 2012 • 2011 • 2010 • 2009 • 2008 • 2007 • 2006 • 2005 • 2004 • 2003 • 2002 • 2001 • 2000 • 1999 • 1998 • 1997 • 1996 • 1995 • 1994 • 1993 • 1992 • 1991 • 1990 • 1989 • 1988 • 1987 • 1986 • 1985 • 1984 • 1983 • 1981 • 1980 • 1979 • 1978 • 1977 • 1976 • 1975 •

2020

• Timothy Chu, Gary L. Miller, Noel J. Walkington, and Alex L. Wang. Weighted Cheeger and Buser Inequalities, with Applications to Clustering and Cutting Probability Densities. In arXiv, 2020.
  Details     BibTeX     Download: [pdf] (920.3kB )  
• Timothy Chu, Gary L Miller, and Donald R Sheehy. Exact computation of a manifold metric, via Lipschitz Embeddings and Shortest Paths on a Graph. In SODA-20, Jan 2020.
  Details     BibTeX     Download: [pdf] (681.9kB )  

2019

• Gary L. Miller, Noel J. Walkington, and Alex L. Wang. Hardy-Muckenhoupt Bounds for Laplacian Eigenvalues. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019), pp. 8:1–8:19, Leibniz International Proceedings in Informatics (LIPIcs) 145, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2019.
  Details     BibTeX     Download: [pdf] (506.9kB )  [ps.gz] [ps] [HTML] 

2018

• Timothy Chu, Gary L. Miller, and Donald Sheehy. Intrinsic Metrics: Nearest Neighbor and Edge Squared Distances. In arXiv, 2018.
  Details     BibTeX     Download: [HTML] 
• Matthew Fahrbach, Gary L. Miller, Richard Peng, Saurabh Sawlani, Junxing Wang, and Shen Chen Xu. Graph Sketching Against Adaptive Adversaries Applied to the Minimum Degree Algorithm. In FOCS18, pp. 101–112, Paris, August 2018.
  Details     BibTeX     Download: [pdf] (263.5kB )  
• Gary L. Miller, Noel J. Walkington, and Alex L. Wang. Hardy-Muckenhoupt Bounds for Laplacian Eigenvalues. In ARXIV, Dec 2018.
  Details     BibTeX     Download: [pdf] (669.4kB )  

2017

• Hui Han Chin. A New View on Cycle Toggling Based Laplacian Solvers. Master's Thesis, Carnegie Mellon University,2017. CMU CS Tech Report CMU-CS-17-***
  Details     BibTeX     Download: [pdf] (650.8kB )  
• Timothy Chu, Gary L. Miller, and Donald Sheehy. Exploration of a Graph-based Density-Sensitive Metric. In ARXIV, 2017. to appear
  Details     BibTeX     Download: [pdf] (355.5kB )  
• Matthew Fahrbach, Gary L. Miller, Richard Peng, Saurabh Sawlani, Junxing Wang, and Shen Chen Xu. On Computing Min-Degree Elimination Orderings. In arXiv, 2017.
  Details     BibTeX     Download: (unavailable)
• Shen Chen Xu. Exponential Start Time Clustering and its Applications in Spectral Graphy Theory. Ph.D. Thesis, Carnegie Mellon University, Pittsburgh, 2017. CMU CS Tech Report CMU-CS-17-120
  Details     BibTeX     Download: [pdf] (1.0MB )  

2016

• Michael B. Cohen, Yin Tat Lee, Gary L. Miller, Jakub W. Pachocki, and Aaron Sidford. Geometric Median in Nearly Linear Time. In STOC16, 2016.
  Details     BibTeX     Download: [pdf] (1.2MB )  
• Kevin Deweese, John R. Gilbert, Gary L. Miller, Richard Peng, Hao Ran Xu, and Shen Chen Xu. An Empirical Study of Cycle Toggling Based Laplacian Solvers. In CSC16, Albuquerque, OCT 2016.
  Details     BibTeX     Download: [pdf] (1.2MB )  
• Alina Raluca Ene, Gary L. Miller, Jakub W. Pachocki, and Aaron Sidford. Routing under Balance. In STOC16, 2016.
  Details     BibTeX     Download: (unavailable)
• Jakub W. Pachocki. Graphs and Beyond: Faster Algorithms for High Dimensional Convex Optimization. Ph.D. Thesis, Carnegie Mellon University, Pittsburg, 2016. CMU CS Tech Report CMU-CS-16-107
  Details     BibTeX     Download: [pdf] (1.8MB )  

2015

• Michael B. Cohen, Brittany Terese Fasy, Gary L. Miller, Amir Nayyeri, Donald R. Sheehy, and Ameya Velingker. Approximating Nearest Neighbor Distances. In Proceedings of the Algorithms and Data Structures Symposium, 2015.
  Details     BibTeX     Download: [pdf] (538.5kB )  
• Michael B. Cohen, Brittany Terese Fasy, Gary L. Miller, Amir Nayyeri, Donald Sheehy, and Ameya Velingker. Approximating Nearest Neighbor Distances. CoRR, abs/1502.08048, 2015.
  Details     BibTeX     Download: [HTML] 
• Gary L. Miller. The Revolution in Graph Theoretic Optimization Problems. In Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015, pp. 181, 2015.
  Details     BibTeX     Download: [pdf] [ps.gz] [ps] [HTML] 
• Gary L. Miller, Richard Peng, Adrian Vladu, and Shen Chen Xu. Improved Parallel Algorithms for Spanners and Hopsets. In Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015, pp. 192–201, 2015.
  Details     BibTeX     Download: [pdf] (553.8kB )  [ps.gz] [ps] [HTML] 
• Prashant Sridhar. An Experimental Study into Spectral and Geometric Approaches to Data Clustering. Master's Thesis, Carnegie Mellon University,2015. CMU CS Tech Report CMU-CS-15-149
  Details     BibTeX     Download: [pdf] (4.2MB )  

2014

• Guy E. Blelloch, Anupam Gupta, Ioannis Koutis, Gary L. Miller, Richard Peng, and Kanat Tangwongsan. Nearly-Linear Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs. Theory Comput. Syst., 55(3):521–554, 2014.
  Details     BibTeX     Download: [pdf] [ps.gz] [ps] [HTML] 
• Michael B. Cohen, Rasmus Kyng, Gary L. Miller, Jakub W. Pachocki, Richard Peng, Anup B. Rao, and Shen Chen Xu. Solving SDD Linear Systems in Nearly $m łog^1/2 n$ Time. In STOC 2014, pp. 343–352, New York, NY, June 2014.
  Details     BibTeX     Download: [pdf] (625.5kB )  
• Michael B. Cohen, Brittany Terese Fasy, Gary L. Miller, Amir Nayyeri, Richard Peng, and Noel Walkington. Solving $1$-Laplacians of Convex Simplicial Complexes in Nearly Linear Time: Collapsing and Expanding a Topological Ball. In SODA 2014, pp. 204–216, 2014.
  Details     BibTeX     Download: [pdf] (526.9kB )  
• Michael B. Cohen, Gary L. Miller, Jakub W. Pachocki, Richard Peng, and Shen Chen Xu. Stretching Stretch. CoRR, abs/1401.2454, 2014.
  Details     BibTeX     Download: [HTML] 
• Ioannis Koutis, Gary L. Miller, and Richard Peng. Approaching Optimality for Solving SDD Linear Systems. SIAM J. Comput., 43(1):337–354, 2014.
  Details     BibTeX     Download: [pdf] [ps.gz] [ps] [HTML] 
• Ioannis Koutis, Gary L. Miller, and Richard Peng. A Generalized Cheeger Inequality. CoRR, abs/1412.6075, 2014.
  Details     BibTeX     Download: [HTML] 
• Gary L. Miller and Donald Sheehy. A New Approach to Output-Sensitive Construction of Voronoi Diagrams and Delaunay Triangulations. Discrete & Computational Geometry, 52(3):476–491, 2014.
  Details     BibTeX     Download: [pdf] [ps.gz] [ps] [HTML] 

2013

• Hui Han Chin, Aleksander Madry, Gary L. Miller, and Richard Peng. Runtime guarantees for regression problems. In ITCS, pp. 269–282, 2013.
  Details     BibTeX     Download: [pdf] (850.1kB )  
• Ioannis Koutis and Gary Lee Miller. Methods and Apparatuses for Solving Graph Laplacians. 08 2013.
  Details     BibTeX     Download: [pdf] (2.8MB )  
• Mu Li, Gary L. Miller, and Richard Peng. Iterative Row Sampling. In FOCS 2013, pp. 127–136, 2013.
  Details     BibTeX     Download: [pdf] (552.4kB )  
• Gary L. Miller, Richard Peng, and Shen Chen Xu. Parallel graph decompositions using random shifts. In SPAA, pp. 196–203, 2013.
  Details     BibTeX     Download: [pdf] (519.0kB )  
• Gary L. Miller, Donald R. Sheehy, and Ameya Velingker. A fast algorithm for well-spaced points and approximate Delaunay graphs. In SOCG13, pp. 289–298, 2013.
  Details     BibTeX     Download: [pdf] (636.2kB )  
• Gary L. Miller and Donald R. Sheehy. A new approach to output-sensitive Voronoi diagrams and Delaunay triangulations. In SOCG13, pp. 281–288, 2013.
  Details     BibTeX     Download: (unavailable)
• Gary L. Miller. Solving large optimization problems using spectral graph theory. In STOC, pp. 981, 2013.
  Details     BibTeX     Download: (unavailable)
• Gary L. Miller and Richard Peng. Approximate Maximum Flow on Separable Undirected Graphs. In Symposium on Discrete Algorithms (SODA 2013), New Orleans, January 2013.
  Details     BibTeX     Download: (unavailable)
• Gary Lee Miller and David Tolliver. METHOD FOR PARTITIONING COMBINATORIAL GRAPHS. 10 2013.
  Details     BibTeX     Download: [HTML] 
• Richard Yang Peng. Algorithm Design Using Spectral Graph Theory. Ph.D. Thesis, Carnegie Mellon University, Pittsburgh, 2013. CMU CS Tech Report CMU-CS-13-121
  Details     BibTeX     Download: [pdf] (2.0MB )  

2012

• Jonathan A. Kelner, Gary L. Miller, and Richard Peng. Faster approximate multicommodity flow using quadratically coupled flows. In Proceedings of the 44th symposium on Theory of Computing, pp. 1–18, STOC '12, ACM, New York, NY, USA, 2012.
  Details     BibTeX     Download: [pdf] [ps.gz] [ps] [HTML] 
• Mihail N. Kolountzakis, Gary L. Miller, Richard Peng, and Charalampos E. Tsourakakis. Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning. Internet Mathematics, 8(1-2):161–185, 2012.
  Details     BibTeX     Download: (unavailable)
• Ioannis Koutis, Gary L. Miller, and Richard Peng. A fast solver for a class of linear systems. Commun. ACM, 55(10):99–107, 2012.
  Details     BibTeX     Download: (unavailable)

2011

• Guy E. Blelloch, Anupam Gupta, Ioannis Koutis, Gary L. Miller, Richard Peng, and Kanat Tangwongsan. Near Linear-Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs. In Twenty Third Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 13–22, San Jose, CA, June 2011.
  Details     BibTeX     Download: [pdf] (522.7kB )  
• Ioannis Koutis, Gary L. Miller, and Richard Peng. Solving SDD linear systems in time $O(młognłogłog^2nłog(1/\epsilon))$. In FOCS, 2011.
  Details     BibTeX     Download: [pdf] (507.6kB )  
• Gary L. Miller, Todd Phillips, and Donald R. Sheehy. Beating the Spread: Time-Optimal Point Meshing. In Twenty Seventh Annual Symposium on Computational Geometry, pp. 321–330, Paris, June 2011.
  Details     BibTeX     Download: [pdf] (347.1kB )  
• Gary L. Miller and Todd Phillips. Runtime-Efficient Meshing for Piecewise-Linear Complexes. 2011. submitted
  Details     BibTeX     Download: [pdf] (318.8kB )  
• Gary L. Miller, Richard Peng, Russell Schwartz, and Charalampos E. Tsourakakis. Approximate Dynamic Programming using Halfspace Queries and Multiscale Monge decomposition. In Symposium on Discrete Algorithms (SODA 2011), SF, January 2011.
  Details     BibTeX     Download: [pdf] (246.8kB )  
• Donald R. Sheehy. Mesh Generation and Geometric Persistent Homology. Ph.D. Thesis, Carnegie Mellon University, Pittsburgh, 2011. CMU CS Tech Report CMU-CS-11-121
  Details     BibTeX     Download: [pdf] (3.1MB )  
• Charalampos E. Tsourakakis, Richard Peng, Maria A. Tsiarli, Gary L. Miller, and Russell Schwartz. Approximation algorithms for speeding up dynamic programming and denoising aCGH data. J. Exp. Algorithmics, 16:1.8:1.1–1.8:1.27, ACM, New York, NY, USA, December 2011.
  Details     BibTeX     Download: [pdf] [ps.gz] [ps] [HTML] 

2010

• Guy E. Blelloch, Ioannis Koutis, Gary L. Miller, and Kanat Tangwongsan. Hierarchical Diagonal Blocking with precision reduction applied to combinatorial multigrid. In SC10, pp. 1–12, New Orleans, Nov 2010.
  Details     BibTeX     Download: [pdf] (555.2kB )  
• Benoît Hudson, Gary L. Miller, Steve Y. Oudot, and Donald R. Sheehy. Topological Inference via Meshing. In Twenty Sixth Annual Symposium on Computational Geometry, pp. 277–286, Snowbird, Utah, June 2010.
  Details     BibTeX     Download: [pdf] (986.4kB )  
• Mihail N. Kolountzakis, Gary L. Miller, Richard Peng, Russell Schwartz, and Charalampos E. Tsourakakis. Efficient Triangle Counting in Large Graphs via Degree-based Vertex Partitioning. In 7th Workshop on Algorithms and Models for the Web Graph (WAW 2010 ), Stanford, December 2010.
  Details     BibTeX     Download: [pdf] (324.7kB )  
• Ioannis Koutis, Gary L. Miller, and Richard Peng. Approaching optimality for solving SDD systems. In FOCS, 2010.
  Details     BibTeX     Download: [pdf] (207.2kB )  
• Gary L. Miller and Donald R. Sheehy. Approximate centerpoints with proofs. Comput. Geom., 43(8):647–654, 2010.
  Details     BibTeX     Download: [pdf] (272.8kB )  
• Gary L. Miller, Todd Phillips, and Donald R. Sheehy. Fat Voronoi Diagrams. In 21th Fall Workshop on Computational and Combinatorial Geometry, Stony Brook, November 2010.
  Details     BibTeX     Download: [pdf] (294.5kB )  

2009

• Benoît Hudson, Gary L. Miller, Steve Y. Oudot, and Donald R. Sheehy. Mesh Enhanced Persistent Homology. In 20th Fall Workshop on Computational and Combinatorial Geometry, Tufts, November 2009.
  Details     BibTeX     Download: [pdf] (206.6kB )  
• Benoît Hudson, Gary L. Miller, Todd Phillips, and Donald R. Sheehy. Size Complexity of Volume Meshes vs. Surface Meshes. In Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1041–1047, New York, January 2009.
  Details     BibTeX     Download: [pdf] (243.2kB )  
• Benoît Hudson, Gary L. Miller, Steve Oudot, and Donald Sheehy. Topological Inference via Meshing. Technical Report {RR}-7125, INRIA, 2009.
  Details     BibTeX     Download: [HTML] 
• Ioannis Koutis, Gary L. Miller, and David Tolliver. Combinatorial Preconditioners and Multilevel Solvers for Problems in Computer Vision and Image Processing. In Advances in Visual Computing, 5th International Symposium, ISVC 2009, Las Vegas, NV, USA, November 30 - December 2, 2009, Proceedings, Part I, pp. 1067–1078, 2009.
  Details     BibTeX     Download: (unavailable)
• Ioannis Koutis and Gary L. Miller. The Combinatorial Multgrid Solver. In Fourteenth Copper Mountain Conference on Multigrid Methods, March 2009.
  Details     BibTeX     Download: (unavailable)
• Ioannis Koutis, Gary L. Miller, Ali Sinop, and David Tolliver . Combinatorial Preconditioners and Multilevel Solvers for Problems in Computer Vision and Image Processing. Technical ReportCMU, 2009.
  Details     BibTeX     Download: [pdf] (296.9kB )  
• Gary L. Miller and Todd Phillips. Fast Meshing for Acute PLCs. In 20th Fall Workshop on Computational and Combinatorial Geometry, Tufts, November 2009.
  Details     BibTeX     Download: [pdf] (79.2kB )  
• Gary L. Miller, Todd Phillips, and Donald R. Sheehy. The Centervertex Theorem for Wedge Depth. In CCCG: Canadian Conference in Computational Geometry, 2009.
  Details     BibTeX     Download: [pdf] (269.4kB )  
• Gary L. Miller, Todd Phillips, and Donald R. Sheehy. Approximating Voronoi Diagrams with Voronoi Diagrams. In 20th Fall Workshop on Computational and Combinatorial Geometry, Tufts, November 2009.
  Details     BibTeX     Download: [pdf] (126.2kB )  
• Gary L. Miller and Donald R. Sheehy. Approximate Center Points with Proofs. In Twenty Fifth Annual Symposium on Computational Geometry, Aarhus, Denmark, June 2009.
  Details     BibTeX     Download: [pdf] (228.2kB )  
• Todd Phillips. Efficient Mesh Generation for Piecewise Linear Complexes. Ph.D. Thesis, Carnegie Mellon University, Pittsburgh, 2009. CMU CS Tech Report CMU-CS-09-156
  Details     BibTeX     Download: [pdf] (1.0MB )  
• David Tolliver, Hiroshi Ishikawa, Joel S. Schuman, and Gary L. Miller. An In-painting Method For Combining Multiple SD-OCT Scans With Applications To Z-motion Recovery, Noise Reduction and Longitudinal Studies. In ARVO 2009 Annual Meeting, Fort Lauderdale, April 2009. Poster
  Details     BibTeX     Download: [pdf] (383.3kB )  
• Charalampos E. Tsourakakis, Mihail N. Kolountzakis, and Gary L. Miller. Approximate Triangle Counting. CoRR, abs/0904.3761, 2009.
  Details     BibTeX     Download: [pdf] (397.6kB )  
• Charalampos E. Tsourakakis, U. Kang, Gary L. Miller, and Christos Faloutsos. DOULION: counting triangles in massive graphs with a coin. In KDD, pp. 837–846, 2009.
  Details     BibTeX     Download: [pdf] (382.1kB )  

2008

• Ioannis Koutis and Gary L. Miller. Graph Partitioning into Isolated, High Conductance Clusters: Theory, Computation and Applications to Preconditioning. In 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 137–145, 2008.
  Details     BibTeX     Download: [pdf] (246.7kB )  
• Gary L. Miller, Todd Phillips, and Donald R. Sheehy. Fast Sizing Calculations for Meshing. In 18th Fall Workshop on Computational and Combinatorial Geometry, Rensselaer Polytechnic Institute, October 2008.
  Details     BibTeX     Download: [pdf] (32.2kB )  
• Gary L. Miller, Todd Phillips, and Donald R. Sheehy. Cone Depth and the Center Vertex Theorem. In 18th Fall Workshop on Computational and Combinatorial Geometry, Rensselaer Polytechnic Institute, October 2008.
  Details     BibTeX     Download: [pdf] (52.0kB )  
• Gary L. Miller, Todd Phillips, and Donald R. Sheehy . Linear-Size Meshes. In 20th Canadian Conference on Computational Geometry, Montreal, August 2008.
  Details     BibTeX     Download: [pdf] (134.1kB )  
• David Tolliver, Ioannis Koutis, Hiroshi Ishikawa, Joel S. Schuman, and Gary L. Miller. Unassisted Segmentation of Multiple Retinal Layers via Spectral Rounding. In ARVO 2008 Annual Meeting, Fort Lauderdale, April 2008. Poster
  Details     BibTeX     Download: [pdf] (9.4MB )  

2007

• Umut A. Acar, Benoît Hudson, Gary L. Miller, and Todd Phillips. SVR: Practical Engineering of a Fast 3D Meshing Algorithm. In 16th International Meshing Roundtable, pp. 45–62, Springer, Seattle, August 2007.
  Details     BibTeX     Download: [pdf] (390.3kB )  
• Benoît Hudson, Gary L. Miller, and Todd Phillips. Size Complexity of Volume Meshes vs. Surface Meshes. In 17th Fall Workshop on Computational and Combinatorial Geometry, IBM T.J. Watson Research Center, Hawthorne, November 2007.
  Details     BibTeX     Download: [pdf] (78.5kB )  
• Benoît Hudson, Gary L. Miller, and Todd Phillips. Sparse Parallel Delaunay Mesh Refinement. In 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 39–347, San Diego, June 2007.
  Details     BibTeX     Download: [pdf] (132.4kB )  
• Benoît Hudson. Dynamic Mesh Refinement. Ph.D. Thesis, Carnegie Mellon University, Pittsburgh, 2007. CMU CS Tech Report CMU-CS-07-162
  Details     BibTeX     Download: [pdf] (1.5MB )  
• Ioannis Koutis and Gary L. Miller. A linear work, $O(n^1/6)$ time, parallel algorithm for solving planar Laplacians. In Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1002–1011, January 2007.
  Details     BibTeX     Download: [pdf] (252.1kB )  [ps] (819.6kB )  
• Ioannis Koutis. Combinatorial and algebraic tools for multigrid algorithms. Ph.D. Thesis, Carnegie Mellon University, Pittsburgh, 2007. CMU CS Tech Report CMU-CS-07-131
  Details     BibTeX     Download: [pdf] (1.2MB )  
• Gary L. Miller, Todd Phillips, and Donald R. Sheehy. Size Competitive Meshing without Large Angles. In 34th International Colloquium on Automata, Languages and Programming, Wroclaw-Poland, July 2007.
  Details     BibTeX     Download: [pdf] (206.7kB )  
• Gary L. Miller and David Tolliver . Graph Partitioning by Spectral Rounding: Applications in Image Segmentation and Clustering. Technical Report CMU-CS-07-???, CMU, 2007.
  Details     BibTeX     Download: [pdf] (2.2MB )  

2006

• David E. Cardoze, Gary L. Miller, and Todd Phillips. Representing Topological Structures Using Cell-Chains. In Geometric Modeling and Processing, pp. 248–266, Pittsburgh, PA, July 2006.
  Details     BibTeX     Download: [pdf] (255.6kB )  
• Benoît Hudson, Gary L. Miller, and Todd Phillips. Sparse Voronoi Refinement. In 15th International Meshing Roundtable, pp. 339–358, Springer, Birmingham, AL, September 2006.
  Details     BibTeX     Download: [pdf] (197.0kB )  
• Benoît Hudson, Gary L. Miller, and Todd Phillips. Sparse Voronoi Refinement. Technical Report CMU-CS-06-132, CMU, 2006.
  Details     BibTeX     Download: [pdf] (331.3kB )  
• David Tolliver and Gary L. Miller. Graph Partitioning by Spectral Rounding: Applications in Image Segmentation and Clustering. In Computer Vision and Pattern Recognition,CVPR, pp. 1053–1060, 1, New York, NY, 2006.
  Details     BibTeX     Download: [pdf] (2.0MB )  
• David Tolliver. Spectral Rounding & Image Segmentation. Ph.D. Thesis, Carnegie Mellon University, Pittsburgh, 2006. CMU RI Tech Report CMU-RI-TR-06-44
  Details     BibTeX     Download: [pdf] (6.2MB )  

2005

• Hal Burch. Measuring an IP Network in situ. Ph.D. Thesis, Carnegie Mellon University, Pittsburgh, 2005. CMU CS Tech Report CMU-CS-05-132
  Details     BibTeX     Download: [pdf] (3.5MB )  
• Bruce M. Maggs, Gary L. Miller, Ojas Parekh, R. Ravi, and Shan Leung Maverick Woo. Finding effective support-tree preconditioners. In 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 176–185, Las Vegas, July 2005.
  Details     BibTeX     Download: [pdf] (268.0kB )  
• Gary L. Miller, Steven E. Pav, and Noel Walkington. When and why delaunay refinement algorithms work. Int. J. Comput. Geometry Appl., 15(1):25–54, 2005.
  Details     BibTeX     Download: [pdf] (7.7MB )  
• David Tolliver, Gary L Miller, and R.T. Collins. Corrected Laplacians: closer cuts and segmentation with shape priors. In Computer Vision and Pattern Recognition, CVPR, pp. 92–98, 2, June 2005.
  Details     BibTeX     Download: [pdf] (466.9kB )  

2004

• Claudson F Bornstein, Timothy K Canfield, Gary Lee Miller, and Satish B Rao. Optimal route selection in a content delivery network. 02 2004.
  Details     BibTeX     Download: (unavailable)
• David Cardoze, Gary L. Miller, Mark Olah, and Todd Phillips. A Bézier-Based Moving Mesh Framework for Simulation with Elastic Membranes. In Thirteenth International Meshing Roundtable, pp. 71–80, 2004.
  Details     BibTeX     Download: [pdf] (1.0MB )  
• David Cardoze, Alexandre Cunha, Gary L. Miller, Todd Phillips, and Noel Walkington. A Be'zier-based approach to unstructured moving meshes. In Twentieth Annual Symposium on Computational Geometry, pp. 310–319, Brooklyn, 2004.
  Details     BibTeX     Download: [pdf] (674.8kB )  
• Benoît Hudson and Gary L. Miller. Using bistellar flips for rotations in point location structures.. In CCCG, pp. 29–32, Montreal, August 2004.
  Details     BibTeX     Download: (unavailable)
• Gary L. Miller and Peter C. Richter. Lower bounds for graph embeddings and combinatorial preconditioners. In Sixteenth Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 112–119, Barcelona, June 2004.
  Details     BibTeX     Download: [pdf] (167.4kB )  [ps] (328.4kB )  
• Gary L. Miller. A time efficient Delaunay refinement algorithm. In Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 400–409, New Orleans, 2004.
  Details     BibTeX     Download: [pdf] (192.3kB )  

2003

• David Cardoze, Alexandre Cunha, Gary L. Miller, Todd Phillips, and Noel Walkington. A Beier-Based Approach to Unstructured Moving Meshes. Technical Report CS-CMU-03-166, CMU, 2003.
  Details     BibTeX     Download: [pdf] (1.4MB )  
• Gary L. Miller, Steven E. Pav, and Noel J. Walkington. When and Why Ruppert's Algorithm Works. In Twelfth International Meshing Roundtable, pp. 91–102, Santa Fe, NM, Sept 2003.
  Details     BibTeX     Download: (unavailable)

2002

• Gary L. Miller, Steven E. Pav, and Noel J. Walkington. Fully Incremental 3D Delaunay Refinement Mesh Generation. In Eleventh International Meshing Roundtable, pp. 75–86, Ithaca, NY, Sept 2002.
  Details     BibTeX     Download: [pdf] (13.3MB )  

2001

• Guy E. Blelloch, Hal Burch, Karl Crary, Robert Harper, Gary L. Miller, and Noel Walkington. Persistent triangulations. Journal of Functional Programming, 11(5):441–466, 2001.
  Details     BibTeX     Download: [pdf] (358.0kB )  

2000

• James F. Antaki, Guy E. Blelloch, Omar Ghattas, Ivan Malcevic, Gary L. Miller, and Noel J. Walkington. A Parallel Dynamic--Mesh Lagrangian Method for Simulation of Flows with Dynamic Interfaces. In Proceedings of Supercomputing 2000, Dallas, Texas, USA, November 4-10 2000.
  Details     BibTeX     Download: (unavailable)
• Herbert Edelsbrunner, Xiang-Yang Li, Gary L. Miller, Andreas Stathopoulos, Dafna Talmor, ShangHua Teng, Alper Ungor, and Noel Walkington. Smoothing and cleaning up slivers. In Proceedings of the 32th Annual ACM Symposium on Theory of Computing, pp. 273–277, Portland, Oregon, 2000.
  Details     BibTeX     Download: [pdf] (7.6MB )  
• Stephen Guattery and Gary L. Miller. Graph Embedding and Laplacian Eigenvalues. SIAM J. Matrix Anal. Appl., 21(3):703–723, 2000.
  Details     BibTeX     Download: [pdf] (1.2MB )  

1999

• Guy Blelloch, Jonathan C. Hardwick, Gary L. Miller, and Dafna Talmor. Design and Implementation of a Practical Parallel Delaunay Algorithm. ALGORITHMICA Special Issue on Coarse Grained Parallel Algorithms, 24:243–269, August 1999.
  Details     BibTeX     Download: [pdf] (452.3kB )  
• Claudson F. Bornstein, Bruce M. Maggs, and Gary L. Miller. Tradeoffs Between Parallelism and Fill in Nested Dissection. In Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 191–200, St Malo, France, June 1999.
  Details     BibTeX     Download: (unavailable)
• Stephen Guattery, F. Thomson Leighton, and Gary L. Miller. The Path Resistance Method For Bounding The Smallest Nontrivial Eigenvalue Of A Laplacian. Combinatorics, Probability & Computing, 8(5), 1999.
  Details     BibTeX     Download: [pdf] (303.5kB )  
• Stephen Guattery, Gary L. Miller, and Noel Walkington. Estimating Interpolation Error: A Combinatorial Approach. In Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. to appear, Baltimore, January 1999.
  Details     BibTeX     Download: [pdf] (258.1kB )  
• Gary L. Miller, Dafna Talmor, and ShangHua Teng. Data generation for geometric algorithms on non-uniform distributions. Int. J. Computational Geometry & Applications, 9(6):577–597, Dec 1999.
  Details     BibTeX     Download: [pdf] (1.5MB )  
• Gary L. Miller, Dafna Talmor, ShangHua Teng, and Noel Walkington. On the Radius--Edge Condition in the Control Volume Method. SIAM J. Numer. Anal., 36(6):1690–1708, 1999.
  Details     BibTeX     Download: [pdf] (195.8kB )  [ps.gz] (215.5kB )  
• Gary L. Miller, Dafna Talmor, and ShangHua Teng. Optimal Coarsening of Unstructured Meshes. Journal of Algorithms, 31(1):29–65, April 1999.
  Details     BibTeX     Download: [pdf] (1.5MB )  

1998

• Claudson F. Bornstein. Parallelizing and De-parallelizing Elimation Orders. Ph.D. Thesis, Carnegie Mellon University, Pittsburgh, 1998. CMU CS Tech Report CMU-CS-98-159
  Details     BibTeX     Download: [pdf] (1.3MB )  
• John Gilbert, Gary L. Miller, and ShangHua Teng. Geometric Mesh Partitioning: Implementation and Experiments. SIAM J. Scientific Computing, 19(6):2091–2110, 1998.
  Details     BibTeX     Download: [pdf] (386.3kB )  
• Stephen Guattery and Gary L. Miller. On the Quality of Spectral Separators. SIAM Journal on Matrix Analysis and Applications, 19(3):701–719, July 1998.
  Details     BibTeX     Download: [pdf] (216.0kB )  
• Gary L. Miller, ShangHua Teng, William Thurston, and Stephen A. Vavasis. Geometric separators for finite-element meshes. SIAM Journal on Scientific Computing, 19(2):364–386, March 1998.
  Details     BibTeX     Download: [pdf] (519.3kB )  

1997

• Claudson F. Bornstein, Bruce M. Maggs, Gary L. Miller, and R. Ravi. Parallel Gaussian Elimination with Linear Work and Fill. In 38th Annual Symposium on Foundations of Computer Science, pp. 274–283, Miami, Oct 1997.
  Details     BibTeX     Download: [pdf] (4.6MB )  
• Keith D. Gremban, Gary L Miller, and ShangHua Teng. Moments of Inertia and Graph Separators. Journal of Combinatorial Optimization, 1(1):79–104, 1997.
  Details     BibTeX     Download: [pdf] (2.5MB )  
• Stephen Guattery, F. Thomson Leighton, and Gary L. Miller. The Path Resistance Method for Bounding $\Lambda_2$ of a Laplacian. In Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 201–210, New Orleans, January 1997.
  Details     BibTeX     Download: [pdf] (245.1kB )  
• Stephen Guattery, F. Thomson Leighton, and Gary L. Miller. The Path Resistance Method For Bounding The Smallest Nontrivial Eigenvalue Of A Laplacian. Technical ReportICASE, 1997.
  Details     BibTeX     Download: [pdf] (5.0MB )  
• Gary L. Miller, ShangHua Teng, William Thurston, and Stephen A. Vavasis. Separators for Sphere-Packings and Nearest Neighborhood graphs. JACM, 44(1):1–29, January 1997.
  Details     BibTeX     Download: [pdf] (636.6kB )  
• Gary L. Miller, Dafna Talmor, and ShangHua Teng. Optimal Good Aspect Ratio Coarsening for Unstructured Meshes. In Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 538–547, New Orleans, January 1997.
  Details     BibTeX     Download: [pdf] (4.1MB )  
• Jonathan Richard Shewchuk. Delaunay Refinement Mesh Generation. Ph.D. Thesis, Carnegie Mellon University, Pittsburgh, 1997. CMU CS Tech Report CMU-CS-97-137
  Details     BibTeX     Download: [pdf] (3.2MB )  
• Dafna Talmor. Well-Spaced Points for Numerical Methods. Ph.D. Thesis, Carnegie Mellon University, Pittsburgh, 1997. CMU CS Tech Report CMU-CS-97-164
  Details     BibTeX     Download: [ps.gz] (2.9MB )  

1996

• Guy Blelloch, Gary L. Miller, and Dafna Talmor. Developing a Practical Projection-Based Parallel Delaunay Algorithm. In 1996 ACM Symp on Computational Geometry, pp. 186–195, Philadelphia, May 1996.
  Details     BibTeX     Download: [pdf] (505.5kB )  [ps.gz] (220.9kB )  
• Ken Clarkson, David Eppstein, Gary L. Miller, Carl Sturtivant, and ShangHua Teng. Approximating center points with iterated Radon points. International Journal of Computational Geometry and Applications, 6(3):357–377, Sepember 1996. invited submission
  Details     BibTeX     Download: [pdf] (13.6MB )  
• Keith D. Gremban. Combinatorial Preconditioners for Sparse, Symmetric, Diagonally Dominant Linear Systems. Ph.D. Thesis, Carnegie Mellon University, Pittsburgh, 1996. CMU CS Tech Report CMU-CS-96-123
  Details     BibTeX     Download: [pdf] (706.0kB )  [ps.gz] (530.3kB )  
• Gary L. Miller, Dafna Talmor, ShangHua Teng, Noel Walkington, and Han Wang. Control Volume Meshes using Sphere Packing: Generation, Refinement and Coarsening. In 5th International Meshing Roundtable `96, pp. 47–61, Pittsburgh PA, October 1996.
  Details     BibTeX     Download: [pdf] (13.8MB )  
• Gary L. Miller, Dafna Talmor, ShangHua Teng, and Noel Walkington. On the Radius-Edge Condition in the Control Volume Method. Technical Report 96-NA-024, Center for Nonlinear Analysis, 1996.
  Details     BibTeX     Download: [pdf] (217.2kB )  

1995

• David Eppstein, Gary L. Miller, and ShangHua Teng. A deterministic linear time algorithm for geometric separators and its applications. Fundamenta Informaticae, 22(4):309–329, April 1995. invited submission
  Details     BibTeX     Download: [pdf] (3.5MB )  
• John Gilbert, Gary L. Miller, and ShangHua Teng. Geometric Mesh Partitioning: Implementation and Experiments. In 9th International Parallel Processing Symposium, pp. 418–427, Santa Barbara, April 1995.
  Details     BibTeX     Download: [pdf] (1.0MB )  
• Keith D. Gremban, Gary L. Miller, and M. Zagha. Performance Evaluation of a Parallel Preconditioner. In 9th International Parallel Processing Symposium, pp. 65–69, Santa Barbara, April 1995.
  Details     BibTeX     Download: [pdf] (77.6kB )  
• Stephen Guattery and Gary L. Miller. On the Performance of the Spectral Graph Partitioning Methods. In Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 233–242, 1995.
  Details     BibTeX     Download: [pdf] (304.7kB )  
• Stephen Guattery and Gary L. Miller. Efficient Parallel Algorithms for Planar DAGs. CS CMU-CS-95-100, CMU, 1995.
  Details     BibTeX     Download: [pdf] (351.0kB )  
• Stephen Guattery. Applications of Graph-Theoretical Properties in Algorithms. Ph.D. Thesis, Carnegie Mellon University, Pittsburgh, 1995. CMU CS Tech Report CMU-CS-95-187
  Details     BibTeX     Download: (unavailable)
• Gary L. Miller and Joseph Naor. Flow in planar graphs with multiple sources and sinks. SIAM Journal on Computing, 24:1002–1017, 1995.
  Details     BibTeX     Download: [pdf] (1.3MB )  
• Gary L. Miller, Dafna Talmor, ShangHua Teng, and Noel Walkington. A Delaunay Based Numerical Method for Three Dimensions: generation, formulation, and partition. In Proceedings of the 27th Annual ACM Symposium on Theory of Computing, pp. 683–692, Las Vegas, May 1995.
  Details     BibTeX     Download: [pdf] (4.3MB )  

1994

• Guy Blelloch, Gary L. Miller, and Dafna Talmor. Parallel Delaunay Triangulation Implementation. In MSI workshop on Computational geometry, Cornell, Oct 1994.
  Details     BibTeX     Download: (unavailable)
• Guy Blelloch, Bruce Maggs, and Gary L. Miller. The Hidden Cost of Low Bandwith Communication. In Developing a Computer Science Agenda for High-Performance Computing , pp. 22–25, ACM Press, 1994.
  Details     BibTeX     Download: [pdf] (1.7MB )  
• Keith D. Gremban, Gary L Miller, and ShangHua Teng. Moments of Inertia and Graph Separators. In Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 452–461, Arlington, VA, January 1994.
  Details     BibTeX     Download: [pdf] (887.8kB )  
• Keith D. Gremban, Gary L. Miller, and M. Zagha. Performance Evaluation of a Parallel Preconditioner. CS CMU-CS-94-205, CMU, 1994.
  Details     BibTeX     Download: [pdf] (208.4kB )  
• Stephen Guattery and Gary L. Miller. On the Performance of Spectral Graph Partitioning Methods. CS CMU-CS-94-228, CMU, 1994.
  Details     BibTeX     Download: [pdf] (1.5MB )  

1993

• Ken Clarkson, David Eppstein, Gary L. Miller, Carl Sturtivant, and ShangHua Teng. Approximating center points with iterated Radon points. In 1993 ACM Symp on Computational Geometry , pp. 91–98, San Diego, May 1993.
  Details     BibTeX     Download: [pdf] (242.2kB )  
• David Eppstein, Gary L. Miller, and ShangHua Teng. A deterministic linear time algorithm for geometric separators and its applications. In 1993 ACM Symp on Computational Geometry , pp. 91–98, San Diego, May 1993.
  Details     BibTeX     Download: [pdf] (765.1kB )  
• Gary L. Miller, ShangHua Teng, William Thurston, and Stephen A. Vavasis. Automatic Mesh Partitioning. In Alan George, John Gilbert, and Joseph Liu, editors, Graphs Theory and Sparse Matrix Computation, The IMA Volumes in Mathematics and its Application, pp. 57–84, Springer-Verlag, 1993. Vol 56
  Details     BibTeX     Download: [pdf] (7.9MB )  
• Gary L. Miller, Dafna Talmor, and ShangHua Teng. Delaunay Diagrams for Well-Spaced Point Sets in Fixed Dimension. Unpublished 1993. unpublished
  Details     BibTeX     Download: [pdf] (21.9MB )  
• Margaret Reid-Miller, Gary L. Miller, and Francesmary Modugno. List Ranking and Parallel Tree Contraction. In John Reif, editor, Synthesis of Parallel Algorithms, pp. 115–194, Morgan Kaufmann, 1993.
  Details     BibTeX     Download: [pdf] (1.5MB )  
• Dafna Talmor, Gary L. Miller, and ShangHua Teng. Delaunay Tetrahedralization and Parallel Three Dimensional Mesh Generation. Unpublished 1993.
  Details     BibTeX     Download: [pdf] (2.9MB )  

1992

• Guy Blelloch, Anja Feldmann, Omar Ghattas, John Gilbert, Gary L. Miller, O'Hallaron, Eric Schwabe, Jonathan Richard Shewchuk, and ShangHua Teng. A Separator-Based Framework for Automated Partitioning and Mapping of Parallel Algorithms for Numerical Solution of PDEs. In DAGS/PC '92: First Annual Summer Institute on Issues and Obstacles in the Practical Implementation of Parallel Algorithms and the Use of Parallel Machines, Dartmouth College, June 1992.
  Details     BibTeX     Download: [pdf] (1.6MB )  
• Alan M. Frieze, Gary L. Miller, and ShangHua Teng. Applications of Geometric Separator Theorem in Computational Geometry. In 1992 ACM Symposium on Parallel Algorithms and Architectures, pp. 420–430, San Diego, June-July 1992.
  Details     BibTeX     Download: [pdf] (4.7MB )  
• Stephen Guattery and Gary L. Miller. A Contraction Procedure for Planar Directed Graphs. In 1992 ACM Symposium on Parallel Algorithms and Architectures, pp. 431–440, San Diego, June-July 1992.
  Details     BibTeX     Download: [pdf] (987.9kB )  
• Manpreet S. Khaira, Gary L. Miller, and T. J. Sheffler. Nested Dissection: A survey and comparison of various nested dissection algorithms.. Technical ReportComputer Science Department, Carnegie Mellon University, 1992.
  Details     BibTeX     Download: [pdf] (221.4kB )  [ps] (306.4kB )  
• Gary L. Miller and Vijaya Ramachandran. A New Graph Triconnectivity Algorithm and its Parallelization. Combinatorica, 12(1):53–76, 1992.
  Details     BibTeX     Download: [pdf] (135.0kB )  [ps] (208.5kB )  

1991

• Richard J. Anderson and Gary L. Miller. Deterministic Parallel List Ranking. Algorithmica, 6:859–869, 1991.
  Details     BibTeX     Download: (unavailable)
• Hillel Gazit and Gary L. Miller. A Deterministic Parallel Algorithm for Finding a Separator in Planar Graphs. Technical Report CMU-CS-91-103, Carnegie Mellon University, 1991.
  Details     BibTeX     Download: [pdf] (441.5kB )  
• Stephen Guattery and Gary L. Miller. Efficient Parallel Algorithms for Directed Planar Graphs. Unpublished 1991. unpublished
  Details     BibTeX     Download: [pdf] (24.4MB )  
• Gary L. Miller and John H. Reif. Parallel Tree Contraction Part 2: Further Applications. SIAM J. Comput., 20(6):1128–1147, December 1991.
  Details     BibTeX     Download: [pdf] (432.4kB )  
• Gary L. Miller, ShangHua Teng, and Stephen A. Vavasis. A Unified Geometric Approach to Graph Separators. In 32th Annual Symposium on Foundations of Computer Science, pp. 538–547, Puerto Rico, Oct 1991.
  Details     BibTeX     Download: [pdf] (3.9MB )  
• Gary L. Miller and Stephen A. Vavasis. Density graphs and separators. In Second Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 331–336, San Fransciso, January 1991.
  Details     BibTeX     Download: [pdf] (567.7kB )  
• Gary L. Miller and Stephen A. Vavasis. Density graphs and separators. Technical ReportCornell, 1991. Exended version of SODA paper
  Details     BibTeX     Download: [pdf] (6.0MB )  
• ShangHua Teng. Points, Spheres, and Separators, A Unified Geometric Approach to Graph Partitioning.. Ph.D. Thesis, Carnegie Mellon University, Pittsburgh, 1991. CMU CS Tech Report CMU-CS-91-184
  Details     BibTeX     Download: [pdf] (11.5MB )  

1990

• Richard J. Anderson and Gary L. Miller. A Simple Randomized Parallel Algorithm for List-Ranking. Information Processing Letters, 33(5):269–273, January 1990.
  Details     BibTeX     Download: [pdf] (1.6MB )  
• Hillel Gazit and Gary L. Miller. Planar Separators and the Euclidean Norm. In SIGAL International Symposium on Algorithms, pp. 338–347, Springer-Verlag, Tokyo, August 1990.
  Details     BibTeX     Download: [pdf] (695.9kB )  
• Phillip B. Gibbons, Richard M. Karp, Gary L. Miller, and Danny Soroker. Subtree Isomorphism is in Random NC. Discrete Applied Mathematics, 29:35–62, 1990.
  Details     BibTeX     Download: [pdf] (7.5MB )  
• Gary L Miller and William Thurston. Separators in Two and Three Dimensions. In Proceedings of the 22th Annual ACM Symposium on Theory of Computing, pp. 300–309, Maryland, May 1990.
  Details     BibTeX     Download: [pdf] (348.4kB )  
• Gary L. Miller and ShangHua Teng. Tree-Based Parallel Algorithm Design. Unpublished 1990. unpublished
  Details     BibTeX     Download: [pdf] (1.5MB )  

1989

• Mikhail Atallah, Rao Kosaraju, Lawrence Larmore, Gary L. Miller, and ShangHua Teng. Constructing Trees in Parallel. In 1989 ACM Symposium on Parallel Algorithms and Architectures, pp. 421–431, Santa Fe, New Mexico, June 1989.
  Details     BibTeX     Download: [pdf] (835.5kB )  
• Gary L. Miller and John H. Reif. Parallel Tree Contraction Part 1: Fundamentals. In Silvio Micali, editor, Randomness and Computation, pp. 47–72, JAI Press, Greenwich, Connecticut, 1989. Vol. 5
  Details     BibTeX     Download: [pdf] (373.5kB )  
• Gary L. Miller and Joseph Naor. Flow in Planar Graphs with Multiple Sources and Sinks. In 30th Annual Symposium on Foundations of Computer Science, pp. 112–117, North Carolina, October 1989. also Submitted to SIAM J. on Computing
  Details     BibTeX     Download: [pdf] (2.4MB )  
• Gary L. Miller and ShangHua Teng . Deterministic Unbiased Permuting In Parallel. Unpublished 1989. unpublished
  Details     BibTeX     Download: [pdf] (383.1kB )  

1988

• Richard J. Anderson and Gary L. Miller. Deterministic Parallel List Ranking. In VLSI Algorithms and Architectures: 3rd Aegean Workshop on Computing, AWOC 88, pp. 81–90, Springer-Verlag, N.Y., June/July 1988. Lecture Notes in Computer Science, Vol. 319
  Details     BibTeX     Download: [pdf] (3.1MB )  
• Richard J. Anderson and Gary L. Miller. Optical Communication for Pointer Based Algorithms. Technical Report CRI 88-14, Dept. of Computer Science, University of Southern California, 1988.
  Details     BibTeX     Download: [pdf] (723.9kB )  
• Hillel Gazit and Gary L. Miller. An Improved Parallel Algorithm that Computes the BFS Numbering of a Directed Graph. Information Processing Letters, 28(2):61–65, June 1988.
  Details     BibTeX     Download: [pdf] (1.5MB )  
• H. Gazit, Gary L. Miller, and ShangHua Teng. Optimal Tree Contraction in an EREW Model. In Concurrent Computations: Algorithms, Architecture and Technology, pp. 139–156, Plenum Press, New York, 1988. Princeton Workshop on Algorithms, Architecture and Technology Issues for Models of Concurrent Computation
  Details     BibTeX     Download: [pdf] (253.8kB )  
• Hillel Gazit. Processor Efficient Parallel Graph Algorithms. Ph.D. Thesis, USC, 1988.
  Details     BibTeX     Download: (unavailable)
• Phillip B. Gibbons, Richard M. Karp, Gary L. Miller, and Danny Soroker. Subtree Isomorphism is in Random NC. In VLSI Algorithms and Architectures: 3rd Aegean Workshop on Computing, AWOC 88, pp. 43–52, Springer-Verlag, N.Y., June/July 1988. Lecture Notes in Computer Science, Vol. 319
  Details     BibTeX     Download: [pdf] (3.5MB )  
• Gary L. Miller, Vijaya Ramachandran, and Erich Kaltofen. Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits. SIAM J. Computing, 17(4):687–695, August 1988.
  Details     BibTeX     Download: [pdf] (195.5kB )  

1987

• Hillel Gazit and Gary L. Miller. A Parallel Algorithm for Finding a Separator in Planar Graphs. In 28th Annual Symposium on Foundations of Computer Science, pp. 238–248, Los Angeles, October 1987.
  Details     BibTeX     Download: [pdf] (4.6MB )  
• Hillel Gazit and Gary L. Miller. A Parallel Algorithm for Finding a Separator in Planar Graphs. Technical Report CRI 87-54, University of Southern California, 1987.
  Details     BibTeX     Download: [pdf] (6.8MB )  
• Hillel Gazit, Gary L. Miller, and ShangHua Teng. Optimal Tree Contraction in the EREW Model. Technical Report CRI 87-53, University of Southern California, 1987.
  Details     BibTeX     Download: (unavailable)
• Ravindran Kannan, Gary L. Miller, and Larry Rudolph. Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers. SIAM J. Comput., 16(1):7–16, February 1987.
  Details     BibTeX     Download: [pdf] (2.7MB )  
• Gary L. Miller. An Additivity Theorem for the Genus of a Graph. Journal of Combinatorial Theory, Series B, 43(1):25–47, August 1987.
  Details     BibTeX     Download: (unavailable)
• Gary L. Miller and Vijaya Ramachandran. A New Graph Triconnectivity Algorithm and its Parallelization (Extended Abstract). In Proceedings of the 19th Annual ACM Symposium on Theory of Computing, New York, May 1987.
  Details     BibTeX     Download: [pdf] (6.5MB )  
• Gary L. Miller and ShangHua Teng. Systematic Methods for Tree Based Parallel Algorithm Development. In Second International Conference on Supercomputing, pp. 392–403, Santa Clara, May 1987.
  Details     BibTeX     Download: [pdf] (4.7MB )  
• Gary L. Miller and ShangHua Teng. Dynamic Parallel Complexity of Computational Circuits. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pp. 254–264, New York, May 1987.
  Details     BibTeX     Download: [pdf] (3.7MB )  
• Gary L. Miller and John H. Reif. Parallel Tree Contraction Part 2: Further Applications. Technical Report CRI 87-26, University of Southern California, 1987.
  Details     BibTeX     Download: (unavailable)
• Gary L. Miller and ShangHua Teng. Dynamic Parallel Complexity of Computational Circuits. Technical Report CRI 87-17, University of Southern California, 1987.
  Details     BibTeX     Download: [pdf] (779.9kB )  

1986

• Eric Bach, Gary L. Miller, and Jeffrey Shallit. Sums of Divisors, Perfect Numbers, and Factoring. SIAM J. Comput., 15(4):1143–1154, November 1986.
  Details     BibTeX     Download: [pdf] (355.0kB )  
• Dennis Estes, Leonard Adleman, Kireeti Kompella, Kevin McCurley, and Gary L. Miller. Breacking the Ong-Schorr-Shamir Signature Scheme for Quadradic Fields. Unpublished 1986.
  Details     BibTeX     Download: [pdf] (1.8MB )  
• Joan P. Hutchinson and Gary L. Miller. Deleting vertices to make graphs of positive genus planar. Discrete Algorithms and Complexity Theory, 1986. Academic Press, Boston, prelimary version
  Details     BibTeX     Download: [pdf] (570.4kB )  
• Joan P. Hutchinson and Gary L. Miller. On deleting vertices to make a graph of positive genus planar. In Discrete Algorithms and Complexity Theory - Proceedings of the Japan-US Joint Seminar, Kyoto, Japan, pp. 81–98, Academic Press, Boston, 1986.
  Details     BibTeX     Download: [pdf] (2.7MB )  
• Gary L. Miller. Finding Small Simple Cycle Separators for 2-Connected Planar Graphs. Journal of Computer and System Sciences, 32(3):265–279, June 1986. invited publication
  Details     BibTeX     Download: [pdf] (945.0kB )  
• Gary L. Miller, Vijaya Ramachandran, and Erich Kaltofen. Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits. In VLSI Algorithms and Architectures, Aegean Workshop on Computing, AWOC 86, pp. 236–245, Springer-Verlag, July 1986. Lecture Notes in Computer Science, Vol. 227
  Details     BibTeX     Download: [pdf] (1.9MB )  
• Gary L. Miller, Vijaya Ramachandran, and Erich Kaltofen. Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits. Technical Report CRI 86-32, University of Southern California, 1986.
  Details     BibTeX     Download: [pdf] (3.5MB )  
• Gary L. Miller and Vijaya Ramachandran. Efficient parallel ear decomposition with applications. Unpublished 1986. unpublished manuscript, MSRI, Berkeley, CA.
  Details     BibTeX     Download: [pdf] (214.3kB )  

1985

• Susan Landau and Gary L. Miller. Solvability by Radicals Is in Polynomial Time. Journal of Computer and System Sciences, 30(2):179–208, April 1985. invited publication
  Details     BibTeX     Download: [pdf] (1.2MB )  
• Gary L. Miller and John H. Reif. Parallel Tree Contraction and Its Application. In 26th Symposium on Foundations of Computer Science, pp. 478–489, Portland, Oregon, October 1985.
  Details     BibTeX     Download: [pdf] (1.2MB )  

1984

• Eric Bach, Gary L. Miller, and Jeffrey Shallit. Sums of Divisors, Perfect Numbers, and Factoring. In Proceedings of the 16th Annual ACM Symposium on Theory of Computing, pp. 183–190, Florida, October 1984.
  Details     BibTeX     Download: [pdf] (2.3MB )  
• Ravindran Kannan, Gary L. Miller, and Larry Rudolph. Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers. In 25th Annual Symposium on Foundations of Computer Science, pp. 7–11, Florida, October 1984.
  Details     BibTeX     Download: (unavailable)
• Daniel Kornhauser, Gary L. Miller, and Paul Spirakis. Coordinating Pebble Motion on Graphs, The Diameter of Permutation Groups, and Applications. In 25th Annual Symposium on Foundations of Computer Science, pp. 241–250, Florida, October 1984.
  Details     BibTeX     Download: [pdf] (3.6MB )  
• Daniel Kornhauser. Coordinating Pebble Motion on Graphs, The Diameter of Permutation Groups and Applications. Master's Thesis, MIT, Cambridge,1984.
  Details     BibTeX     Download: [pdf] (33.4MB )  
• F. Thomson Leighton, Margaret Lepley, and Gary L. Miller. Layouts for the Shuffle-Exchange Graph Based on the Complex Plane Diagram. SIAM J. Alg. Disc. Meth., 5(2):202–215, June 1984.
  Details     BibTeX     Download: [pdf] (1.0MB )  
• Margaret Lepley and Gary L. Miller. Computational Power For Networks Of Threshold Devices In An Asynchronous Environment. Unpublished 1984. Mathematics, MIT
  Details     BibTeX     Download: [pdf] (326.2kB )  
• Gary L. Miller. Finding Small Simple Cycle Separators For 2-Connected Planar Graphs. In Proceedings of the 16th Annual ACM Symposium on Theory of Computing, pp. 376–382, Washington,D.C., April 1984.
  Details     BibTeX     Download: [pdf] (202.1kB )  

1983

• Daniel Kleitman, F. Thomson Leighton, Margaret Lepley, and Gary L. Miller. An Asymptotically Optimal Layout for the Shuffle-Exchange Graph. Journal of Computer and System Sciences, 26(3):339–361, June 1983. invited publication
  Details     BibTeX     Download: [pdf] (2.1MB )  
• Susan Landau and Gary L. Miller. Solvability by Radicals Is in Polynomial Time. In Proceedings of the Fifteenth Annual ACM Symposium of Theory Computing, pp. 140–151, April 25-27 1983.
  Details     BibTeX     Download: [pdf] (3.6MB )  
• Susan Eva Landau. On Computing Galois Groups and its Application to Solvability by Radicals. Ph.D. Thesis, MIT, Cambridge, 1983.
  Details     BibTeX     Download: (unavailable)
• Gary L. Miller. Isomorphism of Graphs Which are Pairwise k-Separable. Information and Control, 56(1--2):21–33, Jan/Feb. 1983.
  Details     BibTeX     Download: [pdf] (241.3kB )  
• Gary L. Miller. Isomorphism of k-contractible Graphs. A Generalization of Bounded Valence and Bounded Genus. Information & Control, 56(1--2):1–20, Jan/Feb. 1983.
  Details     BibTeX     Download: [pdf] (401.6kB )  
• Gary L. Miller. Isomorphism Testing and Canonical Forms for k-Contractable Graphs (A Generalization of Bounded Valence and Bounded Genus). In Foundations of Computation Theory, pp. 310–327, Springer-Verlag, Sweden, Aug. 21--27 1983. Lecture Notes in Computer Science, Vol. 158
  Details     BibTeX     Download: [pdf] (5.5MB )  

1981

• John Gill and Gary L. Miller. Newton's Method and Ratios of Fibonacci Numbers. Fibonacci Quarterly, 19(1):1–3, February 1981.
  Details     BibTeX     Download: [pdf] (1.0MB )  
• Daniel Kleitman, F. Thomson Leighton, Margaret Lepley, and Gary L. Miller. New Layouts for the Shuffle-Exchange Graph. In Proceedings of the 13th Annual ACM Symposium on Theory of Computing, pp. 278–292, May 1981.
  Details     BibTeX     Download: [pdf] (4.1MB )  
• F. Thomson Leighton and Gary L. Miller. Optimal Layouts for Small Shuffle-Exchange Graphs. In VLSI81 Very Large Scale Intergration, pp. 289–300, Academic Press, August 1981.
  Details     BibTeX     Download: [pdf] (2.0MB )  
• Frank Thomson Leighton. Layouts for the Shuffle-Exchange Graph and Lower Bound Techniques for VLSI. Ph.D. Thesis, MIT, Cambridge, 1981.
  Details     BibTeX     Download: (unavailable)
• Jerome Reid Relis. Isomorphism of Nonplanar Embedded Graphs. Master's Thesis, MIT, Cambridge,1981.
  Details     BibTeX     Download: (unavailable)
• Ronald L. Rivest, A. Baratz, and Gary L. Miller. Provably Good Channel Routing Algorithms. In CMU Conference on VLSI Systems and Computations, Computer Science Press, 1981.
  Details     BibTeX     Download: [pdf] (2.6MB )  

1980

• Dragomir Z. Djokovic and Gary L. Miller. Regular Groups of Automorphisms of Cubic Graphs. Journal of Combinatorial Theory B, 29(2):195–230, Oct. 1980.
  Details     BibTeX     Download: (unavailable)
• M. R. Garey, D. S. Johnson, Gary L. Miller, and C. H. Papadimitriou. The Complexity of Coloring Circular Arcs and Chords. SIAM J. Alg. Disc. Meth., 1(2):216–227, June 1980.
  Details     BibTeX     Download: [pdf] (961.4kB )  
• Gary L. Miller. Isomorphism Testing for Graphs of Bounded Genus. In Proceedings of 12th Annual ACM Symposium on Theory of Computing, pp. 225–235, April 1980.
  Details     BibTeX     Download: [pdf] (737.9kB )  

1979

• Dragomir Z. Djokovic and Gary L. Miller. Regular Groups of Automorphisms of Cubic Graphs. In Proceedings: Graph Theory and Related Topics , pp. 145–152, Academic Press, 1979. Presented at the Conference of Graph Theory and Related Topics at Waterloo, 1977
  Details     BibTeX     Download: [pdf] (441.5kB )  
• Ion S. Filotti, Gary L. Miller, and John H. Reif. On Determining The Genus of a Graph In $O (v^O(g))$ Steps. In Proceedings of the Eleventh Annual ACM Symposium on the Theory of Computing, pp. 27–37, Atlanta, Georgia, April 1979.
  Details     BibTeX     Download: [pdf] (927.3kB )  
• F. Thomson Leighton and Gary l. Miller. Certificates for Graphs with Distinct Eigen Values. Unpublished 1979. Orginal Manuscript
  Details     BibTeX     Download: [pdf] (1019.8kB )  
• Gary L. Miller. Graph Isomorphism, General Remarks. Journal of Computer and System Sciences, 18(2):128–142, April 1979. invited publication
  Details     BibTeX     Download: [pdf] (1.0MB )  

1978

• Gary L. Miller. On the $n^log n$ Isomorphism Technique: A preliminary report. In Proceedings of Tenth Annual ACM Symposium on Theory of Computing, pp. 51–58, May 1978.
  Details     BibTeX     Download: [pdf] (499.1kB )  

1977

• Leonard Adleman, Kenneth Manders, and Gary L. Miller. On Taking Roots in Finite Fields. In 18th Annual Symposium on Foundations of Computer Science, pp. 175–178, Oct. 1977.
  Details     BibTeX     Download: [pdf] (1.5MB )  
• Dragomir Z. Djokovic and Gary L. Miller. Regular Groups of Automorphisms of Cubic Graphs. Technical Report TR20, Rochester, 1977.
  Details     BibTeX     Download: (unavailable)
• Dragomir Z. Djokovic and Gary L. Miller. Groups Acting on Regular Graphs and Group Amalgams. Technical Report TR24, Rochester, 1977.
  Details     BibTeX     Download: [pdf] (1.0MB )  
• Gary L. Miller. Graph Isomorphism, General Remarks. In Proceedings of Ninth Annual ACM Symposium on Theory of Computing, pp. 143–510, May 1977.
  Details     BibTeX     Download: [pdf] (2.0MB )  
• Gary L. Miller. On the $n^log n$ Isomorphism Technique: A preliminary report. Technical Report TR17, Rochester, 1977.
  Details     BibTeX     Download: [pdf] (1.4MB )  
• Gary L. Miller. Graph Isomorphism, General Remarks. Technical Report TR18, Rochester, 1977.
  Details     BibTeX     Download: (unavailable)

1976

• Gary L. Miller. Riemann's Hypothesis and Tests for Primality. Journal of Computer and System Sciences, 13(3):300–317, December 1976. invited publication
  Details     BibTeX     Download: [pdf] (425.0kB )  

1975

• Gary L. Miller. Riemann's Hypothesis and Tests for Primality. In Proceedings of Seventh Annual ACM Symposium on Theory of Computing, pp. 234–239, May 1975.
  Details     BibTeX     Download: [pdf] (1.9MB )  

Generated by bib2html.pl (written by Patrick Riley ) on Thu Mar 11, 2021 11:20:22