Gary L. Miller's Publications
•
Sorted by Date •
Classified by Research Category •
Classified by Author Last Name •
Classified by Author Last Name (2) •
Classified by Author Last Name (2)
•
Miller, G.
•
Pav, Steven E.
•
Walkington, Noel
•
Blelloch, G.
•
Burch, Hal
•
Crary, Karl
•
Harper, Robert
•
Guattery, Stephen
•
Leighton, Frank T.
•
Talmor, D.
•
Teng, Shang-Hua
•
Hardwick, Jonathan C.
•
Gilbert, John
•
Gremban, Keith
•
Thurston, W.
•
Vavasis, Stephen A.
•
Clarkson, K.
•
Eppstein, D.
•
Sturtivant, C.
•
Teng, Shang-Hua.
•
Feldmann, Anja
•
Ghattas, Omar
•
O'Hallaron
•
Schwabe, Eric
•
Shewchuk, Jonathan
•
Reid-Miller, Margaret
•
Modugno, Francesmary
•
Ramachandran, Vijaya
•
Reif, John H.
•
Anderson, Richard J.
•
Gibbons, Phillip B.
•
Karp, Richard M.
•
Soroker, Danny
•
Kaltofen, Erich
•
Gazit, H.
•
Kannan, Ravindran
•
Rudolph, Larry
•
Bach, Eric
•
Shallit, Jeffrey
•
Landau, Susan
•
Lepley, Margaret
•
Kleitman, D.
•
Gill, John
•
Djokovic, Dragomir Z.
•
Garey, M. R.
•
Johnson, D. S.
•
Papadimitriou, C. H.
•
Hudson, Benoît
•
Phillips, Todd
•
Acar, Umut A.
•
Sheehy, Donald
•
Koutis, Ioannis
•
Cardoze, David
•
Tolliver, David
•
Collins, R.T.
•
Maggs, B.
•
Parekh, Ojas
•
Ravi, R.
•
Woo, Shan Leung Maverick
•
Olah, Mark
•
Richter, Peter C.
•
Cunha, Alexandre
•
Antaki, James F.
•
Malcevic, Ivan
•
Edelsbrunner, Herbert
•
Li, Xiang-Yang
•
Stathopoulos, Andreas
•
Ungor, Alper
•
Bornstein, Claudson
•
Leighton, Tom
•
Wang, Han
•
Gremban, K.D.
•
Zagha, M.
•
Frieze, Alan M.
•
Naor, Joseph
•
Adleman, Leonard
•
Manders, Kenneth
•
Filotti, Ion S.
•
Kornhauser, Daniel
•
Spirakis, Paul
•
Ramachandran, Vijya
•
Rivest, R.
•
Baratz, A.
•
Hutchinson, Joan P.
•
Atallah, M.
•
Kosaraju, R.
•
Larmore, Larry
•
Miller, G.
- Benoît Hudson, Gary L. Miller, and Todd Phillips. Bounding the Cost of Bounding Boxes in Mesh Generation. In Ninteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008. submitted
Details
BibTeX
Download:
(unavailable)
- 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, Springer, Seattle, September 2007. to appear
Details
BibTeX
Download:
[pdf]
(390.3kB
)
- 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
)
- 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
)
- Gary L. Miller, Todd Phillips, and Donald 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
)
- 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, New York, NY, 2006.
Details
BibTeX
Download:
[pdf]
(2.0MB
)
- 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:
(unavailable)
- 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, June 2005.
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
)
- 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)
- 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:
(unavailable)
- 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:
(unavailable)
- 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, Shang-Hua 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:
(unavailable)
- 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:
(unavailable)
- 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, Frank 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:
(unavailable)
- 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, Shang-Hua 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:
(unavailable)
- Gary L. Miller, Dafna Talmor, and Shang-Hua Teng. Optimal Coarsening of Unstructured Meshes. Journal of Algorithms, 31(1):29–65, April 1999.
Details
BibTeX
Download:
(unavailable)
- John Gilbert, Gary L. Miller, and Shang-Hua Teng. Geometric Mesh Partitioning: Implementation and Experiments. SIAM J. Scientific Computing, 19(6):2091–2110, 1998.
Details
BibTeX
Download:
(unavailable)
- 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, Shang-Hua Teng, W. Thurston, and Stephen A. Vavasis. Finite-Element Meshes and Geometric Separators. SIAM Journal on Scientific Computing, 19(2):364–386, March 1998.
Details
BibTeX
Download:
(unavailable)
- Claudson Bornstein, Bruce M. Maggs, Gary 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:
(unavailable)
- Keith Gremban, Gary L Miller, and Shang-Hua Teng. Moment of Inertia and Graph Separators. Journal of Combinatorial Optimization, 1(1):79–105, 1997.
Details
BibTeX
Download:
(unavailable)
- Stephen Guattery, Tom 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
)
- Gary L. Miller, Shang-Hua Teng, W. Thurston, and Stephen A. Vavasis. Separators for Sphere-Packings and Nearest Neighborhood graphs. JACM, 44(1):1–29, January 1997.
Details
BibTeX
Download:
(unavailable)
- Gary L. Miller, Dafna Talmor, and Shang-Hua 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:
(unavailable)
- Guy E. Blelloch, Anja Feldmann, Omar Ghattas, John R. Gilbert, Gary L. Miller, David R. O'Hallaron, Eric J. Schwabe, Jonathan R. Shewchuk, and Shang-Hua Teng. Automated Parallel Solution Of Unstructured PDE problems. CACM, 1996. to appear, invited special issue
Details
BibTeX
Download:
(unavailable)
- G. Blelloch, Gary L. Miller, and D. 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
)
- K. Clarkson, D. Eppstein, Gary L. Miller, C. Sturtivant, and Shang-Hua. 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:
(unavailable)
- Gary L. Miller, Dafna Talmor, Shang-Hua 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:
(unavailable)
- Gary L. Miller, Dafna Talmor, Shang-Hua 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:
(unavailable)
- D. Eppstein, Gary L. Miller, and Shang-Hua 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:
(unavailable)
- John Gilbert, Gary L. Miller, and Shang-Hua Teng. Geometric Mesh Partitioning: Implementation and Experiments. In 9th International Parallel Processing Symposium, pp. 418–427, Santa Barbara, April 1995.
Details
BibTeX
Download:
(unavailable)
- K.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:
(unavailable)
- 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:
(unavailable)
- Stephen Guattery and Gary L. Miller. Efficient Parallel Algorithms for Planar DAGs. CS CMU-CS-95-100, CMU, 1995.
Details
BibTeX
Download:
(unavailable)
- Gary L. Miller, Dafna Talmor, Shang-Hua 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:
(unavailable)
- G. Blelloch, Gary L. Miller, and D. Talmor. Parallel Delaunay Triangulation Implementation. In MSI workshop on Computational geometry, Cornell, Oct 1994.
Details
BibTeX
Download:
(unavailable)
- G. Blelloch, B. 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:
(unavailable)
- Keith Gremban, Gary L Miller, and Shang-Hua Teng. Moment of Inertia and Graph Separators. In Fifth Annual ACM-SIAM Symposium on DiscreteAlgorithms, pp. 452–461, Arlington, VA, January 1994.
Details
BibTeX
Download:
(unavailable)
- K.D. Gremban, Gary L. Miller, and M. Zagha. Performance Evaluation of a Parallel Preconditioner. CS CMU-CS-94-205, CMU, 1994.
Details
BibTeX
Download:
(unavailable)
- Stephen Guattery and Gary L. Miller. On the Performance of Spectral Graph Partitioning Methods. CS CMU-CS-94-228, CMU, 1994.
Details
BibTeX
Download:
(unavailable)
- K. Clarkson, D. Eppstein, Gary L. Miller, C. Sturtivant, and Shang-Hua 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:
(unavailable)
- D. Eppstein, G. Miller, and Shang-Hua. 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:
(unavailable)
- Gary L. Miller, Shang-Hua 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:
(unavailable)
- Margaret Reid-Miller, Gary L. Miller, and Francesmary Modugno. List Ranking and Parallel Tree Contraction. In John Reif, editors, Synthesis of Parallel Algorithms, pp. 115–194, Morgan Kaufmann, 1993.
Details
BibTeX
Download:
(unavailable)
- Guy Blelloch, Anja Feldmann, Omar Ghattas, John Gilbert, Gary Miller, O'Hallaron, Eric Schwabe, Jonathan Shewchuk, and Shang-Hua 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:
(unavailable)
- Alan M. Frieze, Gary L. Miller, and Shang-Hua 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:
(unavailable)
- 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:
(unavailable)
- 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
)
- 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:
(unavailable)
- 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, Shang-Hua 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:
(unavailable)
- Gary L. Miller and Stephen A. Vavasis. Density graphs and separators. In Second Annual ACM-SIAM Symposium on DiscreteAlgorithms, pp. 331–336, San Fransciso, January 1991.
Details
BibTeX
Download:
(unavailable)
- Gary L. Miller and Stephen A. Vavasis. Density graphs and separators. Technical ReportCornell, 1991. Exended version of SODA paper
Details
BibTeX
Download:
(unavailable)
- 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:
(unavailable)
- 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:
(unavailable)
- 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:
(unavailable)
- 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
)
- M. Atallah, R. Kosaraju, Larry Larmore, Gary L. Miller, and Shang-Hua. 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:
(unavailable)
- Gary L. Miller and John H. Reif. Parallel Tree Contraction Part 1: Fundamentals. In Silvio Micali, editors, 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:
(unavailable)
- 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:
(unavailable)
- 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:
(unavailable)
- 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:
(unavailable)
- H. Gazit, Gary L. Miller, and Shang-Hua 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
)
- 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:
(unavailable)
- 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
)
- 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:
(unavailable)
- 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:
(unavailable)
- Hillel Gazit, Gary L. Miller, and Shang-Hua 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:
(unavailable)
- 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:
[pdf]
(945.0kB
)
- Gary L. Miller and Vijya 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:
(unavailable)
- Gary L. Miller and Shang-Hua 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:
(unavailable)
- Gary L. Miller and Shang-Hua 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:
(unavailable)
- 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 Shang-Hua Teng. Dynamic Parallel Complexity of Computational Circuits. Technical Report CRI 87-17, University of Southern California, 1987.
Details
BibTeX
Download:
(unavailable)
- 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
)
- 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:
(unavailable)
- 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]
(202.1kB
)
- 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:
(unavailable)
- 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:
(unavailable)
- 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:
(unavailable)
- 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:
(unavailable)
- 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:
(unavailable)
- Frank T. 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:
(unavailable)
- 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
)
- Daniel Kleitman, Frank T. 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:
(unavailable)
- 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:
(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:
(unavailable)
- D. Kleitman, Frank T. 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:
(unavailable)
- Frank T. 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:
(unavailable)
- Gary L. Miller and John Gill. Newton's Method and Ratios of Fibonacci Numbers. Fibonacci Quarterly, 19(1):1–3, February 1981.
Details
BibTeX
Download:
(unavailable)
- R. 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:
(unavailable)
- 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, G. 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:
(unavailable)
- 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:
(unavailable)
- 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:
(unavailable)
- 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
)
- Gary L. Miller. Graph Isomorphism, General Remarks. Journal of Computer and System Sciences, 18(2):128–142, April 1979. invited publication
Details
BibTeX
Download:
(unavailable)
- 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:
(unavailable)
- Leonard Adleman, Kenneth Manders, and Gary Miller. On Taking Roots in Finite Fields. In 18th Annual Symposium on Foundations of Computer Science, pp. 175–178, Oct. 1977.
Details
BibTeX
Download:
(unavailable)
- 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:
(unavailable)
- 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:
(unavailable)
- Gary L. Miller. On the $n^log\, n$ Isomorphism Technique: A preliminary report. Technical Report TR17, Rochester, 1977.
Details
BibTeX
Download:
(unavailable)
- Gary L. Miller. Graph Isomorphism, General Remarks. Technical Report TR18, Rochester, 1977.
Details
BibTeX
Download:
(unavailable)
- 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
)
- 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:
(unavailable)
Pav, Steven E.
- 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:
(unavailable)
- 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)
- 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:
(unavailable)
Walkington, Noel
- 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:
(unavailable)
- 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
)
- 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)
- 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:
(unavailable)
- 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:
(unavailable)
- 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, Shang-Hua 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:
(unavailable)
- 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, Shang-Hua 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:
(unavailable)
- Gary L. Miller, Dafna Talmor, Shang-Hua 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:
(unavailable)
- Gary L. Miller, Dafna Talmor, Shang-Hua 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:
(unavailable)
- Gary L. Miller, Dafna Talmor, Shang-Hua 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:
(unavailable)
Blelloch, G.
- 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:
(unavailable)
- 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)
- 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:
(unavailable)
- Guy E. Blelloch, Anja Feldmann, Omar Ghattas, John R. Gilbert, Gary L. Miller, David R. O'Hallaron, Eric J. Schwabe, Jonathan R. Shewchuk, and Shang-Hua Teng. Automated Parallel Solution Of Unstructured PDE problems. CACM, 1996. to appear, invited special issue
Details
BibTeX
Download:
(unavailable)
- G. Blelloch, Gary L. Miller, and D. 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
)
- G. Blelloch, Gary L. Miller, and D. Talmor. Parallel Delaunay Triangulation Implementation. In MSI workshop on Computational geometry, Cornell, Oct 1994.
Details
BibTeX
Download:
(unavailable)
- G. Blelloch, B. 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:
(unavailable)
- Guy Blelloch, Anja Feldmann, Omar Ghattas, John Gilbert, Gary Miller, O'Hallaron, Eric Schwabe, Jonathan Shewchuk, and Shang-Hua 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:
(unavailable)
Burch, Hal
Crary, Karl
Harper, Robert
Guattery, Stephen
- Stephen Guattery, Frank 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:
(unavailable)
- 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
)
- 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
)
- Stephen Guattery, Tom 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 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:
(unavailable)
- Stephen Guattery and Gary L. Miller. Efficient Parallel Algorithms for Planar DAGs. CS CMU-CS-95-100, CMU, 1995.
Details
BibTeX
Download:
(unavailable)
- 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)
- Stephen Guattery and Gary L. Miller. On the Performance of Spectral Graph Partitioning Methods. CS CMU-CS-94-228, CMU, 1994.
Details
BibTeX
Download:
(unavailable)
- 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:
(unavailable)
Leighton, Frank T.
- Stephen Guattery, Frank 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:
(unavailable)
- Frank T. 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:
(unavailable)
- Daniel Kleitman, Frank T. 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:
(unavailable)
- D. Kleitman, Frank T. 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:
(unavailable)
- Frank T. 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:
(unavailable)
Talmor, D.
- Herbert Edelsbrunner, Xiang-Yang Li, Gary L. Miller, Andreas Stathopoulos, Dafna Talmor, Shang-Hua 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:
(unavailable)
- 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:
(unavailable)
- Gary L. Miller, Dafna Talmor, Shang-Hua 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:
(unavailable)
- Gary L. Miller, Dafna Talmor, and Shang-Hua Teng. Optimal Coarsening of Unstructured Meshes. Journal of Algorithms, 31(1):29–65, April 1999.
Details
BibTeX
Download:
(unavailable)
- Gary L. Miller, Dafna Talmor, and Shang-Hua 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:
(unavailable)
- 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
)
- G. Blelloch, Gary L. Miller, and D. 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
)
- Gary L. Miller, Dafna Talmor, Shang-Hua 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:
(unavailable)
- Gary L. Miller, Dafna Talmor, Shang-Hua 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:
(unavailable)
- Gary L. Miller, Dafna Talmor, Shang-Hua 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:
(unavailable)
- G. Blelloch, Gary L. Miller, and D. Talmor. Parallel Delaunay Triangulation Implementation. In MSI workshop on Computational geometry, Cornell, Oct 1994.
Details
BibTeX
Download:
(unavailable)
Teng, Shang-Hua
- Herbert Edelsbrunner, Xiang-Yang Li, Gary L. Miller, Andreas Stathopoulos, Dafna Talmor, Shang-Hua 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:
(unavailable)
- Gary L. Miller, Dafna Talmor, Shang-Hua 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:
(unavailable)
- Gary L. Miller, Dafna Talmor, and Shang-Hua Teng. Optimal Coarsening of Unstructured Meshes. Journal of Algorithms, 31(1):29–65, April 1999.
Details
BibTeX
Download:
(unavailable)
- John Gilbert, Gary L. Miller, and Shang-Hua Teng. Geometric Mesh Partitioning: Implementation and Experiments. SIAM J. Scientific Computing, 19(6):2091–2110, 1998.
Details
BibTeX
Download:
(unavailable)
- Gary L. Miller, Shang-Hua Teng, W. Thurston, and Stephen A. Vavasis. Finite-Element Meshes and Geometric Separators. SIAM Journal on Scientific Computing, 19(2):364–386, March 1998.
Details
BibTeX
Download:
(unavailable)
- Keith Gremban, Gary L Miller, and Shang-Hua Teng. Moment of Inertia and Graph Separators. Journal of Combinatorial Optimization, 1(1):79–105, 1997.
Details
BibTeX
Download:
(unavailable)
- Gary L. Miller, Shang-Hua Teng, W. Thurston, and Stephen A. Vavasis. Separators for Sphere-Packings and Nearest Neighborhood graphs. JACM, 44(1):1–29, January 1997.
Details
BibTeX
Download:
(unavailable)
- Gary L. Miller, Dafna Talmor, and Shang-Hua 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:
(unavailable)
- Guy E. Blelloch, Anja Feldmann, Omar Ghattas, John R. Gilbert, Gary L. Miller, David R. O'Hallaron, Eric J. Schwabe, Jonathan R. Shewchuk, and Shang-Hua Teng. Automated Parallel Solution Of Unstructured PDE problems. CACM, 1996. to appear, invited special issue
Details
BibTeX
Download:
(unavailable)
- Gary L. Miller, Dafna Talmor, Shang-Hua 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:
(unavailable)
- Gary L. Miller, Dafna Talmor, Shang-Hua 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:
(unavailable)
- D. Eppstein, Gary L. Miller, and Shang-Hua 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:
(unavailable)
- John Gilbert, Gary L. Miller, and Shang-Hua Teng. Geometric Mesh Partitioning: Implementation and Experiments. In 9th International Parallel Processing Symposium, pp. 418–427, Santa Barbara, April 1995.
Details
BibTeX
Download:
(unavailable)
- Gary L. Miller, Dafna Talmor, Shang-Hua 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:
(unavailable)
- Keith Gremban, Gary L Miller, and Shang-Hua Teng. Moment of Inertia and Graph Separators. In Fifth Annual ACM-SIAM Symposium on DiscreteAlgorithms, pp. 452–461, Arlington, VA, January 1994.
Details
BibTeX
Download:
(unavailable)
- K. Clarkson, D. Eppstein, Gary L. Miller, C. Sturtivant, and Shang-Hua 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:
(unavailable)
- Gary L. Miller, Shang-Hua 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:
(unavailable)
- Guy Blelloch, Anja Feldmann, Omar Ghattas, John Gilbert, Gary Miller, O'Hallaron, Eric Schwabe, Jonathan Shewchuk, and Shang-Hua 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:
(unavailable)
- Alan M. Frieze, Gary L. Miller, and Shang-Hua 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:
(unavailable)
- Gary L. Miller, Shang-Hua 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:
(unavailable)
- H. Gazit, Gary L. Miller, and Shang-Hua 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, Gary L. Miller, and Shang-Hua Teng. Optimal Tree Contraction in the EREW Model. Technical Report CRI 87-53, University of Southern California, 1987.
Details
BibTeX
Download:
(unavailable)
- Gary L. Miller and Shang-Hua 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:
(unavailable)
- Gary L. Miller and Shang-Hua 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:
(unavailable)
- Gary L. Miller and Shang-Hua Teng. Dynamic Parallel Complexity of Computational Circuits. Technical Report CRI 87-17, University of Southern California, 1987.
Details
BibTeX
Download:
(unavailable)
Hardwick, Jonathan C.
- 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:
(unavailable)
Gilbert, John
- John Gilbert, Gary L. Miller, and Shang-Hua Teng. Geometric Mesh Partitioning: Implementation and Experiments. SIAM J. Scientific Computing, 19(6):2091–2110, 1998.
Details
BibTeX
Download:
(unavailable)
- Guy E. Blelloch, Anja Feldmann, Omar Ghattas, John R. Gilbert, Gary L. Miller, David R. O'Hallaron, Eric J. Schwabe, Jonathan R. Shewchuk, and Shang-Hua Teng. Automated Parallel Solution Of Unstructured PDE problems. CACM, 1996. to appear, invited special issue
Details
BibTeX
Download:
(unavailable)
- John Gilbert, Gary L. Miller, and Shang-Hua Teng. Geometric Mesh Partitioning: Implementation and Experiments. In 9th International Parallel Processing Symposium, pp. 418–427, Santa Barbara, April 1995.
Details
BibTeX
Download:
(unavailable)
- Guy Blelloch, Anja Feldmann, Omar Ghattas, John Gilbert, Gary Miller, O'Hallaron, Eric Schwabe, Jonathan Shewchuk, and Shang-Hua 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:
(unavailable)
Gremban, Keith
- Keith Gremban, Gary L Miller, and Shang-Hua Teng. Moment of Inertia and Graph Separators. Journal of Combinatorial Optimization, 1(1):79–105, 1997.
Details
BibTeX
Download:
(unavailable)
- Keith 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]
(701.5kB
)
[ps.gz]
(529.2kB
)
- Keith Gremban, Gary L Miller, and Shang-Hua Teng. Moment of Inertia and Graph Separators. In Fifth Annual ACM-SIAM Symposium on DiscreteAlgorithms, pp. 452–461, Arlington, VA, January 1994.
Details
BibTeX
Download:
(unavailable)
Thurston, W.
- Gary L. Miller, Shang-Hua Teng, W. Thurston, and Stephen A. Vavasis. Finite-Element Meshes and Geometric Separators. SIAM Journal on Scientific Computing, 19(2):364–386, March 1998.
Details
BibTeX
Download:
(unavailable)
- Gary L. Miller, Shang-Hua Teng, W. Thurston, and Stephen A. Vavasis. Separators for Sphere-Packings and Nearest Neighborhood graphs. JACM, 44(1):1–29, January 1997.
Details
BibTeX
Download:
(unavailable)
- Gary L. Miller, Shang-Hua 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:
(unavailable)
- 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
)
Vavasis, Stephen A.
- Gary L. Miller, Shang-Hua Teng, W. Thurston, and Stephen A. Vavasis. Finite-Element Meshes and Geometric Separators. SIAM Journal on Scientific Computing, 19(2):364–386, March 1998.
Details
BibTeX
Download:
(unavailable)
- Gary L. Miller, Shang-Hua Teng, W. Thurston, and Stephen A. Vavasis. Separators for Sphere-Packings and Nearest Neighborhood graphs. JACM, 44(1):1–29, January 1997.
Details
BibTeX
Download:
(unavailable)
- Gary L. Miller, Shang-Hua 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:
(unavailable)
- Gary L. Miller, Shang-Hua 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:
(unavailable)
- Gary L. Miller and Stephen A. Vavasis. Density graphs and separators. In Second Annual ACM-SIAM Symposium on DiscreteAlgorithms, pp. 331–336, San Fransciso, January 1991.
Details
BibTeX
Download:
(unavailable)
- Gary L. Miller and Stephen A. Vavasis. Density graphs and separators. Technical ReportCornell, 1991. Exended version of SODA paper
Details
BibTeX
Download:
(unavailable)
Clarkson, K.
- K. Clarkson, D. Eppstein, Gary L. Miller, C. Sturtivant, and Shang-Hua. 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:
(unavailable)
- K. Clarkson, D. Eppstein, Gary L. Miller, C. Sturtivant, and Shang-Hua 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:
(unavailable)
Eppstein, D.
- K. Clarkson, D. Eppstein, Gary L. Miller, C. Sturtivant, and Shang-Hua. 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:
(unavailable)
- D. Eppstein, Gary L. Miller, and Shang-Hua 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:
(unavailable)
- K. Clarkson, D. Eppstein, Gary L. Miller, C. Sturtivant, and Shang-Hua 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:
(unavailable)
- D. Eppstein, G. Miller, and Shang-Hua. 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:
(unavailable)
Sturtivant, C.
- K. Clarkson, D. Eppstein, Gary L. Miller, C. Sturtivant, and Shang-Hua. 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:
(unavailable)
- K. Clarkson, D. Eppstein, Gary L. Miller, C. Sturtivant, and Shang-Hua 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:
(unavailable)
Teng, Shang-Hua.
- K. Clarkson, D. Eppstein, Gary L. Miller, C. Sturtivant, and Shang-Hua. 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:
(unavailable)
- D. Eppstein, G. Miller, and Shang-Hua. 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:
(unavailable)
- M. Atallah, R. Kosaraju, Larry Larmore, Gary L. Miller, and Shang-Hua. 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:
(unavailable)
Feldmann, Anja
- Guy E. Blelloch, Anja Feldmann, Omar Ghattas, John R. Gilbert, Gary L. Miller, David R. O'Hallaron, Eric J. Schwabe, Jonathan R. Shewchuk, and Shang-Hua Teng. Automated Parallel Solution Of Unstructured PDE problems. CACM, 1996. to appear, invited special issue
Details
BibTeX
Download:
(unavailable)
- Guy Blelloch, Anja Feldmann, Omar Ghattas, John Gilbert, Gary Miller, O'Hallaron, Eric Schwabe, Jonathan Shewchuk, and Shang-Hua 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:
(unavailable)
Ghattas, Omar
- 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)
- Guy E. Blelloch, Anja Feldmann, Omar Ghattas, John R. Gilbert, Gary L. Miller, David R. O'Hallaron, Eric J. Schwabe, Jonathan R. Shewchuk, and Shang-Hua Teng. Automated Parallel Solution Of Unstructured PDE problems. CACM, 1996. to appear, invited special issue
Details
BibTeX
Download:
(unavailable)
- Guy Blelloch, Anja Feldmann, Omar Ghattas, John Gilbert, Gary Miller, O'Hallaron, Eric Schwabe, Jonathan Shewchuk, and Shang-Hua 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:
(unavailable)
O'Hallaron
- Guy E. Blelloch, Anja Feldmann, Omar Ghattas, John R. Gilbert, Gary L. Miller, David R. O'Hallaron, Eric J. Schwabe, Jonathan R. Shewchuk, and Shang-Hua Teng. Automated Parallel Solution Of Unstructured PDE problems. CACM, 1996. to appear, invited special issue
Details
BibTeX
Download:
(unavailable)
- Guy Blelloch, Anja Feldmann, Omar Ghattas, John Gilbert, Gary Miller, O'Hallaron, Eric Schwabe, Jonathan Shewchuk, and Shang-Hua 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:
(unavailable)
Schwabe, Eric
- Guy E. Blelloch, Anja Feldmann, Omar Ghattas, John R. Gilbert, Gary L. Miller, David R. O'Hallaron, Eric J. Schwabe, Jonathan R. Shewchuk, and Shang-Hua Teng. Automated Parallel Solution Of Unstructured PDE problems. CACM, 1996. to appear, invited special issue
Details
BibTeX
Download:
(unavailable)
- Guy Blelloch, Anja Feldmann, Omar Ghattas, John Gilbert, Gary Miller, O'Hallaron, Eric Schwabe, Jonathan Shewchuk, and Shang-Hua 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:
(unavailable)
Shewchuk, Jonathan
- Jonathan 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
)
- Guy E. Blelloch, Anja Feldmann, Omar Ghattas, John R. Gilbert, Gary L. Miller, David R. O'Hallaron, Eric J. Schwabe, Jonathan R. Shewchuk, and Shang-Hua Teng. Automated Parallel Solution Of Unstructured PDE problems. CACM, 1996. to appear, invited special issue
Details
BibTeX
Download:
(unavailable)
- Guy Blelloch, Anja Feldmann, Omar Ghattas, John Gilbert, Gary Miller, O'Hallaron, Eric Schwabe, Jonathan Shewchuk, and Shang-Hua 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:
(unavailable)
Reid-Miller, Margaret
- Margaret Reid-Miller, Gary L. Miller, and Francesmary Modugno. List Ranking and Parallel Tree Contraction. In John Reif, editors, Synthesis of Parallel Algorithms, pp. 115–194, Morgan Kaufmann, 1993.
Details
BibTeX
Download:
(unavailable)
Modugno, Francesmary
- Margaret Reid-Miller, Gary L. Miller, and Francesmary Modugno. List Ranking and Parallel Tree Contraction. In John Reif, editors, Synthesis of Parallel Algorithms, pp. 115–194, Morgan Kaufmann, 1993.
Details
BibTeX
Download:
(unavailable)
Ramachandran, Vijaya
- 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
)
- 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
)
- 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:
(unavailable)
- 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:
(unavailable)
Reif, John H.
- 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 and John H. Reif. Parallel Tree Contraction Part 1: Fundamentals. In Silvio Micali, editors, Randomness and Computation, pp. 47–72, JAI Press, Greenwich, Connecticut, 1989. Vol. 5
Details
BibTeX
Download:
[pdf]
(373.5kB
)
- 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 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:
(unavailable)
- 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
)
Anderson, Richard J.
- Richard J. Anderson and Gary L. Miller. Deterministic Parallel List Ranking. Algorithmica, 6:859–869, 1991.
Details
BibTeX
Download:
(unavailable)
- 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:
(unavailable)
- 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:
(unavailable)
- 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:
(unavailable)
Gibbons, Phillip B.
- 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:
(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:
(unavailable)
Karp, Richard M.
- 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:
(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:
(unavailable)
Soroker, Danny
- 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:
(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:
(unavailable)
Kaltofen, Erich
- 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
)
- 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:
(unavailable)
- 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:
(unavailable)
Gazit, H.
- 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:
(unavailable)
- 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:
(unavailable)
- 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:
(unavailable)
- H. Gazit, Gary L. Miller, and Shang-Hua 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 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:
(unavailable)
- 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:
(unavailable)
- Hillel Gazit, Gary L. Miller, and Shang-Hua Teng. Optimal Tree Contraction in the EREW Model. Technical Report CRI 87-53, University of Southern California, 1987.
Details
BibTeX
Download:
(unavailable)
Kannan, Ravindran
- 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:
(unavailable)
- 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)
Rudolph, Larry
- 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:
(unavailable)
- 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)
Bach, Eric
- 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
)
- 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:
(unavailable)
Shallit, Jeffrey
- 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
)
- 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:
(unavailable)
Landau, Susan
- 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
)
- 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:
(unavailable)
Lepley, Margaret
- Frank T. 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:
(unavailable)
- Daniel Kleitman, Frank T. 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:
(unavailable)
- D. Kleitman, Frank T. 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:
(unavailable)
Kleitman, D.
- Daniel Kleitman, Frank T. 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:
(unavailable)
- D. Kleitman, Frank T. 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:
(unavailable)
Gill, John
- Gary L. Miller and John Gill. Newton's Method and Ratios of Fibonacci Numbers. Fibonacci Quarterly, 19(1):1–3, February 1981.
Details
BibTeX
Download:
(unavailable)
Djokovic, Dragomir Z.
- 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)
- 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:
(unavailable)
- 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:
(unavailable)
Garey, M. R.
- M. R. Garey, D. S. Johnson, G. 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:
(unavailable)
Johnson, D. S.
- M. R. Garey, D. S. Johnson, G. 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:
(unavailable)
Papadimitriou, C. H.
- M. R. Garey, D. S. Johnson, G. 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:
(unavailable)
Hudson, Benoît
- Benoît Hudson, Gary L. Miller, and Todd Phillips. Bounding the Cost of Bounding Boxes in Mesh Generation. In Ninteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008. submitted
Details
BibTeX
Download:
(unavailable)
- 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, Springer, Seattle, September 2007. to appear
Details
BibTeX
Download:
[pdf]
(390.3kB
)
- 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, 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
)
- 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)
Phillips, Todd
- Benoît Hudson, Gary L. Miller, and Todd Phillips. Bounding the Cost of Bounding Boxes in Mesh Generation. In Ninteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008. submitted
Details
BibTeX
Download:
(unavailable)
- 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, Springer, Seattle, September 2007. to appear
Details
BibTeX
Download:
[pdf]
(390.3kB
)
- 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
)
- Gary L. Miller, Todd Phillips, and Donald 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
)
- 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 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
)
Acar, Umut A.
Sheehy, Donald
Koutis, Ioannis
Cardoze, David
- 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
)
- 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
)
Tolliver, David
- 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, 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
)
- 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, June 2005.
Details
BibTeX
Download:
(unavailable)
Collins, R.T.
- 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, June 2005.
Details
BibTeX
Download:
(unavailable)
Maggs, B.
- 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
)
- 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)
- Claudson Bornstein, Bruce M. Maggs, Gary 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:
(unavailable)
- G. Blelloch, B. 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:
(unavailable)
Parekh, Ojas
Ravi, R.
- 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
)
- Claudson Bornstein, Bruce M. Maggs, Gary 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:
(unavailable)
Woo, Shan Leung Maverick
Olah, Mark
Richter, Peter C.
Cunha, Alexandre
Antaki, James F.
Malcevic, Ivan
Edelsbrunner, Herbert
- Herbert Edelsbrunner, Xiang-Yang Li, Gary L. Miller, Andreas Stathopoulos, Dafna Talmor, Shang-Hua 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:
(unavailable)
Li, Xiang-Yang
- Herbert Edelsbrunner, Xiang-Yang Li, Gary L. Miller, Andreas Stathopoulos, Dafna Talmor, Shang-Hua 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:
(unavailable)
Stathopoulos, Andreas
- Herbert Edelsbrunner, Xiang-Yang Li, Gary L. Miller, Andreas Stathopoulos, Dafna Talmor, Shang-Hua 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:
(unavailable)
Ungor, Alper
- Herbert Edelsbrunner, Xiang-Yang Li, Gary L. Miller, Andreas Stathopoulos, Dafna Talmor, Shang-Hua 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:
(unavailable)
Bornstein, Claudson
- 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)
- Claudson 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
)
- Claudson Bornstein, Bruce M. Maggs, Gary 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:
(unavailable)
Leighton, Tom
Wang, Han
- Gary L. Miller, Dafna Talmor, Shang-Hua 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:
(unavailable)
Gremban, K.D.
- K.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:
(unavailable)
- K.D. Gremban, Gary L. Miller, and M. Zagha. Performance Evaluation of a Parallel Preconditioner. CS CMU-CS-94-205, CMU, 1994.
Details
BibTeX
Download:
(unavailable)
Zagha, M.
- K.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:
(unavailable)
- K.D. Gremban, Gary L. Miller, and M. Zagha. Performance Evaluation of a Parallel Preconditioner. CS CMU-CS-94-205, CMU, 1994.
Details
BibTeX
Download:
(unavailable)
Frieze, Alan M.
- Alan M. Frieze, Gary L. Miller, and Shang-Hua 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:
(unavailable)
Naor, Joseph
- 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:
(unavailable)
Adleman, Leonard
- Leonard Adleman, Kenneth Manders, and Gary Miller. On Taking Roots in Finite Fields. In 18th Annual Symposium on Foundations of Computer Science, pp. 175–178, Oct. 1977.
Details
BibTeX
Download:
(unavailable)
Manders, Kenneth
- Leonard Adleman, Kenneth Manders, and Gary Miller. On Taking Roots in Finite Fields. In 18th Annual Symposium on Foundations of Computer Science, pp. 175–178, Oct. 1977.
Details
BibTeX
Download:
(unavailable)
Filotti, Ion S.
Kornhauser, Daniel
- 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:
(unavailable)
Spirakis, Paul
- 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:
(unavailable)
Ramachandran, Vijya
- Gary L. Miller and Vijya 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:
(unavailable)
Rivest, R.
- R. 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:
(unavailable)
Baratz, A.
- R. 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:
(unavailable)
Hutchinson, Joan P.
- 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:
(unavailable)
Atallah, M.
- M. Atallah, R. Kosaraju, Larry Larmore, Gary L. Miller, and Shang-Hua. 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:
(unavailable)
Kosaraju, R.
- M. Atallah, R. Kosaraju, Larry Larmore, Gary L. Miller, and Shang-Hua. 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:
(unavailable)
Larmore, Larry
- M. Atallah, R. Kosaraju, Larry Larmore, Gary L. Miller, and Shang-Hua. 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:
(unavailable)
Generated by
bib2html.pl
(written by Patrick Riley
) on
Mon Aug 27, 2007 13:14:19