Trevor Steil

21 papers A* 1A 2Journal 7Unranked 10
YearRankTypeTitle / Venue / Authors
2026 J jnl
Better Learning-Augmented Spanning Tree Algorithms via Metric Forest Completion.
CoRR
Nate Veldt, Thomas Stanley, Benjamin W. Priest, Trevor Steil, Keita Iwabuchi, T. S. Jayram, Grace J. Li, Geoffrey Sanders
2025 A* conf
Approximate Forest Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees.
ICML
Nate Veldt, Thomas Stanley, Benjamin W. Priest, Trevor Steil, Keita Iwabuchi, T. S. Jayram, Geoffrey Sanders
2025 J jnl
Approximate Tree Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees.
CoRR
Nate Veldt, Thomas Stanley, Benjamin W. Priest, Trevor Steil, Keita Iwabuchi, T. S. Jayram, Geoffrey Sanders
2025 — conf
RaNT-Graph: A Scalable Approach to Sampling Billions of Walks or Paths from Weighted Graphs.
IPDPS (Workshops)
Lance G. Fletcher, Trevor Steil, Roger Pearce
2025 J jnl
Scalable edge clustering of dynamic graphs via weighted line graphs.
J. Complex Networks
Michael Ostroski, Geoffrey Sanders, Trevor Steil, Roger Pearce
2025 J jnl
Survey-wide asteroid discovery with a high-performance computing enabled non-linear digital tracking framework.
Astron. Comput.
Nathan Golovich, Trevor Steil, Alex Geringer-Sameth, Keita Iwabuchi, Ryan Dozier, Roger A. Pearce
2024 — conf
NEO-DNND: Communication-Optimized Distributed Nearest Neighbor Graph Construction.
SC Workshops
Keita Iwabuchi, Trevor Steil, Benjamin W. Priest, Roger Pearce, Geoffrey Sanders
2023 J jnl
Distributed approximate minimal Steiner trees with millions of seed vertices on billion-edge graphs.
J. Parallel Distributed Comput.
Tahsin Reza, Trevor Steil, Geoffrey Sanders, Roger Pearce
2023 A conf
Embracing Irregular Parallelism in HPC with YGM.
SC
Trevor Steil, Tahsin Reza, Benjamin Priest, Roger Pearce
2023 — conf
Optimizing a Distributed Graph Data Structure for K - Path Centrality Estimation on HPC.
HPEC
Lance G. Fletcher, Trevor Steil, Roger Pearce
2023 J jnl
Scalable Edge Clustering of Dynamic Graphs via Weighted Line Graphs.
CoRR
Michael Ostroski, Geoffrey Sanders, Trevor Steil, Roger Pearce
2023 — conf
Towards A Massive-scale Distributed Neighborhood Graph Construction.
SC Workshops
Keita Iwabuchi, Trevor Steil, Benjamin Priest, Roger Pearce, Geoffrey Sanders
2022 — ch.
Massive-Scale Distributed Triangle Computation and Applications.
Massive Graph Analytics
Geoffrey Sanders, Roger Pearce, Benjamin W. Priest, Trevor Steil
2021 — conf
Towards Distributed Square Counting in Large Graphs.
HPEC
Trevor Steil, Geoffrey Sanders, Roger Pearce
2021 J jnl
TriPoll: Computing Surveys of Triangles in Massive-Scale Temporal Graphs with Metadata.
CoRR
Trevor Steil, Tahsin Reza, Keita Iwabuchi, Benjamin W. Priest, Geoffrey Sanders, Roger Pearce
2021 A conf
TriPoll: computing surveys of triangles in massive-scale temporal graphs with metadata.
SC
Trevor Steil, Tahsin Reza, Keita Iwabuchi, Benjamin W. Priest, Geoffrey Sanders, Roger Pearce
2020 — conf
Considerations for a Distributed GraphBLAS API.
IPDPS Workshops
Benjamin Brock, Aydin Buluç, Timothy G. Mattson, Scott McMillan, José E. Moreira, Roger Pearce, Oguz Selvitopi, Trevor Steil
2020 — conf
Kronecker Graph Generation with Ground Truth for 4-Cycles and Dense Structure in Bipartite Graphs.
IPDPS Workshops
Trevor Steil, Scott McMillan, Geoffrey Sanders, Roger Pearce, Benjamin Priest
2019 — conf
Distributed Kronecker Graph Generation with Ground Truth of Many Graph Properties.
IPDPS Workshops
Trevor Steil, Benjamin W. Priest, Geoffrey Sanders, Roger Pearce, Timothy La Fond, Keita Iwabuchi
2019 — conf
One Quadrillion Triangles Queried on One Million Processors.
HPEC
Roger Pearce, Trevor Steil, Benjamin W. Priest, Geoffrey Sanders
2019 — conf
You've Got Mail (YGM): Building Missing Asynchronous Communication Primitives.
IPDPS Workshops
Benjamin Priest, Trevor Steil, Geoffrey Sanders, Roger Pearce