John R. Gilbert

Aydin Buluç, John R. Gilbert: Parallel Sparse Matrix-Matrix Multiplication and Indexing: Implementation and Experiments. SIAM J. Scientific Computing 34(4) (2012)

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

Adam Lugowski, Aydin Buluç, John R. Gilbert, Steve Reinhardt: Scalable complex graph analysis with the knowledge discovery toolbox. ICASSP 2012: 5345-5348

Adam Lugowski, David M. Alber, Aydin Buluç, John R. Gilbert, Steve Reinhardt, Yun Teng, Andrew Waranis: A Flexible Open-Source Toolbox for Scalable Complex Graph Analysis. SDM 2012: 930-941

Aydin Buluç, John R. Gilbert: The Combinatorial BLAS: design, implementation, and applications. IJHPCA 25(4): 496-509 (2011)

Xiaoye Sherry Li, James Demmel, John R. Gilbert, Laura Grigori, Meiyue Shao: SuperLU. Encyclopedia of Parallel Computing 2011: 1955-1962

Aydin Buluç, John R. Gilbert: Parallel Sparse Matrix-Matrix Multiplication and Indexing: Implementation and Experiments. CoRR abs/1109.3739 (2011)

Aydin Buluç, John R. Gilbert, Ceren Budak: Solving path problems on the GPU. Parallel Computing 36(5-6): 241-253 (2010)

Aydin Buluç, John R. Gilbert: Highly Parallel Sparse Matrix-Matrix Multiplication. CoRR abs/1006.2183 (2010)

Stefan Karpinski, Elizabeth M. Belding, Kevin C. Almeroth, John R. Gilbert: Linear Representation of Network Traffic. MONET 14(4): 368-386 (2009)

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

John R. Gilbert, Steve Reinhardt, Viral Shah: Distributed Sparse Matrices for Very High Level Languages. Advances in Computers 72: 225-252 (2008)

John R. Gilbert, Steve Reinhardt, Viral Shah: A Unified Framework for Numerical and Combinatorial Computing. Computing in Science and Engineering 10(2): 20-25 (2008)

Laura Grigori, John R. Gilbert, Michel Cosnard: Symbolic and Exact Structure Prediction for Sparse Gaussian Elimination with Partial Pivoting. SIAM J. Matrix Analysis Applications 30(4): 1520-1545 (2008)

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

Aydin Buluç, John R. Gilbert: Challenges and Advances in Parallel Sparse Matrix-Matrix Multiplication. ICPP 2008: 503-510

Aydin Buluç, John R. Gilbert: On the representation and multiplication of hypersparse matrices. IPDPS 2008: 1-11

Imran Patel, John R. Gilbert: An empirical study of the performance and productivity of two parallel programming models. IPDPS 2008: 1-7

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

Marshall W. Bern, John R. Gilbert, Bruce Hendrickson, Nhat Nguyen, Sivan Toledo: Support-Graph Preconditioners. SIAM J. Matrix Analysis Applications 27(4): 930-951 (2006)

John R. Gilbert, Steve Reinhardt, Viral Shah: High-Performance Graph Algorithms from Parallel Sparse Matrices. PARA 2006: 260-269

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

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

Viral Shah, John R. Gilbert: Sparse Matrices in Matlab*P: Design and Implementation. HiPC 2004: 144-155

John R. Gilbert, Laura Grigori: A Note on the Column Elimination Tree. SIAM J. Matrix Analysis Applications 25(1): 143-151 (2003)

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

Hristo Djidjev, John R. Gilbert: Separators in Graphs with Negative and Multiple Vertex Weights. Algorithmica 23(1): 57-71 (1999)

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

B. F. Romanowicz, M. H. Zaman, S. F. Bart, V. L. Rabinovich, I. Tchertkov, C. Hsu, John R. Gilbert: A Methodology and Associated CAD Tools for Support of Concurrent Design of MEMS. VLSI 1999: 636-648

Tzu-Yi Chen, John R. Gilbert, Sivan Toledo: Toward an Efficient Column Minimum Degree Code for Symmetric Multiprocessors. PPSC 1999

John R. Gilbert, Sivan Toledo: High-Performance Out-of-Core Sparse LU Factorization. PPSC 1999

John R. Gilbert: Integrating CAD Tools for MEMS Design. IEEE Computer 31(4): 99-101 (1998)

