Shreyas Pai | DeepAI

DeepAI AI Chat

Featured Co-authors

Simo Särkkä
65 publications
Fabian Kuhn
43 publications
Peter Robinson
33 publications
Yannic Maus
30 publications
Christoph Grunau
28 publications
Keren Censor-Hillel
28 publications
Jukka Suomela
26 publications
Chetan Gupta
26 publications
Jara Uitto
24 publications
Sayan Bandyapadhyay
22 publications
Manish Kumar
22 publications

∙ 08/01/2023

Conditionally Optimal Parallel Coloring of Forests

We show the first conditionally optimal deterministic algorithm for 3-co...

0 Christoph Grunau, et al. ∙

∙ 06/01/2023

Time and Space Optimal Massively Parallel Algorithm for the 2-Ruling Set Problem

In this work, we present a constant-round algorithm for the 2-ruling set...

0 Mélanie Cambus, et al. ∙

∙ 05/05/2023

Fast Dynamic Programming in Trees in the MPC Model

We present a deterministic algorithm for solving a wide range of dynamic...

0 Chetan Gupta, et al. ∙

∙ 11/03/2022

Distributed Reconfiguration of Spanning Trees

In a reconfiguration problem, given a problem and two feasible solutions...

0 Siddharth Gupta, et al. ∙

∙ 05/25/2022

Deterministic Massively Parallel Algorithms for Ruling Sets

In this paper we present a deterministic O(loglog n)-round algorithm for...

0 Shreyas Pai, et al. ∙

∙ 05/16/2022

A Parallel Algorithm for (3 + ε)-Approximate Correlation Clustering

Grouping together similar elements in datasets is a common task in data ...

0 Mélanie Cambus, et al. ∙

∙ 05/19/2021

Can We Break Symmetry with o(m) Communication?

We study the communication cost (or message complexity) of fundamental d...

0 Shreyas Pai, et al. ∙

∙ 09/26/2020

Sample-and-Gather: Fast Ruling Set Algorithms in the Low-Memory MPC Model

Motivated by recent progress on symmetry breaking problems such as maxim...

0 Kishore Kothapalli, et al. ∙

∙ 06/06/2020

Distributed Approximation on Power Graphs

We investigate graph problems in the following setting: we are given a g...

0 Reuven Bar-Yehuda, et al. ∙

∙ 07/21/2019

A Constant Approximation for Colorful k-Center

In this paper, we consider the colorful k-center problem, which is a gen...

0 Sayan Bandyapadhyay, et al. ∙

∙ 05/22/2019

Connectivity Lower Bounds in Broadcast Congested Clique

We prove three new lower bounds for graph connectivity in the 1-bit broa...

0 Shreyas Pai, et al. ∙

∙ 11/15/2018

Large-Scale Distributed Algorithms for Facility Location with Outliers

This paper presents fast, distributed, O(1)-approximation algorithms for...

0 Tanmay Inamdar, et al. ∙

∙ 10/23/2017

Near-Optimal Clustering in the k-machine model

The clustering problem, in its many variants, has numerous applications ...

0 Sayan Bandyapadhyay, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world