Geoffrey Sanders

Orcid: 0000-0001-9145-1226

According to our database1, Geoffrey Sanders authored at least 49 papers between 2008 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Distributed approximate minimal Steiner trees with millions of seed vertices on billion-edge graphs.
J. Parallel Distributed Comput., November, 2023

Scalable Edge Clustering of Dynamic Graphs via Weighted Line Graphs.
CoRR, 2023

Towards A Massive-scale Distributed Neighborhood Graph Construction.
Proceedings of the SC '23 Workshops of The International Conference on High Performance Computing, 2023

2022
Efficient Algebraic Multigrid Methods for Multilevel Overlapping Coclustering of User-Item Relationships.
INFORMS J. Comput., 2022

Towards Distributed 2-Approximation Steiner Minimal Trees in Billion-edge Graphs.
Proceedings of the 2022 IEEE International Parallel and Distributed Processing Symposium, 2022

Massive-Scale Distributed Triangle Computation and Applications.
Proceedings of the Massive Graph Analytics, 2022

2021
Scalable Pattern Matching in Metadata Graphs via Constraint Checking.
ACM Trans. Parallel Comput., 2021

Rounding Error Analysis of Mixed Precision Block Householder QR Algorithms.
SIAM J. Sci. Comput., 2021

TriPoll: computing surveys of triangles in massive-scale temporal graphs with metadata.
Proceedings of the International Conference for High Performance Computing, 2021

Identifying Coherent Subgraphs In Dynamic Brain Networks.
Proceedings of the 2021 IEEE International Conference on Image Processing, 2021

Towards Distributed Square Counting in Large Graphs.
Proceedings of the 2021 IEEE High Performance Extreme Computing Conference, 2021

2020
Stability Analysis of Inline ZFP Compression for Floating-Point Data in Iterative Methods.
SIAM J. Sci. Comput., 2020

Towards Interactive Pattern Search in Massive Graphs.
Proceedings of the GRADES-NDA'20: Proceedings of the 3rd Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA), 2020

Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees.
Proceedings of the 2020 International Conference on Management of Data, 2020

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.
Proceedings of the 10th IEEE/ACM Workshop on Irregular Applications: Architectures and Algorithms, 2020

Kronecker Graph Generation with Ground Truth for 4-Cycles and Dense Structure in Bipartite Graphs.
Proceedings of the 2020 IEEE International Parallel and Distributed Processing Symposium Workshops, 2020

Scaling Graph Clustering with Distributed Sketches.
Proceedings of the 2020 IEEE High Performance Extreme Computing Conference, 2020

2019
Error Analysis of ZFP Compression for Floating-Point Data.
SIAM J. Sci. Comput., 2019

Mixed-Precision analysis of Householder QR Algorithms.
CoRR, 2019

Distributed Kronecker Graph Generation with Ground Truth of Many Graph Properties.
Proceedings of the IEEE International Parallel and Distributed Processing Symposium Workshops, 2019

You've Got Mail (YGM): Building Missing Asynchronous Communication Primitives.
Proceedings of the IEEE International Parallel and Distributed Processing Symposium Workshops, 2019

Personalized Ranking in Dynamic Graphs Using Nonbacktracking Walks.
Proceedings of the Computational Science - ICCS 2019, 2019

One Quadrillion Triangles Queried on One Million Processors.
Proceedings of the 2019 IEEE High Performance Extreme Computing Conference, 2019

2018
Numerically approximating centrality for graph ranking guarantees.
J. Comput. Sci., 2018

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.
Proceedings of the 8th IEEE/ACM Workshop on Irregular Applications: Architectures and Algorithms, 2018

PruneJuice: pruning trillion-edge graphs to a precise pattern-matching solution.
Proceedings of the International Conference for High Performance Computing, 2018

On Large-Scale Graph Generation with Validation of Diverse Triangle Statistics at Edges and Vertices.
Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium Workshops, 2018

Design, Generation, and Validation of Extreme Scale Power-Law Graphs.
Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium Workshops, 2018

Estimating Edge-Local Triangle Count Heavy Hitters in Edge-Linear Time and Almost-Vertex-Linear Space.
Proceedings of the 2018 IEEE High Performance Extreme Computing Conference, 2018

K-truss decomposition for Scale-Free Graphs at Scale in Distributed Memory.
Proceedings of the 2018 IEEE High Performance Extreme Computing Conference, 2018

Investigation of Spectral Clustering for Signed Graph Matrix Representations.
Proceedings of the 2018 IEEE High Performance Extreme Computing Conference, 2018

Computing Exact Vertex Eccentricity on Massive-Scale Distributed Graphs.
Proceedings of the IEEE International Conference on Cluster Computing, 2018

2017
Numerical Methods for Gremban's Expansion of Signed Graphs.
SIAM J. Sci. Comput., 2017

Spectral partitioning with blends of eigenvectors.
J. Complex Networks, 2017

Graph Ranking Guarantees for Numerical Approximations to Katz Centrality.
Proceedings of the International Conference on Computational Science, 2017

An ensemble framework for detecting community changes in dynamic networks.
Proceedings of the 2017 IEEE High Performance Extreme Computing Conference, 2017

Towards Practical and Robust Labeled Pattern Matching in Trillion-Edge Graphs.
Proceedings of the 2017 IEEE International Conference on Cluster Computing, 2017

2016
Detecting highly cyclic structure with complex eigenpairs.
CoRR, 2016

2011
Iterant recombination with one-norm minimization for multilevel Markov chain algorithms via the ellipsoid method.
Comput. Vis. Sci., 2011

Multilevel Aggregation Methods for Small-World Graphs with Application to Random-Walk Ranking.
Comput. Informatics, 2011

Top-level acceleration of adaptive algebraic multilevel methods for steady-state solution to Markov chains.
Adv. Comput. Math., 2011

2010
Recursively Accelerated Multilevel Aggregation for Markov Chains.
SIAM J. Sci. Comput., 2010

Algebraic Multigrid for Markov Chains.
SIAM J. Sci. Comput., 2010

Smoothed Aggregation Multigrid for Markov Chains.
SIAM J. Sci. Comput., 2010

Towards Adaptive Smoothed Aggregation (AlphaSA) for Nonsymmetric Problems.
SIAM J. Sci. Comput., 2010

Nested Iteration and First-Order System Least Squares for Incompressible, Resistive Magnetohydrodynamics.
SIAM J. Sci. Comput., 2010

Further results on error estimators for local refinement with first-order system least squares (FOSLS).
Numer. Linear Algebra Appl., 2010

Multilevel Space-Time Aggregation for Bright Field Cell Microscopy Segmentation and Tracking.
Int. J. Biomed. Imaging, 2010

2008
A generalized eigensolver based on smoothed aggregation (GES-SA) for initializing smoothed aggregation (SA) multigrid.
Numer. Linear Algebra Appl., 2008


  Loading...