Doing-it-all with bounded work and communication (Q529041): Difference between revisions

@@ Property / author @@
-Alexander A. Schwarzmann
@@ Property / author: Alexander A. Schwarzmann / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W40658589
@@ Property / OpenAlex ID: W40658589 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.4711
@@ Property / arXiv ID: 1409.4711 / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic Task Allocation in Asynchronous Shared Memory
+Normal rank
@@ Property / cites work @@
+Explicit construction of linear sized tolerant networks
+Normal rank
@@ Property / cites work @@
+Introduction to Reliable and Secure Distributed Programming
+Normal rank
@@ Property / cites work @@
+Performing tasks on synchronous restartable message-passing processors
+Normal rank
@@ Property / cites work @@
+Q4437132
@@ Property / cites work: Q4437132 / rank @@
+Normal rank
@@ Property / cites work @@
+A robust randomized algorithm to perform independent tasks
+Normal rank
@@ Property / cites work @@
+Randomization helps to perform independent tasks reliably
+Normal rank
@@ Property / cites work @@
+Cooperative asynchronous update of shared memory
@@ Property / cites work: Cooperative asynchronous update of shared memory / rank @@
+Normal rank
@@ Property / cites work @@
+Robust gossiping with an application to consensus
@@ Property / cites work: Robust gossiping with an application to consensus / rank @@
+Normal rank
@@ Property / cites work @@
+Time and Communication Efficient Consensus for Crash Failures
+Normal rank
@@ Property / cites work @@
+Performing work in broadcast networks
@@ Property / cites work: Performing work in broadcast networks / rank @@
+Normal rank
@@ Property / cites work @@
+Collective asynchronous reading with polylogarithmic worst-case overhead
+Normal rank
@@ Property / cites work @@
+Open problems of Paul Erd�s in graph theory
@@ Property / cites work: Open problems of Paul Erd�s in graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q4427854
@@ Property / cites work: Q4427854 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4787524
@@ Property / cites work: Q4787524 / rank @@
+Normal rank
@@ Property / cites work @@
+Dealing with undependable workers in decentralized network supercomputing
+Normal rank
@@ Property / cites work @@
+Time-optimal message-efficient work performance in the presence of faults
+Normal rank
@@ Property / cites work @@
+Optimal adaptive broadcasting with a bounded fraction of faulty nodes
+Normal rank
@@ Property / cites work @@
+The communication complexity of distributed task allocation
+Normal rank
@@ Property / cites work @@
+Performing Work Efficiently in the Presence of Faults
+Normal rank
@@ Property / cites work @@
+Fault Tolerance in Networks of Bounded Degree
@@ Property / cites work: Fault Tolerance in Networks of Bounded Degree / rank @@
+Normal rank
@@ Property / cites work @@
+The Do-All problem with Byzantine processor failures
+Normal rank
@@ Property / cites work @@
+Q4252758
@@ Property / cites work: Q4252758 / rank @@
+Normal rank
@@ Property / cites work @@
+Asynchronous gossip
@@ Property / cites work: Asynchronous gossip / rank @@
+Normal rank
@@ Property / cites work @@
+Performing Dynamically Injected Tasks on Processes Prone to Crashes and Restarts
+Normal rank
@@ Property / cites work @@
+Efficient gossip and robust distributed computation
+Normal rank
@@ Property / cites work @@
+The complexity of synchronous iterative Do-All with crashes
+Normal rank
@@ Property / cites work @@
+Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups
+Normal rank
@@ Property / cites work @@
+Efficient parallel algorithms can be made robust
@@ Property / cites work: Efficient parallel algorithms can be made robust / rank @@
+Normal rank
@@ Property / cites work @@
+The Strong At-Most-Once Problem
@@ Property / cites work: The Strong At-Most-Once Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Solving the at-most-once problem with nearly optimal effectiveness
+Normal rank
@@ Property / cites work @@
+At-Most-Once Semantics in Asynchronous Shared Memory
+Normal rank
@@ Property / cites work @@
+Robust parallel computations through randomization
+Normal rank
@@ Property / cites work @@
+Performing work with asynchronous processors: Message-delay-sensitive bounds
+Normal rank
@@ Property / cites work @@
+The Byzantine Generals Problem
@@ Property / cites work: The Byzantine Generals Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Ramanujan graphs
@@ Property / cites work: Ramanujan graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Probability and Computing
@@ Property / cites work: Probability and Computing / rank @@
+Normal rank
@@ Property / cites work @@
+Sorting and Selecting in Rounds
@@ Property / cites work: Sorting and Selecting in Rounds / rank @@
+Normal rank
@@ Property / cites work @@
+Q3138972
@@ Property / cites work: Q3138972 / rank @@
+Normal rank
@@ Property / cites work @@
+Explicit Concentrators from Generalized <i>N</i>-Gons
+Normal rank
@@ Property / cites work @@
+Tolerating a linear number of faults in networks of bounded degree
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:529041