The following pages link to Danny Dolev (Q269513):
Displaying 50 items.
- HEX: scaling honeycombs is easier than scaling clock trees (Q269518) (← links)
- Consensus algorithms with one-bit messages (Q757011) (← links)
- Synchronous counting and computational algorithm design (Q896024) (← links)
- On the possibility and impossibility of achieving clock synchronization (Q1077930) (← links)
- Cheating husbands and other stories: A case study of knowledge, action, and communication (Q1087024) (← links)
- Efficient fault-tolerant routings in networks (Q1091360) (← links)
- A new look at fault-tolerant network routing (Q1099603) (← links)
- Fault-tolerant critical section management in asynchronous environments (Q1183601) (← links)
- Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement (Q1187030) (← links)
- Commutation relations of slices characterize some synchronization primitives (Q1245691) (← links)
- Commutation properties and generating sets characterize slices of various synchronization primitives (Q1256315) (← links)
- Increasing the resilience of distributed and replicated database systems (Q1278039) (← links)
- Fault tolerance in the cardiac ganglion of the lobster (Q1302356) (← links)
- Compact routing messages in self-healing trees (Q1686108) (← links)
- Atomic broadcast: From simple message diffusion to Byzantine agreement (Q1891143) (← links)
- Revisiting asynchronous fault tolerant computation with optimal resilience (Q2166363) (← links)
- Internet resiliency to attacks and failures under BGP policy routing (Q2509333) (← links)
- Rigorously modeling self-stabilizing fault-tolerant circuits: an ultra-robust clocking scheme for systems-on-chip (Q2637656) (← links)
- Synchronous Byzantine agreement with expected \(O(1)\) rounds, expected \(O(n^2)\) communication, and optimal resilience (Q2656912) (← links)
- Communication complexity of Byzantine agreement, revisited (Q2689834) (← links)
- Neighborhood preserving hashing and approximate queries (Q2784503) (← links)
- No justified complaints: on fair sharing of multiple resources (Q2826045) (← links)
- An optimal self-stabilizing firing squad (Q2903524) (← links)
- Distributed Protocols for Leader Election: A Game-Theoretic Perspective (Q2920964) (← links)
- Fast self-stabilizing byzantine tolerant digital clock synchronization (Q2934362) (← links)
- OCD (Q2934363) (← links)
- An almost-surely terminating polynomial protocol for asynchronous byzantine agreement with optimal resilience (Q2934364) (← links)
- Byzantine Agreement with Optimal Early Stopping, Optimal Resilience and Polynomial Complexity (Q2941556) (← links)
- Authenticated Algorithms for Byzantine Agreement (Q3036697) (← links)
- (Q3128884) (← links)
- On the security of ping-pong protocols (Q3323837) (← links)
- (Q3325624) (← links)
- Scheduling precedence graphs of bounded height (Q3339283) (← links)
- Renaming in an asynchronous environment (Q3477940) (← links)
- Early stopping in Byzantine agreement (Q3495618) (← links)
- On Self-stabilizing Synchronous Actions Despite Byzantine Attacks (Q3523208) (← links)
- Constant-Space Localized Byzantine Consensus (Q3540228) (← links)
- MULAN: Multi-Level Adaptive Network Filter (Q3556608) (← links)
- On the Security of Ping-Pong Protocols (Q3661462) (← links)
- (Q3678667) (← links)
- Profile Scheduling of Opposing Forests and Level Orders (Q3698629) (← links)
- Bounds for Width Two Branching Programs (Q3718153) (← links)
- Scheduling Flat Graphs (Q3741045) (← links)
- Reaching approximate agreement in the presence of faults (Q3763582) (← links)
- Bounds on information exchange for Byzantine agreement (Q3766834) (← links)
- On the minimal synchronism needed for distributed consensus (Q3768381) (← links)
- (Q3789080) (← links)
- Some Geometry for General River Routing (Q3821579) (← links)
- An O(n log n) unidirectional distributed algorithm for extrema finding in a circle (Q3956422) (← links)
- The Byzantine generals strike again (Q3959472) (← links)
