Shreyas Pai

Orcid: 0000-0003-2409-7807

According to our database1, Shreyas Pai authored at least 24 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Online Locality Meets Distributed Quantum Computing.
CoRR, 2024

A (3 + ɛ)-Approximate Correlation Clustering Algorithm in Dynamic Streams.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Adaptive Massively Parallel Coloring in Sparse Graphs.
Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

The Message Complexity of Distributed Graph Optimization.
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2023
Conditionally Optimal Parallel Coloring of Forests.
Proceedings of the 37th International Symposium on Distributed Computing, 2023

Time and Space Optimal Massively Parallel Algorithm for the 2-Ruling Set Problem.
Proceedings of the 37th International Symposium on Distributed Computing, 2023

Fast Dynamic Programming in Trees in the MPC Model.
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

Sinkless Orientation Made Simple.
Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

2022
Near-optimal clustering in the <i>k</i>-machine model.
Theor. Comput. Sci., 2022

Risk-aware temporal cascade reconstruction to detect asymptomatic cases.
Knowl. Inf. Syst., 2022

Distributed Reconfiguration of Spanning Trees.
CoRR, 2022

Deterministic Massively Parallel Algorithms for Ruling Sets.
CoRR, 2022

Brief Announcement: Distributed Reconfiguration of Spanning Trees.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2022

Brief Announcement: Deterministic Massively Parallel Algorithms for Ruling Sets.
Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

2021
Can We Break Symmetry with o(m) Communication?
Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Risk-aware Temporal Cascade Reconstruction to Detect Asymptomatic Cases : For the CDC MInD Healthcare Network.
Proceedings of the IEEE International Conference on Data Mining, 2021

2020
Distributed Approximation on Power Graphs.
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

Sample-And-Gather: Fast Ruling Set Algorithms in the Low-Memory MPC Model.
Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

2019
Connectivity Lower Bounds in Broadcast Congested Clique.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

A Constant Approximation for Colorful k-Center.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018
Large-Scale Distributed Algorithms for Facility Location with Outliers.
Proceedings of the 22nd International Conference on Principles of Distributed Systems, 2018

Near-Optimal Clustering in the k-machine model.
Proceedings of the 19th International Conference on Distributed Computing and Networking, 2018

2017
Symmetry Breaking in the Congest Model: Time- and Message-Efficient Algorithms for Ruling Sets.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

Brief Announcement: Symmetry Breaking in the CONGEST Model: Time- and Message-Efficient Algorithms for Ruling Sets.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017


  Loading...