---
_id: '55092'
author:
- first_name: Varun Maitreya
  full_name: Eranki, Varun Maitreya
  last_name: Eranki
citation:
  ama: 'Eranki VM. <i>Fever: Optimal Responsive View Synchronisation</i>.; 2024.'
  apa: 'Eranki, V. M. (2024). <i>Fever: Optimal Responsive View Synchronisation</i>.'
  bibtex: '@book{Eranki_2024, title={Fever: Optimal Responsive View Synchronisation},
    author={Eranki, Varun Maitreya}, year={2024} }'
  chicago: 'Eranki, Varun Maitreya. <i>Fever: Optimal Responsive View Synchronisation</i>,
    2024.'
  ieee: 'V. M. Eranki, <i>Fever: Optimal Responsive View Synchronisation</i>. 2024.'
  mla: 'Eranki, Varun Maitreya. <i>Fever: Optimal Responsive View Synchronisation</i>.
    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'
...
---
_id: '54807'
abstract:
- lang: eng
  text: "This paper considers the shape formation problem within the 3D hybrid model,
    where a single agent with a strictly limited viewing range and the computational
    capacity of a deterministic finite automaton manipulates passive tiles through
    pick-up, movement, and placement actions. The goal is to reconfigure a set of
    tiles into a specific shape termed an icicle. The icicle, identified as a dense,
    hole-free structure, is strategically chosen to function as an intermediate shape
    for more intricate shape formation tasks. It is designed for easy exploration
    by a finite state agent, enabling the identification of tiles that can be lifted
    without breaking connectivity. Compared to the line shape, the icicle presents
    distinct advantages, including a reduced diameter and the presence of multiple
    removable tiles. We propose an algorithm that transforms an arbitrary initially
    connected tile structure into an icicle in \U0001D4AA(n³) steps, matching the
    runtime of the line formation algorithm from prior work. Our theoretical contribution
    is accompanied by an extensive experimental analysis, indicating that our algorithm
    decreases the diameter of tile structures on average."
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. In:
    Casteigts A, Kuhn F, eds. <i>3rd Symposium on Algorithmic Foundations of Dynamic
    Networks (SAND 2024)</i>. Vol 292. Leibniz International Proceedings in Informatics
    (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2024:15:1–15:20.
    doi:<a href="https://doi.org/10.4230/LIPIcs.SAND.2024.15">10.4230/LIPIcs.SAND.2024.15</a>'
  apa: 'Hinnenthal, K., Liedtke, D. J., &#38; Scheideler, C. (2024). Efficient Shape
    Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate
    Structures. In A. Casteigts &#38; F. Kuhn (Eds.), <i>3rd Symposium on Algorithmic
    Foundations of Dynamic Networks (SAND 2024)</i> (Vol. 292, p. 15:1–15:20). Schloss
    Dagstuhl – Leibniz-Zentrum für Informatik. <a href="https://doi.org/10.4230/LIPIcs.SAND.2024.15">https://doi.org/10.4230/LIPIcs.SAND.2024.15</a>'
  bibtex: '@inproceedings{Hinnenthal_Liedtke_Scheideler_2024, place={Dagstuhl, Germany},
    series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Efficient
    Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter
    Intermediate Structures}, volume={292}, DOI={<a href="https://doi.org/10.4230/LIPIcs.SAND.2024.15">10.4230/LIPIcs.SAND.2024.15</a>},
    booktitle={3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND
    2024)}, publisher={Schloss Dagstuhl – Leibniz-Zentrum für Informatik}, author={Hinnenthal,
    Kristian and Liedtke, David Jan and Scheideler, Christian}, editor={Casteigts,
    Arnaud and Kuhn, Fabian}, year={2024}, pages={15:1–15:20}, collection={Leibniz
    International Proceedings in Informatics (LIPIcs)} }'
  chicago: 'Hinnenthal, Kristian, David Jan Liedtke, and Christian Scheideler. “Efficient
    Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter
    Intermediate Structures.” In <i>3rd Symposium on Algorithmic Foundations of Dynamic
    Networks (SAND 2024)</i>, edited by Arnaud Casteigts and Fabian Kuhn, 292:15:1–15:20.
    Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany:
    Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024. <a href="https://doi.org/10.4230/LIPIcs.SAND.2024.15">https://doi.org/10.4230/LIPIcs.SAND.2024.15</a>.'
  ieee: 'K. Hinnenthal, D. J. Liedtke, and C. Scheideler, “Efficient Shape Formation
    by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures,”
    in <i>3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024)</i>,
    2024, vol. 292, p. 15:1–15:20, doi: <a href="https://doi.org/10.4230/LIPIcs.SAND.2024.15">10.4230/LIPIcs.SAND.2024.15</a>.'
  mla: 'Hinnenthal, Kristian, et al. “Efficient Shape Formation by 3D Hybrid Programmable
    Matter: An Algorithm for Low Diameter Intermediate Structures.” <i>3rd Symposium
    on Algorithmic Foundations of Dynamic Networks (SAND 2024)</i>, edited by Arnaud
    Casteigts and Fabian Kuhn, vol. 292, Schloss Dagstuhl – Leibniz-Zentrum für Informatik,
    2024, p. 15:1–15:20, doi:<a href="https://doi.org/10.4230/LIPIcs.SAND.2024.15">10.4230/LIPIcs.SAND.2024.15</a>.'
  short: 'K. Hinnenthal, D.J. Liedtke, C. Scheideler, in: A. Casteigts, F. Kuhn (Eds.),
    3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024), Schloss
    Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2024, p. 15:1–15:20.'
