Zobrazeno 1 - 10
of 147
pro vyhledávání: '"Pemmaraju, Sriram V"'
We present the first sublinear round algorithm for approximately sampling uniform spanning trees in the CongestedClique model of distributed computing. In particular, our algorithm requires $\~O(n^{0.658})$ rounds for sampling a spanning tree from a
Externí odkaz:
http://arxiv.org/abs/2411.13334
Autor:
Ji, Hongyan, Pemmaraju, Sriram V.
The Knowledge Till rho CONGEST model is a variant of the classical CONGEST model of distributed computing in which each vertex v has initial knowledge of the radius-rho ball centered at v. The most commonly studied variants of the CONGEST model are K
Externí odkaz:
http://arxiv.org/abs/2402.14221
Autor:
Jang, Hankyu, Lee, Sulyun, Hasan, D. M. Hasibul, Polgreen, Philip M., Pemmaraju, Sriram V., Adhikari, Bijaya
As hospitals move towards automating and integrating their computing systems, more fine-grained hospital operations data are becoming available. These data include hospital architectural drawings, logs of interactions between patients and healthcare
Externí odkaz:
http://arxiv.org/abs/2303.11563
Autor:
Pemmaraju, Sriram V., Sobel, Joshua Z.
Fast distributed algorithms that output a feasible solution for constraint satisfaction problems, such as maximal independent sets, have been heavily studied. There has been much less research on distributed sampling problems, where one wants to samp
Externí odkaz:
http://arxiv.org/abs/2303.02714
Autor:
Pai, Shreyas, Pemmaraju, Sriram V.
In this paper we present a deterministic $O(\log\log n)$-round algorithm for the 2-ruling set problem in the Massively Parallel Computation model with $\tilde{O}(n)$ memory; this algorithm also runs in $O(\log\log n)$ rounds in the Congested Clique m
Externí odkaz:
http://arxiv.org/abs/2205.12686
We study the communication cost (or message complexity) of fundamental distributed symmetry breaking problems, namely, coloring and MIS. While significant progress has been made in understanding and improving the running time of such problems, much l
Externí odkaz:
http://arxiv.org/abs/2105.08917
Autor:
Hasan, D. M. Hasibul, Rohwer, Alex, Jang, Hankyu, Herman, Ted, Polgreen, Philip M., Sewell, Daniel K., Adhikari, Bijaya, Pemmaraju, Sriram V.
COVID-19 has caused an enormous burden on healthcare facilities around the world. Cohorting patients and healthcare professionals (HCPs) into "bubbles" has been proposed as an infection-control mechanism. In this paper, we present a novel and flexibl
Externí odkaz:
http://arxiv.org/abs/2105.06278
The goal of this paper is to understand the complexity of symmetry breaking problems, specifically maximal independent set (MIS) and the closely related $\beta$-ruling set problem, in two computational models suited for large-scale graph processing,
Externí odkaz:
http://arxiv.org/abs/2105.01833
Motivated by recent progress on symmetry breaking problems such as maximal independent set (MIS) and maximal matching in the low-memory Massively Parallel Computation (MPC) model (e.g., Behnezhad et al.~PODC 2019; Ghaffari-Uitto SODA 2019), we invest
Externí odkaz:
http://arxiv.org/abs/2009.12477