Shreyas Pai

Generating author description...

All published works

Action	Title	Year	Authors
+	Faster Set Cover in the MPC Model	2025	Hongyan Ji Shreyas Pai Sriram V. Pemmaraju Joshua Z. Sobel
+ PDF Chat	Fully Dynamic Adversarially Robust Correlation Clustering in Polylogarithmic Update Time	2024	Vladimir Braverman Prathamesh Dharangutte Shreyas Pai Vihan Shah Chen Wang
+	Online Locality Meets Distributed Quantum Computing	2024	Amirreza Akbari Xavier Coiteux-Roy Francesco d’Amore François Le Gall Henrik Lievonen Darya Melnyk Augusto Modanese Shreyas Pai Marc-Olivier Renou Václav Rozhoň
+ PDF Chat	Adaptive Massively Parallel Coloring in Sparse Graphs	2024	Rustam Latypov Yannic Maus Shreyas Pai Jara Uitto
+ PDF Chat	Adaptive Massively Parallel Coloring in Sparse Graphs	2024	Rustam Latypov Yannic Maus Shreyas Pai Jara Uitto
+	Fast Dynamic Programming in Trees in the MPC Model	2023	Chetan Gupta Rustam Latypov Yannic Maus Shreyas Pai Simo Särkkä Jan Studený Jukka Suomela Jara Uitto Hossein Vahidi
+ PDF Chat	Sinkless Orientation Made Simple	2023	Alkida Balliu Janne H. Korhonen Fabian Kühn Henrik Lievonen Dennis Olivetti Shreyas Pai Ami Paz Joel Rybicki Stefan Schmid Jan Studený
+	Fast Dynamic Programming in Trees in the MPC Model	2023	Chetan Gupta Rustam Latypov Yannic Maus Shreyas Pai Simo Särkkä Jan Studený Jukka Suomela Jara Uitto Hossein Vahidi
+	Time and Space Optimal Massively Parallel Algorithm for the 2-Ruling Set Problem	2023	Mélanie Cambus Fabian Kühn Shreyas Pai Jara Uitto
+	Conditionally Optimal Parallel Coloring of Forests	2023	Christoph Grunau Rustam Latypov Yannic Maus Shreyas Pai Jara Uitto
+	The Message Complexity of Distributed Graph Optimization	2023	Fabien Dufoulon Shreyas Pai Gopal Pandurangan Sriram V. Pemmaraju Peter Robinson
+ PDF Chat	Risk-aware temporal cascade reconstruction to detect asymptomatic cases	2022	Hankyu Jang Shreyas Pai Bijaya Adhikari Sriram V. Pemmaraju
+	A $(3+\varepsilon)$-Approximate Correlation Clustering Algorithm in Dynamic Streams	2022	Mélanie Cambus Shreyas Pai Jara Uitto
+	Deterministic Massively Parallel Algorithms for Ruling Sets	2022	Shreyas Pai Sriram V. Pemmaraju
+	Distributed Reconfiguration of Spanning Trees	2022	Siddharth Gupta Manish Kumar Shreyas Pai
+ PDF Chat	Near-optimal clustering in the k-machine model	2021	Sayan Bandyapadhyay Tanmay Inamdar Shreyas Pai Sriram V. Pemmaraju
+	Can We Break Symmetry with o(m) Communication?	2021	Shreyas Pai Gopal Pandurangan Sriram V. Pemmaraju Peter Robinson
+	Can We Break Symmetry with o(m) Communication?	2021	Shreyas Pai Gopal Pandurangan Sriram V. Pemmaraju Peter Robinson
+	Sinkless Orientation Made Simple	2021	Alkida Balliu Janne H. Korhonen Fabian Kühn Henrik Lievonen Dennis Olivetti Shreyas Pai Ami Paz Joel Rybicki Stefan Schmid Jan Studený
+ PDF Chat	Distributed Approximation on Power Graphs	2020	Reuven Bar-Yehuda Keren Censor-Hillel Yannic Maus Shreyas Pai Sriram V. Pemmaraju
+	Distributed Approximation on Power Graphs	2020	Reuven Bar-Yehuda Keren Censor-Hillel Yannic Maus Shreyas Pai Sriram V. Pemmaraju
+	Sample-and-Gather: Fast Ruling Set Algorithms in the Low-Memory MPC Model	2020	Kishore Kothapalli Shreyas Pai Sriram V. Pemmaraju
+	Distributed Approximation on Power Graphs	2020	Reuven Bar-Yehuda Keren Censor-Hillel Yannic Maus Shreyas Pai Sriram V. Pemmaraju
+	A Constant Approximation for Colorful k-Center	2019	Sayan Bandyapadhyay Tanmay Inamdar Shreyas Pai Kasturi Varadarajan
+ PDF Chat	Connectivity Lower Bounds in Broadcast Congested Clique	2019	Shreyas Pai Sriram V. Pemmaraju
+	Connectivity Lower Bounds in Broadcast Congested Clique	2019	Shreyas Pai Sriram V. Pemmaraju
+	A Constant Approximation for Colorful k-Center	2019	Sayan Bandyapadhyay Tanmay Inamdar Shreyas Pai Kasturi Varadarajan
+ PDF Chat	Near-Optimal Clustering in the k-machine model	2018	Sayan Bandyapadhyay Tanmay Inamdar Shreyas Pai Sriram V. Pemmaraju
+	Large-Scale Distributed Algorithms for Facility Location with Outliers	2018	Tanmay Inamdar Shreyas Pai Sriram V. Pemmaraju
+	Near-Optimal Clustering in the $k$-machine model	2017	Sayan Bandyapadhyay Tanmay Inamdar Shreyas Pai Sriram V. Pemmaraju
+	Symmetry Breaking in the Congest Model: Time- and Message-Efficient Algorithms for Ruling Sets	2017	Shreyas Pai Gopal Pandurangan Sriram V. Pemmaraju Talal Riaz Peter Robinson
+	Near-Optimal Clustering in the $k$-machine model	2017	Sayan Bandyapadhyay Tanmay Inamdar Shreyas Pai Sriram V. Pemmaraju

