John R. Gilbert

Affiliations:
  • University of California Santa Barbara, CA, USA


According to our database1, John R. Gilbert authored at least 87 papers between 1980 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Combinatorial BLAS 2.0: Scaling Combinatorial Algorithms on Distributed-Memory Systems.
IEEE Trans. Parallel Distributed Syst., 2022

2018
Evolving Difficult Graphs for Laplacian Solvers.
Proceedings of the Eighth SIAM Workshop on Combinatorial Scientific Computing, 2018

Graph Algorithms in the Language of Linear Algebra: How Did We Get Here, and Where Do We Go Next?
Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium Workshops, 2018

2016
Evaluating the Potential of a Dual Randomized Kaczmarz Solver for Laplacian Linear Systems.
Informatica (Slovenia), 2016

LiRa: A New Likelihood-Based Similarity Score for Collaborative Filtering.
CoRR, 2016

An Empirical Study of Cycle Toggling Based Laplacian Solvers.
Proceedings of the 2016 Proceedings of the Seventh SIAM Workshop on Combinatorial Scientific Computing, 2016


An Empirical Comparison of Graph Laplacian Solvers.
Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, 2016

2015
Special issue "Graph analysis for scientific discovery".
Parallel Comput., 2015

Parallel processing of filtered queries in attributed semantic graphs.
J. Parallel Distributed Comput., 2015

Evaluating the Potential of a Laplacian Linear Solver.
CoRR, 2015

Parallel Triangle Counting and Enumeration Using Matrix Algebra.
Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium Workshop, 2015

Graphs, Matrices, and the GraphBLAS: Seven Good Reasons.
Proceedings of the International Conference on Computational Science, 2015

Efficient data reduction for large-scale genetic mapping.
Proceedings of the 6th ACM Conference on Bioinformatics, 2015

2014
GABB Introduction.
Proceedings of the 2014 IEEE International Parallel & Distributed Processing Symposium Workshops, 2014

Implementing Iterative Algorithms with SPARQL.
Proceedings of the Workshops of the EDBT/ICDT 2014 Joint Conference (EDBT/ICDT 2014), 2014

Efficient and accurate clustering for large-scale genetic mapping.
Proceedings of the 2014 IEEE International Conference on Bioinformatics and Biomedicine, 2014

2013
High-Productivity and High-Performance Analysis of Filtered Semantic Graphs.
Proceedings of the 27th IEEE International Symposium on Parallel and Distributed Processing, 2013


2012
Parallel Sparse Matrix-Matrix Multiplication and Indexing: Implementation and Experiments.
SIAM J. Sci. Comput., 2012

A Flexible Open-Source Toolbox for Scalable Complex Graph Analysis.
Proceedings of the Twelfth SIAM International Conference on Data Mining, 2012

Scalable complex graph analysis with the knowledge discovery toolbox.
Proceedings of the 2012 IEEE International Conference on Acoustics, 2012

High-performance analysis of filtered semantic graphs.
Proceedings of the International Conference on Parallel Architectures and Compilation Techniques, 2012

2011
SuperLU.
Proceedings of the Encyclopedia of Parallel Computing, 2011

The Combinatorial BLAS: design, implementation, and applications.
Int. J. High Perform. Comput. Appl., 2011

Some Graph Algorithms in an Array-Based Language.
Proceedings of the Graph Algorithms in the Language of Linear Algebra, 2011

Linear Algebraic Notation and Definitions.
Proceedings of the Graph Algorithms in the Language of Linear Algebra, 2011

Fundamental Questions in the Analysis of Large Graphs.
Proceedings of the Graph Algorithms in the Language of Linear Algebra, 2011

Implementing Sparse Matrices for Graph Algorithms.
Proceedings of the Graph Algorithms in the Language of Linear Algebra, 2011

New Ideas in Sparse Matrix Matrix Multiplication.
Proceedings of the Graph Algorithms in the Language of Linear Algebra, 2011

2010
Solving path problems on the GPU.
Parallel Comput., 2010

Highly Parallel Sparse Matrix-Matrix Multiplication
CoRR, 2010

2009
Linear Representation of Network Traffic.
Mob. Networks Appl., 2009

Parallel sparse matrix-vector and matrix-transpose-vector multiplication using compressed sparse blocks.
Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009

2008
Symbolic and Exact Structure Prediction for Sparse Gaussian Elimination with Partial Pivoting.
SIAM J. Matrix Anal. Appl., 2008

A Unified Framework for Numerical and Combinatorial Computing.
Comput. Sci. Eng., 2008

Distributed Sparse Matrices for Very High Level Languages.
Adv. Comput., 2008

An empirical study of the performance and productivity of two parallel programming models.
Proceedings of the 22nd IEEE International Symposium on Parallel and Distributed Processing, 2008

On the representation and multiplication of hypersparse matrices.
Proceedings of the 22nd IEEE International Symposium on Parallel and Distributed Processing, 2008

Challenges and Advances in Parallel Sparse Matrix-Matrix Multiplication.
Proceedings of the 2008 International Conference on Parallel Processing, 2008

Parallel Modeling of Fish Interaction.
Proceedings of the 11th IEEE International Conference on Computational Science and Engineering, 2008

