No. Title Author Year
1 Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model Kostitsyna, Irina et al. 2022
2 Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems Daymude, Joshua J. et al. 2022
3 Near-Shortest Path Routing in Hybrid Communication Networks Coy, Sam et al. 2022
4 Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs Feldmann, Michael et al. 2021
5 The Canonical Amoebot Model: Algorithms and Concurrency Control Daymude, Joshua J. et al. 2021
6 Algorithmic Foundations of Programmable Matter (Dagstuhl Seminar 18331) Berman, Spring et al. 2019
7 Fast Distributed Algorithms for LP-Type Problems of Low Dimension Hinnenthal, Kristian et al. 2019
8 On the Complexity of Local Graph Transformations Scheideler, Christian et al. 2019
9 Shape Recognition by a Finite Automaton Robot Gmyr, Robert et al. 2018
10 Distributed Monitoring of Network Properties: The Power of Hybrid Networks Gmyr, Robert et al. 2017
11 Algorithmic Foundations of Programmable Matter (Dagstuhl Seminar 16271) Fekete, Sándor et al. 2016
12 Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures Scheideler, Christian et al. 2016
13 Algorithms for Wireless Communication (Dagstuhl Seminar 14051) Even, Guy et al. 2014
14 Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing Kolman, Petr et al. 2011
15 Stabilizing Consensus with the Power of Two Choices Doerr, Benjamin et al. 2010
Current Page :
Number of result pages: 1
Number of documents: 15


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