The Pebbling Problem is Complete in Polynomial Space. - John R. Gilbert; Thomas Lengauer; Robert Endre Tarjan (SIAM J. Comput., 1980)

A Note on the NP-Completeness of Vertex Elimination on Directed Graphs. - John R. Gilbert (SIAM J. Algebraic Discret. Methods, 1980)

A Separator Theorem for Graphs of Bounded Genus. - John R. Gilbert; Joan P. Hutchinson; Robert Endre Tarjan (J. Algorithms, 1984)

Predicting fill for sparse orthogonal factorization. - Thomas F. Coleman; Anders Edenbrandt; John R. Gilbert (J. ACM, 1986)

A parallel graph partitioning algorithm for a message-passing multiprocessor. - John R. Gilbert; Earl Zmijewski (Int. J. Parallel Program., 1987)

Parallel Solution of Space Linear Systems. - John R. Gilbert; Hjálmtyr Hafsteinsson (SWAT, 1988)

Some Nested Dissection Order is Nearly Optimal. - John R. Gilbert (Inf. Process. Lett., 1988)

A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor. - Earl Zmijewski; John R. Gilbert (Parallel Comput., 1988)

Parallel symbolic factorization of sparse linear systems. - John R. Gilbert; Hjálmtyr Hafsteinsson (Parallel Comput., 1990)

Optimal Data Placement for Distributed Memory Architectures. - John R. Gilbert; Robert Schreiber (PP, 1991)

Approximating Treewidth, Pathwidth, and Minimum Elimination Tree Height. - Hans L. Bodlaender; John R. Gilbert; Ton Kloks; Hjálmtyr Hafsteinsson (WG, 1991)

Optimal Expression Evaluation for Data Parallel Architectures. - John R. Gilbert; Robert Schreiber (J. Parallel Distributed Comput., 1991)

Optimal Evaluation of Array Expressions on Massively Parallel Machines (Extended Abstract). - Siddhartha Chatterjee; John R. Gilbert; Robert Schneider; Shang-Hua Teng (SIGPLAN Workshop, 1992)

Drawing the Planar Dual. - Marshall W. Bern; John R. Gilbert (Inf. Process. Lett., 1992)

Sparse Matrices in MATLAB: Design and Implementation. - John R. Gilbert; Cleve Moler; Robert Schreiber (SIAM J. Matrix Anal. Appl., 1992)

Highly Parallel Sparse Cholesky Factorization. - John R. Gilbert; Robert Schreiber (SIAM J. Sci. Comput., 1992)

The Alignment-Distribution Graph. - Siddhartha Chatterjee; John R. Gilbert; Robert Schreiber (LCPC, 1993)

Automatic Array Alignment in Data-Parallel Programs. - Siddhartha Chatterjee; John R. Gilbert; Robert Schreiber; Shang-Hua Teng (POPL, 1993)

Mobile and replicated alignment of arrays in data-parallel programs. - Siddhartha Chatterjee; John R. Gilbert; Robert Schreiber (SC, 1993)

Elimination Structures for Unsymmetric Sparse $LU$ Factors. - John R. Gilbert; Joseph W. H. Liu (SIAM J. Matrix Anal. Appl., 1993)

Array Distribution in Data-Parallel Programs. - Siddhartha Chatterjee; Robert Schreiber; Thomas J. Sheffler; John R. Gilbert (LCPC, 1994)

Provably Good Mesh Generation. - Marshall W. Bern; David Eppstein; John R. Gilbert (J. Comput. Syst. Sci., 1994)

Predicting Structure in Sparse Matrix Computations. - John R. Gilbert (SIAM J. Matrix Anal. Appl., 1994)

An Efficient Algorithm to Compute Row and Column Counts for Sparse Cholesky Factorization. - John R. Gilbert; Esmond G. Ng; Barry W. Peyton (SIAM J. Matrix Anal. Appl., 1994)

Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree. - Hans L. Bodlaender; John R. Gilbert; Hjálmtyr Hafsteinsson; Ton Kloks (J. Algorithms, 1995)

Generating Local Address and Communication Sets for Data-Parallel Programs. - Siddhartha Chatterjee; John R. Gilbert; Fred J. E. Long; Robert Schreiber; Shang-Hua Teng (J. Parallel Distributed Comput., 1995)

Optimal Evaluation of Array Expressions on Massively Parallel Machines. - Siddhartha Chatterjee; John R. Gilbert; Robert Schreiber; Shang-Hua Teng (ACM Trans. Program. Lang. Syst., 1995)

