Talks and presentations

Theoretically and Practically Efficient Parallel Algorithms for Semisort and Integer Sort

Oral presentation. Montreal, Canada. SIAM Conference on Applied and Computational Discrete Algorithms (ACDA), 2025

Parallel Point-to-Point Shortest Paths and Batch Queries

Conference talk. Portland, OR. ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2025

Parallel Contraction Hierarchies Can Be Efficient and Scalable

Oral and poster presentation. Portland, OR. Highlights of Parallel Computing (HOPC), 2025

Parallel Algorithms Can Be Provably Fast and Scalable

PASGAL: Parallel And Scalable Graph Algorithm Library

Conference talk. Nantes, France. ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2024

Parallel Integer Sort: Theory and Practice

Oral and poster presentation. Nantes, France. Highlights of Parallel Computing (HOPC), 2024
Conference talk. Edinburgh, UK. ACM Symposium on Principles and Practice of Parallel Programming (PPoPP), 2024

High-Performance and Flexible Parallel Algorithms for Semisort and Related Problems

Conference talk. Orlando, FL. ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2023

Provably Fast and Space-Efficient Parallel Biconnectivity

Oral presentation. Providence, RI. Workshop on Fusing Theory and Practice of Graph Algorithms, 2025
Poster presentation. New York, NY. Jane Street Graduate Research Fellowship Workshop, 2024
Oral and poster presentation. Orlando, FL. Highlights of Parallel Computing (HOPC), 2023
Oral presentation. Seattle, WA. SIAM Conference on Applied and Computational Discrete Algorithms (ACDA), 2023
Conference talk. Montreal, Canada. ACM Symposium on Principles and Practice of Parallel Programming (PPoPP), 2023

Efficient Stepping Algorithms and Implementations for Parallel Shortest Paths

Invited talk. Las Vegas, NV. FastCode Programming Challenge (FCPC). Workshop at PPoPP, 2025
Conference talk. Virtual. ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2021