| 2008 |
| 46 | EE | Lamia Youseff,
Alethea Barbaro,
Peterson Trethewey,
Björn Birnir,
John R. Gilbert:
Parallel Modeling of Fish Interaction.
CSE 2008: 234-241 |
| 45 | EE | Aydin Buluc,
John R. Gilbert:
Challenges and Advances in Parallel Sparse Matrix-Matrix Multiplication.
ICPP 2008: 503-510 |
| 44 | EE | Aydin Buluc,
John R. Gilbert:
On the representation and multiplication of hypersparse matrices.
IPDPS 2008: 1-11 |
| 43 | EE | Imran Patel,
John R. Gilbert:
An empirical study of the performance and productivity of two parallel programming models.
IPDPS 2008: 1-7 |
| 42 | | John R. Gilbert,
Steve Reinhardt,
Viral Shah:
Distributed Sparse Matrices for Very High Level Languages.
Advances in Computers 72: 225-252 (2008) |
| 2006 |
| 41 | EE | John R. Gilbert,
Steve Reinhardt,
Viral Shah:
High-Performance Graph Algorithms from Parallel Sparse Matrices.
PARA 2006: 260-269 |
| 2004 |
| 40 | EE | Viral Shah,
John R. Gilbert:
Sparse Matrices in Matlab*P: Design and Implementation.
HiPC 2004: 144-155 |
| 39 | EE | 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) |
| 38 | EE | 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) |
| 2000 |
| 37 | | John R. Gilbert,
Sivan Toledo:
An Assessment of Incomplete-LU Preconditioners for Nonsymmetric Linear Systems.
Informatica (Slovenia) 24(3): (2000) |
| 1999 |
| 36 | EE | 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 |
| 35 | | John R. Gilbert,
Sivan Toledo:
High-Performance Out-of-Core Sparse LU Factorization.
PPSC 1999 |
| 34 | | Tzu-Yi Chen,
John R. Gilbert,
Sivan Toledo:
Toward an Efficient Column Minimum Degree Code for Symmetric Multiprocessors.
PPSC 1999 |
| 33 | | 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 |
| 32 | EE | Hristo Djidjev,
John R. Gilbert:
Separators in Graphs with Negative and Multiple Vertex Weights.
Algorithmica 23(1): 57-71 (1999) |
| 1998 |
| 31 | | John R. Gilbert:
Combinatorial Preconditioning for Sparse Linear Systems.
IRREGULAR 1998: 1-4 |
| 30 | | John R. Gilbert:
Integrating CAD Tools for MEMS Design.
IEEE Computer 31(4): 99-101 (1998) |
| 1997 |
| 29 | | 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 |
| 1996 |
| 28 | | 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) |
| 1995 |
| 27 | EE | John R. Gilbert,
Gary L. Miller,
Shang-Hua Teng:
Geometric mesh partitioning: implementation and experiments.
IPPS 1995: 418-427 |
| 26 | | Thomas J. Sheffler,
Robert Schreiber,
William Pugh,
John R. Gilbert,
Siddhartha Chatterjee:
Efficient Distribution Analysis via Graph Contraction.
LCPC 1995: 377-391 |
| 25 | EE | 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) |
| 24 | | 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) |
| 23 | | 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) |
| 1994 |
| 22 | | Siddhartha Chatterjee,
Robert Schreiber,
Thomas J. Sheffler,
John R. Gilbert:
Array Distribution in Data-Parallel Programs.
LCPC 1994: 76-91 |
| 21 | | Marshall W. Bern,
David Eppstein,
John R. Gilbert:
Provably Good Mesh Generation.
J. Comput. Syst. Sci. 48(3): 384-409 (1994) |
| 1993 |
| 20 | | Siddhartha Chatterjee,
John R. Gilbert,
Robert Schreiber:
The Alignment-Distribution Graph.
LCPC 1993: 234-252 |
| 19 | | Siddhartha Chatterjee,
John R. Gilbert,
Robert Schreiber,
Shang-Hua Teng:
Automatic Array Alignment in Data-Parallel Programs.
POPL 1993: 16-28 |
| 18 | | 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 |
| 17 | EE | Siddhartha Chatterjee,
John R. Gilbert,
Robert Schreiber:
Mobile and replicated alignment of arrays in data-parallel programs.
SC 1993: 420-429 |
| 1992 |
| 16 | | 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 |
| 15 | | Marshall W. Bern,
John R. Gilbert:
Drawing the Planar Dual.
Inf. Process. Lett. 43(1): 7-13 (1992) |
| 1991 |
| 14 | | John R. Gilbert,
Robert Schreiber:
Optimal Data Placement for Distributed Memory Architectures.
PPSC 1991: 462-471 |
| 13 | | Hans L. Bodlaender,
John R. Gilbert,
Ton Kloks,
Hjálmtyr Hafsteinsson:
Approximating Treewidth, Pathwidth, and Minimum Elimination Tree Height.
WG 1991: 1-12 |
| 12 | | John R. Gilbert,
Robert Schreiber:
Optimal Expression Evaluation for Data Parallel Architectures.
J. Parallel Distrib. Comput. 13(1): 58-64 (1991) |
| 1990 |
| 11 | | John R. Gilbert,
Rolf G. Karlsson:
SWAT 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 11-14, 1990, Proceedings
Springer 1990 |
| 10 | | Marshall W. Bern,
David Eppstein,
John R. Gilbert:
Provably Good Mesh Generation
FOCS 1990: 231-241 |
| 9 | | John R. Gilbert,
Hjálmtyr Hafsteinsson:
Parallel symbolic factorization of sparse linear systems.
Parallel Computing 14(2): 151-162 (1990) |
| 1988 |
| 8 | | John R. Gilbert,
Hjálmtyr Hafsteinsson:
Parallel Solution of Space Linear Systems.
SWAT 1988: 145-153 |
| 7 | | John R. Gilbert:
Some Nested Dissection Order is Nearly Optimal.
Inf. Process. Lett. 26(6): 325-328 (1988) |
| 6 | EE | Earl Zmijewski,
John R. Gilbert:
A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor.
Parallel Computing 7(2): 199-210 (1988) |
| 1987 |
| 5 | | John R. Gilbert,
Earl Zmijewski:
A Parallel Graph Partitioning Algorithm for a Message-Passing Multiprocessor.
ICS 1987: 498-513 |
| 1986 |
| 4 | EE | Thomas F. Coleman,
Anders Edenbrandt,
John R. Gilbert:
Predicting fill for sparse orthogonal factorization.
J. ACM 33(3): 517-532 (1986) |
| 1984 |
| 3 | | John R. Gilbert,
Joan P. Hutchinson,
Robert Endre Tarjan:
A Separator Theorem for Graphs of Bounded Genus.
J. Algorithms 5(3): 391-407 (1984) |
| 1980 |
| 2 | | John R. Gilbert,
Thomas Lengauer,
Robert Endre Tarjan:
The Pebbling Problem is Complete in Polynomial Space.
SIAM J. Comput. 9(3): 513-524 (1980) |
| 1979 |
| 1 | | John R. Gilbert,
Thomas Lengauer,
Robert Endre Tarjan:
The Pebbling Problem is Complete in Polynomial Space
STOC 1979: 237-248 |