The Complexity Gap between Consensus and Safe-Consensus

From MaRDI portal

Revision as of 03:07, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)

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

Publication:5496149

Jump to:navigation, search

DOI10.1007/978-3-319-09620-9_7zbMath1416.68083OpenAlexW2176732978MaRDI QIDQ5496149

Sergio Rajsbaum, R. Conde

Publication date: 7 August 2014

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-09620-9_7

zbMATH Keywords

Johnson graph connectivity lower bounds coalition distributed algorithms consensus wait-free computing iterated models safe-consensus

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed systems (68M14)

Related Items (4)

The solvability of consensus in iterated models extended with safe-consensus ⋮ Untangling Partial Agreement: Iterated x-consensus Simulations ⋮ A distributed computing perspective of unconditionally secure information transmission in Russian cards problems ⋮ A distributed computing perspective of unconditionally secure information transmission in Russian cards problems

This page was built for publication: The Complexity Gap between Consensus and Safe-Consensus

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5496149&oldid=30057557"