Size Complexity of Volume Meshes vs. Surface Meshes (2009)
Benoît Hudson, Gary L. Miller, Todd Phillips
Typical volume meshes in three dimensions are designed to conform to an underlying two-dimensional surface mesh, with volume mesh element size growing larger away from the surface. The surface mesh...
Sparse Parallel Delaunay Mesh Refinement ∗ (2009)
Benoît Hudson, Gary L. Miller, Todd Phillips
The authors recently introduced the technique of sparse mesh refinement to produce the first near-optimal sequential time bounds of O(n lg L/s+m) for inputs in any fixed dimension with...
Sparse Parallel Delaunay Mesh Refinement ∗ (2009)
Benoît Hudson, Gary L. Miller, Todd Phillips
The authors recently introduced the technique of sparse mesh refinement to produce the first near-optimal sequential time bounds of O(n lg L/s+m) for inputs in any fixed dimension with...
Gary L. Miller, Todd Phillips, Donald Sheehy
Most modern meshing algorithms produce asymptotically optimal size output. However, the size of the optimal mesh may not be bounded by any function of n. In this paper, we introduce well-paced point...
Gary L. Miller, Todd Phillips, Donald Sheehy
Most modern meshing algorithms produce asymptotically optimal size output. However, the size of the optimal mesh may not be bounded by any function of n. In this paper, we introduce well-paced point...
Ioannis Koutis, Gary L. Miller
We consider the problem of decomposing a weighted graph with n vertices into a collection P of vertex disjoint clusters such that, for all clusters C ∈ P, the graph induced by the vertices in C and...
Corrected Laplacians: Closer Cuts and Segmentation with Shape Priors (2009)
David Tolliver, Gary L. Miller, Robert T. Collins
We optimize over the set of corrected laplacians (CL) associated with a weighted graph to improve the average case normalized cut (NCut) of a graph. Unlike edge-relaxation SDPs, optimizing over the...
Tradeoffs Between Parallelism and Fill in Nested Dissection (2009)
Claudson F. Bornsteinbruce, M. Maggs, Gary L. Miller
1 Introduction Among the most common problems to be solved in both operationsresearch and scientific computing is that of finding a vector
Reshape and Rebuild: a model for constructive change (2009)
Provost Gary L. Miller's report describes a one-year plan of restructuring the University at the time of severe budget cut, which includes: commitment to the ideals of learning and human capical;...
Approximate Triangle Counting (2009)
Tsourakakis, Charalampos E., Kolountzakis, Mihail N., Miller, Gary L.
Triangle counting is an important problem in graph mining. Clustering coefficients of vertices and the transitivity ratio of the graph are two metrics often used in complex network analysis....
Reshaping and rebuilding WSU: Urban legacy -- Liberal Arts challenge (2009)
Provost Gary L. Miller's memorandum to the University Faculty Senate Planning and Budget Committee describes the needs to discuss the role of liberal arts and sciences in the urban serving research...
Reducing, reshaping, and rebuilding: a broader context (2009)
Provost Gary L. Miller Memorandum to Faculty Senate Planning and Budget Committee adressing the University budget reduction and the new reduce-reshape-rebuild initiative.
The Provost's memo to the University faculty and staff, January 22, 2009
Size complexity of volume meshes vs. surface meshes (2009)
Benoît Hudson, Gary L. Miller, Todd Phillips, Don Sheehy
Typical volume meshes in three dimensions are designed to conform to an underlying two-dimensional surface mesh, with volume mesh element size growing larger away from the surface. The surface mesh...
Size complexity of volume meshes vs. surface meshes (2009)
Benoît Hudson, Gary L. Miller, Todd Phillips, Don Sheehy
Typical volume meshes in three dimensions are designed to conform to an underlying two-dimensional surface mesh, with volume mesh element size growing larger away from the surface. The surface mesh...
ABSTRACT FINDING SMALL SIMPLE CYCLE SEPARATORS FOR PLANAR GRAPHS. (2008)
Gary L. Miller, Algorithm Johnson
s i z e a t most
Isomorphism of Graphs. A Generalization of Bounded Valence and Bounded Genus (2008)
A polynomial time isomorphism test for graphs called k-contractible graphs for fixed k is included. The class of k-contractible graphs includes the graphs of bounded valence and the graphs of bounded...
Optimal Tree Contraction in the EREW Model Abstract (2008)
Gary L. Miller, Shang-hua Teng
A deterministic parallel algorithm for parallel tree contraction is presented in this paper. The algorithm takes T time and uses (P processors, where n the number of vertices in a tree using an...
Graph embeddings and Laplacian eigenvalues (2008)
Stephen Guattery, Gary L. Miller, Stephen Guattery, L. Miller
Abstract. Graph embeddings are useful in bounding the smallest nontrivial eigenvalues of Laplacian matrices from below. For an n × n Laplacian, these embedding methods can be characterized as...
Annual NASULGC update: The conversation in American higher education (2008)
The Provost's memo to Academic Affairs faculty and staff, November 24, 2008
Globalization Initiative: next steps (2008)
The Provost's memo to the University faculty and staff, October, 13, 2008
Representing Topological Structures Using Cell-Chains ⋆ (2008)
David E. Cardoze, Gary L. Miller, Todd Phillips
Abstract. A new topological representation of surfaces in higher dimensions, “cell-chains ” is developed. The representation is a generalization of Brisson’s cell-tuple data structure....
Abstract A linear work, O(n 1/6) time, parallel algorithm for solving planar Laplacians ∗ (2008)
Ioannis Koutis, Gary L. Miller
We present a linear work parallel iterative algorithm for solving linear systems involving Laplacians of planar graphs. In particular, if Ax = b, where A is the Laplacian of any planar graph with n...
PARALLEL TREE CONTRACTION' PART I: FUNDAMENTALS (2008)
Gary Miller, John H, Gary L. Miller, John H
This paper introduces parallel tree contraction: a new bottom-up technique for constructing parallel algorithms on trees. Contraction can be used to solve a wide variety of problems. Two examples...
Size Competitive Meshing without Large Angles (2008)
Gary L. Miller, Todd Phillips, Donald Sheehy
Abstract. We present a new meshing algorithm for the plane, Overlay Stitch Meshing (OSM), accepting as input an arbitrary Planar Straight Line Graph and producing a triangulation with all angles...
Abstract A linear work, O(n 1/6) time, parallel algorithm for solving planar Laplacians ∗ (2008)
Ioannis Koutis, Gary L. Miller
We present a linear work parallel iterative algorithm for solving linear systems involving Laplacians of planar graphs. In particular, if Ax = b, where A is the Laplacian of any planar graph with n...
Muhammad Mumtaz Ahmad, Gary L. Miller, Vijaya Ramach, Erich Kaltofen
Most of the fast algorithms now known seem to fall into a few general classes. The most common are ones based on repetition or iteration, classic examples being Euclid's algorithm for GCD,...
Size Competitive Meshing without Large Angles (2008)
Gary L. Miller, Todd Phillips, Donald Sheehy
Abstract. We present a new meshing algorithm for the plane, Overlay Stitch Meshing (OSM), accepting as input an arbitrary Planar Straight Line Graph and producing a triangulation with all angles...
Isomorphism of Graphs Which are k-Separable* (2008)
A polynomial time algorithm for testing isomorphism of graphs which are pairwise k-separable for fixed k is given. The pairwise k-separable graphs are those graphs where each pair of distinct...
Lower Bounds, Graph Embeddings, Combinatorial Preconditioners, Gary L. Miller, Peter C. Richter
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and dilation of an...
Representing Topological Structures Using Cell-Chains ⋆ (2008)
David E. Cardoze, Gary L. Miller, Todd Phillips
Abstract. A new topological representation of surfaces in higher dimensions, “cell-chains ” is developed. The representation is a generalization of Brisson’s cell-tuple data structure....
A PARALLEL DYNAMIC-MESH LAGRANGIAN METHOD FOR SIMULATION OF FLOWS WITH DYNAMIC INTERFACES (2008)
James F. Antakiy, Guy E. Blellochz, Omar Ghattasx, Ivan Malčevićx, Gary L. Miller, ...
modeled as flows with dynamic interfaces. The major challenge faced in simulating such flows is resolving the interfacial motion. Lagrangian methods are ideally suited for such problems, since...
Guy E. Blelloch, Omar Ghattas, Gary L. Miller, Noel J. Walkington, James F. Antaki, Bartley P. Griffith, ...
We propose to develop advanced parallel geometric and numerical algorithms and software for simulating complex flows with dynamic interfaces. The development of scalable, parallel highaccuracy...
A Bezier-Based Moving Mesh Framework For Simulation With Elastic Membranes (2008)
David E. Cardoze, Gary L. Miller, Mark Olah, Todd Phillips
In this paper we present an application of our Bezier-based approach to moving meshes [1] to Navier-Stokes simulations with several immersed elastic membranes. By a moving mesh we mean one that moves...
Substrate-dependent signaling success in the wolf spider, Schizocosa retrorsa (2008)
Hebets, Eileen, Elias, Damian O., Mason, Andrew C., Miller, Gary L., Stratton, Gail E.
Signals used in communication are often hypothesized to be optimally designed for their signaling environment. Here, we explore the importance of signaling substrate on seismic signal efficacy and...
theory, computation and (2008)
Ioannis Koutis, Gary L. Miller
Graph partitioning into isolated, high conductance clusters:
Approximate Center Points with Proofs (2008)
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate center point of a set S ∈ R d with running time sub-exponential in d. The algorithm is a...
Cone Depth and the Center Vertex Theorem (2008)
Gary L. Miller, Todd Phillips, Don Sheehy
We generalize the Tukey depth to use cones instead of halfspaces. We prove a generalization of the center point theorem that for S ⊂ Rd, there is a point s ∈ S, with depth at least n d+1 for...
Fast Sizing Calculations for Meshing (2008)
Gary L. Miller, Todd Phillips, Don Sheehy
Provably correct algorithms for meshing difficult domains in three dimensions have been recently developed in the literature. These algorithms handle the problem of sharp angles (< π/2) between...
Cone Depth and the Center Vertex Theorem (2008)
Gary L. Miller, Todd Phillips, Don Sheehy
We generalize the Tukey depth to use cones instead of halfspaces. We prove a generalization of the Center Point Theorem that for S ⊂ Rd, there is a vertex s ∈ S, with depth at least n d+1 for...
Substrate-dependent signaling success in the wolf spider, Schizocosa retrorsa (2007)
Hebets, Eileen A., Elias, Damian O., Mason, Andrew C., Miller, Gary L., Stratton, Gail E.
Signals used in communication are often hypothesized to be optimally designed for their signalling environment. Here, we explore the importance of signalling substrate on seismic signal efficacy and...
Address to the Faculty at the General Faculty Meeting, December 6, 2007 (2007)
Speech at the General Faculty Meeting, Dec. 6, 2007
A PARALLEL DYNAMIC-MESH LAGRANGIAN METHOD FOR SIMULATION OF FLOWS WITH DYNAMIC INTERFACES (2007)
James F. Antakiy, Guy E. Blellochz, Omar Ghattasx, Ivan Malčevićx, Gary L. Miller, ...
modeled as flows with dynamic interfaces. The major challenge faced in simulating such flows is resolving the interfacial motion. Lagrangian methods are ideally suited for such problems, since...
Graph embeddings and Laplacian eigenvalues (2007)
Gary L. Miller, Stephen Guattery, Stephen Guattery, L. Miller
Abstract. Graph embeddings are useful in bounding the smallest nontrivial eigenvalues of Laplacian matrices from below. For an nn Laplacian, these embedding methods can be characterized as follows:...
David Cardoze, Alexandre Cunha, Gary L. Miller, Todd Phillips, Noel Walkington
and ACI-0086093. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the o#cial policies, either expressed or implied, of the...
c PARALLEL TREE CONTRACTION' PART I: FUNDAMENTALS (2007)
Gary L. Miller, Gary L. Miller, John H. Reif, John H. Reif
This paper introduces parallel tree contraction: a new bottom-up technique for constructing parallel algorithms on trees. Contraction can be used to solve a wide variety of problems. Two examples...
Catalog of the Aphid Genera Described from the New World (2007)
Colin Favret, Gary L. Miller, Francisco Cortés Gabaudan
A nomenclatural and bibliographic catalog of the genus-group names of aphids (Hemiptera: Aphidoidea) from the New World is presented. The catalog includes 206 available genus-group names with type...
The report highlights mission and strategic directions in the development of Wichita State University.
Globalization/Internationalization (2007)
The Provost's memo to Associate Provosts, February 1, 2007
Size Competitive Meshing without Large Angles ∗ (2007)
Gary L. Miller, Todd Phillips, Donald Sheehy
We present a new meshing algorithm for the plane, Overlay Stitch Meshing (OSM), that accepts as input an arbitrary Planar Straight Line Graph and produces a triangulation with all angles smaller than...
SVR: Practical engineering of a fast 3D meshing algorithm (2007)
Umut A. Acar, Benoît Hudson, Gary L. Miller, Todd Phillips
Summary. The recent Sparse Voronoi Refinement (SVR) Algorithm for mesh generation has the fastest theoretical bounds for runtime and memory usage. We present a robust practical software...
Reflections on diversity (2006)
The Provost's memo to the University faculty, December 6, 2006
Global Programs and Initiatives: Presentation to the Kansas Board of Regents (2006)
Wichita State University as urban-serving research university; its mission and vision in local and global environment.
Graph partitioning by spectral rounding: Applications in image segmentation and clustering (2006)
Gary L. Miller, David Tolliver
We introduce a new family of spectral partitioning methods. Edge separators of a graph are produced by iteratively reweighting the edges until the graph disconnects into the prescribed number of...
Sparse Parallel Delaunay Mesh Refinement ∗ (2006)
Benoît Hudson, Gary L. Miller, Todd Phillips
The authors recently introduced the technique of sparse mesh refinement to produce the first nearoptimal sequential time bounds of O(n lg L/s+m) for inputs in any fixed dimension with piecewiselinear...
Finding effective support-tree preconditioners (2005)
Bruce M. Maggs, Gary L. Miller, Ojas Parekh, R. Ravi, Shan Leung, Maverick Woo
In 1995, Gremban, Miller, and Zagha introduced support-tree preconditioners and a parallel algorithm called support-tree conjugate gradient (STCG) for solving linear systems of the form Ax = b, where...
Measuring an IP network in situ (2005)
Hal Burch, Gary L. Miller, Srinivasan Seshan, Steven Bellovin
The Internet, and IP networking in general, have become vital to the scientific community and the global economy. This growth has increased the importance of measuring and monitoring the Internet to...
Gary L. Miller, John D. Oswald, Douglass R. Miller
Information on 263 Neuropterida/Coccoidea associations with additional detailed data on the most commonly encountered taxa is presented. Included for each entry, where applicable, is the predator,...
A Bezier-Based Approach to Unstructured Moving Meshes (2004)
David Cardoze, Alexandre Cunha, Gary L. Miller, Todd Phillips, Noel Walkington
CCR-9706572, and ACI-0086093. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or...
Layouts for the Shuffle-Exchange Graph Based on the Complex Plane Diagram. (2002)
Leighton,Frank Thomson, Lepley,Margaret, Miller,Gary L.
The shuffle-exchange graph is one of the best structures known for parallel computation. Among other things, a shuffle-exchange computer can be used to compute discrete Fourier transforms, multiply...
Parallel Tree Contraction and Its Application. (2002)
Trees play a fundamental role in many computations, both for sequential as well as parallel problems. The classic paradigm applied to generate parallel algorithms in the presence of trees has been...
Solving symmetric diagonally-dominant systems by preconditioning. Unpublished manuscript (2002)
Bruce M. Maggs, Gary L. Miller, Ojas Parekh, R. Ravi, Shan Leung, Maverick Woo
In this paper we design support-tree preconditioners for n × n matrices with m nonzeros that are symmetric and diagonally-dominant with a nonnegative diagonal (SDD matrix). This reduces to designing...
Solving Symmetric Diagonally-Dominant Systems by Preconditioning (2002)
Bruce M. Maggs, Gary L. Miller, Ojas Parekh, R. Ravi, Shan Leung
In this paper we show how to find a support-tree preconditioner for any Laplacian matrix A, i.e., any matrix that can be viewed as the weighted adjacency matrix of an undirected graph G with...
Ricklefs, Robert E., Miller, Gary L. (Gary Leon)
Contenido: Introducción; Organismos en el ambiente físico; Energía y materiales en un ecosistema; Población ecológica; Interacciones entre la población; Ecología comunitaria; Evolución...
A Parallel Dynamic-Mesh Lagrangian Method For Simulation Of Flows With Dynamic Interfaces (2000)
James F. Antaki, Guy E. Blelloch, Omar Ghattas, Ivan Malcevic, Gary L. Miller, ...
. Many important phenomena in science and engineering, including our motivating problem of microstructural blood flow, can be modeled as flows with dynamic interfaces. The major challenge faced in...
Tradeoffs Between Parallelism and Fill in Nested Dissection (1999)
Claudson F. Bornstein, Bruce M. Maggs, Gary L. Miller
In this paper we demonstrate that tradeoffs can be made between parallelism and fill in nested dissection algorithms for Gaussian elimination, both in theory and in practice. We present a new...
Performance Evaluation of a New Parallel Preconditioner. (1998)
Gremban, Keith D., Miller, Gary L., Zagha, Marco
Solution of partial differential equations by either the finite element or the finite difference methods often requires the solution of large, sparse linear systems. When the coefficient matrices...
On the Performance of Spectral Graph Partitioning Methods. (1998)
Guattery, Stephen, Miller, Gary L.
Computing graph separators is an important step in many graph algorithms. A popular technique for finding separators involves spectral methods. However, there is not much theoretical analysis of the...
Early Life History of Northern Pike in Artificial Wetlands of Conesus Lake, New York. (1998)
Morrow, James V., Killgore, K. J., Miller, Gary L.
Reproductive success of northern pike was evaluated for artificial and natural wetlands adjacent to Conesus Lake, New York. Fishes were collected for 3 consecutive years during the spawning/rearing...
Efficient Parallel Algorithms for Planar DAGs, (1998)
Guattery, Stephen, Miller, Gary L.
We show that testing reachability in a planar DAG can be performed in parallel in O(log n log* n) time (0 (log n) time using randomization) using 0(n) processors. In general we give a paradigm for...
Larval Fish Dynamics in Oxbow Lakes with Varying Connections to a Temperate River. (1998)
Killgore, K. J., Miller, Gary L.
Bottomland hardwood wetlands occur on alluvial fioodplains of many river systems in the lower Mississippi River basin. These forested wetlands are inundated in winter and spring, they are highly...
The Path Resistance Method for Bounding the Smallest Nontrivial Eigenvalue of a Laplacian (1998)
Guattery, Stephen, Leighton, Tom, Miller, Gary L.
We introduce the path resistance method for lower bounds on the smallest nontrivial eigenvalue of the Laplacian matrix of a graph. The method is based on viewing the graph in terms of electrical...
Graph Embeddings and Laplacian Eigenvalues (1998)
Guattery, Stephen, Miller, Gary L.
Graph embeddings are useful in bounding the smallest nontrivial eigenvalues of Laplacian matrices from below. For an n X n Laplacian, these embedding methods can be characterized as follows: The...
Miller, Gary L., Stratton, Gary L., Miller, Patricia R., Hebets, Eileen
We surveyed 12 populations of the wolf spider Schizocosa crassipes (Walckenaer) and S. nr. crassipes in Tennessee, Mississippi, Louisiana, and Florida, in the United States, to determine the extent...
On The Quality Of Spectral Separators (1998)
Stephen Guattery, Gary L. Miller, L. Miller
.<F3.813e+05> Computing graph separators is an important step in many graph algorithms. A popular technique for finding separators involves spectral methods. However, there has not been much...
Parallelizing and De-parallelizing Elimination Orders (1998)
Claudson Ferreira Bornstein, Bruce M. Maggs, Gary L. Miller, R. Ravi
interval graphs, graph theory The order in which the variables of a linear system are processed determines the total amounts of fill and work to perform LU decomposition on the system. We identify a...
Parallelizing and De-parallelizing Elimination Orders (1998)
Claudson Ferreira Bornstein, Bruce M. Maggs, Gary L. Miller, R. Ravi, John Gilbert, Xerox Parc
interval graphs, graph theory The order in which the variables of a linear system are processed determines the total amounts of fill and work to perform LU decomposition on the system. We identify a...
The Path Resistance Method for bounding # 2 of a Laplacian (1997)
Stephen Guattery, Tom Leighton, Gary L. Miller
We introduce the path resistance method for lower bounds on the smallest nontrivial eigenvalue of the Laplacian matrix of a graph. The method is based on viewing the graph in terms of electrical...
Optimal Coarsening of Unstructured Meshes (1997)
Gary L. Miller, Dafna Talmor, Shang-Hua Teng
A bounded aspect-ratio coarsening sequence of an unstructured mesh M 0 is a sequence of meshes M 1 ; : : : ; M k such that: ffl M i is a bounded aspect-ratio mesh, and ffl M i is an approximation of...
Optimal Good-Aspect-Ratio Coarsening for Unstructured Meshes (1997)
Gary L. Miller, Dafna Talmor, Shang-Hua Teng
A hierarchical gradient of an unstructured mesh M 0 is a sequence of meshes M 1 ; . . . ; M k such that jM k j is smaller than a given threshold mesh size b. The gradient is well-conditioned if for...
The Path Resistance Method for Bounding the Smallest Nontrivial Eigenvalue of a Laplacian (1997)
Stephen Guattery (icase, Stephen Guattery, Gary L. Miller, Tom Leighton, L. Miller
. We introduce the path resistance method for lower bounds on the smallest nontrivial eigenvalue of the Laplacian matrix of a graph. The method is based on viewing the graph in terms of electrical...
Separators for sphere-packings and nearest neighbor graphs (1997)
Gary L. Miller, Shang-hua Teng, William Thurston, Stephen A. Vavasis
Abstract. A collection of n balls in d dimensions forms a k-ply system if no point in the space is covered by more than k balls. We show that for every k-ply system �, there is a sphere S that...
Hebets, Eileen A., Stratton, Gail E., Miller, Gary L.
The habitat and courtship behavior of the wolf spider Schizocosa retrorsa (Banks 1911) were studied and are described here for the first time. The range of S. retrorsa was extended to include the...
PATTERN AND DURATION OF COPULATION IN WOLF SPIDERS (ARANEAE, LYCOSIDAE) (1996)
Stratton, Gail E., Hebets, Eileen, Miller, Patricia R., Miller, Gary L.
The temporal patterns of insertion of male palps, expansion of the hematodocha and duration of copulation are reported for 10 species of Schizocosa Chamberlin 1904, three species of Rabidosa Roewer...
Developing a practical projection-based parallel delaunay algorithm (1996)
Guy E. Blelloch, Gary L. Miller, Dafna Talmor
In this paper we are concerned with developing a practical parallel algorithm for Delaunay triangulation that works well on general distributions, particularly those that arise in Scientific...
Automated Parallel Solution of Unstructured PDE Problems (1996)
Anja Feldmann, Omar Ghattas, John R. Gilbert, Gary L. Miller, David R. O'hallaron, Eric J. Schwabe, ...
This article describes Archimedes, an automated system for solving partial differential equations on geometrically complex domains using distributed memory supercomputers. The tasks of such a system...
Automated Parallel Solution of Unstructured PDE Problems (1996)
Anja Feldmann, Omar Ghattas, John R. Gilbert, Gary L. Miller, David R. O'Hallaron, Eric J. Schwabe, ...
This article describes Archimedes, an automated system for solving partial differential equations on geometrically complex domains using distributed memory supercomputers. The tasks of such a system...
Control Volume Meshes using Sphere Packing: Generation, Refinement and Coarsening (1996)
Gary L. Miller, Dafna Talmor, Shang-Hua Teng, Noel Walkington, Han Wang
. In this paper we present a sphere-packing technique for Delaunay-based mesh generation, refinement and coarsening. We have previously established [10] that a bounded radius of ratio of...
Efficient Parallel Algorithms for Planar DAGs (1995)
Stephen Guattery, Gary L. Miller
Agency (ARPA) under contract number F19628-93-C-0193. The views and conclusions contained in this document are those of the authors and should not be interpreted as necessarily representing the...
Performance Evaluation of a New Parallel Preconditioner (1995)
Keith D. Gremban, Gary L. Miller, Marco Zagha
The linear systems associated with large, sparse, symmetric, positive definite matrices are often solved iteratively using the preconditioned conjugate gradient method. We have developed a new class...
Performance Evaluation of a New Parallel Preconditioner (1995)
Keith D. Gremban, Gary L. Miller, Marco Zagha
purposes, notwithstanding any copyright notation thereon. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official...
Geometric mesh partitioning: Implementation and experiments (1995)
John R. Gilbert, Gary L. Miller, Shang-hua Teng
We investigate a method of dividing an irregular mesh into equal-sized pieces with few interconnecting edges. The method's novel feature is that it exploits the geometric coordinates of the mesh...
Gary L. Miller, Dafna Talmor, Shang-Hua Teng, Noel Walkington
We present new geometrical and numerical analysis structure theorems for the Delaunay diagram of point sets in IR d for a fixed d where the point sets arise naturally in numerical methods. In...
On the Performance of Spectral Graph Partitioning Methods (1995)
Stephen Guattery Gary, Gary L. Miller
Computing graph separators is an important step in many graph algorithms. A popular technique for finding separators involves spectral methods. However, there is not much theoretical analysis of the...
On the Performance of Spectral Graph Partitioning Methods (1995)
Stephen Guattery, Gary L. Miller
Computing graph separators is an important step in many graph algorithms. A popular technique for computing graph separators involves spectral methods. However, there is not much theoretical analysis...
Efficient Parallel Algorithms for Planar DAGs (1995)
Stephen Guattery, Gary L. Miller
We show that testing reachability in a planar DAG can be performed in parallel in O(log n log time (O(log n) time using randomization) using O(n) processors. In general we give a paradigm for...
On the Performance of Spectral Graph Partitioning Methods (1995)
Stephen Guattery Gary, Gary L. Miller
Computing graph separators is an important step in many graph algorithms. A popular technique for finding separators involves spectral methods. However, there is not much theoretical analysis of the...
Performance Evaluation of a New Parallel Preconditioner (1995)
Keith D. Gremban, Gary L. Miller, Marco Zagha
Solution of partial differential equations by either the finite element or the finite difference methods often requires the solution of large, sparse linear systems. When the coefficient matrices...
Efficient Parallel Algorithms for Planar DAGs (1995)
Stephen Guattery, Gary L. Miller
Agency (ARPA) under contract number F19628-93-C-0193. The views and conclusions contained in this document are those of the authors and should not be interpreted as necessarily representing the...
Moments of Inertia and Graph Separators (1994)
Keith D. Gremban, Gary L. Miller, Shang-Hua Teng
Graphs that arise from the nite element or nite dierence methods often include geometric information such as the coordinates of the nodes of the graph. The geometric separator algorithm of Miller,...
New Parallel Preconditioner (1994)
Keith D. Gremban, Marco Zagha, Gary L. Miller
Solution of partial differential equations by either the finite element or the finite difference methods often requires the solution of large, sparse linear systems. When the coefficient matrices...
The Hidden Cost of Low Bandwidth Communication (1994)
Guy E. Blelloch, Bruce M. Maggs, Gary L. Miller
peak and achievable performance. One of the conclusions that can be drawn from these benchmarks is that machines with high communication bandwidth perform well across the board, whereas peak...
On the Performance of Spectral Graph Partitioning Methods (1994)
Stephen Guattery, Gary L. Miller
Computing graph separators is an important step in many graph algorithms. A popular technique for finding separators involves spectral methods. However, there is not much theoretical analysis of the...
Performance Evaluation of a New Parallel Preconditioner (1994)
Keith D. Gremban, Marco Zagha, Gary L. Miller
Solution of partial differential equations by either the finite element or the finite difference methods often requires the solution of large, sparse linear systems. When the coefficient matrices...
Nested dissection: A survey and comparison of various nested dissection algorithms (1992)
Manpreet S. Khaira, Gary L. Miller, Thomas J. Sheffler
Methods for solving sparse linear systems of equations can be categorized under two broad classes- direct and iterative. Direct methods are methods based on gaussian elimination. This report...
Nested Dissection: A survey and comparison of various nested dissection algorithms (1992)
Manpreet S. Khaira, Gary L. Miller, Thomas J. Sheffler
Methods for solving sparse linear systems of equations can be categorized under two broad classes - direct and iterative. Direct methods are methods based on gaussian elimination. This report...
A Contraction Procedure for Planar Directed Graphs (1992)
Stephen Guattery, Gary L. Miller
We show that testing reachability in a planar DAG can be performed in parallel in O(log n log n) time (O(log n) time using randomization) using O(n) processors. In general we give a paradigm for...
Nested Dissection: A survey and comparison of various (1992)
Nested Dissection Algorithms, Manpreet S. Khaira, Gary L. Miller, Thomas J. Sheffler
and iterative. Direct methods are methods based on gaussian elimination. This report discusses one such direct method namely Nested dissection. Nested Dissection, originally proposed by Alan George,...
Society for Industrial and Applied Mathematics (1991)
Parallel Tree Contraction, Gary L. Miller, H. Reif
This paper applies the parallel tree contraction techniques developed in Miller and paper [Randomness and Computation, 5, S. Micali, ed., JAI Press, 1989, pp. 47-72] to a number of fundamental graph...
Density Graphs and Separators (1990)
Miller, Gary L., Vavasis, Stephen A.
We propose a class of graphs that would occur naturally in finite-element problems, and we prove a bound on separators for this class of graphs. For three-dimensional graphs, our separator bound is...
Density Graphs and Separators (1990)
Miller, Gary L., Vavasis, Stephen A.
We propose a class of graphs that would occur naturally in finite-element problems, and we prove a bound on separators for this class of graphs. For three-dimensional graphs, our separator bound is...
ANew Graph Triconnectivity Algorithm and Its Parallelization* (1990)
Gary L. Miller, Vijaya Ramachandran
We present a new algorithm for finding the triconnected components of an undirected graph. The algorithm is based on a method of searching graphs called ‘open ear decomposition’. A parallel...
Thesis (Ed. Spec.)--University of Wisconsin--Stout, 1989.
Efficient parallel evaluation of straight-line code and arithmetic circuits (1988)
Gary L. Miller, Vijaya Ramachandran, Erich Kaltofen
A new parallel algorithm is given to evaluate a straight line program. The algorithm evaluates a program over a commutative semi-ring R of degree d and size n in time O(log n(log nd)) using M(n)...
Optical Communication for Pointer Based Algorithms (1988)
Richard Anderson, Gary L. Miller
) Abstract In this paper we study the Local Memory P-RAM. This model allows unit cost communication but assumes that the shared memory is divided into modules. This model is motivated by a...
Efficient parallel evaluation of straight-line code and arithmetic circuits (1988)
Gary L. Miller, Erich Kaltofen
Abstract. A new parallel algorithm is given to evaluate a straight-line program. The algorithm evaluates a program over a commutative semi-ring R of degree d and size n in time O((Iog n)(log nd))...
A new graph triconnectivity algorithm and its parallelization (1987)
Gary L. Miller, Vijaya Ramachandran
We present a new algorithm for finding the triconnected components of an undirected graph. The algorithm is based on a method of searching graphs called ‘open ear decomposition’. A parallel...
Vita.
Thesis (Ph. D.)--University of Pittsburgh, 1978.
Riemann's hypothesis and tests for primality / (1975)
Thesis (Ph. D. in Mathematics)--University of California, Berkeley, Dec 1975.
In this paper we present two algorithms for testing primality of integer. The first algorithm in steps; while, the second runs in n) step but assumes the Extended Riemann Hypothesis. We also show...