Equivalence classes and conditional hardness in massively parallel computations

The Massively Parallel Computation (MPC) model serves as a common abstraction of many modern large-scale data processing frameworks, and has been receiving increasingly more attention over the past few years, especially in the context of classical graph problems. So far, the only way to argue lower...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Distributed computing Ročník 35; číslo 2; s. 165 - 183
Hlavní autoři:	Nanongkai, Danupon, Scquizzato, Michele
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Berlin/Heidelberg Springer Berlin Heidelberg 01.04.2022 Springer Nature B.V
Témata:	Algorithms Complex networks Complexity Complexity class Computational complexity Computer Communication Networks Computer Hardware Computer Science Computer Systems Organization and Communication Networks Conditional hardness Data handling Data processing Equivalence Equivalence classes Fine grained Fine-grained complexity Graph theory Hardness Large-scale data processing Low bound Lower bounds Massively Parallel Computation Massively parallels Parallel Computation Parallel computation model Parallel processing Robustness Shortest-path problems Software Engineering/Programming and Operating Systems Theory of Computation Fine-grained complexity Massively Parallel Computation Conditional hardness
ISSN:	0178-2770, 1432-0452, 1432-0452
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!