2007
An Interactive Environment to Manipulate Large Graphs.
Proceedings of the IEEE International Conference on Acoustics, 2007

2006
Support-Graph Preconditioners.
SIAM J. Matrix Anal. Appl., 2006

A comparative analysis of the information content in long and short SAGE libraries.
BMC Bioinform., 2006

High-Performance Graph Algorithms from Parallel Sparse Matrices.
Proceedings of the Applied Parallel Computing. State of the Art in Scientific Computing, 2006

2004
Algorithm 836: COLAMD, a column approximate minimum degree ordering algorithm.
ACM Trans. Math. Softw., 2004

A column approximate minimum degree ordering algorithm.
ACM Trans. Math. Softw., 2004

Sparse Matrices in Matlab*P: Design and Implementation.
Proceedings of the High Performance Computing, 2004

2003
A Note on the Column Elimination Tree.
SIAM J. Matrix Anal. Appl., 2003

2000
An Assessment of Incomplete-LU Preconditioners for Nonsymmetric Linear Systems.
Informatica (Slovenia), 2000

1999
An Asynchronous Parallel Supernodal Algorithm for Sparse Gaussian Elimination.
SIAM J. Matrix Anal. Appl., 1999

A Supernodal Approach to Sparse Partial Pivoting.
SIAM J. Matrix Anal. Appl., 1999

Separators in Graphs with Negative and Multiple Vertex Weights.
Algorithmica, 1999

High-Performance Out-of-Core Sparse LU Factorization.
Proceedings of the Ninth SIAM Conference on Parallel Processing for Scientific Computing, 1999

Toward an Efficient Column Minimum Degree Code for Symmetric Multiprocessors.
Proceedings of the Ninth SIAM Conference on Parallel Processing for Scientific Computing, 1999

A Methodology and Associated CAD Tools for Support of Concurrent Design of MEMS.
Proceedings of the VLSI: Systems on a Chip, 1999

MEMS CAD Beyond Multi-Million Transistors (Panel).
Proceedings of the 36th Conference on Design Automation, 1999

1998
Geometric Mesh Partitioning: Implementation and Experiments.
SIAM J. Sci. Comput., 1998

Integrating CAD Tools for MEMS Design.
Computer, 1998

Combinatorial Preconditioning for Sparse Linear Systems.
Proceedings of the Solving Irregularly Structured Problems in Parallel, 1998

1997
Aspect-Oriented Programming of Sparse Matrix Code.
Proceedings of the Scientific Computing in Object-Oriented Parallel Environments, 1997

1996
Algorithms for Automatic Alignment of Arrays.
J. Parallel Distributed Comput., 1996

Efficient Distribution Analysis via Graph Contraction.
Int. J. Parallel Program., 1996

1995
Optimal Evaluation of Array Expressions on Massively Parallel Machines.
ACM Trans. Program. Lang. Syst., 1995

Generating Local Address and Communication Sets for Data-Parallel Programs.
J. Parallel Distributed Comput., 1995

Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree.
J. Algorithms, 1995

1994
Provably Good Mesh Generation.
J. Comput. Syst. Sci., 1994

Array Distribution in Data-Parallel Programs.
Proceedings of the Languages and Compilers for Parallel Computing, 1994

1993
Mobile and replicated alignment of arrays in data-parallel programs.
Proceedings of the Proceedings Supercomputing '93, 1993

Automatic Array Alignment in Data-Parallel Programs.
Proceedings of the Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1993

The Alignment-Distribution Graph.
Proceedings of the Languages and Compilers for Parallel Computing, 1993

1992
Highly Parallel Sparse Cholesky Factorization.
SIAM J. Sci. Comput., 1992

Sparse Matrices in MATLAB: Design and Implementation.
SIAM J. Matrix Anal. Appl., 1992

Drawing the Planar Dual.
Inf. Process. Lett., 1992

Optimal Evaluation of Array Expressions on Massively Parallel Machines (Extended Abstract).
Proceedings of the 2nd SIGPLAN Workshop on Languages, Compilers, and Run-Time Environments for Distributed Memory Multiprocessors, Boulder, Colorado, September 30, 1992

1991
Optimal Expression Evaluation for Data Parallel Architectures.
J. Parallel Distributed Comput., 1991

Approximating Treewidth, Pathwidth, and Minimum Elimination Tree Height.
Proceedings of the 17th International Workshop, 1991

Optimal Data Placement for Distributed Memory Architectures.
Proceedings of the Fifth SIAM Conference on Parallel Processing for Scientific Computing, 1991

1990
Parallel symbolic factorization of sparse linear systems.
Parallel Comput., 1990

1988
A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor.
Parallel Comput., 1988

Some Nested Dissection Order is Nearly Optimal.
Inf. Process. Lett., 1988

Parallel Solution of Space Linear Systems.
Proceedings of the SWAT 88, 1988

1987
A parallel graph partitioning algorithm for a message-passing multiprocessor.
Int. J. Parallel Program., 1987

1986
Predicting fill for sparse orthogonal factorization.
J. ACM, 1986

1984
A Separator Theorem for Graphs of Bounded Genus.
J. Algorithms, 1984

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

The Pebbling Problem is Complete in Polynomial Space.
SIAM J. Comput., 1980


  Loading...