The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Gary L. Miller: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  91. Linear-Size Meshes. [Citation Graph (, )][DBLP]


  92. The Centervertex Theorem for Wedge Depth. [Citation Graph (, )][DBLP]


  93. Approximate center points with proofs. [Citation Graph (, )][DBLP]


  94. Topological inference via meshing. [Citation Graph (, )][DBLP]


  95. Sparse Voronoi Refinement. [Citation Graph (, )][DBLP]


  96. SVR: Practical Engineering of a Fast 3D Meshing Algorithm*. [Citation Graph (, )][DBLP]


  97. Combinatorial Preconditioners and Multilevel Solvers for Problems in Computer Vision and Image Processing. [Citation Graph (, )][DBLP]


  98. DOULION: counting triangles in massive graphs with a coin. [Citation Graph (, )][DBLP]


  99. Size complexity of volume meshes vs. surface meshes. [Citation Graph (, )][DBLP]


  100. Graph partitioning into isolated, high conductance clusters: theory, computation and applications to preconditioning. [Citation Graph (, )][DBLP]


  101. Approximate centerpoints with proofs. [Citation Graph (, )][DBLP]


  102. Approximate Triangle Counting [Citation Graph (, )][DBLP]


  103. Approaching optimality for solving SDD systems [Citation Graph (, )][DBLP]


  104. Approximate Dynamic Programming for Fast Denoising of aCGH Data [Citation Graph (, )][DBLP]


  105. Subtree isomorphism is in random NC. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.009secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002