Efficient Distribution Analysis via Graph Contraction. - Thomas J. Sheffler; Robert Schreiber; William W. Pugh; John R. Gilbert; Siddhartha Chatterjee (Int. J. Parallel Program., 1996)

Algorithms for Automatic Alignment of Arrays. - Siddhartha Chatterjee; John R. Gilbert; Leonid Oliker; Robert Schreiber; Thomas J. Sheffler (J. Parallel Distributed Comput., 1996)

Aspect-Oriented Programming of Sparse Matrix Code. - John Irwin; Jean-Marc Loingtier; John R. Gilbert; Gregor Kiczales; John Lamping; Anurag Mendhekar; Tatiana Shpeisman (ISCOPE, 1997)

Combinatorial Preconditioning for Sparse Linear Systems. - John R. Gilbert (IRREGULAR, 1998)

Integrating CAD Tools for MEMS Design. - John R. Gilbert (Computer, 1998)

Geometric Mesh Partitioning: Implementation and Experiments. - John R. Gilbert; Gary L. Miller; Shang-Hua Teng (SIAM J. Sci. Comput., 1998)

MEMS CAD Beyond Multi-Million Transistors (Panel). - Kristofer S. J. Pister; Albert P. Pisano; Nicholas Swart; Mike Horton; John Rychcik; John R. Gilbert; Gerry K. Fedder (DAC, 1999)

A Methodology and Associated CAD Tools for Support of Concurrent Design of MEMS. - Bartlomiej F. Romanowicz; M. Hasan Zaman; S. F. Bart; V. L. Rabinovich; I. Tchertkov; C. Hsu; John R. Gilbert (VLSI, 1999)

Toward an Efficient Column Minimum Degree Code for Symmetric Multiprocessors. - Tzu-Yi Chen; John R. Gilbert; Sivan Toledo (PP, 1999)

High-Performance Out-of-Core Sparse LU Factorization. - John R. Gilbert; Sivan Toledo (PP, 1999)

Separators in Graphs with Negative and Multiple Vertex Weights. - Hristo N. Djidjev; John R. Gilbert (Algorithmica, 1999)

A Supernodal Approach to Sparse Partial Pivoting. - James Weldon Demmel; Stanley C. Eisenstat; John R. Gilbert; Xiaoye S. Li; Joseph W. H. Liu (SIAM J. Matrix Anal. Appl., 1999)

An Asynchronous Parallel Supernodal Algorithm for Sparse Gaussian Elimination. - James Weldon Demmel; John R. Gilbert; Xiaoye S. Li (SIAM J. Matrix Anal. Appl., 1999)

An Assessment of Incomplete-LU Preconditioners for Nonsymmetric Linear Systems. - John R. Gilbert; Sivan Toledo (Informatica (Slovenia), 2000)

A Note on the Column Elimination Tree. - John R. Gilbert; Laura Grigori (SIAM J. Matrix Anal. Appl., 2003)

Sparse Matrices in Matlab*P: Design and Implementation. - Viral B. Shah; John R. Gilbert (HiPC, 2004)

A column approximate minimum degree ordering algorithm. - Timothy A. Davis 001; John R. Gilbert; Stefan I. Larimore; Esmond G. Ng (ACM Trans. Math. Softw., 2004)

Algorithm 836: COLAMD, a column approximate minimum degree ordering algorithm. - Timothy A. Davis 001; John R. Gilbert; Stefan I. Larimore; Esmond G. Ng (ACM Trans. Math. Softw., 2004)

High-Performance Graph Algorithms from Parallel Sparse Matrices. - John R. Gilbert; Steven P. Reinhardt; Viral B. Shah (PARA, 2006)

A comparative analysis of the information content in long and short SAGE libraries. - Yi-Ju Li; Puting Xu; Xuejun Qin; Donald E. Schmechel; Christine M. Hulette; Jonathan L. Haines; Margaret A. Pericak-Vance; John R. Gilbert (BMC Bioinform., 2006)

Support-Graph Preconditioners. - Marshall W. Bern; John R. Gilbert; Bruce Hendrickson; Nhat Nguyen; Sivan Toledo (SIAM J. Matrix Anal. Appl., 2006)

An Interactive Environment to Manipulate Large Graphs. - John R. Gilbert; Viral B. Shah; Steven P. Reinhardt (ICASSP (4), 2007)

Parallel Modeling of Fish Interaction. - Lamia Youseff; Alethea B. T. Barbaro; Peterson F. Trethewey; Björn Birnir; John R. Gilbert (CSE, 2008)

