Geoffrey Sanders

Publication Activity (10 Years)

Years Active: 2008-2023
Publications (10 Years): 44

Top Topics

Approximate Pattern Matching

Top Venues

IPDPS Workshops

SIAM J. Sci. Comput.

Publications

Michael Ostroski, Geoffrey Sanders, Trevor Steil, Roger Pearce
Scalable Edge Clustering of Dynamic Graphs via Weighted Line Graphs. CoRR (2023)
Keita Iwabuchi, Trevor Steil, Benjamin Priest, Roger Pearce, Geoffrey Sanders
Towards A Massive-scale Distributed Neighborhood Graph Construction. SC Workshops (2023)
Tahsin Reza, Trevor Steil, Geoffrey Sanders, Roger Pearce
Distributed approximate minimal Steiner trees with millions of seed vertices on billion-edge graphs. J. Parallel Distributed Comput. 181 (2023)
Tahsin Reza, Geoffrey Sanders, Roger Pearce
Towards Distributed 2-Approximation Steiner Minimal Trees in Billion-edge Graphs. IPDPS (2022)
Tahsin Reza, Geoffrey Sanders, Roger Pearce
Towards Distributed 2-Approximation Steiner Minimal Trees in Billion-edge Graphs. CoRR (2022)
Haifeng Xu, Rasha F. Kashef, Hans De Sterck, Geoffrey Sanders
Efficient Algebraic Multigrid Methods for Multilevel Overlapping Coclustering of User-Item Relationships. INFORMS J. Comput. 34 (3) (2022)
Vikram Ravindra, Geoffrey Sanders, Ananth Grama
Identifying Coherent Subgraphs In Dynamic Brain Networks. ICIP (2021)
Trevor Steil, Tahsin Reza, Keita Iwabuchi, Benjamin W. Priest, Geoffrey Sanders, Roger Pearce
TriPoll: Computing Surveys of Triangles in Massive-Scale Temporal Graphs with Metadata. CoRR (2021)
Lucia Minah Yang, Alyson Fox, Geoffrey Sanders
Rounding Error Analysis of Mixed Precision Block Householder QR Algorithms. SIAM J. Sci. Comput. 43 (3) (2021)
Trevor Steil, Geoffrey Sanders, Roger Pearce
Towards Distributed Square Counting in Large Graphs. HPEC (2021)
Tahsin Reza, Hassan Halawa, Matei Ripeanu, Geoffrey Sanders, Roger A. Pearce
Scalable Pattern Matching in Metadata Graphs via Constraint Checking. ACM Trans. Parallel Comput. 8 (1) (2021)
Trevor Steil, Tahsin Reza, Keita Iwabuchi, Benjamin W. Priest, Geoffrey Sanders, Roger Pearce
TriPoll: computing surveys of triangles in massive-scale temporal graphs with metadata. SC (2021)
Alyson Fox, James Diffenderfer, Jeffrey Hittinger, Geoffrey Sanders, Peter Lindstrom
Stability Analysis of Inline ZFP Compression for Floating-Point Data in Iterative Methods. SIAM J. Sci. Comput. 42 (5) (2020)
Tahsin Reza, Matei Ripeanu, Geoffrey Sanders, Roger Pearce
Labeled Triangle Indexing for Efficiency Gains in Distributed Interactive Subgraph Search††This work was performed under the auspices of the U.S. Department of Energy by Lawrence Livermore National Laboratory under Contract DE-AC52-07NA27344 (LLNL-CONF-814976). Experiments were performed at the Livermore Computing facility. IA3@SC (2020)
Tahsin Reza, Matei Ripeanu, Geoffrey Sanders, Roger Pearce
Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees. SIGMOD Conference (2020)
Benjamin W. Priest, Alec Michael Dunton, Geoffrey Sanders
Scaling Graph Clustering with Distributed Sketches. HPEC (2020)
Trevor Steil, Scott McMillan, Geoffrey Sanders, Roger Pearce, Benjamin Priest
Kronecker Graph Generation with Ground Truth for 4-Cycles and Dense Structure in Bipartite Graphs. IPDPS Workshops (2020)
Alyson Fox, James Diffenderfer, Jeffrey Hittinger, Geoffrey Sanders, Peter Lindstrom
Stability Analysis of Inline ZFP Compression for Floating-Point Data in Iterative Methods. CoRR (2020)
Benjamin W. Priest, Alec Michael Dunton, Geoffrey Sanders
Scaling Graph Clustering with Distributed Sketches. CoRR (2020)
Tahsin Reza, Matei Ripeanu, Geoffrey Sanders, Roger Pearce
Towards Interactive Pattern Search in Massive Graphs. GRADES-NDA@SIGMOD (2020)
James Diffenderfer, Alyson Fox, Jeffrey A. F. Hittinger, Geoffrey Sanders, Peter G. Lindstrom
Error Analysis of ZFP Compression for Floating-Point Data. SIAM J. Sci. Comput. 41 (3) (2019)
Tahsin Reza, Hassan Halawa, Matei Ripeanu, Geoffrey Sanders, Roger Pearce
Scalable Pattern Matching in Metadata Graphs via Constraint Checking. CoRR (2019)
Eisha Nathan, Geoffrey Sanders, Van Emden Henson
Personalized Ranking in Dynamic Graphs Using Nonbacktracking Walks. ICCS (2) (2019)
Benjamin Priest, Trevor Steil, Geoffrey Sanders, Roger Pearce
You've Got Mail (YGM): Building Missing Asynchronous Communication Primitives. IPDPS Workshops (2019)
Roger Pearce, Trevor Steil, Benjamin W. Priest, Geoffrey Sanders
One Quadrillion Triangles Queried on One Million Processors. HPEC (2019)
Trevor Steil, Benjamin W. Priest, Geoffrey Sanders, Roger Pearce, Timothy La Fond, Keita Iwabuchi
Distributed Kronecker Graph Generation with Ground Truth of Many Graph Properties. IPDPS Workshops (2019)
Lucia Minah Yang, Alyson Fox, Geoffrey Sanders
Mixed-Precision analysis of Householder QR Algorithms. CoRR (2019)
Tahsin Reza, Matei Ripeanu, Nicolas Tripoul, Geoffrey Sanders, Roger Pearce
PruneJuice: pruning trillion-edge graphs to a precise pattern-matching solution. SC (2018)
Geoffrey Sanders, Roger Pearce, Timothy La Fond, Jeremy Kepner
On Large-Scale Graph Generation with Validation of Diverse Triangle Statistics at Edges and Vertices. IPDPS Workshops (2018)
Keita Iwabuchi, Geoffrey Sanders, Keith Henderson, Roger Pearce
Computing Exact Vertex Eccentricity on Massive-Scale Distributed Graphs. CLUSTER (2018)
Geoffrey Sanders, Roger Pearce, Timothy La Fond, Jeremy Kepner
On Large-Scale Graph Generation with Validation of Diverse Triangle Statistics at Edges and Vertices. CoRR (2018)
Eisha Nathan, Geoffrey Sanders, Van Emden Henson, David A. Bader
Numerically approximating centrality for graph ranking guarantees. J. Comput. Sci. 26 (2018)
Nicolas Tripoul, Hassan Halawa, Tahsin Reza, Geoffrey Sanders, Roger Pearce, Matei Ripeanu
There are Trillions of Little Forks in the Road. Choose Wisely! - Estimating the Cost and Likelihood of Success of Constrained Walks to Optimize a Graph Pruning Pipeline. IA3@SC (2018)
Benjamin W. Priest, Roger Pearce, Geoffrey Sanders
Estimating Edge-Local Triangle Count Heavy Hitters in Edge-Linear Time and Almost-Vertex-Linear Space. HPEC (2018)
Alyson Fox, Geoffrey Sanders, Andrew Knyazev
Investigation of Spectral Clustering for Signed Graph Matrix Representations. HPEC (2018)
Jeremy Kepner, Siddharth Samsi, William Arcand, David Bestor, Bill Bergeron, Tim Davis, Vijay Gadepally, Michael Houle, Matthew Hubbell, Hayden Jananthan, Michael Jones, Anna Klein, Peter Michaleas, Roger Pearce, Lauren Milechin, Julie Mullen, Andrew Prout, Antonio Rosa, Geoffrey Sanders, Charles Yee, Albert Reuther
Design, Generation, and Validation of Extreme Scale Power-Law Graphs. IPDPS Workshops (2018)
Jeremy Kepner, Siddharth Samsi, William Arcand, David Bestor, Bill Bergeron, Tim Davis, Vijay Gadepally, Michael Houle, Matthew Hubbell, Hayden Jananthan, Michael Jones, Anna Klein, Peter Michaleas, Roger Pearce, Lauren Milechin, Julie Mullen, Andrew Prout, Antonio Rosa, Geoffrey Sanders, Charles Yee, Albert Reuther
Design, Generation, and Validation of Extreme Scale Power-Law Graphs. CoRR (2018)
Roger Pearce, Geoffrey Sanders
K-truss decomposition for Scale-Free Graphs at Scale in Distributed Memory. HPEC (2018)
Timothy La Fond, Geoffrey Sanders, Christine Klymko, Van Emden Henson
An Ensemble Framework for Detecting Community Changes in Dynamic Networks. CoRR (2017)
Eisha Nathan, Geoffrey Sanders, James P. Fairbanks, Van Emden Henson, David A. Bader
Graph Ranking Guarantees for Numerical Approximations to Katz Centrality. ICCS (2017)
Tahsin Reza, Christine Klymko, Matei Ripeanu, Geoffrey Sanders, Roger A. Pearce
Towards Practical and Robust Labeled Pattern Matching in Trillion-Edge Graphs. CLUSTER (2017)
Alyson Fox, Thomas A. Manteuffel, Geoffrey Sanders
Numerical Methods for Gremban's Expansion of Signed Graphs. SIAM J. Sci. Comput. 39 (5) (2017)
Timothy La Fond, Geoffrey Sanders, Christine Klymko, Van Emden Henson
An ensemble framework for detecting community changes in dynamic networks. HPEC (2017)
Christine Klymko, Geoffrey Sanders
Detecting highly cyclic structure with complex eigenpairs. CoRR (2016)
Hans De Sterck, Killian Miller, Thomas A. Manteuffel, Geoffrey Sanders
Top-level acceleration of adaptive algebraic multilevel methods for steady-state solution to Markov chains. Adv. Comput. Math. 35 (2-4) (2011)
Hans De Sterck, Van Emden Henson, Geoffrey Sanders
Multilevel Aggregation Methods for Small-World Graphs with Application to Random-Walk Ranking. Comput. Informatics 30 (2) (2011)
Hans De Sterck, Killian Miller, Geoffrey Sanders
Iterant recombination with one-norm minimization for multilevel Markov chain algorithms via the ellipsoid method. Comput. Vis. Sci. 14 (2) (2011)
Hans De Sterck, Killian Miller, Geoffrey Sanders, Manda Winlaw
Recursively Accelerated Multilevel Aggregation for Markov Chains. SIAM J. Sci. Comput. 32 (3) (2010)
Tiffany Inglis, Hans De Sterck, Geoffrey Sanders, Haig Djambazian, Robert Sladek, Saravanan Sundararajan, Thomas J. Hudson
Multilevel Space-Time Aggregation for Bright Field Cell Microscopy Segmentation and Tracking. Int. J. Biomed. Imaging 2010 (2010)
Hans De Sterck, Thomas A. Manteuffel, Stephen F. McCormick, Killian Miller, John W. Ruge, Geoffrey Sanders
Algebraic Multigrid for Markov Chains. SIAM J. Sci. Comput. 32 (2) (2010)
Hans De Sterck, Thomas A. Manteuffel, Stephen F. McCormick, Killian Miller, J. Pearson, John W. Ruge, Geoffrey Sanders
Smoothed Aggregation Multigrid for Markov Chains. SIAM J. Sci. Comput. 32 (1) (2010)
Marian Brezina, Thomas A. Manteuffel, Stephen F. McCormick, John W. Ruge, Geoffrey Sanders
Towards Adaptive Smoothed Aggregation (AlphaSA) for Nonsymmetric Problems. SIAM J. Sci. Comput. 32 (1) (2010)
Thomas A. Manteuffel, Steve F. McCormick, Joshua Nolting, John W. Ruge, Geoffrey Sanders
Further results on error estimators for local refinement with first-order system least squares (FOSLS). Numer. Linear Algebra Appl. 17 (2-3) (2010)
Marian Brezina, Thomas A. Manteuffel, Stephen F. McCormick, John W. Ruge, Geoffrey Sanders, Panayot S. Vassilevski
A generalized eigensolver based on smoothed aggregation (GES-SA) for initializing smoothed aggregation (SA) multigrid. Numer. Linear Algebra Appl. 15 (2-3) (2008)