date_created: 2024-06-18T07:45:34Z
date_updated: 2024-07-18T09:32:49Z
department:
- _id: '79'
doi: 10.4230/LIPIcs.SAND.2024.15
editor:
- first_name: Arnaud
  full_name: Casteigts, Arnaud
  last_name: Casteigts
- first_name: Fabian
  full_name: Kuhn, Fabian
  last_name: Kuhn
intvolume: '       292'
keyword:
- Programmable Matter
- Shape Formation
- 3D Model
- Finite Automaton
language:
- iso: eng
page: 15:1–15:20
place: Dagstuhl, Germany
publication: 3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024)
publication_identifier:
  isbn:
  - 978-3-95977-315-7
  issn:
  - 1868-8969
publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: 'Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for
  Low Diameter Intermediate Structures'
type: conference
user_id: '55557'
volume: 292
year: '2024'
...
---
_id: '54802'
abstract:
- lang: eng
  text: Motivated by the prospect of nano-robots that assist human physiological functions
    at the nanoscale, we investigate the coating problem in the three-dimensional
    model for hybrid programmable matter. In this model, a single agent with strictly
    limited viewing range and the computational capability of a deterministic finite
    automaton can act on passive tiles by picking up a tile, moving, and placing it
    at some spot. The goal of the coating problem is to fill each node of some surface
    graph of size n with a tile. We first solve the problem on a restricted class
    of graphs with a single tile type, and then use constantly many tile types to
    encode this graph in certain surface graphs capturing the surface of 3D objects.
    Our algorithm requires O(n^2) steps, which is worst-case optimal compared to an
    agent with global knowledge and no memory restrictions.
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. Universal Coating by 3D Hybrid Programmable
    Matter. In: Emek Y, ed. <i>Structural Information and Communication Complexity</i>.
    Springer Nature Switzerland; 2024. doi:<a href="https://doi.org/10.1007/978-3-031-60603-8_21">10.1007/978-3-031-60603-8_21</a>'
  apa: Kostitsyna, I., Liedtke, D. J., &#38; Scheideler, C. (2024). Universal Coating
    by 3D Hybrid Programmable Matter. In Y. Emek (Ed.), <i>Structural Information
    and Communication Complexity</i>. Springer Nature Switzerland. <a href="https://doi.org/10.1007/978-3-031-60603-8_21">https://doi.org/10.1007/978-3-031-60603-8_21</a>
  bibtex: '@inbook{Kostitsyna_Liedtke_Scheideler_2024, place={Cham}, title={Universal
    Coating by 3D Hybrid Programmable Matter}, DOI={<a href="https://doi.org/10.1007/978-3-031-60603-8_21">10.1007/978-3-031-60603-8_21</a>},
    booktitle={Structural Information and Communication Complexity}, publisher={Springer
    Nature Switzerland}, author={Kostitsyna, Irina and Liedtke, David Jan and Scheideler,
    Christian}, editor={Emek, Yuval}, year={2024} }'
  chicago: 'Kostitsyna, Irina, David Jan Liedtke, and Christian Scheideler. “Universal
    Coating by 3D Hybrid Programmable Matter.” In <i>Structural Information and Communication
    Complexity</i>, edited by Yuval Emek. Cham: Springer Nature Switzerland, 2024.
    <a href="https://doi.org/10.1007/978-3-031-60603-8_21">https://doi.org/10.1007/978-3-031-60603-8_21</a>.'
  ieee: 'I. Kostitsyna, D. J. Liedtke, and C. Scheideler, “Universal Coating by 3D
    Hybrid Programmable Matter,” in <i>Structural Information and Communication Complexity</i>,
    Y. Emek, Ed. Cham: Springer Nature Switzerland, 2024.'
  mla: Kostitsyna, Irina, et al. “Universal Coating by 3D Hybrid Programmable Matter.”
    <i>Structural Information and Communication Complexity</i>, edited by Yuval Emek,
    Springer Nature Switzerland, 2024, doi:<a href="https://doi.org/10.1007/978-3-031-60603-8_21">10.1007/978-3-031-60603-8_21</a>.
  short: 'I. Kostitsyna, D.J. Liedtke, C. Scheideler, in: Y. Emek (Ed.), Structural
    Information and Communication Complexity, Springer Nature Switzerland, Cham, 2024.'
date_created: 2024-06-18T07:36:04Z
date_updated: 2024-07-18T09:32:58Z
department:
- _id: '79'
doi: 10.1007/978-3-031-60603-8_21
editor:
- first_name: Yuval
  full_name: Emek, Yuval
  last_name: Emek
keyword:
- Programmable Matter
- Coating
- Finite Automaton
- 3D
language:
- iso: eng
place: Cham
publication: Structural Information and Communication Complexity
publication_identifier:
  isbn:
  - '9783031606021'
  - '9783031606038'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer Nature Switzerland
status: public
title: Universal Coating by 3D Hybrid Programmable Matter
type: book_chapter
user_id: '55557'
year: '2024'
...
---
_id: '64104'
author:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: 'Kristian '
  full_name: 'Hinnenthal , Kristian '
  last_name: 'Hinnenthal '
- first_name: David Jan
  full_name: Liedtke, David Jan
  id: '55557'
  last_name: Liedtke