Challenges and Advances in Parallel Sparse Matrix-Matrix Multiplication. - Aydin Buluç; John R. Gilbert (ICPP, 2008)

On the representation and multiplication of hypersparse matrices. - Aydin Buluç; John R. Gilbert (IPDPS, 2008)

An empirical study of the performance and productivity of two parallel programming models. - Imran Patel; John R. Gilbert (IPDPS, 2008)

Distributed Sparse Matrices for Very High Level Languages. - John R. Gilbert; Steven P. Reinhardt; Viral B. Shah (Adv. Comput., 2008)

A Unified Framework for Numerical and Combinatorial Computing. - John R. Gilbert; Steven P. Reinhardt; Viral B. Shah (Comput. Sci. Eng., 2008)

A pilot study to compare programming effort for two parallel programming models. - Lorin Hochstein; Victor R. Basili; Uzi Vishkin; John Gilbert 001 (J. Syst. Softw., 2008)

Symbolic and Exact Structure Prediction for Sparse Gaussian Elimination with Partial Pivoting. - Laura Grigori; John R. Gilbert; Michel Cosnard (SIAM J. Matrix Anal. Appl., 2008)

Parallel sparse matrix-vector and matrix-transpose-vector multiplication using compressed sparse blocks. - Aydin Buluç; Jeremy T. Fineman; Matteo Frigo; John R. Gilbert; Charles E. Leiserson (SPAA, 2009)

Linear Representation of Network Traffic. - Stefan Karpinski; Elizabeth M. Belding; Kevin C. Almeroth; John R. Gilbert (Mob. Networks Appl., 2009)

Highly Parallel Sparse Matrix-Matrix Multiplication - Aydin Buluç; John R. Gilbert (CoRR, 2010)

Solving path problems on the GPU. - Aydin Buluç; John R. Gilbert; Ceren Budak (Parallel Comput., 2010)

New Ideas in Sparse Matrix Matrix Multiplication. - Aydin Buluç; John R. Gilbert (Graph Algorithms in the Language of Linear Algebra, 2011)

Implementing Sparse Matrices for Graph Algorithms. - Aydin Buluç; John R. Gilbert; Viral B. Shah (Graph Algorithms in the Language of Linear Algebra, 2011)

Fundamental Questions in the Analysis of Large Graphs. - Jeremy Kepner; David A. Bader; Robert Bond; Nadya T. Bliss; Christos Faloutsos; Bruce Hendrickson; John R. Gilbert; Eric Robinson (Graph Algorithms in the Language of Linear Algebra, 2011)

Linear Algebraic Notation and Definitions. - Eric Robinson; Jeremy Kepner; John R. Gilbert (Graph Algorithms in the Language of Linear Algebra, 2011)

Some Graph Algorithms in an Array-Based Language. - Viral B. Shah; John R. Gilbert; Steve P. Reinhardt (Graph Algorithms in the Language of Linear Algebra, 2011)

The Combinatorial BLAS: design, implementation, and applications. - Aydin Buluç; John R. Gilbert (Int. J. High Perform. Comput. Appl., 2011)

SuperLU. - Xiaoye Sherry Li; James Demmel; John R. Gilbert; Laura Grigori; Meiyue Shao (Encyclopedia of Parallel Computing, 2011)

High-performance analysis of filtered semantic graphs. - Aydin Buluç; Armando Fox; John R. Gilbert; Shoaib Kamil 001; Adam Lugowski; Leonid Oliker; Samuel Williams 001 (PACT, 2012)

Scalable complex graph analysis with the knowledge discovery toolbox. - Adam Lugowski; Aydin Buluç; John R. Gilbert; Steven P. Reinhardt (ICASSP, 2012)

A Flexible Open-Source Toolbox for Scalable Complex Graph Analysis. - Adam Lugowski; David M. Alber; Aydin Buluç; John R. Gilbert; Steven P. Reinhardt; Yun Teng; Andrew Waranis (SDM, 2012)

Parallel Sparse Matrix-Matrix Multiplication and Indexing: Implementation and Experiments. - Aydin Buluç; John R. Gilbert (SIAM J. Sci. Comput., 2012)

Standards for graph algorithm primitives. - Tim Mattson; David A. Bader; Jonathan W. Berry; Aydin Buluç; Jack J. Dongarra; Christos Faloutsos; John Feo; John R. Gilbert; Joseph Gonzalez 001; Bruce Hendrickson; Jeremy Kepner; Charles E. Leiserson; et al. (HPEC, 2013)

