Component stability in low-space massively parallel computation (Q6126138)

From MaRDI portal

Revision as of 16:58, 2 December 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q128337881, #quickstatements; #temporary_batch_1733154966341)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article; zbMATH DE number 7829170

Language	Label	Description	Also known as
English	Component stability in low-space massively parallel computation	scientific article; zbMATH DE number 7829170

Statements

scholarly article

0 references

Component stability in low-space massively parallel computation (English)

0 references

0 references

Peter Davies-Peck

0 references

0 references

Distributed Computing

0 references

publication date

9 April 2024

0 references

zbMATH Keywords

component stability

0 references

massively parallel computation

0 references

lower bounds

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s00446-024-00461-9

0 references

Simple Constructions of Almost k-wise Independent Random Variables

0 references

Parallel algorithms for geometric graph problems

0 references

0 references

Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs

0 references

Communication Steps for Parallel Query Processing

0 references

A lower bound for the distributed Lovász local lemma

0 references

The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation

0 references

Distributed Edge Coloring and a Special Case of the Constructive Lovász Local Lemma

0 references

An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model

0 references

Distributed algorithms for the Lovász local lemma and graph coloring

0 references

Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space

0 references

Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC

0 references

Round Compression for Parallel Matching Algorithms

0 references

On the computational complexity of MapReduce

0 references

An Improved Distributed Algorithm for Maximal Independent Set

0 references

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

0 references

On the Use of Randomness in Local Distributed Graph Algorithms

0 references

Distributed Degree Splitting, Edge Coloring, and Orientations

0 references

Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation

0 references

Sorting, Searching, and Simulation in the MapReduce Framework

0 references

0 references

The price of being near-sighted

0 references

Almost \(k\)-wise independent sample spaces and their cryptologic applications

0 references

Locality in Distributed Graph Algorithms

0 references

A Simple Parallel Algorithm for the Maximal Independent Set Problem

0 references

Equivalence classes and conditional hardness in massively parallel computations

0 references

What Can be Computed Locally?

0 references

Some simple distributed algorithms for sparse networks

0 references

Distributed coloring algorithms for triangle-free graphs

0 references

Shuffles and Circuits (On Lower Bounds for Modern Parallel Computation)

0 references

Polylogarithmic-time deterministic network decomposition and distributed derandomization

0 references

Pseudorandomness

0 references

Identifiers

10.1007/s00446-024-00461-9

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6126138

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6126138&oldid=38011998"