2009 | ||
---|---|---|
100 | Ioannis Koutis, Gary L. Miller, David Tolliver: Combinatorial Preconditioners and Multilevel Solvers for Problems in Computer Vision and Image Processing. ISVC (1) 2009: 1067-1078 | |
99 | Charalampos E. Tsourakakis, U. Kang, Gary L. Miller, Christos Faloutsos: DOULION: counting triangles in massive graphs with a coin. KDD 2009: 837-846 | |
98 | Benoît Hudson, Gary L. Miller, Todd Phillips, Don Sheehy: Size complexity of volume meshes vs. surface meshes. SODA 2009: 1041-1047 | |
97 | Gary L. Miller, Donald Sheehy: Approximate center points with proofs. Symposium on Computational Geometry 2009: 153-158 | |
96 | Charalampos E. Tsourakakis, Mihail N. Kolountzakis, Gary L. Miller: Approximate Triangle Counting CoRR abs/0904.3761: (2009) | |
2008 | ||
95 | Don Sheehy, Gary L. Miller, Todd Phillips: Linear-Size Meshes. CCCG 2008 | |
94 | Ioannis Koutis, Gary L. Miller: Graph partitioning into isolated, high conductance clusters: theory, computation and applications to preconditioning. SPAA 2008: 137-145 | |
2007 | ||
93 | Gary L. Miller, Todd Phillips, Donald Sheehy: Size Competitive Meshing Without Large Angles. ICALP 2007: 655-666 | |
92 | Umut A. Acar, Benoît Hudson, Gary L. Miller, Todd Phillips: SVR: Practical Engineering of a Fast 3D Meshing Algorithm*. IMR 2007: 45-62 | |
91 | Ioannis Koutis, Gary L. Miller: A linear work, O(n1/6) time, parallel algorithm for solving planar Laplacians. SODA 2007: 1002-1011 | |
90 | Benoît Hudson, Gary L. Miller, Todd Phillips: Sparse parallel Delaunay mesh refinement. SPAA 2007: 339-347 | |
2006 | ||
89 | David Tolliver, Gary L. Miller: Graph Partitioning by Spectral Rounding: Applications in Image Segmentation and Clustering. CVPR (1) 2006: 1053-1060 | |
88 | David E. Cardoze, Gary L. Miller, Todd Phillips: Representing Topological Structures Using Cell-Chains. GMP 2006: 248-266 | |
87 | Benoît Hudson, Gary L. Miller, Todd Phillips: Sparse Voronoi Refinement. IMR 2006: 339-356 | |
2005 | ||
86 | David Tolliver, Gary L. Miller, Robert T. Collins: Corrected Laplacians: Closer Cuts and Segmentation with Shape Priors. CVPR (2) 2005: 92-98 | |
85 | Bruce M. Maggs, Gary L. Miller, Ojas Parekh, R. Ravi, Shan Leung Maverick Woo: Finding effective support-tree preconditioners. SPAA 2005: 176-185 | |
84 | Gary L. Miller, Steven E. Pav, Noel Walkington: When and why delaunay refinement algorithms work. Int. J. Comput. Geometry Appl. 15(1): 25-54 (2005) | |
2004 | ||
83 | Benoît Hudson, Gary L. Miller: Using bistellar flips for rotations in point location structures. CCCG 2004: 29-32 | |
82 | David E. Cardoze, Gary L. Miller, Mark Olah, Todd Phillips: A Bezier-Based Moving Mesh Framework for Simulation with Elastic Membranes. IMR 2004: 71-80 | |
81 | Gary L. Miller: A time efficient Delaunay refinement algorithm. SODA 2004: 400-409 | |
80 | Gary L. Miller, Peter C. Richter: Lower bounds for graph embeddings and combinatorial preconditioners. SPAA 2004: 112-119 | |
79 | David E. Cardoze, Alexandre Cunha, Gary L. Miller, Todd Phillips, Noel Walkington: A Bézier-based approach to unstructured moving meshes. Symposium on Computational Geometry 2004: 310-319 | |
2003 | ||
78 | Gary L. Miller, Steven E. Pav, Noel Walkington: When and Why Ruppert's Algorithm Works. IMR 2003: 91-102 | |
2002 | ||
77 | Gary L. Miller, Steven E. Pav, Noel Walkington: Fully Incremental 3D Delaunay Refinement Mesh Generation. IMR 2002: 75-86 | |
2001 | ||
76 | Guy E. Blelloch, Hal Burch, Karl Crary, Robert Harper, Gary L. Miller, Noel Walkington: Persistent triangulations Journal of Functional Programming. J. Funct. Program. 11(5): 441-466 (2001) | |
2000 | ||
75 | James F. Antaki, Guy E. Blelloch, Omar Ghattas, Ivan Malcevic, Gary L. Miller, Noel Walkington: A Parallel Dynamic-Mesh Lagrangian Method for Simulation of Flows with Dynamic Interfaces. SC 2000 | |
74 | Herbert Edelsbrunner, Xiang-Yang Li, Gary L. Miller, Andreas Stathopoulos, Dafna Talmor, Shang-Hua Teng, Alper Üngör, Noel Walkington: Smoothing and cleaning up slivers. STOC 2000: 273-277 | |
1999 | ||
73 | Claudson F. Bornstein, Bruce M. Maggs, Gary L. Miller, R. Ravi: Redeeming Nested Dissection: Parallelism Implies Fill. PPSC 1999 | |
72 | Stephen Guattery, Gary L. Miller, Noel Walkington: Estimating Interpolation Error: A Combinatorial Approach. SODA 1999: 406-413 | |
71 | Claudson F. Bornstein, Bruce M. Maggs, Gary L. Miller: Tradeoffs Between Parallelism and Fill in Nested Dissection. SPAA 1999: 191-200 | |
70 | Guy E. Blelloch, Jonathan C. Hardwick, Gary L. Miller, Dafna Talmor: Design and Implementation of a Practical Parallel Delaunay Algorithm. Algorithmica 24(3-4): 243-269 (1999) | |
69 | Stephen Guattery, Frank Thomson Leighton, Gary L. Miller: The Path Resistance Method For Bounding The Smallest Nontrivial Eigenvalue Of A Laplacian Combinatorics, Probability & Computing 8(5): (1999) | |
68 | Gary L. Miller, Dafna Talmor, Shang-Hua Teng: Data Generation for Geometric Algorithms on Non-Uniform Distributions. Int. J. Comput. Geometry Appl. 9(6): 577- (1999) | |
67 | Gary L. Miller, Dafna Talmor, Shang-Hua Teng: Optimal Coarsening of Unstructured Meshes. J. Algorithms 31(1): 29-65 (1999) | |
66 | Gary L. Miller, Shang-Hua Teng: The Dynamic Parallel Complexity of Computational Circuits. SIAM J. Comput. 28(5): 1664-1688 (1999) | |
1998 | ||
65 | Gary L. Miller: Control Volume Meshes Using Sphere Packing. IRREGULAR 1998: 128-131 | |
1997 | ||
64 | Claudson F. Bornstein, Bruce M. Maggs, Gary L. Miller, R. Ravi: Parallelizing Elimination Orders with Linear Fill. FOCS 1997: 274-283 | |
63 | Stephen Guattery, Frank Thomson Leighton, Gary L. Miller: The Path Resistance Method for Bounding lambda2 of a Laplacian. SODA 1997: 201-210 | |
62 | Gary L. Miller, Dafna Talmor, Shang-Hua Teng: Optimal Good-Aspect-Ratio Coarsening for Unstructured Meshes. SODA 1997: 538-547 | |
61 | Gary L. Miller, Shang-Hua Teng: Tree-Based Parallel Algorithm Design. Algorithmica 19(4): 369-389 (1997) | |
60 | Gary L. Miller, Shang-Hua Teng, William P. Thurston, Stephen A. Vavasis: Separators for sphere-packings and nearest neighbor graphs. J. ACM 44(1): 1-29 (1997) | |
59 | Keith D. Gremban, Gary L. Miller, Shang-Hua Teng: Moments of Inertia and Graph Separators. J. Comb. Optim. 1(1): 79-104 (1997) | |
1996 | ||
58 | Guy E. Blelloch, Gary L. Miller, Dafna Talmor: Developing a Practical Projection-Based Parallel Delaunay Algorithm. Symposium on Computational Geometry 1996: 186-195 | |
57 | Kenneth L. Clarkson, David Eppstein, Gary L. Miller, Carl Sturtivant, Shang-Hua Teng: Approximating center points with iterative Radon points. Int. J. Comput. Geometry Appl. 6(3): 357-377 (1996) | |
1995 | ||
56 | John R. Gilbert, Gary L. Miller, Shang-Hua Teng: Geometric mesh partitioning: implementation and experiments. IPPS 1995: 418-427 | |
55 | Keith D. Gremban, Gary L. Miller, Marco Zagha: Performance evaluation of a new parallel preconditioner. IPPS 1995: 65-69 | |
54 | Stephen Guattery, Gary L. Miller: On the Performance of Spectral Graph Partitioning Methods. SODA 1995: 233-242 | |
53 | Gary L. Miller, Dafna Talmor, Shang-Hua Teng, Noel Walkington: A Delaunay based numerical method for three dimensions: generation, formulation, and partition. STOC 1995: 683-692 | |
52 | David Eppstein, Gary L. Miller, Shang-Hua Teng: A Deterministic Linear Time Algorithm for Geometric Separators and its Applications. Fundam. Inform. 22(4): 309-329 (1995) | |
51 | Gary L. Miller, Joseph Naor: Flow in Planar Graphs with Multiple Sources and Sinks. SIAM J. Comput. 24(5): 1002-1017 (1995) | |
1994 | ||
50 | Keith D. Gremban, Gary L. Miller, Shang-Hua Teng: Moments of Inertia and Graph Separators. SODA 1994: 452-461 | |
1993 | ||
49 | Kenneth L. Clarkson, David Eppstein, Gary L. Miller, Carl Sturtivant, Shang-Hua Teng: Approximating Center Points with Iterated Radon Points. Symposium on Computational Geometry 1993: 91-98 | |
48 | David Eppstein, Gary L. Miller, Shang-Hua Teng: A Deterministic Linear Time Algorithm for Geometric Separators and its Applications. Symposium on Computational Geometry 1993: 99-108 | |
1992 | ||
47 | Alan M. Frieze, Gary L. Miller, Shang-Hua Teng: Separator Based Parallel Divide and Conquer in Computational Geometry. SPAA 1992: 420-429 | |
46 | Stephen Guattery, Gary L. Miller: A Contraction Procedure for Planar Directed Graphs. SPAA 1992: 431-441 | |
45 | Gary L. Miller, Vijaya Ramachandran: A new graph triconnectivity algorithm and its parallelization. Combinatorica 12(1): 53-76 (1992) | |
1991 | ||
44 | Gary L. Miller, Shang-Hua Teng, Stephen A. Vavasis: A Unified Geometric Approach to Graph Separators FOCS 1991: 538-547 | |
43 | Gary L. Miller, Stephen A. Vavasis: Density Graphs and Separators. SODA 1991: 331-336 | |
42 | Richard J. Anderson, Gary L. Miller: Deterministic Parallel List Ranking. Algorithmica 6(6): 859-868 (1991) | |
41 | Gary L. Miller, John H. Reif: Parallel Tree Contraction, Part 2: Further Applications. SIAM J. Comput. 20(6): 1128-1147 (1991) | |
1990 | ||
40 | Hillel Gazit, Gary L. Miller: Planar Separators and the Euclidean Norm. SIGAL International Symposium on Algorithms 1990: 338-347 | |
39 | Gary L. Miller, William P. Thurston: Separators in Two and Three Dimensions STOC 1990: 300-309 | |
38 | Phillip B. Gibbons, Richard M. Karp, Gary L. Miller, Danny Soroker: Subtree isomorphism is in random NC. Discrete Applied Mathematics 29(1): 35-62 (1990) | |
37 | Richard J. Anderson, Gary L. Miller: A Simple Randomized Parallel Algorithm for List-Ranking. Inf. Process. Lett. 33(5): 269-273 (1990) | |
1989 | ||
36 | Gary L. Miller, Joseph Naor: Flow in Planar Graphs with Multiple Sources and Sinks (Extended Abstract) FOCS 1989: 112-117 | |
35 | Mikhail J. Atallah, S. Rao Kosaraju, Lawrence L. Larmore, Gary L. Miller, Shang-Hua Teng: Constructing Trees in Parallel. SPAA 1989: 421-431 | |
1988 | ||
34 | Phillip B. Gibbons, Richard M. Karp, Gary L. Miller, Danny Soroker: Subtree Isomorphism is in Random NC. AWOC 1988: 43-52 | |
33 | Richard J. Anderson, Gary L. Miller: Deterministic Parallel List Ranking. AWOC 1988: 81-90 | |
32 | Hillel Gazit, Gary L. Miller: An Improved Parallel Algorithm that Computes the BFS Numbering of a Directed Graph. Inf. Process. Lett. 28(2): 61-65 (1988) | |
31 | Gary L. Miller, Vijaya Ramachandran, Erich Kaltofen: Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits. SIAM J. Comput. 17(4): 687-695 (1988) | |
1987 | ||
30 | Hillel Gazit, Gary L. Miller: A Parallel Algorithm for Finding a Separator in Planar Graphs FOCS 1987: 238-248 | |
29 | Gary L. Miller, Shang-Hua Teng: Dynamic Parallel Complexity of Computational Circuits STOC 1987: 254-263 | |
28 | Gary L. Miller, Vijaya Ramachandran: A New Graph Triconnectivity Algorithm and Its Parallelization STOC 1987: 335-344 | |
27 | Gary L. Miller: An additivity theorem for the genus of a graph. J. Comb. Theory, Ser. B 43(1): 25-47 (1987) | |
26 | Ravindran Kannan, Gary L. Miller, Larry Rudolph: Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers. SIAM J. Comput. 16(1): 7-16 (1987) | |
1986 | ||
25 | Gary L. Miller, Vijaya Ramachandran, Erich Kaltofen: Efficient Parallel Evaluation of Straight-line Code and Arithmetric Circuits. Aegean Workshop on Computing 1986: 236-245 | |
24 | Gary L. Miller: Finding Small Simple Cycle Separators for 2-Connected Planar Graphs. J. Comput. Syst. Sci. 32(3): 265-279 (1986) | |
23 | Eric Bach, Gary L. Miller, Jeffrey Shallit: Sums of Divisors, Perfect Numbers and Factoring. SIAM J. Comput. 15(4): 1143-1154 (1986) | |
1985 | ||
22 | Dennis Estes, Leonard M. Adleman, Kireeti Kompella, Kevin S. McCurley, Gary L. Miller: Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number Fields. CRYPTO 1985: 3-13 | |
21 | Gary L. Miller, John H. Reif: Parallel Tree Contraction and Its Application FOCS 1985: 478-489 | |
20 | Susan Landau, Gary L. Miller: Solvability by Radicals is in Polynomial Time. J. Comput. Syst. Sci. 30(2): 179-208 (1985) | |
1984 | ||
19 | Daniel Kornhauser, Gary L. Miller, Paul G. Spirakis: Coordinating Pebble Motion on Graphs, the Diameter of Permutation Groups, and Applications FOCS 1984: 241-250 | |
18 | Ravindran Kannan, Gary L. Miller, Larry Rudolph: Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers FOCS 1984: 7-11 | |
17 | Eric Bach, Gary L. Miller, Jeffrey Shallit: Sums of Divisors, Perfect Numbers, and Factoring (Extended Abstract) STOC 1984: 183-190 | |
16 | Gary L. Miller: Finding Small Simple Cycle Separators for 2-Connected Planar Graphs STOC 1984: 376-382 | |
1983 | ||
15 | Gary L. Miller: Isomorphism Testing and Canonical Forms for k-Contractable Graphs (A Generalization of Bounded Valence and Bounded Genus). FCT 1983: 310-327 | |
14 | Susan Landau, Gary L. Miller: Solvability by Radicals is in Polynomial Time STOC 1983: 140-151 | |
13 | Gary L. Miller: Isomorphism of k-Contractible Graphs. A Generalization of Bounded Valence and Bounded Genus Information and Control 56(1/2): 1-20 (1983) | |
12 | Gary L. Miller: Isomorphism of Graphs Which are Pairwise k-separable Information and Control 56(1/2): 21-33 (1983) | |
11 | Daniel J. Kleitman, Frank Thomson Leighton, Margaret Lepley, Gary L. Miller: An Asymptotically Optimal Layout for the Shuffle-Exchange Graph. J. Comput. Syst. Sci. 26(3): 339-361 (1983) | |
1981 | ||
10 | Daniel J. Kleitman, Frank Thomson Leighton, Margaret Lepley, Gary L. Miller: New Layouts for the Shuffle-Exchange Graph (Extended Abstract) STOC 1981: 278-292 | |
1980 | ||
9 | Gary L. Miller: Isomorphism Testing for Graphs of Bounded Genus STOC 1980: 225-235 | |
8 | Dragomir Z. Djokovic, Gary L. Miller: Regular groups of automorphisms of cubic graphs. J. Comb. Theory, Ser. B 29(2): 195-230 (1980) | |
1979 | ||
7 | I. S. Filotti, Gary L. Miller, John H. Reif: On Determining the Genus of a Graph in O(v^O(g)) Steps STOC 1979: 27-37 | |
6 | Gary L. Miller: Graph Isomorphism, General Remarks. J. Comput. Syst. Sci. 18(2): 128-142 (1979) | |
1978 | ||
5 | Gary L. Miller: On the n^log n Isomorphism Technique: A Preliminary Report STOC 1978: 51-58 | |
1977 | ||
4 | Leonard M. Adleman, Kenneth L. Manders, Gary L. Miller: On Taking Roots in Finite Fields FOCS 1977: 175-178 | |
3 | Gary L. Miller: Graph Isomorphism, General Remarks STOC 1977: 143-150 | |
1976 | ||
2 | Gary L. Miller: Riemann's Hypothesis and Tests for Primality. J. Comput. Syst. Sci. 13(3): 300-317 (1976) | |
1975 | ||
1 | Gary L. Miller: Riemann's Hypothesis and Tests for Primality STOC 1975: 234-239 |