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

← Older edit Newer 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