21:50A tight local algorithm for the minimum dominating set problem in outerplanar graphs
A 22-minute video from PODC–DISC: “A tight local algorithm for the minimum dominating set problem in outerplanar graphs”.
PODC–DISC
790 subscribers on YouTube
Shorts, livestreams, trailers and promos are never listed. Unless a curator approved this channel in full, only individually picked videos appear.
21:50
18:15Adaptive Self-Organization in Anonymous Dynamic Networks
A 18-minute video from PODC–DISC: “Adaptive Self-Organization in Anonymous Dynamic Networks”.
27:02Algorithms for the Minimum Dominating Set Problem in Bounded Arboricity Graphs
A 27-minute video from PODC–DISC: “Algorithms for the Minimum Dominating Set Problem in Bounded Arboricity Graphs”.
59:31Alkida Balliu: The Ubiquity of Δ-Coloring
A 60-minute video from PODC–DISC: “Alkida Balliu: The Ubiquity of Δ-Coloring”.
34:06Andrzej Czygrinow: Matchings and their generalizations in certain classes of sparse graphs
A 34-minute video from PODC–DISC: “Andrzej Czygrinow: Matchings and their generalizations in certain classes of sparse graphs”.
9:32BA: Accountability and Reconfiguration: Self-Healing Lattice Agreement
A 10-minute video from PODC–DISC: “BA: Accountability and Reconfiguration: Self-Healing Lattice Agreement”.
11:25BA: Auditable Register Emulations
A 11-minute video from PODC–DISC: “BA: Auditable Register Emulations”.
11:42BA: Automating and Mechanising Cutoff Proofs for Parameterized Verification of Distributed Protocols
A 12-minute video from PODC–DISC: “BA: Automating and Mechanising Cutoff Proofs for Parameterized Verification of Distributed Protocols”.
12:36BA: Communication-Efficient BFT Using Small Trusted Hardware to Tolerate Minority Corruption
A 13-minute video from PODC–DISC: “BA: Communication-Efficient BFT Using Small Trusted Hardware to Tolerate Minority Corruption”.
14:14BA: Crystalline: Fast and Memory Efficient Wait-Free Reclamation
A 14-minute video from PODC–DISC: “BA: Crystalline: Fast and Memory Efficient Wait-Free Reclamation”.
8:32BA: Design and Verification of a Logless Dynamic Reconfiguration Protocol in MongoDB Replication
A 9-minute video from PODC–DISC: “BA: Design and Verification of a Logless Dynamic Reconfiguration Protocol in MongoDB Replication”.
12:14BA: Fast Graphical Population Protocols
A 12-minute video from PODC–DISC: “BA: Fast Graphical Population Protocols”.
16:44BA: How to Trust Strangers – Composition of Byzantine Quorum Systems
A 17-minute video from PODC–DISC: “BA: How to Trust Strangers – Composition of Byzantine Quorum Systems”.
15:18BA: Local certification of graph decompositions and applications to minor-free classes
A 15-minute video from PODC–DISC: “BA: Local certification of graph decompositions and applications to minor-free classes”.
15:24BA: Memory Efficient Massively Parallel Algorithms for LCL Problems on Trees
A 15-minute video from PODC–DISC: “BA: Memory Efficient Massively Parallel Algorithms for LCL Problems on Trees”.
11:42BA: Non-blocking Dynamic Unbounded Graphs with Worst-case Amortized Bounds
A 12-minute video from PODC–DISC: “BA: Non-blocking Dynamic Unbounded Graphs with Worst-case Amortized Bounds”.
14:02BA: On Extending Brandt’s Speedup Theorem from LOCAL to Round-Based Full-Information Models
A 14-minute video from PODC–DISC: “BA: On Extending Brandt’s Speedup Theorem from LOCAL to Round-Based Full-Information Models”.
10:22BA: Ordered Reliable Broadcast and Fast Ordered Byzantine Consensus for Cryptocurrency
A 10-minute video from PODC–DISC: “BA: Ordered Reliable Broadcast and Fast Ordered Byzantine Consensus for Cryptocurrency”.
14:25BA: Persistent Software Combining
A 14-minute video from PODC–DISC: “BA: Persistent Software Combining”.
14:02BA: Probabilistic Indistinguishability and the Quality of Validity in Byzantine Agreement
A 14-minute video from PODC–DISC: “BA: Probabilistic Indistinguishability and the Quality of Validity in Byzantine Agreement”.
14:10BA: Revisiting signature-free asynchronous Byzantine consensus
A 14-minute video from PODC–DISC: “BA: Revisiting signature-free asynchronous Byzantine consensus”.
16:12BA: Simple Majority Consensus in Networks with Unreliable Communication
A 16-minute video from PODC–DISC: “BA: Simple Majority Consensus in Networks with Unreliable Communication”.
16:25BA: Sinkless orientation is hard also in the supported LOCAL model
A 16-minute video from PODC–DISC: “BA: Sinkless orientation is hard also in the supported LOCAL model”.
12:10BA: Twins: BFT Systems Made Robust
A 12-minute video from PODC–DISC: “BA: Twins: BFT Systems Made Robust”.
7:00BA: Using Nesting to Push the Limits of Transactional Data Structure Libraries
A 7-minute video from PODC–DISC: “BA: Using Nesting to Push the Limits of Transactional Data Structure Libraries”.
15:08Broadcast CONGEST Algorithms against Adversarial Edges
A 15-minute video from PODC–DISC: “Broadcast CONGEST Algorithms against Adversarial Edges”.
21:42Byzantine Consensus with Local Multicast Channels
A 22-minute video from PODC–DISC: “Byzantine Consensus with Local Multicast Channels”.
18:36Constant RMR Group Mutual Exclusion for Arbitrarily Many Processes and Sessions
A 19-minute video from PODC–DISC: “Constant RMR Group Mutual Exclusion for Arbitrarily Many Processes and Sessions”.
22:14Detectable Sequential Specifications for Recoverable Shared Objects
A 22-minute video from PODC–DISC: “Detectable Sequential Specifications for Recoverable Shared Objects”.
22:59Deterministic Distributed Algorithms and Lower Bounds in the Hybrid Model
A 23-minute video from PODC–DISC: “Deterministic Distributed Algorithms and Lower Bounds in the Hybrid Model”.
21:34Deterministic Logarithmic Completeness in the Distributed Sleeping Model
A 22-minute video from PODC–DISC: “Deterministic Logarithmic Completeness in the Distributed Sleeping Model”.
14:20Deterministic Size Discovery and Topology Recognition in Radio Networks with Short Labels
A 14-minute video from PODC–DISC: “Deterministic Size Discovery and Topology Recognition in Radio Networks with Short Labels”.
24:50Efficient CONGEST Algorithms for the Lovász Local Lemma
A 25-minute video from PODC–DISC: “Efficient CONGEST Algorithms for the Lovász Local Lemma”.
15:42Extension-Based Proofs for Synchronous Message Passing
A 16-minute video from PODC–DISC: “Extension-Based Proofs for Synchronous Message Passing”.
26:43Fast Arrays: Atomic Arrays with Constant Time Initialization
A 27-minute video from PODC–DISC: “Fast Arrays: Atomic Arrays with Constant Time Initialization”.
21:53Fast Nonblocking Persistence for Concurrent Data Structures
A 22-minute video from PODC–DISC: “Fast Nonblocking Persistence for Concurrent Data Structures”.