citation:
  ama: 'Scheideler C, Hinnenthal  K, Liedtke DJ. Efficient Shape Formation by 3D Hybrid
    Programmable Matter: An Algorithm for Low Diameter Intermediate Structures. SAND
    2024: 15:1-15:20. In: ; 2024.'
  apa: 'Scheideler, C., Hinnenthal , K., &#38; Liedtke, D. J. (2024). <i>Efficient
    Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter
    Intermediate Structures. SAND 2024: 15:1-15:20</i>.'
  bibtex: '@inproceedings{Scheideler_Hinnenthal _Liedtke_2024, place={CoRR abs/2401.17734
    (2024)}, title={Efficient Shape Formation by 3D Hybrid Programmable Matter: An
    Algorithm for Low Diameter Intermediate Structures. SAND 2024: 15:1-15:20}, author={Scheideler,
    Christian and Hinnenthal , Kristian  and Liedtke, David Jan}, year={2024} }'
  chicago: 'Scheideler, Christian, Kristian  Hinnenthal , and David Jan Liedtke. “Efficient
    Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter
    Intermediate Structures. SAND 2024: 15:1-15:20.” CoRR abs/2401.17734 (2024), 2024.'
  ieee: 'C. Scheideler, K. Hinnenthal , and D. J. Liedtke, “Efficient Shape Formation
    by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures.
    SAND 2024: 15:1-15:20,” 2024.'
  mla: 'Scheideler, Christian, et al. <i>Efficient Shape Formation by 3D Hybrid Programmable
    Matter: An Algorithm for Low Diameter Intermediate Structures. SAND 2024: 15:1-15:20</i>.
    2024.'
  short: 'C. Scheideler, K. Hinnenthal , D.J. Liedtke, in: CoRR abs/2401.17734 (2024),
    2024.'
date_created: 2026-02-10T10:12:18Z
date_updated: 2026-02-11T09:12:05Z
department:
- _id: '34'
- _id: '7'
- _id: '79'
language:
- iso: eng
place: CoRR abs/2401.17734 (2024)
status: public
title: 'Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for
  Low Diameter Intermediate Structures. SAND 2024: 15:1-15:20'
type: conference
user_id: '15578'
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., &#38; Padalkin, A. (2024). <i>Polylogarithmic Time Algorithms
    for Shortest Path Forests in Programmable Matter. </i>. 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. <i>Polylogarithmic Time Algorithms
    for Shortest Path Forests in Programmable Matter. </i>. 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: '64106'
author:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: 'Irina '
  full_name: 'Kostitsyna, Irina '
  last_name: Kostitsyna
- first_name: David Jan
  full_name: Liedtke, David Jan
  id: '55557'
  last_name: Liedtke
citation:
  ama: 'Scheideler C, Kostitsyna I, Liedtke DJ. Universal Coating by 3D Hybrid Programmable
    Matter. In: ; 2024.'
  apa: Scheideler, C., Kostitsyna, I., &#38; Liedtke, D. J. (2024). <i>Universal Coating
    by 3D Hybrid Programmable Matter.</i>
  bibtex: '@inproceedings{Scheideler_Kostitsyna_Liedtke_2024, place={SIROCCO 2024:
    384-401}, title={Universal Coating by 3D Hybrid Programmable Matter.}, author={Scheideler,
    Christian and Kostitsyna, Irina  and Liedtke, David Jan}, year={2024} }'
  chicago: 'Scheideler, Christian, Irina  Kostitsyna, and David Jan Liedtke. “Universal
    Coating by 3D Hybrid Programmable Matter.” SIROCCO 2024: 384-401, 2024.'
  ieee: C. Scheideler, I. Kostitsyna, and D. J. Liedtke, “Universal Coating by 3D
    Hybrid Programmable Matter.,” 2024.
  mla: Scheideler, Christian, et al. <i>Universal Coating by 3D Hybrid Programmable
    Matter.</i> 2024.
  short: 'C. Scheideler, I. Kostitsyna, D.J. Liedtke, in: SIROCCO 2024: 384-401, 2024.'
date_created: 2026-02-10T10:21:39Z
date_updated: 2026-02-11T09:12:11Z
department:
- _id: '34'
- _id: '7'
- _id: '79'
language:
- iso: eng
place: 'SIROCCO 2024: 384-401'
status: public
title: Universal Coating by 3D Hybrid 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. . <i>The structural power of reconfigurable circuits
    in the amoebot model Nat Comput 23(4): 603-625 (2024)</i>. Published online 2024:603-625.'
  apa: 'Scheideler, C., Padalkin, A., &#38; Warner, D. (2024). The structural power
    of reconfigurable circuits in the amoebot model. . <i>The Structural Power of
    Reconfigurable Circuits in the Amoebot Model. Nat. Comput. 23(4): 603-625 (2024)</i>,
    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. .” <i>The Structural Power
    of Reconfigurable Circuits in the Amoebot Model. Nat. Comput. 23(4): 603-625 (2024)</i>,
    2024, 603–25.'
  ieee: 'C. Scheideler, A. Padalkin, and D. Warner, “The structural power of reconfigurable
    circuits in the amoebot model. ,” <i>The structural power of reconfigurable circuits
    in the amoebot model. Nat. Comput. 23(4): 603-625 (2024)</i>, pp. 603–625, 2024.'
  mla: 'Scheideler, Christian, et al. “The Structural Power of Reconfigurable Circuits
    in the Amoebot Model. .” <i>The Structural Power of Reconfigurable Circuits in
    the Amoebot Model. Nat. Comput. 23(4): 603-625 (2024)</i>, 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: '64101'
author:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: 'Sam '
  full_name: 'Coy, Sam '
  last_name: Coy
- first_name: 'Arthur '
  full_name: 'Czumaj, Arthur '
  last_name: Czumaj
- first_name: 'Philipp '
  full_name: 'Schneider, Philipp '
  last_name: Schneider
- first_name: Julian
  full_name: Werthmann, Julian
  id: '50024'
  last_name: Werthmann
citation:
  ama: 'Scheideler C, Coy S, Czumaj A, Schneider P, Werthmann J. Routing schemes for
    hybrid communication networks. . <i>Routing schemes for hybrid communication networks
    Theor Comput Sci 985: 114352 (2024)</i>. Published online 2024.'
  apa: 'Scheideler, C., Coy, S., Czumaj, A., Schneider, P., &#38; Werthmann, J. (2024).
    Routing schemes for hybrid communication networks. . <i>Routing Schemes for Hybrid
    Communication Networks. Theor. Comput. Sci. 985: 114352 (2024)</i>.'
  bibtex: '@article{Scheideler_Coy_Czumaj_Schneider_Werthmann_2024, title={Routing
    schemes for hybrid communication networks. }, journal={Routing schemes for hybrid
    communication networks. Theor. Comput. Sci. 985: 114352 (2024)}, author={Scheideler,
    Christian and Coy, Sam  and Czumaj, Arthur  and Schneider, Philipp  and Werthmann,
    Julian}, year={2024} }'
  chicago: 'Scheideler, Christian, Sam  Coy, Arthur  Czumaj, Philipp  Schneider, and
    Julian Werthmann. “Routing Schemes for Hybrid Communication Networks. .” <i>Routing
    Schemes for Hybrid Communication Networks. Theor. Comput. Sci. 985: 114352 (2024)</i>,
    2024.'
  ieee: 'C. Scheideler, S. Coy, A. Czumaj, P. Schneider, and J. Werthmann, “Routing
    schemes for hybrid communication networks. ,” <i>Routing schemes for hybrid communication
    networks. Theor. Comput. Sci. 985: 114352 (2024)</i>, 2024.'
  mla: 'Scheideler, Christian, et al. “Routing Schemes for Hybrid Communication Networks.
    .” <i>Routing Schemes for Hybrid Communication Networks. Theor. Comput. Sci. 985:
    114352 (2024)</i>, 2024.'
  short: 'C. Scheideler, S. Coy, A. Czumaj, P. Schneider, J. Werthmann, Routing Schemes
    for Hybrid Communication Networks. Theor. Comput. Sci. 985: 114352 (2024) (2024).'
date_created: 2026-02-10T10:00:43Z
date_updated: 2026-02-11T09:12:57Z
department:
- _id: '34'
- _id: '7'
- _id: '79'
language:
- iso: eng
publication: 'Routing schemes for hybrid communication networks. Theor. Comput. Sci.
  985: 114352 (2024)'
status: public
title: 'Routing schemes for hybrid communication networks. '
type: journal_article
user_id: '15578'
year: '2024'
...
---
_id: '64102'
author:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Jinfeng
  full_name: Dou, Jinfeng
  id: '92888'
  last_name: Dou
citation:
  ama: 'Scheideler C, Dou J. Invited Paper: Blockchains made Lightweight: A Median
    Rule for State Machine Replication. . In: ApPLIED@PODC 2024; 2024.'
  apa: 'Scheideler, C., &#38; Dou, J. (2024). <i>Invited Paper: Blockchains made Lightweight:
    A Median Rule for State Machine Replication. </i>.'
  bibtex: '@inproceedings{Scheideler_Dou_2024, title={Invited Paper: Blockchains made
    Lightweight: A Median Rule for State Machine Replication. }, publisher={ApPLIED@PODC
    2024}, author={Scheideler, Christian and Dou, Jinfeng}, year={2024} }'
  chicago: 'Scheideler, Christian, and Jinfeng Dou. “Invited Paper: Blockchains Made
    Lightweight: A Median Rule for State Machine Replication. .” ApPLIED@PODC 2024,
    2024.'
  ieee: 'C. Scheideler and J. Dou, “Invited Paper: Blockchains made Lightweight: A
    Median Rule for State Machine Replication. ,” 2024.'
  mla: 'Scheideler, Christian, and Jinfeng Dou. <i>Invited Paper: Blockchains Made
    Lightweight: A Median Rule for State Machine Replication. </i>. ApPLIED@PODC 2024,
    2024.'
  short: 'C. Scheideler, J. Dou, in: ApPLIED@PODC 2024, 2024.'
date_created: 2026-02-10T10:04:11Z
date_updated: 2026-02-11T09:12:28Z
department:
- _id: '34'
- _id: '7'
- _id: '79'
language:
- iso: eng
publisher: ApPLIED@PODC 2024
status: public
title: 'Invited Paper: Blockchains made Lightweight: A Median Rule for State Machine
  Replication. '
type: conference
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., &#38; Kumar , M. (2024). <i>Reconfiguration and
    Locomotion with Joint Movements in the Amoebot Model. </i>.
  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. <i>Reconfiguration and Locomotion with Joint
    Movements in the Amoebot Model. </i>. 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: '57319'
