One Quadrillion Triangles Queried on One Million Processors. - Roger Pearce; Trevor Steil; Benjamin W. Priest; Geoffrey Sanders (HPEC, 2019)

You've Got Mail (YGM): Building Missing Asynchronous Communication Primitives. - Benjamin Priest; Trevor Steil; Geoffrey Sanders; Roger Pearce (IPDPS Workshops, 2019)

Distributed Kronecker Graph Generation with Ground Truth of Many Graph Properties. - Trevor Steil; Benjamin W. Priest; Geoffrey Sanders; Roger Pearce; Timothy La Fond; Keita Iwabuchi (IPDPS Workshops, 2019)

Considerations for a Distributed GraphBLAS API. - Benjamin Brock; Aydin Buluç; Timothy G. Mattson; Scott McMillan; José E. Moreira; Roger Pearce; Oguz Selvitopi; Trevor Steil (IPDPS Workshops, 2020)

Kronecker Graph Generation with Ground Truth for 4-Cycles and Dense Structure in Bipartite Graphs. - Trevor Steil; Scott McMillan; Geoffrey Sanders; Roger Pearce; Benjamin Priest (IPDPS Workshops, 2020)

Towards Distributed Square Counting in Large Graphs. - Trevor Steil; Geoffrey Sanders; Roger Pearce (HPEC, 2021)

TriPoll: computing surveys of triangles in massive-scale temporal graphs with metadata. - Trevor Steil; Tahsin Reza; Keita Iwabuchi; Benjamin W. Priest; Geoffrey Sanders; Roger Pearce (SC, 2021)

Massive-Scale Distributed Triangle Computation and Applications. - Geoffrey Sanders; Roger Pearce; Benjamin W. Priest; Trevor Steil (Massive Graph Analytics, 2022)

Optimizing a Distributed Graph Data Structure for K - Path Centrality Estimation on HPC. - Lance G. Fletcher; Trevor Steil; Roger Pearce (HPEC, 2023)

Towards A Massive-scale Distributed Neighborhood Graph Construction. - Keita Iwabuchi; Trevor Steil; Benjamin Priest; Roger Pearce; Geoffrey Sanders (SC Workshops, 2023)

Embracing Irregular Parallelism in HPC with YGM. - Trevor Steil; Tahsin Reza; Benjamin Priest; Roger Pearce (SC, 2023)

Distributed approximate minimal Steiner trees with millions of seed vertices on billion-edge graphs. - Tahsin Reza; Trevor Steil; Geoffrey Sanders; Roger Pearce (J. Parallel Distributed Comput., 2023)

NEO-DNND: Communication-Optimized Distributed Nearest Neighbor Graph Construction. - Keita Iwabuchi; Trevor Steil; Benjamin W. Priest; Roger Pearce; Geoffrey Sanders (SC Workshops, 2024)

Survey-wide asteroid discovery with a high-performance computing enabled non-linear digital tracking framework. - Nathan Golovich; Trevor Steil; Alex Geringer-Sameth; Keita Iwabuchi; Ryan Dozier; Roger A. Pearce (Astron. Comput., 2025)

Scalable edge clustering of dynamic graphs via weighted line graphs. - Michael Ostroski; Geoffrey Sanders; Trevor Steil; Roger Pearce (J. Complex Networks, 2025)

Approximate Tree Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees. - Nate Veldt; Thomas Stanley; Benjamin W. Priest; Trevor Steil; Keita Iwabuchi; T. S. Jayram; Geoffrey Sanders (CoRR, 2025)