AI Chat AI Image Generator AI Video Text to Speech

Deterministic Massively Parallel Algorithms for Ruling Sets

05/25/2022

∙

by Shreyas Pai, et al.

∙

∙

In this paper we present a deterministic O(loglog n)-round algorithm for the 2-ruling set problem in the Massively Parallel Computation model with Õ(n) memory; this algorithm also runs in O(loglog n) rounds in the Congested Clique model. This is exponentially faster than the fastest known deterministic 2-ruling set algorithm for these models, which is simply the O(logΔ)-round deterministic Maximal Independent Set algorithm due to Czumaj, Davies, and Parter (SPAA 2020). Our result is obtained by derandomizing the 2-ruling set algorithm of Kothapalli and Pemmaraju (FSTTCS 2012).

Shreyas Pai
13 publications
Sriram V. Pemmaraju
10 publications

research

∙ 02/22/2018

Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover

We present O( n)-round algorithms in the Massively Parallel Computation ...

0 Mohsen Ghaffari, et al. ∙

research

∙ 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. ∙

research

∙ 12/09/2019

A Deterministic Algorithm for the MST Problem in Constant Rounds of Congested Clique

In this paper, we show that the Minimum Spanning Tree problem can be sol...

0 Krzysztof Nowicki, et al. ∙

research

∙ 07/30/2018

Guidesort: Simpler Optimal Deterministic Sorting for the Parallel Disk Model

A new algorithm, Guidesort, for sorting in the uniprocessor variant of t...

0 Torben Hagerup, et al. ∙

research

∙ 04/06/2022

Parallel, Portable Algorithms for Distance-2 Maximal Independent Set and Graph Coarsening

Given a graph, finding the distance-2 maximal independent set (MIS-2) of...

0 Brian Kelley, et al. ∙

research

∙ 04/05/2023

The Laplacian Paradigm in Deterministic Congested Clique

In this paper, we bring the techniques of the Laplacian paradigm to the ...

0 Sebatian Forster, et al. ∙

research

∙ 04/16/2019

Parallel Balanced Allocations: The Heavily Loaded Case

We study parallel algorithms for the classical balls-into-bins problem, ...

0 Christoph Lenzen, et al. ∙