Bruce Hendrickson

According to our database1, Bruce Hendrickson authored at least 72 papers between 1992 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
The Day After Tomorrow: The Looming Post-Exascale Crisis.
Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium, 2018

2014
Standards for Graph Algorithm Primitives.
CoRR, 2014

2013

2012
Graph embeddings and linear equations: technical perspective.
Commun. ACM, 2012

2011
Graph Partitioning.
Proceedings of the Encyclopedia of Parallel Computing, 2011

Chaco.
Proceedings of the Encyclopedia of Parallel Computing, 2011

Data-Intensive Science in the US DOE: Case Studies and Future Challenges.
Computing in Science and Engineering, 2011

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

2009
Emerging challenges and opportunities in parallel computing: the cretaceous redux?
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

2008
Solving Elliptic Finite Element Systems in Near-Linear Time with Support Preconditioners.
SIAM J. Numerical Analysis, 2008

BlueGene/L applications: Parallelism On a Massive Scale.
IJHPCA, 2008

Graph Analysis with High-Performance Computing.
Computing in Science and Engineering, 2008

Topic 10: Parallel Numerical Algorithms.
Proceedings of the Euro-Par 2008, 2008

2007
Optimal Embeddings and Eigenvalues in Support Theory.
SIAM J. Matrix Analysis Applications, 2007

Challenges in Parallel Graph Processing.
Parallel Processing Letters, 2007

Analyzing the Scalability of Graph Algorithms on Eldorado.
Proceedings of the 21th International Parallel and Distributed Processing Symposium (IPDPS 2007), 2007

Software and Algorithms for Graph Queries on Multithreaded Architectures.
Proceedings of the 21th International Parallel and Distributed Processing Symposium (IPDPS 2007), 2007

2006
Support-Graph Preconditioners.
SIAM J. Matrix Analysis Applications, 2006

Combinatorial Scientific Computing: The Enabling Power of Discrete Algorithms in Computational Science.
Proceedings of the High Performance Computing for Computational Science, 2006

DFS: A Simple to Write Yet Difficult to Execute Benchmark.
Proceedings of the 2006 IEEE International Symposium on Workload Characterization, 2006

Realizing parallelism in database operations: insights from a massively multithreaded architecture.
Proceedings of the Workshop on Data Management on New Hardware, 2006

Combinatorial Parallel and Scientific Computing.
Proceedings of the Parallel Processing for Scientific Computing, 2006

2005
Improving Load Balance with Flexibly Assignable Tasks.
IEEE Trans. Parallel Distrib. Syst., 2005

Finding strongly connected components in distributed graphs.
J. Parallel Distrib. Comput., 2005

Tinkertoy parallel programming: a case study with Zoltan.
IJCSE, 2005

A Scalable Distributed Parallel Breadth-First Search Algorithm on BlueGene/L.
Proceedings of the ACM/IEEE SC2005 Conference on High Performance Networking and Computing, 2005

2004
Interprocessor Communication with Limited Memory.
IEEE Trans. Parallel Distrib. Syst., 2004

Maximum-weight-basis preconditioners.
Numerical Lin. Alg. with Applic., 2004

A parallel rendezvous algorithm for interpolation between multiple grids.
J. Parallel Distrib. Comput., 2004

2003
Support Theory for Preconditioning.
SIAM J. Matrix Analysis Applications, 2003

2002
Zoltan data management services for parallel dynamic applications.
Computing in Science and Engineering, 2002

Exploiting flexibly assignable work to improve load balance.
Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2002

2001
Finding strongly connected components in parallel in particle transport sweeps.
Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

Communication Support for Adaptive Computation.
Proceedings of the Tenth SIAM Conference on Parallel Processing for Scientific Computing, 2001

Identifying Strongly Connected Components in Parallel.
Proceedings of the Tenth SIAM Conference on Parallel Processing for Scientific Computing, 2001

Tinkertoy Parallel Programming: Complicated Applications from Simple Tools.
Proceedings of the Tenth SIAM Conference on Parallel Processing for Scientific Computing, 2001

Partitioning for Complex Objectives.
Proceedings of the 15th International Parallel & Distributed Processing Symposium (IPDPS-01), 2001

2000
Partitioning Rectangular and Structurally Unsymmetric Sparse Matrices for Parallel Processing.
SIAM J. Scientific Computing, 2000