author:
- first_name: Roja
  full_name: Raj, Roja
  last_name: Raj
citation:
  ama: Raj R. <i>Hexagon Shape Formation in the Amoebot Model with Immobilized Particles</i>.;
    2024.
  apa: Raj, R. (2024). <i>Hexagon Shape Formation in the Amoebot Model with Immobilized
    Particles</i>.
  bibtex: '@book{Raj_2024, title={Hexagon Shape Formation in the Amoebot Model with
    Immobilized Particles}, author={Raj, Roja}, year={2024} }'
  chicago: Raj, Roja. <i>Hexagon Shape Formation in the Amoebot Model with Immobilized
    Particles</i>, 2024.
  ieee: R. Raj, <i>Hexagon Shape Formation in the Amoebot Model with Immobilized Particles</i>.
    2024.
  mla: Raj, Roja. <i>Hexagon Shape Formation in the Amoebot Model with Immobilized
    Particles</i>. 2024.
  short: R. Raj, Hexagon Shape Formation in the Amoebot Model with Immobilized Particles,
    2024.
date_created: 2024-11-22T09:18:01Z
date_updated: 2024-11-22T09:19: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: Hexagon Shape Formation in the Amoebot Model with Immobilized Particles
type: mastersthesis
user_id: '15578'
year: '2024'
...
---
_id: '61172'
article_number: '114352'
author:
- first_name: Sam
  full_name: Coy, Sam
  last_name: Coy
- first_name: Artur
  full_name: Czumaj, Artur
  last_name: Czumaj
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Philipp
  full_name: Schneider, Philipp
  last_name: Schneider
- first_name: Julian
  full_name: Werthmann, Julian
  id: '50024'
  last_name: Werthmann
citation:
  ama: Coy S, Czumaj A, Scheideler C, Schneider P, Werthmann J. Routing Schemes for
    Hybrid Communication Networks. <i>Theoretical Computer Science</i>. 2024;985.
    doi:<a href="https://doi.org/10.1016/j.tcs.2023.114352">10.1016/j.tcs.2023.114352</a>
  apa: Coy, S., Czumaj, A., Scheideler, C., Schneider, P., &#38; Werthmann, J. (2024).
    Routing Schemes for Hybrid Communication Networks. <i>Theoretical Computer Science</i>,
    <i>985</i>, Article 114352. <a href="https://doi.org/10.1016/j.tcs.2023.114352">https://doi.org/10.1016/j.tcs.2023.114352</a>
  bibtex: '@article{Coy_Czumaj_Scheideler_Schneider_Werthmann_2024, title={Routing
    Schemes for Hybrid Communication Networks}, volume={985}, DOI={<a href="https://doi.org/10.1016/j.tcs.2023.114352">10.1016/j.tcs.2023.114352</a>},
    number={114352}, journal={Theoretical Computer Science}, publisher={Elsevier BV},
    author={Coy, Sam and Czumaj, Artur and Scheideler, Christian and Schneider, Philipp
    and Werthmann, Julian}, year={2024} }'
  chicago: Coy, Sam, Artur Czumaj, Christian Scheideler, Philipp Schneider, and Julian
    Werthmann. “Routing Schemes for Hybrid Communication Networks.” <i>Theoretical
    Computer Science</i> 985 (2024). <a href="https://doi.org/10.1016/j.tcs.2023.114352">https://doi.org/10.1016/j.tcs.2023.114352</a>.
  ieee: 'S. Coy, A. Czumaj, C. Scheideler, P. Schneider, and J. Werthmann, “Routing
    Schemes for Hybrid Communication Networks,” <i>Theoretical Computer Science</i>,
    vol. 985, Art. no. 114352, 2024, doi: <a href="https://doi.org/10.1016/j.tcs.2023.114352">10.1016/j.tcs.2023.114352</a>.'
  mla: Coy, Sam, et al. “Routing Schemes for Hybrid Communication Networks.” <i>Theoretical
    Computer Science</i>, vol. 985, 114352, Elsevier BV, 2024, doi:<a href="https://doi.org/10.1016/j.tcs.2023.114352">10.1016/j.tcs.2023.114352</a>.
  short: S. Coy, A. Czumaj, C. Scheideler, P. Schneider, J. Werthmann, Theoretical
    Computer Science 985 (2024).
date_created: 2025-09-10T14:26:11Z
date_updated: 2025-09-10T14:52:21Z
department:
- _id: '79'
doi: 10.1016/j.tcs.2023.114352
intvolume: '       985'
language:
- iso: eng
project:
- _id: '5'
  name: 'SFB 901; TP A1: Möglichkeiten und Grenzen lokaler Strategien in dynamischen
    Netzen'
publication: Theoretical Computer Science
publication_identifier:
  issn:
  - 0304-3975
publication_status: published
publisher: Elsevier BV
status: public
title: Routing Schemes for Hybrid Communication Networks
type: journal_article
user_id: '50024'
volume: 985
year: '2024'
...
---
_id: '49494'
author:
- first_name: Alexander
  full_name: Nickel, Alexander
  last_name: Nickel
