search result

Cover von Interactive Coding Resilient to an Unknown Number of Erasures

Interactive Coding Resilient to an Unknown Number of Erasures

Year: 2020
Media group: LIPIcs
Cover von Constant-Rate Interactive Coding Is Impossible, Even In Constant-Degree Networks

Constant-Rate Interactive Coding Is Impossible, Even In Constant-Degree Networks

Year: 2017
Media group: LIPIcs
Cover von Two for One, One for All

Two for One, One for All

Deterministic LDC-Based Robust Computation in Congested Clique
Year: 2025
Media group: LIPIcs
Cover von Interactive Coding with Unbounded Noise

Interactive Coding with Unbounded Noise

Year: 2024
Media group: LIPIcs
Cover von Beeping Shortest Paths via Hypergraph Bipartite Decomposition

Beeping Shortest Paths via Hypergraph Bipartite Decomposition

Year: 2023
Media group: LIPIcs
Cover von Near-Optimal Communication Byzantine Reliable Broadcast Under a Message Adversary

Near-Optimal Communication Byzantine Reliable Broadcast Under a Message Adversary

Year: 2025
Media group: LIPIcs
Cover von Sorting in One and Two Rounds Using t-Comparators

Sorting in One and Two Rounds Using t-Comparators

Year: 2024
Media group: LIPIcs
Cover von Content-Oblivious Leader Election on Rings

Content-Oblivious Leader Election on Rings

Year: 2024
Media group: LIPIcs
Cover von Optimal Short-Circuit Resilient Formulas

Optimal Short-Circuit Resilient Formulas

Year: 2019
Media group: LIPIcs
Cover von Making Asynchronous Distributed Computations Robust to Channel Noise

Making Asynchronous Distributed Computations Robust to Channel Noise

Year: 2018
Media group: LIPIcs
OPEN V 11.1.0.0