John R. Gilbert: Combinatorial Preconditioning for Sparse Linear Systems. IRREGULAR 1998: 1-4

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

Thomas J. Sheffler, Robert Schreiber, William Pugh, John R. Gilbert, Siddhartha Chatterjee: Efficient Distribution Analysis via Graph Contraction. International Journal of Parallel Programming 24(6): 599-620 (1996)

Siddhartha Chatterjee, John R. Gilbert, Leonid Oliker, Robert Schreiber, Thomas J. Sheffler: Algorithms for Automatic Alignment of Arrays. J. Parallel Distrib. Comput. 38(2): 145-157 (1996)

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

Siddhartha Chatterjee, John R. Gilbert, Fred J. E. Long, Robert Schreiber, Shang-Hua Teng: Generating Local Address and Communication Sets for Data-Parallel Programs. J. Parallel Distrib. Comput. 26(1): 72-84 (1995)

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

John R. Gilbert, Gary L. Miller, Shang-Hua Teng: Geometric mesh partitioning: implementation and experiments. IPPS 1995: 418-427

Thomas J. Sheffler, Robert Schreiber, William Pugh, John R. Gilbert, Siddhartha Chatterjee: Efficient Distribution Analysis via Graph Contraction. LCPC 1995: 377-391

Marshall W. Bern, David Eppstein, John R. Gilbert: Provably Good Mesh Generation. J. Comput. Syst. Sci. 48(3): 384-409 (1994)

Siddhartha Chatterjee, Robert Schreiber, Thomas J. Sheffler, John R. Gilbert: Array Distribution in Data-Parallel Programs. LCPC 1994: 76-91

Siddhartha Chatterjee, John R. Gilbert, Robert Schreiber: The Alignment-Distribution Graph. LCPC 1993: 234-252

Siddhartha Chatterjee, John R. Gilbert, Robert Schreiber, Shang-Hua Teng: Automatic Array Alignment in Data-Parallel Programs. POPL 1993: 16-28

Siddhartha Chatterjee, John R. Gilbert, Fred J. E. Long, Robert Schreiber, Shang-Hua Teng: Generating Local Address and Communication Sets for Data-Parallel Programs. PPOPP 1993: 149-158

Siddhartha Chatterjee, John R. Gilbert, Robert Schreiber: Mobile and replicated alignment of arrays in data-parallel programs. SC 1993: 420-429

Marshall W. Bern, John R. Gilbert: Drawing the Planar Dual. Inf. Process. Lett. 43(1): 7-13 (1992)

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

John R. Gilbert, Robert Schreiber: Optimal Expression Evaluation for Data Parallel Architectures. J. Parallel Distrib. Comput. 13(1): 58-64 (1991)

John R. Gilbert, Robert Schreiber: Optimal Data Placement for Distributed Memory Architectures. PPSC 1991: 462-471

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

John R. Gilbert, Hjálmtyr Hafsteinsson: Parallel symbolic factorization of sparse linear systems. Parallel Computing 14(2): 151-162 (1990)

Marshall W. Bern, David Eppstein, John R. Gilbert: Provably Good Mesh Generation. FOCS 1990: 231-241

John R. Gilbert, Rolf G. Karlsson (Eds.): SWAT 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 11-14, 1990, Proceedings. Lecture Notes in Computer Science 447, Springer 1990, isbn 3-540-52846-6

John R. Gilbert: Some Nested Dissection Order is Nearly Optimal. Inf. Process. Lett. 26(6): 325-328 (1988)

Earl Zmijewski, John R. Gilbert: A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor. Parallel Computing 7(2): 199-210 (1988)

John R. Gilbert, Hjálmtyr Hafsteinsson: Parallel Solution of Space Linear Systems. SWAT 1988: 145-153

John R. Gilbert, Earl Zmijewski: A parallel graph partitioning algorithm for a message-passing multiprocessor. International Journal of Parallel Programming 16(6): 427-449 (1987)

John R. Gilbert, Earl Zmijewski: A Parallel Graph Partitioning Algorithm for a Message-Passing Multiprocessor. ICS 1987: 498-513

Thomas F. Coleman, Anders Edenbrandt, John R. Gilbert: Predicting fill for sparse orthogonal factorization. J. ACM 33(3): 517-532 (1986)

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

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

John R. Gilbert, Thomas Lengauer, Robert Endre Tarjan: The Pebbling Problem is Complete in Polynomial Space. STOC 1979: 237-248