OPODIS 2020 - Locally Solvable Tasks and the Limitations of Valency Arguments

(19:43)

OPODIS 2020 - Fast and Space Efficient Queues via Relaxation

(28:)

OPODIS 2020 - Optimal Resilience in Systems that Mix Shared Memory and Message Passing

(16:4)

OPODIS 2020 - Self-stabilizing Byzantine-resilient communication in dynamic networks

(20:22)

OPODIS 2020 - Secured Distributed Algorithms without Hardness Assumptions

(20:1econd)

OPODIS 2020 - CSR++: A Fast, Scalable, Update-Friendly Graph Data Structure

(27:15)

OPODIS 2020 - Broadcasting with mobile agents in dynamic networks

(15:44)

OPODIS 2020 - Fast Byzantine SGD

(18:39)

OPODIS 2020 - Broadcasting Competitively against Adaptive Adversary in Multi channel Radio Networks

(23:5)

OPODIS 2020 - Heterogeneous Paxos

(24:16)

OPODIS 2020 - Information Theoretic HotStuff

(21:51)

OPODIS 2020 - Fast Deterministic Algorithms for Highly Dynamic Networks

(22:20)

OPODIS 2020 - Dynamic Byzantine Reliable Broadcast

(23:5)

OPODIS 2020 - Rational Behaviors in Committee-Based Blockchains

(31)

OPODIS 2020 - Multi-Threshold Asynchronous Reliable Broadcast and Consensus

(25:19)

OPODIS 2020 - Decentralized Runtime Enforcement of Message Sequences in Message Based Systems

(21:3)

OPODIS 2020 - Distributed Distance Approximation

(20:53)

OPODIS 2020 - On Broadcast in Generalized Network and Adversarial Models

(23:39)

OPODIS 2020 - Monitoring Distributed Systems under Partial Synchrony

(25:23)