@misc{64783,
author = {{Berger, Thilo }},
title = {{{Comparing Existing Methods to Efficiently Place Drones to Connect Isolated Communication Clusters}}},
year = {{2026}},
}
@article{65733,
abstract = {{Abstract
In this paper, we study the computation of shortest paths within the
geometric amoebot model
, a commonly used model for programmable matter. Shortest paths are essential for various tasks and therefore have been heavily investigated in many different contexts. We consider the
reconfigurable circuit extension
of the model where the amoebot structure is able to interconnect amoebots by so-called circuits. These circuits permit the instantaneous transmission of simple signals between connected amoebots. We propose distributed algorithms for the
shortest path forest problem
where, given a set of
k
sources and a set of
$$\ell $$
ℓ
destinations, the amoebot structure has to compute a forest that connects each destination to its closest source on a shortest path. Our main results are two algorithms for hole-free structures. The first algorithm constructs a shortest path tree for a single source within
$$O(\log \ell )$$
O
(
log
ℓ
)
rounds, and the second algorithm a shortest path forest for an arbitrary number of sources within
$$O(\log n \log ^2 k)$$
O
(
log
n
log
2
k
)
rounds. The former algorithm also provides an
O
(1) rounds solution for the
single pair shortest path problem
(SPSP) and an
$$O(\log n)$$
O
(
log
n
)
rounds solution for the
single source shortest path problem
(SSSP) since these problems are special cases of the considered problem. Then, we adapt the latter algorithm to an offset version of the problem. This allows us to solve the problem for amoebot structures with holes within
$$O(h \log ^3 n)$$
O
(
h
log
3
n
)
rounds w.h.p. where
h
denotes the number of holes.
}},
author = {{Padalkin, Andreas and Scheideler, Christian}},
issn = {{0178-2770}},
journal = {{Distributed Computing}},
number = {{2}},
publisher = {{Springer Science and Business Media LLC}},
title = {{{Polylogarithmic time algorithms for shortest path forests in programmable matter}}},
doi = {{10.1007/s00446-026-00505-2}},
volume = {{39}},
year = {{2026}},
}
@inproceedings{66603,
author = {{Dou, Jinfeng and Götte, Thorsten and Hillebrandt, Henning and Scheideler, Christian and Werthmann, Julian}},
booktitle = {{Lecture Notes in Computer Science}},
isbn = {{9783032264640}},
issn = {{0302-9743}},
publisher = {{Springer Nature Switzerland}},
title = {{{Fast Distributed Computation of Compact Routing Schemes}}},
doi = {{10.1007/978-3-032-26465-7_19}},
year = {{2026}},
}
@inproceedings{66602,
author = {{Augustine, John and Hillebrandt, Henning and Kumar, Manish and Scheideler, Christian and Werthmann, Julian}},
booktitle = {{Proceedings of the ACM Symposium on Principles of Distributed Computing}},
publisher = {{ACM}},
title = {{{Supervised Distributed Computing: Efficiency and Robustness under a Majority of Adversarial Workers}}},
doi = {{10.1145/3796701.3815939}},
year = {{2026}},
}
@misc{59624,
author = {{Showmik, Md Jannatul Baki}},
title = {{{Enhancing Blockchain Efficiency via Median Rule}}},
year = {{2025}},
}
@inproceedings{62285,
abstract = {{The sliding square model is a widely used abstraction for studying self-reconfigurable robotic systems, where modules are square-shaped robots that move by sliding or rotating over one another. In this paper, we propose a novel distributed algorithm that enables a group of modules to reconfigure into a rhombus shape, starting from an arbitrary side-connected configuration. It is connectivity-preserving and operates under minimal assumptions: one leader module, common chirality, constant memory per module, and visibility and communication restricted to immediate neighbors. Unlike prior work, which relaxes the original sliding square move-set, our approach uses the unmodified move-set, addressing the additional challenge of handling locked configurations. Our algorithm is sequential in nature and operates with a worst-case time complexity of O(n^2) rounds, which is optimal for sequential algorithms. To improve runtime, we introduce two parallel variants of the algorithm. Both rely on a spanning tree data structure, allowing modules to make decisions based on local connectivity. Our experimental results show a significant speedup for the first variant, and a linear average runtime for the second variant, which is worst-case optimal for parallel algorithms.}},
author = {{Kostitsyna, Irina and Liedtke, David Jan and Scheideler, Christian}},
booktitle = {{Stabilization, Safety, and Security of Distributed Systems}},
editor = {{Bonomi, Silvia and Mandal, Partha Sarathi and Robinson, Peter and Sharma, Gokarna and Tixeuil, Sebastien}},
isbn = {{9783032111265}},
issn = {{0302-9743}},
location = {{Kathmandu}},
pages = {{325--342}},
publisher = {{Springer Nature Switzerland}},
title = {{{Invited Paper: Distributed Rhombus Formation of Sliding Squares}}},
doi = {{10.1007/978-3-032-11127-2_26}},
year = {{2025}},
}
@article{64098,
author = {{Scheideler, Christian and Padalkin, Andreas and Kumar, Manish}},
journal = {{Reconfiguration and locomotion with joint movements in the amoebot model. Auton. Robots 49(3): 22 (2025)}},
title = {{{Reconfiguration and locomotion with joint movements in the amoebot model. Auton. Robots 49(3): 22 (2025)}}},
year = {{2025}},
}
@inproceedings{64094,
author = {{Scheideler, Christian and Artmann, Matthias and Maurer, Tobias and Padalkin, Andreas and Warner, Daniel}},
title = {{{AmoebotSim 2.0: A Visual Simulation Environment for the Amoebot Model with Reconfigurable Circuits and Joint Movements (Media Exposition). }}},
year = {{2025}},
}
@book{64099,
editor = {{Scheideler, Christian and Meeks, Kitty}},
title = {{{4th Symposium on Algorithmic Foundations of Dynamic Networks.}}},
year = {{2025}},
}
@inproceedings{64097,
author = {{Scheideler, Christian and Artmann, Matthias and Padalkin, Andreas}},
title = {{{On the Shape Containment Problem Within the Amoebot Model with Reconfigurable Circuits. }}},
year = {{2025}},
}
@inproceedings{64095,
author = {{Scheideler, Christian and Augustine , John and Werthmann, Julian}},
title = {{{Supervised Distributed Computing. }}},
year = {{2025}},
}
@article{62051,
author = {{Hinnenthal, Kristian and Liedtke, David Jan and Scheideler, Christian}},
issn = {{0304-3975}},
journal = {{Theoretical Computer Science}},
publisher = {{Elsevier BV}},
title = {{{Efficient shape formation by 3D hybrid programmable matter: An algorithm for low diameter intermediate structures}}},
doi = {{10.1016/j.tcs.2025.115552}},
volume = {{1057}},
year = {{2025}},
}
@misc{62247,
author = {{Werner, Felix}},
title = {{{Monoton erreichbarer Delaunaygraph}}},
year = {{2025}},
}
@misc{52318,
author = {{Dorociak, Svitlana}},
title = {{{Implementierung eines Algorithmus zur motivbasierten Schnitt-Sparsifizierung}}},
year = {{2024}},
}
@misc{53374,
author = {{De Groote, Carsten}},
title = {{{A Dispersion Algorithm for Robot Swarms Inside Polygonal Boundary Shapes}}},
year = {{2024}},
}
@misc{53373,
author = {{Doddegowda, Rajesh}},
title = {{{Optimal Drone Strategies For Packet Delivery}}},
year = {{2024}},
}
@misc{53372,
author = {{Thakur, Heena}},
title = {{{Evaluating the Implications}}},
year = {{2024}},
}
@misc{55002,
author = {{Delgado Steuter, Dominik}},
title = {{{Realizing Concurrency on Top of the Microkernel seL4 via Improved Threads }}},
year = {{2024}},
}
@misc{55003,
author = {{Artmann, Matthias}},
title = {{{On the Shape Containment Problem within the Amoebot Model with Reconfigurable Circuits}}},
year = {{2024}},
}
@misc{55092,
author = {{Eranki, Varun Maitreya}},
title = {{{Fever: Optimal Responsive View Synchronisation}}},
year = {{2024}},
}