| Computing by programmable particles JJ Daymude, K Hinnenthal, AW Richa, C Scheideler Distributed computing by mobile entities: current research in moving and …, 2019 | 54 | 2019 |
| Forming tile shapes with simple robots R Gmyr, K Hinnenthal, I Kostitsyna, F Kuhn, D Rudolph, C Scheideler, ... Natural Computing 19 (2), 375-390, 2020 | 35 | 2020 |
| Distributed computation in node-capacitated networks J Augustine, M Ghaffari, R Gmyr, K Hinnenthal, C Scheideler, F Kuhn, J Li The 31st ACM Symposium on Parallelism in Algorithms and Architectures, 69-79, 2019 | 34 | 2019 |
| Shortest paths in a hybrid network model J Augustine, K Hinnenthal, F Kuhn, C Scheideler, P Schneider Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 32 | 2020 |
| Distributed monitoring of network properties: The power of hybrid networks R Gmyr, K Hinnenthal, C Scheideler, C Sohler 44th International Colloquium on Automata, Languages, and Programming (ICALP …, 2017 | 28 | 2017 |
| Shape recognition by a finite automaton robot R Gmyr, K Hinnenthal, I Kostitsyna, F Kuhn, D Rudolph, C Scheideler 43rd International Symposium on Mathematical Foundations of Computer Science …, 2018 | 26 | 2018 |
| Convex hull formation for programmable matter JJ Daymude, R Gmyr, K Hinnenthal, I Kostitsyna, C Scheideler, AW Richa Proceedings of the 21st International Conference on Distributed Computing …, 2020 | 25 | 2020 |
| Time-optimal construction of overlay networks T Götte, K Hinnenthal, C Scheideler, J Werthmann Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing …, 2021 | 24 | 2021 |
| Fast hybrid network algorithms for shortest paths in sparse graphs M Feldmann, K Hinnenthal, C Scheideler arXiv preprint arXiv:2007.01191, 2020 | 24 | 2020 |
| Near-shortest path routing in hybrid communication networks S Coy, A Czumaj, M Feldmann, K Hinnenthal, F Kuhn, C Scheideler, ... arXiv preprint arXiv:2202.08008, 2022 | 17 | 2022 |
| Faster construction of overlay networks T Götte, K Hinnenthal, C Scheideler International Colloquium on Structural Information and Communication …, 2019 | 11 | 2019 |
| Towards hybrid programmable matter: shape recognition, formation, and sealing algorithms for finite automaton robots J Daymunde, R Gmyr, K Hinnenthal, I Kostitsyna, F Kuhn, A Richa, ... 3rd Highlights of Algorithms conference (HALG), 2018 | 4 | 2018 |
| Shape formation in a three-dimensional model for hybrid programmable matter K Hinnenthal, D Rudolph, C Scheideler Proc. of the 36th European Workshop on Computational Geometry (EuroCG 2020), 2020 | 2 | 2020 |
| Models and algorithms for hybrid networks and hybrid programmable matter. K Hinnenthal University of Paderborn, Germany, 2021 | 1 | 2021 |
| Fast Distributed Algorithms for LP-Type Problems of Bounded Dimension (Brief Announcement) K Hinnenthal, C Scheideler, M Struijs The 31st ACM Symposium on Parallelism in Algorithms and Architectures, 393-394, 2019 | 1 | 2019 |
| Distributed Computation in the Node-Congested Clique. J Augustine, M Ghaffari, R Gmyr, K Hinnenthal, F Kuhn, J Li, C Scheideler arXiv preprint arXiv:1805.07294, 2018 | 1 | 2018 |
| Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures K Hinnenthal, D Liedtke, C Scheideler arXiv preprint arXiv:2401.17734, 2024 | | 2024 |
| Fast distributed algorithms for Lp-type problems of low dimension K Hinnenthal, C Scheideler, M Struijs 33rd International Symposium on Distributed Computing, DISC 2019, 23, 2019 | | 2019 |
| Brief announcement: fast distributed algorithms for Lp-type problems of bounded dimension K Hinnenthal, C Scheideler, M Struijs 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019 …, 2019 | | 2019 |
| Fast Distributed Algorithms for LP-Type Problems of Bounded Dimension K Hinnenthal, C Scheideler, M Struijs arXiv preprint arXiv:1904.10706, 2019 | | 2019 |
Christian ScheidelerUniversität PaderbornVerified email at upb.de
