On the complexity of asynchronous agreement against powerful adversaries

We introduce new techniques for proving lower bounds on the running time of randomized algorithms for asynchronous agreement against powerful adversaries. In particular, we define a strongly adaptive adversary that is computationally unbounded and has a limited ability to corrupt a dynamic subset of...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Distributed computing Ročník 28; číslo 6; s. 377 - 389
Hlavní autoři:	Lewko, Allison, Lewko, Mark
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Berlin/Heidelberg Springer Berlin Heidelberg 01.12.2015 Springer Nature B.V
Témata:	Adaptive algorithms Algorithms Computer Communication Networks Computer Hardware Computer Science Computer Systems Organization and Communication Networks Crashes Expenses Failure Lower bounds Processors Running Software Engineering/Programming and Operating Systems Theory of Computation Partial Execution Byzantine Agreement Faulty Processor Crash Failure Message Buffer
ISSN:	0178-2770, 1432-0452
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!