Graph partitioning models for parallel computing.
Parallel Computing, 2000

Graph partitioning and parallel computing.
Parallel Computing, 2000

Interprocessor communication with memory constraints.
Proceedings of the Twelfth annual ACM Symposium on Parallel Algorithms and Architectures, 2000

Parallel Algorithms for Radiation Transport on Unstructured Grids.
Proceedings of the Proceedings Supercomputing 2000, 2000

On Identifying Strongly Connected Components in Parallel.
Proceedings of the Parallel and Distributed Processing, 2000

Design of dynamic load-balancing tools for parallel applications.
Proceedings of the 14th international conference on Supercomputing, 2000

1999
Massively parallel computing: A Sandia perspective.
Parallel Computing, 1999

Scheduling and Load Balancing - Introduction.
Proceedings of the Euro-Par '99 Parallel Processing, 5th International Euro-Par Conference, Toulouse, France, August 31, 1999

1998
Improving the Run Time and Quality of Nested Dissection Ordering.
SIAM J. Scientific Computing, 1998

Toward an Efficient Parallel Eigensolver for Dense Symmetric Matrices.
SIAM J. Scientific Computing, 1998

A Spectral Algorithm for Seriation and the Consecutive Ones Problem.
SIAM J. Comput., 1998

Parallel Transient Dynamics Simulations: Algorithms for Contact Detection and Smoothed Particle Hydrodynamics.
J. Parallel Distrib. Comput., 1998

Knowledge Mining With VxInsight: Discovery Through Interaction.
J. Intell. Inf. Syst., 1998

Sparse Matrix Ordering Methods for Interior Point Linear Programming.
INFORMS Journal on Computing, 1998

Partitioning Sparse Rectangular Matrices for Parallel Computations of Ax and ATv.
Proceedings of the Applied Parallel Computing, 1998

Graph Partitioning and Parallel Solvers: Has the Emperor No Clother? (Extended Abstract).
Proceedings of the Solving Irregularly Structured Problems in Parallel, 1998

1997
Transient Solid Dynamics Simulations on the Sandia/Intel Teraflop Computer.
Proceedings of the ACM/IEEE Conference on Supercomputing, 1997

Effective Sparse Matrix Ordering: Just Around the BEND.
Proceedings of the Eighth SIAM Conference on Parallel Processing for Scientific Computing, 1997

Skewed Graph Partitioning.
Proceedings of the Eighth SIAM Conference on Parallel Processing for Scientific Computing, 1997

1996
A new parallel method for molecular dynamics simulation of macromolecular systems.
Journal of Computational Chemistry, 1996

Enhancing Data Locality by Using Terminal Propagation.
Proceedings of the 29th Annual Hawaii International Conference on System Sciences (HICSS-29), 1996

1995
An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations.
SIAM J. Scientific Computing, 1995

The Molecule Problem: Exploiting Structure in Global Optimization.
SIAM Journal on Optimization, 1995

Parallel Many-Body Simulations without All-to-All Communication.
J. Parallel Distrib. Comput., 1995

An Efficient Parallel Algorithm for Matrix-Vector Multiplication.
International Journal of High Speed Computing, 1995

A Multi-Level Algorithm For Partitioning Graphs.
Proceedings of the Proceedings Supercomputing '95, San Diego, CA, USA, December 4-8, 1995, 1995

Parallel Algorithms for Dynamically Partitioning Unstructured Grids.
Proceedings of the Seventh SIAM Conference on Parallel Processing for Scientific Computing, 1995

1994
The Torus-Wrap Mapping for Dense Matrix Calculations on Massively Parallel Computers.
SIAM J. Scientific Computing, 1994

Massively Parallel Methods for Engineering and Science Problems.
Commun. ACM, 1994

A 65+ Gflops/s unstructured finite element simulation of chemically reacting flows on the Intel Paragon.
Proceedings of the Proceedings Supercomputing '94, 1994

1993
Parallel QR Factorization Using the Torus-Wrap Mapping.
Parallel Computing, 1993

A New Decomposition Strategy for Parallel Bonded Molecular Dynamics.
Proceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing, 1993

An Improved Spectral Load Balancing Method.
Proceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing, 1993

1992
Conditions for Unique Graph Realizations.
SIAM J. Comput., 1992


  Loading...