citation:
  ama: Nickel A. <i>Entwicklung Und Analyse von Formeln Zur Abschätzung Der Renderingzeit
    Eines Frames</i>.; 2023.
  apa: Nickel, A. (2023). <i>Entwicklung und Analyse von Formeln zur Abschätzung der
    Renderingzeit eines Frames</i>.
  bibtex: '@book{Nickel_2023, title={Entwicklung und Analyse von Formeln zur Abschätzung
    der Renderingzeit eines Frames}, author={Nickel, Alexander}, year={2023} }'
  chicago: Nickel, Alexander. <i>Entwicklung Und Analyse von Formeln Zur Abschätzung
    Der Renderingzeit Eines Frames</i>, 2023.
  ieee: A. Nickel, <i>Entwicklung und Analyse von Formeln zur Abschätzung der Renderingzeit
    eines Frames</i>. 2023.
  mla: Nickel, Alexander. <i>Entwicklung Und Analyse von Formeln Zur Abschätzung Der
    Renderingzeit Eines Frames</i>. 2023.
  short: A. Nickel, Entwicklung Und Analyse von Formeln Zur Abschätzung Der Renderingzeit
    Eines Frames, 2023.
date_created: 2023-12-05T15:22:55Z
date_updated: 2023-12-05T15:23:12Z
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
- first_name: Matthias
  full_name: Fischer, Matthias
  id: '146'
  last_name: Fischer
title: Entwicklung und Analyse von Formeln zur Abschätzung der Renderingzeit eines
  Frames
type: bachelorsthesis
user_id: '15578'
year: '2023'
...
---
_id: '49493'
author:
- first_name: Vipasyan
  full_name: Telaprolu, Vipasyan
  last_name: Telaprolu
citation:
  ama: Telaprolu V. <i>Reconstruction of 3D Surfels from Neural Radiance Fields</i>.;
    2023.
  apa: Telaprolu, V. (2023). <i>Reconstruction of 3D Surfels from Neural Radiance
    Fields</i>.
  bibtex: '@book{Telaprolu_2023, title={Reconstruction of 3D Surfels from Neural Radiance
    Fields}, author={Telaprolu, Vipasyan}, year={2023} }'
  chicago: Telaprolu, Vipasyan. <i>Reconstruction of 3D Surfels from Neural Radiance
    Fields</i>, 2023.
  ieee: V. Telaprolu, <i>Reconstruction of 3D Surfels from Neural Radiance Fields</i>.
    2023.
  mla: Telaprolu, Vipasyan. <i>Reconstruction of 3D Surfels from Neural Radiance Fields</i>.
    2023.
  short: V. Telaprolu, Reconstruction of 3D Surfels from Neural Radiance Fields, 2023.
date_created: 2023-12-05T15:19:46Z
date_updated: 2023-12-05T15:20:10Z
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: Reconstruction of 3D Surfels from Neural Radiance Fields
type: mastersthesis
user_id: '15578'
year: '2023'
...
---
_id: '49492'
author:
- first_name: Jonas
  full_name: Friemel, Jonas
  last_name: Friemel
citation:
  ama: Friemel J. <i>Shape Reconfiguration by Hybrid Programmable Matter</i>.; 2023.
  apa: Friemel, J. (2023). <i>Shape Reconfiguration by Hybrid Programmable Matter</i>.
  bibtex: '@book{Friemel_2023, title={Shape Reconfiguration by Hybrid Programmable
    Matter}, author={Friemel, Jonas}, year={2023} }'
  chicago: Friemel, Jonas. <i>Shape Reconfiguration by Hybrid Programmable Matter</i>,
    2023.
  ieee: J. Friemel, <i>Shape Reconfiguration by Hybrid Programmable Matter</i>. 2023.
  mla: Friemel, Jonas. <i>Shape Reconfiguration by Hybrid Programmable Matter</i>.
    2023.
  short: J. Friemel, Shape Reconfiguration by Hybrid Programmable Matter, 2023.
date_created: 2023-12-05T15:18:17Z
date_updated: 2023-12-05T15:18: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: Shape Reconfiguration by Hybrid Programmable Matter
type: mastersthesis
user_id: '15578'
year: '2023'
...
---
_id: '52317'
author:
- first_name: Björn
  full_name: Beckendorf, Björn
  last_name: Beckendorf
citation:
  ama: Beckendorf B. <i>Self-Stabilizing Skip-Graph with Growth-Bounded Metric</i>.;
    2023.
  apa: Beckendorf, B. (2023). <i>Self-Stabilizing Skip-Graph with Growth-bounded Metric</i>.
  bibtex: '@book{Beckendorf_2023, title={Self-Stabilizing Skip-Graph with Growth-bounded
    Metric}, author={Beckendorf, Björn}, year={2023} }'
  chicago: Beckendorf, Björn. <i>Self-Stabilizing Skip-Graph with Growth-Bounded Metric</i>,
    2023.
  ieee: B. Beckendorf, <i>Self-Stabilizing Skip-Graph with Growth-bounded Metric</i>.
    2023.
  mla: Beckendorf, Björn. <i>Self-Stabilizing Skip-Graph with Growth-Bounded Metric</i>.
    2023.
  short: B. Beckendorf, Self-Stabilizing Skip-Graph with Growth-Bounded Metric, 2023.
date_created: 2024-03-05T12:48:39Z
date_updated: 2024-03-05T12:49:22Z
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: Self-Stabilizing Skip-Graph with Growth-bounded Metric
type: mastersthesis
user_id: '15578'
year: '2023'
...
---
_id: '46467'
author:
- first_name: Joshua J.
  full_name: Daymude, Joshua J.
  last_name: Daymude
