The following pages link to Gary Lee Miller (Q1071802):
Displayed 50 items.
- (Q471139) (redirect page) (← links)
- A new approach to output-sensitive construction of Voronoi diagrams and Delaunay triangulations (Q471140) (← links)
- Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs (Q487267) (← links)
- Deterministic parallel list ranking (Q808699) (← links)
- A simple randomized parallel algorithm for list-ranking (Q911268) (← links)
- Subtree isomorphism is in random NC (Q922707) (← links)
- Approximate centerpoints with proofs (Q991175) (← links)
- Solvability by radicals is in polynomial time (Q1071803) (← links)
- Finding small simple cycle separators for 2-connected planar graphs (Q1085169) (← links)
- An additivity theorem for the genus of a graph (Q1088997) (← links)
- An improved parallel algorithm that computes the BFS numbering of a directed graph (Q1111392) (← links)
- Design and implementation of a practical parallel Delaunay algorithm (Q1125808) (← links)
- A new graph triconnectivity algorithm and its parallelization (Q1193533) (← links)
- Riemann's hypothesis and tests for primality (Q1235011) (← links)
- Regular groups of automorphisms of cubic graphs (Q1249191) (← links)
- Graph isomorphism, general remarks (Q1255944) (← links)
- Moments of inertia and graph separators (Q1383809) (← links)
- Tree-based parallel algorithm design (Q1386764) (← links)
- An asymptotically optimal layout for the shuffle-exchange graph (Q1838315) (← links)
- A generalized Cheeger inequality (Q2693705) (← links)
- Persistent triangulations (Q2757100) (← links)
- Triangle Sparsifiers (Q2865055) (← links)
- (Q2934693) (← links)
- Runtime guarantees for regression problems (Q2986877) (← links)
- (Q3128906) (← links)
- (Q3138969) (← links)
- Smoothing and cleaning up slivers (Q3191993) (← links)
- Isomorphism of k-contractible graphs. A generalization of bounded valence and bounded genus (Q3329513) (← links)
- Layouts for the Shuffle-Exchange Graph Based on the Complex Plane Diagram (Q3332261) (← links)
- Isomorphism of graphs which are pairwise k-separable (Q3337512) (← links)
- Approximating Nearest Neighbor Distances (Q3449817) (← links)
- (Q3670594) (← links)
- Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number Fields (Q3716962) (← links)
- (Q3727384) (← links)
- Sums of Divisors, Perfect Numbers and Factoring (Q3744218) (← links)
- (Q3746881) (← links)
- Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits (Q3796739) (← links)
- (Q3798228) (← links)
- (Q3798258) (← links)
- (Q3801574) (← links)
- Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers (Q3803185) (← links)
- (Q3900916) (← links)
- (Q3909080) (← links)
- The Complexity of Coloring Circular Arcs and Chords (Q3964622) (← links)
- Parallel Tree Contraction Part 2: Further Applications (Q3985812) (← links)
- (Q4140386) (← links)
- (Q4149785) (← links)
- Geometric Mesh Partitioning: Implementation and Experiments (Q4210399) (← links)
- (Q4234119) (← links)
- Optimal Coarsening of Unstructured Meshes (Q4240127) (← links)