---
_id: '66385'
author:
- first_name: Fabian Benedikt
full_name: Schiebel, Fabian Benedikt
id: '55745'
last_name: Schiebel
orcid: 0009-0008-6867-9802
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
citation:
ama: 'Schiebel FB, Bodden E. Scaling Bottom-Up IFDS Taint Analysis with Optimized
Data-Flow Encoding. In: Krebbers R, Silva A, eds. 40th European Conference
on Object-Oriented Programming (ECOOP 2026). Vol 372. Leibniz International
Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik;
2026:23:1–23:28. doi:10.4230/LIPIcs.ECOOP.2026.23'
apa: Schiebel, F. B., & Bodden, E. (2026). Scaling Bottom-Up IFDS Taint Analysis
with Optimized Data-Flow Encoding. In R. Krebbers & A. Silva (Eds.), 40th
European Conference on Object-Oriented Programming (ECOOP 2026) (Vol. 372,
p. 23:1–23:28). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ECOOP.2026.23
bibtex: '@inproceedings{Schiebel_Bodden_2026, place={Dagstuhl, Germany}, series={Leibniz
International Proceedings in Informatics (LIPIcs)}, title={Scaling Bottom-Up IFDS
Taint Analysis with Optimized Data-Flow Encoding}, volume={372}, DOI={10.4230/LIPIcs.ECOOP.2026.23},
booktitle={40th European Conference on Object-Oriented Programming (ECOOP 2026)},
publisher={Schloss Dagstuhl – Leibniz-Zentrum für Informatik}, author={Schiebel,
Fabian Benedikt and Bodden, Eric}, editor={Krebbers, Robbert and Silva, Alexandra},
year={2026}, pages={23:1–23:28}, collection={Leibniz International Proceedings
in Informatics (LIPIcs)} }'
chicago: 'Schiebel, Fabian Benedikt, and Eric Bodden. “Scaling Bottom-Up IFDS Taint
Analysis with Optimized Data-Flow Encoding.” In 40th European Conference on
Object-Oriented Programming (ECOOP 2026), edited by Robbert Krebbers and Alexandra
Silva, 372:23:1–23:28. Leibniz International Proceedings in Informatics (LIPIcs).
Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2026. https://doi.org/10.4230/LIPIcs.ECOOP.2026.23.'
ieee: 'F. B. Schiebel and E. Bodden, “Scaling Bottom-Up IFDS Taint Analysis with
Optimized Data-Flow Encoding,” in 40th European Conference on Object-Oriented
Programming (ECOOP 2026), Brussels, 2026, vol. 372, p. 23:1–23:28, doi: 10.4230/LIPIcs.ECOOP.2026.23.'
mla: Schiebel, Fabian Benedikt, and Eric Bodden. “Scaling Bottom-Up IFDS Taint Analysis
with Optimized Data-Flow Encoding.” 40th European Conference on Object-Oriented
Programming (ECOOP 2026), edited by Robbert Krebbers and Alexandra Silva,
vol. 372, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2026, p. 23:1–23:28,
doi:10.4230/LIPIcs.ECOOP.2026.23.
short: 'F.B. Schiebel, E. Bodden, in: R. Krebbers, A. Silva (Eds.), 40th European
Conference on Object-Oriented Programming (ECOOP 2026), Schloss Dagstuhl – Leibniz-Zentrum
für Informatik, Dagstuhl, Germany, 2026, p. 23:1–23:28.'
conference:
end_date: 2026-07-03
location: Brussels
name: 40th European Conference on Object-Oriented Programming (ECOOP)
start_date: 2026-06-29
date_created: 2026-07-08T12:48:44Z
date_updated: 2026-07-08T12:53:12Z
doi: 10.4230/LIPIcs.ECOOP.2026.23
editor:
- first_name: Robbert
full_name: Krebbers, Robbert
last_name: Krebbers
- first_name: Alexandra
full_name: Silva, Alexandra
last_name: Silva
intvolume: ' 372'
language:
- iso: eng
page: 23:1–23:28
place: Dagstuhl, Germany
publication: 40th European Conference on Object-Oriented Programming (ECOOP 2026)
publication_identifier:
isbn:
- 978-3-95977-423-9
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: Scaling Bottom-Up IFDS Taint Analysis with Optimized Data-Flow Encoding
type: conference
user_id: '55745'
volume: 372
year: '2026'
...
---
_id: '66433'
author:
- first_name: Fabian Benedikt
full_name: Schiebel, Fabian Benedikt
id: '55745'
last_name: Schiebel
orcid: 0009-0008-6867-9802
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
citation:
ama: 'Schiebel FB, Bodden E. Scaling Bottom-Up IFDS Taint Analysis with Optimized
Data-Flow Encoding. In: Krebbers R, Silva A, eds. 40th European Conference
on Object-Oriented Programming (ECOOP 2026). Vol 372. Leibniz International
Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik;
2026:23:1–23:28. doi:10.4230/LIPIcs.ECOOP.2026.23'
apa: Schiebel, F. B., & Bodden, E. (2026). Scaling Bottom-Up IFDS Taint Analysis
with Optimized Data-Flow Encoding. In R. Krebbers & A. Silva (Eds.), 40th
European Conference on Object-Oriented Programming (ECOOP 2026) (Vol. 372,
p. 23:1–23:28). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ECOOP.2026.23
bibtex: '@inproceedings{Schiebel_Bodden_2026, place={Dagstuhl, Germany}, series={Leibniz
International Proceedings in Informatics (LIPIcs)}, title={Scaling Bottom-Up IFDS
Taint Analysis with Optimized Data-Flow Encoding}, volume={372}, DOI={10.4230/LIPIcs.ECOOP.2026.23},
booktitle={40th European Conference on Object-Oriented Programming (ECOOP 2026)},
publisher={Schloss Dagstuhl – Leibniz-Zentrum für Informatik}, author={Schiebel,
Fabian Benedikt and Bodden, Eric}, editor={Krebbers, Robbert and Silva, Alexandra},
year={2026}, pages={23:1–23:28}, collection={Leibniz International Proceedings
in Informatics (LIPIcs)} }'
chicago: 'Schiebel, Fabian Benedikt, and Eric Bodden. “Scaling Bottom-Up IFDS Taint
Analysis with Optimized Data-Flow Encoding.” In 40th European Conference on
Object-Oriented Programming (ECOOP 2026), edited by Robbert Krebbers and Alexandra
Silva, 372:23:1–23:28. Leibniz International Proceedings in Informatics (LIPIcs).
Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2026. https://doi.org/10.4230/LIPIcs.ECOOP.2026.23.'
ieee: 'F. B. Schiebel and E. Bodden, “Scaling Bottom-Up IFDS Taint Analysis with
Optimized Data-Flow Encoding,” in 40th European Conference on Object-Oriented
Programming (ECOOP 2026), 2026, vol. 372, p. 23:1–23:28, doi: 10.4230/LIPIcs.ECOOP.2026.23.'
mla: Schiebel, Fabian Benedikt, and Eric Bodden. “Scaling Bottom-Up IFDS Taint Analysis
with Optimized Data-Flow Encoding.” 40th European Conference on Object-Oriented
Programming (ECOOP 2026), edited by Robbert Krebbers and Alexandra Silva,
vol. 372, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2026, p. 23:1–23:28,
doi:10.4230/LIPIcs.ECOOP.2026.23.
short: 'F.B. Schiebel, E. Bodden, in: R. Krebbers, A. Silva (Eds.), 40th European
Conference on Object-Oriented Programming (ECOOP 2026), Schloss Dagstuhl – Leibniz-Zentrum
für Informatik, Dagstuhl, Germany, 2026, p. 23:1–23:28.'
date_created: 2026-07-10T08:22:24Z
date_updated: 2026-07-10T08:22:40Z
department:
- _id: '76'
doi: 10.4230/LIPIcs.ECOOP.2026.23
editor:
- first_name: Robbert
full_name: Krebbers, Robbert
last_name: Krebbers
- first_name: Alexandra
full_name: Silva, Alexandra
last_name: Silva
intvolume: ' 372'
language:
- iso: eng
page: 23:1–23:28
place: Dagstuhl, Germany
publication: 40th European Conference on Object-Oriented Programming (ECOOP 2026)
publication_identifier:
isbn:
- 978-3-95977-423-9
issn:
- 1868-8969
publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: Scaling Bottom-Up IFDS Taint Analysis with Optimized Data-Flow Encoding
type: conference
user_id: '15249'
volume: 372
year: '2026'
...
---
_id: '59268'
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. Distributed and
Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs. In:
Meka R, ed. 16th Innovations in Theoretical Computer Science Conference (ITCS
2025). Vol 325. Leibniz International Proceedings in Informatics (LIPIcs).
Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2025:45:1–45:26. doi:10.4230/LIPIcs.ITCS.2025.45'
apa: Dou, J., Götte, T., Hillebrandt, H., Scheideler, C., & Werthmann, J. (2025).
Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted
Graphs. In R. Meka (Ed.), 16th Innovations in Theoretical Computer Science
Conference (ITCS 2025) (Vol. 325, p. 45:1–45:26). Schloss Dagstuhl – Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPIcs.ITCS.2025.45
bibtex: '@inproceedings{Dou_Götte_Hillebrandt_Scheideler_Werthmann_2025, place={Dagstuhl,
Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)},
title={Distributed and Parallel Low-Diameter Decompositions for Arbitrary and
Restricted Graphs}, volume={325}, DOI={10.4230/LIPIcs.ITCS.2025.45},
booktitle={16th Innovations in Theoretical Computer Science Conference (ITCS 2025)},
publisher={Schloss Dagstuhl – Leibniz-Zentrum für Informatik}, author={Dou, Jinfeng
and Götte, Thorsten and Hillebrandt, Henning and Scheideler, Christian and Werthmann,
Julian}, editor={Meka, Raghu}, year={2025}, pages={45:1–45:26}, collection={Leibniz
International Proceedings in Informatics (LIPIcs)} }'
chicago: 'Dou, Jinfeng, Thorsten Götte, Henning Hillebrandt, Christian Scheideler,
and Julian Werthmann. “Distributed and Parallel Low-Diameter Decompositions for
Arbitrary and Restricted Graphs.” In 16th Innovations in Theoretical Computer
Science Conference (ITCS 2025), edited by Raghu Meka, 325:45:1–45:26. Leibniz
International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss
Dagstuhl – Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.ITCS.2025.45.'
ieee: 'J. Dou, T. Götte, H. Hillebrandt, C. Scheideler, and J. Werthmann, “Distributed
and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs,”
in 16th Innovations in Theoretical Computer Science Conference (ITCS 2025),
2025, vol. 325, p. 45:1–45:26, doi: 10.4230/LIPIcs.ITCS.2025.45.'
mla: Dou, Jinfeng, et al. “Distributed and Parallel Low-Diameter Decompositions
for Arbitrary and Restricted Graphs.” 16th Innovations in Theoretical Computer
Science Conference (ITCS 2025), edited by Raghu Meka, vol. 325, Schloss Dagstuhl
– Leibniz-Zentrum für Informatik, 2025, p. 45:1–45:26, doi:10.4230/LIPIcs.ITCS.2025.45.
short: 'J. Dou, T. Götte, H. Hillebrandt, C. Scheideler, J. Werthmann, in: R. Meka
(Ed.), 16th Innovations in Theoretical Computer Science Conference (ITCS 2025),
Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2025, p.
45:1–45:26.'
date_created: 2025-04-02T14:09:19Z
date_updated: 2025-10-15T12:57:11Z
doi: 10.4230/LIPIcs.ITCS.2025.45
editor:
- first_name: Raghu
full_name: Meka, Raghu
last_name: Meka
intvolume: ' 325'
language:
- iso: eng
page: 45:1–45:26
place: Dagstuhl, Germany
publication: 16th Innovations in Theoretical Computer Science Conference (ITCS 2025)
publication_identifier:
isbn:
- 978-3-95977-361-4
issn:
- 1868-8969
publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted
Graphs
type: conference
user_id: '34727'
volume: 325
year: '2025'
...
---
_id: '56298'
abstract:
- lang: eng
text: "In the general pattern formation (GPF) problem, a swarm of simple autonomous,\r\ndisoriented
robots must form a given pattern. The robots' simplicity imply a\r\nstrong limitation:
When the initial configuration is rotationally symmetric,\r\nonly patterns with
a similar symmetry can be formed [Yamashita, Suzyuki; TCS\r\n2010]. The only known
algorithm to form large patterns with limited visibility\r\nand without memory
requires the robots to start in a near-gathering (a swarm of\r\nconstant diameter)
[Hahn et al.; SAND 2024]. However, not only do we not know\r\nany near-gathering
algorithm guaranteed to preserve symmetry but most natural\r\ngathering strategies
trivially increase symmetries [Castenow et al.; OPODIS\r\n2022].\r\n Thus, we
study near-gathering without changing the swarm's rotational\r\nsymmetry for disoriented,
oblivious robots with limited visibility (the\r\nOBLOT-model, see [Flocchini et
al.; 2019]). We introduce a technique based on\r\nthe theory of dynamical systems
to analyze how a given algorithm affects\r\nsymmetry and provide sufficient conditions
for symmetry preservation. Until\r\nnow, it was unknown whether the considered
OBLOT-model allows for any\r\nnon-trivial algorithm that always preserves symmetry.
Our first result shows\r\nthat a variant of Go-to-the-Average always preserves
symmetry but may sometimes\r\nlead to multiple, unconnected near-gathering clusters.
Our second result is a\r\nsymmetry-preserving near-gathering algorithm that works
on swarms with a convex\r\nboundary (the outer boundary of the unit disc graph)
and without holes (circles\r\nof diameter 1 inside the boundary without any robots)."
author:
- first_name: Raphael
full_name: Gerlach, Raphael
id: '32655'
last_name: Gerlach
orcid: 0009-0002-4750-2051
- first_name: Sören
full_name: von der Gracht, Sören
id: '97359'
last_name: von der Gracht
orcid: 0000-0002-8054-2058
- first_name: Christopher
full_name: Hahn, Christopher
last_name: Hahn
- first_name: Jonas
full_name: Harbig, Jonas
id: '47213'
last_name: Harbig
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
citation:
ama: 'Gerlach R, von der Gracht S, Hahn C, Harbig J, Kling P. Symmetry Preservation
in Swarms of Oblivious Robots with Limited Visibility. In: Bonomi S, Galletta
L, Rivière Etienne, Schiavoni Valerio, eds. 28th International Conference
on Principles of Distributed Systems (OPODIS 2024). Vol 324. Leibniz International
Proceedings in Informatics (LIPIcs). Schloss Dagstuhl -- Leibniz-Zentrum für Informatik;
2025. doi:10.4230/LIPIcs.OPODIS.2024.13'
apa: Gerlach, R., von der Gracht, S., Hahn, C., Harbig, J., & Kling, P. (2025).
Symmetry Preservation in Swarms of Oblivious Robots with Limited Visibility.
In S. Bonomi, L. Galletta, Etienne Rivière, & Valerio Schiavoni (Eds.),
28th International Conference on Principles of Distributed Systems (OPODIS
2024) (Vol. 324). Schloss Dagstuhl -- Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2024.13
bibtex: '@inproceedings{Gerlach_von der Gracht_Hahn_Harbig_Kling_2025, series={Leibniz
International Proceedings in Informatics (LIPIcs)}, title={Symmetry Preservation
in Swarms of Oblivious Robots with Limited Visibility}, volume={324}, DOI={10.4230/LIPIcs.OPODIS.2024.13},
booktitle={28th International Conference on Principles of Distributed Systems
(OPODIS 2024)}, publisher={Schloss Dagstuhl -- Leibniz-Zentrum für Informatik},
author={Gerlach, Raphael and von der Gracht, Sören and Hahn, Christopher and Harbig,
Jonas and Kling, Peter}, editor={Bonomi, Silvia and Galletta, Letterio and Rivière, Etienne
and Schiavoni, Valerio}, year={2025}, collection={Leibniz International Proceedings
in Informatics (LIPIcs)} }'
chicago: Gerlach, Raphael, Sören von der Gracht, Christopher Hahn, Jonas Harbig,
and Peter Kling. “Symmetry Preservation in Swarms of Oblivious Robots with Limited
Visibility.” In 28th International Conference on Principles of Distributed
Systems (OPODIS 2024), edited by Silvia Bonomi, Letterio Galletta, Etienne
Rivière, and Valerio Schiavoni, Vol. 324. Leibniz International Proceedings in
Informatics (LIPIcs). Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, 2025.
https://doi.org/10.4230/LIPIcs.OPODIS.2024.13.
ieee: 'R. Gerlach, S. von der Gracht, C. Hahn, J. Harbig, and P. Kling, “Symmetry
Preservation in Swarms of Oblivious Robots with Limited Visibility,” in 28th
International Conference on Principles of Distributed Systems (OPODIS 2024),
Lucca, Italy, 2025, vol. 324, doi: 10.4230/LIPIcs.OPODIS.2024.13.'
mla: Gerlach, Raphael, et al. “Symmetry Preservation in Swarms of Oblivious Robots
with Limited Visibility.” 28th International Conference on Principles of Distributed
Systems (OPODIS 2024), edited by Silvia Bonomi et al., vol. 324, Schloss Dagstuhl
-- Leibniz-Zentrum für Informatik, 2025, doi:10.4230/LIPIcs.OPODIS.2024.13.
short: 'R. Gerlach, S. von der Gracht, C. Hahn, J. Harbig, P. Kling, in: S. Bonomi,
L. Galletta, Etienne Rivière, Valerio Schiavoni (Eds.), 28th International Conference
on Principles of Distributed Systems (OPODIS 2024), Schloss Dagstuhl -- Leibniz-Zentrum
für Informatik, 2025.'
conference:
end_date: 2024-12-13
location: Lucca, Italy
name: 28th International Conference on Principles of Distributed Systems (OPODIS
2024)
start_date: 2024-12-11
date_created: 2024-10-01T13:29:43Z
date_updated: 2025-01-09T11:39:19Z
department:
- _id: '101'
doi: 10.4230/LIPIcs.OPODIS.2024.13
editor:
- first_name: Silvia
full_name: Bonomi, Silvia
last_name: Bonomi
- first_name: Letterio
full_name: Galletta, Letterio
last_name: Galletta
- first_name: ' Etienne'
full_name: Rivière, Etienne
last_name: Rivière
- first_name: ' Valerio'
full_name: Schiavoni, Valerio
last_name: Schiavoni
external_id:
arxiv:
- '2409.19277'
intvolume: ' 324'
keyword:
- Swarm Algorithm
- Swarm Robots
- Distributed Algorithm
- Pattern Formation
- Limited Visibility
- Oblivious
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2409.19277
oa: '1'
project:
- _id: '106'
grant_number: '453112019'
name: 'Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme'
publication: 28th International Conference on Principles of Distributed Systems (OPODIS
2024)
publication_identifier:
isbn:
- 978-3-95977-360-7
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: Symmetry Preservation in Swarms of Oblivious Robots with Limited Visibility
type: conference
user_id: '97359'
volume: 324
year: '2025'
...
---
_id: '66263'
author:
- first_name: Jian-Jia
full_name: Chen, Jian-Jia
last_name: Chen
- first_name: Junjie
full_name: Shi, Junjie
last_name: Shi
- first_name: Mario
full_name: Günzel, Mario
last_name: Günzel
- first_name: Georg
full_name: von der Brüggen, Georg
last_name: von der Brüggen
- first_name: Kuan-Hsun
full_name: Chen, Kuan-Hsun
last_name: Chen
- first_name: Peter
full_name: Bella, Peter
last_name: Bella
citation:
ama: 'Chen J-J, Shi J, Günzel M, von der Brüggen G, Chen K-H, Bella P. Theoretical
Foundations of Utility Accrual for Real-Time Systems. In: Mancuso R, ed. 37th
Euromicro Conference on Real-Time Systems (ECRTS 2025). Vol 335. Leibniz International
Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik;
2025:17:1–17:26. doi:10.4230/LIPIcs.ECRTS.2025.17'
apa: Chen, J.-J., Shi, J., Günzel, M., von der Brüggen, G., Chen, K.-H., & Bella,
P. (2025). Theoretical Foundations of Utility Accrual for Real-Time Systems. In
R. Mancuso (Ed.), 37th Euromicro Conference on Real-Time Systems (ECRTS 2025)
(Vol. 335, p. 17:1–17:26). Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.ECRTS.2025.17
bibtex: '@inproceedings{Chen_Shi_Günzel_von der Brüggen_Chen_Bella_2025, place={Dagstuhl,
Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)},
title={Theoretical Foundations of Utility Accrual for Real-Time Systems}, volume={335},
DOI={10.4230/LIPIcs.ECRTS.2025.17},
booktitle={37th Euromicro Conference on Real-Time Systems (ECRTS 2025)}, publisher={Schloss
Dagstuhl – Leibniz-Zentrum für Informatik}, author={Chen, Jian-Jia and Shi, Junjie
and Günzel, Mario and von der Brüggen, Georg and Chen, Kuan-Hsun and Bella, Peter},
editor={Mancuso, Renato}, year={2025}, pages={17:1–17:26}, collection={Leibniz
International Proceedings in Informatics (LIPIcs)} }'
chicago: 'Chen, Jian-Jia, Junjie Shi, Mario Günzel, Georg von der Brüggen, Kuan-Hsun
Chen, and Peter Bella. “Theoretical Foundations of Utility Accrual for Real-Time
Systems.” In 37th Euromicro Conference on Real-Time Systems (ECRTS 2025),
edited by Renato Mancuso, 335:17:1–17:26. Leibniz International Proceedings in
Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für
Informatik, 2025. https://doi.org/10.4230/LIPIcs.ECRTS.2025.17.'
ieee: 'J.-J. Chen, J. Shi, M. Günzel, G. von der Brüggen, K.-H. Chen, and P. Bella,
“Theoretical Foundations of Utility Accrual for Real-Time Systems,” in 37th
Euromicro Conference on Real-Time Systems (ECRTS 2025), 2025, vol. 335, p.
17:1–17:26, doi: 10.4230/LIPIcs.ECRTS.2025.17.'
mla: Chen, Jian-Jia, et al. “Theoretical Foundations of Utility Accrual for Real-Time
Systems.” 37th Euromicro Conference on Real-Time Systems (ECRTS 2025),
edited by Renato Mancuso, vol. 335, Schloss Dagstuhl – Leibniz-Zentrum für Informatik,
2025, p. 17:1–17:26, doi:10.4230/LIPIcs.ECRTS.2025.17.
short: 'J.-J. Chen, J. Shi, M. Günzel, G. von der Brüggen, K.-H. Chen, P. Bella,
in: R. Mancuso (Ed.), 37th Euromicro Conference on Real-Time Systems (ECRTS 2025),
Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2025, p.
17:1–17:26.'
date_created: 2026-07-05T14:40:01Z
date_updated: 2026-07-05T14:43:00Z
doi: 10.4230/LIPIcs.ECRTS.2025.17
editor:
- first_name: Renato
full_name: Mancuso, Renato
last_name: Mancuso
intvolume: ' 335'
page: 17:1–17:26
place: Dagstuhl, Germany
publication: 37th Euromicro Conference on Real-Time Systems (ECRTS 2025)
publication_identifier:
isbn:
- 978-3-95977-377-5
issn:
- 1868-8969
publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: Theoretical Foundations of Utility Accrual for Real-Time Systems
type: conference
user_id: '128464'
volume: 335
year: '2025'
...
---
_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. 3rd Symposium on Algorithmic Foundations of Dynamic
Networks (SAND 2024). Vol 292. Leibniz International Proceedings in Informatics
(LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2024:15:1–15:20.
doi:10.4230/LIPIcs.SAND.2024.15'
apa: 'Hinnenthal, K., Liedtke, D. J., & Scheideler, C. (2024). Efficient Shape
Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate
Structures. In A. Casteigts & F. Kuhn (Eds.), 3rd Symposium on Algorithmic
Foundations of Dynamic Networks (SAND 2024) (Vol. 292, p. 15:1–15:20). Schloss
Dagstuhl – Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SAND.2024.15'
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={10.4230/LIPIcs.SAND.2024.15},
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 3rd Symposium on Algorithmic Foundations of Dynamic
Networks (SAND 2024), 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. https://doi.org/10.4230/LIPIcs.SAND.2024.15.'
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 3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024),
2024, vol. 292, p. 15:1–15:20, doi: 10.4230/LIPIcs.SAND.2024.15.'
mla: 'Hinnenthal, Kristian, et al. “Efficient Shape Formation by 3D Hybrid Programmable
Matter: An Algorithm for Low Diameter Intermediate Structures.” 3rd Symposium
on Algorithmic Foundations of Dynamic Networks (SAND 2024), edited by Arnaud
Casteigts and Fabian Kuhn, vol. 292, Schloss Dagstuhl – Leibniz-Zentrum für Informatik,
2024, p. 15:1–15:20, doi:10.4230/LIPIcs.SAND.2024.15.'
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: '56863'
author:
- first_name: Fabian Benedikt
full_name: Schiebel, Fabian Benedikt
id: '55745'
last_name: Schiebel
orcid: 0009-0008-6867-9802
- first_name: Florian
full_name: Sattler, Florian
last_name: Sattler
- first_name: Philipp Dominik
full_name: Schubert, Philipp Dominik
last_name: Schubert
- first_name: Sven
full_name: Apel, Sven
last_name: Apel
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
citation:
ama: 'Schiebel FB, Sattler F, Schubert PD, Apel S, Bodden E. Scaling Interprocedural
Static Data-Flow Analysis to Large C/C++ Applications: An Experience Report. In:
Aldrich J, Salvaneschi G, eds. 38th European Conference on Object-Oriented
Programming (ECOOP 2024). Vol 313. Leibniz International Proceedings in Informatics
(LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2024:36:1–36:28.
doi:10.4230/LIPIcs.ECOOP.2024.36'
apa: 'Schiebel, F. B., Sattler, F., Schubert, P. D., Apel, S., & Bodden, E.
(2024). Scaling Interprocedural Static Data-Flow Analysis to Large C/C++ Applications:
An Experience Report. In J. Aldrich & G. Salvaneschi (Eds.), 38th European
Conference on Object-Oriented Programming (ECOOP 2024) (Vol. 313, p. 36:1–36:28).
Schloss Dagstuhl – Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ECOOP.2024.36'
bibtex: '@inproceedings{Schiebel_Sattler_Schubert_Apel_Bodden_2024, place={Dagstuhl,
Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)},
title={Scaling Interprocedural Static Data-Flow Analysis to Large C/C++ Applications:
An Experience Report}, volume={313}, DOI={10.4230/LIPIcs.ECOOP.2024.36},
booktitle={38th European Conference on Object-Oriented Programming (ECOOP 2024)},
publisher={Schloss Dagstuhl – Leibniz-Zentrum für Informatik}, author={Schiebel,
Fabian Benedikt and Sattler, Florian and Schubert, Philipp Dominik and Apel, Sven
and Bodden, Eric}, editor={Aldrich, Jonathan and Salvaneschi, Guido}, year={2024},
pages={36:1–36:28}, collection={Leibniz International Proceedings in Informatics
(LIPIcs)} }'
chicago: 'Schiebel, Fabian Benedikt, Florian Sattler, Philipp Dominik Schubert,
Sven Apel, and Eric Bodden. “Scaling Interprocedural Static Data-Flow Analysis
to Large C/C++ Applications: An Experience Report.” In 38th European Conference
on Object-Oriented Programming (ECOOP 2024), edited by Jonathan Aldrich and
Guido Salvaneschi, 313:36:1–36:28. Leibniz International Proceedings in Informatics
(LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik,
2024. https://doi.org/10.4230/LIPIcs.ECOOP.2024.36.'
ieee: 'F. B. Schiebel, F. Sattler, P. D. Schubert, S. Apel, and E. Bodden, “Scaling
Interprocedural Static Data-Flow Analysis to Large C/C++ Applications: An Experience
Report,” in 38th European Conference on Object-Oriented Programming (ECOOP
2024), 2024, vol. 313, p. 36:1–36:28, doi: 10.4230/LIPIcs.ECOOP.2024.36.'
mla: 'Schiebel, Fabian Benedikt, et al. “Scaling Interprocedural Static Data-Flow
Analysis to Large C/C++ Applications: An Experience Report.” 38th European
Conference on Object-Oriented Programming (ECOOP 2024), edited by Jonathan
Aldrich and Guido Salvaneschi, vol. 313, Schloss Dagstuhl – Leibniz-Zentrum für
Informatik, 2024, p. 36:1–36:28, doi:10.4230/LIPIcs.ECOOP.2024.36.'
short: 'F.B. Schiebel, F. Sattler, P.D. Schubert, S. Apel, E. Bodden, in: J. Aldrich,
G. Salvaneschi (Eds.), 38th European Conference on Object-Oriented Programming
(ECOOP 2024), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany,
2024, p. 36:1–36:28.'
date_created: 2024-11-04T13:37:23Z
date_updated: 2025-12-04T10:41:59Z
department:
- _id: '76'
- _id: '662'
doi: 10.4230/LIPIcs.ECOOP.2024.36
editor:
- first_name: Jonathan
full_name: Aldrich, Jonathan
last_name: Aldrich
- first_name: Guido
full_name: Salvaneschi, Guido
last_name: Salvaneschi
intvolume: ' 313'
language:
- iso: eng
page: 36:1–36:28
place: Dagstuhl, Germany
publication: 38th European Conference on Object-Oriented Programming (ECOOP 2024)
publication_identifier:
isbn:
- 978-3-95977-341-6
issn:
- 1868-8969
publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: 'Scaling Interprocedural Static Data-Flow Analysis to Large C/C++ Applications:
An Experience Report'
type: conference
user_id: '15249'
volume: 313
year: '2024'
...
---
_id: '34008'
author:
- first_name: Jannik
full_name: Castenow, Jannik
id: '38705'
last_name: Castenow
- first_name: Jonas
full_name: Harbig, Jonas
id: '47213'
last_name: Harbig
- first_name: Daniel
full_name: Jung, Daniel
id: '37827'
last_name: Jung
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Till
full_name: Knollmann, Till
id: '39241'
last_name: Knollmann
orcid: 0000-0003-2014-4696
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Castenow J, Harbig J, Jung D, Kling P, Knollmann T, Meyer auf der Heide F.
A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited
Visibility . In: Hillel E, Palmieri R, Riviére E, eds. Proceedings of the 26th
International Conference on Principles of Distributed Systems (OPODIS) . Vol
253. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl
– Leibniz Zentrum für Informatik; 2023:15:1–15:25. doi:10.4230/LIPIcs.OPODIS.2022.15'
apa: Castenow, J., Harbig, J., Jung, D., Kling, P., Knollmann, T., & Meyer auf
der Heide, F. (2023). A Unifying Approach to Efficient (Near-)Gathering of Disoriented
Robots with Limited Visibility . In E. Hillel, R. Palmieri, & E. Riviére (Eds.),
Proceedings of the 26th International Conference on Principles of Distributed
Systems (OPODIS) (Vol. 253, p. 15:1–15:25). Schloss Dagstuhl – Leibniz Zentrum
für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2022.15
bibtex: '@inproceedings{Castenow_Harbig_Jung_Kling_Knollmann_Meyer auf der Heide_2023,
place={Brussels}, series={Leibniz International Proceedings in Informatics (LIPIcs)},
title={A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots
with Limited Visibility }, volume={253}, DOI={10.4230/LIPIcs.OPODIS.2022.15},
booktitle={Proceedings of the 26th International Conference on Principles of Distributed
Systems (OPODIS) }, publisher={Schloss Dagstuhl – Leibniz Zentrum für Informatik},
author={Castenow, Jannik and Harbig, Jonas and Jung, Daniel and Kling, Peter and
Knollmann, Till and Meyer auf der Heide, Friedhelm}, editor={Hillel, Eshcar and
Palmieri, Roberto and Riviére, Etienne}, year={2023}, pages={15:1–15:25}, collection={Leibniz
International Proceedings in Informatics (LIPIcs)} }'
chicago: 'Castenow, Jannik, Jonas Harbig, Daniel Jung, Peter Kling, Till Knollmann,
and Friedhelm Meyer auf der Heide. “A Unifying Approach to Efficient (Near-)Gathering
of Disoriented Robots with Limited Visibility .” In Proceedings of the 26th
International Conference on Principles of Distributed Systems (OPODIS) , edited
by Eshcar Hillel, Roberto Palmieri, and Etienne Riviére, 253:15:1–15:25. Leibniz
International Proceedings in Informatics (LIPIcs). Brussels: Schloss Dagstuhl
– Leibniz Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.OPODIS.2022.15.'
ieee: 'J. Castenow, J. Harbig, D. Jung, P. Kling, T. Knollmann, and F. Meyer auf
der Heide, “A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots
with Limited Visibility ,” in Proceedings of the 26th International Conference
on Principles of Distributed Systems (OPODIS) , Brussels, 2023, vol. 253,
p. 15:1–15:25, doi: 10.4230/LIPIcs.OPODIS.2022.15.'
mla: Castenow, Jannik, et al. “A Unifying Approach to Efficient (Near-)Gathering
of Disoriented Robots with Limited Visibility .” Proceedings of the 26th International
Conference on Principles of Distributed Systems (OPODIS) , edited by Eshcar
Hillel et al., vol. 253, Schloss Dagstuhl – Leibniz Zentrum für Informatik, 2023,
p. 15:1–15:25, doi:10.4230/LIPIcs.OPODIS.2022.15.
short: 'J. Castenow, J. Harbig, D. Jung, P. Kling, T. Knollmann, F. Meyer auf der
Heide, in: E. Hillel, R. Palmieri, E. Riviére (Eds.), Proceedings of the 26th
International Conference on Principles of Distributed Systems (OPODIS) , Schloss
Dagstuhl – Leibniz Zentrum für Informatik, Brussels, 2023, p. 15:1–15:25.'
conference:
end_date: 2022-12-15
location: Brussels
name: 26th International Conference on Principles of Distributed Systems (OPODIS)
start_date: 2022-12-13
date_created: 2022-11-04T09:41:30Z
date_updated: 2023-02-15T14:53:12Z
department:
- _id: '63'
doi: 10.4230/LIPIcs.OPODIS.2022.15
editor:
- first_name: Eshcar
full_name: Hillel, Eshcar
last_name: Hillel
- first_name: Roberto
full_name: Palmieri, Roberto
last_name: Palmieri
- first_name: Etienne
full_name: Riviére, Etienne
last_name: Riviére
external_id:
arxiv:
- '2206.07567 '
intvolume: ' 253'
language:
- iso: eng
page: 15:1–15:25
place: Brussels
project:
- _id: '106'
name: 'Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme'
publication: 'Proceedings of the 26th International Conference on Principles of Distributed
Systems (OPODIS) '
publication_identifier:
isbn:
- 978-3-95977-265-5
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl – Leibniz Zentrum für Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: 'A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with
Limited Visibility '
type: conference
user_id: '38705'
volume: 253
year: '2023'
...
---
_id: '66264'
author:
- first_name: Mario
full_name: Günzel, Mario
last_name: Günzel
- first_name: Harun
full_name: Teper, Harun
last_name: Teper
- first_name: Kuan-Hsun
full_name: Chen, Kuan-Hsun
last_name: Chen
- first_name: Georg
full_name: von der Brüggen, Georg
last_name: von der Brüggen
- first_name: Jian-Jia
full_name: Chen, Jian-Jia
last_name: Chen
citation:
ama: 'Günzel M, Teper H, Chen K-H, von der Brüggen G, Chen J-J. On the Equivalence
of Maximum Reaction Time and Maximum Data Age for Cause-Effect Chains. In: Papadopoulos
AV, ed. 35th Euromicro Conference on Real-Time Systems (ECRTS 2023). Vol
262. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl
– Leibniz-Zentrum für Informatik; 2023:10:1–10:22. doi:10.4230/LIPIcs.ECRTS.2023.10'
apa: Günzel, M., Teper, H., Chen, K.-H., von der Brüggen, G., & Chen, J.-J.
(2023). On the Equivalence of Maximum Reaction Time and Maximum Data Age for Cause-Effect
Chains. In A. V. Papadopoulos (Ed.), 35th Euromicro Conference on Real-Time
Systems (ECRTS 2023) (Vol. 262, p. 10:1–10:22). Schloss Dagstuhl – Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPIcs.ECRTS.2023.10
bibtex: '@inproceedings{Günzel_Teper_Chen_von der Brüggen_Chen_2023, place={Dagstuhl,
Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)},
title={On the Equivalence of Maximum Reaction Time and Maximum Data Age for Cause-Effect
Chains}, volume={262}, DOI={10.4230/LIPIcs.ECRTS.2023.10},
booktitle={35th Euromicro Conference on Real-Time Systems (ECRTS 2023)}, publisher={Schloss
Dagstuhl – Leibniz-Zentrum für Informatik}, author={Günzel, Mario and Teper, Harun
and Chen, Kuan-Hsun and von der Brüggen, Georg and Chen, Jian-Jia}, editor={Papadopoulos,
Alessandro V.}, year={2023}, pages={10:1–10:22}, collection={Leibniz International
Proceedings in Informatics (LIPIcs)} }'
chicago: 'Günzel, Mario, Harun Teper, Kuan-Hsun Chen, Georg von der Brüggen, and
Jian-Jia Chen. “On the Equivalence of Maximum Reaction Time and Maximum Data Age
for Cause-Effect Chains.” In 35th Euromicro Conference on Real-Time Systems
(ECRTS 2023), edited by Alessandro V. Papadopoulos, 262:10:1–10:22. Leibniz
International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss
Dagstuhl – Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.ECRTS.2023.10.'
ieee: 'M. Günzel, H. Teper, K.-H. Chen, G. von der Brüggen, and J.-J. Chen, “On
the Equivalence of Maximum Reaction Time and Maximum Data Age for Cause-Effect
Chains,” in 35th Euromicro Conference on Real-Time Systems (ECRTS 2023),
2023, vol. 262, p. 10:1–10:22, doi: 10.4230/LIPIcs.ECRTS.2023.10.'
mla: Günzel, Mario, et al. “On the Equivalence of Maximum Reaction Time and Maximum
Data Age for Cause-Effect Chains.” 35th Euromicro Conference on Real-Time Systems
(ECRTS 2023), edited by Alessandro V. Papadopoulos, vol. 262, Schloss Dagstuhl
– Leibniz-Zentrum für Informatik, 2023, p. 10:1–10:22, doi:10.4230/LIPIcs.ECRTS.2023.10.
short: 'M. Günzel, H. Teper, K.-H. Chen, G. von der Brüggen, J.-J. Chen, in: A.V.
Papadopoulos (Ed.), 35th Euromicro Conference on Real-Time Systems (ECRTS 2023),
Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2023, p.
10:1–10:22.'
date_created: 2026-07-05T14:40:09Z
date_updated: 2026-07-05T14:42:56Z
doi: 10.4230/LIPIcs.ECRTS.2023.10
editor:
- first_name: Alessandro V.
full_name: Papadopoulos, Alessandro V.
last_name: Papadopoulos
intvolume: ' 262'
page: 10:1–10:22
place: Dagstuhl, Germany
publication: 35th Euromicro Conference on Real-Time Systems (ECRTS 2023)
publication_identifier:
isbn:
- 978-3-95977-280-8
issn:
- 1868-8969
publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: On the Equivalence of Maximum Reaction Time and Maximum Data Age for Cause-Effect
Chains
type: conference
user_id: '128464'
volume: 262
year: '2023'
...
---
_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: '32603'
author:
- first_name: Irina
full_name: Kostitsyna, Irina
last_name: Kostitsyna
- 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: 'Kostitsyna I, Scheideler C, Warner D. Fault-Tolerant Shape Formation 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:9:1–9:22. doi:10.4230/LIPIcs.DNA.28.9'
apa: Kostitsyna, I., Scheideler, C., & Warner, D. (2022). Fault-Tolerant Shape
Formation 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. 9:1–9:22). Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.DNA.28.9
bibtex: '@inproceedings{Kostitsyna_Scheideler_Warner_2022, place={Dagstuhl, Germany},
series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Fault-Tolerant
Shape Formation in the Amoebot Model}, volume={238}, DOI={10.4230/LIPIcs.DNA.28.9},
booktitle={28th International Conference on DNA Computing and Molecular Programming
(DNA 28)}, publisher={Schloss Dagstuhl – Leibniz-Zentrum für Informatik}, author={Kostitsyna,
Irina and Scheideler, Christian and Warner, Daniel}, editor={Ouldridge, Thomas
E. and Wickham, Shelley F. J.}, year={2022}, pages={9:1–9:22}, collection={Leibniz
International Proceedings in Informatics (LIPIcs)} }'
chicago: 'Kostitsyna, Irina, Christian Scheideler, and Daniel Warner. “Fault-Tolerant
Shape Formation 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:9:1–9: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.9.'
ieee: 'I. Kostitsyna, C. Scheideler, and D. Warner, “Fault-Tolerant Shape Formation
in the Amoebot Model,” in 28th International Conference on DNA Computing and
Molecular Programming (DNA 28), 2022, vol. 238, p. 9:1–9:22, doi: 10.4230/LIPIcs.DNA.28.9.'
mla: Kostitsyna, Irina, et al. “Fault-Tolerant Shape Formation 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. 9:1–9:22, doi:10.4230/LIPIcs.DNA.28.9.
short: 'I. Kostitsyna, 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. 9:1–9:22.'
date_created: 2022-08-08T17:42:43Z
date_updated: 2022-11-17T14:17:09Z
department:
- _id: '79'
doi: 10.4230/LIPIcs.DNA.28.9
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: 9:1–9:22
place: Dagstuhl, Germany
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _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: Fault-Tolerant Shape Formation in the Amoebot Model
type: conference
user_id: '477'
volume: 238
year: '2022'
...
---
_id: '30987'
author:
- first_name: Irina
full_name: Kostitsyna, Irina
last_name: Kostitsyna
- 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: 'Kostitsyna I, Scheideler C, Warner D. Brief Announcement: Fault-Tolerant Shape
Formation in the Amoebot Model. In: Aspnes J, Michail O, eds. 1st Symposium
on Algorithmic Foundations of Dynamic Networks (SAND 2022). Vol 221. Leibniz
International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum
für Informatik; 2022:23:1–23:3. doi:10.4230/LIPIcs.SAND.2022.23'
apa: 'Kostitsyna, I., Scheideler, C., & Warner, D. (2022). Brief Announcement:
Fault-Tolerant Shape Formation in the Amoebot Model. In J. Aspnes & O. Michail
(Eds.), 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND
2022) (Vol. 221, p. 23:1–23:3). Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.SAND.2022.23'
bibtex: '@inproceedings{Kostitsyna_Scheideler_Warner_2022, place={Dagstuhl, Germany},
series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Brief
Announcement: Fault-Tolerant Shape Formation in the Amoebot Model}, volume={221},
DOI={10.4230/LIPIcs.SAND.2022.23},
booktitle={1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND
2022)}, publisher={Schloss Dagstuhl – Leibniz-Zentrum für Informatik}, author={Kostitsyna,
Irina and Scheideler, Christian and Warner, Daniel}, editor={Aspnes, James and
Michail, Othon}, year={2022}, pages={23:1–23:3}, collection={Leibniz International
Proceedings in Informatics (LIPIcs)} }'
chicago: 'Kostitsyna, Irina, Christian Scheideler, and Daniel Warner. “Brief Announcement:
Fault-Tolerant Shape Formation in the Amoebot Model.” In 1st Symposium on Algorithmic
Foundations of Dynamic Networks (SAND 2022), edited by James Aspnes and Othon
Michail, 221:23:1–23:3. Leibniz International Proceedings in Informatics (LIPIcs).
Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.SAND.2022.23.'
ieee: 'I. Kostitsyna, C. Scheideler, and D. Warner, “Brief Announcement: Fault-Tolerant
Shape Formation in the Amoebot Model,” in 1st Symposium on Algorithmic Foundations
of Dynamic Networks (SAND 2022), 2022, vol. 221, p. 23:1–23:3, doi: 10.4230/LIPIcs.SAND.2022.23.'
mla: 'Kostitsyna, Irina, et al. “Brief Announcement: Fault-Tolerant Shape Formation
in the Amoebot Model.” 1st Symposium on Algorithmic Foundations of Dynamic
Networks (SAND 2022), edited by James Aspnes and Othon Michail, vol. 221,
Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022, p. 23:1–23:3, doi:10.4230/LIPIcs.SAND.2022.23.'
short: 'I. Kostitsyna, C. Scheideler, D. Warner, in: J. Aspnes, O. Michail (Eds.),
1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022), Schloss
Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022, p. 23:1–23:3.'
date_created: 2022-05-03T00:13:06Z
date_updated: 2022-10-27T08:45:52Z
department:
- _id: '79'
doi: 10.4230/LIPIcs.SAND.2022.23
editor:
- first_name: James
full_name: Aspnes, James
last_name: Aspnes
- first_name: Othon
full_name: Michail, Othon
last_name: Michail
intvolume: ' 221'
language:
- iso: eng
page: 23:1–23:3
place: Dagstuhl, Germany
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '13'
name: 'SFB 901 - C1: SFB 901 - Subproject C1'
publication: 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)
publication_identifier:
isbn:
- 978-3-95977-224-2
issn:
- 1868-8969
publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: 'Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model'
type: conference
user_id: '15504'
volume: 221
year: '2022'
...
---
_id: '66265'
author:
- first_name: Kuan-Hsun
full_name: Chen, Kuan-Hsun
last_name: Chen
- first_name: Mario
full_name: Günzel, Mario
last_name: Günzel
- first_name: Boguslaw
full_name: Jablkowski, Boguslaw
last_name: Jablkowski
- first_name: Markus
full_name: Buschhoff, Markus
last_name: Buschhoff
- first_name: Jian-Jia
full_name: Chen, Jian-Jia
last_name: Chen
citation:
ama: 'Chen K-H, Günzel M, Jablkowski B, Buschhoff M, Chen J-J. Unikernel-Based Real-Time
Virtualization Under Deferrable Servers: Analysis and Realization. In: Maggio
M, ed. 34th Euromicro Conference on Real-Time Systems (ECRTS 2022). Vol
231. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl
– Leibniz-Zentrum für Informatik; 2022:6:1–6:22. doi:10.4230/LIPIcs.ECRTS.2022.6'
apa: 'Chen, K.-H., Günzel, M., Jablkowski, B., Buschhoff, M., & Chen, J.-J.
(2022). Unikernel-Based Real-Time Virtualization Under Deferrable Servers: Analysis
and Realization. In M. Maggio (Ed.), 34th Euromicro Conference on Real-Time
Systems (ECRTS 2022) (Vol. 231, p. 6:1–6:22). Schloss Dagstuhl – Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPIcs.ECRTS.2022.6'
bibtex: '@inproceedings{Chen_Günzel_Jablkowski_Buschhoff_Chen_2022, place={Dagstuhl,
Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)},
title={Unikernel-Based Real-Time Virtualization Under Deferrable Servers: Analysis
and Realization}, volume={231}, DOI={10.4230/LIPIcs.ECRTS.2022.6},
booktitle={34th Euromicro Conference on Real-Time Systems (ECRTS 2022)}, publisher={Schloss
Dagstuhl – Leibniz-Zentrum für Informatik}, author={Chen, Kuan-Hsun and Günzel,
Mario and Jablkowski, Boguslaw and Buschhoff, Markus and Chen, Jian-Jia}, editor={Maggio,
Martina}, year={2022}, pages={6:1–6:22}, collection={Leibniz International Proceedings
in Informatics (LIPIcs)} }'
chicago: 'Chen, Kuan-Hsun, Mario Günzel, Boguslaw Jablkowski, Markus Buschhoff,
and Jian-Jia Chen. “Unikernel-Based Real-Time Virtualization Under Deferrable
Servers: Analysis and Realization.” In 34th Euromicro Conference on Real-Time
Systems (ECRTS 2022), edited by Martina Maggio, 231:6:1–6:22. Leibniz International
Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum
für Informatik, 2022. https://doi.org/10.4230/LIPIcs.ECRTS.2022.6.'
ieee: 'K.-H. Chen, M. Günzel, B. Jablkowski, M. Buschhoff, and J.-J. Chen, “Unikernel-Based
Real-Time Virtualization Under Deferrable Servers: Analysis and Realization,”
in 34th Euromicro Conference on Real-Time Systems (ECRTS 2022), 2022, vol.
231, p. 6:1–6:22, doi: 10.4230/LIPIcs.ECRTS.2022.6.'
mla: 'Chen, Kuan-Hsun, et al. “Unikernel-Based Real-Time Virtualization Under Deferrable
Servers: Analysis and Realization.” 34th Euromicro Conference on Real-Time
Systems (ECRTS 2022), edited by Martina Maggio, vol. 231, Schloss Dagstuhl
– Leibniz-Zentrum für Informatik, 2022, p. 6:1–6:22, doi:10.4230/LIPIcs.ECRTS.2022.6.'
short: 'K.-H. Chen, M. Günzel, B. Jablkowski, M. Buschhoff, J.-J. Chen, in: M. Maggio
(Ed.), 34th Euromicro Conference on Real-Time Systems (ECRTS 2022), Schloss Dagstuhl
– Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022, p. 6:1–6:22.'
date_created: 2026-07-05T14:40:21Z
date_updated: 2026-07-05T14:42:53Z
doi: 10.4230/LIPIcs.ECRTS.2022.6
editor:
- first_name: Martina
full_name: Maggio, Martina
last_name: Maggio
intvolume: ' 231'
page: 6:1–6:22
place: Dagstuhl, Germany
publication: 34th Euromicro Conference on Real-Time Systems (ECRTS 2022)
publication_identifier:
isbn:
- 978-3-95977-239-6
issn:
- 1868-8969
publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: 'Unikernel-Based Real-Time Virtualization Under Deferrable Servers: Analysis
and Realization'
type: conference
user_id: '128464'
volume: 231
year: '2022'
...
---
_id: '20159'
abstract:
- lang: eng
text: "Let G = (V,E) be an undirected graph on n vertices with non-negative capacities
on its edges. The mincut sensitivity problem for the insertion of an edge is defined
as follows. Build a compact data structure for G and a given set S ⊆ V of vertices
that, on receiving any edge (x,y) ∈ S×S of positive capacity as query input, can
efficiently report the set of all pairs from S× S whose mincut value increases
upon insertion of the edge (x,y) to G. The only result that exists for this problem
is for a single pair of vertices (Picard and Queyranne, Mathematical Programming
Study, 13 (1980), 8-16). We present the following results for the single source
and the all-pairs versions of this problem. \r\n1) Single source: Given any designated
source vertex s, there exists a data structure of size \U0001D4AA(|S|) that can
output all those vertices from S whose mincut value to s increases upon insertion
of any given edge. The time taken by the data structure to answer any query is
\U0001D4AA(|S|). \r\n2) All-pairs: There exists an \U0001D4AA(|S|²) size data
structure that can output all those pairs of vertices from S× S whose mincut value
gets increased upon insertion of any given edge. The time taken by the data structure
to answer any query is \U0001D4AA(k), where k is the number of pairs of vertices
whose mincut increases. \r\nFor both these versions, we also address the problem
of reporting the values of the mincuts upon insertion of any given edge. To derive
our results, we use interesting insights into the nearest and the farthest mincuts
for a pair of vertices. In addition, a crucial result, that we establish and use
in our data structures, is that there exists a directed acyclic graph of \U0001D4AA(n)
size that compactly stores the farthest mincuts from all vertices of V to a designated
vertex s in the graph. We believe that this result is of independent interest,
especially, because it also complements a previously existing result by Hariharan
et al. (STOC 2007) that the nearest mincuts from all vertices of V to s is a laminar
family, and hence, can be stored compactly in a tree of \U0001D4AA(n) size."
author:
- first_name: Surender
full_name: Baswana, Surender
last_name: Baswana
- first_name: Shiv
full_name: Gupta, Shiv
last_name: Gupta
- first_name: Till
full_name: Knollmann, Till
id: '39241'
last_name: Knollmann
orcid: 0000-0003-2014-4696
citation:
ama: 'Baswana S, Gupta S, Knollmann T. Mincut Sensitivity Data Structures for the
Insertion of an Edge. In: Grandoni F, Herman G, Sanders P, eds. 28th Annual
European Symposium on Algorithms (ESA 2020). Vol 173. Leibniz International
Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl -- Leibniz-Zentrum
für Informatik; 2020:12:1-12:14. doi:10.4230/LIPIcs.ESA.2020.12'
apa: 'Baswana, S., Gupta, S., & Knollmann, T. (2020). Mincut Sensitivity Data
Structures for the Insertion of an Edge. In F. Grandoni, G. Herman, & P. Sanders
(Eds.), 28th Annual European Symposium on Algorithms (ESA 2020) (Vol. 173,
pp. 12:1-12:14). Dagstuhl, Germany: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.ESA.2020.12'
bibtex: '@inproceedings{Baswana_Gupta_Knollmann_2020, place={Dagstuhl, Germany},
series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Mincut
Sensitivity Data Structures for the Insertion of an Edge}, volume={173}, DOI={10.4230/LIPIcs.ESA.2020.12},
booktitle={28th Annual European Symposium on Algorithms (ESA 2020)}, publisher={Schloss
Dagstuhl -- Leibniz-Zentrum für Informatik}, author={Baswana, Surender and Gupta,
Shiv and Knollmann, Till}, editor={Grandoni, Fabrizio and Herman, Grzegorz and
Sanders, PeterEditors}, year={2020}, pages={12:1-12:14}, collection={Leibniz International
Proceedings in Informatics (LIPIcs)} }'
chicago: 'Baswana, Surender, Shiv Gupta, and Till Knollmann. “Mincut Sensitivity
Data Structures for the Insertion of an Edge.” In 28th Annual European Symposium
on Algorithms (ESA 2020), edited by Fabrizio Grandoni, Grzegorz Herman, and
Peter Sanders, 173:12:1-12:14. Leibniz International Proceedings in Informatics
(LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik,
2020. https://doi.org/10.4230/LIPIcs.ESA.2020.12.'
ieee: S. Baswana, S. Gupta, and T. Knollmann, “Mincut Sensitivity Data Structures
for the Insertion of an Edge,” in 28th Annual European Symposium on Algorithms
(ESA 2020), 2020, vol. 173, pp. 12:1-12:14.
mla: Baswana, Surender, et al. “Mincut Sensitivity Data Structures for the Insertion
of an Edge.” 28th Annual European Symposium on Algorithms (ESA 2020), edited
by Fabrizio Grandoni et al., vol. 173, Schloss Dagstuhl -- Leibniz-Zentrum für
Informatik, 2020, pp. 12:1-12:14, doi:10.4230/LIPIcs.ESA.2020.12.
short: 'S. Baswana, S. Gupta, T. Knollmann, in: F. Grandoni, G. Herman, P. Sanders
(Eds.), 28th Annual European Symposium on Algorithms (ESA 2020), Schloss Dagstuhl
-- Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2020, pp. 12:1-12:14.'
date_created: 2020-10-21T12:00:20Z
date_updated: 2022-01-06T06:54:20Z
department:
- _id: '63'
doi: 10.4230/LIPIcs.ESA.2020.12
editor:
- first_name: Fabrizio
full_name: Grandoni, Fabrizio
last_name: Grandoni
- first_name: Grzegorz
full_name: Herman, Grzegorz
last_name: Herman
- first_name: Peter
full_name: Sanders, Peter
last_name: Sanders
intvolume: ' 173'
keyword:
- Mincut
- Sensitivity
- Data Structure
language:
- iso: eng
page: 12:1-12:14
place: Dagstuhl, Germany
publication: 28th Annual European Symposium on Algorithms (ESA 2020)
publication_identifier:
isbn:
- 978-3-95977-162-7
issn:
- 1868-8969
publisher: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: Mincut Sensitivity Data Structures for the Insertion of an Edge
type: conference
user_id: '39241'
volume: 173
year: '2020'
...
---
_id: '66266'
author:
- first_name: Lea
full_name: Schönberger, Lea
last_name: Schönberger
- first_name: Georg
full_name: von der Brüggen, Georg
last_name: von der Brüggen
- first_name: Kuan-Hsun
full_name: Chen, Kuan-Hsun
last_name: Chen
- first_name: Benjamin
full_name: Sliwa, Benjamin
last_name: Sliwa
- first_name: Hazem
full_name: Youssef, Hazem
last_name: Youssef
- first_name: Aswin Karthik
full_name: Ramachandran Venkatapathy, Aswin Karthik
last_name: Ramachandran Venkatapathy
- first_name: Christian
full_name: Wietfeld, Christian
last_name: Wietfeld
- first_name: Michael
full_name: ten Hompel, Michael
last_name: ten Hompel
- first_name: Jian-Jia
full_name: Chen, Jian-Jia
last_name: Chen
citation:
ama: 'Schönberger L, von der Brüggen G, Chen K-H, et al. Offloading Safety- and
Mission-Critical Tasks via Unreliable Connections. In: Völp M, ed. 32nd Euromicro
Conference on Real-Time Systems (ECRTS 2020). Vol 165. Leibniz International
Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik;
2020:18:1–18:22. doi:10.4230/LIPIcs.ECRTS.2020.18'
apa: Schönberger, L., von der Brüggen, G., Chen, K.-H., Sliwa, B., Youssef, H.,
Ramachandran Venkatapathy, A. K., Wietfeld, C., ten Hompel, M., & Chen, J.-J.
(2020). Offloading Safety- and Mission-Critical Tasks via Unreliable Connections.
In M. Völp (Ed.), 32nd Euromicro Conference on Real-Time Systems (ECRTS 2020)
(Vol. 165, p. 18:1–18:22). Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.ECRTS.2020.18
bibtex: '@inproceedings{Schönberger_von der Brüggen_Chen_Sliwa_Youssef_Ramachandran
Venkatapathy_Wietfeld_ten Hompel_Chen_2020, place={Dagstuhl, Germany}, series={Leibniz
International Proceedings in Informatics (LIPIcs)}, title={Offloading Safety-
and Mission-Critical Tasks via Unreliable Connections}, volume={165}, DOI={10.4230/LIPIcs.ECRTS.2020.18},
booktitle={32nd Euromicro Conference on Real-Time Systems (ECRTS 2020)}, publisher={Schloss
Dagstuhl – Leibniz-Zentrum für Informatik}, author={Schönberger, Lea and von der
Brüggen, Georg and Chen, Kuan-Hsun and Sliwa, Benjamin and Youssef, Hazem and
Ramachandran Venkatapathy, Aswin Karthik and Wietfeld, Christian and ten Hompel,
Michael and Chen, Jian-Jia}, editor={Völp, Marcus}, year={2020}, pages={18:1–18:22},
collection={Leibniz International Proceedings in Informatics (LIPIcs)} }'
chicago: 'Schönberger, Lea, Georg von der Brüggen, Kuan-Hsun Chen, Benjamin Sliwa,
Hazem Youssef, Aswin Karthik Ramachandran Venkatapathy, Christian Wietfeld, Michael
ten Hompel, and Jian-Jia Chen. “Offloading Safety- and Mission-Critical Tasks
via Unreliable Connections.” In 32nd Euromicro Conference on Real-Time Systems
(ECRTS 2020), edited by Marcus Völp, 165:18:1–18:22. Leibniz International
Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum
für Informatik, 2020. https://doi.org/10.4230/LIPIcs.ECRTS.2020.18.'
ieee: 'L. Schönberger et al., “Offloading Safety- and Mission-Critical Tasks
via Unreliable Connections,” in 32nd Euromicro Conference on Real-Time Systems
(ECRTS 2020), 2020, vol. 165, p. 18:1–18:22, doi: 10.4230/LIPIcs.ECRTS.2020.18.'
mla: Schönberger, Lea, et al. “Offloading Safety- and Mission-Critical Tasks via
Unreliable Connections.” 32nd Euromicro Conference on Real-Time Systems (ECRTS
2020), edited by Marcus Völp, vol. 165, Schloss Dagstuhl – Leibniz-Zentrum
für Informatik, 2020, p. 18:1–18:22, doi:10.4230/LIPIcs.ECRTS.2020.18.
short: 'L. Schönberger, G. von der Brüggen, K.-H. Chen, B. Sliwa, H. Youssef, A.K.
Ramachandran Venkatapathy, C. Wietfeld, M. ten Hompel, J.-J. Chen, in: M. Völp
(Ed.), 32nd Euromicro Conference on Real-Time Systems (ECRTS 2020), Schloss Dagstuhl
– Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2020, p. 18:1–18:22.'
date_created: 2026-07-05T14:40:28Z
date_updated: 2026-07-05T14:42:51Z
doi: 10.4230/LIPIcs.ECRTS.2020.18
editor:
- first_name: Marcus
full_name: Völp, Marcus
last_name: Völp
intvolume: ' 165'
page: 18:1–18:22
place: Dagstuhl, Germany
publication: 32nd Euromicro Conference on Real-Time Systems (ECRTS 2020)
publication_identifier:
isbn:
- 978-3-95977-152-8
issn:
- 1868-8969
publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: Offloading Safety- and Mission-Critical Tasks via Unreliable Connections
type: conference
user_id: '128464'
volume: 165
year: '2020'
...
---
_id: '2484'
abstract:
- lang: eng
text: We study the classic bin packing problem in a fully-dynamic setting, where
new items can arrive and old items may depart. We want algorithms with low asymptotic
competitive ratio while repacking items sparingly between updates. Formally, each
item i has a movement cost c_i >= 0, and we want to use alpha * OPT bins and incur
a movement cost gamma * c_i, either in the worst case, or in an amortized sense,
for alpha, gamma as small as possible. We call gamma the recourse of the algorithm.
This is motivated by cloud storage applications, where fully-dynamic bin packing
models the problem of data backup to minimize the number of disks used, as well
as communication incurred in moving file backups between disks. Since the set
of files changes over time, we could recompute a solution periodically from scratch,
but this would give a high number of disk rewrites, incurring a high energy cost
and possible wear and tear of the disks. In this work, we present optimal tradeoffs
between number of bins used and number of items repacked, as well as natural extensions
of the latter measure.
author:
- first_name: Björn
full_name: Feldkord, Björn
id: '22704'
last_name: Feldkord
- first_name: Matthias
full_name: Feldotto, Matthias
id: '14052'
last_name: Feldotto
orcid: 0000-0003-1348-6516
- first_name: Anupam
full_name: Gupta, Anupam
last_name: Gupta
- first_name: Guru
full_name: Guruganesh, Guru
last_name: Guruganesh
- first_name: 'Amit '
full_name: 'Kumar, Amit '
last_name: Kumar
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
- first_name: David
full_name: Wajc, David
last_name: Wajc
citation:
ama: 'Feldkord B, Feldotto M, Gupta A, et al. Fully-Dynamic Bin Packing with Little
Repacking. In: Chatzigiannakis I, Kaklamanis C, Marx D, Sannella D, eds. 45th
International Colloquium on Automata, Languages, and Programming (ICALP 2018).
Vol 107. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl,
Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik; 2018:51:1-51:24. doi:10.4230/LIPIcs.ICALP.2018.51'
apa: 'Feldkord, B., Feldotto, M., Gupta, A., Guruganesh, G., Kumar, A., Riechers,
S., & Wajc, D. (2018). Fully-Dynamic Bin Packing with Little Repacking. In
I. Chatzigiannakis, C. Kaklamanis, D. Marx, & D. Sannella (Eds.), 45th
International Colloquium on Automata, Languages, and Programming (ICALP 2018)
(Vol. 107, pp. 51:1-51:24). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum
fuer Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2018.51'
bibtex: '@inproceedings{Feldkord_Feldotto_Gupta_Guruganesh_Kumar_Riechers_Wajc_2018,
place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics
(LIPIcs)}, title={Fully-Dynamic Bin Packing with Little Repacking}, volume={107},
DOI={10.4230/LIPIcs.ICALP.2018.51},
booktitle={45th International Colloquium on Automata, Languages, and Programming
(ICALP 2018)}, publisher={Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
author={Feldkord, Björn and Feldotto, Matthias and Gupta, Anupam and Guruganesh,
Guru and Kumar, Amit and Riechers, Sören and Wajc, David}, editor={Chatzigiannakis,
Ioannis and Kaklamanis, Christos and Marx, Dániel and Sannella, DonaldEditors},
year={2018}, pages={51:1-51:24}, collection={Leibniz International Proceedings
in Informatics (LIPIcs)} }'
chicago: 'Feldkord, Björn, Matthias Feldotto, Anupam Gupta, Guru Guruganesh, Amit Kumar,
Sören Riechers, and David Wajc. “Fully-Dynamic Bin Packing with Little Repacking.”
In 45th International Colloquium on Automata, Languages, and Programming (ICALP
2018), edited by Ioannis Chatzigiannakis, Christos Kaklamanis, Dániel Marx,
and Donald Sannella, 107:51:1-51:24. Leibniz International Proceedings in Informatics
(LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik,
2018. https://doi.org/10.4230/LIPIcs.ICALP.2018.51.'
ieee: B. Feldkord et al., “Fully-Dynamic Bin Packing with Little Repacking,”
in 45th International Colloquium on Automata, Languages, and Programming (ICALP
2018), Prag, 2018, vol. 107, pp. 51:1-51:24.
mla: Feldkord, Björn, et al. “Fully-Dynamic Bin Packing with Little Repacking.”
45th International Colloquium on Automata, Languages, and Programming (ICALP
2018), edited by Ioannis Chatzigiannakis et al., vol. 107, Schloss Dagstuhl--Leibniz-Zentrum
fuer Informatik, 2018, pp. 51:1-51:24, doi:10.4230/LIPIcs.ICALP.2018.51.
short: 'B. Feldkord, M. Feldotto, A. Gupta, G. Guruganesh, A. Kumar, S. Riechers,
D. Wajc, in: I. Chatzigiannakis, C. Kaklamanis, D. Marx, D. Sannella (Eds.), 45th
International Colloquium on Automata, Languages, and Programming (ICALP 2018),
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2018, pp.
51:1-51:24.'
conference:
end_date: 2018-07-13
location: Prag
name: 45th International Colloquium on Automata, Languages, and Programming (ICALP
2018)
start_date: 2018-07-10
date_created: 2018-04-24T15:21:56Z
date_updated: 2022-01-06T06:56:39Z
ddc:
- '000'
department:
- _id: '541'
- _id: '63'
doi: 10.4230/LIPIcs.ICALP.2018.51
editor:
- first_name: Ioannis
full_name: Chatzigiannakis, Ioannis
last_name: Chatzigiannakis
- first_name: Christos
full_name: Kaklamanis, Christos
last_name: Kaklamanis
- first_name: Dániel
full_name: Marx, Dániel
last_name: Marx
- first_name: Donald
full_name: Sannella, Donald
last_name: Sannella
external_id:
arxiv:
- '1711.01231'
file:
- access_level: closed
content_type: application/pdf
creator: feldi
date_created: 2018-10-31T16:58:18Z
date_updated: 2018-10-31T16:58:18Z
file_id: '5227'
file_name: LIPIcs-ICALP-2018-51.pdf
file_size: 723824
relation: main_file
success: 1
file_date_updated: 2018-10-31T16:58:18Z
has_accepted_license: '1'
intvolume: ' 107'
language:
- iso: eng
page: 51:1-51:24
place: Dagstuhl, Germany
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '7'
name: SFB 901 - Subproject A3
- _id: '16'
name: SFB 901 - Subproject C4
publication: 45th International Colloquium on Automata, Languages, and Programming
(ICALP 2018)
publication_identifier:
isbn:
- 978-3-95977-076-7
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: Fully-Dynamic Bin Packing with Little Repacking
type: conference
user_id: '14052'
volume: 107
year: '2018'
...
---
_id: '66267'
author:
- first_name: Georg
full_name: von der Brüggen, Georg
last_name: von der Brüggen
- first_name: Nico
full_name: Piatkowski, Nico
last_name: Piatkowski
- first_name: Kuan-Hsun
full_name: Chen, Kuan-Hsun
last_name: Chen
- first_name: Jian-Jia
full_name: Chen, Jian-Jia
last_name: Chen
- first_name: Katharina
full_name: Morik, Katharina
last_name: Morik
citation:
ama: 'von der Brüggen G, Piatkowski N, Chen K-H, Chen J-J, Morik K. Efficiently
Approximating the Probability of Deadline Misses in Real-Time Systems. In: Altmeyer
S, ed. 30th Euromicro Conference on Real-Time Systems (ECRTS 2018). Vol
106. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl
– Leibniz-Zentrum für Informatik; 2018:6:1–6:22. doi:10.4230/LIPIcs.ECRTS.2018.6'
apa: von der Brüggen, G., Piatkowski, N., Chen, K.-H., Chen, J.-J., & Morik,
K. (2018). Efficiently Approximating the Probability of Deadline Misses in Real-Time
Systems. In S. Altmeyer (Ed.), 30th Euromicro Conference on Real-Time Systems
(ECRTS 2018) (Vol. 106, p. 6:1–6:22). Schloss Dagstuhl – Leibniz-Zentrum für
Informatik. https://doi.org/10.4230/LIPIcs.ECRTS.2018.6
bibtex: '@inproceedings{von der Brüggen_Piatkowski_Chen_Chen_Morik_2018, place={Dagstuhl,
Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)},
title={Efficiently Approximating the Probability of Deadline Misses in Real-Time
Systems}, volume={106}, DOI={10.4230/LIPIcs.ECRTS.2018.6},
booktitle={30th Euromicro Conference on Real-Time Systems (ECRTS 2018)}, publisher={Schloss
Dagstuhl – Leibniz-Zentrum für Informatik}, author={von der Brüggen, Georg and
Piatkowski, Nico and Chen, Kuan-Hsun and Chen, Jian-Jia and Morik, Katharina},
editor={Altmeyer, Sebastian}, year={2018}, pages={6:1–6:22}, collection={Leibniz
International Proceedings in Informatics (LIPIcs)} }'
chicago: 'Brüggen, Georg von der, Nico Piatkowski, Kuan-Hsun Chen, Jian-Jia Chen,
and Katharina Morik. “Efficiently Approximating the Probability of Deadline Misses
in Real-Time Systems.” In 30th Euromicro Conference on Real-Time Systems (ECRTS
2018), edited by Sebastian Altmeyer, 106:6:1–6:22. Leibniz International Proceedings
in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum
für Informatik, 2018. https://doi.org/10.4230/LIPIcs.ECRTS.2018.6.'
ieee: 'G. von der Brüggen, N. Piatkowski, K.-H. Chen, J.-J. Chen, and K. Morik,
“Efficiently Approximating the Probability of Deadline Misses in Real-Time Systems,”
in 30th Euromicro Conference on Real-Time Systems (ECRTS 2018), 2018, vol.
106, p. 6:1–6:22, doi: 10.4230/LIPIcs.ECRTS.2018.6.'
mla: von der Brüggen, Georg, et al. “Efficiently Approximating the Probability of
Deadline Misses in Real-Time Systems.” 30th Euromicro Conference on Real-Time
Systems (ECRTS 2018), edited by Sebastian Altmeyer, vol. 106, Schloss Dagstuhl
– Leibniz-Zentrum für Informatik, 2018, p. 6:1–6:22, doi:10.4230/LIPIcs.ECRTS.2018.6.
short: 'G. von der Brüggen, N. Piatkowski, K.-H. Chen, J.-J. Chen, K. Morik, in:
S. Altmeyer (Ed.), 30th Euromicro Conference on Real-Time Systems (ECRTS 2018),
Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2018, p.
6:1–6:22.'
date_created: 2026-07-05T14:40:35Z
date_updated: 2026-07-05T14:42:48Z
doi: 10.4230/LIPIcs.ECRTS.2018.6
editor:
- first_name: Sebastian
full_name: Altmeyer, Sebastian
last_name: Altmeyer
intvolume: ' 106'
page: 6:1–6:22
place: Dagstuhl, Germany
publication: 30th Euromicro Conference on Real-Time Systems (ECRTS 2018)
publication_identifier:
isbn:
- 978-3-95977-075-0
issn:
- 1868-8969
publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: Efficiently Approximating the Probability of Deadline Misses in Real-Time Systems
type: conference
user_id: '128464'
volume: 106
year: '2018'
...