- first_name: Andréa W.
  full_name: Richa, Andréa W.
  last_name: Richa
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
citation:
  ama: 'Daymude JJ, Richa AW, Scheideler C. The canonical amoebot model: algorithms
    and concurrency control. <i>Distributed Comput</i>. 2023;36(2):159–192. doi:<a
    href="https://doi.org/10.1007/s00446-023-00443-3">10.1007/s00446-023-00443-3</a>'
  apa: 'Daymude, J. J., Richa, A. W., &#38; Scheideler, C. (2023). The canonical amoebot
    model: algorithms and concurrency control. <i>Distributed Comput.</i>, <i>36</i>(2),
    159–192. <a href="https://doi.org/10.1007/s00446-023-00443-3">https://doi.org/10.1007/s00446-023-00443-3</a>'
  bibtex: '@article{Daymude_Richa_Scheideler_2023, title={The canonical amoebot model:
    algorithms and concurrency control}, volume={36}, DOI={<a href="https://doi.org/10.1007/s00446-023-00443-3">10.1007/s00446-023-00443-3</a>},
    number={2}, journal={Distributed Comput.}, author={Daymude, Joshua J. and Richa,
    Andréa W. and Scheideler, Christian}, year={2023}, pages={159–192} }'
  chicago: 'Daymude, Joshua J., Andréa W. Richa, and Christian Scheideler. “The Canonical
    Amoebot Model: Algorithms and Concurrency Control.” <i>Distributed Comput.</i>
    36, no. 2 (2023): 159–192. <a href="https://doi.org/10.1007/s00446-023-00443-3">https://doi.org/10.1007/s00446-023-00443-3</a>.'
  ieee: 'J. J. Daymude, A. W. Richa, and C. Scheideler, “The canonical amoebot model:
    algorithms and concurrency control,” <i>Distributed Comput.</i>, vol. 36, no.
    2, pp. 159–192, 2023, doi: <a href="https://doi.org/10.1007/s00446-023-00443-3">10.1007/s00446-023-00443-3</a>.'
  mla: 'Daymude, Joshua J., et al. “The Canonical Amoebot Model: Algorithms and Concurrency
    Control.” <i>Distributed Comput.</i>, vol. 36, no. 2, 2023, pp. 159–192, doi:<a
    href="https://doi.org/10.1007/s00446-023-00443-3">10.1007/s00446-023-00443-3</a>.'
  short: J.J. Daymude, A.W. Richa, C. Scheideler, Distributed Comput. 36 (2023) 159–192.
date_created: 2023-08-10T05:34:08Z
date_updated: 2024-07-05T07:01:06Z
department:
- _id: '79'
doi: 10.1007/s00446-023-00443-3
intvolume: '        36'
issue: '2'
language:
- iso: eng
page: 159–192
publication: Distributed Comput.
status: public
title: 'The canonical amoebot model: algorithms and concurrency control'
type: journal_article
user_id: '15504'
volume: 36
year: '2023'
...
---
_id: '43109'
author:
- first_name: Thorsten
  full_name: Götte, Thorsten
  id: '34727'
  last_name: Götte
- first_name: Christina
  full_name: Kolb, Christina
  last_name: Kolb
- 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: 'Götte T, Kolb C, Scheideler C, Werthmann J. Beep-and-Sleep: Message and Energy
    Efficient Set Cover. <i>Theor Comput Sci</i>. 2023;950:113756. doi:<a href="https://doi.org/10.1016/j.tcs.2023.113756">10.1016/j.tcs.2023.113756</a>'
  apa: 'Götte, T., Kolb, C., Scheideler, C., &#38; Werthmann, J. (2023). Beep-and-Sleep:
    Message and Energy Efficient Set Cover. <i>Theor. Comput. Sci.</i>, <i>950</i>,
    113756. <a href="https://doi.org/10.1016/j.tcs.2023.113756">https://doi.org/10.1016/j.tcs.2023.113756</a>'
  bibtex: '@article{Götte_Kolb_Scheideler_Werthmann_2023, title={Beep-and-Sleep: Message
    and Energy Efficient Set Cover}, volume={950}, DOI={<a href="https://doi.org/10.1016/j.tcs.2023.113756">10.1016/j.tcs.2023.113756</a>},
    journal={Theor. Comput. Sci.}, author={Götte, Thorsten and Kolb, Christina and
    Scheideler, Christian and Werthmann, Julian}, year={2023}, pages={113756} }'
  chicago: 'Götte, Thorsten, Christina Kolb, Christian Scheideler, and Julian Werthmann.
    “Beep-and-Sleep: Message and Energy Efficient Set Cover.” <i>Theor. Comput. Sci.</i>
    950 (2023): 113756. <a href="https://doi.org/10.1016/j.tcs.2023.113756">https://doi.org/10.1016/j.tcs.2023.113756</a>.'
  ieee: 'T. Götte, C. Kolb, C. Scheideler, and J. Werthmann, “Beep-and-Sleep: Message
    and Energy Efficient Set Cover,” <i>Theor. Comput. Sci.</i>, vol. 950, p. 113756,
    2023, doi: <a href="https://doi.org/10.1016/j.tcs.2023.113756">10.1016/j.tcs.2023.113756</a>.'
  mla: 'Götte, Thorsten, et al. “Beep-and-Sleep: Message and Energy Efficient Set
    Cover.” <i>Theor. Comput. Sci.</i>, vol. 950, 2023, p. 113756, doi:<a href="https://doi.org/10.1016/j.tcs.2023.113756">10.1016/j.tcs.2023.113756</a>.'
  short: T. Götte, C. Kolb, C. Scheideler, J. Werthmann, Theor. Comput. Sci. 950 (2023)
    113756.
