OPODIS 2020 - Fast Byzantine SGD

(18:39)

OPODIS 2020 - Multi-Threshold Asynchronous Reliable Broadcast and Consensus

(25:19)

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

(23:5)

OPODIS 2020 - Maximally Resilient Replacement Paths for a Family of Product Graphs

(13:34)

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

(19:43)

OPODIS 2020 - Dynamic Byzantine Reliable Broadcast

(23:5)

OPODIS 2020 - Heterogeneous Paxos

(24:16)

OPODIS 2020 - Fast and Space Efficient Queues via Relaxation

(28:)

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 - Uniform Bipartition in Population Protocol Model with Arbitrary Communication Graphs

(23:36)

OPODIS 2020 - Distributed Distance Approximation

(20:53)

OPODIS 2020 - Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs

(25:49)

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

(16:4)

OPODIS 2020 - Fast Deterministic Algorithms for Highly Dynamic Networks

(22:20)

OPODIS 2020 - Approximate Majority With Catalytic Inputs

(25:58)

OPODIS 2020 - Byzantine Lattice Agreement in Asynchronous Message Systems

(22:40)

OPODIS 2020 - Relaxed Queues and Stacks from Read/Write Operations

(22:36)

OPODIS 2020 - Information Theoretic HotStuff

(21:51)