The following pages link to John R. Gilbert (Q676607):
Displaying 45 items.
- Algorithms for automatic alignment of arrays. (Q676610) (← links)
- Obtaining bounds on the two norm of a matrix from the splitting lemma (Q871150) (← links)
- Parallel symbolic factorization of sparse linear systems (Q923593) (← links)
- Solving path problems on the GPU (Q991105) (← links)
- The analysis of a nested dissection algorithm (Q1103322) (← links)
- A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor (Q1108738) (← links)
- A parallel graph partitioning algorithm for a message-passing multiprocessor (Q1111029) (← links)
- Drawing the planar dual (Q1198002) (← links)
- Errata: Geodetic orientations of complete \(k\)-partite graphs (Q1229227) (← links)
- (Q1329149) (redirect page) (← links)
- Provably good mesh generation (Q1329150) (← links)
- Separators and structure prediction in sparse orthogonal factorization (Q1361831) (← links)
- Geodetic orientations of complete \(k\)-partite graphs (Q1844242) (← links)
- Generating local addresses and communication sets for data-parallel programs (Q1892863) (← links)
- (Q2730089) (← links)
- (Q3108685) (← links)
- (Q3108687) (← links)
- (Q3108697) (← links)
- (Q3108698) (← links)
- (Q3108702) (← links)
- (Q3139384) (← links)
- Parallel Sparse Matrix-Matrix Multiplication and Indexing: Implementation and Experiments (Q3165441) (← links)
- Graph Coloring Using Eigenvalue Decomposition (Q3216692) (← links)
- A separator theorem for graphs of bounded genus (Q3220606) (← links)
- A Separator Theorem for Chordal Graphs (Q3344230) (← links)
- Symbolic and Exact Structure Prediction for Sparse Gaussian Elimination with Partial Pivoting (Q3642846) (← links)
- Predicting fill for sparse orthogonal factorization (Q3774826) (← links)
- Computing a Sparse Basis for the Null Space (Q3774827) (← links)
- Sparse Partial Pivoting in Time Proportional to Arithmetic Operations (Q3804073) (← links)
- (Q3806672) (← links)
- The Pebbling Problem is Complete in Polynomial Space (Q3906416) (← links)
- A Note on the NP-Completeness of Vertex Elimination on Directed Graphs (Q3960119) (← links)
- Sparse Matrices in MATLAB: Design and Implementation (Q3988993) (← links)
- Highly Parallel Sparse Cholesky Factorization (Q4021695) (← links)
- Geometric Mesh Partitioning: Implementation and Experiments (Q4210399) (← links)
- Predicting Structure in Sparse Matrix Computations (Q4287891) (← links)
- (Q4288583) (← links)
- An Efficient Algorithm to Compute Row and Column Counts for Sparse Cholesky Factorization (Q4313366) (← links)
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree (Q4327821) (← links)
- A Note on the Column Elimination Tree (Q4443804) (← links)
- (Q4694712) (← links)
- An Empirical Comparison of Graph Laplacian Solvers (Q5232558) (← links)
- Elimination Structures for Unsymmetric Sparse $LU$ Factors (Q5286278) (← links)
- A column approximate minimum degree ordering algorithm (Q5461205) (← links)
- Algorithm 836 (Q5461206) (← links)