date_created: 2023-03-27T07:45:44Z
date_updated: 2023-03-27T09:55:04Z
department:
- _id: '79'
doi: 10.1016/j.tcs.2023.113756
intvolume: '       950'
language:
- iso: eng
page: '113756'
project:
- _id: '1'
  name: 'SFB 901: SFB 901'
- _id: '2'
  name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '5'
  name: 'SFB 901 - A1: SFB 901 - Subproject A1'
publication: Theor. Comput. Sci.
status: public
title: 'Beep-and-Sleep: Message and Energy Efficient Set Cover'
type: journal_article
user_id: '15504'
volume: 950
year: '2023'
...
---
_id: '44735'
author:
- first_name: Jonas
  full_name: Schweichhart, Jonas
  last_name: Schweichhart
citation:
  ama: Schweichhart J. <i>Minimum Edge Cuts in Overlay Networks</i>.; 2023.
  apa: Schweichhart, J. (2023). <i>Minimum Edge Cuts in Overlay Networks</i>.
  bibtex: '@book{Schweichhart_2023, title={Minimum Edge Cuts in Overlay Networks},
    author={Schweichhart, Jonas}, year={2023} }'
  chicago: Schweichhart, Jonas. <i>Minimum Edge Cuts in Overlay Networks</i>, 2023.
  ieee: J. Schweichhart, <i>Minimum Edge Cuts in Overlay Networks</i>. 2023.
  mla: Schweichhart, Jonas. <i>Minimum Edge Cuts in Overlay Networks</i>. 2023.
  short: J. Schweichhart, Minimum Edge Cuts in Overlay Networks, 2023.
date_created: 2023-05-11T05:50:41Z
date_updated: 2023-05-11T05:51:15Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
  name: 'SFB 901: SFB 901'
- _id: '2'
  name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '5'
  name: 'SFB 901 - A1: SFB 901 - Subproject A1'
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: Minimum Edge Cuts in Overlay Networks
type: mastersthesis
user_id: '15504'
year: '2023'
...
---
_id: '45188'
author:
- first_name: Julian
  full_name: Werthmann, Julian
  id: '50024'
  last_name: Werthmann
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Sam
  full_name: Coy, Sam
  last_name: Coy
- first_name: Artur
  full_name: Czumaj, Artur
  last_name: Czumaj
- first_name: Philipp
  full_name: Schneider, Philipp
  last_name: Schneider
citation:
  ama: 'Werthmann J, Scheideler C, Coy S, Czumaj A, Schneider P. Routing Schemes for
    Hybrid Communication Networks. In: ; 2023. doi:<a href="https://doi.org/10.48550/ARXIV.2210.05333">10.48550/ARXIV.2210.05333</a>'
  apa: Werthmann, J., Scheideler, C., Coy, S., Czumaj, A., &#38; Schneider, P. (2023).
    <i>Routing Schemes for Hybrid Communication Networks</i>. <a href="https://doi.org/10.48550/ARXIV.2210.05333">https://doi.org/10.48550/ARXIV.2210.05333</a>
  bibtex: '@inproceedings{Werthmann_Scheideler_Coy_Czumaj_Schneider_2023, title={Routing
    Schemes for Hybrid Communication Networks}, DOI={<a href="https://doi.org/10.48550/ARXIV.2210.05333">10.48550/ARXIV.2210.05333</a>},
    author={Werthmann, Julian and Scheideler, Christian and Coy, Sam and Czumaj, Artur
    and Schneider, Philipp}, year={2023} }'
  chicago: Werthmann, Julian, Christian Scheideler, Sam Coy, Artur Czumaj, and Philipp
    Schneider. “Routing Schemes for Hybrid Communication Networks,” 2023. <a href="https://doi.org/10.48550/ARXIV.2210.05333">https://doi.org/10.48550/ARXIV.2210.05333</a>.
  ieee: 'J. Werthmann, C. Scheideler, S. Coy, A. Czumaj, and P. Schneider, “Routing
    Schemes for Hybrid Communication Networks,” 2023, doi: <a href="https://doi.org/10.48550/ARXIV.2210.05333">10.48550/ARXIV.2210.05333</a>.'
  mla: Werthmann, Julian, et al. <i>Routing Schemes for Hybrid Communication Networks</i>.
    2023, doi:<a href="https://doi.org/10.48550/ARXIV.2210.05333">10.48550/ARXIV.2210.05333</a>.
  short: 'J. Werthmann, C. Scheideler, S. Coy, A. Czumaj, P. Schneider, in: 2023.'
date_created: 2023-05-22T09:17:50Z
date_updated: 2023-05-22T09:37:25Z
department:
- _id: '79'
doi: 10.48550/ARXIV.2210.05333
language:
- iso: eng
project:
- _id: '1'
  name: 'SFB 901: SFB 901'
- _id: '2'
  name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '5'
  name: 'SFB 901 - A1: SFB 901 - Subproject A1'
status: public
title: Routing Schemes for Hybrid Communication Networks
type: conference
user_id: '50024'
year: '2023'
...
