A combinatorial characterization of the distributed 1-solvable tasks

DOI10.1016/0196-6774(90)90020-FzbMATH Open0705.68018OpenAlexW2001757616WikidataQ106202808 ScholiaQ106202808MaRDI QIDQ3485850FDOQ3485850

Authors: Ofer Biran, Shlomo Moran, Shmuel Zaks 

Publication date: 1990

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(90)90020-f

Recommendations

• scientific article; zbMATH DE number 139792
• Tight bounds on the round complexity of distributed 1-solvable tasks
• Distributed algorithms, the Lovász local lemma, and descriptive combinatorics
• Solving Distributed CSPs Probabilistically
• The communication complexity of distributed task allocation
• On the Complexity of Distributed Splitting Problems
• Descriptive Combinatorics and Distributed Algorithms
• scientific article; zbMATH DE number 67481
• Distributed CSPs by graph partitioning

zbMATH Keywords

lower boundsprotocolfaulty processordistributed agreement

Mathematics Subject Classification ID

Distributed algorithms (68W15) Network design and communication in computer systems (68M10)

Cited In (30)

• The renaming problem in shared memory systems: an introduction
• Condition-based consensus solvability: a hierarchy of conditions and efficient protocols
• Wait-free computing
• On the robustness of \(h^r_m\) (preliminary version)
• The combinatorial structure of wait-free solvable tasks (extended abstract)
• Collapsibility of read/write models using discrete Morse theory
• A distributed computing perspective of unconditionally secure information transmission in Russian cards problems
• Strongly terminating early-stopping \(k\)-set agreement in synchronous systems with general omission failures
• Untangling partial agreement: iterated \(x\)-consensus simulations
• Hundreds of impossibility results for distributed computing
• A simplicial complex model for dynamic epistemic logic to study distributed task computability
• A classification of wait-free loop agreement tasks
• A simplicial complex model for dynamic epistemic logic to study distributed task computability
• About informatics, distributed computing, and our job: a personal view
• Impure Simplicial Complexes: Complete Axiomatization
• A dynamic epistemic logic analysis of equality negation and other epistemic covering tasks
• Title not available (Why is that?)
• On the Validity of Consensus
• Title not available (Why is that?)
• Closed schedulers: a novel technique for analyzing asynchronous protocols
• From wait-free to arbitrary concurrent solo executions in colorless distributed computing
• Title not available (Why is that?)
• An Introduction to the Topological Theory of Distributed Computing with Safe-consensus
• The topology of distributed adversaries
• Communication Complexity of Wait-Free Computability in Dynamic Networks
• The minimum information about failures for solving non-local tasks in message-passing systems
• The time complexity of consensus under oblivious message adversaries
• The BG distributed simulation algorithm
• Tight bounds on the round complexity of distributed 1-solvable tasks
• An algorithmic approach to the asynchronous computability theorem

This page was built for publication: A combinatorial characterization of the distributed 1-solvable tasks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3485850)