1. Parallel Batch-Dynamic Graph Connectivity
2. Umut A Acar , Daniel Anderson , Guy E Blelloch , Laxman Dhulipala , and Sam Westrick . 2020 . Parallel batch-dynamic trees via change propagation . In European Symposium on Algorithms (ESA). Umut A Acar, Daniel Anderson, Guy E Blelloch, Laxman Dhulipala, and Sam Westrick. 2020. Parallel batch-dynamic trees via change propagation. In European Symposium on Algorithms (ESA).
3. Alok Aggarwal and Jeffrey S . Vitter . 1988 . The Input/Output Complexity of Sorting and Related Problems. Commun. ACM 31, 9 (1988). Alok Aggarwal and Jeffrey S. Vitter. 1988. The Input/Output Complexity of Sorting and Related Problems. Commun. ACM 31, 9 (1988).
4. Kunal Agrawal , Jeremy T. Fineman , Kefu Lu , Brendan Sheridan , Jim Sukha , and Robert Utterback . 2014 . Provably Good Scheduling for Parallel Programs That Use Data Structures Through Implicit Batching. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). Kunal Agrawal, Jeremy T. Fineman, Kefu Lu, Brendan Sheridan, Jim Sukha, and Robert Utterback. 2014. Provably Good Scheduling for Parallel Programs That Use Data Structures Through Implicit Batching. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA).
5. Zafar Ahmad , Rezaul Chowdhury , Rathish Das , Pramod Ganapathi , Aaron Gregory , and Mohammad Mahdi Javanmard . 2021 . Low-Span Parallel Algorithms for the Binary-Forking Model. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 22--34 . Zafar Ahmad, Rezaul Chowdhury, Rathish Das, Pramod Ganapathi, Aaron Gregory, and Mohammad Mahdi Javanmard. 2021. Low-Span Parallel Algorithms for the Binary-Forking Model. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 22--34.