The following pages link to Danny Dolev (Q269513):
Displaying 40 items.
- On the security of public key protocols (Q3968876) (← links)
- Determinism vs. Nondeterminism in Multiparty Communication Complexity (Q4015973) (← links)
- A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment (Q4031320) (← links)
- Perfectly secure message transmission (Q4033834) (← links)
- (Q4195947) (← links)
- (Q4232880) (← links)
- Atomic snapshots of shared memory (Q4271088) (← links)
- Bounded Concurrent Time-Stamping (Q4337631) (← links)
- Sharing memory robustly in message-passing systems (Q4369859) (← links)
- Dynamic fault-tolerant clock synchronization (Q4369860) (← links)
- (Q4413425) (← links)
- (Q4437123) (← links)
- Nonmalleable Cryptography (Q4442845) (← links)
- (Q4457215) (← links)
- Nonmalleable Cryptography (Q4507357) (← links)
- Fault Identification Via Nonparametric Belief Propagation (Q4572979) (← links)
- On distributed algorithms in a broadcast domain (Q4630276) (← links)
- Using AVL trees for fault-tolerant group key management (Q4707226) (← links)
- The Distributed Firing Squad Problem (Q4729333) (← links)
- (Q4734746) (← links)
- An efficient algorithm for byzantine agreement without authentication (Q4745252) (← links)
- “Tri, Tri Again”: Finding Triangles and Small Subgraphs in a Distributed Setting (Q4909412) (← links)
- (Q4967183) (← links)
- Communication Complexity of Byzantine Agreement, Revisited (Q5145228) (← links)
- Implementing Mediators with Asynchronous Cheap Talk (Q5145262) (← links)
- Early-deciding consensus is expensive (Q5176104) (← links)
- Distributed computing meets game theory (Q5177264) (← links)
- Self-stabilizing byzantine agreement (Q5177275) (← links)
- Self-stabilization of Byzantine Protocols (Q5307032) (← links)
- Observable clock synchronization extended abstract (Q5361419) (← links)
- Dynamic voting for consistent primary components (Q5361467) (← links)
- Stateless Computation (Q5368996) (← links)
- Lower Bounds on Implementing Robust and Resilient Mediators (Q5445512) (← links)
- The Building Blocks of Consensus (Q5445738) (← links)
- Principles of Distributed Systems (Q5466237) (← links)
- Fault-tolerant algorithms for tick-generation in asynchronous logic (Q5501934) (← links)
- Principles of Distributed Systems (Q5713668) (← links)
- Revisiting Asynchronous Fault Tolerant Computation with Optimal Resilience (Q5855217) (← links)
- Asynchronous resource discovery (Q5892139) (← links)
- Asynchronous resource discovery (Q5920575) (← links)
