No. Title Author Year
1 From Big Data Theory to Big Data Practice (Dagstuhl Seminar 23071) Farach-Colton, Martin et al. 2023
2 List Defective Colorings: Distributed Algorithms and Applications Fuchs, Marc et al. 2023
3 On the Node-Averaged Complexity of Locally Checkable Problems on Trees Balliu, Alkida et al. 2023
4 Time and Space Optimal Massively Parallel Algorithm for the 2-Ruling Set Problem Cambus, Mélanie et al. 2023
5 Deterministic Distributed Symmetry Breaking at the Example of Distributed Graph Coloring (Invited Talk) Kuhn, Fabian 2022
6 Distributed CONGEST Approximation of Weighted Vertex Covers and Matchings Faour, Salwa et al. 2022
7 Improved Distributed Fractional Coloring Algorithms Balliu, Alkida et al. 2022
8 Near-Shortest Path Routing in Hybrid Communication Networks Coy, Sam et al. 2022
9 Routing Schemes and Distance Oracles in the Hybrid Model Kuhn, Fabian et al. 2022
10 Approximating Bipartite Minimum Vertex Cover in the CONGEST Model Faour, Salwa et al. 2021
11 Coloring Fast Without Learning Your Neighbors' Colors Halldórsson, Magnús M. et al. 2020
12 Distributed Maximum Matching Verification in CONGEST Ahmadi, Mohamad et al. 2020
13 Concurrent Distributed Serving with Mobile Servers Ghodselahi, Abdolhamid et al. 2019
14 Optimal Strategies for Patrolling Fences Haeupler, Bernhard et al. 2019
15 Sublinear-Time Distributed Algorithms for Detecting Small Cliques and Even Cycles Eden, Talya et al. 2019
16 Brief Announcement: Local Distributed Algorithms in Highly Dynamic Networks Bamberger, Philipp et al. 2018
17 Broadcasting in an Unreliable SINR Model Kuhn, Fabian et al. 2018
18 Derandomizing Distributed Algorithms with Small Messages: Spanners and Dominating Set Ghaffari, Mohsen et al. 2018
19 Distributed Approximate Maximum Matching in the CONGEST Model Ahmadi, Mohamad et al. 2018
20 Distributed MST and Broadcast with Fewer Messages, and Faster Gossiping Ghaffari, Mohsen et al. 2018
21 Shape Recognition by a Finite Automaton Robot Gmyr, Robert et al. 2018
22 An Efficient Communication Abstraction for Dense Wireless Networks Halldórsson, Magnús M. et al. 2017
23 Dynamic Analysis of the Arrow Distributed Directory Protocol in General Networks Ghodselahi, Abdolhamid et al. 2017
24 Front Matter, Table of Contents, Preface, Organization, List of Authors Chatzigiannakis, Ioannis et al. 2017
25 Improved Distributed Degree Splitting and Edge Coloring Ghaffari, Mohsen et al. 2017
26 LIPIcs, Volume 80, ICALP'17, Complete Volume Chatzigiannakis, Ioannis et al. 2017
27 Distributed Sparse Cut Approximation Kuhn, Fabian et al. 2016
28 The Cost of Global Broadcast in Dynamic Radio Networks Ahmadi, Mohamad et al. 2016
29 Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time Kuhn, Fabian 2009
30 Taming Dynamic and Selfish Peers Schmid, Stefan et al. 2006
Current Page :
Number of result pages: 1
Number of documents: 30

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