No. Title Author Year
1 Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts Anagnostides, Ioannis et al. 2022
2 Near-Optimal Schedules for Simultaneous Multicasts Haeupler, Bernhard et al. 2021
3 The Quest for Universally-Optimal Distributed Algorithms (Invited Talk) Haeupler, Bernhard 2021
4 Computation-Aware Data Aggregation Haeupler, Bernhard et al. 2020
5 Erasure Correction for Noisy Radio Networks Censor-Hillel, Keren et al. 2019
6 Optimal Strategies for Patrolling Fences Haeupler, Bernhard et al. 2019
7 Algorithms for Noisy Broadcast with Erasures Grossman, Ofer et al. 2018
8 Allocate-On-Use Space Complexity of Shared-Memory Algorithms Aspnes, James et al. 2018
9 Faster Distributed Shortest Path Approximations via Shortcuts Haeupler, Bernhard et al. 2018
10 Making Asynchronous Distributed Computations Robust to Channel Noise Censor-Hillel, Keren et al. 2018
11 Synchronization Strings: Channel Simulations and Interactive Coding for Insertions and Deletions Haeupler, Bernhard et al. 2018
12 Synchronization Strings: List Decoding for Insertions and Deletions Haeupler, Bernhard et al. 2018
13 Communication with Partial Noiseless Feedback Haeupler, Bernhard et al. 2015
Current Page :
Number of result pages: 1
Number of documents: 13

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI