Katina Russell

Orcid: 0009-0005-6230-8427

According to our database1, Katina Russell authored at least 9 papers between 2020 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Efficient Construction of Directed Hopsets and Parallel Single-source Shortest Paths (Abstract).
Proceedings of the 2023 ACM Workshop on Highlights of Parallel Computing, 2023

2022
I/O-Efficient Algorithms for Topological Sort and Related Problems.
ACM Trans. Algorithms, 2022

Self-supervised Representation Learning on Electronic Health Records with Graph Kernel Infomax.
CoRR, 2022

Parallel Shortest Paths with Negative Edge Weights.
Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

Brief Announcement: Nested Active-Time Scheduling.
Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

Nested Active-Time Scheduling.
Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

2021
Brief Announcement: An Improved Distributed Approximate Single Source Shortest Paths Algorithm.
Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

2020
Efficient construction of directed hopsets and parallel approximate shortest paths.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Improved Work Span Tradeoff for Single Source Reachability and Approximate Shortest Paths.
Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020


  Loading...