Component stability in low-space massively parallel computation (Q6126138): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q128337881, #quickstatements; #temporary_batch_1733154966341
(3 intermediate revisions by 3 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00446-024-00461-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3166172671 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Constructions of Almost k-wise Independent Random Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel algorithms for geometric graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3119175 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Steps for Parallel Query Processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the distributed Lovász local lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Edge Coloring and a Special Case of the Constructive Lovász Local Lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed algorithms for the Lovász local lemma and graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Round Compression for Parallel Matching Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of MapReduce / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Distributed Algorithm for Maximal Independent Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Use of Randomness in Local Distributed Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Degree Splitting, Edge Coloring, and Orientations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting, Searching, and Simulation in the MapReduce Framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417679 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The price of being near-sighted / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost \(k\)-wise independent sample spaces and their cryptologic applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locality in Distributed Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Parallel Algorithm for the Maximal Independent Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence classes and conditional hardness in massively parallel computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: What Can be Computed Locally? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simple distributed algorithms for sparse networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed coloring algorithms for triangle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shuffles and Circuits (On Lower Bounds for Modern Parallel Computation) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylogarithmic-time deterministic network decomposition and distributed derandomization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandomness / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128337881 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 16:58, 2 December 2024

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

    Component stability in low-space massively parallel computation (English)
    0 references
    0 references
    0 references
    0 references
    9 April 2024
    0 references
    component stability
    0 references
    massively parallel computation
    0 references
    lower bounds
    0 references
    0 references
    0 references
    0 references

    Identifiers