DOCSLIB.ORG
Sign Up
Log In
Upload
Search
Sign Up
Log In
Upload
Home
» Tags
» Danny Dolev
Danny Dolev
Kein Folientitel
2011 Edsger W. Dijkstra Prize in Distributed Computing
R S S M : 20 Y A
On the Minimal Synchronism Needed for Distributed Consensus
Chapter on Distributed Computing
Table of Contents
The Quorum Deployment Problem (Extended Abstract)
Communication Complexity of Byzantine Agreement, Revisited
Near-Optimal Self-Stabilising Counting and Firing Squads
Byzantine Agreement with Less Communication: Recent Advances
On the Minimal Synchronism Needed for Distributed Consensus
Synchronous Counting and Computational Algorithm Design
On the Deterministic Gathering of Mobile Agents Sébastien Bouchard
Synchronous Byzantine Agreement with Expected O(1) Rounds, Expected O(N2) Communication, and Optimal Resilience
Fault-Tolerant Algorithms for Tick-Generation in Asynchronous Logic: Robust Pulse Generation
Byzantine Agreement with Less Communication: Recent Advances 1
Distributed Computing Column
PODC 2013 Program
Top View
Kein Folientitel
Supplemental Material for CORE Ranking Application for the International Symposium on Distributed Computing (DISC)
Optimal Communication Complexity of Authenticated Byzantine Agreement
Randomized Protocols for Asynchronous Consensus
