---
_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: '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: '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: '55379'
abstract:
- lang: eng
text: 'AbstractThe amoebot model
(Derakhshandeh et al. in: SPAA ACM, pp 220–222. https://doi.org/10.1145/2612669.2612712,
2014) has been proposed as a model for programmable matter consisting of tiny,
robotic elements called amoebots. We consider the reconfigurable
circuit extension (Feldmann et al. in J Comput Biol 29(4):317–343.
https://doi.org/10.1089/cmb.2021.0363,
2022) of the geometric amoebot model that allows the amoebot structure to interconnect
amoebots by so-called circuits. A circuit permits the
instantaneous transmission of signals between the connected amoebots. In this
paper, we examine the structural power of the reconfigurable circuits. We start
with fundamental problems like the stripe computation problem
where, given any connected amoebot structure S, an
amoebot u in S, and some
axis X, all amoebots belonging to axis X
through u have to be identified. Second, we consider
the global maximum problem, which identifies an amoebot
at the highest possible position with respect to some direction in some given
amoebot (sub)structure. A solution to this problem can be used to solve the skeleton
problem, where a cycle of amoebots has to be found in the given
amoebot structure which contains all boundary amoebots. A canonical solution to
that problem can be used to come up with a canonical path, which provides a unique
characterization of the shape of the given amoebot structure. Constructing canonical
paths for different directions allows the amoebots to set up a spanning tree and
to check symmetry properties of the given amoebot structure. The problems are
important for a number of applications like rapid shape transformation, energy
dissemination, and structural monitoring. Interestingly, the reconfigurable circuit
extension allows polylogarithmic-time solutions to all of these problems.'
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
- first_name: Daniel
full_name: Warner, Daniel
id: '3902'
last_name: Warner
citation:
ama: Padalkin A, Scheideler C, Warner D. The structural power of reconfigurable
circuits in the amoebot model. Natural Computing. Published online 2024.
doi:10.1007/s11047-024-09981-6
apa: Padalkin, A., Scheideler, C., & Warner, D. (2024). The structural power
of reconfigurable circuits in the amoebot model. Natural Computing. https://doi.org/10.1007/s11047-024-09981-6
bibtex: '@article{Padalkin_Scheideler_Warner_2024, title={The structural power of
reconfigurable circuits in the amoebot model}, DOI={10.1007/s11047-024-09981-6},
journal={Natural Computing}, publisher={Springer Science and Business Media LLC},
author={Padalkin, Andreas and Scheideler, Christian and Warner, Daniel}, year={2024}
}'
chicago: Padalkin, Andreas, Christian Scheideler, and Daniel Warner. “The Structural
Power of Reconfigurable Circuits in the Amoebot Model.” Natural Computing,
2024. https://doi.org/10.1007/s11047-024-09981-6.
ieee: 'A. Padalkin, C. Scheideler, and D. Warner, “The structural power of reconfigurable
circuits in the amoebot model,” Natural Computing, 2024, doi: 10.1007/s11047-024-09981-6.'
mla: Padalkin, Andreas, et al. “The Structural Power of Reconfigurable Circuits
in the Amoebot Model.” Natural Computing, Springer Science and Business
Media LLC, 2024, doi:10.1007/s11047-024-09981-6.
short: A. Padalkin, C. Scheideler, D. Warner, Natural Computing (2024).
date_created: 2024-07-24T14:28:27Z
date_updated: 2024-07-24T14:28:43Z
doi: 10.1007/s11047-024-09981-6
language:
- iso: eng
publication: Natural Computing
publication_identifier:
issn:
- 1567-7818
- 1572-9796
publication_status: published
publisher: Springer Science and Business Media LLC
status: public
title: The structural power of reconfigurable circuits in the amoebot model
type: journal_article
user_id: '88238'
year: '2024'
...
---
_id: '55378'
author:
- first_name: Siddharth
full_name: Gupta, Siddharth
last_name: Gupta
- first_name: Marc J.
full_name: van Kreveld, Marc J.
last_name: van Kreveld
- first_name: Othon
full_name: Michail, Othon
last_name: Michail
- first_name: Andreas
full_name: Padalkin, Andreas
id: '88238'
last_name: Padalkin
citation:
ama: 'Gupta S, van Kreveld MJ, Michail O, Padalkin A. Brief Announcement: Collision
Detection for Modular Robots - It Is Easy to Cause Collisions and Hard to Avoid
Them. In: Casteigts A, Kuhn F, eds. 3rd Symposium on Algorithmic Foundations
of Dynamic Networks, SAND 2024, June 5-7, 2024, Patras, Greece. Vol 292. LIPIcs.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024:26:1–26:5. doi:10.4230/LIPICS.SAND.2024.26'
apa: 'Gupta, S., van Kreveld, M. J., Michail, O., & Padalkin, A. (2024). Brief
Announcement: Collision Detection for Modular Robots - It Is Easy to Cause Collisions
and Hard to Avoid Them. In A. Casteigts & F. Kuhn (Eds.), 3rd Symposium
on Algorithmic Foundations of Dynamic Networks, SAND 2024, June 5-7, 2024, Patras,
Greece (Vol. 292, p. 26:1–26:5). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPICS.SAND.2024.26'
bibtex: '@inproceedings{Gupta_van Kreveld_Michail_Padalkin_2024, series={LIPIcs},
title={Brief Announcement: Collision Detection for Modular Robots - It Is Easy
to Cause Collisions and Hard to Avoid Them}, volume={292}, DOI={10.4230/LIPICS.SAND.2024.26},
booktitle={3rd Symposium on Algorithmic Foundations of Dynamic Networks, SAND
2024, June 5-7, 2024, Patras, Greece}, publisher={Schloss Dagstuhl - Leibniz-Zentrum
für Informatik}, author={Gupta, Siddharth and van Kreveld, Marc J. and Michail,
Othon and Padalkin, Andreas}, editor={Casteigts, Arnaud and Kuhn, Fabian}, year={2024},
pages={26:1–26:5}, collection={LIPIcs} }'
chicago: 'Gupta, Siddharth, Marc J. van Kreveld, Othon Michail, and Andreas Padalkin.
“Brief Announcement: Collision Detection for Modular Robots - It Is Easy to Cause
Collisions and Hard to Avoid Them.” In 3rd Symposium on Algorithmic Foundations
of Dynamic Networks, SAND 2024, June 5-7, 2024, Patras, Greece, edited by
Arnaud Casteigts and Fabian Kuhn, 292:26:1–26:5. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2024. https://doi.org/10.4230/LIPICS.SAND.2024.26.'
ieee: 'S. Gupta, M. J. van Kreveld, O. Michail, and A. Padalkin, “Brief Announcement:
Collision Detection for Modular Robots - It Is Easy to Cause Collisions and Hard
to Avoid Them,” in 3rd Symposium on Algorithmic Foundations of Dynamic Networks,
SAND 2024, June 5-7, 2024, Patras, Greece, 2024, vol. 292, p. 26:1–26:5, doi:
10.4230/LIPICS.SAND.2024.26.'
mla: 'Gupta, Siddharth, et al. “Brief Announcement: Collision Detection for Modular
Robots - It Is Easy to Cause Collisions and Hard to Avoid Them.” 3rd Symposium
on Algorithmic Foundations of Dynamic Networks, SAND 2024, June 5-7, 2024, Patras,
Greece, edited by Arnaud Casteigts and Fabian Kuhn, vol. 292, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2024, p. 26:1–26:5, doi:10.4230/LIPICS.SAND.2024.26.'
short: 'S. Gupta, M.J. van Kreveld, O. Michail, A. Padalkin, in: A. Casteigts, F.
Kuhn (Eds.), 3rd Symposium on Algorithmic Foundations of Dynamic Networks, SAND
2024, June 5-7, 2024, Patras, Greece, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2024, p. 26:1–26:5.'
date_created: 2024-07-24T14:26:49Z
date_updated: 2024-07-24T14:26:57Z
doi: 10.4230/LIPICS.SAND.2024.26
editor:
- first_name: Arnaud
full_name: Casteigts, Arnaud
last_name: Casteigts
- first_name: Fabian
full_name: Kuhn, Fabian
last_name: Kuhn
intvolume: ' 292'
language:
- iso: eng
page: 26:1–26:5
publication: 3rd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2024,
June 5-7, 2024, Patras, Greece
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
series_title: LIPIcs
status: public
title: 'Brief Announcement: Collision Detection for Modular Robots - It Is Easy to
Cause Collisions and Hard to Avoid Them'
type: conference
user_id: '88238'
volume: 292
year: '2024'
...
---
_id: '55376'
author:
- first_name: Andreas
full_name: Padalkin, Andreas
id: '88238'
last_name: Padalkin
- first_name: Manish
full_name: Kumar, Manish
last_name: Kumar
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Padalkin A, Kumar M, Scheideler C. Reconfiguration and Locomotion with Joint
Movements in the Amoebot Model. In: Casteigts A, Kuhn F, eds. 3rd Symposium
on Algorithmic Foundations of Dynamic Networks, SAND 2024, June 5-7, 2024, Patras,
Greece. Vol 292. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik;
2024:18:1–18:20. doi:10.4230/LIPICS.SAND.2024.18'
apa: Padalkin, A., Kumar, M., & Scheideler, C. (2024). Reconfiguration and Locomotion
with Joint Movements in the Amoebot Model. In A. Casteigts & F. Kuhn (Eds.),
3rd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2024, June
5-7, 2024, Patras, Greece (Vol. 292, p. 18:1–18:20). Schloss Dagstuhl - Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPICS.SAND.2024.18
bibtex: '@inproceedings{Padalkin_Kumar_Scheideler_2024, series={LIPIcs}, title={Reconfiguration
and Locomotion with Joint Movements in the Amoebot Model}, volume={292}, DOI={10.4230/LIPICS.SAND.2024.18},
booktitle={3rd Symposium on Algorithmic Foundations of Dynamic Networks, SAND
2024, June 5-7, 2024, Patras, Greece}, publisher={Schloss Dagstuhl - Leibniz-Zentrum
für Informatik}, author={Padalkin, Andreas and Kumar, Manish and Scheideler, Christian},
editor={Casteigts, Arnaud and Kuhn, Fabian}, year={2024}, pages={18:1–18:20},
collection={LIPIcs} }'
chicago: Padalkin, Andreas, Manish Kumar, and Christian Scheideler. “Reconfiguration
and Locomotion with Joint Movements in the Amoebot Model.” In 3rd Symposium
on Algorithmic Foundations of Dynamic Networks, SAND 2024, June 5-7, 2024, Patras,
Greece, edited by Arnaud Casteigts and Fabian Kuhn, 292:18:1–18:20. LIPIcs.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPICS.SAND.2024.18.
ieee: 'A. Padalkin, M. Kumar, and C. Scheideler, “Reconfiguration and Locomotion
with Joint Movements in the Amoebot Model,” in 3rd Symposium on Algorithmic
Foundations of Dynamic Networks, SAND 2024, June 5-7, 2024, Patras, Greece,
2024, vol. 292, p. 18:1–18:20, doi: 10.4230/LIPICS.SAND.2024.18.'
mla: Padalkin, Andreas, et al. “Reconfiguration and Locomotion with Joint Movements
in the Amoebot Model.” 3rd Symposium on Algorithmic Foundations of Dynamic
Networks, SAND 2024, June 5-7, 2024, Patras, Greece, edited by Arnaud Casteigts
and Fabian Kuhn, vol. 292, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2024, p. 18:1–18:20, doi:10.4230/LIPICS.SAND.2024.18.
short: 'A. Padalkin, M. Kumar, C. Scheideler, in: A. Casteigts, F. Kuhn (Eds.),
3rd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2024, June
5-7, 2024, Patras, Greece, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2024, p. 18:1–18:20.'
date_created: 2024-07-24T14:25:07Z
date_updated: 2024-07-24T14:25:46Z
doi: 10.4230/LIPICS.SAND.2024.18
editor:
- first_name: Arnaud
full_name: Casteigts, Arnaud
last_name: Casteigts
- first_name: Fabian
full_name: Kuhn, Fabian
last_name: Kuhn
intvolume: ' 292'
language:
- iso: eng
page: 18:1–18:20
publication: 3rd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2024,
June 5-7, 2024, Patras, Greece
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
series_title: LIPIcs
status: public
title: Reconfiguration and Locomotion with Joint Movements in the Amoebot Model
type: conference
user_id: '88238'
volume: 292
year: '2024'
...
---
_id: '55377'
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. In: Proceedings of the 43rd ACM Symposium on
Principles of Distributed Computing. ACM; 2024. doi:10.1145/3662158.3662776'
apa: Padalkin, A., & Scheideler, C. (2024). Polylogarithmic Time Algorithms
for Shortest Path Forests in Programmable Matter. Proceedings of the 43rd ACM
Symposium on Principles of Distributed Computing. https://doi.org/10.1145/3662158.3662776
bibtex: '@inproceedings{Padalkin_Scheideler_2024, title={Polylogarithmic Time Algorithms
for Shortest Path Forests in Programmable Matter}, DOI={10.1145/3662158.3662776},
booktitle={Proceedings of the 43rd ACM Symposium on Principles of Distributed
Computing}, publisher={ACM}, author={Padalkin, Andreas and Scheideler, Christian},
year={2024} }'
chicago: Padalkin, Andreas, and Christian Scheideler. “Polylogarithmic Time Algorithms
for Shortest Path Forests in Programmable Matter.” In Proceedings of the 43rd
ACM Symposium on Principles of Distributed Computing. ACM, 2024. https://doi.org/10.1145/3662158.3662776.
ieee: 'A. Padalkin and C. Scheideler, “Polylogarithmic Time Algorithms for Shortest
Path Forests in Programmable Matter,” 2024, doi: 10.1145/3662158.3662776.'
mla: Padalkin, Andreas, and Christian Scheideler. “Polylogarithmic Time Algorithms
for Shortest Path Forests in Programmable Matter.” Proceedings of the 43rd
ACM Symposium on Principles of Distributed Computing, ACM, 2024, doi:10.1145/3662158.3662776.
short: 'A. Padalkin, C. Scheideler, in: Proceedings of the 43rd ACM Symposium on
Principles of Distributed Computing, ACM, 2024.'
date_created: 2024-07-24T14:26:10Z
date_updated: 2024-07-24T14:26:23Z
doi: 10.1145/3662158.3662776
language:
- iso: eng
publication: Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing
publication_status: published
publisher: ACM
status: public
title: Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter
type: conference
user_id: '88238'
year: '2024'
...
---
_id: '64103'
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
citation:
ama: 'Scheideler C, Padalkin A. Polylogarithmic Time Algorithms for Shortest Path
Forests in Programmable Matter. . In: ; 2024:65-75.'
apa: Scheideler, C., & Padalkin, A. (2024). Polylogarithmic Time Algorithms
for Shortest Path Forests in Programmable Matter. . 65–75.
bibtex: '@inproceedings{Scheideler_Padalkin_2024, place={PODC 2024: 65-75}, title={Polylogarithmic
Time Algorithms for Shortest Path Forests in Programmable Matter. }, author={Scheideler,
Christian and Padalkin, Andreas}, year={2024}, pages={65–75} }'
chicago: 'Scheideler, Christian, and Andreas Padalkin. “Polylogarithmic Time Algorithms
for Shortest Path Forests in Programmable Matter. ,” 65–75. PODC 2024: 65-75,
2024.'
ieee: C. Scheideler and A. Padalkin, “Polylogarithmic Time Algorithms for Shortest
Path Forests in Programmable Matter. ,” 2024, pp. 65–75.
mla: Scheideler, Christian, and Andreas Padalkin. Polylogarithmic Time Algorithms
for Shortest Path Forests in Programmable Matter. . 2024, pp. 65–75.
short: 'C. Scheideler, A. Padalkin, in: PODC 2024: 65-75, 2024, pp. 65–75.'
date_created: 2026-02-10T10:06:36Z
date_updated: 2026-02-11T09:11:58Z
department:
- _id: '34'
- _id: '7'
- _id: '79'
language:
- iso: eng
page: 65 - 75
place: 'PODC 2024: 65-75'
status: public
title: 'Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable
Matter. '
type: conference
user_id: '15578'
year: '2024'
...
---
_id: '64100'
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: Daniel
full_name: Warner, Daniel
id: '3902'
last_name: Warner
citation:
ama: 'Scheideler C, Padalkin A, Warner D. The structural power of reconfigurable
circuits in the amoebot model. . The structural power of reconfigurable circuits
in the amoebot model Nat Comput 23(4): 603-625 (2024). Published online 2024:603-625.'
apa: 'Scheideler, C., Padalkin, A., & Warner, D. (2024). The structural power
of reconfigurable circuits in the amoebot model. . The Structural Power of
Reconfigurable Circuits in the Amoebot Model. Nat. Comput. 23(4): 603-625 (2024),
603–625.'
bibtex: '@article{Scheideler_Padalkin_Warner_2024, title={The structural power of
reconfigurable circuits in the amoebot model. }, journal={The structural power
of reconfigurable circuits in the amoebot model. Nat. Comput. 23(4): 603-625 (2024)},
author={Scheideler, Christian and Padalkin, Andreas and Warner, Daniel}, year={2024},
pages={603–625} }'
chicago: 'Scheideler, Christian, Andreas Padalkin, and Daniel Warner. “The Structural
Power of Reconfigurable Circuits in the Amoebot Model. .” The Structural Power
of Reconfigurable Circuits in the Amoebot Model. Nat. Comput. 23(4): 603-625 (2024),
2024, 603–25.'
ieee: 'C. Scheideler, A. Padalkin, and D. Warner, “The structural power of reconfigurable
circuits in the amoebot model. ,” The structural power of reconfigurable circuits
in the amoebot model. Nat. Comput. 23(4): 603-625 (2024), pp. 603–625, 2024.'
mla: 'Scheideler, Christian, et al. “The Structural Power of Reconfigurable Circuits
in the Amoebot Model. .” The Structural Power of Reconfigurable Circuits in
the Amoebot Model. Nat. Comput. 23(4): 603-625 (2024), 2024, pp. 603–25.'
short: 'C. Scheideler, A. Padalkin, D. Warner, The Structural Power of Reconfigurable
Circuits in the Amoebot Model. Nat. Comput. 23(4): 603-625 (2024) (2024) 603–625.'
date_created: 2026-02-10T09:56:23Z
date_updated: 2026-02-11T09:13:04Z
department:
- _id: '34'
- _id: '7'
- _id: '79'
language:
- iso: eng
page: 603 - 625
publication: 'The structural power of reconfigurable circuits in the amoebot model.
Nat. Comput. 23(4): 603-625 (2024)'
status: public
title: 'The structural power of reconfigurable circuits in the amoebot model. '
type: journal_article
user_id: '15578'
year: '2024'
...
---
_id: '64105'
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. . In: ; 2024.'
apa: Scheideler, C., Padalkin, A., & Kumar , M. (2024). Reconfiguration and
Locomotion with Joint Movements in the Amoebot Model. .
bibtex: '@inproceedings{Scheideler_Padalkin_Kumar _2024, place={SAND 2024: 18:1-18:20},
title={Reconfiguration and Locomotion with Joint Movements in the Amoebot Model.
}, author={Scheideler, Christian and Padalkin, Andreas and Kumar , Manish }, year={2024}
}'
chicago: 'Scheideler, Christian, Andreas Padalkin, and Manish Kumar . “Reconfiguration
and Locomotion with Joint Movements in the Amoebot Model. .” SAND 2024: 18:1-18:20,
2024.'
ieee: C. Scheideler, A. Padalkin, and M. Kumar , “Reconfiguration and Locomotion
with Joint Movements in the Amoebot Model. ,” 2024.
mla: Scheideler, Christian, et al. Reconfiguration and Locomotion with Joint
Movements in the Amoebot Model. . 2024.
short: 'C. Scheideler, A. Padalkin, M. Kumar , in: SAND 2024: 18:1-18:20, 2024.'
date_created: 2026-02-10T10:15:08Z
date_updated: 2026-02-11T09:12:18Z
department:
- _id: '34'
- _id: '7'
- _id: '79'
language:
- iso: eng
place: 'SAND 2024: 18:1-18:20'
status: public
title: 'Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. '
type: conference
user_id: '15578'
year: '2024'
...
---
_id: '31060'
author:
- first_name: Michael
full_name: Feldmann, Michael
last_name: Feldmann
- first_name: Andreas
full_name: Padalkin, Andreas
id: '88238'
last_name: Padalkin
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Shlomi
full_name: Dolev, Shlomi
last_name: Dolev
citation:
ama: Feldmann M, Padalkin A, Scheideler C, Dolev S. Coordinating Amoebots via Reconfigurable
Circuits. J Comput Biol. 2022;29(4):317–343. doi:10.1089/cmb.2021.0363
apa: Feldmann, M., Padalkin, A., Scheideler, C., & Dolev, S. (2022). Coordinating
Amoebots via Reconfigurable Circuits. J. Comput. Biol., 29(4), 317–343.
https://doi.org/10.1089/cmb.2021.0363
bibtex: '@article{Feldmann_Padalkin_Scheideler_Dolev_2022, title={Coordinating Amoebots
via Reconfigurable Circuits}, volume={29}, DOI={10.1089/cmb.2021.0363},
number={4}, journal={J. Comput. Biol.}, author={Feldmann, Michael and Padalkin,
Andreas and Scheideler, Christian and Dolev, Shlomi}, year={2022}, pages={317–343}
}'
chicago: 'Feldmann, Michael, Andreas Padalkin, Christian Scheideler, and Shlomi
Dolev. “Coordinating Amoebots via Reconfigurable Circuits.” J. Comput. Biol.
29, no. 4 (2022): 317–343. https://doi.org/10.1089/cmb.2021.0363.'
ieee: 'M. Feldmann, A. Padalkin, C. Scheideler, and S. Dolev, “Coordinating Amoebots
via Reconfigurable Circuits,” J. Comput. Biol., vol. 29, no. 4, pp. 317–343,
2022, doi: 10.1089/cmb.2021.0363.'
mla: Feldmann, Michael, et al. “Coordinating Amoebots via Reconfigurable Circuits.”
J. Comput. Biol., vol. 29, no. 4, 2022, pp. 317–343, doi:10.1089/cmb.2021.0363.
short: M. Feldmann, A. Padalkin, C. Scheideler, S. Dolev, J. Comput. Biol. 29 (2022)
317–343.
date_created: 2022-05-04T12:29:22Z
date_updated: 2022-05-04T12:31:27Z
department:
- _id: '79'
doi: 10.1089/cmb.2021.0363
intvolume: ' 29'
issue: '4'
language:
- iso: eng
page: 317–343
publication: J. Comput. Biol.
status: public
title: Coordinating Amoebots via Reconfigurable Circuits
type: journal_article
user_id: '15504'
volume: 29
year: '2022'
...
---
_id: '32602'
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
- first_name: Daniel
full_name: Warner, Daniel
id: '3902'
last_name: Warner
citation:
ama: 'Padalkin A, Scheideler C, Warner D. The Structural Power of Reconfigurable
Circuits in the Amoebot Model. In: Ouldridge TE, Wickham SFJ, eds. 28th International
Conference on DNA Computing and Molecular Programming (DNA 28). Vol 238. Leibniz
International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum
für Informatik; 2022:8:1–8:22. doi:10.4230/LIPIcs.DNA.28.8'
apa: Padalkin, A., Scheideler, C., & Warner, D. (2022). The Structural Power
of Reconfigurable Circuits in the Amoebot Model. In T. E. Ouldridge & S. F.
J. Wickham (Eds.), 28th International Conference on DNA Computing and Molecular
Programming (DNA 28) (Vol. 238, p. 8:1–8:22). Schloss Dagstuhl – Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPIcs.DNA.28.8
bibtex: '@inproceedings{Padalkin_Scheideler_Warner_2022, place={Dagstuhl, Germany},
series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={The
Structural Power of Reconfigurable Circuits in the Amoebot Model}, volume={238},
DOI={10.4230/LIPIcs.DNA.28.8},
booktitle={28th International Conference on DNA Computing and Molecular Programming
(DNA 28)}, publisher={Schloss Dagstuhl – Leibniz-Zentrum für Informatik}, author={Padalkin,
Andreas and Scheideler, Christian and Warner, Daniel}, editor={Ouldridge, Thomas
E. and Wickham, Shelley F. J.}, year={2022}, pages={8:1–8:22}, collection={Leibniz
International Proceedings in Informatics (LIPIcs)} }'
chicago: 'Padalkin, Andreas, Christian Scheideler, and Daniel Warner. “The Structural
Power of Reconfigurable Circuits in the Amoebot Model.” In 28th International
Conference on DNA Computing and Molecular Programming (DNA 28), edited by
Thomas E. Ouldridge and Shelley F. J. Wickham, 238:8:1–8:22. Leibniz International
Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum
für Informatik, 2022. https://doi.org/10.4230/LIPIcs.DNA.28.8.'
ieee: 'A. Padalkin, C. Scheideler, and D. Warner, “The Structural Power of Reconfigurable
Circuits in the Amoebot Model,” in 28th International Conference on DNA Computing
and Molecular Programming (DNA 28), 2022, vol. 238, p. 8:1–8:22, doi: 10.4230/LIPIcs.DNA.28.8.'
mla: Padalkin, Andreas, et al. “The Structural Power of Reconfigurable Circuits
in the Amoebot Model.” 28th International Conference on DNA Computing and Molecular
Programming (DNA 28), edited by Thomas E. Ouldridge and Shelley F. J. Wickham,
vol. 238, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022, p. 8:1–8:22,
doi:10.4230/LIPIcs.DNA.28.8.
short: 'A. Padalkin, C. Scheideler, D. Warner, in: T.E. Ouldridge, S.F.J. Wickham
(Eds.), 28th International Conference on DNA Computing and Molecular Programming
(DNA 28), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany,
2022, p. 8:1–8:22.'
date_created: 2022-08-08T17:32:19Z
date_updated: 2022-11-17T14:18:24Z
department:
- _id: '79'
doi: 10.4230/LIPIcs.DNA.28.8
editor:
- first_name: Thomas E.
full_name: Ouldridge, Thomas E.
last_name: Ouldridge
- first_name: Shelley F. J.
full_name: Wickham, Shelley F. J.
last_name: Wickham
intvolume: ' 238'
language:
- iso: eng
page: 8:1–8:22
place: Dagstuhl, Germany
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '5'
name: 'SFB 901 - A1: SFB 901 - Subproject A1'
- _id: '13'
name: 'SFB 901 - C1: SFB 901 - Subproject C1'
publication: 28th International Conference on DNA Computing and Molecular Programming
(DNA 28)
publication_identifier:
isbn:
- 978-3-95977-253-2
issn:
- 1868-8969
publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: The Structural Power of Reconfigurable Circuits in the Amoebot Model
type: conference
user_id: '477'
volume: 238
year: '2022'
...
---
_id: '28917'
author:
- first_name: Michael
full_name: Feldmann, Michael
last_name: Feldmann
- first_name: Andreas
full_name: Padalkin, Andreas
id: '88238'
last_name: Padalkin
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Shlomi
full_name: Dolev, Shlomi
last_name: Dolev
citation:
ama: 'Feldmann M, Padalkin A, Scheideler C, Dolev S. Coordinating Amoebots via Reconfigurable
Circuits. In: Johnen C, Michael Schiller E, Schmid S, eds. Stabilization, Safety,
and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021,
Virtual Event, November 17-20, 2021, Proceedings. Vol 13046. Lecture Notes
in Computer Science. Springer; 2021:484-488. doi:10.1007/978-3-030-91081-5\_34'
apa: Feldmann, M., Padalkin, A., Scheideler, C., & Dolev, S. (2021). Coordinating
Amoebots via Reconfigurable Circuits. In C. Johnen, E. Michael Schiller, &
S. Schmid (Eds.), Stabilization, Safety, and Security of Distributed Systems
- 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021,
Proceedings (Vol. 13046, pp. 484–488). Springer. https://doi.org/10.1007/978-3-030-91081-5\_34
bibtex: '@inproceedings{Feldmann_Padalkin_Scheideler_Dolev_2021, series={Lecture
Notes in Computer Science}, title={Coordinating Amoebots via Reconfigurable Circuits},
volume={13046}, DOI={10.1007/978-3-030-91081-5\_34},
booktitle={Stabilization, Safety, and Security of Distributed Systems - 23rd International
Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings}, publisher={Springer},
author={Feldmann, Michael and Padalkin, Andreas and Scheideler, Christian and
Dolev, Shlomi}, editor={Johnen, Colette and Michael Schiller, Elad and Schmid,
Stefan}, year={2021}, pages={484–488}, collection={Lecture Notes in Computer Science}
}'
chicago: Feldmann, Michael, Andreas Padalkin, Christian Scheideler, and Shlomi Dolev.
“Coordinating Amoebots via Reconfigurable Circuits.” In Stabilization, Safety,
and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021,
Virtual Event, November 17-20, 2021, Proceedings, edited by Colette Johnen,
Elad Michael Schiller, and Stefan Schmid, 13046:484–88. Lecture Notes in Computer
Science. Springer, 2021. https://doi.org/10.1007/978-3-030-91081-5\_34.
ieee: 'M. Feldmann, A. Padalkin, C. Scheideler, and S. Dolev, “Coordinating Amoebots
via Reconfigurable Circuits,” in Stabilization, Safety, and Security of Distributed
Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20,
2021, Proceedings, 2021, vol. 13046, pp. 484–488, doi: 10.1007/978-3-030-91081-5\_34.'
mla: Feldmann, Michael, et al. “Coordinating Amoebots via Reconfigurable Circuits.”
Stabilization, Safety, and Security of Distributed Systems - 23rd International
Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings, edited
by Colette Johnen et al., vol. 13046, Springer, 2021, pp. 484–88, doi:10.1007/978-3-030-91081-5\_34.
short: 'M. Feldmann, A. Padalkin, C. Scheideler, S. Dolev, in: C. Johnen, E. Michael
Schiller, S. Schmid (Eds.), Stabilization, Safety, and Security of Distributed
Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20,
2021, Proceedings, Springer, 2021, pp. 484–488.'
date_created: 2021-12-15T09:37:38Z
date_updated: 2022-01-06T06:58:41Z
department:
- _id: '79'
doi: 10.1007/978-3-030-91081-5\_34
editor:
- first_name: Colette
full_name: Johnen, Colette
last_name: Johnen
- first_name: Elad
full_name: Michael Schiller, Elad
last_name: Michael Schiller
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
intvolume: ' 13046'
language:
- iso: eng
page: 484-488
publication: Stabilization, Safety, and Security of Distributed Systems - 23rd International
Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Coordinating Amoebots via Reconfigurable Circuits
type: conference
user_id: '15504'
volume: 13046
year: '2021'
...
---
_id: '25130'
author:
- first_name: Andreas
full_name: Padalkin, Andreas
id: '88238'
last_name: Padalkin
citation:
ama: Padalkin A. Fire Containment by Back Burning on Grids.; 2019.
apa: Padalkin, A. (2019). Fire Containment by Back Burning on Grids.
bibtex: '@book{Padalkin_2019, place={Rheinische Friedrich-Wilhelms-Universität Bonn},
title={Fire Containment by Back Burning on Grids}, author={Padalkin, Andreas},
year={2019} }'
chicago: Padalkin, Andreas. Fire Containment by Back Burning on Grids. Rheinische
Friedrich-Wilhelms-Universität Bonn, 2019.
ieee: A. Padalkin, Fire Containment by Back Burning on Grids. Rheinische
Friedrich-Wilhelms-Universität Bonn, 2019.
mla: Padalkin, Andreas. Fire Containment by Back Burning on Grids. 2019.
short: A. Padalkin, Fire Containment by Back Burning on Grids, Rheinische Friedrich-Wilhelms-Universität
Bonn, 2019.
date_created: 2021-09-29T12:42:25Z
date_updated: 2022-01-06T06:56:53Z
extern: '1'
language:
- iso: eng
place: Rheinische Friedrich-Wilhelms-Universität Bonn
status: public
supervisor:
- first_name: Elmar
full_name: Langetepe, Elmar
last_name: Langetepe
title: Fire Containment by Back Burning on Grids
type: mastersthesis
user_id: '88238'
year: '2019'
...
---
_id: '25129'
author:
- first_name: Andreas
full_name: Padalkin, Andreas
id: '88238'
last_name: Padalkin
citation:
ama: Padalkin A. Modulbasierte Realisierung Eines Mittels Backpropagation Lernenden
Neuronalen Netzes Auf Einem FPGA.; 2016.
apa: Padalkin, A. (2016). Modulbasierte Realisierung eines mittels Backpropagation
lernenden Neuronalen Netzes auf einem FPGA.
bibtex: '@book{Padalkin_2016, place={Rheinische Friedrich-Wilhelms-Universität Bonn},
title={Modulbasierte Realisierung eines mittels Backpropagation lernenden Neuronalen
Netzes auf einem FPGA}, author={Padalkin, Andreas}, year={2016} }'
chicago: Padalkin, Andreas. Modulbasierte Realisierung Eines Mittels Backpropagation
Lernenden Neuronalen Netzes Auf Einem FPGA. Rheinische Friedrich-Wilhelms-Universität
Bonn, 2016.
ieee: A. Padalkin, Modulbasierte Realisierung eines mittels Backpropagation lernenden
Neuronalen Netzes auf einem FPGA. Rheinische Friedrich-Wilhelms-Universität
Bonn, 2016.
mla: Padalkin, Andreas. Modulbasierte Realisierung Eines Mittels Backpropagation
Lernenden Neuronalen Netzes Auf Einem FPGA. 2016.
short: A. Padalkin, Modulbasierte Realisierung Eines Mittels Backpropagation Lernenden
Neuronalen Netzes Auf Einem FPGA, Rheinische Friedrich-Wilhelms-Universität Bonn,
2016.
date_created: 2021-09-29T12:40:16Z
date_updated: 2022-01-06T06:56:53Z
extern: '1'
language:
- iso: eng
place: Rheinische Friedrich-Wilhelms-Universität Bonn
status: public
supervisor:
- first_name: Joachim
full_name: Anlauf, Joachim
last_name: Anlauf
title: Modulbasierte Realisierung eines mittels Backpropagation lernenden Neuronalen
Netzes auf einem FPGA
type: bachelorsthesis
user_id: '88238'
year: '2016'
...