| 2026 | ISPDC | Distributed Maximal Independent Set Computation in Hundred Billion-Edge Graphs. | Yisheng Liu, Roger Pearce, Tahsin Reza |
| 2023 | SC | Embracing Irregular Parallelism in HPC with YGM. | Trevor Steil, Tahsin Reza, Benjamin Priest, Roger Pearce |
| 2021 | SC | 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 |
| 2020 | SC | 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. | Tahsin Reza, Matei Ripeanu, Geoffrey Sanders, Roger Pearce |
| 2020 | SIGMOD | Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees. | Tahsin Reza, Matei Ripeanu, Geoffrey Sanders, Roger Pearce |
| 2020 | SIGMOD | Towards Interactive Pattern Search in Massive Graphs. | Tahsin Reza, Matei Ripeanu, Geoffrey Sanders, Roger Pearce |
| 2018 | SC | Scale-Free Graph Processing on a NUMA Machine. | Tanuj Kr Aasawat, Tahsin Reza, Matei Ripeanu |
| 2018 | SC | PruneJuice: pruning trillion-edge graphs to a precise pattern-matching solution. | Tahsin Reza, Matei Ripeanu, Nicolas Tripoul, Geoffrey Sanders, Roger Pearce |
| 2018 | SC | 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. | Nicolas Tripoul, Hassan Halawa, Tahsin Reza, Geoffrey Sanders, Roger Pearce, Matei Ripeanu |
| 2017 | CLUSTER | Towards Practical and Robust Labeled Pattern Matching in Trillion-Edge Graphs. | Tahsin Reza, Christine Klymko, Matei Ripeanu, Geoffrey Sanders, Roger A. Pearce |