---
_id: '64783'
author:
- first_name: 'Thilo '
full_name: 'Berger, Thilo '
last_name: Berger
citation:
ama: Berger T. Comparing Existing Methods to Efficiently Place Drones to Connect
Isolated Communication Clusters.; 2026.
apa: Berger, T. (2026). Comparing Existing Methods to Efficiently Place Drones
to Connect Isolated Communication Clusters.
bibtex: '@book{Berger_2026, title={Comparing Existing Methods to Efficiently Place
Drones to Connect Isolated Communication Clusters}, author={Berger, Thilo }, year={2026}
}'
chicago: Berger, Thilo . Comparing Existing Methods to Efficiently Place Drones
to Connect Isolated Communication Clusters, 2026.
ieee: T. Berger, Comparing Existing Methods to Efficiently Place Drones to Connect
Isolated Communication Clusters. 2026.
mla: Berger, Thilo. Comparing Existing Methods to Efficiently Place Drones to
Connect Isolated Communication Clusters. 2026.
short: T. Berger, Comparing Existing Methods to Efficiently Place Drones to Connect
Isolated Communication Clusters, 2026.
date_created: 2026-02-27T12:16:02Z
date_updated: 2026-02-27T12:17:20Z
department:
- _id: '34'
- _id: '7'
- _id: '79'
language:
- iso: eng
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Comparing Existing Methods to Efficiently Place Drones to Connect Isolated
Communication Clusters
type: mastersthesis
user_id: '15578'
year: '2026'
...
---
_id: '65733'
abstract:
- lang: eng
text: "Abstract\r\n \r\n In
this paper, we study the computation of shortest paths within the\r\n geometric
amoebot model\r\n , 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\r\n
\ reconfigurable circuit extension\r\n
\ 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\r\n shortest path forest problem\r\n
\ where, given a set of\r\n k\r\n
\ sources and a set of\r\n \r\n
\ \r\n $$\\ell
$$\r\n \r\n
\ ℓ\r\n \r\n
\ \r\n \r\n
\ 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\r\n \r\n
\ \r\n $$O(\\log
\\ell )$$\r\n \r\n
\ \r\n O\r\n
\ (\r\n log\r\n
\ ℓ\r\n )\r\n
\ \r\n \r\n
\ \r\n \r\n
\ rounds, and the second algorithm a shortest path forest for
an arbitrary number of sources within\r\n \r\n
\ \r\n $$O(\\log
n \\log ^2 k)$$\r\n \r\n
\ \r\n O\r\n
\ (\r\n log\r\n
\ n\r\n \r\n
\ log\r\n 2\r\n
\ \r\n k\r\n
\ )\r\n \r\n
\ \r\n \r\n
\ \r\n rounds. The
former algorithm also provides an\r\n O\r\n
\ (1) rounds solution for the\r\n single
pair shortest path problem\r\n (SPSP) and an\r\n
\ \r\n \r\n
\ $$O(\\log n)$$\r\n \r\n \r\n
\ O\r\n (\r\n
\ log\r\n n\r\n
\ )\r\n \r\n
\ \r\n \r\n
\ \r\n rounds solution
for the\r\n single source shortest path problem\r\n
\ (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\r\n
\ \r\n \r\n
\ $$O(h \\log ^3 n)$$\r\n
\ \r\n
\ \r\n O\r\n
\ (\r\n h\r\n
\ \r\n log\r\n
\ 3\r\n \r\n
\ n\r\n )\r\n
\ \r\n \r\n
\ \r\n \r\n
\ rounds w.h.p. where\r\n h\r\n
\ denotes the number of holes.\r\n "
article_number: '15'
author:
- first_name: Andreas
full_name: Padalkin, Andreas
id: '88238'
last_name: Padalkin
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Padalkin A, Scheideler C. Polylogarithmic time algorithms for shortest path
forests in programmable matter. Distributed Computing. 2026;39(2). doi:10.1007/s00446-026-00505-2
apa: Padalkin, A., & Scheideler, C. (2026). Polylogarithmic time algorithms
for shortest path forests in programmable matter. Distributed Computing,
39(2), Article 15. https://doi.org/10.1007/s00446-026-00505-2
bibtex: '@article{Padalkin_Scheideler_2026, title={Polylogarithmic time algorithms
for shortest path forests in programmable matter}, volume={39}, DOI={10.1007/s00446-026-00505-2},
number={215}, journal={Distributed Computing}, publisher={Springer Science and
Business Media LLC}, author={Padalkin, Andreas and Scheideler, Christian}, year={2026}
}'
chicago: Padalkin, Andreas, and Christian Scheideler. “Polylogarithmic Time Algorithms
for Shortest Path Forests in Programmable Matter.” Distributed Computing
39, no. 2 (2026). https://doi.org/10.1007/s00446-026-00505-2.
ieee: 'A. Padalkin and C. Scheideler, “Polylogarithmic time algorithms for shortest
path forests in programmable matter,” Distributed Computing, vol. 39, no.
2, Art. no. 15, 2026, doi: 10.1007/s00446-026-00505-2.'
mla: Padalkin, Andreas, and Christian Scheideler. “Polylogarithmic Time Algorithms
for Shortest Path Forests in Programmable Matter.” Distributed Computing,
vol. 39, no. 2, 15, Springer Science and Business Media LLC, 2026, doi:10.1007/s00446-026-00505-2.
short: A. Padalkin, C. Scheideler, Distributed Computing 39 (2026).
date_created: 2026-05-29T12:11:32Z
date_updated: 2026-05-29T12:13:09Z
department:
- _id: '34'
- _id: '7'
- _id: '79'
doi: 10.1007/s00446-026-00505-2
intvolume: ' 39'
issue: '2'
language:
- iso: eng
publication: Distributed Computing
publication_identifier:
issn:
- 0178-2770
- 1432-0452
publication_status: published
publisher: Springer Science and Business Media LLC
status: public
title: Polylogarithmic time algorithms for shortest path forests in programmable matter
type: journal_article
user_id: '15578'
volume: 39
year: '2026'
...
---
_id: '66603'
author:
- first_name: Jinfeng
full_name: Dou, Jinfeng
id: '92888'
last_name: Dou
- first_name: Thorsten
full_name: Götte, Thorsten
id: '34727'
last_name: Götte
- first_name: Henning
full_name: Hillebrandt, Henning
id: '74425'
last_name: Hillebrandt
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Julian
full_name: Werthmann, Julian
id: '50024'
last_name: Werthmann
citation:
ama: 'Dou J, Götte T, Hillebrandt H, Scheideler C, Werthmann J. Fast Distributed
Computation of Compact Routing Schemes. In: Lecture Notes in Computer Science.
Springer Nature Switzerland; 2026. doi:10.1007/978-3-032-26465-7_19'
apa: Dou, J., Götte, T., Hillebrandt, H., Scheideler, C., & Werthmann, J. (2026).
Fast Distributed Computation of Compact Routing Schemes. Lecture Notes in Computer
Science. https://doi.org/10.1007/978-3-032-26465-7_19
bibtex: '@inproceedings{Dou_Götte_Hillebrandt_Scheideler_Werthmann_2026, place={Cham},
title={Fast Distributed Computation of Compact Routing Schemes}, DOI={10.1007/978-3-032-26465-7_19},
booktitle={Lecture Notes in Computer Science}, publisher={Springer Nature Switzerland},
author={Dou, Jinfeng and Götte, Thorsten and Hillebrandt, Henning and Scheideler,
Christian and Werthmann, Julian}, year={2026} }'
chicago: 'Dou, Jinfeng, Thorsten Götte, Henning Hillebrandt, Christian Scheideler,
and Julian Werthmann. “Fast Distributed Computation of Compact Routing Schemes.”
In Lecture Notes in Computer Science. Cham: Springer Nature Switzerland,
2026. https://doi.org/10.1007/978-3-032-26465-7_19.'
ieee: 'J. Dou, T. Götte, H. Hillebrandt, C. Scheideler, and J. Werthmann, “Fast
Distributed Computation of Compact Routing Schemes,” 2026, doi: 10.1007/978-3-032-26465-7_19.'
mla: Dou, Jinfeng, et al. “Fast Distributed Computation of Compact Routing Schemes.”
Lecture Notes in Computer Science, Springer Nature Switzerland, 2026, doi:10.1007/978-3-032-26465-7_19.
short: 'J. Dou, T. Götte, H. Hillebrandt, C. Scheideler, J. Werthmann, in: Lecture
Notes in Computer Science, Springer Nature Switzerland, Cham, 2026.'
date_created: 2026-07-27T14:00:42Z
date_updated: 2026-07-27T14:40:21Z
department:
- _id: '79'
doi: 10.1007/978-3-032-26465-7_19
language:
- iso: eng
place: Cham
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783032264640'
- '9783032264657'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Nature Switzerland
status: public
title: Fast Distributed Computation of Compact Routing Schemes
type: conference
user_id: '74425'
year: '2026'
...
---
_id: '66602'
author:
- first_name: John
full_name: Augustine, John
last_name: Augustine
- first_name: Henning
full_name: Hillebrandt, Henning
id: '74425'
last_name: Hillebrandt
- first_name: Manish
full_name: Kumar, Manish
last_name: Kumar
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Julian
full_name: Werthmann, Julian
id: '50024'
last_name: Werthmann
citation:
ama: 'Augustine J, Hillebrandt H, Kumar M, Scheideler C, Werthmann J. Supervised
Distributed Computing: Efficiency and Robustness under a Majority of Adversarial
Workers. In: Proceedings of the ACM Symposium on Principles of Distributed
Computing. ACM; 2026. doi:10.1145/3796701.3815939'
apa: 'Augustine, J., Hillebrandt, H., Kumar, M., Scheideler, C., & Werthmann,
J. (2026). Supervised Distributed Computing: Efficiency and Robustness under a
Majority of Adversarial Workers. Proceedings of the ACM Symposium on Principles
of Distributed Computing. https://doi.org/10.1145/3796701.3815939'
bibtex: '@inproceedings{Augustine_Hillebrandt_Kumar_Scheideler_Werthmann_2026, title={Supervised
Distributed Computing: Efficiency and Robustness under a Majority of Adversarial
Workers}, DOI={10.1145/3796701.3815939},
booktitle={Proceedings of the ACM Symposium on Principles of Distributed Computing},
publisher={ACM}, author={Augustine, John and Hillebrandt, Henning and Kumar, Manish
and Scheideler, Christian and Werthmann, Julian}, year={2026} }'
chicago: 'Augustine, John, Henning Hillebrandt, Manish Kumar, Christian Scheideler,
and Julian Werthmann. “Supervised Distributed Computing: Efficiency and Robustness
under a Majority of Adversarial Workers.” In Proceedings of the ACM Symposium
on Principles of Distributed Computing. ACM, 2026. https://doi.org/10.1145/3796701.3815939.'
ieee: 'J. Augustine, H. Hillebrandt, M. Kumar, C. Scheideler, and J. Werthmann,
“Supervised Distributed Computing: Efficiency and Robustness under a Majority
of Adversarial Workers,” 2026, doi: 10.1145/3796701.3815939.'
mla: 'Augustine, John, et al. “Supervised Distributed Computing: Efficiency and
Robustness under a Majority of Adversarial Workers.” Proceedings of the ACM
Symposium on Principles of Distributed Computing, ACM, 2026, doi:10.1145/3796701.3815939.'
short: 'J. Augustine, H. Hillebrandt, M. Kumar, C. Scheideler, J. Werthmann, in:
Proceedings of the ACM Symposium on Principles of Distributed Computing, ACM,
2026.'
date_created: 2026-07-27T13:56:01Z
date_updated: 2026-07-27T14:39:53Z
department:
- _id: '79'
doi: 10.1145/3796701.3815939
language:
- iso: eng
publication: Proceedings of the ACM Symposium on Principles of Distributed Computing
publication_status: published
publisher: ACM
status: public
title: 'Supervised Distributed Computing: Efficiency and Robustness under a Majority
of Adversarial Workers'
type: conference
user_id: '74425'
year: '2026'
...
---
_id: '59624'
author:
- first_name: Md Jannatul Baki
full_name: Showmik, Md Jannatul Baki
last_name: Showmik
citation:
ama: Showmik MJB. Enhancing Blockchain Efficiency via Median Rule.; 2025.
apa: Showmik, M. J. B. (2025). Enhancing Blockchain Efficiency via Median Rule.
bibtex: '@book{Showmik_2025, title={Enhancing Blockchain Efficiency via Median Rule},
author={Showmik, Md Jannatul Baki}, year={2025} }'
chicago: Showmik, Md Jannatul Baki. Enhancing Blockchain Efficiency via Median
Rule, 2025.
ieee: M. J. B. Showmik, Enhancing Blockchain Efficiency via Median Rule.
2025.
mla: Showmik, Md Jannatul Baki. Enhancing Blockchain Efficiency via Median Rule.
2025.
short: M.J.B. Showmik, Enhancing Blockchain Efficiency via Median Rule, 2025.
date_created: 2025-04-22T08:24:39Z
date_updated: 2025-04-22T08:26:45Z
department:
- _id: '34'
- _id: '7'
- _id: '79'
language:
- iso: eng
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Enhancing Blockchain Efficiency via Median Rule
type: mastersthesis
user_id: '15578'
year: '2025'
...
---
_id: '62285'
abstract:
- lang: eng
text: '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:
- first_name: Irina
full_name: Kostitsyna, Irina
last_name: Kostitsyna
- first_name: David Jan
full_name: Liedtke, David Jan
id: '55557'
last_name: Liedtke
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Kostitsyna I, Liedtke DJ, Scheideler C. Invited Paper: Distributed Rhombus
Formation of Sliding Squares. In: Bonomi S, Mandal PS, Robinson P, Sharma G, Tixeuil
S, eds. Stabilization, Safety, and Security of Distributed Systems. Springer
Nature Switzerland; 2025:325-342. doi:10.1007/978-3-032-11127-2_26'
apa: 'Kostitsyna, I., Liedtke, D. J., & Scheideler, C. (2025). Invited Paper:
Distributed Rhombus Formation of Sliding Squares. In S. Bonomi, P. S. Mandal,
P. Robinson, G. Sharma, & S. Tixeuil (Eds.), Stabilization, Safety, and
Security of Distributed Systems (pp. 325–342). Springer Nature Switzerland.
https://doi.org/10.1007/978-3-032-11127-2_26'
bibtex: '@inproceedings{Kostitsyna_Liedtke_Scheideler_2025, place={Cham}, title={Invited
Paper: Distributed Rhombus Formation of Sliding Squares}, DOI={10.1007/978-3-032-11127-2_26},
booktitle={Stabilization, Safety, and Security of Distributed Systems}, publisher={Springer
Nature Switzerland}, author={Kostitsyna, Irina and Liedtke, David Jan and Scheideler,
Christian}, editor={Bonomi, Silvia and Mandal, Partha Sarathi and Robinson, Peter
and Sharma, Gokarna and Tixeuil, Sebastien}, year={2025}, pages={325–342} }'
chicago: 'Kostitsyna, Irina, David Jan Liedtke, and Christian Scheideler. “Invited
Paper: Distributed Rhombus Formation of Sliding Squares.” In Stabilization,
Safety, and Security of Distributed Systems, edited by Silvia Bonomi, Partha
Sarathi Mandal, Peter Robinson, Gokarna Sharma, and Sebastien Tixeuil, 325–42.
Cham: Springer Nature Switzerland, 2025. https://doi.org/10.1007/978-3-032-11127-2_26.'
ieee: 'I. Kostitsyna, D. J. Liedtke, and C. Scheideler, “Invited Paper: Distributed
Rhombus Formation of Sliding Squares,” in Stabilization, Safety, and Security
of Distributed Systems, Kathmandu, 2025, pp. 325–342, doi: 10.1007/978-3-032-11127-2_26.'
mla: 'Kostitsyna, Irina, et al. “Invited Paper: Distributed Rhombus Formation of Sliding
Squares.” Stabilization, Safety, and Security of Distributed Systems, edited
by Silvia Bonomi et al., Springer Nature Switzerland, 2025, pp. 325–42, doi:10.1007/978-3-032-11127-2_26.'
short: 'I. Kostitsyna, D.J. Liedtke, C. Scheideler, in: S. Bonomi, P.S. Mandal,
P. Robinson, G. Sharma, S. Tixeuil (Eds.), Stabilization, Safety, and Security
of Distributed Systems, Springer Nature Switzerland, Cham, 2025, pp. 325–342.'
conference:
end_date: 2025-10-11
location: Kathmandu
name: 27th International Symposium on Stabilization, Safety, and Security of Distributed
Systems (SSS)
start_date: 2025-10-09
date_created: 2025-11-23T21:07:12Z
date_updated: 2026-02-11T08:31:14Z
department:
- _id: '79'
doi: 10.1007/978-3-032-11127-2_26
editor:
- first_name: Silvia
full_name: Bonomi, Silvia
last_name: Bonomi
- first_name: Partha Sarathi
full_name: Mandal, Partha Sarathi
last_name: Mandal
- first_name: Peter
full_name: Robinson, Peter
last_name: Robinson
- first_name: Gokarna
full_name: Sharma, Gokarna
last_name: Sharma
- first_name: Sebastien
full_name: Tixeuil, Sebastien
last_name: Tixeuil
language:
- iso: eng
page: 325-342
place: Cham
publication: Stabilization, Safety, and Security of Distributed Systems
publication_identifier:
isbn:
- '9783032111265'
- '9783032111272'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Nature Switzerland
status: public
title: 'Invited Paper: Distributed Rhombus Formation of Sliding Squares'
type: conference
user_id: '15578'
year: '2025'
...
---
_id: '64098'
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Andreas
full_name: Padalkin, Andreas
id: '88238'
last_name: Padalkin
- first_name: Manish
full_name: Kumar, Manish
last_name: Kumar
citation:
ama: 'Scheideler C, Padalkin A, Kumar M. Reconfiguration and locomotion with joint
movements in the amoebot model. Auton. Robots 49(3): 22 (2025). Reconfiguration
and locomotion with joint movements in the amoebot model Auton Robots 49(3): 22
(2025). Published online 2025.'
apa: 'Scheideler, C., Padalkin, A., & Kumar, M. (2025). Reconfiguration and
locomotion with joint movements in the amoebot model. Auton. Robots 49(3): 22
(2025). Reconfiguration and Locomotion with Joint Movements in the Amoebot
Model. Auton. Robots 49(3): 22 (2025).'
bibtex: '@article{Scheideler_Padalkin_Kumar_2025, title={Reconfiguration and locomotion
with joint movements in the amoebot model. Auton. Robots 49(3): 22 (2025)}, journal={Reconfiguration
and locomotion with joint movements in the amoebot model. Auton. Robots 49(3):
22 (2025)}, author={Scheideler, Christian and Padalkin, Andreas and Kumar, Manish},
year={2025} }'
chicago: 'Scheideler, Christian, Andreas Padalkin, and Manish Kumar. “Reconfiguration
and Locomotion with Joint Movements in the Amoebot Model. Auton. Robots 49(3):
22 (2025).” Reconfiguration and Locomotion with Joint Movements in the Amoebot
Model. Auton. Robots 49(3): 22 (2025), 2025.'
ieee: 'C. Scheideler, A. Padalkin, and M. Kumar, “Reconfiguration and locomotion
with joint movements in the amoebot model. Auton. Robots 49(3): 22 (2025),” Reconfiguration
and locomotion with joint movements in the amoebot model. Auton. Robots 49(3):
22 (2025), 2025.'
mla: 'Scheideler, Christian, et al. “Reconfiguration and Locomotion with Joint Movements
in the Amoebot Model. Auton. Robots 49(3): 22 (2025).” Reconfiguration and
Locomotion with Joint Movements in the Amoebot Model. Auton. Robots 49(3): 22
(2025), 2025.'
short: 'C. Scheideler, A. Padalkin, M. Kumar, Reconfiguration and Locomotion with
Joint Movements in the Amoebot Model. Auton. Robots 49(3): 22 (2025) (2025).'
date_created: 2026-02-10T09:41:12Z
date_updated: 2026-02-11T09:11:49Z
department:
- _id: '34'
- _id: '7'
- _id: '79'
language:
- iso: eng
publication: 'Reconfiguration and locomotion with joint movements in the amoebot model.
Auton. Robots 49(3): 22 (2025)'
status: public
title: 'Reconfiguration and locomotion with joint movements in the amoebot model.
Auton. Robots 49(3): 22 (2025)'
type: journal_article
user_id: '15578'
year: '2025'
...
---
_id: '64094'
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Matthias
full_name: Artmann, Matthias
id: '63743'
last_name: Artmann
- first_name: 'Tobias '
full_name: 'Maurer, Tobias '
last_name: Maurer
- first_name: Andreas
full_name: Padalkin, Andreas
id: '88238'
last_name: Padalkin
- first_name: Daniel
full_name: Warner, Daniel
id: '3902'
last_name: Warner
citation:
ama: 'Scheideler C, Artmann M, Maurer T, Padalkin A, Warner D. AmoebotSim 2.0: A
Visual Simulation Environment for the Amoebot Model with Reconfigurable Circuits
and Joint Movements (Media Exposition). . In: ; 2025.'
apa: 'Scheideler, C., Artmann, M., Maurer, T., Padalkin, A., & Warner, D. (2025).
AmoebotSim 2.0: A Visual Simulation Environment for the Amoebot Model with
Reconfigurable Circuits and Joint Movements (Media Exposition). .'
bibtex: '@inproceedings{Scheideler_Artmann_Maurer_Padalkin_Warner_2025, place={SoCG
2025: 81:1-81:5}, title={AmoebotSim 2.0: A Visual Simulation Environment for the
Amoebot Model with Reconfigurable Circuits and Joint Movements (Media Exposition).
}, author={Scheideler, Christian and Artmann, Matthias and Maurer, Tobias and
Padalkin, Andreas and Warner, Daniel}, year={2025} }'
chicago: 'Scheideler, Christian, Matthias Artmann, Tobias Maurer, Andreas Padalkin,
and Daniel Warner. “AmoebotSim 2.0: A Visual Simulation Environment for the Amoebot
Model with Reconfigurable Circuits and Joint Movements (Media Exposition). .”
SoCG 2025: 81:1-81:5, 2025.'
ieee: 'C. Scheideler, M. Artmann, T. Maurer, A. Padalkin, and D. Warner, “AmoebotSim
2.0: A Visual Simulation Environment for the Amoebot Model with Reconfigurable
Circuits and Joint Movements (Media Exposition). ,” 2025.'
mla: 'Scheideler, Christian, et al. AmoebotSim 2.0: A Visual Simulation Environment
for the Amoebot Model with Reconfigurable Circuits and Joint Movements (Media
Exposition). . 2025.'
short: 'C. Scheideler, M. Artmann, T. Maurer, A. Padalkin, D. Warner, in: SoCG 2025:
81:1-81:5, 2025.'
date_created: 2026-02-10T09:01:15Z
date_updated: 2026-02-11T09:11:42Z
department:
- _id: '34'
- _id: '7'
- _id: '79'
language:
- iso: eng
place: 'SoCG 2025: 81:1-81:5'
status: public
title: 'AmoebotSim 2.0: A Visual Simulation Environment for the Amoebot Model with
Reconfigurable Circuits and Joint Movements (Media Exposition). '
type: conference
user_id: '15578'
year: '2025'
...
---
_id: '64099'
citation:
ama: Scheideler C, Meeks K, eds. 4th Symposium on Algorithmic Foundations of
Dynamic Networks.; 2025.
apa: Scheideler, C., & Meeks, K. (Eds.). (2025). 4th Symposium on Algorithmic
Foundations of Dynamic Networks.
bibtex: '@book{Scheideler_Meeks_2025, place={SAND 2025, Liverpool, UK, June 9-11,
2025. LIPIcs 330, Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title={4th
Symposium on Algorithmic Foundations of Dynamic Networks.}, year={2025} }'
chicago: Scheideler, Christian, and Kitty Meeks, eds. 4th Symposium on Algorithmic
Foundations of Dynamic Networks. SAND 2025, Liverpool, UK, June 9-11, 2025.
LIPIcs 330, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.
ieee: C. Scheideler and K. Meeks, Eds., 4th Symposium on Algorithmic Foundations
of Dynamic Networks. SAND 2025, Liverpool, UK, June 9-11, 2025. LIPIcs 330,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.
mla: Scheideler, Christian, and Kitty Meeks, editors. 4th Symposium on Algorithmic
Foundations of Dynamic Networks. 2025.
short: C. Scheideler, K. Meeks, eds., 4th Symposium on Algorithmic Foundations of
Dynamic Networks., SAND 2025, Liverpool, UK, June 9-11, 2025. LIPIcs 330, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2025.
date_created: 2026-02-10T09:49:03Z
date_updated: 2026-02-11T09:11:09Z
department:
- _id: '34'
- _id: '7'
- _id: '79'
editor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Kitty
full_name: Meeks, Kitty
last_name: Meeks
language:
- iso: eng
place: SAND 2025, Liverpool, UK, June 9-11, 2025. LIPIcs 330, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik
publication_identifier:
unknown:
- ISBN 978-3-95977-368-3
status: public
title: 4th Symposium on Algorithmic Foundations of Dynamic Networks.
type: book_editor
user_id: '15578'
year: '2025'
...
---
_id: '64097'
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Matthias
full_name: Artmann, Matthias
id: '63743'
last_name: Artmann
- first_name: Andreas
full_name: Padalkin, Andreas
id: '88238'
last_name: Padalkin
citation:
ama: 'Scheideler C, Artmann M, Padalkin A. On the Shape Containment Problem Within
the Amoebot Model with Reconfigurable Circuits. . In: ; 2025.'
apa: Scheideler, C., Artmann, M., & Padalkin, A. (2025). On the Shape Containment
Problem Within the Amoebot Model with Reconfigurable Circuits. .
bibtex: '@inproceedings{Scheideler_Artmann_Padalkin_2025, place={DISC 2025: 7:1-7:22},
title={On the Shape Containment Problem Within the Amoebot Model with Reconfigurable
Circuits. }, author={Scheideler, Christian and Artmann, Matthias and Padalkin,
Andreas}, year={2025} }'
chicago: 'Scheideler, Christian, Matthias Artmann, and Andreas Padalkin. “On the
Shape Containment Problem Within the Amoebot Model with Reconfigurable Circuits.
.” DISC 2025: 7:1-7:22, 2025.'
ieee: C. Scheideler, M. Artmann, and A. Padalkin, “On the Shape Containment Problem
Within the Amoebot Model with Reconfigurable Circuits. ,” 2025.
mla: Scheideler, Christian, et al. On the Shape Containment Problem Within the
Amoebot Model with Reconfigurable Circuits. . 2025.
short: 'C. Scheideler, M. Artmann, A. Padalkin, in: DISC 2025: 7:1-7:22, 2025.'
date_created: 2026-02-10T09:17:54Z
date_updated: 2026-02-11T09:11:19Z
department:
- _id: '34'
- _id: '7'
- _id: '79'
language:
- iso: eng
place: 'DISC 2025: 7:1-7:22'
status: public
title: 'On the Shape Containment Problem Within the Amoebot Model with Reconfigurable
Circuits. '
type: conference
user_id: '15578'
year: '2025'
...
---
_id: '64095'
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: 'John '
full_name: 'Augustine , John '
last_name: 'Augustine '
- first_name: Julian
full_name: Werthmann, Julian
id: '50024'
last_name: Werthmann
citation:
ama: 'Scheideler C, Augustine J, Werthmann J. Supervised Distributed Computing.
. In: ; 2025.'
apa: Scheideler, C., Augustine , J., & Werthmann, J. (2025). Supervised Distributed
Computing. .
bibtex: '@inproceedings{Scheideler_Augustine _Werthmann_2025, place={Euro-Par (3)
2025: 48-62}, title={Supervised Distributed Computing. }, author={Scheideler,
Christian and Augustine , John and Werthmann, Julian}, year={2025} }'
chicago: 'Scheideler, Christian, John Augustine , and Julian Werthmann. “Supervised
Distributed Computing. .” Euro-Par (3) 2025: 48-62, 2025.'
ieee: C. Scheideler, J. Augustine , and J. Werthmann, “Supervised Distributed Computing.
,” 2025.
mla: Scheideler, Christian, et al. Supervised Distributed Computing. . 2025.
short: 'C. Scheideler, J. Augustine , J. Werthmann, in: Euro-Par (3) 2025: 48-62,
2025.'
date_created: 2026-02-10T09:04:56Z
date_updated: 2026-02-11T09:11:35Z
department:
- _id: '34'
- _id: '7'
- _id: '79'
language:
- iso: eng
place: 'Euro-Par (3) 2025: 48-62'
status: public
title: 'Supervised Distributed Computing. '
type: conference
user_id: '15578'
year: '2025'
...
---
_id: '62051'
article_number: '115552'
author:
- first_name: Kristian
full_name: Hinnenthal, Kristian
id: '32229'
last_name: Hinnenthal
- first_name: David Jan
full_name: Liedtke, David Jan
id: '55557'
last_name: Liedtke
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Hinnenthal K, Liedtke DJ, Scheideler C. Efficient shape formation by 3D hybrid
programmable matter: An algorithm for low diameter intermediate structures. Theoretical
Computer Science. 2025;1057. doi:10.1016/j.tcs.2025.115552'
apa: 'Hinnenthal, K., Liedtke, D. J., & Scheideler, C. (2025). Efficient shape
formation by 3D hybrid programmable matter: An algorithm for low diameter intermediate
structures. Theoretical Computer Science, 1057, Article 115552.
https://doi.org/10.1016/j.tcs.2025.115552'
bibtex: '@article{Hinnenthal_Liedtke_Scheideler_2025, title={Efficient shape formation
by 3D hybrid programmable matter: An algorithm for low diameter intermediate structures},
volume={1057}, DOI={10.1016/j.tcs.2025.115552},
number={115552}, journal={Theoretical Computer Science}, publisher={Elsevier BV},
author={Hinnenthal, Kristian and Liedtke, David Jan and Scheideler, Christian},
year={2025} }'
chicago: 'Hinnenthal, Kristian, David Jan Liedtke, and Christian Scheideler. “Efficient
Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter
Intermediate Structures.” Theoretical Computer Science 1057 (2025). https://doi.org/10.1016/j.tcs.2025.115552.'
ieee: 'K. Hinnenthal, D. J. Liedtke, and C. Scheideler, “Efficient shape formation
by 3D hybrid programmable matter: An algorithm for low diameter intermediate structures,”
Theoretical Computer Science, vol. 1057, Art. no. 115552, 2025, doi: 10.1016/j.tcs.2025.115552.'
mla: 'Hinnenthal, Kristian, et al. “Efficient Shape Formation by 3D Hybrid Programmable
Matter: An Algorithm for Low Diameter Intermediate Structures.” Theoretical
Computer Science, vol. 1057, 115552, Elsevier BV, 2025, doi:10.1016/j.tcs.2025.115552.'
short: K. Hinnenthal, D.J. Liedtke, C. Scheideler, Theoretical Computer Science
1057 (2025).
date_created: 2025-11-03T10:19:53Z
date_updated: 2025-11-03T10:21:52Z
department:
- _id: '79'
doi: 10.1016/j.tcs.2025.115552
intvolume: ' 1057'
language:
- iso: eng
publication: Theoretical Computer Science
publication_identifier:
issn:
- 0304-3975
publication_status: published
publisher: Elsevier BV
status: public
title: 'Efficient shape formation by 3D hybrid programmable matter: An algorithm for
low diameter intermediate structures'
type: journal_article
user_id: '55557'
volume: 1057
year: '2025'
...
---
_id: '62247'
author:
- first_name: Felix
full_name: Werner, Felix
last_name: Werner
citation:
ama: Werner F. Monoton Erreichbarer Delaunaygraph.; 2025.
apa: Werner, F. (2025). Monoton erreichbarer Delaunaygraph.
bibtex: '@book{Werner_2025, title={Monoton erreichbarer Delaunaygraph}, author={Werner,
Felix}, year={2025} }'
chicago: Werner, Felix. Monoton Erreichbarer Delaunaygraph, 2025.
ieee: F. Werner, Monoton erreichbarer Delaunaygraph. 2025.
mla: Werner, Felix. Monoton Erreichbarer Delaunaygraph. 2025.
short: F. Werner, Monoton Erreichbarer Delaunaygraph, 2025.
date_created: 2025-11-19T09:13:37Z
date_updated: 2025-11-19T09:15:02Z
department:
- _id: '34'
- _id: '7'
- _id: '79'
language:
- iso: eng
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Monoton erreichbarer Delaunaygraph
type: bachelorsthesis
user_id: '15578'
year: '2025'
...
---
_id: '52318'
author:
- first_name: Svitlana
full_name: Dorociak, Svitlana
last_name: Dorociak
citation:
ama: Dorociak S. Implementierung Eines Algorithmus Zur Motivbasierten Schnitt-Sparsifizierung.;
2024.
apa: Dorociak, S. (2024). Implementierung eines Algorithmus zur motivbasierten
Schnitt-Sparsifizierung.
bibtex: '@book{Dorociak_2024, title={Implementierung eines Algorithmus zur motivbasierten
Schnitt-Sparsifizierung}, author={Dorociak, Svitlana}, year={2024} }'
chicago: Dorociak, Svitlana. Implementierung Eines Algorithmus Zur Motivbasierten
Schnitt-Sparsifizierung, 2024.
ieee: S. Dorociak, Implementierung eines Algorithmus zur motivbasierten Schnitt-Sparsifizierung.
2024.
mla: Dorociak, Svitlana. Implementierung Eines Algorithmus Zur Motivbasierten
Schnitt-Sparsifizierung. 2024.
short: S. Dorociak, Implementierung Eines Algorithmus Zur Motivbasierten Schnitt-Sparsifizierung,
2024.
date_created: 2024-03-05T12:52:59Z
date_updated: 2024-03-05T12:53:25Z
department:
- _id: '34'
- _id: '7'
- _id: '79'
language:
- iso: eng
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Implementierung eines Algorithmus zur motivbasierten Schnitt-Sparsifizierung
type: bachelorsthesis
user_id: '15578'
year: '2024'
...
---
_id: '53374'
author:
- first_name: Carsten
full_name: De Groote, Carsten
last_name: De Groote
citation:
ama: De Groote C. A Dispersion Algorithm for Robot Swarms Inside Polygonal Boundary
Shapes.; 2024.
apa: De Groote, C. (2024). A Dispersion Algorithm for Robot Swarms Inside Polygonal
Boundary Shapes.
bibtex: '@book{De Groote_2024, title={A Dispersion Algorithm for Robot Swarms Inside
Polygonal Boundary Shapes}, author={De Groote, Carsten}, year={2024} }'
chicago: De Groote, Carsten. A Dispersion Algorithm for Robot Swarms Inside Polygonal
Boundary Shapes, 2024.
ieee: C. De Groote, A Dispersion Algorithm for Robot Swarms Inside Polygonal
Boundary Shapes. 2024.
mla: De Groote, Carsten. A Dispersion Algorithm for Robot Swarms Inside Polygonal
Boundary Shapes. 2024.
short: C. De Groote, A Dispersion Algorithm for Robot Swarms Inside Polygonal Boundary
Shapes, 2024.
date_created: 2024-04-09T11:35:20Z
date_updated: 2024-04-09T11:35:41Z
department:
- _id: '34'
- _id: '7'
- _id: '79'
language:
- iso: eng
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: A Dispersion Algorithm for Robot Swarms Inside Polygonal Boundary Shapes
type: mastersthesis
user_id: '15578'
year: '2024'
...
---
_id: '53373'
author:
- first_name: Rajesh
full_name: Doddegowda, Rajesh
last_name: Doddegowda
citation:
ama: Doddegowda R. Optimal Drone Strategies For Packet Delivery.; 2024.
apa: Doddegowda, R. (2024). Optimal Drone Strategies For Packet Delivery.
bibtex: '@book{Doddegowda_2024, title={Optimal Drone Strategies For Packet Delivery},
author={Doddegowda, Rajesh}, year={2024} }'
chicago: Doddegowda, Rajesh. Optimal Drone Strategies For Packet Delivery,
2024.
ieee: R. Doddegowda, Optimal Drone Strategies For Packet Delivery. 2024.
mla: Doddegowda, Rajesh. Optimal Drone Strategies For Packet Delivery. 2024.
short: R. Doddegowda, Optimal Drone Strategies For Packet Delivery, 2024.
date_created: 2024-04-09T11:31:47Z
date_updated: 2024-04-09T11:32:20Z
department:
- _id: '34'
- _id: '7'
- _id: '79'
language:
- iso: eng
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Optimal Drone Strategies For Packet Delivery
type: mastersthesis
user_id: '15578'
year: '2024'
...
---
_id: '53372'
author:
- first_name: Heena
full_name: Thakur, Heena
last_name: Thakur
citation:
ama: Thakur H. Evaluating the Implications.; 2024.
apa: Thakur, H. (2024). Evaluating the Implications.
bibtex: '@book{Thakur_2024, title={Evaluating the Implications}, author={Thakur,
Heena}, year={2024} }'
chicago: Thakur, Heena. Evaluating the Implications, 2024.
ieee: H. Thakur, Evaluating the Implications. 2024.
mla: Thakur, Heena. Evaluating the Implications. 2024.
short: H. Thakur, Evaluating the Implications, 2024.
date_created: 2024-04-09T11:28:39Z
date_updated: 2024-04-09T11:29:24Z
department:
- _id: '34'
- _id: '7'
- _id: '79'
language:
- iso: eng
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Evaluating the Implications
type: mastersthesis
user_id: '15578'
year: '2024'
...
---
_id: '55002'
author:
- first_name: Dominik
full_name: Delgado Steuter, Dominik
last_name: Delgado Steuter
citation:
ama: Delgado Steuter D. Realizing Concurrency on Top of the Microkernel SeL4
via Improved Threads .; 2024.
apa: Delgado Steuter, D. (2024). Realizing Concurrency on Top of the Microkernel
seL4 via Improved Threads .
bibtex: '@book{Delgado Steuter_2024, title={Realizing Concurrency on Top of the
Microkernel seL4 via Improved Threads }, author={Delgado Steuter, Dominik}, year={2024}
}'
chicago: Delgado Steuter, Dominik. Realizing Concurrency on Top of the Microkernel
SeL4 via Improved Threads , 2024.
ieee: D. Delgado Steuter, Realizing Concurrency on Top of the Microkernel seL4
via Improved Threads . 2024.
mla: Delgado Steuter, Dominik. Realizing Concurrency on Top of the Microkernel
SeL4 via Improved Threads . 2024.
short: D. Delgado Steuter, Realizing Concurrency on Top of the Microkernel SeL4
via Improved Threads , 2024.
date_created: 2024-07-03T13:09:48Z
date_updated: 2024-07-03T13:11:26Z
department:
- _id: '34'
- _id: '7'
- _id: '79'
language:
- iso: eng
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: 'Realizing Concurrency on Top of the Microkernel seL4 via Improved Threads '
type: bachelorsthesis
user_id: '15578'
year: '2024'
...
---
_id: '55003'
author:
- first_name: Matthias
full_name: Artmann, Matthias
last_name: Artmann
citation:
ama: Artmann M. On the Shape Containment Problem within the Amoebot Model with
Reconfigurable Circuits.; 2024.
apa: Artmann, M. (2024). On the Shape Containment Problem within the Amoebot
Model with Reconfigurable Circuits.
bibtex: '@book{Artmann_2024, title={On the Shape Containment Problem within the
Amoebot Model with Reconfigurable Circuits}, author={Artmann, Matthias}, year={2024}
}'
chicago: Artmann, Matthias. On the Shape Containment Problem within the Amoebot
Model with Reconfigurable Circuits, 2024.
ieee: M. Artmann, On the Shape Containment Problem within the Amoebot Model with
Reconfigurable Circuits. 2024.
mla: Artmann, Matthias. On the Shape Containment Problem within the Amoebot Model
with Reconfigurable Circuits. 2024.
short: M. Artmann, On the Shape Containment Problem within the Amoebot Model with
Reconfigurable Circuits, 2024.
date_created: 2024-07-03T14:01:54Z
date_updated: 2024-07-03T14:02:14Z
department:
- _id: '34'
- _id: '7'
- _id: '79'
language:
- iso: eng
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: On the Shape Containment Problem within the Amoebot Model with Reconfigurable
Circuits
type: mastersthesis
user_id: '15578'
year: '2024'
...
---
_id: '55092'
author:
- first_name: Varun Maitreya
full_name: Eranki, Varun Maitreya
last_name: Eranki
citation:
ama: 'Eranki VM. Fever: Optimal Responsive View Synchronisation.; 2024.'
apa: 'Eranki, V. M. (2024). Fever: Optimal Responsive View Synchronisation.'
bibtex: '@book{Eranki_2024, title={Fever: Optimal Responsive View Synchronisation},
author={Eranki, Varun Maitreya}, year={2024} }'
chicago: 'Eranki, Varun Maitreya. Fever: Optimal Responsive View Synchronisation,
2024.'
ieee: 'V. M. Eranki, Fever: Optimal Responsive View Synchronisation. 2024.'
mla: 'Eranki, Varun Maitreya. Fever: Optimal Responsive View Synchronisation.
2024.'
short: 'V.M. Eranki, Fever: Optimal Responsive View Synchronisation, 2024.'
date_created: 2024-07-05T12:37:07Z
date_updated: 2024-07-05T12:37:40Z
department:
- _id: '34'
- _id: '7'
- _id: '79'
language:
- iso: eng
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: 'Fever: Optimal Responsive View Synchronisation'
type: mastersthesis
user_id: '15578'
year: '2024'
...