Common Coauthors

Coauthor	Papers Together
Sriram V. Pemmaraju	18
Jara Uitto	9
Yannic Maus	8
Tanmay Inamdar	7
Sayan Bandyapadhyay	6
Jukka Suomela	5
Rustam Latypov	5
Peter Robinson	4
Jan Studený	4
Gopal Pandurangan	4
Reuven Bar-Yehuda	3
Keren Censor-Hillel	3
Fabian Kühn	3
Henrik Lievonen	3
Janne H. Korhonen	2
Mélanie Cambus	2
Ami Paz	2
Alkida Balliu	2
Dennis Olivetti	2
Stefan Schmid	2
Simo Särkkä	2
Hossein Vahidi	2
Chetan Gupta	2
Joel Rybicki	2
Kasturi Varadarajan	2
Kishore Kothapalli	1
Talal Riaz	1
Fabien Dufoulon	1
Christoph Grunau	1
Darya Melnyk	1
Augusto Modanese	1
François Le Gall	1
Vihan Shah	1
Amirreza Akbari	1
Marc-Olivier Renou	1
Joshua Z. Sobel	1
Vladimir Braverman	1
Hankyu Jang	1
Prathamesh Dharangutte	1
Siddharth Gupta	1
Hongyan Ji	1
Chen Wang	1
Bijaya Adhikari	1
Xavier Coiteux-Roy	1
Francesco d’Amore	1
Václav Rozhoň	1
Manish Kumar	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	Polylogarithmic-time deterministic network decomposition and distributed derandomization	2020	Václav Rozhoň Mohsen Ghaffari	6
+	Fast Distributed Algorithms for Connectivity and MST in Large Graphs	2016	Gopal Pandurangan Peter Robinson Michele Scquizzato	4
+ PDF Chat	Sorting, Searching, and Simulation in the MapReduce Framework	2011	Michael T. Goodrich Nodari Sitchinava Qin Zhang	4
+ PDF Chat	Fast clustering using MapReduce	2011	Alina Ene Sungjin Im Benjamin Moseley	3
+ PDF Chat	All-Distances Sketches, Revisited: HIP Estimators for Massive Graphs Analysis	2015	Edith Cohen	3
+ PDF Chat	On Derandomizing Local Distributed Algorithms	2018	Mohsen Ghaffari David G. Harris Fabian Kühn	3
+	Massively Parallel Algorithms and Hardness for Single-Linkage Clustering Under $\ell_p$-Distances	2017	Grigory Yaroslavtsev Adithya Vadapalli	3
+ PDF Chat	On the complexity of local distributed graph problems	2017	Mohsen Ghaffari Fabian Kühn Yannic Maus	3
+	Tight Bounds for Distributed Graph Computations.	2016	Gopal Pandurangan Peter Robinson Michele Scquizzato	2
+ PDF Chat	Distributed Verification and Hardness of Distributed Approximation	2012	Atish Das Sarma Stephan Holzer Liah Kor Amos Korman Danupon Nanongkai Gopal Pandurangan David Peleg Roger Wattenhofer	2
+ PDF Chat	Construction and Impromptu Repair of an MST in a Distributed Network with o(m) Communication	2015	Valerie King Shay Kutten Mikkel Thorup	2
+ PDF Chat	Round compression for parallel matching algorithms	2018	Artur Czumaj Jakub Łącki Aleksander Mądry Slobodan Mitrović Krzysztof Onak Piotr Sankowski	2
+	A fast and simple randomized parallel algorithm for the maximal independent set problem	1986	Noga Alon László Babai Alon Itai	2
+	Distributed verification and hardness of distributed approximation	2011	Atish Das Sarma Stephan Holzer Liah Kor Amos Korman Danupon Nanongkai Gopal Pandurangan David Peleg Roger Wattenhofer	2
+ PDF Chat	Efficient randomized distributed coloring in CONGEST	2021	Magnús M. Halldórsson Fabian Kühn Yannic Maus Tigran Tonoyan	2
+ PDF Chat	Parallel Graph Connectivity in Log Diameter Rounds	2018	Alexandr Andoni Zhao Song Clifford Stein Zhengyu Wang Peilin Zhong	2
+	Lessons from the Congested Clique applied to MapReduce	2015	James W. Hegeman Sriram V. Pemmaraju	2
+ PDF Chat	A time- and message-optimal distributed algorithm for minimum spanning trees	2017	Gopal Pandurangan Peter Robinson Michele Scquizzato	2
+	A simple parallel algorithm for the maximal independent set problem	1985	Michael Luby	2
+ PDF Chat	Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks	2016	Amir Abboud Keren Censor-Hillel Seri Khoury	2
+ PDF Chat	A Simple Deterministic Distributed MST Algorithm with Near-Optimal Time and Message Complexities	2020	Michael Elkin	2
+ PDF Chat	Simple, Deterministic, Constant-Round Coloring in the Congested Clique	2020	Artur Czumaj Peter Maxwell Davies Merav Parter	2
+ PDF Chat	Proof-Labeling Schemes: Broadcast, Unicast and in Between	2017	Boaz Patt-Shamir Mor Perry	2
+ PDF Chat	Distributed Spanner Approximation	2018	Keren Censor-Hillel Michal Dory	2
+	Broadcast and minimum spanning tree with $o(m)$ messages in the asynchronous CONGEST model	2018	A. Mashreghi Valerie King	2
+ PDF Chat	Near-Constant-Time Distributed Algorithms on a Congested Clique	2014	James W. Hegeman Sriram V. Pemmaraju Vivek B. Sardeshmukh	2
+	Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover	2018	Mohsen Ghaffari Themis Gouleakis Christian Konrad Slobodan Mitrović Ronitt Rubinfeld	2
+	Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs	2019	Sepehr Assadi Xiaorui Sun Omri Weinstein	2
+ PDF Chat	Greedy and Local Ratio Algorithms in the MapReduce Model	2018	Nicholas J. A. Harvey Christopher Liaw Paul Liu	2
+ PDF Chat	Scalable Facility Location for Massive Graphs on Pregel-like Systems	2015	Kiran Garimella Gianmarco De Francisci Morales Aristides Gionis Mauro Sozio	2
+ PDF Chat	Deterministic Distributed Dominating Set Approximation in the CONGEST Model	2019	Janosch Deurer Fabian Kühn Yannic Maus	2
+ PDF Chat	Hardness of Distributed Optimization	2019	Nir Bacrach Keren Censor-Hillel Michal Dory Yuval Efron Dean Leitersdorf Ami Paz	2
+ PDF Chat	The Locality of Distributed Symmetry Breaking	2012	Leonid Barenboim Michael Elkin Seth Pettie Johannes Schneider	1
+ PDF Chat	Greedy sequential maximal independent set and matching are parallel on average	2012	Guy E. Blelloch Jeremy T. Fineman Julian Shun	1
+ PDF Chat	Predicting and controlling infectious disease epidemics using temporal networks	2013	Naoki Masuda Petter Holme	1
+ PDF Chat	Absolute humidity modulates influenza survival, transmission, and seasonality	2009	Jeffrey Shaman Melvin A. Kohn	1
+	An algorithmic approach to the Lovász local lemma. I	1991	József Beck	1
+ PDF Chat	Optimal deterministic routing and sorting on the congested clique	2013	Christoph Lenzen	1
+ PDF Chat	Skew in parallel query processing	2014	Paul Beame Paraschos Koutris Dan Suciu	1
+	What Can be Computed Locally?	1995	Moni Naor Larry Stockmeyer	1
+ PDF Chat	Computing separable functions via gossip	2006	Damon Mosk-Aoyama Devavrat Shah	1
+ PDF Chat	Constant approximation for k-median and k-means with outliers via iterative rounding	2018	Ravishankar Krishnaswamy Li Shi Sai Sandeep	1
+	Access to Data and Number of Iterations	2015	Kook Jin Ahn Sudipto Guha	1
+	Decomposition of Finite Graphs Into Forests	1964	C. St. J. A. Nash‐Williams	1
+	Approximation of Distances and Shortest Paths in the Broadcast Congest Clique	2014	Stephan Holzer Nathan Pinsker	1
+	Near-Optimal Clustering in the $k$-machine model	2017	Sayan Bandyapadhyay Tanmay Inamdar Shreyas Pai Sriram V. Pemmaraju	1
+ PDF Chat	Communication Steps for Parallel Query Processing	2017	Paul Beame Paraschos Koutris Dan Suciu	1
+	Fooling Views: A New Lower Bound Technique for Distributed Computations under Congestion	2017	Amir Abboud Keren Censor-Hillel Seri Khoury Christoph Lenzen	1
+ PDF Chat	Learning the Probability of Activation in the Presence of Latent Spreaders	2018	Maggie Makar John V. Guttag Jenna Wiens	1
+	Simple Round Compression for Parallel Vertex Cover	2017	Sepehr Assadi	1