High-Productivity and High-Performance Analysis of Filtered Semantic Graphs. - Aydin Buluç; Erika Duriakova; Armando Fox; John R. Gilbert; Shoaib Kamil 001; Adam Lugowski; Leonid Oliker; Samuel Williams 001 (IPDPS, 2013)

Efficient and accurate clustering for large-scale genetic mapping. - Veronika Strnadova; Aydin Buluç; Jarrod Chapman; John R. Gilbert; Joseph Gonzalez 001; Stefanie Jegelka; Daniel Rokhsar; Leonid Oliker (BIBM, 2014)

Implementing Iterative Algorithms with SPARQL. - Robert W. Techentin; Barry K. Gilbert; Adam Lugowski; Kevin Deweese; John R. Gilbert; Eric Dull; Mike Hinchey; Steven P. Reinhardt (EDBT/ICDT Workshops, 2014)

GABB Introduction. - Tim Mattson; David A. Bader; Aydin Buluç; John R. Gilbert; Joseph Gonzalez 001; Jeremy Kepner (IPDPS Workshops, 2014)

Efficient data reduction for large-scale genetic mapping. - Veronika Strnadová-Neeley; Aydin Buluç; Jarrod Chapman; John R. Gilbert; Joseph Gonzalez 001; Leonid Oliker (BCB, 2015)

Graphs, Matrices, and the GraphBLAS: Seven Good Reasons. - Jeremy Kepner; David A. Bader; Aydin Buluç; John R. Gilbert; Timothy G. Mattson; Henning Meyerhenke (ICCS, 2015)

Parallel Triangle Counting and Enumeration Using Matrix Algebra. - Ariful Azad; Aydin Buluç; John R. Gilbert (IPDPS Workshops, 2015)

Evaluating the Potential of a Laplacian Linear Solver. - Erik G. Boman; Kevin Deweese; John R. Gilbert (CoRR, 2015)

Parallel processing of filtered queries in attributed semantic graphs. - Adam Lugowski; Shoaib Kamil 001; Aydin Buluç; Samuel Williams 001; Erika Duriakova; Leonid Oliker; Armando Fox; John R. Gilbert (J. Parallel Distributed Comput., 2015)

Special issue "Graph analysis for scientific discovery". - Aydin Buluç; Leonid Oliker; John R. Gilbert (Parallel Comput., 2015)

An Empirical Comparison of Graph Laplacian Solvers. - Erik G. Boman; Kevin Deweese; John R. Gilbert (ALENEX, 2016)

Mathematical foundations of the GraphBLAS. - Jeremy Kepner; Peter Aaltonen; David A. Bader; Aydin Buluç; Franz Franchetti; John R. Gilbert; Dylan Hutchison; Manoj Kumar 006; Andrew Lumsdaine; Henning Meyerhenke; Scott McMillan; Carl Yang 002; et al. (HPEC, 2016)

An Empirical Study of Cycle Toggling Based Laplacian Solvers. - Kevin Deweese; John R. Gilbert; Gary L. Miller; Richard Peng; Hao Ran Xu; Shen Chen Xu (CSC, 2016)

LiRa: A New Likelihood-Based Similarity Score for Collaborative Filtering. - Veronika Strnadová-Neeley; Aydin Buluç; John R. Gilbert; Leonid Oliker; Weimin Ouyang (CoRR, 2016)

Evaluating the Potential of a Dual Randomized Kaczmarz Solver for Laplacian Linear Systems. - Kevin Deweese; John R. Gilbert; Erik G. Boman (Informatica (Slovenia), 2016)

Graph Algorithms in the Language of Linear Algebra: How Did We Get Here, and Where Do We Go Next? - John R. Gilbert (IPDPS Workshops, 2018)

Evolving Difficult Graphs for Laplacian Solvers. - Kevin Deweese; John R. Gilbert (CSC, 2018)

Introduction to GraphBLAS. - Jeremy Kepner; Peter Aaltonen; David A. Bader; Aydin Buluç; Franz Franchetti; John Gilbert 001; Shana Hutchison; Manoj Kumar 006; Andrew Lumsdaine; Henning Meyerhenke; Scott McMillan; José E. Moreira; et al. (Massive Graph Analytics, 2022)

Combinatorial BLAS 2.0: Scaling Combinatorial Algorithms on Distributed-Memory Systems. - Ariful Azad; Oguz Selvitopi; Md Taufique Hussain; John R. Gilbert; Aydin Buluç (IEEE Trans. Parallel Distributed Syst., 2022)