No. Title Author Year
1 Front Matter, Table of Contents, Preface, Conference Organization Oshman, Rotem 2023
2 LIPIcs, Volume 281, DISC 2023, Complete Volume Oshman, Rotem 2023
3 Resilience of 3-Majority Dynamics to Non-Uniform Schedulers Meir, Uri et al. 2023
4 The Communication Complexity of Set Intersection Under Product Distributions Oshman, Rotem et al. 2023
5 Explicit Space-Time Tradeoffs for Proof Labeling Schemes in Graphs with Small Separators Fischer, Orr et al. 2022
6 Quantum Distributed Algorithms for Detection of Cliques Censor-Hillel, Keren et al. 2022
7 Front Matter, Table of Contents, Preface, Conference Organization Bramas, Quentin et al. 2021
8 LIPIcs, Volume 184, OPODIS 2020, Complete Volume Bramas, Quentin et al. 2021
9 Truthful Information Dissemination in General Asynchronous Networks Solodkin, Lior et al. 2021
10 Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs Censor-Hillel, Keren et al. 2020
11 A Distributed Algorithm for Directed Minimum-Weight Spanning Tree Fischer, Orr et al. 2019
12 On the Computational Power of Radio Channels Braverman, Mark et al. 2019
13 Sublinear-Time Distributed Algorithms for Detecting Small Cliques and Even Cycles Eden, Talya et al. 2019
14 Distributed Approximate Maximum Matching in the CONGEST Model Ahmadi, Mohamad et al. 2018
15 Lower Bounds for Subgraph Detection in the CONGEST Model Gonen, Tzlil et al. 2018
16 On the Communication Complexity of Key-Agreement Protocols Haitner, Iftach et al. 2018
17 Interactive Compression for Multi-Party Protocol Kol, Gillat et al. 2017
18 Three Notes on Distributed Property Testing Even, Guy et al. 2017
Current Page :
Number of result pages: 1
Number of documents: 18

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