Wait-free solvability of colorless tasks in anonymous shared-memory model (Q5920219): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2767287430
@@ Property / OpenAlex ID: W2767287430 / rank @@
+Normal rank
@@ Property / cites work @@
+Atomic snapshots of shared memory
@@ Property / cites work: Atomic snapshots of shared memory / rank @@
+Normal rank
@@ Property / cites work @@
+Computation in networks of passively mobile finite-state sensors
+Normal rank
@@ Property / cites work @@
+Relationships between broadcast and shared memory in reliable anonymous distributed systems
+Normal rank
@@ Property / cites work @@
+Renaming in an asynchronous environment
@@ Property / cites work: Renaming in an asynchronous environment / rank @@
+Normal rank
@@ Property / cites work @@
+Computing in totally anonymous asynchronous shared memory systems
+Normal rank
@@ Property / cites work @@
+Implementing set objects in dynamic distributed systems
+Normal rank
@@ Property / cites work @@
+Immediate atomic snapshots and fast renaming
@@ Property / cites work: Immediate atomic snapshots and fast renaming / rank @@
+Normal rank
@@ Property / cites work @@
+On the Uncontended Complexity of Anonymous Consensus
+Normal rank
@@ Property / cites work @@
+More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
+Normal rank
@@ Property / cites work @@
+Q4437126
@@ Property / cites work: Q4437126 / rank @@
+Normal rank
@@ Property / cites work @@
+Byzantine agreement with homonyms
@@ Property / cites work: Byzantine agreement with homonyms / rank @@
+Normal rank
@@ Property / cites work @@
+Reaching approximate agreement in the presence of faults
+Normal rank
@@ Property / cites work @@
+Hundreds of impossibility results for distributed computing
+Normal rank
@@ Property / cites work @@
+Impossibility of distributed consensus with one faulty process
+Normal rank
@@ Property / cites work @@
+Three-Processor Tasks Are Undecidable
@@ Property / cites work: Three-Processor Tasks Are Undecidable / rank @@
+Normal rank
@@ Property / cites work @@
+Anonymous and fault-tolerant shared-memory computing
+Normal rank
@@ Property / cites work @@
+Q5498755
@@ Property / cites work: Q5498755 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4527026
@@ Property / cites work: Q4527026 / rank @@
+Normal rank
@@ Property / cites work @@
+A classification of wait-free loop agreement tasks
+Normal rank
@@ Property / cites work @@
+The topology of shared-memory adversaries
@@ Property / cites work: The topology of shared-memory adversaries / rank @@
+Normal rank
@@ Property / cites work @@
+Simulations and reductions for colorless tasks
@@ Property / cites work: Simulations and reductions for colorless tasks / rank @@
+Normal rank
@@ Property / cites work @@
+Power and limits of distributed computing shared memory models
+Normal rank
@@ Property / cites work @@
+Computing in the Presence of Concurrent Solo Executions
+Normal rank
@@ Property / cites work @@
+The topological structure of asynchronous computability
+Normal rank
@@ Property / cites work @@
+Q4413397
@@ Property / cites work: Q4413397 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3126969
@@ Property / cites work: Q3126969 / rank @@
+Normal rank
@@ Property / cites work @@
+Distributed computability in Byzantine asynchronous systems
+Normal rank
@@ Property / cites work @@
+Wait-free algorithms for fast, long-lived renaming
+Normal rank
@@ Property / cites work @@
+Q5522742
@@ Property / cites work: Q5522742 / rank @@
+Normal rank
@@ Property / cites work @@
+Wait-free solvability of colorless tasks in anonymous shared-memory model
+Normal rank