Approximating center points with interated radon points.
K. Clarkson, D. Eppstein, G.Miller, C. Sturtivant, and S-H, Teng.
International Journal of Computational Geometry and Applications, 1994.
Invited submission and to appear 1994.
A deterministic linear time algorithm for geometric separators and its applications.
D. Eppstein, G. Miller and S. Teng
Fundamenta Informaticae, 22(4):309--329, April 1995.
Invited submission and to appear 1994.
Automated parallel solution of unstructured {PDE} problems.
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.
CACM, 1994.
To appear, invited special issue.
List ranking and parallel tree contraction.
Margaret Reid-Miller, Gary L. Miller, and Francesmary Modugno
Synthesis of Parallel Algorithms, pages 115--194. Morgan Kaufmann, 1993
Automatic mesh partitioning
Gary L. Miller, Shang-Hua Teng, William Thurston, and Stephen A. Vavasis
Graphs Theory and Sparse Matrix Computation, The IMA Volumes in Mathematics
and its Application, pages 57--84. Springer-Verlag, 1993. Vol. 56
A new graph triconnectivity algorithm and its parallelization
Gary L. Miller and Vijaya Ramachandran.
Combinatorica, 12(1):53--76, 1992.
Parallel tree contraction part 2: Further applications.
Gary L. Miller and John H. Reif.
SIAM J. Comput., 20(6):1128--1147, December 1991.
Deterministic parallel list ranking.
Richard J. Anderson and Gary L. Miller
Information Processing Letters, 33(5):269--273, January 1990.
A simple randomized parallel algorithm for list-ranking.
Richard J. Anderson and Gary L. Miller.
Algorithmica, 6:859--869, 1991.
Subtree isomorphism is in random NC
Phillip B. Gibbons, Richard M. Karp, Gary L. Miller, and Danny Soroker
Discrete Applied Mathematics, 29:35--62, 1990.
Parallel tree contraction part 1: Fundamentals
Gary L. Miller and John H. Reif
Randomness and Computation, pages 47--72. JAI Press, Greenwich,
Connecticut, 1989. Vol. 5.n
Efficient parallel evaluation of straight-line code and arithmetic
circuits.
Gary L. Miller, Vijaya Ramachandran, and Erich Kaltofen.
SIAM J. Computing, 17(4):687--695, August 1988.
An improved parallel algorithm that computes the {BFS} numbering of a
directed graph.
Hillel Gazit and Gary L. Miller
Information Processing Letters, 28(2):61--65, June 1988
Sublinear parallel algorithm for computing the greatest common
divisor of two integers.
Ravindran Kannan, Gary L. Miller, and Larry Rudolph.
SIAM J. Comput., 16(1):7--16, February 1987.
An additivity theorem for the genus of a graph.
Gary L. Miller
Journal of Combinatorial Theory, Series B, 43(1):25--47, August
1987.
Sums of divisors, perfect numbers, and factoring.
Eric Bach, Gary L. Miller, and Jeffrey Shallit.
SIAM J. Comput., 15(4):1143--1154, November 1986.
Finding small simple cycle separators for 2-connected planar graphs
GaryL. Miller.
Journal of Computer and System Sciences, 32(3):265--279, June 1986.
Invited publication.
Solvability by radicals is in polynomial time.
Susan Landau and Gary L. Miller.
Journal of Computer and System Sciences, 30(2):179--208, April 1985.
Invited publication.
Layouts for the shuffle-exchange graph based on the complex plane
diagram.
Frank T. Leighton, Margaret Lepley, and Gary L. Miller.
SIAM J. Alg. Disc. Meth., 5(2):202--215, June 1984.
An asymptotically optimal layout for the shuffle-exchange graph.
Daniel Kleitman, Frank T. Leighton, Margaret Lepley, and Gary L. Miller.
Journal of Computer and System Sciences, 26(3):339--361, June 1983.
Invited publication
Isomorphism of graphs which are pairwise k-separable
Gary L. Miller.
Information and Control, 56(1--2):21--33, Jan/Feb. 1983.
Isomorphism of k-contractible graphs. a generalization of bounded
valence and bounded genus.
Gary L. Miller.
Information & Control, 56(1--2):1--20, Jan/Feb. 1983.
Newton's method and ratios of fibonacci numbers.
Gary L. Miller and J. Gill.
Fibonacci Quarterly, 19(1):1--3, February 1981.
The complexity of coloring circular arcs and chords.
M. R. Garey, D. S. Johnson, G. L. Miller, and C. H. Papadimitriou.
SIAM J. Alg. Disc. Meth., 1(2):216--227, June 1980.
Regular groups of automorphisms of cubic graphs.
Dragomir Z. Djokovic and Gary L. Miller.
Journal of Combinatorial Theory B, 29(2):195--230, Oct. 1980.
Graph isomorphism, general remarks.
Gary L. Miller.
Journal of Computer and System Sciences, 18(2):128--142, April 1979.
Invited publication.
Riemann's hypothesis and tests for primality.
Gary L. Miller.
Journal of Computer and System Sciences, 13(3):300--317, December 1976.
Invited publication.
A Delaunay based numerical method for three dimensions: generation,
formulation, and partition.
Gary L. Miller, Dafna Talmor, and Shang-Hua Teng.
Proceedings of the 27th Annual ACM Symposium on Theory of
Computing, pages 683--692, Las Vegas, May 1995. ACM.
Geometric mesh partitioning: Implementation and experiments.
John Gilbert, G.L. Miller, and ShangHua Teng. 9th International Parallel
Processing Symposium, pages 418--427, Santa Barbara, April 1995. IEEE.
On the performance of the spectral graph partitioning methods.
Stephen Guattery and Gary L. Miller.
Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 233--242. ACM-SIAM, 1995.
Performance evaluation of a parallel preconditioner.
K.D. Gremban, G.L. Miller, and M. Zagha.
9th International Parallel Processing Symposium, pages 65--69, Santa Barbara,
April 1995. IEEE.
The hidden cost of low bandwith communication.
G. Blelloch, B. Maggs, and G.L. Miller.
In Uzi Vishkin, editor, Developing a Computer Science Agenda for High-Performance Computing,
pages 22--25. ACM, ACM Press, 1994.
Moment of inertia and graph separators
Keith Gremban, Gary L Miller, and Shang-Hua Teng.
Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 452--461,
Arlington, VA, January 1994. ACM-SIAM.
A deterministic linear time algorithm for geometric separators and
its applications.
D. Eppstein, G. Miller, and S-H. Teng.
1993 ACM Symp on Computational Geometry, San Diego, May 1993. ACM.
Approximating center points with iterated radon points.
K. Clarkson, D. Eppstein, G. Miller, C. Sturtivant, and S-H. Teng.
1993 ACM Symp on Computational Geometry, pages 91--98, San Diego, May 1993.
ACM.
A separator-based framework for automated partitioning and mapping of
parallel algorithms for numerical solution of PDE
Guy Blelloch, Anja Feldmann, Omar Ghattas, John Gilbert, Gary Miller,
O'Hallaron, Eric Schwabe, Jonathan Shewchuk, and Shang-Hua Teng.
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. DAGS workshop.
A contraction procedure for planar directed graphs.
Stephen Guattery and Gary L. Miller.
1992 ACM Symposium on Parallel Algorithms and Architectures, pages 431--440,
San Diego, June-July 1992. ACM.
Applications of geometric separator theorem in computational
geometry.
Alan M. Frieze, Gary L. Miller, and Shang-Hua Teng.
1992 ACM Symposium on Parallel Algorithms and Architectures, pages 420--430,
San Diego, June-July 1992. ACM.
A unified geometric approach to graph separators.
Gary L. Miller, Shang-Hua Teng, and Stephen A. Vavasis.
32th Annual Symposium on Foundations of Computer Science,
pages 538--547, Puerto Rico, Oct 1991. IEEE.
Density graphs and separators.
Gary L. Miller and Stephen A. Vavasis.
Second Annual ACM-SIAM Symposium on Discrete Algorithms,
pages 331--336, San Fransciso, January 1991. ACM-SIAM.
Planar separators and the Euclidean norm.
Hillel Gazit and Gary L. Miller.
In SIGAL International Symposium on Algorithms, Tokyo, August
1990. Information Processing Society of Japan, Springer-Verlag.
Separators in two and three dimensions.
Gary L Miller and William Thurston
Proceedings of the 22th Annual ACM Symposium on Theory of
Computing, pages 300--309, Maryland, May 1990. ACM.
Flow in planar graphs with multiple sources and sinks.
Gary L. Miller and Joseph Naor.
30th Annual Symposium on Foundations of Computer Science,
pages 112--117, North Carolina, October 1989. IEEE.
Submitted to SIAM J. on Computing.
Constructing trees in parallel.
M. Atallah, R. Kosaraju, L. Larmore, Gary L. Miller, and S-H. Teng.
1989 ACM Symposium on Parallel Algorithms and Architectures,
pages 421--431, Santa Fe, New Mexico, June 1989. ACM.
Optimal tree contraction in an EREW model.
H. Gazit, G. L. Miller, and S-H Teng.
In S. K. Tewksbury, B. W. Dickinson, and S. C. Schwartz, editors,
Concurrent Computations: Algorithms, Architecture and Technology, pages
139--156, New York, 1988. Plenum Press.
Princeton Workshop on Algorithms, Architecture and Technology Issues
for Models of Concurrent Computation.
Deterministic parallel list ranking.
Richard J. Anderson and Gary L. Miller.
In J.H. Reif, editor, VLSI Algorithms and Architectures: 3rd
Aegean Workshop on Computing, AWOC 88, pages 81--90, N.Y., June/July 1988.
Springer-Verlag.
Lecture Notes in Computer Science, Vol. 319.
Subtree isomorphism is in random NC.
Phillip B. Gibbons, Richard M. Karp, Gary L. Miller, and Danny Soroker.
In J. H. Reif, editor, VLSI Algorithms and Architectures: 3rd
Aegean Workshop on Computing, AWOC 88, pages 43--52, N.Y., June/July 1988.
Springer-Verlag.
Lecture Notes in Computer Science, Vol. 319.
Systematic methods for tree based parallel algorithm development.
Gary L. Miller and Shang-Hua Teng
Second International Conference on Supercomputing, pages 392--403, Santa
Clara, May 1987.
Dynamic parallel complexity of computational circuits.
Gary L. Miller and Shang-Hua Teng.
Proceedings of the 19th Annual ACM Symposium on Theory of
Computing, pages 254--264, New York, May 1987. ACM.
A parallel algorithm for finding a separator in planar graphs.
Hillel Gazit and Gary L. Miller.
28th Annual Symposium on Foundations of Computer Science,
pages 238--248, Los Angeles, October 1987. IEEE.
A new graph triconnectivity algorithm and its parallelization
(extended abstract).
Gary L. Miller and Vijya Ramachandran.
In Proceedings of the 19th Annual ACM Symposium on Theory of
Computing, New York, May 1987. ACM.
Extended abstract.
Efficient parallel evaluation of straight-line code and arithmetic
circuits.
Gary L. Miller, Vijaya Ramachandran, and Erich Kaltofen.
In VLSI Algorithms and Architectures, Aegean Workshop on
Computing, AWOC 86, pages 236--245. Springer-Verlag, July 1986.
Lecture Notes in Computer Science, Vol. 227.
On deleting vertices to make a graph of positive genus planar.
Joan P. Hutchinson and Gary L. Miller.
Discrete Algorithms and Complexity Theory - Proceedings of
the Japan-US Joint Seminar, Kyoto, Japan, pages 81--98, Boston, 1986.
Academic Press.
Parallel tree contraction and its application.
Gary L. Miller and John H. Reif.
26th Symposium on Foundations of Computer Science, pages
478--489, Portland, Oregon, October 1985. IEEE.
Sums of divisors, perfect numbers, and factoring.
Eric Bach, Gary L. Miller, and Jeffrey Shallit.
Proceedings of the 16th Annual ACM Symposium on Theory of
Computing, pages 183--190, Florida, October 1984. ACM.
Sublinear parallel algorithm for computing the greatest common
divisor of two integers.
Ravindran Kannan, Gary L. Miller, and Larry Rudolph.
25th Annual Symposium on Foundations of Computer Science,
pages 7--11, Florida, October 1984. IEEE.
Coordinating pebble motion on graphs, the diameter of permutation
groups, and applications.
Daniel Kornhauser, Gary L. Miller, and Paul Spirakis.
25th Annual Symposium on Foundations of Computer Science,
pages 241--250, Florida, October 1984. IEEE.
Finding small simple cycle separators for 2-connected planar graphs.
Gary L. Miller.
Proceedings of the 16th Annual ACM Symposium on Theory of
Computing, pages 376--382, Washington,D.C., April 1984. ACM.
Solvability by radicals is in polynomial time.
Susan Landau and Gary L. Miller.
In Proceedings of the Fifteenth Annual ACM Symposium of Theory
Computing, pages 140--151, April 25-27 1983.
Isomorphism testing and canonical forms for k-contractable graphs (a
generalization of bounded valence and bounded genus).
Gary L. Miller.
In Marek Karpinski, editor, Foundations of Computation Theory,
pages 310--327, Sweden, Aug. 21--27 1983. Springer-Verlag.
Lecture Notes in Computer Science, Vol. 158.
Provably good channel routing algorithms.
R. Rivest, A. Baratz, and Gary L. Miller.
In Kung et al, editor, CMU Conference on VLSI Systems and
Computations. Computer Science Press, 1981.
Optimal layouts for small shuffle-exchange graphs
Frank T. Leighton and Gary L. Miller.
In John P. Gray, editor, VLSI81 Very Large Scale Intergration,
pages 289--300. Academic Press, August 1981.
New layouts for the shuffle-exchange graph.
D. Kleitman, Frank T. Leighton, Margaret Lepley, and Gary L. Miller.
In Proceedings of the 13th Annual ACM Symposium on Theory of
Computing, pages 278--292. ACM, May 1981.
Isomorphism testing for graphs of bounded genus.
Gary L. Miller.
In Proceedings of 12th Annual ACM Symposium on Theory of
Computing, pages 225--235. ACM, April 1980.
On determining the genus of a graph in {$O (v^{O(g)})$} steps.
Ion S. Filotti, Gary L. Miller, and John H. Reif.
In Proceedings of the Eleventh Annual ACM Symposium on the
Theory of Computing, pages 27--37, Atlanta, Georgia, April 1979. ACM.
Regular groups of automorphisms of cubic graphs.
Dragomir Z. Djokovic and Gary L. Miller.
In J. Bondy and U.S.R. Murty, editors, Proceedings: Graph Theory
and Related Topics, pages 145--152. Academic Press, 1979.
Presented at the Conference of Graph Theory and Related Topics at
Waterloo, 1977.
On the {$n^{log}\, n$} isomorphism technique: A preliminary report.
Gary L. Miller.
In Proceedings of Tenth Annual ACM Symposium on Theory of
Computing, pages 51--58. ACM, May 1978.
On taking roots in finite fields.
Leonard Adleman, Kenneth Manders, and Gary Miller.
In 18th Annual Symposium on Foundations of Computer Science,
pages 175--178, Oct. 1977.
Graph isomorphism, general remarks.
Gary L. Miller.
In Proceedings of Ninth Annual ACM Symposium on Theory of
Computing, pages 143--510. ACM, May 1977.
Riemann's hypothesis and tests for primality.
Gary L. Miller.
In Proceedings of Seventh Annual ACM Symposium on Theory of
Computing, pages 234--239. ACM, May 1975.
Optical communication for pointer based algorithms.
Richard J. Anderson and Gary L. Miller.
Technical Report CRI 88-14, University of Southern California, Los
Angeles, 1988.
Density graphs and three dimensional separators.
Gary L. Miller and Stephen A. Vavasis.
Manuscript, March 1990.