On the complexity of asynchronous agreement against powerful adversaries (Q901869): Difference between revisions

← Older edit

@@ description / en / description / en @@
+scientific article; zbMATH DE number 6410099
@@ Property / zbMATH Open document ID @@
+.68304
@@ Property / zbMATH Open document ID: 1323.68304 / rank @@
+Normal rank
@@ Property / DOI @@
+.1145/2484239.2484250
@@ Property / DOI: 10.1145/2484239.2484250 / rank @@
+Normal rank
@@ Property / published in @@
+Proceedings of the 2013 ACM symposium on Principles of distributed computing
+Normal rank
@@ Property / publication date @@
+March 2015Timestamp +2015-03-02T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2015-03-02T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 2 March 2015 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+W15
@@ Property / Mathematics Subject Classification ID: 68W15 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6410099
@@ Property / zbMATH DE Number: 6410099 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1993638644
@@ Property / OpenAlex ID: W1993638644 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+consensus
@@ Property / zbMATH Keywords: consensus / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+randomized algorithms
@@ Property / zbMATH Keywords: randomized algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+The correctness proof of Ben-Or's randomized consensus algorithm
+Normal rank
@@ Property / cites work @@
+Q4004078
@@ Property / cites work: Q4004078 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for distributed coin-flipping and randomized consensus
+Normal rank
@@ Property / cites work @@
+Tight bounds for asynchronous randomized consensus
+Normal rank
@@ Property / cites work @@
+Lower Bounds for Randomized Consensus under a Weak Adversary
+Normal rank
@@ Property / cites work @@
+A tight lower bound for randomized synchronous consensus
+Normal rank
@@ Property / cites work @@
+Byzantine agreement in the full-information model in O(log n) rounds
+Normal rank
@@ Property / cites work @@
+The Byzantine Generals Problem
@@ Property / cites work: The Byzantine Generals Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
+Normal rank
@@ Property / cites work @@
+Fast asynchronous Byzantine agreement with optimal resilience
+Normal rank
@@ Property / cites work @@
+Impossibility of distributed consensus with one faulty process
+Normal rank
@@ Property / cites work @@
+Q3579423
@@ Property / cites work: Q3579423 / rank @@
+Normal rank
@@ Property / cites work @@
+From Almost Everywhere to Everywhere: Byzantine Agreement with $\tilde{O}(n^{3/2})$ Bits
+Normal rank
@@ Property / cites work @@
+Breaking the             <i>O</i>             (             <i>n</i>             <sup>2</sup>             ) bit barrier
+Normal rank
@@ Property / cites work @@
+Byzantine agreement in polynomial expected time
@@ Property / cites work: Byzantine agreement in polynomial expected time / rank @@
+Normal rank
@@ Property / cites work @@
+Scalable leader election
@@ Property / cites work: Scalable leader election / rank @@
+Normal rank
@@ Property / cites work @@
+Reaching Agreement in the Presence of Faults
@@ Property / cites work: Reaching Agreement in the Presence of Faults / rank @@
+Normal rank
@@ Property / cites work @@
+The Contest between Simplicity and Efficiency in Asynchronous Byzantine Agreement
+Normal rank
@@ Property / cites work @@
+Q4409132
@@ Property / cites work: Q4409132 / rank @@
+Normal rank
@@ Property / cites work @@
+Concentration of measure and isoperimetric inequalities in product spaces
+Normal rank