Prati
Shreyas Pai
Shreyas Pai
Postdoctoral Researcher, Aalto University
Potvrđena adresa e-pošte na aalto.fi - Početna stranica
Naslov
Citirano
Citirano
Godina
A constant approximation for colorful k-center
S Bandyapadhyay, T Inamdar, S Pai, K Varadarajan
arXiv preprint arXiv:1907.08906, 2019
492019
Symmetry breaking in the congest model: Time-and message-efficient algorithms for ruling sets
S Pai, G Pandurangan, SV Pemmaraju, T Riaz, P Robinson
arXiv preprint arXiv:1705.07861, 2017
262017
Near-optimal clustering in the k-machine model
S Bandyapadhyay, T Inamdar, S Pai, SV Pemmaraju
Proceedings of the 19th International Conference on distributed computing …, 2018
182018
Connectivity lower bounds in broadcast congested clique
S Pai, SV Pemmaraju
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019
122019
Large-scale distributed algorithms for facility location with outliers
T Inamdar, S Pai, SV Pemmaraju
arXiv preprint arXiv:1811.06494, 2018
102018
Distributed approximation on power graphs
R Bar-Yehuda, K Censor-Hillel, Y Maus, S Pai, SV Pemmaraju
Proceedings of the 39th Symposium on Principles of Distributed Computing …, 2020
82020
Risk-aware temporal cascade reconstruction to detect asymptomatic cases
H Jang, S Pai, B Adhikari, SV Pemmaraju
Knowledge and Information Systems 64 (12), 3373-3399, 2022
7*2022
Sample-and-gather: Fast ruling set algorithms in the low-memory MPC model
K Kothapalli, S Pai, SV Pemmaraju
arXiv preprint arXiv:2009.12477, 2020
62020
Spatiotemporal clustering of in-hospital Clostridioides difficile infection
S Pai, PM Polgreen, AM Segre, DK Sewell, SV Pemmaraju
Infection Control & Hospital Epidemiology 41 (4), 418-424, 2020
62020
Deterministic Massively Parallel Algorithms for Ruling Sets
S Pai, SV Pemmaraju
arXiv preprint arXiv:2205.12686, 2022
5*2022
Can We Break Symmetry with o (m) Communication?
S Pai, G Pandurangan, SV Pemmaraju, P Robinson
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing …, 2021
42021
Sinkless Orientation Made Simple
A Balliu, JH Korhonen, F Kuhn, H Lievonen, D Olivetti, S Pai, A Paz, ...
Symposium on Simplicity in Algorithms (SOSA), 175-191, 2023
22023
Fast Dynamic Programming in Trees in the MPC Model
C Gupta, R Latypov, Y Maus, S Pai, S Särkkä, J Studený, J Suomela, ...
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and …, 2023
12023
Time and Space Optimal Massively Parallel Algorithm for the 2-Ruling Set Problem
M Cambus, F Kuhn, S Pai, J Uitto
arXiv preprint arXiv:2306.00432, 2023
12023
A (3+ ɛ)-Approximate Correlation Clustering Algorithm in Dynamic Streams
M Cambus, F Kuhn, E Lindy, S Pai, J Uitto
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024
2024
The Message Complexity of Distributed Graph Optimization
F Dufoulon, S Pai, G Pandurangan, SV Pemmaraju, P Robinson
arXiv preprint arXiv:2311.14811, 2023
2023
Conditionally Optimal Parallel Coloring of Forests
C Grunau, R Latypov, Y Maus, S Pai, J Uitto
arXiv preprint arXiv:2308.00355, 2023
2023
Distributed Reconfiguration of Spanning Trees
S Gupta, M Kumar, S Pai
arXiv preprint arXiv:2211.01725, 2022
2022
A Parallel Algorithm for -Approximate Correlation Clustering
M Cambus, S Pai, J Uitto
arXiv preprint arXiv:2205.07593, 2022
2022
On the role of congestion in distributed complexity
S Pai
University of Iowa, 2021
2021
Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.
Članci 1–20