Tight bounds for shared memory systems accessed by Byzantine processes (Q1953641): Difference between revisions

@@ Property / DOI @@
-.1007/s00446-005-0125-8
@@ Property / DOI: 10.1007/s00446-005-0125-8 / rank @@
-Normal rank
@@ Property / cites work @@
+Computing with faulty shared objects
@@ Property / cites work: Computing with faulty shared objects / rank @@
+Normal rank
@@ Property / cites work @@
+Q2784326
@@ Property / cites work: Q2784326 / rank @@
+Normal rank
@@ Property / cites work @@
+Wait-free Byzantine consensus.
@@ Property / cites work: Wait-free Byzantine consensus. / rank @@
+Normal rank
@@ Property / cites work @@
+Contention in shared memory algorithms
@@ Property / cites work: Contention in shared memory algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+On the space complexity of randomized synchronization
+Normal rank
@@ Property / cites work @@
+Impossibility of distributed consensus with one faulty process
+Normal rank
@@ Property / cites work @@
+Q4860774
@@ Property / cites work: Q4860774 / rank @@
+Normal rank
@@ Property / cites work @@
+Randomized wait-free concurrent objects (extended abstract)
+Normal rank
@@ Property / cites work @@
+Fault-tolerant wait-free shared objects
@@ Property / cites work: Fault-tolerant wait-free shared objects / rank @@
+Normal rank
@@ Property / cites work @@
+An Optimistic Approach to Lock-Free FIFO Queues
@@ Property / cites work: An Optimistic Approach to Lock-Free FIFO Queues / rank @@
+Normal rank
@@ Property / cites work @@
+Q2766890
@@ Property / cites work: Q2766890 / rank @@
+Normal rank
@@ Property / cites work @@
+A simple proof of a simple consensus algorithm
@@ Property / cites work: A simple proof of a simple consensus algorithm / rank @@
+Normal rank
@@ Property / DBLP publication ID @@
+journals/dc/AlonMRTW05
@@ Property / DBLP publication ID: journals/dc/AlonMRTW05 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S00446-005-0125-8
@@ Property / DOI: 10.1007/S00446-005-0125-8 / rank @@
+Normal rank