Improved Work Span Tradeoff for Single Source Reachability and Approximate Shortest Paths. - Nairen Cao; Jeremy T. Fineman; Katina Russell (SPAA, 2020)

Efficient construction of directed hopsets and parallel approximate shortest paths. - Nairen Cao; Jeremy T. Fineman; Katina Russell (STOC, 2020)

Brief Announcement: An Improved Distributed Approximate Single Source Shortest Paths Algorithm. - Nairen Cao; Jeremy T. Fineman; Katina Russell (PODC, 2021)

Nested Active-Time Scheduling. - Nairen Cao; Jeremy T. Fineman; Shi Li 001; Julián Mestre; Katina Russell; Seeun William Umboh (ISAAC, 2022)

Brief Announcement: Nested Active-Time Scheduling. - Nairen Cao; Jeremy T. Fineman; Shi Li 001; Julián Mestre; Katina Russell; Seeun William Umboh (SPAA, 2022)

Parallel Shortest Paths with Negative Edge Weights. - Nairen Cao; Jeremy T. Fineman; Katina Russell (SPAA, 2022)

I/O-Efficient Algorithms for Topological Sort and Related Problems. - Nairen Cao; Jeremy T. Fineman; Katina Russell; Eugene Yang (ACM Trans. Algorithms, 2022)

Efficient Construction of Directed Hopsets and Parallel Single-source Shortest Paths (Abstract). - Nairen Cao; Jeremy T. Fineman; Katina Russell (HOPC@SPAA, 2023)

Self-Supervised Representation Learning on Electronic Health Records with Graph Kernel Infomax. - Hao-Ren Yao; Nairen Cao; Katina Russell; Der-Chen Chang; Ophir Frieder; Jeremy T. Fineman (ACM Trans. Comput. Heal., 2024)