---
_id: '52318'
author:
- first_name: Svitlana
full_name: Dorociak, Svitlana
last_name: Dorociak
citation:
ama: Dorociak S. Implementierung Eines Algorithmus Zur Motivbasierten Schnitt-Sparsifizierung.;
2024.
apa: Dorociak, S. (2024). Implementierung eines Algorithmus zur motivbasierten
Schnitt-Sparsifizierung.
bibtex: '@book{Dorociak_2024, title={Implementierung eines Algorithmus zur motivbasierten
Schnitt-Sparsifizierung}, author={Dorociak, Svitlana}, year={2024} }'
chicago: Dorociak, Svitlana. Implementierung Eines Algorithmus Zur Motivbasierten
Schnitt-Sparsifizierung, 2024.
ieee: S. Dorociak, Implementierung eines Algorithmus zur motivbasierten Schnitt-Sparsifizierung.
2024.
mla: Dorociak, Svitlana. Implementierung Eines Algorithmus Zur Motivbasierten
Schnitt-Sparsifizierung. 2024.
short: S. Dorociak, Implementierung Eines Algorithmus Zur Motivbasierten Schnitt-Sparsifizierung,
2024.
date_created: 2024-03-05T12:52:59Z
date_updated: 2024-03-05T12:53:25Z
department:
- _id: '34'
- _id: '7'
- _id: '79'
language:
- iso: eng
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Implementierung eines Algorithmus zur motivbasierten Schnitt-Sparsifizierung
type: bachelorsthesis
user_id: '15578'
year: '2024'
...
---
_id: '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. Theor Comput Sci. 2023;950:113756. doi:10.1016/j.tcs.2023.113756'
apa: 'Götte, T., Kolb, C., Scheideler, C., & Werthmann, J. (2023). Beep-and-Sleep:
Message and Energy Efficient Set Cover. Theor. Comput. Sci., 950,
113756. https://doi.org/10.1016/j.tcs.2023.113756'
bibtex: '@article{Götte_Kolb_Scheideler_Werthmann_2023, title={Beep-and-Sleep: Message
and Energy Efficient Set Cover}, volume={950}, DOI={10.1016/j.tcs.2023.113756},
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.” Theor. Comput. Sci.
950 (2023): 113756. https://doi.org/10.1016/j.tcs.2023.113756.'
ieee: 'T. Götte, C. Kolb, C. Scheideler, and J. Werthmann, “Beep-and-Sleep: Message
and Energy Efficient Set Cover,” Theor. Comput. Sci., vol. 950, p. 113756,
2023, doi: 10.1016/j.tcs.2023.113756.'
mla: 'Götte, Thorsten, et al. “Beep-and-Sleep: Message and Energy Efficient Set
Cover.” Theor. Comput. Sci., vol. 950, 2023, p. 113756, doi:10.1016/j.tcs.2023.113756.'
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. Minimum Edge Cuts in Overlay Networks.; 2023.
apa: Schweichhart, J. (2023). Minimum Edge Cuts in Overlay Networks.
bibtex: '@book{Schweichhart_2023, title={Minimum Edge Cuts in Overlay Networks},
author={Schweichhart, Jonas}, year={2023} }'
chicago: Schweichhart, Jonas. Minimum Edge Cuts in Overlay Networks, 2023.
ieee: J. Schweichhart, Minimum Edge Cuts in Overlay Networks. 2023.
mla: Schweichhart, Jonas. Minimum Edge Cuts in Overlay Networks. 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:10.48550/ARXIV.2210.05333'
apa: Werthmann, J., Scheideler, C., Coy, S., Czumaj, A., & Schneider, P. (2023).
Routing Schemes for Hybrid Communication Networks. https://doi.org/10.48550/ARXIV.2210.05333
bibtex: '@inproceedings{Werthmann_Scheideler_Coy_Czumaj_Schneider_2023, title={Routing
Schemes for Hybrid Communication Networks}, DOI={10.48550/ARXIV.2210.05333},
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. https://doi.org/10.48550/ARXIV.2210.05333.
ieee: 'J. Werthmann, C. Scheideler, S. Coy, A. Czumaj, and P. Schneider, “Routing
Schemes for Hybrid Communication Networks,” 2023, doi: 10.48550/ARXIV.2210.05333.'
mla: Werthmann, Julian, et al. Routing Schemes for Hybrid Communication Networks.
2023, doi:10.48550/ARXIV.2210.05333.
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'
...
---
_id: '46053'
author:
- first_name: Fabian
full_name: Schneider, Fabian
last_name: Schneider
citation:
ama: Schneider F. Utilizing Redundancy in Distributed Heterogeneous Storage.;
2023.
apa: Schneider, F. (2023). Utilizing Redundancy in Distributed Heterogeneous
Storage.
bibtex: '@book{Schneider_2023, title={Utilizing Redundancy in Distributed Heterogeneous
Storage}, author={Schneider, Fabian}, year={2023} }'
chicago: Schneider, Fabian. Utilizing Redundancy in Distributed Heterogeneous
Storage, 2023.
ieee: F. Schneider, Utilizing Redundancy in Distributed Heterogeneous Storage.
2023.
mla: Schneider, Fabian. Utilizing Redundancy in Distributed Heterogeneous Storage.
2023.
short: F. Schneider, Utilizing Redundancy in Distributed Heterogeneous Storage,
2023.
date_created: 2023-07-13T12:46:28Z
date_updated: 2023-07-17T07:05:22Z
ddc:
- '004'
department:
- _id: '79'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2023-07-17T07:05:05Z
date_updated: 2023-07-17T07:05:05Z
file_id: '46071'
file_name: BA-Schneider.pdf
file_size: 1977565
relation: main_file
success: 1
file_date_updated: 2023-07-17T07:05:05Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
grant_number: '160364472'
name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
in dynamischen Märkten '
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '13'
name: 'SFB 901 - C1: SFB 901 - Subproject C1'
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Utilizing Redundancy in Distributed Heterogeneous Storage
type: bachelorsthesis
user_id: '15504'
year: '2023'
...
---
_id: '46087'
author:
- first_name: Amruta
full_name: Ranade, Amruta
last_name: Ranade
citation:
ama: Ranade A. Graph Neural Network-Based Anomaly Detection in Smart Grid Energy
Consumption.; 2023.
apa: Ranade, A. (2023). Graph Neural Network-based Anomaly Detection in Smart
Grid Energy Consumption.
bibtex: '@book{Ranade_2023, title={Graph Neural Network-based Anomaly Detection
in Smart Grid Energy Consumption}, author={Ranade, Amruta}, year={2023} }'
chicago: Ranade, Amruta. Graph Neural Network-Based Anomaly Detection in Smart
Grid Energy Consumption, 2023.
ieee: A. Ranade, Graph Neural Network-based Anomaly Detection in Smart Grid
Energy Consumption. 2023.
mla: Ranade, Amruta. Graph Neural Network-Based Anomaly Detection in Smart Grid
Energy Consumption. 2023.
short: A. Ranade, Graph Neural Network-Based Anomaly Detection in Smart Grid Energy
Consumption, 2023.
date_created: 2023-07-19T06:09:17Z
date_updated: 2023-07-19T06:09:36Z
department:
- _id: '79'
language:
- iso: eng
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Graph Neural Network-based Anomaly Detection in Smart Grid Energy Consumption
type: mastersthesis
user_id: '15504'
year: '2023'
...
---
_id: '46086'
author:
- first_name: Osama
full_name: Ali, Osama
last_name: Ali
citation:
ama: Ali O. Highly Accurate Deep Compressed Facial Recognition.; 2023.
apa: Ali, O. (2023). Highly accurate deep compressed facial recognition.
bibtex: '@book{Ali_2023, title={Highly accurate deep compressed facial recognition},
author={Ali, Osama}, year={2023} }'
chicago: Ali, Osama. Highly Accurate Deep Compressed Facial Recognition,
2023.
ieee: O. Ali, Highly accurate deep compressed facial recognition. 2023.
mla: Ali, Osama. Highly Accurate Deep Compressed Facial Recognition. 2023.
short: O. Ali, Highly Accurate Deep Compressed Facial Recognition, 2023.
date_created: 2023-07-19T06:08:13Z
date_updated: 2023-07-19T06:09:31Z
department:
- _id: '79'
language:
- iso: eng
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Highly accurate deep compressed facial recognition
type: mastersthesis
user_id: '15504'
year: '2023'
...
---
_id: '46110'
author:
- first_name: Nivedita
full_name: Ashri, Nivedita
last_name: Ashri
citation:
ama: Ashri N. Virtual On-Demand Volunteer System Based on Delaunay Triangulation.;
2023.
apa: Ashri, N. (2023). Virtual On-Demand Volunteer System Based on Delaunay Triangulation.
bibtex: '@book{Ashri_2023, title={Virtual On-Demand Volunteer System Based on Delaunay
Triangulation}, author={Ashri, Nivedita}, year={2023} }'
chicago: Ashri, Nivedita. Virtual On-Demand Volunteer System Based on Delaunay
Triangulation, 2023.
ieee: N. Ashri, Virtual On-Demand Volunteer System Based on Delaunay Triangulation.
2023.
mla: Ashri, Nivedita. Virtual On-Demand Volunteer System Based on Delaunay Triangulation.
2023.
short: N. Ashri, Virtual On-Demand Volunteer System Based on Delaunay Triangulation,
2023.
date_created: 2023-07-21T08:52:38Z
date_updated: 2023-07-21T08:53:13Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
grant_number: '160364472'
name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
in dynamischen Märkten '
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '5'
grant_number: '160364472'
name: 'SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen
Netzen (Subproject A1)'
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Virtual On-Demand Volunteer System Based on Delaunay Triangulation
type: mastersthesis
user_id: '15504'
year: '2023'
...
---
_id: '46221'
author:
- first_name: N.
full_name: N., N.
last_name: N.
citation:
ama: N. N. Improving the End-of-Line Test of Custom-Built Geared Motors Using
Clustering Based on Neural Networks.; 2023.
apa: N., N. (2023). Improving the End-of-Line Test of Custom-Built Geared Motors
using Clustering based on Neural Networks.
bibtex: '@book{N._2023, title={Improving the End-of-Line Test of Custom-Built Geared
Motors using Clustering based on Neural Networks}, author={N., N.}, year={2023}
}'
chicago: N., N. Improving the End-of-Line Test of Custom-Built Geared Motors
Using Clustering Based on Neural Networks, 2023.
ieee: N. N., Improving the End-of-Line Test of Custom-Built Geared Motors using
Clustering based on Neural Networks. 2023.
mla: N., N. Improving the End-of-Line Test of Custom-Built Geared Motors Using
Clustering Based on Neural Networks. 2023.
short: N. N., Improving the End-of-Line Test of Custom-Built Geared Motors Using
Clustering Based on Neural Networks, 2023.
date_created: 2023-07-31T10:49:12Z
date_updated: 2023-07-31T10:49:30Z
department:
- _id: '79'
language:
- iso: eng
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Improving the End-of-Line Test of Custom-Built Geared Motors using Clustering
based on Neural Networks
type: mastersthesis
user_id: '15504'
year: '2023'
...
---
_id: '47134'
author:
- first_name: Volker
full_name: Deppe, Volker
last_name: Deppe
citation:
ama: Deppe V. Routing in Hypergraphs.; 2023.
apa: Deppe, V. (2023). Routing in Hypergraphs.
bibtex: '@book{Deppe_2023, title={Routing in Hypergraphs}, author={Deppe, Volker},
year={2023} }'
chicago: Deppe, Volker. Routing in Hypergraphs, 2023.
ieee: V. Deppe, Routing in Hypergraphs. 2023.
mla: Deppe, Volker. Routing in Hypergraphs. 2023.
short: V. Deppe, Routing in Hypergraphs, 2023.
date_created: 2023-09-20T09:59:41Z
date_updated: 2023-09-20T10:00:48Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
grant_number: '160364472'
name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
in dynamischen Märkten '
- _id: '5'
grant_number: '160364472'
name: 'SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen
Netzen (Subproject A1)'
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
status: public
title: Routing in Hypergraphs
type: bachelorsthesis
user_id: '15504'
year: '2023'
...
---
_id: '48430'
abstract:
- lang: eng
text: "Bei dem betrachteten Speicherproblem werden Daten mit verschiedenen\r\nZugriffswahrscheinlichkeiten
auf Speicher mit verschiedenen Bandbreiten\r\nund Kapazitäten aufgeteilt, dabei
sind Replikate erlaubt.\r\nEs wird die nach Zugriffswahrscheinlichkeit gewichtete
kleinste Bandbreite der Daten maximiert.\r\nWir zeigen, dass sowohl das diskrete
Speicherproblem, bei dem die Bandbreite der Speicher jeweils\r\ngleichmäßig auf
die dort abgelegten Daten aufgeteilt wird, als auch das kontinuierliche\r\nSpeicherproblem,
bei dem die Bandbreite der Speicher beliebig auf abgelegte Daten verteilt werden\r\ndarf,
NP-schwer ist.\r\nEs können also, wenn P ̸ = NP, keine effizienten Algorithmen
für eine optimale Lösung existieren.\r\nStattdessen zeigen wir jeweils einen 1/2-Approximationsalgorithmus."
author:
- first_name: Leo
full_name: Decking, Leo
last_name: Decking
citation:
ama: Decking L. Zuweisung Verteilter Speicher Unter Maximierung Der Minimalen
Gewichteten Bandbreite.; 2023.
apa: Decking, L. (2023). Zuweisung verteilter Speicher unter Maximierung der
minimalen gewichteten Bandbreite.
bibtex: '@book{Decking_2023, title={Zuweisung verteilter Speicher unter Maximierung
der minimalen gewichteten Bandbreite}, author={Decking, Leo}, year={2023} }'
chicago: Decking, Leo. Zuweisung Verteilter Speicher Unter Maximierung Der Minimalen
Gewichteten Bandbreite, 2023.
ieee: L. Decking, Zuweisung verteilter Speicher unter Maximierung der minimalen
gewichteten Bandbreite. 2023.
mla: Decking, Leo. Zuweisung Verteilter Speicher Unter Maximierung Der Minimalen
Gewichteten Bandbreite. 2023.
short: L. Decking, Zuweisung Verteilter Speicher Unter Maximierung Der Minimalen
Gewichteten Bandbreite, 2023.
date_created: 2023-10-24T13:22:08Z
date_updated: 2023-10-24T13:25:05Z
department:
- _id: '79'
language:
- iso: eng
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Zuweisung verteilter Speicher unter Maximierung der minimalen gewichteten Bandbreite
type: bachelorsthesis
user_id: '15578'
year: '2023'
...
---
_id: '49494'
author:
- first_name: Alexander
full_name: Nickel, Alexander
last_name: Nickel
citation:
ama: Nickel A. Entwicklung Und Analyse von Formeln Zur Abschätzung Der Renderingzeit
Eines Frames.; 2023.
apa: Nickel, A. (2023). Entwicklung und Analyse von Formeln zur Abschätzung der
Renderingzeit eines Frames.
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. Entwicklung Und Analyse von Formeln Zur Abschätzung
Der Renderingzeit Eines Frames, 2023.
ieee: A. Nickel, Entwicklung und Analyse von Formeln zur Abschätzung der Renderingzeit
eines Frames. 2023.
mla: Nickel, Alexander. Entwicklung Und Analyse von Formeln Zur Abschätzung Der
Renderingzeit Eines Frames. 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. Reconstruction of 3D Surfels from Neural Radiance Fields.;
2023.
apa: Telaprolu, V. (2023). Reconstruction of 3D Surfels from Neural Radiance
Fields.
bibtex: '@book{Telaprolu_2023, title={Reconstruction of 3D Surfels from Neural Radiance
Fields}, author={Telaprolu, Vipasyan}, year={2023} }'
chicago: Telaprolu, Vipasyan. Reconstruction of 3D Surfels from Neural Radiance
Fields, 2023.
ieee: V. Telaprolu, Reconstruction of 3D Surfels from Neural Radiance Fields.
2023.
mla: Telaprolu, Vipasyan. Reconstruction of 3D Surfels from Neural Radiance Fields.
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. Shape Reconfiguration by Hybrid Programmable Matter.; 2023.
apa: Friemel, J. (2023). Shape Reconfiguration by Hybrid Programmable Matter.
bibtex: '@book{Friemel_2023, title={Shape Reconfiguration by Hybrid Programmable
Matter}, author={Friemel, Jonas}, year={2023} }'
chicago: Friemel, Jonas. Shape Reconfiguration by Hybrid Programmable Matter,
2023.
ieee: J. Friemel, Shape Reconfiguration by Hybrid Programmable Matter. 2023.
mla: Friemel, Jonas. Shape Reconfiguration by Hybrid Programmable Matter.
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. Self-Stabilizing Skip-Graph with Growth-Bounded Metric.;
2023.
apa: Beckendorf, B. (2023). Self-Stabilizing Skip-Graph with Growth-bounded Metric.
bibtex: '@book{Beckendorf_2023, title={Self-Stabilizing Skip-Graph with Growth-bounded
Metric}, author={Beckendorf, Björn}, year={2023} }'
chicago: Beckendorf, Björn. Self-Stabilizing Skip-Graph with Growth-Bounded Metric,
2023.
ieee: B. Beckendorf, Self-Stabilizing Skip-Graph with Growth-bounded Metric.
2023.
mla: Beckendorf, Björn. Self-Stabilizing Skip-Graph with Growth-Bounded Metric.
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: '30152'
author:
- first_name: Rajanna
full_name: Roopa, Rajanna
last_name: Roopa
citation:
ama: Roopa R. Evaluation of Algorithms for the Node Capacitated Clique.;
2022.
apa: Roopa, R. (2022). Evaluation of Algorithms for the Node Capacitated Clique.
bibtex: '@book{Roopa_2022, title={Evaluation of Algorithms for the Node Capacitated
Clique}, author={Roopa, Rajanna}, year={2022} }'
chicago: Roopa, Rajanna. Evaluation of Algorithms for the Node Capacitated Clique,
2022.
ieee: R. Roopa, Evaluation of Algorithms for the Node Capacitated Clique.
2022.
mla: Roopa, Rajanna. Evaluation of Algorithms for the Node Capacitated Clique.
2022.
short: R. Roopa, Evaluation of Algorithms for the Node Capacitated Clique, 2022.
date_created: 2022-02-28T07:46:23Z
date_updated: 2022-02-28T07:46:53Z
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: Evaluation of Algorithms for the Node Capacitated Clique
type: mastersthesis
user_id: '15504'
year: '2022'
...
---
_id: '30198'
author:
- first_name: Sebastian
full_name: Korzeczek, Sebastian
last_name: Korzeczek
citation:
ama: Korzeczek S. Aufarbeitung Und Lmplementierung von DAG-Rider.; 2022.
apa: Korzeczek, S. (2022). Aufarbeitung und lmplementierung von DAG-Rider.
bibtex: '@book{Korzeczek_2022, title={Aufarbeitung und lmplementierung von DAG-Rider},
author={Korzeczek, Sebastian}, year={2022} }'
chicago: Korzeczek, Sebastian. Aufarbeitung Und Lmplementierung von DAG-Rider,
2022.
ieee: S. Korzeczek, Aufarbeitung und lmplementierung von DAG-Rider. 2022.
mla: Korzeczek, Sebastian. Aufarbeitung Und Lmplementierung von DAG-Rider.
2022.
short: S. Korzeczek, Aufarbeitung Und Lmplementierung von DAG-Rider, 2022.
date_created: 2022-03-03T07:47:00Z
date_updated: 2022-03-03T07:51:02Z
department:
- _id: '79'
language:
- iso: eng
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'
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Aufarbeitung und lmplementierung von DAG-Rider
type: bachelorsthesis
user_id: '15504'
year: '2022'
...
---
_id: '30199'
author:
- first_name: Marcel
full_name: Nachtigall, Marcel
last_name: Nachtigall
citation:
ama: Nachtigall M. Hybrid Routing in Three Dimensions.; 2022.
apa: Nachtigall, M. (2022). Hybrid Routing in Three Dimensions.
bibtex: '@book{Nachtigall_2022, title={Hybrid Routing in Three Dimensions}, author={Nachtigall,
Marcel}, year={2022} }'
chicago: Nachtigall, Marcel. Hybrid Routing in Three Dimensions, 2022.
ieee: M. Nachtigall, Hybrid Routing in Three Dimensions. 2022.
mla: Nachtigall, Marcel. Hybrid Routing in Three Dimensions. 2022.
short: M. Nachtigall, Hybrid Routing in Three Dimensions, 2022.
date_created: 2022-03-03T07:50:45Z
date_updated: 2022-03-03T07:50:59Z
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: Hybrid Routing in Three Dimensions
type: mastersthesis
user_id: '15504'
year: '2022'
...
---
_id: '31060'
author:
- first_name: Michael
full_name: Feldmann, Michael
last_name: Feldmann
- first_name: Andreas
full_name: Padalkin, Andreas
id: '88238'
last_name: Padalkin
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Shlomi
full_name: Dolev, Shlomi
last_name: Dolev
citation:
ama: Feldmann M, Padalkin A, Scheideler C, Dolev S. Coordinating Amoebots via Reconfigurable
Circuits. J Comput Biol. 2022;29(4):317–343. doi:10.1089/cmb.2021.0363
apa: Feldmann, M., Padalkin, A., Scheideler, C., & Dolev, S. (2022). Coordinating
Amoebots via Reconfigurable Circuits. J. Comput. Biol., 29(4), 317–343.
https://doi.org/10.1089/cmb.2021.0363
bibtex: '@article{Feldmann_Padalkin_Scheideler_Dolev_2022, title={Coordinating Amoebots
via Reconfigurable Circuits}, volume={29}, DOI={10.1089/cmb.2021.0363},
number={4}, journal={J. Comput. Biol.}, author={Feldmann, Michael and Padalkin,
Andreas and Scheideler, Christian and Dolev, Shlomi}, year={2022}, pages={317–343}
}'
chicago: 'Feldmann, Michael, Andreas Padalkin, Christian Scheideler, and Shlomi
Dolev. “Coordinating Amoebots via Reconfigurable Circuits.” J. Comput. Biol.
29, no. 4 (2022): 317–343. https://doi.org/10.1089/cmb.2021.0363.'
ieee: 'M. Feldmann, A. Padalkin, C. Scheideler, and S. Dolev, “Coordinating Amoebots
via Reconfigurable Circuits,” J. Comput. Biol., vol. 29, no. 4, pp. 317–343,
2022, doi: 10.1089/cmb.2021.0363.'
mla: Feldmann, Michael, et al. “Coordinating Amoebots via Reconfigurable Circuits.”
J. Comput. Biol., vol. 29, no. 4, 2022, pp. 317–343, doi:10.1089/cmb.2021.0363.
short: M. Feldmann, A. Padalkin, C. Scheideler, S. Dolev, J. Comput. Biol. 29 (2022)
317–343.
date_created: 2022-05-04T12:29:22Z
date_updated: 2022-05-04T12:31:27Z
department:
- _id: '79'
doi: 10.1089/cmb.2021.0363
intvolume: ' 29'
issue: '4'
language:
- iso: eng
page: 317–343
publication: J. Comput. Biol.
status: public
title: Coordinating Amoebots via Reconfigurable Circuits
type: journal_article
user_id: '15504'
volume: 29
year: '2022'
...
---
_id: '31947'
author:
- first_name: Henning
full_name: Hillebrandt, Henning
last_name: Hillebrandt
citation:
ama: Hillebrandt H. Verteiltes Berechnen Kompakter Routingtabellen in Unit Disk
Graphen.; 2022.
apa: Hillebrandt, H. (2022). Verteiltes Berechnen kompakter Routingtabellen in
Unit Disk Graphen.
bibtex: '@book{Hillebrandt_2022, title={Verteiltes Berechnen kompakter Routingtabellen
in Unit Disk Graphen}, author={Hillebrandt, Henning}, year={2022} }'
chicago: Hillebrandt, Henning. Verteiltes Berechnen Kompakter Routingtabellen
in Unit Disk Graphen, 2022.
ieee: H. Hillebrandt, Verteiltes Berechnen kompakter Routingtabellen in Unit
Disk Graphen. 2022.
mla: Hillebrandt, Henning. Verteiltes Berechnen Kompakter Routingtabellen in
Unit Disk Graphen. 2022.
short: H. Hillebrandt, Verteiltes Berechnen Kompakter Routingtabellen in Unit Disk
Graphen, 2022.
date_created: 2022-06-20T06:16:32Z
date_updated: 2022-06-20T06:16:49Z
ddc:
- '000'
department:
- _id: '79'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2022-06-20T06:16:09Z
date_updated: 2022-06-20T06:16:09Z
file_id: '31950'
file_name: BA_Hillebrandt.pdf
file_size: 1585281
relation: main_file
success: 1
file_date_updated: 2022-06-20T06:16:09Z
has_accepted_license: '1'
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: Verteiltes Berechnen kompakter Routingtabellen in Unit Disk Graphen
type: bachelorsthesis
user_id: '15504'
year: '2022'
...
---
_id: '32602'
author:
- first_name: Andreas
full_name: Padalkin, Andreas
id: '88238'
last_name: Padalkin
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Daniel
full_name: Warner, Daniel
id: '3902'
last_name: Warner
citation:
ama: 'Padalkin A, Scheideler C, Warner D. The Structural Power of Reconfigurable
Circuits in the Amoebot Model. In: Ouldridge TE, Wickham SFJ, eds. 28th International
Conference on DNA Computing and Molecular Programming (DNA 28). Vol 238. Leibniz
International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum
für Informatik; 2022:8:1–8:22. doi:10.4230/LIPIcs.DNA.28.8'
apa: Padalkin, A., Scheideler, C., & Warner, D. (2022). The Structural Power
of Reconfigurable Circuits in the Amoebot Model. In T. E. Ouldridge & S. F.
J. Wickham (Eds.), 28th International Conference on DNA Computing and Molecular
Programming (DNA 28) (Vol. 238, p. 8:1–8:22). Schloss Dagstuhl – Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPIcs.DNA.28.8
bibtex: '@inproceedings{Padalkin_Scheideler_Warner_2022, place={Dagstuhl, Germany},
series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={The
Structural Power of Reconfigurable Circuits in the Amoebot Model}, volume={238},
DOI={10.4230/LIPIcs.DNA.28.8},
booktitle={28th International Conference on DNA Computing and Molecular Programming
(DNA 28)}, publisher={Schloss Dagstuhl – Leibniz-Zentrum für Informatik}, author={Padalkin,
Andreas and Scheideler, Christian and Warner, Daniel}, editor={Ouldridge, Thomas
E. and Wickham, Shelley F. J.}, year={2022}, pages={8:1–8:22}, collection={Leibniz
International Proceedings in Informatics (LIPIcs)} }'
chicago: 'Padalkin, Andreas, Christian Scheideler, and Daniel Warner. “The Structural
Power of Reconfigurable Circuits in the Amoebot Model.” In 28th International
Conference on DNA Computing and Molecular Programming (DNA 28), edited by
Thomas E. Ouldridge and Shelley F. J. Wickham, 238:8:1–8:22. Leibniz International
Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum
für Informatik, 2022. https://doi.org/10.4230/LIPIcs.DNA.28.8.'
ieee: 'A. Padalkin, C. Scheideler, and D. Warner, “The Structural Power of Reconfigurable
Circuits in the Amoebot Model,” in 28th International Conference on DNA Computing
and Molecular Programming (DNA 28), 2022, vol. 238, p. 8:1–8:22, doi: 10.4230/LIPIcs.DNA.28.8.'
mla: Padalkin, Andreas, et al. “The Structural Power of Reconfigurable Circuits
in the Amoebot Model.” 28th International Conference on DNA Computing and Molecular
Programming (DNA 28), edited by Thomas E. Ouldridge and Shelley F. J. Wickham,
vol. 238, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022, p. 8:1–8:22,
doi:10.4230/LIPIcs.DNA.28.8.
short: 'A. Padalkin, C. Scheideler, D. Warner, in: T.E. Ouldridge, S.F.J. Wickham
(Eds.), 28th International Conference on DNA Computing and Molecular Programming
(DNA 28), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany,
2022, p. 8:1–8:22.'
date_created: 2022-08-08T17:32:19Z
date_updated: 2022-11-17T14:18:24Z
department:
- _id: '79'
doi: 10.4230/LIPIcs.DNA.28.8
editor:
- first_name: Thomas E.
full_name: Ouldridge, Thomas E.
last_name: Ouldridge
- first_name: Shelley F. J.
full_name: Wickham, Shelley F. J.
last_name: Wickham
intvolume: ' 238'
language:
- iso: eng
page: 8:1–8:22
place: Dagstuhl, Germany
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '5'
name: 'SFB 901 - A1: SFB 901 - Subproject A1'
- _id: '13'
name: 'SFB 901 - C1: SFB 901 - Subproject C1'
publication: 28th International Conference on DNA Computing and Molecular Programming
(DNA 28)
publication_identifier:
isbn:
- 978-3-95977-253-2
issn:
- 1868-8969
publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: The Structural Power of Reconfigurable Circuits in the Amoebot Model
type: conference
user_id: '477'
volume: 238
year: '2022'
...
---
_id: '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: '33230'
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. Local Mutual Exclusion for Dynamic, Anonymous,
Bounded Memory Message Passing Systems. In: Aspnes J, Michail O, eds. 1st Symposium
on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022,
Virtual Conference. Vol 221. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für
Informatik; 2022:12:1–12:19. doi:10.4230/LIPIcs.SAND.2022.12'
apa: Daymude, J. J., Richa, A. W., & Scheideler, C. (2022). Local Mutual Exclusion
for Dynamic, Anonymous, Bounded Memory Message Passing Systems. In J. Aspnes &
O. Michail (Eds.), 1st Symposium on Algorithmic Foundations of Dynamic Networks,
SAND 2022, March 28-30, 2022, Virtual Conference (Vol. 221, p. 12:1–12:19).
Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SAND.2022.12
bibtex: '@inproceedings{Daymude_Richa_Scheideler_2022, series={LIPIcs}, title={Local
Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems},
volume={221}, DOI={10.4230/LIPIcs.SAND.2022.12},
booktitle={1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND
2022, March 28-30, 2022, Virtual Conference}, publisher={Schloss Dagstuhl - Leibniz-Zentrum
für Informatik}, author={Daymude, Joshua J. and Richa, Andréa W. and Scheideler,
Christian}, editor={Aspnes, James and Michail, Othon}, year={2022}, pages={12:1–12:19},
collection={LIPIcs} }'
chicago: Daymude, Joshua J., Andréa W. Richa, and Christian Scheideler. “Local Mutual
Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems.” In
1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March
28-30, 2022, Virtual Conference, edited by James Aspnes and Othon Michail,
221:12:1–12:19. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
https://doi.org/10.4230/LIPIcs.SAND.2022.12.
ieee: 'J. J. Daymude, A. W. Richa, and C. Scheideler, “Local Mutual Exclusion for
Dynamic, Anonymous, Bounded Memory Message Passing Systems,” in 1st Symposium
on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022,
Virtual Conference, 2022, vol. 221, p. 12:1–12:19, doi: 10.4230/LIPIcs.SAND.2022.12.'
mla: Daymude, Joshua J., et al. “Local Mutual Exclusion for Dynamic, Anonymous,
Bounded Memory Message Passing Systems.” 1st Symposium on Algorithmic Foundations
of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference, edited
by James Aspnes and Othon Michail, vol. 221, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2022, p. 12:1–12:19, doi:10.4230/LIPIcs.SAND.2022.12.
short: 'J.J. Daymude, A.W. Richa, C. Scheideler, in: J. Aspnes, O. Michail (Eds.),
1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March
28-30, 2022, Virtual Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2022, p. 12:1–12:19.'
date_created: 2022-08-30T06:31:21Z
date_updated: 2022-08-30T06:33:44Z
department:
- _id: '79'
doi: 10.4230/LIPIcs.SAND.2022.12
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: 12:1–12:19
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: 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022,
March 28-30, 2022, Virtual Conference
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
series_title: LIPIcs
status: public
title: Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing
Systems
type: conference
user_id: '15504'
volume: 221
year: '2022'
...
---
_id: '33240'
author:
- first_name: Thorsten
full_name: Götte, Thorsten
id: '34727'
last_name: Götte
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Götte T, Scheideler C. Brief Announcement: The (Limited) Power of Multiple
Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience
through Collusion. In: Agrawal K, Lee I-TA, eds. SPAA ’22: 34th ACM Symposium
on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11
- 14, 2022. ACM; 2022:99–101. doi:10.1145/3490148.3538556'
apa: 'Götte, T., & Scheideler, C. (2022). Brief Announcement: The (Limited)
Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved
Resilience through Collusion. In K. Agrawal & I.-T. A. Lee (Eds.), SPAA
’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia,
PA, USA, July 11 - 14, 2022 (pp. 99–101). ACM. https://doi.org/10.1145/3490148.3538556'
bibtex: '@inproceedings{Götte_Scheideler_2022, title={Brief Announcement: The (Limited)
Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved
Resilience through Collusion}, DOI={10.1145/3490148.3538556},
booktitle={SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures,
Philadelphia, PA, USA, July 11 - 14, 2022}, publisher={ACM}, author={Götte, Thorsten
and Scheideler, Christian}, editor={Agrawal, Kunal and Lee, I-Ting Angelina},
year={2022}, pages={99–101} }'
chicago: 'Götte, Thorsten, and Christian Scheideler. “Brief Announcement: The (Limited)
Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved
Resilience through Collusion.” In SPAA ’22: 34th ACM Symposium on Parallelism
in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022,
edited by Kunal Agrawal and I-Ting Angelina Lee, 99–101. ACM, 2022. https://doi.org/10.1145/3490148.3538556.'
ieee: 'T. Götte and C. Scheideler, “Brief Announcement: The (Limited) Power of Multiple
Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience
through Collusion,” in SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms
and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022, 2022, pp. 99–101,
doi: 10.1145/3490148.3538556.'
mla: 'Götte, Thorsten, and Christian Scheideler. “Brief Announcement: The (Limited)
Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved
Resilience through Collusion.” SPAA ’22: 34th ACM Symposium on Parallelism
in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022,
edited by Kunal Agrawal and I-Ting Angelina Lee, ACM, 2022, pp. 99–101, doi:10.1145/3490148.3538556.'
short: 'T. Götte, C. Scheideler, in: K. Agrawal, I.-T.A. Lee (Eds.), SPAA ’22: 34th
ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA,
USA, July 11 - 14, 2022, ACM, 2022, pp. 99–101.'
date_created: 2022-09-01T07:55:00Z
date_updated: 2022-09-01T07:57:53Z
department:
- _id: '79'
doi: 10.1145/3490148.3538556
editor:
- first_name: Kunal
full_name: Agrawal, Kunal
last_name: Agrawal
- first_name: I-Ting Angelina
full_name: Lee, I-Ting Angelina
last_name: Lee
language:
- iso: eng
page: 99–101
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: 'SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures,
Philadelphia, PA, USA, July 11 - 14, 2022'
publisher: ACM
status: public
title: 'Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous
Byzantine Reliable Broadcast with Improved Resilience through Collusion'
type: conference
user_id: '15504'
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: '33967'
author:
- first_name: Marcos
full_name: Aguiliera, Marcos
last_name: Aguiliera
- first_name: Andréa W.
full_name: Richa, Andréa W.
last_name: Richa
- first_name: Alexander A.
full_name: Schwarzmann, Alexander A.
last_name: Schwarzmann
- first_name: Alessandro
full_name: Panconesi, Alessandro
last_name: Panconesi
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Philipp
full_name: Woelfel, Philipp
last_name: Woelfel
citation:
ama: 'Aguiliera M, Richa AW, Schwarzmann AA, Panconesi A, Scheideler C, Woelfel
P. 2022 Edsger W. Dijkstra Prize in Distributed Computing. In: Milani A, Woelfel
P, eds. PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno,
Italy, July 25 - 29, 2022. ACM; 2022:1. doi:10.1145/3519270.3538411'
apa: 'Aguiliera, M., Richa, A. W., Schwarzmann, A. A., Panconesi, A., Scheideler,
C., & Woelfel, P. (2022). 2022 Edsger W. Dijkstra Prize in Distributed Computing.
In A. Milani & P. Woelfel (Eds.), PODC ’22: ACM Symposium on Principles
of Distributed Computing, Salerno, Italy, July 25 - 29, 2022 (p. 1). ACM.
https://doi.org/10.1145/3519270.3538411'
bibtex: '@inproceedings{Aguiliera_Richa_Schwarzmann_Panconesi_Scheideler_Woelfel_2022,
title={2022 Edsger W. Dijkstra Prize in Distributed Computing}, DOI={10.1145/3519270.3538411},
booktitle={PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno,
Italy, July 25 - 29, 2022}, publisher={ACM}, author={Aguiliera, Marcos and Richa,
Andréa W. and Schwarzmann, Alexander A. and Panconesi, Alessandro and Scheideler,
Christian and Woelfel, Philipp}, editor={Milani, Alessia and Woelfel, Philipp},
year={2022}, pages={1} }'
chicago: 'Aguiliera, Marcos, Andréa W. Richa, Alexander A. Schwarzmann, Alessandro
Panconesi, Christian Scheideler, and Philipp Woelfel. “2022 Edsger W. Dijkstra
Prize in Distributed Computing.” In PODC ’22: ACM Symposium on Principles of
Distributed Computing, Salerno, Italy, July 25 - 29, 2022, edited by Alessia
Milani and Philipp Woelfel, 1. ACM, 2022. https://doi.org/10.1145/3519270.3538411.'
ieee: 'M. Aguiliera, A. W. Richa, A. A. Schwarzmann, A. Panconesi, C. Scheideler,
and P. Woelfel, “2022 Edsger W. Dijkstra Prize in Distributed Computing,” in PODC
’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July
25 - 29, 2022, 2022, p. 1, doi: 10.1145/3519270.3538411.'
mla: 'Aguiliera, Marcos, et al. “2022 Edsger W. Dijkstra Prize in Distributed Computing.”
PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy,
July 25 - 29, 2022, edited by Alessia Milani and Philipp Woelfel, ACM, 2022,
p. 1, doi:10.1145/3519270.3538411.'
short: 'M. Aguiliera, A.W. Richa, A.A. Schwarzmann, A. Panconesi, C. Scheideler,
P. Woelfel, in: A. Milani, P. Woelfel (Eds.), PODC ’22: ACM Symposium on Principles
of Distributed Computing, Salerno, Italy, July 25 - 29, 2022, ACM, 2022, p. 1.'
date_created: 2022-11-02T08:53:37Z
date_updated: 2022-11-02T08:56:16Z
department:
- _id: '79'
doi: 10.1145/3519270.3538411
editor:
- first_name: Alessia
full_name: Milani, Alessia
last_name: Milani
- first_name: Philipp
full_name: Woelfel, Philipp
last_name: Woelfel
language:
- iso: eng
page: '1'
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: 'PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno,
Italy, July 25 - 29, 2022'
publisher: ACM
status: public
title: 2022 Edsger W. Dijkstra Prize in Distributed Computing
type: conference
user_id: '15504'
year: '2022'
...
---
_id: '33968'
citation:
ama: Scheideler C, ed. 36th International Symposium on Distributed Computing,
DISC 2022, October 25-27, 2022, Augusta, Georgia, USA. Vol 246. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik; 2022.
apa: Scheideler, C. (Ed.). (2022). 36th International Symposium on Distributed
Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA (Vol. 246).
Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
bibtex: '@book{Scheideler_2022, series={LIPIcs}, title={36th International Symposium
on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA},
volume={246}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, year={2022},
collection={LIPIcs} }'
chicago: Scheideler, Christian, ed. 36th International Symposium on Distributed
Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA. Vol. 246.
LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
ieee: C. Scheideler, Ed., 36th International Symposium on Distributed Computing,
DISC 2022, October 25-27, 2022, Augusta, Georgia, USA, vol. 246. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2022.
mla: Scheideler, Christian, editor. 36th International Symposium on Distributed
Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
short: C. Scheideler, ed., 36th International Symposium on Distributed Computing,
DISC 2022, October 25-27, 2022, Augusta, Georgia, USA, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2022.
date_created: 2022-11-02T08:55:30Z
date_updated: 2022-11-02T08:56:13Z
department:
- _id: '79'
editor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
intvolume: ' 246'
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'
publication_identifier:
isbn:
- 978-3-95977-255-6
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
series_title: LIPIcs
status: public
title: 36th International Symposium on Distributed Computing, DISC 2022, October 25-27,
2022, Augusta, Georgia, USA
type: conference_editor
user_id: '15504'
volume: 246
year: '2022'
...
---
_id: '30239'
author:
- first_name: Christina
full_name: Kolb, Christina
last_name: Kolb
citation:
ama: Kolb C. Competitive Routing in Hybrid Communications Networks and Message
Efficient SetCover in AdHoc Networks.; 2022. doi:10.17619/UNIPB/1-1673
apa: Kolb, C. (2022). Competitive Routing in Hybrid Communications Networks and
Message efficient SetCover in AdHoc Networks. https://doi.org/10.17619/UNIPB/1-1673
bibtex: '@book{Kolb_2022, title={Competitive Routing in Hybrid Communications Networks
and Message efficient SetCover in AdHoc Networks}, DOI={10.17619/UNIPB/1-1673 }, author={Kolb, Christina}, year={2022} }'
chicago: Kolb, Christina. Competitive Routing in Hybrid Communications Networks
and Message Efficient SetCover in AdHoc Networks, 2022. https://doi.org/10.17619/UNIPB/1-1673 .
ieee: C. Kolb, Competitive Routing in Hybrid Communications Networks and Message
efficient SetCover in AdHoc Networks. 2022.
mla: Kolb, Christina. Competitive Routing in Hybrid Communications Networks and
Message Efficient SetCover in AdHoc Networks. 2022, doi:10.17619/UNIPB/1-1673 .
short: C. Kolb, Competitive Routing in Hybrid Communications Networks and Message
Efficient SetCover in AdHoc Networks, 2022.
date_created: 2022-03-11T06:05:54Z
date_updated: 2023-03-17T07:22:04Z
department:
- _id: '79'
doi: '10.17619/UNIPB/1-1673 '
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: Competitive Routing in Hybrid Communications Networks and Message efficient
SetCover in AdHoc Networks
type: dissertation
user_id: '15504'
year: '2022'
...
---
_id: '21096'
abstract:
- lang: eng
text: While many research in distributed computing has covered solutions for self-stabilizing
computing and topologies, there is far less work on self-stabilization for distributed
data structures. However, when peers in peer-to-peer networks crash, a distributed
data structure may not remain intact. We present a self-stabilizing protocol for
a distributed data structure called the Hashed Patricia Trie (Kniesburges and
Scheideler WALCOM'11) that enables efficient prefix search on a set of keys. The
data structure has many applications while offering low overhead and efficient
operations when embedded on top of a Distributed Hash Table. Especially, longest
prefix matching for x can be done in O(log |x|) hash table read accesses. We show
how to maintain the structure in a self-stabilizing way, while assuring a low
overhead in a legal state and an asymptotically optimal memory demand of O(d)
bits, where d is the number of bits needed for storing all keys.
article_number: '104697'
author:
- first_name: Till
full_name: Knollmann, Till
id: '39241'
last_name: Knollmann
orcid: 0000-0003-2014-4696
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Knollmann T, Scheideler C. A self-stabilizing Hashed Patricia Trie. Information
and Computation. Published online 2022. doi:10.1016/j.ic.2021.104697
apa: Knollmann, T., & Scheideler, C. (2022). A self-stabilizing Hashed Patricia
Trie. Information and Computation, Article 104697. https://doi.org/10.1016/j.ic.2021.104697
bibtex: '@article{Knollmann_Scheideler_2022, title={A self-stabilizing Hashed Patricia
Trie}, DOI={10.1016/j.ic.2021.104697},
number={104697}, journal={Information and Computation}, author={Knollmann, Till
and Scheideler, Christian}, year={2022} }'
chicago: Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia
Trie.” Information and Computation, 2022. https://doi.org/10.1016/j.ic.2021.104697.
ieee: 'T. Knollmann and C. Scheideler, “A self-stabilizing Hashed Patricia Trie,”
Information and Computation, Art. no. 104697, 2022, doi: 10.1016/j.ic.2021.104697.'
mla: Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia
Trie.” Information and Computation, 104697, 2022, doi:10.1016/j.ic.2021.104697.
short: T. Knollmann, C. Scheideler, Information and Computation (2022).
date_created: 2021-01-29T09:39:40Z
date_updated: 2023-03-27T07:56:48Z
department:
- _id: '63'
- _id: '79'
doi: 10.1016/j.ic.2021.104697
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Information and Computation
publication_identifier:
issn:
- 0890-5401
publication_status: published
status: public
title: A self-stabilizing Hashed Patricia Trie
type: journal_article
user_id: '15504'
year: '2022'
...
---
_id: '24887'
author:
- first_name: Kristian
full_name: Hinnenthal, Kristian
id: '32229'
last_name: Hinnenthal
citation:
ama: Hinnenthal K. Models and Algorithms for Hybrid Networks and Hybrid Programmable
Matter.; 2021. doi:10.17619/UNIPB/1-1169
apa: Hinnenthal, K. (2021). Models and Algorithms for Hybrid Networks and Hybrid
Programmable Matter. https://doi.org/10.17619/UNIPB/1-1169
bibtex: '@book{Hinnenthal_2021, title={Models and Algorithms for Hybrid Networks
and Hybrid Programmable Matter}, DOI={10.17619/UNIPB/1-1169 }, author={Hinnenthal, Kristian}, year={2021} }'
chicago: Hinnenthal, Kristian. Models and Algorithms for Hybrid Networks and
Hybrid Programmable Matter, 2021. https://doi.org/10.17619/UNIPB/1-1169 .
ieee: K. Hinnenthal, Models and Algorithms for Hybrid Networks and Hybrid Programmable
Matter. 2021.
mla: Hinnenthal, Kristian. Models and Algorithms for Hybrid Networks and Hybrid
Programmable Matter. 2021, doi:10.17619/UNIPB/1-1169 .
short: K. Hinnenthal, Models and Algorithms for Hybrid Networks and Hybrid Programmable
Matter, 2021.
date_created: 2021-09-22T12:33:44Z
date_updated: 2022-01-06T06:56:40Z
department:
- _id: '79'
doi: '10.17619/UNIPB/1-1169 '
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter
type: dissertation
user_id: '15504'
year: '2021'
...
---
_id: '25126'
abstract:
- lang: eng
text: Motivated by the prospect of computing agents that explore unknown environments
and construct convex hulls on the nanoscale, we investigate the capabilities and
limitations of a single deterministic finite automaton robot in the three-dimensional
hybrid model for programmable matter. In this model, active robots move on a set
of passive tiles, called configuration, with the geometric shape of rhombic dodecahedra
on the adjacency graph of the face-centered cubic sphere-packing. We show that
the exploration problem is equally hard in the hybrid model and in three-dimensional
mazes, in which tiles have the shape of cubes and are positioned at the vertices
of $\mathbb{Z}^3$. Thereby, a single robot with a constant number of pebbles cannot
solve this problem in the hybrid model on arbitrary configurations. We provide
algorithms for a robot with two pebbles that solve the exploration problem in
the subclass of compact configurations of size $n$ in $\O(n^3)$ rounds. Further,
we investigate the robot's capabilities of detection and hull construction in
terms of restricted orientation convexity. We show that a robot without any pebble
can detect strong $\O$-convexity in $\O(n)$ rounds, but cannot detect weak $\O$-convexity,
not even if provided with a single pebble. Assuming that a robot can construct
tiles from scratch and deconstruct previously constructed tiles, we show that
the strong $\O$-hull of any given configuration of size $n$ can be constructed
in $\O(n^4)$ rounds, even if the robot cannot distinguish constructed from native
tiles.
author:
- first_name: David Jan
full_name: Liedtke, David Jan
id: '55557'
last_name: Liedtke
citation:
ama: Liedtke DJ. Exploration and Convex Hull Construction in the Three-Dimensional
Hybrid Model.; 2021.
apa: Liedtke, D. J. (2021). Exploration and Convex Hull Construction in the Three-Dimensional
Hybrid Model.
bibtex: '@book{Liedtke_2021, title={Exploration and Convex Hull Construction in
the Three-Dimensional Hybrid Model}, author={Liedtke, David Jan}, year={2021}
}'
chicago: Liedtke, David Jan. Exploration and Convex Hull Construction in the
Three-Dimensional Hybrid Model, 2021.
ieee: D. J. Liedtke, Exploration and Convex Hull Construction in the Three-Dimensional
Hybrid Model. 2021.
mla: Liedtke, David Jan. Exploration and Convex Hull Construction in the Three-Dimensional
Hybrid Model. 2021.
short: D.J. Liedtke, Exploration and Convex Hull Construction in the Three-Dimensional
Hybrid Model, 2021.
date_created: 2021-09-29T12:37:39Z
date_updated: 2022-01-06T06:56:53Z
ddc:
- '000'
department:
- _id: '79'
file:
- access_level: local
content_type: application/pdf
creator: liedtke
date_created: 2021-09-29T12:34:47Z
date_updated: 2021-09-29T12:34:47Z
file_id: '25128'
file_name: Master - Thesis.pdf
file_size: 10114825
relation: main_file
file_date_updated: 2021-09-29T12:34:47Z
has_accepted_license: '1'
keyword:
- Robot Exploration
- Finite Automaton
- Hybrid Model for Programmable Matter
- Convex Hull
language:
- iso: eng
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model
type: mastersthesis
user_id: '55557'
year: '2021'
...
---
_id: '28917'
author:
- first_name: Michael
full_name: Feldmann, Michael
last_name: Feldmann
- first_name: Andreas
full_name: Padalkin, Andreas
id: '88238'
last_name: Padalkin
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Shlomi
full_name: Dolev, Shlomi
last_name: Dolev
citation:
ama: 'Feldmann M, Padalkin A, Scheideler C, Dolev S. Coordinating Amoebots via Reconfigurable
Circuits. In: Johnen C, Michael Schiller E, Schmid S, eds. Stabilization, Safety,
and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021,
Virtual Event, November 17-20, 2021, Proceedings. Vol 13046. Lecture Notes
in Computer Science. Springer; 2021:484-488. doi:10.1007/978-3-030-91081-5\_34'
apa: Feldmann, M., Padalkin, A., Scheideler, C., & Dolev, S. (2021). Coordinating
Amoebots via Reconfigurable Circuits. In C. Johnen, E. Michael Schiller, &
S. Schmid (Eds.), Stabilization, Safety, and Security of Distributed Systems
- 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021,
Proceedings (Vol. 13046, pp. 484–488). Springer. https://doi.org/10.1007/978-3-030-91081-5\_34
bibtex: '@inproceedings{Feldmann_Padalkin_Scheideler_Dolev_2021, series={Lecture
Notes in Computer Science}, title={Coordinating Amoebots via Reconfigurable Circuits},
volume={13046}, DOI={10.1007/978-3-030-91081-5\_34},
booktitle={Stabilization, Safety, and Security of Distributed Systems - 23rd International
Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings}, publisher={Springer},
author={Feldmann, Michael and Padalkin, Andreas and Scheideler, Christian and
Dolev, Shlomi}, editor={Johnen, Colette and Michael Schiller, Elad and Schmid,
Stefan}, year={2021}, pages={484–488}, collection={Lecture Notes in Computer Science}
}'
chicago: Feldmann, Michael, Andreas Padalkin, Christian Scheideler, and Shlomi Dolev.
“Coordinating Amoebots via Reconfigurable Circuits.” In Stabilization, Safety,
and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021,
Virtual Event, November 17-20, 2021, Proceedings, edited by Colette Johnen,
Elad Michael Schiller, and Stefan Schmid, 13046:484–88. Lecture Notes in Computer
Science. Springer, 2021. https://doi.org/10.1007/978-3-030-91081-5\_34.
ieee: 'M. Feldmann, A. Padalkin, C. Scheideler, and S. Dolev, “Coordinating Amoebots
via Reconfigurable Circuits,” in Stabilization, Safety, and Security of Distributed
Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20,
2021, Proceedings, 2021, vol. 13046, pp. 484–488, doi: 10.1007/978-3-030-91081-5\_34.'
mla: Feldmann, Michael, et al. “Coordinating Amoebots via Reconfigurable Circuits.”
Stabilization, Safety, and Security of Distributed Systems - 23rd International
Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings, edited
by Colette Johnen et al., vol. 13046, Springer, 2021, pp. 484–88, doi:10.1007/978-3-030-91081-5\_34.
short: 'M. Feldmann, A. Padalkin, C. Scheideler, S. Dolev, in: C. Johnen, E. Michael
Schiller, S. Schmid (Eds.), Stabilization, Safety, and Security of Distributed
Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20,
2021, Proceedings, Springer, 2021, pp. 484–488.'
date_created: 2021-12-15T09:37:38Z
date_updated: 2022-01-06T06:58:41Z
department:
- _id: '79'
doi: 10.1007/978-3-030-91081-5\_34
editor:
- first_name: Colette
full_name: Johnen, Colette
last_name: Johnen
- first_name: Elad
full_name: Michael Schiller, Elad
last_name: Michael Schiller
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
intvolume: ' 13046'
language:
- iso: eng
page: 484-488
publication: Stabilization, Safety, and Security of Distributed Systems - 23rd International
Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Coordinating Amoebots via Reconfigurable Circuits
type: conference
user_id: '15504'
volume: 13046
year: '2021'
...
---
_id: '28998'
author:
- first_name: Dennis
full_name: Suermann, Dennis
last_name: Suermann
citation:
ama: Suermann D. Schutz Und Stabilisierung von Overlay-Netzwerken Mithilfe Des
Relay-Layers.; 2021.
apa: Suermann, D. (2021). Schutz und Stabilisierung von Overlay-Netzwerken mithilfe
des Relay-Layers.
bibtex: '@book{Suermann_2021, title={Schutz und Stabilisierung von Overlay-Netzwerken
mithilfe des Relay-Layers}, author={Suermann, Dennis}, year={2021} }'
chicago: Suermann, Dennis. Schutz Und Stabilisierung von Overlay-Netzwerken Mithilfe
Des Relay-Layers, 2021.
ieee: D. Suermann, Schutz und Stabilisierung von Overlay-Netzwerken mithilfe
des Relay-Layers. 2021.
mla: Suermann, Dennis. Schutz Und Stabilisierung von Overlay-Netzwerken Mithilfe
Des Relay-Layers. 2021.
short: D. Suermann, Schutz Und Stabilisierung von Overlay-Netzwerken Mithilfe Des
Relay-Layers, 2021.
date_created: 2021-12-16T06:41:25Z
date_updated: 2022-01-06T06:58:43Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Schutz und Stabilisierung von Overlay-Netzwerken mithilfe des Relay-Layers
type: bachelorsthesis
user_id: '15504'
year: '2021'
...
---
_id: '27053'
author:
- first_name: Leon
full_name: Everling, Leon
last_name: Everling
citation:
ama: Everling L. Selbststabilisierender Bakery Algorithmus Für Verteilte Systeme.;
2021.
apa: Everling, L. (2021). Selbststabilisierender Bakery Algorithmus für verteilte
Systeme.
bibtex: '@book{Everling_2021, title={Selbststabilisierender Bakery Algorithmus für
verteilte Systeme}, author={Everling, Leon}, year={2021} }'
chicago: Everling, Leon. Selbststabilisierender Bakery Algorithmus Für Verteilte
Systeme, 2021.
ieee: L. Everling, Selbststabilisierender Bakery Algorithmus für verteilte Systeme.
2021.
mla: Everling, Leon. Selbststabilisierender Bakery Algorithmus Für Verteilte
Systeme. 2021.
short: L. Everling, Selbststabilisierender Bakery Algorithmus Für Verteilte Systeme,
2021.
date_created: 2021-11-02T10:13:51Z
date_updated: 2022-01-06T06:57:33Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Selbststabilisierender Bakery Algorithmus für verteilte Systeme
type: bachelorsthesis
user_id: '15504'
year: '2021'
...
---
_id: '27072'
author:
- first_name: Vaibhav
full_name: Adsul, Vaibhav
last_name: Adsul
citation:
ama: Adsul V. Peer-to-Peer Matching for Distributed Systems.; 2021.
apa: Adsul, V. (2021). Peer-to-Peer Matching for Distributed Systems.
bibtex: '@book{Adsul_2021, title={Peer-to-Peer Matching for Distributed Systems},
author={Adsul, Vaibhav}, year={2021} }'
chicago: Adsul, Vaibhav. Peer-to-Peer Matching for Distributed Systems, 2021.
ieee: V. Adsul, Peer-to-Peer Matching for Distributed Systems. 2021.
mla: Adsul, Vaibhav. Peer-to-Peer Matching for Distributed Systems. 2021.
short: V. Adsul, Peer-to-Peer Matching for Distributed Systems, 2021.
date_created: 2021-11-03T06:12:47Z
date_updated: 2022-01-06T06:57:33Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Peer-to-Peer Matching for Distributed Systems
type: mastersthesis
user_id: '15504'
year: '2021'
...
---
_id: '21084'
author:
- first_name: Julian
full_name: Werthmann, Julian
id: '50024'
last_name: Werthmann
citation:
ama: Werthmann J. Derandomization and Local Graph Problems in the Node-Capacitated
Clique.; 2021.
apa: Werthmann, J. (2021). Derandomization and Local Graph Problems in the Node-Capacitated
Clique.
bibtex: '@book{Werthmann_2021, title={Derandomization and Local Graph Problems in
the Node-Capacitated Clique}, author={Werthmann, Julian}, year={2021} }'
chicago: Werthmann, Julian. Derandomization and Local Graph Problems in the Node-Capacitated
Clique, 2021.
ieee: J. Werthmann, Derandomization and Local Graph Problems in the Node-Capacitated
Clique. 2021.
mla: Werthmann, Julian. Derandomization and Local Graph Problems in the Node-Capacitated
Clique. 2021.
short: J. Werthmann, Derandomization and Local Graph Problems in the Node-Capacitated
Clique, 2021.
date_created: 2021-01-26T13:58:14Z
date_updated: 2022-01-06T06:54:44Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Derandomization and Local Graph Problems in the Node-Capacitated Clique
type: mastersthesis
user_id: '15504'
year: '2021'
...
---
_id: '21197'
author:
- first_name: Ma
full_name: Mengshi, Ma
last_name: Mengshi
citation:
ama: Mengshi M. Self-Stabilizing Arrow Protocol on Spanning Trees with a Low
Diameter.; 2021.
apa: Mengshi, M. (2021). Self-stabilizing Arrow Protocol on Spanning Trees with
a Low Diameter.
bibtex: '@book{Mengshi_2021, title={Self-stabilizing Arrow Protocol on Spanning
Trees with a Low Diameter}, author={Mengshi, Ma}, year={2021} }'
chicago: Mengshi, Ma. Self-Stabilizing Arrow Protocol on Spanning Trees with
a Low Diameter, 2021.
ieee: M. Mengshi, Self-stabilizing Arrow Protocol on Spanning Trees with a Low
Diameter. 2021.
mla: Mengshi, Ma. Self-Stabilizing Arrow Protocol on Spanning Trees with a Low
Diameter. 2021.
short: M. Mengshi, Self-Stabilizing Arrow Protocol on Spanning Trees with a Low
Diameter, 2021.
date_created: 2021-02-09T07:09:22Z
date_updated: 2022-01-06T06:54:49Z
department:
- _id: '79'
language:
- iso: eng
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: '13'
name: SFB 901 - Subproject C1
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Self-stabilizing Arrow Protocol on Spanning Trees with a Low Diameter
type: bachelorsthesis
user_id: '15504'
year: '2021'
...
---
_id: '21627'
author:
- first_name: David
full_name: Liedtke, David
last_name: Liedtke
citation:
ama: Liedtke D. Exploration and Convex Hull Construction in the Three-Dimensional
Hybrid Model.; 2021.
apa: Liedtke, D. (2021). Exploration and Convex Hull Construction in the Three-Dimensional
Hybrid Model.
bibtex: '@book{Liedtke_2021, title={Exploration and Convex Hull Construction in
the Three-Dimensional Hybrid Model}, author={Liedtke, David}, year={2021} }'
chicago: Liedtke, David. Exploration and Convex Hull Construction in the Three-Dimensional
Hybrid Model, 2021.
ieee: D. Liedtke, Exploration and Convex Hull Construction in the Three-Dimensional
Hybrid Model. 2021.
mla: Liedtke, David. Exploration and Convex Hull Construction in the Three-Dimensional
Hybrid Model. 2021.
short: D. Liedtke, Exploration and Convex Hull Construction in the Three-Dimensional
Hybrid Model, 2021.
date_created: 2021-04-15T05:51:43Z
date_updated: 2022-01-06T06:55:08Z
department:
- _id: '79'
language:
- iso: eng
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model
type: mastersthesis
user_id: '15504'
year: '2021'
...
---
_id: '21628'
abstract:
- lang: eng
text: "This thesis considers the realization of distributed data structures and
the construction of distributed protocols for self-stabilizing overlay networks.\r\n\r\nIn
the first part of this thesis, we provide distributed protocols for queues, stacks
and priority queues that serve the insertion and deletion of elements within a
logarithmic amount of rounds.\r\nOur protocols respect semantic constraints such
as sequential consistency or serializability and the individual semantic constraints
given by the type (queue, stack, priority queue) of the data structure.\r\nWe
furthermore provide a protocol that handles joining and leaving nodes.\r\nAs an
important side product, we present a novel protocol solving the distributed $k$-selection
problem in a logarithmic amount of rounds, that is, to find the $k$-smallest elements
among a polynomial number of elements spread among $n$ nodes.\r\n\t\r\nThe second
part of this thesis is devoted to the construction of protocols for self-stabilizing
overlay networks, i.e., distributed protocols that transform an overlay network
from any initial (potentially illegitimate) state into a legitimate state in finite
time.\r\nWe present protocols for self-stabilizing generalized De Bruijn graphs,
self-stabilizing quadtrees and self-stabilizing supervised skip rings.\r\nEach
of those protocols comes with unique properties that makes it interesting for
certain distributed applications.\r\nGeneralized De Bruijn networks provide routing
within a constant amount of hops, thus serving the interest in networks that require
a low latency for requests.\r\nThe protocol for the quadtree guarantees monotonic
searchability as well as a geometric variant of monotonic searchability, making
it interesting for wireless networks or applications needed in the area of computational
geometry.\r\nThe supervised skip ring can be used to construct a self-stabilizing
publish-subscribe system.\r\n"
author:
- first_name: Michael
full_name: Feldmann, Michael
id: '23538'
last_name: Feldmann
citation:
ama: Feldmann M. Algorithms for Distributed Data Structures and Self-Stabilizing
Overlay Networks.; 2021. doi:10.17619/UNIPB/1-1113
apa: Feldmann, M. (2021). Algorithms for Distributed Data Structures and Self-Stabilizing
Overlay Networks. https://doi.org/10.17619/UNIPB/1-1113
bibtex: '@book{Feldmann_2021, title={Algorithms for Distributed Data Structures
and Self-Stabilizing Overlay Networks}, DOI={10.17619/UNIPB/1-1113},
author={Feldmann, Michael}, year={2021} }'
chicago: Feldmann, Michael. Algorithms for Distributed Data Structures and Self-Stabilizing
Overlay Networks, 2021. https://doi.org/10.17619/UNIPB/1-1113.
ieee: M. Feldmann, Algorithms for Distributed Data Structures and Self-Stabilizing
Overlay Networks. 2021.
mla: Feldmann, Michael. Algorithms for Distributed Data Structures and Self-Stabilizing
Overlay Networks. 2021, doi:10.17619/UNIPB/1-1113.
short: M. Feldmann, Algorithms for Distributed Data Structures and Self-Stabilizing
Overlay Networks, 2021.
date_created: 2021-04-15T08:23:52Z
date_updated: 2022-01-06T06:55:08Z
ddc:
- '006'
department:
- _id: '79'
doi: 10.17619/UNIPB/1-1113
file:
- access_level: closed
content_type: application/pdf
creator: mfeldma2
date_created: 2021-04-15T08:21:15Z
date_updated: 2021-04-15T08:21:15Z
file_id: '21629'
file_name: Dissertation_Michael_Feldmann.pdf
file_size: 2617069
relation: main_file
success: 1
file_date_updated: 2021-04-15T08:21:15Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks
type: dissertation
user_id: '23538'
year: '2021'
...
---
_id: '30217'
author:
- first_name: Sam
full_name: Coy, Sam
last_name: Coy
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
- first_name: Michael
full_name: Feldmann, Michael
last_name: Feldmann
- first_name: Kristian
full_name: Hinnenthal, Kristian
last_name: Hinnenthal
- first_name: Fabian
full_name: Kuhn, Fabian
last_name: Kuhn
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Philipp
full_name: Schneider, Philipp
last_name: Schneider
- first_name: Martijn
full_name: Struijs, Martijn
last_name: Struijs
citation:
ama: 'Coy S, Czumaj A, Feldmann M, et al. Near-Shortest Path Routing in Hybrid Communication
Networks. In: Bramas Q, Gramoli V, Milani A, eds. 25th International Conference
on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg,
France. Vol 217. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik;
2021:11:1–11:23. doi:10.4230/LIPIcs.OPODIS.2021.11'
apa: Coy, S., Czumaj, A., Feldmann, M., Hinnenthal, K., Kuhn, F., Scheideler, C.,
Schneider, P., & Struijs, M. (2021). Near-Shortest Path Routing in Hybrid
Communication Networks. In Q. Bramas, V. Gramoli, & A. Milani (Eds.), 25th
International Conference on Principles of Distributed Systems, OPODIS 2021, December
13-15, 2021, Strasbourg, France (Vol. 217, p. 11:1–11:23). Schloss Dagstuhl
- Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2021.11
bibtex: '@inproceedings{Coy_Czumaj_Feldmann_Hinnenthal_Kuhn_Scheideler_Schneider_Struijs_2021,
series={LIPIcs}, title={Near-Shortest Path Routing in Hybrid Communication Networks},
volume={217}, DOI={10.4230/LIPIcs.OPODIS.2021.11},
booktitle={25th International Conference on Principles of Distributed Systems,
OPODIS 2021, December 13-15, 2021, Strasbourg, France}, publisher={Schloss Dagstuhl
- Leibniz-Zentrum für Informatik}, author={Coy, Sam and Czumaj, Artur and Feldmann,
Michael and Hinnenthal, Kristian and Kuhn, Fabian and Scheideler, Christian and
Schneider, Philipp and Struijs, Martijn}, editor={Bramas, Quentin and Gramoli,
Vincent and Milani, Alessia}, year={2021}, pages={11:1–11:23}, collection={LIPIcs}
}'
chicago: Coy, Sam, Artur Czumaj, Michael Feldmann, Kristian Hinnenthal, Fabian Kuhn,
Christian Scheideler, Philipp Schneider, and Martijn Struijs. “Near-Shortest Path
Routing in Hybrid Communication Networks.” In 25th International Conference
on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg,
France, edited by Quentin Bramas, Vincent Gramoli, and Alessia Milani, 217:11:1–11:23.
LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.OPODIS.2021.11.
ieee: 'S. Coy et al., “Near-Shortest Path Routing in Hybrid Communication
Networks,” in 25th International Conference on Principles of Distributed Systems,
OPODIS 2021, December 13-15, 2021, Strasbourg, France, 2021, vol. 217, p.
11:1–11:23, doi: 10.4230/LIPIcs.OPODIS.2021.11.'
mla: Coy, Sam, et al. “Near-Shortest Path Routing in Hybrid Communication Networks.”
25th International Conference on Principles of Distributed Systems, OPODIS
2021, December 13-15, 2021, Strasbourg, France, edited by Quentin Bramas et
al., vol. 217, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, p. 11:1–11:23,
doi:10.4230/LIPIcs.OPODIS.2021.11.
short: 'S. Coy, A. Czumaj, M. Feldmann, K. Hinnenthal, F. Kuhn, C. Scheideler, P.
Schneider, M. Struijs, in: Q. Bramas, V. Gramoli, A. Milani (Eds.), 25th International
Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15,
2021, Strasbourg, France, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021,
p. 11:1–11:23.'
date_created: 2022-03-09T10:43:28Z
date_updated: 2022-03-09T10:46:34Z
department:
- _id: '79'
doi: 10.4230/LIPIcs.OPODIS.2021.11
editor:
- first_name: Quentin
full_name: Bramas, Quentin
last_name: Bramas
- first_name: Vincent
full_name: Gramoli, Vincent
last_name: Gramoli
- first_name: Alessia
full_name: Milani, Alessia
last_name: Milani
intvolume: ' 217'
language:
- iso: eng
page: 11:1–11:23
publication: 25th International Conference on Principles of Distributed Systems, OPODIS
2021, December 13-15, 2021, Strasbourg, France
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
series_title: LIPIcs
status: public
title: Near-Shortest Path Routing in Hybrid Communication Networks
type: conference
user_id: '15504'
volume: 217
year: '2021'
...
---
_id: '20221'
author:
- first_name: Paresh Kishor
full_name: Yeole, Paresh Kishor
last_name: Yeole
citation:
ama: Yeole PK. Plurality Consensus in Hybrid Networks.; 2020.
apa: Yeole, P. K. (2020). Plurality Consensus in Hybrid Networks.
bibtex: '@book{Yeole_2020, title={Plurality Consensus in Hybrid Networks}, author={Yeole,
Paresh Kishor}, year={2020} }'
chicago: Yeole, Paresh Kishor. Plurality Consensus in Hybrid Networks, 2020.
ieee: P. K. Yeole, Plurality Consensus in Hybrid Networks. 2020.
mla: Yeole, Paresh Kishor. Plurality Consensus in Hybrid Networks. 2020.
short: P.K. Yeole, Plurality Consensus in Hybrid Networks, 2020.
date_created: 2020-10-29T07:45:57Z
date_updated: 2022-01-06T06:54:23Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Plurality Consensus in Hybrid Networks
type: mastersthesis
user_id: '15504'
year: '2020'
...
---
_id: '17836'
citation:
ama: Werneck Richa A, Scheideler C, eds. Structural Information and Communication
Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany,
June 29 - July 1, 2020, Proceedings. Vol 12156. Springer; 2020. doi:10.1007/978-3-030-54921-3
apa: Werneck Richa, A., & Scheideler, C. (Eds.). (2020). Structural Information
and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn,
Germany, June 29 - July 1, 2020, Proceedings (Vol. 12156). Springer. https://doi.org/10.1007/978-3-030-54921-3
bibtex: '@book{Werneck Richa_Scheideler_2020, series={Lecture Notes in Computer
Science}, title={Structural Information and Communication Complexity - 27th International
Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings},
volume={12156}, DOI={10.1007/978-3-030-54921-3},
publisher={Springer}, year={2020}, collection={Lecture Notes in Computer Science}
}'
chicago: Werneck Richa, Andrea, and Christian Scheideler, eds. Structural Information
and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn,
Germany, June 29 - July 1, 2020, Proceedings. Vol. 12156. Lecture Notes in
Computer Science. Springer, 2020. https://doi.org/10.1007/978-3-030-54921-3.
ieee: A. Werneck Richa and C. Scheideler, Eds., Structural Information and Communication
Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany,
June 29 - July 1, 2020, Proceedings, vol. 12156. Springer, 2020.
mla: Werneck Richa, Andrea, and Christian Scheideler, editors. Structural Information
and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn,
Germany, June 29 - July 1, 2020, Proceedings. Vol. 12156, Springer, 2020,
doi:10.1007/978-3-030-54921-3.
short: A. Werneck Richa, C. Scheideler, eds., Structural Information and Communication
Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany,
June 29 - July 1, 2020, Proceedings, Springer, 2020.
date_created: 2020-08-12T07:54:22Z
date_updated: 2022-01-06T06:53:20Z
department:
- _id: '79'
doi: 10.1007/978-3-030-54921-3
editor:
- first_name: Andrea
full_name: Werneck Richa, Andrea
last_name: Werneck Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
intvolume: ' 12156'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '2'
name: SFB 901 - Project Area A
publication_identifier:
isbn:
- 978-3-030-54920-6
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Structural Information and Communication Complexity - 27th International Colloquium,
SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings
type: conference_editor
user_id: '15504'
volume: 12156
year: '2020'
...
---
_id: '17839'
citation:
ama: 'Scheideler C, Spear M, eds. SPAA ’20: 32nd ACM Symposium on Parallelism
in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020. ACM;
2020. doi:10.1145/3350755'
apa: 'Scheideler, C., & Spear, M. (Eds.). (2020). SPAA ’20: 32nd ACM Symposium
on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17,
2020. ACM. https://doi.org/10.1145/3350755'
bibtex: '@book{Scheideler_Spear_2020, title={SPAA ’20: 32nd ACM Symposium on Parallelism
in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020}, DOI={10.1145/3350755}, publisher={ACM},
year={2020} }'
chicago: 'Scheideler, Christian, and Michael Spear, eds. SPAA ’20: 32nd ACM Symposium
on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17,
2020. ACM, 2020. https://doi.org/10.1145/3350755.'
ieee: 'C. Scheideler and M. Spear, Eds., SPAA ’20: 32nd ACM Symposium on Parallelism
in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020. ACM,
2020.'
mla: 'Scheideler, Christian, and Michael Spear, editors. SPAA ’20: 32nd ACM Symposium
on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17,
2020. ACM, 2020, doi:10.1145/3350755.'
short: 'C. Scheideler, M. Spear, eds., SPAA ’20: 32nd ACM Symposium on Parallelism
in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020, ACM, 2020.'
date_created: 2020-08-12T07:57:10Z
date_updated: 2022-01-06T06:53:20Z
department:
- _id: '79'
doi: 10.1145/3350755
editor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Michael
full_name: Spear, Michael
last_name: Spear
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication_identifier:
isbn:
- 978-1-4503-6935-0
publisher: ACM
status: public
title: 'SPAA ''20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures,
Virtual Event, USA, July 15-17, 2020'
type: conference_editor
user_id: '15504'
year: '2020'
...
---
_id: '20495'
author:
- first_name: Moritz
full_name: Jochmaring, Moritz
last_name: Jochmaring
citation:
ama: Jochmaring M. A Self Stabilizing Protocol for Well-Formed Trees in Hybrid
Networks.; 2020.
apa: Jochmaring, M. (2020). A self stabilizing protocol for well-formed trees
in hybrid networks.
bibtex: '@book{Jochmaring_2020, title={A self stabilizing protocol for well-formed
trees in hybrid networks}, author={Jochmaring, Moritz}, year={2020} }'
chicago: Jochmaring, Moritz. A Self Stabilizing Protocol for Well-Formed Trees
in Hybrid Networks, 2020.
ieee: M. Jochmaring, A self stabilizing protocol for well-formed trees in hybrid
networks. 2020.
mla: Jochmaring, Moritz. A Self Stabilizing Protocol for Well-Formed Trees in
Hybrid Networks. 2020.
short: M. Jochmaring, A Self Stabilizing Protocol for Well-Formed Trees in Hybrid
Networks, 2020.
date_created: 2020-11-25T07:03:16Z
date_updated: 2022-01-06T06:54:27Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '2'
name: SFB 901 - Project Area A
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: A self stabilizing protocol for well-formed trees in hybrid networks
type: mastersthesis
user_id: '15504'
year: '2020'
...
---
_id: '20755'
abstract:
- lang: eng
text: "We consider the problem of computing shortest paths in \\emph{hybrid networks},
in which nodes can make use of different communication modes. For example, mobile
phones may use ad-hoc connections via Bluetooth or Wi-Fi in addition to the cellular
network to solve tasks more efficiently. Like in this case, the different communication
modes may differ considerably in range, bandwidth, and flexibility. We build upon
the model of Augustine et al. [SODA '20], which captures these differences by
a \\emph{local} and a \\emph{global} mode. Specifically, the local edges model
a fixed communication network in which $O(1)$ messages of size $O(\\log n)$ can
be sent over every edge in each synchronous round. The global edges form a clique,
but nodes are only allowed to send and receive a total of at most $O(\\log n)$
messages over global edges, which restricts the nodes to use these edges only
very sparsely.\r\n\r\nWe demonstrate the power of hybrid networks by presenting
algorithms to compute Single-Source Shortest Paths and the diameter very efficiently
in \\emph{sparse graphs}. Specifically, we present exact $O(\\log n)$ time algorithms
for cactus graphs (i.e., graphs in which each edge is contained in at most one
cycle), and $3$-approximations for graphs that have at most $n + O(n^{1/3})$ edges
and arboricity $O(\\log n)$. For these graph classes, our algorithms provide exponentially
faster solutions than the best known algorithms for general graphs in this model.\r\nBeyond
shortest paths, we also provide a variety of useful tools and techniques for hybrid
networks, which may be of independent interest.\r\n"
author:
- first_name: Michael
full_name: Feldmann, Michael
id: '23538'
last_name: Feldmann
- first_name: Kristian
full_name: Hinnenthal, Kristian
id: '32229'
last_name: Hinnenthal
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Feldmann M, Hinnenthal K, Scheideler C. Fast Hybrid Network Algorithms for
Shortest Paths in Sparse Graphs. In: Proceedings of the 24th International
Conference on Principles of Distributed Systems (OPODIS). Schloss Dagstuhl
- Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.OPODIS.2020.31'
apa: Feldmann, M., Hinnenthal, K., & Scheideler, C. (2020). Fast Hybrid Network
Algorithms for Shortest Paths in Sparse Graphs. In Proceedings of the 24th
International Conference on Principles of Distributed Systems (OPODIS). Schloss
Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2020.31
bibtex: '@inproceedings{Feldmann_Hinnenthal_Scheideler_2020, title={Fast Hybrid
Network Algorithms for Shortest Paths in Sparse Graphs}, DOI={10.4230/LIPIcs.OPODIS.2020.31},
booktitle={Proceedings of the 24th International Conference on Principles of Distributed
Systems (OPODIS)}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
author={Feldmann, Michael and Hinnenthal, Kristian and Scheideler, Christian},
year={2020} }'
chicago: Feldmann, Michael, Kristian Hinnenthal, and Christian Scheideler. “Fast
Hybrid Network Algorithms for Shortest Paths in Sparse Graphs.” In Proceedings
of the 24th International Conference on Principles of Distributed Systems (OPODIS).
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.OPODIS.2020.31.
ieee: M. Feldmann, K. Hinnenthal, and C. Scheideler, “Fast Hybrid Network Algorithms
for Shortest Paths in Sparse Graphs,” in Proceedings of the 24th International
Conference on Principles of Distributed Systems (OPODIS), 2020.
mla: Feldmann, Michael, et al. “Fast Hybrid Network Algorithms for Shortest Paths
in Sparse Graphs.” Proceedings of the 24th International Conference on Principles
of Distributed Systems (OPODIS), Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2020, doi:10.4230/LIPIcs.OPODIS.2020.31.
short: 'M. Feldmann, K. Hinnenthal, C. Scheideler, in: Proceedings of the 24th International
Conference on Principles of Distributed Systems (OPODIS), Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2020.'
date_created: 2020-12-16T10:20:18Z
date_updated: 2022-01-06T06:54:36Z
ddc:
- '000'
department:
- _id: '79'
doi: 10.4230/LIPIcs.OPODIS.2020.31
external_id:
arxiv:
- '2007.01191'
file:
- access_level: closed
content_type: application/pdf
creator: mfeldma2
date_created: 2020-12-16T10:18:50Z
date_updated: 2020-12-16T10:18:50Z
file_id: '20756'
file_name: Fast_Hybrid_Network_Algorithms_for_Shortest_Paths_in_Sparse_Graphs.pdf
file_size: 867373
relation: main_file
success: 1
file_date_updated: 2020-12-16T10:18:50Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '1'
name: SFB 901
publication: Proceedings of the 24th International Conference on Principles of Distributed
Systems (OPODIS)
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
status: public
title: Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs
type: conference
user_id: '23538'
year: '2020'
...
---
_id: '18066'
author:
- first_name: Michael
full_name: Skowronek, Michael
last_name: Skowronek
citation:
ama: Skowronek M. Approaches for Competetive Routing through Intersections of
Hole Abstractions in Hybrid Communication Networks. Universität Paderborn;
2020.
apa: Skowronek, M. (2020). Approaches for Competetive Routing through Intersections
of Hole Abstractions in Hybrid Communication Networks. Universität Paderborn.
bibtex: '@book{Skowronek_2020, title={Approaches for Competetive Routing through
Intersections of Hole Abstractions in Hybrid Communication Networks}, publisher={Universität
Paderborn}, author={Skowronek, Michael}, year={2020} }'
chicago: Skowronek, Michael. Approaches for Competetive Routing through Intersections
of Hole Abstractions in Hybrid Communication Networks. Universität Paderborn,
2020.
ieee: M. Skowronek, Approaches for Competetive Routing through Intersections
of Hole Abstractions in Hybrid Communication Networks. Universität Paderborn,
2020.
mla: Skowronek, Michael. Approaches for Competetive Routing through Intersections
of Hole Abstractions in Hybrid Communication Networks. Universität Paderborn,
2020.
short: M. Skowronek, Approaches for Competetive Routing through Intersections of
Hole Abstractions in Hybrid Communication Networks, Universität Paderborn, 2020.
date_created: 2020-08-20T07:40:58Z
date_updated: 2022-01-06T06:53:25Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Approaches for Competetive Routing through Intersections of Hole Abstractions
in Hybrid Communication Networks
type: bachelorsthesis
user_id: '477'
year: '2020'
...
---
_id: '18520'
author:
- first_name: Alexander
full_name: Setzer, Alexander
id: '11108'
last_name: Setzer
citation:
ama: Setzer A. Local Graph Transformation Primitives For Some Basic Problems
In Overlay Networks. Universität Paderborn; 2020. doi:10.17619/UNIPB/1-1026
apa: Setzer, A. (2020). Local Graph Transformation Primitives For Some Basic
Problems In Overlay Networks. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-1026
bibtex: '@book{Setzer_2020, title={Local Graph Transformation Primitives For Some
Basic Problems In Overlay Networks}, DOI={10.17619/UNIPB/1-1026},
publisher={Universität Paderborn}, author={Setzer, Alexander}, year={2020} }'
chicago: Setzer, Alexander. Local Graph Transformation Primitives For Some Basic
Problems In Overlay Networks. Universität Paderborn, 2020. https://doi.org/10.17619/UNIPB/1-1026.
ieee: A. Setzer, Local Graph Transformation Primitives For Some Basic Problems
In Overlay Networks. Universität Paderborn, 2020.
mla: Setzer, Alexander. Local Graph Transformation Primitives For Some Basic
Problems In Overlay Networks. Universität Paderborn, 2020, doi:10.17619/UNIPB/1-1026.
short: A. Setzer, Local Graph Transformation Primitives For Some Basic Problems
In Overlay Networks, Universität Paderborn, 2020.
date_created: 2020-08-28T06:50:29Z
date_updated: 2022-01-06T06:53:36Z
department:
- _id: '79'
doi: 10.17619/UNIPB/1-1026
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks
type: dissertation
user_id: '477'
year: '2020'
...
---
_id: '18648'
author:
- first_name: Andreas
full_name: Guggenmos, Andreas
last_name: Guggenmos
citation:
ama: Guggenmos A. Algorithmen Für Selbststabilisierende Skip+-Delaunaygraphen.
Universität Paderborn; 2020.
apa: Guggenmos, A. (2020). Algorithmen für selbststabilisierende Skip+-Delaunaygraphen.
Universität Paderborn.
bibtex: '@book{Guggenmos_2020, title={Algorithmen für selbststabilisierende Skip+-Delaunaygraphen},
publisher={Universität Paderborn}, author={Guggenmos, Andreas}, year={2020} }'
chicago: Guggenmos, Andreas. Algorithmen Für Selbststabilisierende Skip+-Delaunaygraphen.
Universität Paderborn, 2020.
ieee: A. Guggenmos, Algorithmen für selbststabilisierende Skip+-Delaunaygraphen.
Universität Paderborn, 2020.
mla: Guggenmos, Andreas. Algorithmen Für Selbststabilisierende Skip+-Delaunaygraphen.
Universität Paderborn, 2020.
short: A. Guggenmos, Algorithmen Für Selbststabilisierende Skip+-Delaunaygraphen,
Universität Paderborn, 2020.
date_created: 2020-08-31T07:14:51Z
date_updated: 2022-01-06T06:53:50Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Algorithmen für selbststabilisierende Skip+-Delaunaygraphen
type: bachelorsthesis
user_id: '477'
year: '2020'
...
---
_id: '16902'
abstract:
- lang: eng
text: "The maintenance of efficient and robust overlay networks is one\r\nof the
most fundamental and reoccurring themes in networking.\r\nThis paper presents
a survey of state-of-the-art \r\nalgorithms to design and repair overlay networks
in a distributed\r\nmanner. In particular, we discuss basic algorithmic primitives\r\nto
preserve connectivity, review algorithms for the fundamental\r\nproblem of graph
linearization, and then survey self-stabilizing\r\nalgorithms for metric and scalable
topologies. \r\nWe also identify open problems and avenues for future research.\r\n"
author:
- first_name: Michael
full_name: Feldmann, Michael
id: '23538'
last_name: Feldmann
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
citation:
ama: Feldmann M, Scheideler C, Schmid S. Survey on Algorithms for Self-Stabilizing
Overlay Networks. ACM Computing Surveys. 2020. doi:10.1145/3397190
apa: Feldmann, M., Scheideler, C., & Schmid, S. (2020). Survey on Algorithms
for Self-Stabilizing Overlay Networks. ACM Computing Surveys. https://doi.org/10.1145/3397190
bibtex: '@article{Feldmann_Scheideler_Schmid_2020, title={Survey on Algorithms for
Self-Stabilizing Overlay Networks}, DOI={10.1145/3397190},
journal={ACM Computing Surveys}, publisher={ACM}, author={Feldmann, Michael and
Scheideler, Christian and Schmid, Stefan}, year={2020} }'
chicago: Feldmann, Michael, Christian Scheideler, and Stefan Schmid. “Survey on
Algorithms for Self-Stabilizing Overlay Networks.” ACM Computing Surveys,
2020. https://doi.org/10.1145/3397190.
ieee: M. Feldmann, C. Scheideler, and S. Schmid, “Survey on Algorithms for Self-Stabilizing
Overlay Networks,” ACM Computing Surveys, 2020.
mla: Feldmann, Michael, et al. “Survey on Algorithms for Self-Stabilizing Overlay
Networks.” ACM Computing Surveys, ACM, 2020, doi:10.1145/3397190.
short: M. Feldmann, C. Scheideler, S. Schmid, ACM Computing Surveys (2020).
date_created: 2020-04-29T07:09:50Z
date_updated: 2022-01-06T06:52:58Z
department:
- _id: '79'
doi: 10.1145/3397190
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: ACM Computing Surveys
publisher: ACM
status: public
title: Survey on Algorithms for Self-Stabilizing Overlay Networks
type: journal_article
user_id: '23538'
year: '2020'
...
---
_id: '16903'
abstract:
- lang: eng
text: "We consider the clock synchronization problem in the (discrete) beeping model:
Given a network of $n$ nodes with each node having a clock value $\\delta(v) \\in
\\{0,\\ldots T-1\\}$, the goal is to synchronize the clock values of all nodes
such that they have the same value in any round.\r\nAs is standard in clock synchronization,
we assume \\emph{arbitrary activations} for all nodes, i.e., the nodes start their
protocol at an arbitrary round (not limited to $\\{0,\\ldots,T-1\\}$).\r\nWe give
an asymptotically optimal algorithm that runs in $4D + \\Bigl\\lfloor \\frac{D}{\\lfloor
T/4 \\rfloor} \\Bigr \\rfloor \\cdot (T \\mod 4) = O(D)$ rounds, where $D$ is
the diameter of the network.\r\nOnce all nodes are in sync, they beep at the same
round every $T$ rounds.\r\nThe algorithm drastically improves on the $O(T D)$-bound
of \\cite{firefly_sync} (where $T$ is required to be at least $4n$, so the bound
is no better than $O(nD)$).\r\nOur algorithm is very simple as nodes only have
to maintain $3$ bits in addition to the $\\lceil \\log T \\rceil$ bits needed
to maintain the clock.\r\nFurthermore we investigate the complexity of \\emph{self-stabilizing}
solutions for the clock synchronization problem: We first show lower bounds of
$\\Omega(\\max\\{T,n\\})$ rounds on the runtime and $\\Omega(\\log(\\max\\{T,n\\}))$
bits of memory required for any such protocol.\r\nAfterwards we present a protocol
that runs in $O(\\max\\{T,n\\})$ rounds using at most $O(\\log(\\max\\{T,n\\}))$
bits at each node, which is asymptotically optimal with regards to both, runtime
and memory requirements."
author:
- first_name: Michael
full_name: Feldmann, Michael
id: '23538'
last_name: Feldmann
- first_name: Ardalan
full_name: Khazraei, Ardalan
last_name: Khazraei
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Feldmann M, Khazraei A, Scheideler C. Time- and Space-Optimal Discrete Clock
Synchronization in the Beeping Model. In: Proceedings of the 32nd ACM Symposium
on Parallelism in Algorithms and Architectures (SPAA). ACM; 2020. doi:10.1145/3350755.3400246'
apa: Feldmann, M., Khazraei, A., & Scheideler, C. (2020). Time- and Space-Optimal
Discrete Clock Synchronization in the Beeping Model. In Proceedings of the
32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA).
ACM. https://doi.org/10.1145/3350755.3400246
bibtex: '@inproceedings{Feldmann_Khazraei_Scheideler_2020, title={Time- and Space-Optimal
Discrete Clock Synchronization in the Beeping Model}, DOI={10.1145/3350755.3400246},
booktitle={Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA)}, publisher={ACM}, author={Feldmann, Michael and Khazraei,
Ardalan and Scheideler, Christian}, year={2020} }'
chicago: Feldmann, Michael, Ardalan Khazraei, and Christian Scheideler. “Time- and
Space-Optimal Discrete Clock Synchronization in the Beeping Model.” In Proceedings
of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA).
ACM, 2020. https://doi.org/10.1145/3350755.3400246.
ieee: M. Feldmann, A. Khazraei, and C. Scheideler, “Time- and Space-Optimal Discrete
Clock Synchronization in the Beeping Model,” in Proceedings of the 32nd ACM
Symposium on Parallelism in Algorithms and Architectures (SPAA), 2020.
mla: Feldmann, Michael, et al. “Time- and Space-Optimal Discrete Clock Synchronization
in the Beeping Model.” Proceedings of the 32nd ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA), ACM, 2020, doi:10.1145/3350755.3400246.
short: 'M. Feldmann, A. Khazraei, C. Scheideler, in: Proceedings of the 32nd ACM
Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2020.'
date_created: 2020-04-29T07:16:35Z
date_updated: 2022-01-06T06:52:58Z
department:
- _id: '79'
doi: 10.1145/3350755.3400246
external_id:
arxiv:
- '2005.07388'
language:
- iso: eng
project:
- _id: '96'
name: Algorithmen für programmierbare Materie in einem physiologischen Medium
publication: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA)
publisher: ACM
status: public
title: Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model
type: conference
user_id: '23538'
year: '2020'
...
---
_id: '15770'
author:
- first_name: Daniel
full_name: Warner, Daniel
last_name: Warner
citation:
ama: Warner D. On the Complexity of Local Transformations in SDN Overlays.
Universität Paderborn; 2020.
apa: Warner, D. (2020). On the complexity of local transformations in SDN overlays.
Universität Paderborn.
bibtex: '@book{Warner_2020, title={On the complexity of local transformations in
SDN overlays}, publisher={Universität Paderborn}, author={Warner, Daniel}, year={2020}
}'
chicago: Warner, Daniel. On the Complexity of Local Transformations in SDN Overlays.
Universität Paderborn, 2020.
ieee: D. Warner, On the complexity of local transformations in SDN overlays.
Universität Paderborn, 2020.
mla: Warner, Daniel. On the Complexity of Local Transformations in SDN Overlays.
Universität Paderborn, 2020.
short: D. Warner, On the Complexity of Local Transformations in SDN Overlays, Universität
Paderborn, 2020.
date_created: 2020-02-04T13:47:02Z
date_updated: 2022-01-06T06:52:32Z
department:
- _id: '79'
language:
- iso: eng
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: '13'
name: SFB 901 - Subproject C1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: On the complexity of local transformations in SDN overlays
type: mastersthesis
user_id: '477'
year: '2020'
...
---
_id: '15169'
author:
- first_name: Jannik
full_name: Castenow, Jannik
id: '38705'
last_name: Castenow
- first_name: Christina
full_name: Kolb, Christina
id: '43647'
last_name: Kolb
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Castenow J, Kolb C, Scheideler C. A Bounding Box Overlay for Competitive Routing
in Hybrid Communication Networks. In: Proceedings of the 21st International
Conference on Distributed Computing and Networking (ICDCN). ACM.'
apa: 'Castenow, J., Kolb, C., & Scheideler, C. (n.d.). A Bounding Box Overlay
for Competitive Routing in Hybrid Communication Networks. In Proceedings of
the 21st International Conference on Distributed Computing and Networking (ICDCN).
Kolkata, Indien: ACM.'
bibtex: '@inproceedings{Castenow_Kolb_Scheideler, title={A Bounding Box Overlay
for Competitive Routing in Hybrid Communication Networks}, booktitle={Proceedings
of the 21st International Conference on Distributed Computing and Networking (ICDCN)},
publisher={ACM}, author={Castenow, Jannik and Kolb, Christina and Scheideler,
Christian} }'
chicago: Castenow, Jannik, Christina Kolb, and Christian Scheideler. “A Bounding
Box Overlay for Competitive Routing in Hybrid Communication Networks.” In Proceedings
of the 21st International Conference on Distributed Computing and Networking (ICDCN).
ACM, n.d.
ieee: J. Castenow, C. Kolb, and C. Scheideler, “A Bounding Box Overlay for Competitive
Routing in Hybrid Communication Networks,” in Proceedings of the 21st International
Conference on Distributed Computing and Networking (ICDCN), Kolkata, Indien.
mla: Castenow, Jannik, et al. “A Bounding Box Overlay for Competitive Routing in
Hybrid Communication Networks.” Proceedings of the 21st International Conference
on Distributed Computing and Networking (ICDCN), ACM.
short: 'J. Castenow, C. Kolb, C. Scheideler, in: Proceedings of the 21st International
Conference on Distributed Computing and Networking (ICDCN), ACM, n.d.'
conference:
end_date: 07.01.2020
location: Kolkata, Indien
name: '21st International Conference on Distributed Computing and Networking '
start_date: 04.01.2020
date_created: 2019-11-25T12:18:41Z
date_updated: 2022-01-06T06:52:16Z
department:
- _id: '63'
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Proceedings of the 21st International Conference on Distributed Computing
and Networking (ICDCN)
publication_status: accepted
publisher: ACM
status: public
title: A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks
type: conference
user_id: '477'
year: '2020'
...
---
_id: '17809'
author:
- first_name: N.
full_name: N., N.
last_name: N.
citation:
ama: N. N. Scalable Multi Objective Path Optimization for Multi-Laser Selective
Laser Melting Scanning Systems.; 2019.
apa: N., N. (2019). Scalable Multi Objective Path Optimization for Multi-Laser
Selective Laser Melting Scanning Systems.
bibtex: '@book{N._2019, title={Scalable Multi Objective Path Optimization for Multi-Laser
Selective Laser Melting Scanning Systems}, author={N., N.}, year={2019} }'
chicago: N., N. Scalable Multi Objective Path Optimization for Multi-Laser Selective
Laser Melting Scanning Systems, 2019.
ieee: N. N., Scalable Multi Objective Path Optimization for Multi-Laser Selective
Laser Melting Scanning Systems. 2019.
mla: N., N. Scalable Multi Objective Path Optimization for Multi-Laser Selective
Laser Melting Scanning Systems. 2019.
short: N. N., Scalable Multi Objective Path Optimization for Multi-Laser Selective
Laser Melting Scanning Systems, 2019.
date_created: 2020-08-11T11:06:28Z
date_updated: 2022-01-06T06:53:20Z
department:
- _id: '79'
language:
- iso: eng
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Scalable Multi Objective Path Optimization for Multi-Laser Selective Laser
Melting Scanning Systems
type: mastersthesis
user_id: '15504'
year: '2019'
...
---
_id: '8534'
abstract:
- lang: eng
text: "We propose two protocols for distributed priority queues (denoted by 'heap'
for simplicity in this paper) called SKEAP and SEAP. SKEAP realizes a distributed
heap for a constant amount of priorities and SEAP one for an arbitrary amount.
Both protocols build on an overlay, which induces an aggregation tree on which
heap operations are aggregated in batches, ensuring that our protocols scale even
for a high rate of incoming requests. As part of SEAP we provide a novel distributed
protocol for the k-selection problem that runs in time O(log n) w.h.p. SKEAP guarantees
sequential consistency for its heap operations, while SEAP guarantees serializability.
SKEAP and SEAP provide logarithmic runtimes w.h.p. on all their operations. \r\nSKEAP
and SEAP provide logarithmic runtimes w.h.p. on all their operations with SEAP
having to use only O(log n) bit messages."
author:
- first_name: Michael
full_name: Feldmann, Michael
id: '23538'
last_name: Feldmann
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Feldmann M, Scheideler C. Skeap & Seap: Scalable Distributed Priority
Queues for Constant and Arbitrary Priorities. In: Proceedings of the 31st ACM
Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM; 2019:287--296.
doi:10.1145/3323165.3323193'
apa: 'Feldmann, M., & Scheideler, C. (2019). Skeap & Seap: Scalable Distributed
Priority Queues for Constant and Arbitrary Priorities. In Proceedings of the
31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp.
287--296). ACM. https://doi.org/10.1145/3323165.3323193'
bibtex: '@inproceedings{Feldmann_Scheideler_2019, title={Skeap & Seap: Scalable
Distributed Priority Queues for Constant and Arbitrary Priorities}, DOI={10.1145/3323165.3323193},
booktitle={Proceedings of the 31st ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA)}, publisher={ACM}, author={Feldmann, Michael and Scheideler,
Christian}, year={2019}, pages={287--296} }'
chicago: 'Feldmann, Michael, and Christian Scheideler. “Skeap & Seap: Scalable
Distributed Priority Queues for Constant and Arbitrary Priorities.” In Proceedings
of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA),
287--296. ACM, 2019. https://doi.org/10.1145/3323165.3323193.'
ieee: 'M. Feldmann and C. Scheideler, “Skeap & Seap: Scalable Distributed Priority
Queues for Constant and Arbitrary Priorities,” in Proceedings of the 31st ACM
Symposium on Parallelism in Algorithms and Architectures (SPAA), 2019, pp.
287--296.'
mla: 'Feldmann, Michael, and Christian Scheideler. “Skeap & Seap: Scalable Distributed
Priority Queues for Constant and Arbitrary Priorities.” Proceedings of the
31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA),
ACM, 2019, pp. 287--296, doi:10.1145/3323165.3323193.'
short: 'M. Feldmann, C. Scheideler, in: Proceedings of the 31st ACM Symposium on
Parallelism in Algorithms and Architectures (SPAA), ACM, 2019, pp. 287--296.'
date_created: 2019-03-21T14:37:26Z
date_updated: 2022-01-06T07:03:56Z
ddc:
- '004'
department:
- _id: '79'
doi: 10.1145/3323165.3323193
external_id:
arxiv:
- '1805.03472'
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2019-08-26T09:14:32Z
date_updated: 2019-08-26T09:14:32Z
file_id: '12954'
file_name: p287-feldmann.pdf
file_size: 1295095
relation: main_file
success: 1
file_date_updated: 2019-08-26T09:14:32Z
has_accepted_license: '1'
language:
- iso: eng
page: 287--296
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA)
publisher: ACM
status: public
title: 'Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary
Priorities'
type: conference
user_id: '477'
year: '2019'
...
---
_id: '8871'
author:
- first_name: John
full_name: Augustine, John
last_name: Augustine
- first_name: Mohsen
full_name: Ghaffari, Mohsen
last_name: Ghaffari
- first_name: Robert
full_name: Gmyr, Robert
last_name: Gmyr
- first_name: Kristian
full_name: Hinnenthal, Kristian
id: '32229'
last_name: Hinnenthal
- first_name: Fabian
full_name: Kuhn, Fabian
last_name: Kuhn
- first_name: Jason
full_name: Li, Jason
last_name: Li
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Augustine J, Ghaffari M, Gmyr R, et al. Distributed Computation in Node-Capacitated
Networks. In: Proceedings of the 31st ACM Symposium on Parallelism in Algorithms
and Architectures. ACM; 2019:69--79. doi:10.1145/3323165.3323195'
apa: Augustine, J., Ghaffari, M., Gmyr, R., Hinnenthal, K., Kuhn, F., Li, J., &
Scheideler, C. (2019). Distributed Computation in Node-Capacitated Networks. In
Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures
(pp. 69--79). ACM. https://doi.org/10.1145/3323165.3323195
bibtex: '@inproceedings{Augustine_Ghaffari_Gmyr_Hinnenthal_Kuhn_Li_Scheideler_2019,
title={Distributed Computation in Node-Capacitated Networks}, DOI={10.1145/3323165.3323195},
booktitle={Proceedings of the 31st ACM Symposium on Parallelism in Algorithms
and Architectures}, publisher={ACM}, author={Augustine, John and Ghaffari, Mohsen
and Gmyr, Robert and Hinnenthal, Kristian and Kuhn, Fabian and Li, Jason and Scheideler,
Christian}, year={2019}, pages={69--79} }'
chicago: Augustine, John, Mohsen Ghaffari, Robert Gmyr, Kristian Hinnenthal, Fabian
Kuhn, Jason Li, and Christian Scheideler. “Distributed Computation in Node-Capacitated
Networks.” In Proceedings of the 31st ACM Symposium on Parallelism in Algorithms
and Architectures, 69--79. ACM, 2019. https://doi.org/10.1145/3323165.3323195.
ieee: J. Augustine et al., “Distributed Computation in Node-Capacitated Networks,”
in Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures,
2019, pp. 69--79.
mla: Augustine, John, et al. “Distributed Computation in Node-Capacitated Networks.”
Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures,
ACM, 2019, pp. 69--79, doi:10.1145/3323165.3323195.
short: 'J. Augustine, M. Ghaffari, R. Gmyr, K. Hinnenthal, F. Kuhn, J. Li, C. Scheideler,
in: Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures,
ACM, 2019, pp. 69--79.'
date_created: 2019-04-10T08:20:34Z
date_updated: 2022-01-06T07:04:04Z
ddc:
- '004'
department:
- _id: '79'
doi: 10.1145/3323165.3323195
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2019-08-26T11:17:58Z
date_updated: 2019-08-26T11:17:58Z
file_id: '12964'
file_name: p69-augustine.pdf
file_size: 1275192
relation: main_file
success: 1
file_date_updated: 2019-08-26T11:17:58Z
has_accepted_license: '1'
language:
- iso: eng
page: 69--79
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and
Architectures
publisher: ACM
status: public
title: Distributed Computation in Node-Capacitated Networks
type: conference
user_id: '477'
year: '2019'
...
---
_id: '6976'
abstract:
- lang: eng
text: "We investigate the maintenance of overlay networks under massive churn, i.e.\r\nnodes
joining and leaving the network. We assume an adversary that may churn a\r\nconstant
fraction $\\alpha n$ of nodes over the course of $\\mathcal{O}(\\log n)$\r\nrounds.
In particular, the adversary has an almost up-to-date information of\r\nthe network
topology as it can observe an only slightly outdated topology that\r\nis at least
$2$ rounds old. Other than that, we only have the provably minimal\r\nrestriction
that new nodes can only join the network via nodes that have taken\r\npart in
the network for at least one round.\r\n Our contributions are as follows: First,
we show that it is impossible to\r\nmaintain a connected topology if adversary
has up-to-date information about the\r\nnodes' connections. Further, we show that
our restriction concerning the join\r\nis also necessary. As our main result present
an algorithm that constructs a\r\nnew overlay- completely independent of all previous
overlays - every $2$\r\nrounds. Furthermore, each node sends and receives only
$\\mathcal{O}(\\log^3 n)$\r\nmessages each round. As part of our solution we propose
the Linearized DeBruijn\r\nSwarm (LDS), a highly churn resistant overlay, which
will be maintained by the\r\nalgorithm. However, our approaches can be transferred
to a variety of classical\r\nP2P Topologies where nodes are mapped into the $[0,1)$-interval."
author:
- first_name: Thorsten
full_name: Götte, Thorsten
id: '34727'
last_name: Götte
- first_name: Vipin Ravindran
full_name: Vijayalakshmi, Vipin Ravindran
last_name: Vijayalakshmi
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Götte T, Vijayalakshmi VR, Scheideler C. Always be Two Steps Ahead of Your
Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date
Adversary. In: Proceedings of the 2019 IEEE 33rd International Parallel and
Distributed Processing Symposium (IPDPS ’19). IEEE.'
apa: 'Götte, T., Vijayalakshmi, V. R., & Scheideler, C. (n.d.). Always be Two
Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn
with an Almost Up-to-date Adversary. In Proceedings of the 2019 IEEE 33rd International
Parallel and Distributed Processing Symposium (IPDPS ’19). Rio de Janeiro,
Brazil: IEEE.'
bibtex: '@inproceedings{Götte_Vijayalakshmi_Scheideler, title={Always be Two Steps
Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with
an Almost Up-to-date Adversary}, booktitle={Proceedings of the 2019 IEEE 33rd
International Parallel and Distributed Processing Symposium (IPDPS ’19)}, publisher={IEEE},
author={Götte, Thorsten and Vijayalakshmi, Vipin Ravindran and Scheideler, Christian}
}'
chicago: Götte, Thorsten, Vipin Ravindran Vijayalakshmi, and Christian Scheideler.
“Always Be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under
Massive Churn with an Almost Up-to-Date Adversary.” In Proceedings of the 2019
IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS
’19). IEEE, n.d.
ieee: T. Götte, V. R. Vijayalakshmi, and C. Scheideler, “Always be Two Steps Ahead
of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost
Up-to-date Adversary,” in Proceedings of the 2019 IEEE 33rd International Parallel
and Distributed Processing Symposium (IPDPS ’19), Rio de Janeiro, Brazil.
mla: Götte, Thorsten, et al. “Always Be Two Steps Ahead of Your Enemy - Maintaining
a Routable Overlay under Massive Churn with an Almost Up-to-Date Adversary.” Proceedings
of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium
(IPDPS ’19), IEEE.
short: 'T. Götte, V.R. Vijayalakshmi, C. Scheideler, in: Proceedings of the 2019
IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS
’19), IEEE, n.d.'
conference:
end_date: 24.05.19
location: Rio de Janeiro, Brazil
name: 2019 IEEE 33rd International Parallel and Distributed Processing Symposium
(IPDPS '19)
start_date: 20.05.19
date_created: 2019-01-24T18:53:11Z
date_updated: 2022-01-06T07:03:25Z
ddc:
- '000'
department:
- _id: '79'
file:
- access_level: closed
content_type: application/pdf
creator: thgoette
date_created: 2019-01-26T16:09:08Z
date_updated: 2019-01-26T16:09:08Z
file_id: '7007'
file_name: Always_be_Two_Steps_Ahead_of_Your_Enemy.pdf
file_size: 638020
relation: main_file
success: 1
file_date_updated: 2019-01-26T16:09:08Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication: Proceedings of the 2019 IEEE 33rd International Parallel and Distributed
Processing Symposium (IPDPS '19)
publication_status: accepted
publisher: IEEE
status: public
title: Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under
Massive Churn with an Almost Up-to-date Adversary
type: conference
user_id: '34727'
year: '2019'
...
---
_id: '10586'
abstract:
- lang: eng
text: We consider the problem of transforming a given graph G_s into a desired graph
G_t by applying a minimum number of primitives from a particular set of local
graph transformation primitives. These primitives are local in the sense that
each node can apply them based on local knowledge and by affecting only its 1-neighborhood.
Although the specific set of primitives we consider makes it possible to transform
any (weakly) connected graph into any other (weakly) connected graph consisting
of the same nodes, they cannot disconnect the graph or introduce new nodes into
the graph, making them ideal in the context of supervised overlay network transformations.
We prove that computing a minimum sequence of primitive applications (even centralized)
for arbitrary G_s and G_t is NP-hard, which we conjecture to hold for any set
of local graph transformation primitives satisfying the aforementioned properties.
On the other hand, we show that this problem admits a polynomial time algorithm
with a constant approximation ratio.
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Alexander
full_name: Setzer, Alexander
id: '11108'
last_name: Setzer
citation:
ama: 'Scheideler C, Setzer A. On the Complexity of Local Graph Transformations.
In: Proceedings of the 46th International Colloquium on Automata, Languages,
and Programming. Vol 132. LIPIcs. Dagstuhl Publishing; 2019:150:1--150:14.
doi:10.4230/LIPICS.ICALP.2019.150'
apa: 'Scheideler, C., & Setzer, A. (2019). On the Complexity of Local Graph
Transformations. In Proceedings of the 46th International Colloquium on Automata,
Languages, and Programming (Vol. 132, pp. 150:1--150:14). Patras, Greece:
Dagstuhl Publishing. https://doi.org/10.4230/LIPICS.ICALP.2019.150'
bibtex: '@inproceedings{Scheideler_Setzer_2019, series={LIPIcs}, title={On the Complexity
of Local Graph Transformations}, volume={132}, DOI={10.4230/LIPICS.ICALP.2019.150},
booktitle={Proceedings of the 46th International Colloquium on Automata, Languages,
and Programming}, publisher={Dagstuhl Publishing}, author={Scheideler, Christian
and Setzer, Alexander}, year={2019}, pages={150:1--150:14}, collection={LIPIcs}
}'
chicago: Scheideler, Christian, and Alexander Setzer. “On the Complexity of Local
Graph Transformations.” In Proceedings of the 46th International Colloquium
on Automata, Languages, and Programming, 132:150:1--150:14. LIPIcs. Dagstuhl
Publishing, 2019. https://doi.org/10.4230/LIPICS.ICALP.2019.150.
ieee: C. Scheideler and A. Setzer, “On the Complexity of Local Graph Transformations,”
in Proceedings of the 46th International Colloquium on Automata, Languages,
and Programming, Patras, Greece, 2019, vol. 132, pp. 150:1--150:14.
mla: Scheideler, Christian, and Alexander Setzer. “On the Complexity of Local Graph
Transformations.” Proceedings of the 46th International Colloquium on Automata,
Languages, and Programming, vol. 132, Dagstuhl Publishing, 2019, pp. 150:1--150:14,
doi:10.4230/LIPICS.ICALP.2019.150.
short: 'C. Scheideler, A. Setzer, in: Proceedings of the 46th International Colloquium
on Automata, Languages, and Programming, Dagstuhl Publishing, 2019, pp. 150:1--150:14.'
conference:
end_date: 2019-07-12
location: Patras, Greece
name: ICALP 2019
start_date: 2019-07-09
date_created: 2019-07-08T17:19:01Z
date_updated: 2022-01-06T06:50:45Z
ddc:
- '004'
department:
- _id: '79'
doi: 10.4230/LIPICS.ICALP.2019.150
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2019-08-26T09:21:27Z
date_updated: 2019-08-26T09:21:27Z
file_id: '12955'
file_name: LIPIcs-ICALP-2019-150.pdf
file_size: 537649
relation: main_file
success: 1
file_date_updated: 2019-08-26T09:21:27Z
has_accepted_license: '1'
intvolume: ' 132'
keyword:
- Graphs transformations
- NP-hardness
- approximation algorithms
language:
- iso: eng
page: 150:1--150:14
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 46th International Colloquium on Automata, Languages,
and Programming
publication_status: published
publisher: Dagstuhl Publishing
series_title: LIPIcs
status: public
title: On the Complexity of Local Graph Transformations
type: conference
user_id: '477'
volume: 132
year: '2019'
...
---
_id: '14829'
citation:
ama: Scheideler C, Berenbrink P, eds. The 31st ACM Symposium on Parallelism in
Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019.
ACM; 2019. doi:10.1145/3323165
apa: Scheideler, C., & Berenbrink, P. (Eds.). (2019). The 31st ACM Symposium
on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June
22-24, 2019. ACM. https://doi.org/10.1145/3323165
bibtex: '@book{Scheideler_Berenbrink_2019, title={The 31st ACM Symposium on Parallelism
in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019},
DOI={10.1145/3323165}, publisher={ACM},
year={2019} }'
chicago: Scheideler, Christian, and Petra Berenbrink, eds. The 31st ACM Symposium
on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June
22-24, 2019. ACM, 2019. https://doi.org/10.1145/3323165.
ieee: C. Scheideler and P. Berenbrink, Eds., The 31st ACM Symposium on Parallelism
in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019.
ACM, 2019.
mla: Scheideler, Christian, and Petra Berenbrink, editors. The 31st ACM Symposium
on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June
22-24, 2019. ACM, 2019, doi:10.1145/3323165.
short: C. Scheideler, P. Berenbrink, eds., The 31st ACM Symposium on Parallelism
in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019,
ACM, 2019.
date_created: 2019-11-06T10:43:41Z
date_updated: 2022-01-06T06:52:07Z
department:
- _id: '79'
doi: 10.1145/3323165
editor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Petra
full_name: Berenbrink, Petra
last_name: Berenbrink
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication_identifier:
isbn:
- 978-1-4503-6184-2
publisher: ACM
status: public
title: The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA
2019, Phoenix, AZ, USA, June 22-24, 2019
type: conference_editor
user_id: '477'
year: '2019'
...
---
_id: '14830'
author:
- first_name: Robert
full_name: Gmyr, Robert
last_name: Gmyr
- first_name: Jonas
full_name: Lefevre, Jonas
last_name: Lefevre
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Gmyr R, Lefevre J, Scheideler C. Self-Stabilizing Metric Graphs. Theory
Comput Syst. 2019;63(2):177-199. doi:10.1007/s00224-017-9823-4
apa: Gmyr, R., Lefevre, J., & Scheideler, C. (2019). Self-Stabilizing Metric
Graphs. Theory Comput. Syst., 63(2), 177–199. https://doi.org/10.1007/s00224-017-9823-4
bibtex: '@article{Gmyr_Lefevre_Scheideler_2019, title={Self-Stabilizing Metric Graphs},
volume={63}, DOI={10.1007/s00224-017-9823-4},
number={2}, journal={Theory Comput. Syst.}, author={Gmyr, Robert and Lefevre,
Jonas and Scheideler, Christian}, year={2019}, pages={177–199} }'
chicago: 'Gmyr, Robert, Jonas Lefevre, and Christian Scheideler. “Self-Stabilizing
Metric Graphs.” Theory Comput. Syst. 63, no. 2 (2019): 177–99. https://doi.org/10.1007/s00224-017-9823-4.'
ieee: R. Gmyr, J. Lefevre, and C. Scheideler, “Self-Stabilizing Metric Graphs,”
Theory Comput. Syst., vol. 63, no. 2, pp. 177–199, 2019.
mla: Gmyr, Robert, et al. “Self-Stabilizing Metric Graphs.” Theory Comput. Syst.,
vol. 63, no. 2, 2019, pp. 177–99, doi:10.1007/s00224-017-9823-4.
short: R. Gmyr, J. Lefevre, C. Scheideler, Theory Comput. Syst. 63 (2019) 177–199.
date_created: 2019-11-06T10:54:58Z
date_updated: 2022-01-06T06:52:07Z
department:
- _id: '79'
doi: 10.1007/s00224-017-9823-4
intvolume: ' 63'
issue: '2'
language:
- iso: eng
page: 177-199
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication: Theory Comput. Syst.
status: public
title: Self-Stabilizing Metric Graphs
type: journal_article
user_id: '15504'
volume: 63
year: '2019'
...
---
_id: '14539'
author:
- first_name: Jannik
full_name: Castenow, Jannik
id: '38705'
last_name: Castenow
- first_name: Christina
full_name: Kolb, Christina
id: '43647'
last_name: Kolb
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Castenow J, Kolb C, Scheideler C. A Bounding Box Overlay for Competitive Routing
in Hybrid Communication Networks. In: Proceedings of the 26th International
Colloquium on Structural Information and Communication Complexity (SIROCCO).
; 2019:345-348. doi:10.1007/978-3-030-24922-9\_26'
apa: Castenow, J., Kolb, C., & Scheideler, C. (2019). A Bounding Box Overlay
for Competitive Routing in Hybrid Communication Networks. In Proceedings of
the 26th International Colloquium on Structural Information and Communication
Complexity (SIROCCO) (pp. 345–348). L’Aquila, Italy. https://doi.org/10.1007/978-3-030-24922-9\_26
bibtex: '@inproceedings{Castenow_Kolb_Scheideler_2019, title={A Bounding Box Overlay
for Competitive Routing in Hybrid Communication Networks}, DOI={10.1007/978-3-030-24922-9\_26},
booktitle={Proceedings of the 26th International Colloquium on Structural Information
and Communication Complexity (SIROCCO)}, author={Castenow, Jannik and Kolb, Christina
and Scheideler, Christian}, year={2019}, pages={345–348} }'
chicago: Castenow, Jannik, Christina Kolb, and Christian Scheideler. “A Bounding
Box Overlay for Competitive Routing in Hybrid Communication Networks.” In Proceedings
of the 26th International Colloquium on Structural Information and Communication
Complexity (SIROCCO), 345–48, 2019. https://doi.org/10.1007/978-3-030-24922-9\_26.
ieee: J. Castenow, C. Kolb, and C. Scheideler, “A Bounding Box Overlay for Competitive
Routing in Hybrid Communication Networks,” in Proceedings of the 26th International
Colloquium on Structural Information and Communication Complexity (SIROCCO),
L’Aquila, Italy, 2019, pp. 345–348.
mla: Castenow, Jannik, et al. “A Bounding Box Overlay for Competitive Routing in
Hybrid Communication Networks.” Proceedings of the 26th International Colloquium
on Structural Information and Communication Complexity (SIROCCO), 2019, pp.
345–48, doi:10.1007/978-3-030-24922-9\_26.
short: 'J. Castenow, C. Kolb, C. Scheideler, in: Proceedings of the 26th International
Colloquium on Structural Information and Communication Complexity (SIROCCO), 2019,
pp. 345–348.'
conference:
end_date: 2019-07-04
location: L'Aquila, Italy
name: SIROCCO 2019
start_date: 2019-07-01
date_created: 2019-11-04T10:09:35Z
date_updated: 2022-01-06T06:52:00Z
department:
- _id: '79'
- _id: '63'
doi: 10.1007/978-3-030-24922-9\_26
language:
- iso: eng
page: 345-348
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 26th International Colloquium on Structural Information
and Communication Complexity (SIROCCO)
status: public
title: A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks
type: conference
user_id: '477'
year: '2019'
...
---
_id: '13182'
abstract:
- lang: eng
text: "We consider congestion control in peer-to-peer distributed systems. \r\nThe
problem can be reduced to the following scenario: Consider a set $V$ of $n$ peers
(called \\emph{clients} in this paper) that want to send messages to a fixed common
peer (called \\emph{server} in this paper).\r\nWe assume that each client $v \\in
V$ sends a message with probability $p(v) \\in [0,1)$ and the server has a capacity
of $\\sigma \\in \\mathbb{N}$, i.e., it can recieve at most $\\sigma$ messages
per round and excess messages are dropped.\r\nThe server can modify these probabilities
when clients send messages.\r\nIdeally, we wish to converge to a state with $\\sum
p(v) = \\sigma$ and $p(v) = p(w)$ for all $v,w \\in V$.\t\r\n\r\nWe propose a
\\emph{loosely} self-stabilizing protocol with a slightly relaxed legitimate state.
\ \r\nOur protocol lets the system converge from \\emph{any} initial state to
a state where $\\sum p(v) \\in \\left[\\sigma \\pm \\epsilon\\right]$ and $|p(v)-p(w)|
\\in O(\\frac{1}{n})$. \r\nThis property is then maintained for $\\Omega(n^{\\mathfrak{c}})$
rounds in expectation.\r\nIn particular, the initial client probabilities and
server variables are not necessarily well-defined, i.e., they may have arbitrary
values.\r\n\r\nOur protocol uses only $O(W + \\log n)$ bits of memory where $W$
is length of node identifiers, making it very lightweight.\r\nFinally we state
a lower bound on the convergence time an see that our protocol performs asymptotically
optimal (up to some polylogarithmic factor).\r\n"
author:
- first_name: Michael
full_name: Feldmann, Michael
id: '23538'
last_name: Feldmann
- first_name: Thorsten
full_name: Götte, Thorsten
id: '34727'
last_name: Götte
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Feldmann M, Götte T, Scheideler C. A Loosely Self-stabilizing Protocol for
Randomized Congestion Control with Logarithmic Memory. In: Proceedings of the
21st International Symposium on Stabilization, Safety, and Security of Distributed
Systems (SSS). Lecture Notes in Computer Science. Springer, Cham; 2019:149-164.
doi:https://doi.org/10.1007/978-3-030-34992-9_13'
apa: Feldmann, M., Götte, T., & Scheideler, C. (2019). A Loosely Self-stabilizing
Protocol for Randomized Congestion Control with Logarithmic Memory. In Proceedings
of the 21st International Symposium on Stabilization, Safety, and Security of
Distributed Systems (SSS) (pp. 149–164). Springer, Cham. https://doi.org/10.1007/978-3-030-34992-9_13
bibtex: '@inproceedings{Feldmann_Götte_Scheideler_2019, series={Lecture Notes in
Computer Science}, title={A Loosely Self-stabilizing Protocol for Randomized Congestion
Control with Logarithmic Memory}, DOI={https://doi.org/10.1007/978-3-030-34992-9_13},
booktitle={Proceedings of the 21st International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)}, publisher={Springer, Cham}, author={Feldmann,
Michael and Götte, Thorsten and Scheideler, Christian}, year={2019}, pages={149–164},
collection={Lecture Notes in Computer Science} }'
chicago: Feldmann, Michael, Thorsten Götte, and Christian Scheideler. “A Loosely
Self-Stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory.”
In Proceedings of the 21st International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS), 149–64. Lecture Notes in Computer
Science. Springer, Cham, 2019. https://doi.org/10.1007/978-3-030-34992-9_13.
ieee: M. Feldmann, T. Götte, and C. Scheideler, “A Loosely Self-stabilizing Protocol
for Randomized Congestion Control with Logarithmic Memory,” in Proceedings
of the 21st International Symposium on Stabilization, Safety, and Security of
Distributed Systems (SSS), 2019, pp. 149–164.
mla: Feldmann, Michael, et al. “A Loosely Self-Stabilizing Protocol for Randomized
Congestion Control with Logarithmic Memory.” Proceedings of the 21st International
Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS),
Springer, Cham, 2019, pp. 149–64, doi:https://doi.org/10.1007/978-3-030-34992-9_13.
short: 'M. Feldmann, T. Götte, C. Scheideler, in: Proceedings of the 21st International
Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS),
Springer, Cham, 2019, pp. 149–164.'
date_created: 2019-09-10T12:48:33Z
date_updated: 2022-01-06T06:51:30Z
ddc:
- '000'
department:
- _id: '79'
doi: https://doi.org/10.1007/978-3-030-34992-9_13
external_id:
arxiv:
- '1909.04544'
file:
- access_level: closed
content_type: application/pdf
creator: mfeldma2
date_created: 2019-09-11T11:20:16Z
date_updated: 2019-09-11T11:20:16Z
file_id: '13188'
file_name: main.pdf
file_size: 428908
relation: main_file
success: 1
file_date_updated: 2019-09-11T11:20:16Z
has_accepted_license: '1'
language:
- iso: eng
page: 149-164
project:
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '1'
name: SFB 901
publication: Proceedings of the 21st International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)
publisher: Springer, Cham
series_title: Lecture Notes in Computer Science
status: public
title: A Loosely Self-stabilizing Protocol for Randomized Congestion Control with
Logarithmic Memory
type: conference
user_id: '23538'
year: '2019'
...
---
_id: '10271'
author:
- first_name: N.
full_name: N., N.
last_name: N.
citation:
ama: N. N. Implementation and Evaluation of Authenticated Data Structures Using
Intel SGX Enclaves. Universität Paderborn; 2019.
apa: N., N. (2019). Implementation and Evaluation of Authenticated Data Structures
Using Intel SGX Enclaves. Universität Paderborn.
bibtex: '@book{N._2019, title={Implementation and Evaluation of Authenticated Data
Structures Using Intel SGX Enclaves}, publisher={Universität Paderborn}, author={N.,
N.}, year={2019} }'
chicago: N., N. Implementation and Evaluation of Authenticated Data Structures
Using Intel SGX Enclaves. Universität Paderborn, 2019.
ieee: N. N., Implementation and Evaluation of Authenticated Data Structures Using
Intel SGX Enclaves. Universität Paderborn, 2019.
mla: N., N. Implementation and Evaluation of Authenticated Data Structures Using
Intel SGX Enclaves. Universität Paderborn, 2019.
short: N. N., Implementation and Evaluation of Authenticated Data Structures Using
Intel SGX Enclaves, Universität Paderborn, 2019.
date_created: 2019-06-19T11:31:38Z
date_updated: 2022-01-06T06:50:33Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Implementation and Evaluation of Authenticated Data Structures Using Intel
SGX Enclaves
type: mastersthesis
user_id: '477'
year: '2019'
...
---
_id: '13652'
author:
- first_name: Kristian
full_name: Hinnenthal, Kristian
id: '32229'
last_name: Hinnenthal
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Martijn
full_name: Struijs, Martijn
last_name: Struijs
citation:
ama: 'Hinnenthal K, Scheideler C, Struijs M. Fast Distributed Algorithms for LP-Type
Problems of Low Dimension. In: 33rd International Symposium on Distributed
Computing (DISC 2019). ; 2019. doi:10.4230/LIPICS.DISC.2019.23'
apa: Hinnenthal, K., Scheideler, C., & Struijs, M. (2019). Fast Distributed
Algorithms for LP-Type Problems of Low Dimension. In 33rd International Symposium
on Distributed Computing (DISC 2019). https://doi.org/10.4230/LIPICS.DISC.2019.23
bibtex: '@inproceedings{Hinnenthal_Scheideler_Struijs_2019, title={Fast Distributed
Algorithms for LP-Type Problems of Low Dimension}, DOI={10.4230/LIPICS.DISC.2019.23},
booktitle={33rd International Symposium on Distributed Computing (DISC 2019)},
author={Hinnenthal, Kristian and Scheideler, Christian and Struijs, Martijn},
year={2019} }'
chicago: Hinnenthal, Kristian, Christian Scheideler, and Martijn Struijs. “Fast
Distributed Algorithms for LP-Type Problems of Low Dimension.” In 33rd International
Symposium on Distributed Computing (DISC 2019), 2019. https://doi.org/10.4230/LIPICS.DISC.2019.23.
ieee: K. Hinnenthal, C. Scheideler, and M. Struijs, “Fast Distributed Algorithms
for LP-Type Problems of Low Dimension,” in 33rd International Symposium on
Distributed Computing (DISC 2019), 2019.
mla: Hinnenthal, Kristian, et al. “Fast Distributed Algorithms for LP-Type Problems
of Low Dimension.” 33rd International Symposium on Distributed Computing (DISC
2019), 2019, doi:10.4230/LIPICS.DISC.2019.23.
short: 'K. Hinnenthal, C. Scheideler, M. Struijs, in: 33rd International Symposium
on Distributed Computing (DISC 2019), 2019.'
date_created: 2019-10-08T11:53:38Z
date_updated: 2022-01-06T06:51:41Z
department:
- _id: '79'
doi: 10.4230/LIPICS.DISC.2019.23
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: 33rd International Symposium on Distributed Computing (DISC 2019)
status: public
title: Fast Distributed Algorithms for LP-Type Problems of Low Dimension
type: conference
user_id: '32229'
year: '2019'
...
---
_id: '3422'
abstract:
- lang: eng
text: "We study the consensus problem in a synchronous distributed system of n nodes
under an adaptive adversary that has a slightly outdated view of the system and
can block all incoming and outgoing communication of a constant fraction of the
nodes in each round. Motivated by a result of Ben-Or and Bar-Joseph (1998), showing
that any consensus algorithm that is resilient against a linear number of crash
faults requires $\\tilde \\Omega(\\sqrt n)$ rounds in an n-node network against
an adaptive adversary, we consider a late adaptive adversary, who has full knowledge
of the network state at the beginning of the previous round and unlimited computational
power, but is oblivious to the current state of the nodes. \r\n\r\nOur main contributions
are randomized distributed algorithms that achieve consensus with high probability
among all except a small constant fraction of the nodes (i.e., \"almost-everywhere'')
against a late adaptive adversary who can block up to ε n$ nodes in each round,
for a small constant ε >0$. Our first protocol achieves binary almost-everywhere
consensus and also guarantees a decision on the majority input value, thus ensuring
plurality consensus. We also present an algorithm that achieves the same time
complexity for multi-value consensus. Both of our algorithms succeed in $O(log
n)$ rounds with high probability, thus showing an exponential gap to the $\\tilde\\Omega(\\sqrt
n)$ lower bound of Ben-Or and Bar-Joseph for strongly adaptive crash-failure adversaries,
which can be strengthened to $\\Omega(n)$ when allowing the adversary to block
nodes instead of permanently crashing them. Our algorithms are scalable to large
systems as each node contacts only an (amortized) constant number of peers in
each communication round. We show that our algorithms are optimal up to constant
(resp.\\ sub-logarithmic) factors by proving that every almost-everywhere consensus
protocol takes $\\Omega(log_d n)$ rounds in the worst case, where d is an upper
bound on the number of communication requests initiated per node in each round.
We complement our theoretical results with an experimental evaluation of the binary
almost-everywhere consensus protocol revealing a short convergence time even against
an adversary blocking a large fraction of nodes."
author:
- first_name: Peter
full_name: Robinson, Peter
last_name: Robinson
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Alexander
full_name: Setzer, Alexander
id: '11108'
last_name: Setzer
citation:
ama: 'Robinson P, Scheideler C, Setzer A. Breaking the $\tilde\Omega(\sqrt{n})$
Barrier: Fast Consensus under a Late Adversary. In: Proceedings of the 30th
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). doi:10.1145/3210377.3210399'
apa: 'Robinson, P., Scheideler, C., & Setzer, A. (n.d.). Breaking the $\tilde\Omega(\sqrt{n})$
Barrier: Fast Consensus under a Late Adversary. In Proceedings of the 30th
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). Wien.
https://doi.org/10.1145/3210377.3210399'
bibtex: '@inproceedings{Robinson_Scheideler_Setzer, title={Breaking the $\tilde\Omega(\sqrt{n})$
Barrier: Fast Consensus under a Late Adversary}, DOI={10.1145/3210377.3210399},
booktitle={Proceedings of the 30th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA)}, author={Robinson, Peter and Scheideler, Christian and
Setzer, Alexander} }'
chicago: 'Robinson, Peter, Christian Scheideler, and Alexander Setzer. “Breaking
the $\tilde\Omega(\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary.”
In Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures
(SPAA), n.d. https://doi.org/10.1145/3210377.3210399.'
ieee: 'P. Robinson, C. Scheideler, and A. Setzer, “Breaking the $\tilde\Omega(\sqrt{n})$
Barrier: Fast Consensus under a Late Adversary,” in Proceedings of the 30th
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), Wien.'
mla: 'Robinson, Peter, et al. “Breaking the $\tilde\Omega(\sqrt{n})$ Barrier: Fast
Consensus under a Late Adversary.” Proceedings of the 30th ACM Symposium on
Parallelism in Algorithms and Architectures (SPAA), doi:10.1145/3210377.3210399.'
short: 'P. Robinson, C. Scheideler, A. Setzer, in: Proceedings of the 30th ACM Symposium
on Parallelism in Algorithms and Architectures (SPAA), n.d.'
conference:
end_date: 2018-07-18
location: Wien
name: 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
start_date: 2018-07-16
date_created: 2018-07-04T08:55:45Z
date_updated: 2022-01-06T06:59:16Z
ddc:
- '040'
department:
- _id: '79'
- _id: '34'
- _id: '7'
doi: 10.1145/3210377.3210399
file:
- access_level: closed
content_type: application/pdf
creator: asetzer
date_created: 2018-10-31T13:30:40Z
date_updated: 2018-10-31T13:30:40Z
file_id: '5215'
file_name: p173-robinson.pdf
file_size: 1675407
relation: main_file
success: 1
file_date_updated: 2018-10-31T13:30:40Z
has_accepted_license: '1'
keyword:
- distributed consensus
- randomized algorithm
- adaptive adversary
- complexity lower bound
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication: Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA)
publication_identifier:
isbn:
- 978-1-4503-5799-9/18/07
publication_status: accepted
status: public
title: 'Breaking the $\tilde\Omega(\sqrt{n})$ Barrier: Fast Consensus under a Late
Adversary'
type: conference
user_id: '11108'
year: '2018'
...
---
_id: '3874'
citation:
ama: Scheideler C, Fineman JT, eds. Proceedings of the 30th on Symposium on Parallelism
in Algorithms and Architectures. ACM; 2018.
apa: 'Scheideler, C., & Fineman, J. T. (Eds.). (2018). Proceedings of the
30th on Symposium on Parallelism in Algorithms and Architectures. Vienna,
Austria: ACM.'
bibtex: '@book{Scheideler_Fineman_2018, title={Proceedings of the 30th on Symposium
on Parallelism in Algorithms and Architectures}, publisher={ACM}, year={2018}
}'
chicago: Scheideler, Christian, and Jeremy T. Fineman, eds. Proceedings of the
30th on Symposium on Parallelism in Algorithms and Architectures. ACM, 2018.
ieee: C. Scheideler and J. T. Fineman, Eds., Proceedings of the 30th on Symposium
on Parallelism in Algorithms and Architectures. ACM, 2018.
mla: Scheideler, Christian, and Jeremy T. Fineman, editors. Proceedings of the
30th on Symposium on Parallelism in Algorithms and Architectures. ACM, 2018.
short: C. Scheideler, J.T. Fineman, eds., Proceedings of the 30th on Symposium on
Parallelism in Algorithms and Architectures, ACM, 2018.
conference:
location: Vienna, Austria
date_created: 2018-08-10T10:03:47Z
date_updated: 2022-01-06T06:59:47Z
department:
- _id: '79'
editor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Jeremy T.
full_name: Fineman, Jeremy T.
last_name: Fineman
publication_identifier:
isbn:
- 978-1-4503-5799-9
publisher: ACM
status: public
title: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures
type: conference_editor
user_id: '15504'
year: '2018'
...
---
_id: '1138'
author:
- first_name: Robert
full_name: Gmyr, Robert
last_name: Gmyr
citation:
ama: Gmyr R. Distributed Algorithms for Overlay Networks and Programmable Matter.
Universität Paderborn; 2018. doi:10.17619/UNIPB/1-265
apa: Gmyr, R. (2018). Distributed Algorithms for Overlay Networks and Programmable
Matter. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-265
bibtex: '@book{Gmyr_2018, title={Distributed Algorithms for Overlay Networks and
Programmable Matter}, DOI={10.17619/UNIPB/1-265},
publisher={Universität Paderborn}, author={Gmyr, Robert}, year={2018} }'
chicago: Gmyr, Robert. Distributed Algorithms for Overlay Networks and Programmable
Matter. Universität Paderborn, 2018. https://doi.org/10.17619/UNIPB/1-265.
ieee: R. Gmyr, Distributed Algorithms for Overlay Networks and Programmable Matter.
Universität Paderborn, 2018.
mla: Gmyr, Robert. Distributed Algorithms for Overlay Networks and Programmable
Matter. Universität Paderborn, 2018, doi:10.17619/UNIPB/1-265.
short: R. Gmyr, Distributed Algorithms for Overlay Networks and Programmable Matter,
Universität Paderborn, 2018.
date_created: 2018-01-31T06:04:03Z
date_updated: 2022-01-06T06:51:00Z
department:
- _id: '79'
doi: 10.17619/UNIPB/1-265
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subproject C1
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
- _id: '5'
name: SFB 901 - Subproject A1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Distributed Algorithms for Overlay Networks and Programmable Matter
type: dissertation
user_id: '477'
year: '2018'
...
---
_id: '1163'
abstract:
- lang: eng
text: "In this paper we present two major results:\r\nFirst, we introduce the first
self-stabilizing version of a supervised overlay network (as introduced in~\\cite{DBLP:conf/ispan/KothapalliS05})
by presenting a self-stabilizing supervised skip ring.\r\nSecondly, we show how
to use the self-stabilizing supervised skip ring to construct an efficient self-stabilizing
publish-subscribe system.\r\nThat is, in addition to stabilizing the overlay network,
every subscriber of a topic will eventually know all of the publications that
have been issued so far for that topic. The communication work needed to processes
a subscribe or unsubscribe operation is just a constant in a legitimate state,
and the communication work of checking whether the system is still in a legitimate
state is just a constant on expectation for the supervisor as well as any process
in the system.\r\n"
author:
- first_name: Michael
full_name: Feldmann, Michael
id: '23538'
last_name: Feldmann
- first_name: Christina
full_name: Kolb, Christina
id: '43647'
last_name: Kolb
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
citation:
ama: 'Feldmann M, Kolb C, Scheideler C, Strothmann TF. Self-Stabilizing Supervised
Publish-Subscribe Systems. In: Proceedings of the 32nd IEEE International Parallel
& Distributed Processing Symposium (IPDPS). IEEE; 2018. doi:10.1109/IPDPS.2018.00114'
apa: 'Feldmann, M., Kolb, C., Scheideler, C., & Strothmann, T. F. (2018). Self-Stabilizing
Supervised Publish-Subscribe Systems. In Proceedings of the 32nd IEEE International
Parallel & Distributed Processing Symposium (IPDPS). Vancouver: IEEE.
https://doi.org/10.1109/IPDPS.2018.00114'
bibtex: '@inproceedings{Feldmann_Kolb_Scheideler_Strothmann_2018, title={Self-Stabilizing
Supervised Publish-Subscribe Systems}, DOI={10.1109/IPDPS.2018.00114},
booktitle={Proceedings of the 32nd IEEE International Parallel & Distributed
Processing Symposium (IPDPS)}, publisher={IEEE}, author={Feldmann, Michael and
Kolb, Christina and Scheideler, Christian and Strothmann, Thim Frederik}, year={2018}
}'
chicago: Feldmann, Michael, Christina Kolb, Christian Scheideler, and Thim Frederik
Strothmann. “Self-Stabilizing Supervised Publish-Subscribe Systems.” In Proceedings
of the 32nd IEEE International Parallel & Distributed Processing Symposium
(IPDPS). IEEE, 2018. https://doi.org/10.1109/IPDPS.2018.00114.
ieee: M. Feldmann, C. Kolb, C. Scheideler, and T. F. Strothmann, “Self-Stabilizing
Supervised Publish-Subscribe Systems,” in Proceedings of the 32nd IEEE International
Parallel & Distributed Processing Symposium (IPDPS), Vancouver, 2018.
mla: Feldmann, Michael, et al. “Self-Stabilizing Supervised Publish-Subscribe Systems.”
Proceedings of the 32nd IEEE International Parallel & Distributed Processing
Symposium (IPDPS), IEEE, 2018, doi:10.1109/IPDPS.2018.00114.
short: 'M. Feldmann, C. Kolb, C. Scheideler, T.F. Strothmann, in: Proceedings of
the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS),
IEEE, 2018.'
conference:
end_date: 2018-5-24
location: Vancouver
name: 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)
start_date: 2018-5-22
date_created: 2018-02-01T13:56:01Z
date_updated: 2022-01-06T06:51:05Z
ddc:
- '040'
department:
- _id: '79'
- _id: '66'
doi: 10.1109/IPDPS.2018.00114
external_id:
arxiv:
- '1710.08128'
file:
- access_level: closed
content_type: application/pdf
creator: mfeldma2
date_created: 2018-10-31T13:25:37Z
date_updated: 2018-10-31T13:25:37Z
file_id: '5211'
file_name: 08425258.pdf
file_size: 239559
relation: main_file
success: 1
file_date_updated: 2018-10-31T13:25:37Z
has_accepted_license: '1'
keyword:
- Topological Self-stabilization
- Supervised Overlay
- Publish-Subscribe System
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Proceedings of the 32nd IEEE International Parallel & Distributed Processing
Symposium (IPDPS)
publisher: IEEE
status: public
title: Self-Stabilizing Supervised Publish-Subscribe Systems
type: conference
user_id: '11319'
year: '2018'
...
---
_id: '1164'
abstract:
- lang: eng
text: "We propose a distributed protocol for a queue, called Skueue, which spreads
its data fairly onto multiple processes, avoiding bottlenecks in high throughput
scenarios.\r\nSkueuecan be used in highly dynamic environments, through the addition
of join and leave requests to the standard queue operations enqueue and dequeue.\r\nFurthermore
Skueue satisfies sequential consistency in the asynchronous message passing model.\r\nScalability
is achieved by aggregating multiple requests to a batch, which can then be processed
in a distributed fashion without hurting the queue semantics.\r\nOperations in
Skueue need a logarithmic number of rounds w.h.p. until they are processed, even
under a high rate of incoming requests."
author:
- first_name: Michael
full_name: Feldmann, Michael
id: '23538'
last_name: Feldmann
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Alexander
full_name: Setzer, Alexander
id: '11108'
last_name: Setzer
citation:
ama: 'Feldmann M, Scheideler C, Setzer A. Skueue: A Scalable and Sequentially Consistent
Distributed Queue. In: Proceedings of the 32nd IEEE International Parallel
& Distributed Processing Symposium (IPDPS). IEEE; 2018. doi:10.1109/IPDPS.2018.00113'
apa: 'Feldmann, M., Scheideler, C., & Setzer, A. (2018). Skueue: A Scalable
and Sequentially Consistent Distributed Queue. In Proceedings of the 32nd IEEE
International Parallel & Distributed Processing Symposium (IPDPS). Vancouver:
IEEE. https://doi.org/10.1109/IPDPS.2018.00113'
bibtex: '@inproceedings{Feldmann_Scheideler_Setzer_2018, title={Skueue: A Scalable
and Sequentially Consistent Distributed Queue}, DOI={10.1109/IPDPS.2018.00113},
booktitle={Proceedings of the 32nd IEEE International Parallel & Distributed
Processing Symposium (IPDPS)}, publisher={IEEE}, author={Feldmann, Michael and
Scheideler, Christian and Setzer, Alexander}, year={2018} }'
chicago: 'Feldmann, Michael, Christian Scheideler, and Alexander Setzer. “Skueue:
A Scalable and Sequentially Consistent Distributed Queue.” In Proceedings of
the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS).
IEEE, 2018. https://doi.org/10.1109/IPDPS.2018.00113.'
ieee: 'M. Feldmann, C. Scheideler, and A. Setzer, “Skueue: A Scalable and Sequentially
Consistent Distributed Queue,” in Proceedings of the 32nd IEEE International
Parallel & Distributed Processing Symposium (IPDPS), Vancouver, 2018.'
mla: 'Feldmann, Michael, et al. “Skueue: A Scalable and Sequentially Consistent
Distributed Queue.” Proceedings of the 32nd IEEE International Parallel &
Distributed Processing Symposium (IPDPS), IEEE, 2018, doi:10.1109/IPDPS.2018.00113.'
short: 'M. Feldmann, C. Scheideler, A. Setzer, in: Proceedings of the 32nd IEEE
International Parallel & Distributed Processing Symposium (IPDPS), IEEE, 2018.'
conference:
end_date: 2018-5-24
location: Vancouver
name: 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)
start_date: 2018-5-22
date_created: 2018-02-01T14:00:36Z
date_updated: 2022-01-06T06:51:05Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1109/IPDPS.2018.00113
external_id:
arxiv:
- '1802.07504'
file:
- access_level: closed
content_type: application/pdf
creator: mfeldma2
date_created: 2018-10-31T13:29:26Z
date_updated: 2018-10-31T13:29:26Z
file_id: '5212'
file_name: 08425257.pdf
file_size: 218420
relation: main_file
success: 1
file_date_updated: 2018-10-31T13:29:26Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Proceedings of the 32nd IEEE International Parallel & Distributed Processing
Symposium (IPDPS)
publisher: IEEE
status: public
title: 'Skueue: A Scalable and Sequentially Consistent Distributed Queue'
type: conference
user_id: '23538'
year: '2018'
...
---
_id: '1796'
author:
- first_name: Joshua
full_name: J. Daymude, Joshua
last_name: J. Daymude
- first_name: Zahra
full_name: Derakhshandeh, Zahra
last_name: Derakhshandeh
- first_name: Robert
full_name: Gmyr, Robert
last_name: Gmyr
- first_name: Alexandra
full_name: Porter, Alexandra
last_name: Porter
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
citation:
ama: J. Daymude J, Derakhshandeh Z, Gmyr R, et al. On the runtime of universal coating
for programmable matter. Natural Computing. 2018;(1):81--96. doi:10.1007/s11047-017-9658-6
apa: J. Daymude, J., Derakhshandeh, Z., Gmyr, R., Porter, A., W. Richa, A., Scheideler,
C., & Strothmann, T. F. (2018). On the runtime of universal coating for programmable
matter. Natural Computing, (1), 81--96. https://doi.org/10.1007/s11047-017-9658-6
bibtex: '@article{J. Daymude_Derakhshandeh_Gmyr_Porter_W. Richa_Scheideler_Strothmann_2018,
title={On the runtime of universal coating for programmable matter}, DOI={10.1007/s11047-017-9658-6},
number={1}, journal={Natural Computing}, author={J. Daymude, Joshua and Derakhshandeh,
Zahra and Gmyr, Robert and Porter, Alexandra and W. Richa, Andrea and Scheideler,
Christian and Strothmann, Thim Frederik}, year={2018}, pages={81--96} }'
chicago: 'J. Daymude, Joshua, Zahra Derakhshandeh, Robert Gmyr, Alexandra Porter,
Andrea W. Richa, Christian Scheideler, and Thim Frederik Strothmann. “On the Runtime
of Universal Coating for Programmable Matter.” Natural Computing, no. 1
(2018): 81--96. https://doi.org/10.1007/s11047-017-9658-6.'
ieee: J. J. Daymude et al., “On the runtime of universal coating for programmable
matter,” Natural Computing, no. 1, pp. 81--96, 2018.
mla: J. Daymude, Joshua, et al. “On the Runtime of Universal Coating for Programmable
Matter.” Natural Computing, no. 1, 2018, pp. 81--96, doi:10.1007/s11047-017-9658-6.
short: J. J. Daymude, Z. Derakhshandeh, R. Gmyr, A. Porter, A. W. Richa, C. Scheideler,
T.F. Strothmann, Natural Computing (2018) 81--96.
date_created: 2018-03-27T06:23:58Z
date_updated: 2022-01-06T06:53:24Z
department:
- _id: '79'
- _id: '66'
doi: 10.1007/s11047-017-9658-6
issue: '1'
language:
- iso: eng
page: 81--96
publication: Natural Computing
status: public
title: On the runtime of universal coating for programmable matter
type: journal_article
user_id: '11319'
year: '2018'
...
---
_id: '18030'
author:
- first_name: N.
full_name: N., N.
last_name: N.
citation:
ama: N. N. Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List
Und Build-Multilist Mit Systemverlassenden Knoten. Universität Paderborn;
2018.
apa: N., N. (2018). Monotone Suchbarkeit bei den selbststabilisierenden Protokollen
Build-List und Build-Multilist mit systemverlassenden Knoten. Universität
Paderborn.
bibtex: '@book{N._2018, title={Monotone Suchbarkeit bei den selbststabilisierenden
Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten}, publisher={Universität
Paderborn}, author={N., N.}, year={2018} }'
chicago: N., N. Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen
Build-List Und Build-Multilist Mit Systemverlassenden Knoten. Universität
Paderborn, 2018.
ieee: N. N., Monotone Suchbarkeit bei den selbststabilisierenden Protokollen
Build-List und Build-Multilist mit systemverlassenden Knoten. Universität
Paderborn, 2018.
mla: N., N. Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List
Und Build-Multilist Mit Systemverlassenden Knoten. Universität Paderborn,
2018.
short: N. N., Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List
Und Build-Multilist Mit Systemverlassenden Knoten, Universität Paderborn, 2018.
date_created: 2020-08-18T08:44:22Z
date_updated: 2022-01-06T06:53:25Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List
und Build-Multilist mit systemverlassenden Knoten
type: bachelorsthesis
user_id: '477'
year: '2018'
...
---
_id: '18031'
author:
- first_name: N.
full_name: N., N.
last_name: N.
citation:
ama: N. N. Gathering Strategien Für Mobile Roboterschwärme Im Gitternetz.;
2018.
apa: N., N. (2018). Gathering Strategien für mobile Roboterschwärme im Gitternetz.
bibtex: '@book{N._2018, title={Gathering Strategien für mobile Roboterschwärme im
Gitternetz}, author={N., N.}, year={2018} }'
chicago: N., N. Gathering Strategien Für Mobile Roboterschwärme Im Gitternetz,
2018.
ieee: N. N., Gathering Strategien für mobile Roboterschwärme im Gitternetz.
2018.
mla: N., N. Gathering Strategien Für Mobile Roboterschwärme Im Gitternetz.
2018.
short: N. N., Gathering Strategien Für Mobile Roboterschwärme Im Gitternetz, 2018.
date_created: 2020-08-18T08:45:09Z
date_updated: 2022-01-06T06:53:25Z
department:
- _id: '79'
language:
- iso: eng
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Gathering Strategien für mobile Roboterschwärme im Gitternetz
type: bachelorsthesis
user_id: '15504'
year: '2018'
...
---
_id: '18032'
author:
- first_name: N.
full_name: N., N.
last_name: N.
citation:
ama: N. N. Decontaminating Planar Regions with Finite Automaton Robots and Tiles.;
2018.
apa: N., N. (2018). Decontaminating Planar Regions with Finite Automaton Robots
and Tiles.
bibtex: '@book{N._2018, title={Decontaminating Planar Regions with Finite Automaton
Robots and Tiles}, author={N., N.}, year={2018} }'
chicago: N., N. Decontaminating Planar Regions with Finite Automaton Robots and
Tiles, 2018.
ieee: N. N., Decontaminating Planar Regions with Finite Automaton Robots and
Tiles. 2018.
mla: N., N. Decontaminating Planar Regions with Finite Automaton Robots and Tiles.
2018.
short: N. N., Decontaminating Planar Regions with Finite Automaton Robots and Tiles,
2018.
date_created: 2020-08-18T08:45:53Z
date_updated: 2022-01-06T06:53:25Z
department:
- _id: '79'
language:
- iso: eng
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Decontaminating Planar Regions with Finite Automaton Robots and Tiles
type: bachelorsthesis
user_id: '15504'
year: '2018'
...
---
_id: '18033'
author:
- first_name: Robin
full_name: Wulfes, Robin
last_name: Wulfes
citation:
ama: Wulfes R. Load-Balanced Routing in Hybriden Kommunikationsnetzwerken.
Universität Paderborn; 2018.
apa: Wulfes, R. (2018). Load-Balanced Routing in Hybriden Kommunikationsnetzwerken.
Universität Paderborn.
bibtex: '@book{Wulfes_2018, title={Load-Balanced Routing in Hybriden Kommunikationsnetzwerken},
publisher={Universität Paderborn}, author={Wulfes, Robin}, year={2018} }'
chicago: Wulfes, Robin. Load-Balanced Routing in Hybriden Kommunikationsnetzwerken.
Universität Paderborn, 2018.
ieee: R. Wulfes, Load-Balanced Routing in Hybriden Kommunikationsnetzwerken.
Universität Paderborn, 2018.
mla: Wulfes, Robin. Load-Balanced Routing in Hybriden Kommunikationsnetzwerken.
Universität Paderborn, 2018.
short: R. Wulfes, Load-Balanced Routing in Hybriden Kommunikationsnetzwerken, Universität
Paderborn, 2018.
date_created: 2020-08-18T08:46:50Z
date_updated: 2022-01-06T06:53:25Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Load-Balanced Routing in Hybriden Kommunikationsnetzwerken
type: bachelorsthesis
user_id: '477'
year: '2018'
...
---
_id: '5764'
author:
- first_name: Robert
full_name: Gmyr, Robert
last_name: Gmyr
- first_name: Kristian
full_name: Hinnenthal, Kristian
id: '32229'
last_name: Hinnenthal
- first_name: Irina
full_name: Kostitsyna, Irina
last_name: Kostitsyna
- first_name: Fabian
full_name: Kuhn, Fabian
last_name: Kuhn
- first_name: Dorian
full_name: Rudolph, Dorian
last_name: Rudolph
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
citation:
ama: 'Gmyr R, Hinnenthal K, Kostitsyna I, et al. Forming Tile Shapes with Simple
Robots. In: Proceedings of the 24th International Conference on DNA Computing
and Molecular Programming. Springer International Publishing; 2018:122-138.
doi:10.1007/978-3-030-00030-1_8'
apa: Gmyr, R., Hinnenthal, K., Kostitsyna, I., Kuhn, F., Rudolph, D., Scheideler,
C., & Strothmann, T. F. (2018). Forming Tile Shapes with Simple Robots. In
Proceedings of the 24th International Conference on DNA Computing and Molecular
Programming (pp. 122–138). Springer International Publishing. https://doi.org/10.1007/978-3-030-00030-1_8
bibtex: '@inproceedings{Gmyr_Hinnenthal_Kostitsyna_Kuhn_Rudolph_Scheideler_Strothmann_2018,
title={Forming Tile Shapes with Simple Robots}, DOI={10.1007/978-3-030-00030-1_8},
booktitle={Proceedings of the 24th International Conference on DNA Computing and
Molecular Programming}, publisher={Springer International Publishing}, author={Gmyr,
Robert and Hinnenthal, Kristian and Kostitsyna, Irina and Kuhn, Fabian and Rudolph,
Dorian and Scheideler, Christian and Strothmann, Thim Frederik}, year={2018},
pages={122–138} }'
chicago: Gmyr, Robert, Kristian Hinnenthal, Irina Kostitsyna, Fabian Kuhn, Dorian
Rudolph, Christian Scheideler, and Thim Frederik Strothmann. “Forming Tile Shapes
with Simple Robots.” In Proceedings of the 24th International Conference on
DNA Computing and Molecular Programming, 122–38. Springer International Publishing,
2018. https://doi.org/10.1007/978-3-030-00030-1_8.
ieee: R. Gmyr et al., “Forming Tile Shapes with Simple Robots,” in Proceedings
of the 24th International Conference on DNA Computing and Molecular Programming,
2018, pp. 122–138.
mla: Gmyr, Robert, et al. “Forming Tile Shapes with Simple Robots.” Proceedings
of the 24th International Conference on DNA Computing and Molecular Programming,
Springer International Publishing, 2018, pp. 122–38, doi:10.1007/978-3-030-00030-1_8.
short: 'R. Gmyr, K. Hinnenthal, I. Kostitsyna, F. Kuhn, D. Rudolph, C. Scheideler,
T.F. Strothmann, in: Proceedings of the 24th International Conference on DNA Computing
and Molecular Programming, Springer International Publishing, 2018, pp. 122–138.'
date_created: 2018-11-19T15:35:45Z
date_updated: 2022-01-06T07:02:38Z
department:
- _id: '79'
- _id: '66'
doi: 10.1007/978-3-030-00030-1_8
language:
- iso: eng
page: 122-138
publication: Proceedings of the 24th International Conference on DNA Computing and
Molecular Programming
publication_status: published
publisher: Springer International Publishing
status: public
title: Forming Tile Shapes with Simple Robots
type: conference
user_id: '11319'
year: '2018'
...
---
_id: '5820'
abstract:
- lang: eng
text: "In this paper, we investigate the use of trusted execution environments (TEEs,
such as Intel's SGX) for an anonymous communication infrastructure over untrusted
networks.\r\nFor this, we present the general idea of exploiting trusted execution
environments for the purpose of anonymous communication, including a continuous-time
security framework that models strong anonymity guarantees in the presence of
an adversary that observes all network traffic and can adaptively corrupt a constant
fraction of participating nodes.\r\nIn our framework, a participating node can
generate a number of unlinkable pseudonyms. Messages are sent from and to pseudonyms,
allowing both senders and receivers of messages to remain anonymous. We introduce
a concrete construction, which shows viability of our TEE-based approach to anonymous
communication. The construction draws from techniques from cryptography and overlay
networks. \r\nOur techniques are very general and can be used as a basis for future
constructions with similar goals."
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Jan
full_name: Bobolz, Jan
id: '27207'
last_name: Bobolz
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Alexander
full_name: Setzer, Alexander
id: '11108'
last_name: Setzer
citation:
ama: Blömer J, Bobolz J, Scheideler C, Setzer A. Provably Anonymous Communication
Based on Trusted Execution Environments.
apa: Blömer, J., Bobolz, J., Scheideler, C., & Setzer, A. (n.d.). Provably
Anonymous Communication Based on Trusted Execution Environments.
bibtex: '@book{Blömer_Bobolz_Scheideler_Setzer, title={Provably Anonymous Communication
Based on Trusted Execution Environments}, author={Blömer, Johannes and Bobolz,
Jan and Scheideler, Christian and Setzer, Alexander} }'
chicago: Blömer, Johannes, Jan Bobolz, Christian Scheideler, and Alexander Setzer.
Provably Anonymous Communication Based on Trusted Execution Environments,
n.d.
ieee: J. Blömer, J. Bobolz, C. Scheideler, and A. Setzer, Provably Anonymous
Communication Based on Trusted Execution Environments. .
mla: Blömer, Johannes, et al. Provably Anonymous Communication Based on Trusted
Execution Environments.
short: J. Blömer, J. Bobolz, C. Scheideler, A. Setzer, Provably Anonymous Communication
Based on Trusted Execution Environments, n.d.
date_created: 2018-11-25T08:08:40Z
date_updated: 2022-01-06T07:02:43Z
ddc:
- '000'
department:
- _id: '7'
- _id: '64'
- _id: '79'
file:
- access_level: closed
content_type: application/pdf
creator: jbobolz
date_created: 2018-12-31T09:55:30Z
date_updated: 2018-12-31T09:55:30Z
file_id: '6435'
file_name: draft-2018.pdf
file_size: 470968
relation: main_file
success: 1
file_date_updated: 2018-12-31T09:55:30Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication_status: draft
status: public
title: Provably Anonymous Communication Based on Trusted Execution Environments
type: working_paper
user_id: '27207'
year: '2018'
...
---
_id: '5984'
alternative_title:
- Special Issue of SIROCCO 2015
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Scheideler C. Preface. Theor Comput Sci. 2018;751:1. doi:10.1016/j.tcs.2018.11.004
apa: Scheideler, C. (2018). Preface. Theor. Comput. Sci., 751, 1.
https://doi.org/10.1016/j.tcs.2018.11.004
bibtex: '@article{Scheideler_2018, title={Preface}, volume={751}, DOI={10.1016/j.tcs.2018.11.004},
journal={Theor. Comput. Sci.}, author={Scheideler, Christian}, year={2018}, pages={1}
}'
chicago: 'Scheideler, Christian. “Preface.” Theor. Comput. Sci. 751 (2018):
1. https://doi.org/10.1016/j.tcs.2018.11.004.'
ieee: C. Scheideler, “Preface,” Theor. Comput. Sci., vol. 751, p. 1, 2018.
mla: Scheideler, Christian. “Preface.” Theor. Comput. Sci., vol. 751, 2018,
p. 1, doi:10.1016/j.tcs.2018.11.004.
short: C. Scheideler, Theor. Comput. Sci. 751 (2018) 1.
date_created: 2018-11-30T08:08:23Z
date_updated: 2022-01-06T07:02:49Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1016/j.tcs.2018.11.004
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2019-01-11T10:20:16Z
date_updated: 2019-01-11T10:20:16Z
file_id: '6620'
file_name: Preface.pdf
file_size: 112676
relation: main_file
success: 1
file_date_updated: 2019-01-11T10:20:16Z
has_accepted_license: '1'
intvolume: ' 751'
language:
- iso: eng
page: '1'
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Theor. Comput. Sci.
status: public
title: Preface
type: journal_article
user_id: '15504'
volume: 751
year: '2018'
...
---
_id: '5985'
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Scheideler C. Relays: Towards a Link Layer for Robust and Secure Fog Computing.
In: Proceedings of the 2018 Workshop on Theory and Practice for Integrated
Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom,
July 27, 2018. ; 2018:1-2. doi:10.1145/3229774.3229781'
apa: 'Scheideler, C. (2018). Relays: Towards a Link Layer for Robust and Secure
Fog Computing. In Proceedings of the 2018 Workshop on Theory and Practice for
Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United
Kingdom, July 27, 2018 (pp. 1–2). https://doi.org/10.1145/3229774.3229781'
bibtex: '@inproceedings{Scheideler_2018, title={Relays: Towards a Link Layer for
Robust and Secure Fog Computing}, DOI={10.1145/3229774.3229781},
booktitle={Proceedings of the 2018 Workshop on Theory and Practice for Integrated
Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom,
July 27, 2018}, author={Scheideler, Christian}, year={2018}, pages={1–2} }'
chicago: 'Scheideler, Christian. “Relays: Towards a Link Layer for Robust and Secure
Fog Computing.” In Proceedings of the 2018 Workshop on Theory and Practice
for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham,
United Kingdom, July 27, 2018, 1–2, 2018. https://doi.org/10.1145/3229774.3229781.'
ieee: 'C. Scheideler, “Relays: Towards a Link Layer for Robust and Secure Fog Computing,”
in Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud,
Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July
27, 2018, 2018, pp. 1–2.'
mla: 'Scheideler, Christian. “Relays: Towards a Link Layer for Robust and Secure
Fog Computing.” Proceedings of the 2018 Workshop on Theory and Practice for
Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United
Kingdom, July 27, 2018, 2018, pp. 1–2, doi:10.1145/3229774.3229781.'
short: 'C. Scheideler, in: Proceedings of the 2018 Workshop on Theory and Practice
for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham,
United Kingdom, July 27, 2018, 2018, pp. 1–2.'
date_created: 2018-11-30T08:11:27Z
date_updated: 2022-01-06T07:02:49Z
ddc:
- '004'
department:
- _id: '79'
doi: 10.1145/3229774.3229781
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-12-12T15:12:02Z
date_updated: 2018-12-12T15:12:02Z
file_id: '6194'
file_name: p1-scheideler.pdf
file_size: 1420210
relation: main_file
file_date_updated: 2018-12-12T15:12:02Z
has_accepted_license: '1'
language:
- iso: eng
page: 1-2
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication: Proceedings of the 2018 Workshop on Theory and Practice for Integrated
Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom,
July 27, 2018
status: public
title: 'Relays: Towards a Link Layer for Robust and Secure Fog Computing'
type: conference
user_id: '477'
year: '2018'
...
---
_id: '5986'
author:
- first_name: Robert
full_name: Gmyr, Robert
last_name: Gmyr
- first_name: Kristian
full_name: Hinnenthal, Kristian
id: '32229'
last_name: Hinnenthal
- first_name: Irina
full_name: Kostitsyna, Irina
last_name: Kostitsyna
- first_name: Fabian
full_name: Kuhn, Fabian
last_name: Kuhn
- first_name: Dorian
full_name: Rudolph, Dorian
last_name: Rudolph
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Gmyr R, Hinnenthal K, Kostitsyna I, Kuhn F, Rudolph D, Scheideler C. Shape
Recognition by a Finite Automaton Robot. In: 43rd International Symposium on
Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool,
UK. ; 2018:52:1-52:15. doi:10.4230/LIPIcs.MFCS.2018.52'
apa: Gmyr, R., Hinnenthal, K., Kostitsyna, I., Kuhn, F., Rudolph, D., & Scheideler,
C. (2018). Shape Recognition by a Finite Automaton Robot. In 43rd International
Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31,
2018, Liverpool, UK (pp. 52:1-52:15). https://doi.org/10.4230/LIPIcs.MFCS.2018.52
bibtex: '@inproceedings{Gmyr_Hinnenthal_Kostitsyna_Kuhn_Rudolph_Scheideler_2018,
title={Shape Recognition by a Finite Automaton Robot}, DOI={10.4230/LIPIcs.MFCS.2018.52},
booktitle={43rd International Symposium on Mathematical Foundations of Computer
Science, MFCS 2018, August 27-31, 2018, Liverpool, UK}, author={Gmyr, Robert and
Hinnenthal, Kristian and Kostitsyna, Irina and Kuhn, Fabian and Rudolph, Dorian
and Scheideler, Christian}, year={2018}, pages={52:1-52:15} }'
chicago: Gmyr, Robert, Kristian Hinnenthal, Irina Kostitsyna, Fabian Kuhn, Dorian
Rudolph, and Christian Scheideler. “Shape Recognition by a Finite Automaton Robot.”
In 43rd International Symposium on Mathematical Foundations of Computer Science,
MFCS 2018, August 27-31, 2018, Liverpool, UK, 52:1-52:15, 2018. https://doi.org/10.4230/LIPIcs.MFCS.2018.52.
ieee: R. Gmyr, K. Hinnenthal, I. Kostitsyna, F. Kuhn, D. Rudolph, and C. Scheideler,
“Shape Recognition by a Finite Automaton Robot,” in 43rd International Symposium
on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018,
Liverpool, UK, 2018, pp. 52:1-52:15.
mla: Gmyr, Robert, et al. “Shape Recognition by a Finite Automaton Robot.” 43rd
International Symposium on Mathematical Foundations of Computer Science, MFCS
2018, August 27-31, 2018, Liverpool, UK, 2018, pp. 52:1-52:15, doi:10.4230/LIPIcs.MFCS.2018.52.
short: 'R. Gmyr, K. Hinnenthal, I. Kostitsyna, F. Kuhn, D. Rudolph, C. Scheideler,
in: 43rd International Symposium on Mathematical Foundations of Computer Science,
MFCS 2018, August 27-31, 2018, Liverpool, UK, 2018, pp. 52:1-52:15.'
date_created: 2018-11-30T08:13:58Z
date_updated: 2022-01-06T07:02:49Z
department:
- _id: '79'
doi: 10.4230/LIPIcs.MFCS.2018.52
language:
- iso: eng
page: 52:1-52:15
publication: 43rd International Symposium on Mathematical Foundations of Computer
Science, MFCS 2018, August 27-31, 2018, Liverpool, UK
status: public
title: Shape Recognition by a Finite Automaton Robot
type: conference
user_id: '15504'
year: '2018'
...
---
_id: '4411'
abstract:
- lang: eng
text: "While a lot of research in distributed computing has covered solutions for
self-stabilizing computing and topologies, there is far less work on self-stabilization
for distributed data structures.\r\nConsidering crashing peers in peer-to-peer
networks, it should not be taken for granted that a distributed data structure
remains intact.\r\nIn this work, we present a self-stabilizing protocol for a
distributed data structure called the hashed Patricia Trie (Kniesburges and Scheideler
WALCOM'11) that enables efficient prefix search on a set of keys.\r\nThe data
structure has a wide area of applications including string matching problems while
offering low overhead and efficient operations when embedded on top of a distributed
hash table.\r\nEspecially, longest prefix matching for $x$ can be done in $\\mathcal{O}(\\log
|x|)$ hash table read accesses.\r\nWe show how to maintain the structure in a
self-stabilizing way.\r\nOur protocol assures low overhead in a legal state and
a total (asymptotically optimal) memory demand of $\\Theta(d)$ bits, where $d$
is the number of bits needed for storing all keys."
author:
- first_name: Till
full_name: Knollmann, Till
id: '39241'
last_name: Knollmann
orcid: 0000-0003-2014-4696
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Knollmann T, Scheideler C. A Self-Stabilizing Hashed Patricia Trie. In: Izumi
T, Kuznetsov P, eds. Proceedings of the 20th International Symposium on Stabilization,
Safety, and Security of Distributed Systems (SSS). Vol 11201. Lecture Notes
of Computer Science. Springer, Cham; 2018. doi:10.1007/978-3-030-03232-6_1'
apa: 'Knollmann, T., & Scheideler, C. (2018). A Self-Stabilizing Hashed Patricia
Trie. In T. Izumi & P. Kuznetsov (Eds.), Proceedings of the 20th International
Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)
(Vol. 11201). Tokyo: Springer, Cham. https://doi.org/10.1007/978-3-030-03232-6_1'
bibtex: '@inproceedings{Knollmann_Scheideler_2018, series={Lecture Notes of Computer
Science}, title={A Self-Stabilizing Hashed Patricia Trie}, volume={11201}, DOI={10.1007/978-3-030-03232-6_1},
booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)}, publisher={Springer, Cham}, author={Knollmann,
Till and Scheideler, Christian}, editor={Izumi, Taisuke and Kuznetsov, PetrEditors},
year={2018}, collection={Lecture Notes of Computer Science} }'
chicago: Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia
Trie.” In Proceedings of the 20th International Symposium on Stabilization,
Safety, and Security of Distributed Systems (SSS), edited by Taisuke Izumi
and Petr Kuznetsov, Vol. 11201. Lecture Notes of Computer Science. Springer, Cham,
2018. https://doi.org/10.1007/978-3-030-03232-6_1.
ieee: T. Knollmann and C. Scheideler, “A Self-Stabilizing Hashed Patricia Trie,”
in Proceedings of the 20th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS), Tokyo, 2018, vol. 11201.
mla: Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia
Trie.” Proceedings of the 20th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS), edited by Taisuke Izumi and Petr
Kuznetsov, vol. 11201, Springer, Cham, 2018, doi:10.1007/978-3-030-03232-6_1.
short: 'T. Knollmann, C. Scheideler, in: T. Izumi, P. Kuznetsov (Eds.), Proceedings
of the 20th International Symposium on Stabilization, Safety, and Security of
Distributed Systems (SSS), Springer, Cham, 2018.'
conference:
end_date: 2018-11-07
location: Tokyo
name: 20th International Symposium on Stabilization, Safety, and Security of Distributed
Systems (SSS)
start_date: 2018-11-04
date_created: 2018-09-17T13:12:18Z
date_updated: 2022-01-06T07:01:02Z
ddc:
- '000'
department:
- _id: '63'
- _id: '79'
doi: 10.1007/978-3-030-03232-6_1
editor:
- first_name: Taisuke
full_name: Izumi, Taisuke
last_name: Izumi
- first_name: Petr
full_name: Kuznetsov, Petr
last_name: Kuznetsov
external_id:
arxiv:
- '1809.04923'
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:38:37Z
date_updated: 2018-11-02T14:38:37Z
file_id: '5277'
file_name: ASelf-stabilizingHashedPatrici.pdf
file_size: 500005
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:38:37Z
has_accepted_license: '1'
intvolume: ' 11201'
keyword:
- Self-Stabilizing
- Prefix Search
- Distributed Data Structure
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Proceedings of the 20th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)
publisher: Springer, Cham
series_title: Lecture Notes of Computer Science
status: public
title: A Self-Stabilizing Hashed Patricia Trie
type: conference
user_id: '39241'
volume: 11201
year: '2018'
...
---
_id: '4563'
abstract:
- lang: eng
text: "Routing is a challenging problem for wireless ad hoc networks, especially
when the nodes are mobile and spread so widely that in most cases multiple hops
are needed to route a message from one node to another. In fact, it is known that
any online routing protocol has a poor performance in the worst case, in a sense
that there is a distribution of nodes resulting in bad routing paths for that
protocol, even if the nodes know their geographic positions and the geographic
position of the destination of a message is known. The reason for that is that
radio holes in the ad hoc network may require messages to take long detours in
order to get to a destination, which are hard to find in an online fashion.\r\n\r\nIn
this paper, we assume that the wireless ad hoc network can make limited use of
long-range links provided by a global communication infrastructure like a cellular
infrastructure or a satellite in order to compute an abstraction of the wireless
ad hoc network that allows the messages to be sent along near-shortest paths in
the ad hoc network. We present distributed algorithms that compute an abstraction
of the ad hoc network in $\\mathcal{O}\\left(\\log ^2 n\\right)$ time using long-range
links, which results in $c$-competitive routing paths between any two nodes of
the ad hoc network for some constant $c$ if the convex hulls of the radio holes
do not intersect. We also show that the storage needed for the abstraction just
depends on the number and size of the radio holes in the wireless ad hoc network
and is independent on the total number of nodes, and this information just has
to be known to a few nodes for the routing to work.\r\n"
author:
- first_name: Daniel
full_name: Jung, Daniel
id: '37827'
last_name: Jung
- first_name: Christina
full_name: Kolb, Christina
id: '43647'
last_name: Kolb
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Jannik
full_name: Sundermeier, Jannik
id: '38705'
last_name: Sundermeier
citation:
ama: 'Jung D, Kolb C, Scheideler C, Sundermeier J. Competitive Routing in Hybrid
Communication Networks. In: Proceedings of the 14th International Symposium
on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) . Springer;
2018.'
apa: 'Jung, D., Kolb, C., Scheideler, C., & Sundermeier, J. (2018). Competitive
Routing in Hybrid Communication Networks. In Proceedings of the 14th International
Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) .
Helsinki: Springer.'
bibtex: '@inproceedings{Jung_Kolb_Scheideler_Sundermeier_2018, title={Competitive
Routing in Hybrid Communication Networks}, booktitle={Proceedings of the 14th
International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS)
}, publisher={Springer}, author={Jung, Daniel and Kolb, Christina and Scheideler,
Christian and Sundermeier, Jannik}, year={2018} }'
chicago: Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier.
“Competitive Routing in Hybrid Communication Networks.” In Proceedings of the
14th International Symposium on Algorithms and Experiments for Wireless Networks
(ALGOSENSORS) . Springer, 2018.
ieee: D. Jung, C. Kolb, C. Scheideler, and J. Sundermeier, “Competitive Routing
in Hybrid Communication Networks,” in Proceedings of the 14th International
Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) ,
Helsinki, 2018.
mla: Jung, Daniel, et al. “Competitive Routing in Hybrid Communication Networks.”
Proceedings of the 14th International Symposium on Algorithms and Experiments
for Wireless Networks (ALGOSENSORS) , Springer, 2018.
short: 'D. Jung, C. Kolb, C. Scheideler, J. Sundermeier, in: Proceedings of the
14th International Symposium on Algorithms and Experiments for Wireless Networks
(ALGOSENSORS) , Springer, 2018.'
conference:
end_date: 2018-08-24
location: Helsinki
name: '14th International Symposium on Algorithms and Experiments for Wireless Networks
(ALGOSENSORS) '
start_date: 2018-08-23
date_created: 2018-10-02T07:06:05Z
date_updated: 2022-01-06T07:01:11Z
ddc:
- '000'
department:
- _id: '63'
- _id: '79'
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2019-01-11T10:32:38Z
date_updated: 2019-01-11T10:32:38Z
file_id: '6621'
file_name: 23hybrid.pdf
file_size: 349034
relation: main_file
success: 1
file_date_updated: 2019-01-11T10:32:38Z
has_accepted_license: '1'
keyword:
- greedy routing
- ad hoc networks
- convex hulls
- c-competitiveness
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: 'Proceedings of the 14th International Symposium on Algorithms and Experiments
for Wireless Networks (ALGOSENSORS) '
publisher: Springer
status: public
title: Competitive Routing in Hybrid Communication Networks
type: conference
user_id: '38705'
year: '2018'
...
---
_id: '4565'
author:
- first_name: Daniel
full_name: Jung, Daniel
id: '37827'
last_name: Jung
- first_name: Christina
full_name: Kolb, Christina
id: '43647'
last_name: Kolb
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Jannik
full_name: Sundermeier, Jannik
id: '38705'
last_name: Sundermeier
citation:
ama: 'Jung D, Kolb C, Scheideler C, Sundermeier J. Brief Announcement: Competitive
Routing in Hybrid Communication Networks. In: Proceedings of the 30th on Symposium
on Parallelism in Algorithms and Architectures (SPAA). ACM Press; 2018. doi:10.1145/3210377.3210663'
apa: 'Jung, D., Kolb, C., Scheideler, C., & Sundermeier, J. (2018). Brief Announcement:
Competitive Routing in Hybrid Communication Networks. In Proceedings of the
30th on Symposium on Parallelism in Algorithms and Architectures (SPAA). Wien:
ACM Press. https://doi.org/10.1145/3210377.3210663'
bibtex: '@inproceedings{Jung_Kolb_Scheideler_Sundermeier_2018, title={Brief Announcement:
Competitive Routing in Hybrid Communication Networks}, DOI={10.1145/3210377.3210663},
booktitle={Proceedings of the 30th on Symposium on Parallelism in Algorithms and
Architectures (SPAA)}, publisher={ACM Press}, author={Jung, Daniel and Kolb, Christina
and Scheideler, Christian and Sundermeier, Jannik}, year={2018} }'
chicago: 'Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier.
“Brief Announcement: Competitive Routing in Hybrid Communication Networks.” In
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures
(SPAA). ACM Press, 2018. https://doi.org/10.1145/3210377.3210663.'
ieee: 'D. Jung, C. Kolb, C. Scheideler, and J. Sundermeier, “Brief Announcement:
Competitive Routing in Hybrid Communication Networks,” in Proceedings of the
30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), Wien,
2018.'
mla: 'Jung, Daniel, et al. “Brief Announcement: Competitive Routing in Hybrid Communication
Networks.” Proceedings of the 30th on Symposium on Parallelism in Algorithms
and Architectures (SPAA), ACM Press, 2018, doi:10.1145/3210377.3210663.'
short: 'D. Jung, C. Kolb, C. Scheideler, J. Sundermeier, in: Proceedings of the
30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM Press,
2018.'
conference:
end_date: 2018-07-18
location: Wien
name: SPAA'18
start_date: 2018-07-17
date_created: 2018-10-02T07:34:47Z
date_updated: 2022-01-06T07:01:12Z
ddc:
- '000'
department:
- _id: '63'
- _id: '79'
doi: 10.1145/3210377.3210663
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T13:48:10Z
date_updated: 2018-11-02T13:48:10Z
file_id: '5254'
file_name: p231-jung-1.pdf
file_size: 1025077
relation: main_file
success: 1
file_date_updated: 2018-11-02T13:48:10Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Proceedings of the 30th on Symposium on Parallelism in Algorithms and
Architectures (SPAA)
publication_identifier:
isbn:
- '9781450357999'
publication_status: published
publisher: ACM Press
status: public
title: 'Brief Announcement: Competitive Routing in Hybrid Communication Networks'
type: conference
user_id: '38705'
year: '2018'
...
---
_id: '4351'
abstract:
- lang: eng
text: "\tWe extend the concept of monotonic searchability~\\cite{DBLP:conf/opodis/ScheidelerSS15}~\\cite{DBLP:conf/wdag/ScheidelerSS16}
for self-stabilizing systems from one to multiple dimensions.\r\n\tA system is
self-stabilizing if it can recover to a legitimate state from any initial illegal
state.\r\n\tThese kind of systems are most often used in distributed applications.\r\n\tMonotonic
searchability provides guarantees when searching for nodes while the recovery
process is going on.\r\n\tMore precisely, if a search request started at some
node $u$ succeeds in reaching its destination $v$, then all future search requests
from $u$ to $v$ succeed as well.\r\n\tAlthough there already exists a self-stabilizing
protocol for a two-dimensional topology~\\cite{DBLP:journals/tcs/JacobRSS12} and
an universal approach for monotonic searchability~\\cite{DBLP:conf/wdag/ScheidelerSS16},
it is not clear how both of these concepts fit together effectively.\r\n\tThe
latter concept even comes with some restrictive assumptions on messages, which
is not the case for our protocol.\r\n\tWe propose a simple novel protocol for
a self-stabilizing two-dimensional quadtree that satisfies monotonic searchability.\r\n\tOur
protocol can easily be extended to higher dimensions and offers routing in $\\mathcal
O(\\log n)$ hops for any search request.\r\n"
author:
- first_name: Michael
full_name: Feldmann, Michael
id: '23538'
last_name: Feldmann
- first_name: Christina
full_name: Kolb, Christina
id: '43647'
last_name: Kolb
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Feldmann M, Kolb C, Scheideler C. Self-stabilizing Overlays for high-dimensional
Monotonic Searchability. In: Proceedings of the 20th International Symposium
on Stabilization, Safety, and Security of Distributed Systems (SSS). Vol 11201.
Lecture Notes in Computer Science. Springer, Cham; 2018:16-31. doi:10.1007/978-3-030-03232-6_2'
apa: Feldmann, M., Kolb, C., & Scheideler, C. (2018). Self-stabilizing Overlays
for high-dimensional Monotonic Searchability. In Proceedings of the 20th International
Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)
(Vol. 11201, pp. 16–31). Springer, Cham. https://doi.org/10.1007/978-3-030-03232-6_2
bibtex: '@inproceedings{Feldmann_Kolb_Scheideler_2018, series={Lecture Notes in
Computer Science}, title={Self-stabilizing Overlays for high-dimensional Monotonic
Searchability}, volume={11201}, DOI={10.1007/978-3-030-03232-6_2},
booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)}, publisher={Springer, Cham}, author={Feldmann,
Michael and Kolb, Christina and Scheideler, Christian}, year={2018}, pages={16–31},
collection={Lecture Notes in Computer Science} }'
chicago: Feldmann, Michael, Christina Kolb, and Christian Scheideler. “Self-Stabilizing
Overlays for High-Dimensional Monotonic Searchability.” In Proceedings of the
20th International Symposium on Stabilization, Safety, and Security of Distributed
Systems (SSS), 11201:16–31. Lecture Notes in Computer Science. Springer, Cham,
2018. https://doi.org/10.1007/978-3-030-03232-6_2.
ieee: M. Feldmann, C. Kolb, and C. Scheideler, “Self-stabilizing Overlays for high-dimensional
Monotonic Searchability,” in Proceedings of the 20th International Symposium
on Stabilization, Safety, and Security of Distributed Systems (SSS), 2018,
vol. 11201, pp. 16–31.
mla: Feldmann, Michael, et al. “Self-Stabilizing Overlays for High-Dimensional Monotonic
Searchability.” Proceedings of the 20th International Symposium on Stabilization,
Safety, and Security of Distributed Systems (SSS), vol. 11201, Springer, Cham,
2018, pp. 16–31, doi:10.1007/978-3-030-03232-6_2.
short: 'M. Feldmann, C. Kolb, C. Scheideler, in: Proceedings of the 20th International
Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS),
Springer, Cham, 2018, pp. 16–31.'
date_created: 2018-09-04T14:15:39Z
date_updated: 2022-01-06T07:00:58Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-030-03232-6_2
external_id:
arxiv:
- '1808.10300'
file:
- access_level: closed
content_type: application/pdf
creator: mfeldma2
date_created: 2018-10-31T13:24:17Z
date_updated: 2018-10-31T13:24:17Z
file_id: '5210'
file_name: Feldmann2018_Chapter_Self-stabilizingOverlaysForHig.pdf
file_size: 329823
relation: main_file
success: 1
file_date_updated: 2018-10-31T13:24:17Z
has_accepted_license: '1'
intvolume: ' 11201'
language:
- iso: eng
page: '16-31 '
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Proceedings of the 20th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)
publication_identifier:
unknown:
- 978-3-030-03231-9
publisher: Springer, Cham
series_title: Lecture Notes in Computer Science
status: public
title: Self-stabilizing Overlays for high-dimensional Monotonic Searchability
type: conference
user_id: '23538'
volume: 11201
year: '2018'
...
---
_id: '4375'
abstract:
- lang: eng
text: "We present a peer-to-peer network that supports the efficient processing
of orthogonal range queries $R=\\bigtimes_{i=1}^{d}[a_i,\\,b_i]$ in a $d$-dimensional
point space.\\\\\r\nThe network is the same for each dimension, namely a distance
halving network like the one introduced by Naor and Wieder (ACM TALG'07).\r\nWe
show how to execute such range queries using $\\mathcal{O}\\left(2^{d'}d\\,\\log
m + d\\,|R|\\right)$ hops (and the same number of messages) in total. Here $[m]^d$
is the ground set, $|R|$ is the size and $d'$ the dimension of the queried range.\r\nFurthermore,
if the peers form a distributed network, the query can be answered in $\\mathcal{O}\\left(d\\,\\log
m + d\\,\\sum_{i=1}^{d}(b_i-a_i+1)\\right)$ communication rounds.\r\nOur algorithms
are based on a mapping of the Hilbert Curve through $[m]^d$ to the peers."
author:
- first_name: Markus
full_name: Benter, Markus
last_name: Benter
- 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
- first_name: Alexander
full_name: Setzer, Alexander
id: '11108'
last_name: Setzer
- first_name: Jannik
full_name: Sundermeier, Jannik
id: '38705'
last_name: Sundermeier
citation:
ama: 'Benter M, Knollmann T, Meyer auf der Heide F, Setzer A, Sundermeier J. A Peer-to-Peer
based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension.
In: Proceedings of the 4th International Symposium on Algorithmic Aspects of
Cloud Computing (ALGOCLOUD). ; 2018. doi:10.1007/978-3-030-19759-9_4'
apa: Benter, M., Knollmann, T., Meyer auf der Heide, F., Setzer, A., & Sundermeier,
J. (2018). A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries
of arbitrary Dimension. In Proceedings of the 4th International Symposium on
Algorithmic Aspects of Cloud Computing (ALGOCLOUD). Helsinki. https://doi.org/10.1007/978-3-030-19759-9_4
bibtex: '@inproceedings{Benter_Knollmann_Meyer auf der Heide_Setzer_Sundermeier_2018,
title={A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries
of arbitrary Dimension}, DOI={10.1007/978-3-030-19759-9_4},
booktitle={Proceedings of the 4th International Symposium on Algorithmic Aspects
of Cloud Computing (ALGOCLOUD)}, author={Benter, Markus and Knollmann, Till and
Meyer auf der Heide, Friedhelm and Setzer, Alexander and Sundermeier, Jannik},
year={2018} }'
chicago: Benter, Markus, Till Knollmann, Friedhelm Meyer auf der Heide, Alexander
Setzer, and Jannik Sundermeier. “A Peer-to-Peer Based Cloud Storage Supporting
Orthogonal Range Queries of Arbitrary Dimension.” In Proceedings of the 4th
International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD),
2018. https://doi.org/10.1007/978-3-030-19759-9_4.
ieee: M. Benter, T. Knollmann, F. Meyer auf der Heide, A. Setzer, and J. Sundermeier,
“A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary
Dimension,” in Proceedings of the 4th International Symposium on Algorithmic
Aspects of Cloud Computing (ALGOCLOUD), Helsinki, 2018.
mla: Benter, Markus, et al. “A Peer-to-Peer Based Cloud Storage Supporting Orthogonal
Range Queries of Arbitrary Dimension.” Proceedings of the 4th International
Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), 2018, doi:10.1007/978-3-030-19759-9_4.
short: 'M. Benter, T. Knollmann, F. Meyer auf der Heide, A. Setzer, J. Sundermeier,
in: Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud
Computing (ALGOCLOUD), 2018.'
conference:
end_date: 2018-08-21
location: Helsinki
name: 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)
start_date: 2018-08-20
date_created: 2018-09-11T05:26:59Z
date_updated: 2022-01-06T07:01:00Z
ddc:
- '000'
department:
- _id: '63'
- _id: '79'
doi: 10.1007/978-3-030-19759-9_4
file:
- access_level: closed
content_type: application/pdf
creator: tillk
date_created: 2018-11-27T10:03:33Z
date_updated: 2018-11-27T10:03:33Z
file_id: '5863'
file_name: A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries
of arbitrary Dimension.pdf
file_size: 1122875
relation: main_file
success: 1
file_date_updated: 2018-11-27T10:03:33Z
has_accepted_license: '1'
keyword:
- Distributed Storage
- Multi-Dimensional Range Queries
- Peer-to-Peer
- Hilbert Curve
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Proceedings of the 4th International Symposium on Algorithmic Aspects
of Cloud Computing (ALGOCLOUD)
status: public
title: A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary
Dimension
type: conference
user_id: '14955'
year: '2018'
...
---
_id: '5216'
abstract:
- lang: eng
text: A fundamental problem for overlay networks is to safely exclude leaving nodes,
i.e., the nodes requesting to leave the overlay network are excluded from it without
affecting its connectivity. To rigorously study self-stabilizing solutions to
this problem, the Finite Departure Problem (FDP) has been proposed [9]. In the
FDP we are given a network of processes in an arbitrary state, and the goal is
to eventually arrive at (and stay in) a state in which all leaving processes irrevocably
decided to leave the system while for all weakly-connected components in the initial
overlay network, all staying processes in that component will still form a weakly
connected component. In the standard interconnection model, the FDP is known to
be unsolvable by local control protocols, so oracles have been investigated that
allow the problem to be solved [9]. To avoid the use of oracles, we introduce
a new interconnection model based on relays. Despite the relay model appearing
to be rather restrictive, we show that it is universal, i.e., it is possible to
transform any weakly-connected topology into any other weakly-connected topology,
which is important for being a useful interconnection model for overlay networks.
Apart from this, our model allows processes to grant and revoke access rights,
which is why we believe it to be of interest beyond the scope of this paper. We
show how to implement the relay layer in a self-stabilizing way and identify properties
protocols need to satisfy so that the relay layer can recover while serving protocol
requests.
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Alexander
full_name: Setzer, Alexander
id: '11108'
last_name: Setzer
citation:
ama: 'Scheideler C, Setzer A. Relays: A New Approach for the Finite Departure Problem
in Overlay Networks. In: Proceedings of the 20th International Symposium on
Stabilization, Safety, and Security of Distributed Systems (SSS 2018). ; 2018.
doi:10.1007/978-3-030-03232-6_16'
apa: 'Scheideler, C., & Setzer, A. (2018). Relays: A New Approach for the Finite
Departure Problem in Overlay Networks. In Proceedings of the 20th International
Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018).
Tokyo, Japan. https://doi.org/10.1007/978-3-030-03232-6_16'
bibtex: '@inproceedings{Scheideler_Setzer_2018, title={Relays: A New Approach for
the Finite Departure Problem in Overlay Networks}, DOI={10.1007/978-3-030-03232-6_16},
booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS 2018)}, author={Scheideler, Christian
and Setzer, Alexander}, year={2018} }'
chicago: 'Scheideler, Christian, and Alexander Setzer. “Relays: A New Approach for
the Finite Departure Problem in Overlay Networks.” In Proceedings of the 20th
International Symposium on Stabilization, Safety, and Security of Distributed
Systems (SSS 2018), 2018. https://doi.org/10.1007/978-3-030-03232-6_16.'
ieee: 'C. Scheideler and A. Setzer, “Relays: A New Approach for the Finite Departure
Problem in Overlay Networks,” in Proceedings of the 20th International Symposium
on Stabilization, Safety, and Security of Distributed Systems (SSS 2018),
Tokyo, Japan, 2018.'
mla: 'Scheideler, Christian, and Alexander Setzer. “Relays: A New Approach for the
Finite Departure Problem in Overlay Networks.” Proceedings of the 20th International
Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018),
2018, doi:10.1007/978-3-030-03232-6_16.'
short: 'C. Scheideler, A. Setzer, in: Proceedings of the 20th International Symposium
on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), 2018.'
conference:
location: Tokyo, Japan
name: 20th International Symposium on Stabilization, Safety, and Security of Distributed
Systems (SSS 2018)
date_created: 2018-10-31T13:33:05Z
date_updated: 2022-01-06T07:01:47Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-030-03232-6_16
file:
- access_level: closed
content_type: application/pdf
creator: asetzer
date_created: 2018-10-31T15:51:45Z
date_updated: 2018-10-31T16:09:48Z
file_id: '5223'
file_name: Scheideler-Setzer2018_Chapter_RelaysANewApproachForTheFinite.pdf
file_size: 369818
relation: main_file
file_date_updated: 2018-10-31T16:09:48Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication: Proceedings of the 20th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS 2018)
publication_status: published
status: public
title: 'Relays: A New Approach for the Finite Departure Problem in Overlay Networks'
type: conference
user_id: '11108'
year: '2018'
...
---
_id: '5222'
abstract:
- lang: eng
text: 'We present a self-stabilizing protocol for an overlay network that constructs
the Minimum Spanning Tree (MST) for an underlay that is modeled by a weighted
tree. The weight of an overlay edge between two nodes is the weighted length of
their shortest path in the tree. We rigorously prove that our protocol works correctly
under asynchronous and non-FIFO message delivery. Further, the protocol stabilizes
after O(N^2) asynchronous rounds where N is the number of nodes in the overlay. '
author:
- first_name: Thorsten
full_name: Götte, Thorsten
id: '34727'
last_name: Götte
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Alexander
full_name: Setzer, Alexander
id: '11108'
last_name: Setzer
citation:
ama: 'Götte T, Scheideler C, Setzer A. On Underlay-Aware Self-Stabilizing Overlay
Networks. In: Proceedings of the 20th International Symposium on Stabilization,
Safety, and Security of Distributed Systems (SSS 2018). Vol 11201. Lecture
Notes in Computer Science. Springer; 2018:50-64.'
apa: 'Götte, T., Scheideler, C., & Setzer, A. (2018). On Underlay-Aware Self-Stabilizing
Overlay Networks. In Proceedings of the 20th International Symposium on Stabilization,
Safety, and Security of Distributed Systems (SSS 2018) (Vol. 11201, pp. 50–64).
Tokyo, Japan: Springer.'
bibtex: '@inproceedings{Götte_Scheideler_Setzer_2018, series={Lecture Notes in Computer
Science}, title={On Underlay-Aware Self-Stabilizing Overlay Networks}, volume={11201},
booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS 2018)}, publisher={Springer}, author={Götte,
Thorsten and Scheideler, Christian and Setzer, Alexander}, year={2018}, pages={50–64},
collection={Lecture Notes in Computer Science} }'
chicago: Götte, Thorsten, Christian Scheideler, and Alexander Setzer. “On Underlay-Aware
Self-Stabilizing Overlay Networks.” In Proceedings of the 20th International
Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018),
11201:50–64. Lecture Notes in Computer Science. Springer, 2018.
ieee: T. Götte, C. Scheideler, and A. Setzer, “On Underlay-Aware Self-Stabilizing
Overlay Networks,” in Proceedings of the 20th International Symposium on Stabilization,
Safety, and Security of Distributed Systems (SSS 2018), Tokyo, Japan, 2018,
vol. 11201, pp. 50–64.
mla: Götte, Thorsten, et al. “On Underlay-Aware Self-Stabilizing Overlay Networks.”
Proceedings of the 20th International Symposium on Stabilization, Safety, and
Security of Distributed Systems (SSS 2018), vol. 11201, Springer, 2018, pp.
50–64.
short: 'T. Götte, C. Scheideler, A. Setzer, in: Proceedings of the 20th International
Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018),
Springer, 2018, pp. 50–64.'
conference:
location: Tokyo, Japan
name: ' 20th International Symposium on Stabilization, Safety, and Security of Distributed
Systems (SSS 2018)'
date_created: 2018-10-31T15:44:30Z
date_updated: 2022-01-06T07:01:47Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: closed
content_type: application/pdf
creator: thgoette
date_created: 2018-10-31T15:59:26Z
date_updated: 2018-10-31T15:59:26Z
file_id: '5224'
file_name: sss18_camera.pdf
file_size: 367812
relation: main_file
success: 1
file_date_updated: 2018-10-31T15:59:26Z
has_accepted_license: '1'
intvolume: ' 11201'
language:
- iso: eng
page: 50-64
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Proceedings of the 20th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS 2018)
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: On Underlay-Aware Self-Stabilizing Overlay Networks
type: conference
user_id: '477'
volume: 11201
year: '2018'
...
---
_id: '5368'
author:
- first_name: Moritz
full_name: Jochmaring, Moritz
last_name: Jochmaring
citation:
ama: Jochmaring M. Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen
Build-List Und Build-Multilist Mit Systemverlassenden Knoten. Universität
Paderborn; 2018.
apa: Jochmaring, M. (2018). Monotone Suchbarkeit bei den selbststabilisierenden
Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten.
Universität Paderborn.
bibtex: '@book{Jochmaring_2018, title={Monotone Suchbarkeit bei den selbststabilisierenden
Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten}, publisher={Universität
Paderborn}, author={Jochmaring, Moritz}, year={2018} }'
chicago: Jochmaring, Moritz. Monotone Suchbarkeit Bei Den Selbststabilisierenden
Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten.
Universität Paderborn, 2018.
ieee: M. Jochmaring, Monotone Suchbarkeit bei den selbststabilisierenden Protokollen
Build-List und Build-Multilist mit systemverlassenden Knoten. Universität
Paderborn, 2018.
mla: Jochmaring, Moritz. Monotone Suchbarkeit Bei Den Selbststabilisierenden
Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten.
Universität Paderborn, 2018.
short: M. Jochmaring, Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen
Build-List Und Build-Multilist Mit Systemverlassenden Knoten, Universität Paderborn,
2018.
date_created: 2018-11-06T06:21:37Z
date_updated: 2022-01-06T07:01:50Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List
und Build-Multilist mit systemverlassenden Knoten
type: bachelorsthesis
user_id: '477'
year: '2018'
...
---
_id: '3872'
abstract:
- lang: eng
text: 'This paper considers the problem of how to efficiently share a wireless medium
which is subject to harsh external interference or even jamming. So far, this
problem is understood only in simplistic single-hop or unit disk graph models.
We in this paper initiate the study of MAC protocols for the SINR interference
model (a.k.a. physical model). This paper makes two contributions. First, we introduce
a new adversarial SINR model which captures a wide range of interference phenomena.
Concretely, we consider a powerful, adaptive adversary which can jam nodes at
arbitrary times and which is only limited by some energy budget. Our second contribution
is a distributed MAC protocol called Sade which provably achieves a constant competitive
throughput in this environment: we show that, with high probability, the protocol
ensures that a constant fraction of the non-blocked time periods is used for successful
transmissions.'
author:
- first_name: Adrian
full_name: Ogierman, Adrian
last_name: Ogierman
- first_name: Andrea
full_name: Richa, Andrea
last_name: Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: Jin
full_name: Zhang, Jin
last_name: Zhang
citation:
ama: 'Ogierman A, Richa A, Scheideler C, Schmid S, Zhang J. Sade: competitive MAC
under adversarial SINR. Distributed Computing. 2017;31(3):241-254. doi:10.1007/s00446-017-0307-1'
apa: 'Ogierman, A., Richa, A., Scheideler, C., Schmid, S., & Zhang, J. (2017).
Sade: competitive MAC under adversarial SINR. Distributed Computing, 31(3),
241–254. https://doi.org/10.1007/s00446-017-0307-1'
bibtex: '@article{Ogierman_Richa_Scheideler_Schmid_Zhang_2017, title={Sade: competitive
MAC under adversarial SINR}, volume={31}, DOI={10.1007/s00446-017-0307-1},
number={3}, journal={Distributed Computing}, publisher={Springer Nature}, author={Ogierman,
Adrian and Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang,
Jin}, year={2017}, pages={241–254} }'
chicago: 'Ogierman, Adrian, Andrea Richa, Christian Scheideler, Stefan Schmid, and
Jin Zhang. “Sade: Competitive MAC under Adversarial SINR.” Distributed Computing
31, no. 3 (2017): 241–54. https://doi.org/10.1007/s00446-017-0307-1.'
ieee: 'A. Ogierman, A. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Sade: competitive
MAC under adversarial SINR,” Distributed Computing, vol. 31, no. 3, pp.
241–254, 2017.'
mla: 'Ogierman, Adrian, et al. “Sade: Competitive MAC under Adversarial SINR.” Distributed
Computing, vol. 31, no. 3, Springer Nature, 2017, pp. 241–54, doi:10.1007/s00446-017-0307-1.'
short: A. Ogierman, A. Richa, C. Scheideler, S. Schmid, J. Zhang, Distributed Computing
31 (2017) 241–254.
date_created: 2018-08-10T07:05:12Z
date_updated: 2022-01-06T06:59:47Z
department:
- _id: '79'
doi: 10.1007/s00446-017-0307-1
intvolume: ' 31'
issue: '3'
page: 241-254
publication: Distributed Computing
publication_identifier:
issn:
- 0178-2770
- 1432-0452
publication_status: published
publisher: Springer Nature
status: public
title: 'Sade: competitive MAC under adversarial SINR'
type: journal_article
user_id: '15504'
volume: 31
year: '2017'
...
---
_id: '18026'
author:
- first_name: 'Michél '
full_name: 'Burkhardt, Michél '
last_name: Burkhardt
citation:
ama: Burkhardt M. Untersuchungen Zum Cone-Hashing. Universität Paderborn;
2017.
apa: Burkhardt, M. (2017). Untersuchungen zum Cone-Hashing. Universität Paderborn.
bibtex: '@book{Burkhardt_2017, title={Untersuchungen zum Cone-Hashing}, publisher={Universität
Paderborn}, author={Burkhardt, Michél }, year={2017} }'
chicago: Burkhardt, Michél . Untersuchungen Zum Cone-Hashing. Universität
Paderborn, 2017.
ieee: M. Burkhardt, Untersuchungen zum Cone-Hashing. Universität Paderborn,
2017.
mla: Burkhardt, Michél. Untersuchungen Zum Cone-Hashing. Universität Paderborn,
2017.
short: M. Burkhardt, Untersuchungen Zum Cone-Hashing, Universität Paderborn, 2017.
date_created: 2020-08-18T08:39:19Z
date_updated: 2022-01-06T06:53:25Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Untersuchungen zum Cone-Hashing
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '18027'
author:
- first_name: Ngoc Chi
full_name: Banh, Ngoc Chi
last_name: Banh
citation:
ama: Banh NC. An Asynchronous Adaption of a Churn-Resistant Overlay Network.
Universität Paderborn; 2017.
apa: Banh, N. C. (2017). An Asynchronous Adaption of a Churn-resistant Overlay
Network. Universität Paderborn.
bibtex: '@book{Banh_2017, title={An Asynchronous Adaption of a Churn-resistant Overlay
Network}, publisher={Universität Paderborn}, author={Banh, Ngoc Chi}, year={2017}
}'
chicago: Banh, Ngoc Chi. An Asynchronous Adaption of a Churn-Resistant Overlay
Network. Universität Paderborn, 2017.
ieee: N. C. Banh, An Asynchronous Adaption of a Churn-resistant Overlay Network.
Universität Paderborn, 2017.
mla: Banh, Ngoc Chi. An Asynchronous Adaption of a Churn-Resistant Overlay Network.
Universität Paderborn, 2017.
short: N.C. Banh, An Asynchronous Adaption of a Churn-Resistant Overlay Network,
Universität Paderborn, 2017.
date_created: 2020-08-18T08:40:19Z
date_updated: 2022-01-06T06:53:25Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: An Asynchronous Adaption of a Churn-resistant Overlay Network
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '18028'
author:
- first_name: Andreas
full_name: Schenk, Andreas
last_name: Schenk
citation:
ama: Schenk A. Monotone Suchbarkeit in Mehrdimensionalen Verteilten Datenstrukturen.
Universität Paderborn; 2017.
apa: Schenk, A. (2017). Monotone Suchbarkeit in mehrdimensionalen verteilten
Datenstrukturen. Universität Paderborn.
bibtex: '@book{Schenk_2017, title={Monotone Suchbarkeit in mehrdimensionalen verteilten
Datenstrukturen}, publisher={Universität Paderborn}, author={Schenk, Andreas},
year={2017} }'
chicago: Schenk, Andreas. Monotone Suchbarkeit in Mehrdimensionalen Verteilten
Datenstrukturen. Universität Paderborn, 2017.
ieee: A. Schenk, Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen.
Universität Paderborn, 2017.
mla: Schenk, Andreas. Monotone Suchbarkeit in Mehrdimensionalen Verteilten Datenstrukturen.
Universität Paderborn, 2017.
short: A. Schenk, Monotone Suchbarkeit in Mehrdimensionalen Verteilten Datenstrukturen,
Universität Paderborn, 2017.
date_created: 2020-08-18T08:41:42Z
date_updated: 2022-01-06T06:53:25Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '18029'
author:
- first_name: Björn
full_name: Beckendorf, Björn
last_name: Beckendorf
citation:
ama: Beckendorf B. Visualisierung Zu Algorithmen Verteilter Netzwerksysteme.
Universität Paderborn; 2017.
apa: Beckendorf, B. (2017). Visualisierung zu Algorithmen verteilter Netzwerksysteme.
Universität Paderborn.
bibtex: '@book{Beckendorf_2017, title={Visualisierung zu Algorithmen verteilter
Netzwerksysteme}, publisher={Universität Paderborn}, author={Beckendorf, Björn},
year={2017} }'
chicago: Beckendorf, Björn. Visualisierung Zu Algorithmen Verteilter Netzwerksysteme.
Universität Paderborn, 2017.
ieee: B. Beckendorf, Visualisierung zu Algorithmen verteilter Netzwerksysteme.
Universität Paderborn, 2017.
mla: Beckendorf, Björn. Visualisierung Zu Algorithmen Verteilter Netzwerksysteme.
Universität Paderborn, 2017.
short: B. Beckendorf, Visualisierung Zu Algorithmen Verteilter Netzwerksysteme,
Universität Paderborn, 2017.
date_created: 2020-08-18T08:42:36Z
date_updated: 2022-01-06T06:53:25Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Visualisierung zu Algorithmen verteilter Netzwerksysteme
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '1812'
author:
- first_name: Andreas
full_name: Koutsopoulos, Andreas
last_name: Koutsopoulos
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
citation:
ama: Koutsopoulos A, Scheideler C, Strothmann TF. Towards a universal approach for
the finite departure problem in overlay networks. Inf Comput. 2017:408--424.
doi:10.1016/j.ic.2016.12.006
apa: Koutsopoulos, A., Scheideler, C., & Strothmann, T. F. (2017). Towards a
universal approach for the finite departure problem in overlay networks. Inf.
Comput., 408--424. https://doi.org/10.1016/j.ic.2016.12.006
bibtex: '@article{Koutsopoulos_Scheideler_Strothmann_2017, title={Towards a universal
approach for the finite departure problem in overlay networks}, DOI={10.1016/j.ic.2016.12.006},
journal={Inf. Comput.}, author={Koutsopoulos, Andreas and Scheideler, Christian
and Strothmann, Thim Frederik}, year={2017}, pages={408--424} }'
chicago: Koutsopoulos, Andreas, Christian Scheideler, and Thim Frederik Strothmann.
“Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.”
Inf. Comput., 2017, 408--424. https://doi.org/10.1016/j.ic.2016.12.006.
ieee: A. Koutsopoulos, C. Scheideler, and T. F. Strothmann, “Towards a universal
approach for the finite departure problem in overlay networks,” Inf. Comput.,
pp. 408--424, 2017.
mla: Koutsopoulos, Andreas, et al. “Towards a Universal Approach for the Finite
Departure Problem in Overlay Networks.” Inf. Comput., 2017, pp. 408--424,
doi:10.1016/j.ic.2016.12.006.
short: A. Koutsopoulos, C. Scheideler, T.F. Strothmann, Inf. Comput. (2017) 408--424.
date_created: 2018-03-27T11:23:36Z
date_updated: 2022-01-06T06:53:26Z
department:
- _id: '79'
doi: 10.1016/j.ic.2016.12.006
language:
- iso: eng
page: 408--424
publication: Inf. Comput.
status: public
title: Towards a universal approach for the finite departure problem in overlay networks
type: journal_article
user_id: '15504'
year: '2017'
...
---
_id: '1813'
author:
- first_name: Sandor
full_name: P. Fekete, Sandor
last_name: P. Fekete
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- first_name: Kay
full_name: Römer, Kay
last_name: Römer
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: P. Fekete S, W. Richa A, Römer K, Scheideler C. Algorithmic Foundations of
Programmable Matter Dagstuhl Seminar 16271. SIGACT News. 2017;(2):87--94.
doi:10.1145/3106700.3106713
apa: P. Fekete, S., W. Richa, A., Römer, K., & Scheideler, C. (2017). Algorithmic
Foundations of Programmable Matter Dagstuhl Seminar 16271. SIGACT News,
(2), 87--94. https://doi.org/10.1145/3106700.3106713
bibtex: '@article{P. Fekete_W. Richa_Römer_Scheideler_2017, title={Algorithmic Foundations
of Programmable Matter Dagstuhl Seminar 16271}, DOI={10.1145/3106700.3106713},
number={2}, journal={SIGACT News}, author={P. Fekete, Sandor and W. Richa, Andrea
and Römer, Kay and Scheideler, Christian}, year={2017}, pages={87--94} }'
chicago: 'P. Fekete, Sandor, Andrea W. Richa, Kay Römer, and Christian Scheideler.
“Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271.” SIGACT
News, no. 2 (2017): 87--94. https://doi.org/10.1145/3106700.3106713.'
ieee: S. P. Fekete, A. W. Richa, K. Römer, and C. Scheideler, “Algorithmic Foundations
of Programmable Matter Dagstuhl Seminar 16271,” SIGACT News, no. 2, pp.
87--94, 2017.
mla: P. Fekete, Sandor, et al. “Algorithmic Foundations of Programmable Matter Dagstuhl
Seminar 16271.” SIGACT News, no. 2, 2017, pp. 87--94, doi:10.1145/3106700.3106713.
short: S. P. Fekete, A. W. Richa, K. Römer, C. Scheideler, SIGACT News (2017) 87--94.
date_created: 2018-03-27T11:24:15Z
date_updated: 2022-01-06T06:53:26Z
department:
- _id: '79'
doi: 10.1145/3106700.3106713
issue: '2'
page: 87--94
publication: SIGACT News
status: public
title: Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271
type: journal_article
user_id: '15504'
year: '2017'
...
---
_id: '1814'
author:
- first_name: Zahra
full_name: Derakhshandeh, Zahra
last_name: Derakhshandeh
- first_name: Robert
full_name: Gmyr, Robert
last_name: Gmyr
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
citation:
ama: Derakhshandeh Z, Gmyr R, W. Richa A, Scheideler C, Strothmann TF. Universal
coating for programmable matter. Theor Comput Sci. 2017:56--68. doi:10.1016/j.tcs.2016.02.039
apa: Derakhshandeh, Z., Gmyr, R., W. Richa, A., Scheideler, C., & Strothmann,
T. F. (2017). Universal coating for programmable matter. Theor. Comput. Sci.,
56--68. https://doi.org/10.1016/j.tcs.2016.02.039
bibtex: '@article{Derakhshandeh_Gmyr_W. Richa_Scheideler_Strothmann_2017, title={Universal
coating for programmable matter}, DOI={10.1016/j.tcs.2016.02.039},
journal={Theor. Comput. Sci.}, author={Derakhshandeh, Zahra and Gmyr, Robert and
W. Richa, Andrea and Scheideler, Christian and Strothmann, Thim Frederik}, year={2017},
pages={56--68} }'
chicago: Derakhshandeh, Zahra, Robert Gmyr, Andrea W. Richa, Christian Scheideler,
and Thim Frederik Strothmann. “Universal Coating for Programmable Matter.” Theor.
Comput. Sci., 2017, 56--68. https://doi.org/10.1016/j.tcs.2016.02.039.
ieee: Z. Derakhshandeh, R. Gmyr, A. W. Richa, C. Scheideler, and T. F. Strothmann,
“Universal coating for programmable matter,” Theor. Comput. Sci., pp. 56--68,
2017.
mla: Derakhshandeh, Zahra, et al. “Universal Coating for Programmable Matter.” Theor.
Comput. Sci., 2017, pp. 56--68, doi:10.1016/j.tcs.2016.02.039.
short: Z. Derakhshandeh, R. Gmyr, A. W. Richa, C. Scheideler, T.F. Strothmann, Theor.
Comput. Sci. (2017) 56--68.
date_created: 2018-03-27T11:24:57Z
date_updated: 2022-01-06T06:53:26Z
department:
- _id: '79'
doi: 10.1016/j.tcs.2016.02.039
language:
- iso: eng
page: 56--68
publication: Theor. Comput. Sci.
status: public
title: Universal coating for programmable matter
type: journal_article
user_id: '15504'
year: '2017'
...
---
_id: '1815'
author:
- first_name: Joshua
full_name: J. Daymude, Joshua
last_name: J. Daymude
- first_name: Robert
full_name: Gmyr, Robert
last_name: Gmyr
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
citation:
ama: 'J. Daymude J, Gmyr R, W. Richa A, Scheideler C, Strothmann TF. Improved Leader
Election for Self-organizing Programmable Matter. In: Algorithms for Sensor
Systems - 13th International Symposium on Algorithms and Experiments for Wireless
Sensor Networks, ALGOSENSORS 2017, Vienna, Austria, September 7-8, 2017, Revised
Selected Papers. ; 2017:127--140. doi:10.1007/978-3-319-72751-6_10'
apa: J. Daymude, J., Gmyr, R., W. Richa, A., Scheideler, C., & Strothmann, T.
F. (2017). Improved Leader Election for Self-organizing Programmable Matter. In
Algorithms for Sensor Systems - 13th International Symposium on Algorithms
and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria,
September 7-8, 2017, Revised Selected Papers (pp. 127--140). https://doi.org/10.1007/978-3-319-72751-6_10
bibtex: '@inproceedings{J. Daymude_Gmyr_W. Richa_Scheideler_Strothmann_2017, title={Improved
Leader Election for Self-organizing Programmable Matter}, DOI={10.1007/978-3-319-72751-6_10},
booktitle={Algorithms for Sensor Systems - 13th International Symposium on Algorithms
and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria,
September 7-8, 2017, Revised Selected Papers}, author={J. Daymude, Joshua and
Gmyr, Robert and W. Richa, Andrea and Scheideler, Christian and Strothmann, Thim
Frederik}, year={2017}, pages={127--140} }'
chicago: J. Daymude, Joshua, Robert Gmyr, Andrea W. Richa, Christian Scheideler,
and Thim Frederik Strothmann. “Improved Leader Election for Self-Organizing Programmable
Matter.” In Algorithms for Sensor Systems - 13th International Symposium on
Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna,
Austria, September 7-8, 2017, Revised Selected Papers, 127--140, 2017. https://doi.org/10.1007/978-3-319-72751-6_10.
ieee: J. J. Daymude, R. Gmyr, A. W. Richa, C. Scheideler, and T. F. Strothmann,
“Improved Leader Election for Self-organizing Programmable Matter,” in Algorithms
for Sensor Systems - 13th International Symposium on Algorithms and Experiments
for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria, September 7-8,
2017, Revised Selected Papers, 2017, pp. 127--140.
mla: J. Daymude, Joshua, et al. “Improved Leader Election for Self-Organizing Programmable
Matter.” Algorithms for Sensor Systems - 13th International Symposium on Algorithms
and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria,
September 7-8, 2017, Revised Selected Papers, 2017, pp. 127--140, doi:10.1007/978-3-319-72751-6_10.
short: 'J. J. Daymude, R. Gmyr, A. W. Richa, C. Scheideler, T.F. Strothmann, in:
Algorithms for Sensor Systems - 13th International Symposium on Algorithms and
Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria, September
7-8, 2017, Revised Selected Papers, 2017, pp. 127--140.'
date_created: 2018-03-27T11:25:58Z
date_updated: 2022-01-06T06:53:26Z
department:
- _id: '79'
doi: 10.1007/978-3-319-72751-6_10
language:
- iso: eng
page: 127--140
publication: Algorithms for Sensor Systems - 13th International Symposium on Algorithms
and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria,
September 7-8, 2017, Revised Selected Papers
status: public
title: Improved Leader Election for Self-organizing Programmable Matter
type: conference
user_id: '15504'
year: '2017'
...
---
_id: '1820'
citation:
ama: Scheideler C, Taghi Hajiaghayi M, eds. Proceedings of the 29th ACM Symposium
on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA,
July 24-26, 2017.; 2017. doi:10.1145/3087556
apa: Scheideler, C., & Taghi Hajiaghayi, M. (Eds.). (2017). Proceedings of
the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017,
Washington DC, USA, July 24-26, 2017. https://doi.org/10.1145/3087556
bibtex: '@book{Scheideler_Taghi Hajiaghayi_2017, title={Proceedings of the 29th
ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington
DC, USA, July 24-26, 2017}, DOI={10.1145/3087556},
year={2017} }'
chicago: Scheideler, Christian, and Mohammad Taghi Hajiaghayi, eds. Proceedings
of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA
2017, Washington DC, USA, July 24-26, 2017, 2017. https://doi.org/10.1145/3087556.
ieee: C. Scheideler and M. Taghi Hajiaghayi, Eds., Proceedings of the 29th ACM
Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington
DC, USA, July 24-26, 2017. 2017.
mla: Scheideler, Christian, and Mohammad Taghi Hajiaghayi, editors. Proceedings
of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA
2017, Washington DC, USA, July 24-26, 2017. 2017, doi:10.1145/3087556.
short: C. Scheideler, M. Taghi Hajiaghayi, eds., Proceedings of the 29th ACM Symposium
on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA,
July 24-26, 2017, 2017.
date_created: 2018-03-27T11:29:10Z
date_updated: 2022-01-06T06:53:27Z
department:
- _id: '79'
doi: 10.1145/3087556
editor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Mohammad
full_name: Taghi Hajiaghayi, Mohammad
last_name: Taghi Hajiaghayi
publication_identifier:
isbn:
- 978-1-4503-4593-4
status: public
title: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures,
SPAA 2017, Washington DC, USA, July 24-26, 2017
type: conference_editor
user_id: '15504'
year: '2017'
...
---
_id: '81'
author:
- first_name: Linghui
full_name: Luo, Linghui
last_name: Luo
citation:
ama: 'Luo L. MultiSkipList: A Self-Stabilizing Overlay Network with Monotonic
Searchability Maintained. Universität Paderborn; 2017.'
apa: 'Luo, L. (2017). MultiSkipList: A Self-stabilizing Overlay Network with
Monotonic Searchability maintained. Universität Paderborn.'
bibtex: '@book{Luo_2017, title={MultiSkipList: A Self-stabilizing Overlay Network
with Monotonic Searchability maintained}, publisher={Universität Paderborn}, author={Luo,
Linghui}, year={2017} }'
chicago: 'Luo, Linghui. MultiSkipList: A Self-Stabilizing Overlay Network with
Monotonic Searchability Maintained. Universität Paderborn, 2017.'
ieee: 'L. Luo, MultiSkipList: A Self-stabilizing Overlay Network with Monotonic
Searchability maintained. Universität Paderborn, 2017.'
mla: 'Luo, Linghui. MultiSkipList: A Self-Stabilizing Overlay Network with Monotonic
Searchability Maintained. Universität Paderborn, 2017.'
short: 'L. Luo, MultiSkipList: A Self-Stabilizing Overlay Network with Monotonic
Searchability Maintained, Universität Paderborn, 2017.'
date_created: 2017-10-17T12:41:07Z
date_updated: 2022-01-06T07:03:50Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: 'MultiSkipList: A Self-stabilizing Overlay Network with Monotonic Searchability
maintained'
type: mastersthesis
user_id: '477'
year: '2017'
...
---
_id: '5980'
citation:
ama: Scheideler C, Taghi Hajiaghayi M, eds. Proceedings of the 29th ACM Symposium
on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA,
July 24-26, 2017. ACM; 2017. doi:10.1145/3087556
apa: Scheideler, C., & Taghi Hajiaghayi, M. (Eds.). (2017). Proceedings of
the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017,
Washington DC, USA, July 24-26, 2017. ACM. https://doi.org/10.1145/3087556
bibtex: '@book{Scheideler_Taghi Hajiaghayi_2017, title={Proceedings of the 29th
ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington
DC, USA, July 24-26, 2017}, DOI={10.1145/3087556},
publisher={ACM}, year={2017} }'
chicago: Scheideler, Christian, and Mohammad Taghi Hajiaghayi, eds. Proceedings
of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA
2017, Washington DC, USA, July 24-26, 2017. ACM, 2017. https://doi.org/10.1145/3087556.
ieee: C. Scheideler and M. Taghi Hajiaghayi, Eds., Proceedings of the 29th ACM
Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington
DC, USA, July 24-26, 2017. ACM, 2017.
mla: Scheideler, Christian, and Mohammad Taghi Hajiaghayi, editors. Proceedings
of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA
2017, Washington DC, USA, July 24-26, 2017. ACM, 2017, doi:10.1145/3087556.
short: C. Scheideler, M. Taghi Hajiaghayi, eds., Proceedings of the 29th ACM Symposium
on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA,
July 24-26, 2017, ACM, 2017.
date_created: 2018-11-29T10:23:12Z
date_updated: 2022-01-06T07:02:48Z
department:
- _id: '7'
- _id: '79'
doi: 10.1145/3087556
editor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Mohammad
full_name: Taghi Hajiaghayi, Mohammad
last_name: Taghi Hajiaghayi
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication_identifier:
isbn:
- 978-1-4503-4593-4
publisher: ACM
status: public
title: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures,
SPAA 2017, Washington DC, USA, July 24-26, 2017
type: conference_editor
user_id: '477'
year: '2017'
...
---
_id: '61'
author:
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
citation:
ama: Strothmann TF. Self-* Algorithms for Distributed Systems. Universität
Paderborn; 2017. doi:10.17619/UNIPB/1-150
apa: Strothmann, T. F. (2017). Self-* Algorithms for Distributed Systems.
Universität Paderborn. https://doi.org/10.17619/UNIPB/1-150
bibtex: '@book{Strothmann_2017, title={Self-* Algorithms for Distributed Systems},
DOI={10.17619/UNIPB/1-150},
publisher={Universität Paderborn}, author={Strothmann, Thim Frederik}, year={2017}
}'
chicago: Strothmann, Thim Frederik. Self-* Algorithms for Distributed Systems.
Universität Paderborn, 2017. https://doi.org/10.17619/UNIPB/1-150.
ieee: T. F. Strothmann, Self-* Algorithms for Distributed Systems. Universität
Paderborn, 2017.
mla: Strothmann, Thim Frederik. Self-* Algorithms for Distributed Systems.
Universität Paderborn, 2017, doi:10.17619/UNIPB/1-150.
short: T.F. Strothmann, Self-* Algorithms for Distributed Systems, Universität Paderborn,
2017.
date_created: 2017-10-17T12:41:03Z
date_updated: 2022-01-06T07:02:52Z
department:
- _id: '79'
doi: 10.17619/UNIPB/1-150
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Self-* Algorithms for Distributed Systems
type: dissertation
user_id: '477'
year: '2017'
...
---
_id: '699'
author:
- first_name: Jannik
full_name: Sundermeier, Jannik
id: '38705'
last_name: Sundermeier
citation:
ama: Sundermeier J. Routing in Hybrid Communication Networks with Holes - Considering
Bounding Boxes as Hole Abstractions. Universität Paderborn; 2017.
apa: Sundermeier, J. (2017). Routing in Hybrid Communication Networks with Holes
- Considering Bounding Boxes as Hole Abstractions. Universität Paderborn.
bibtex: '@book{Sundermeier_2017, title={Routing in Hybrid Communication Networks
with Holes - Considering Bounding Boxes as Hole Abstractions}, publisher={Universität
Paderborn}, author={Sundermeier, Jannik}, year={2017} }'
chicago: Sundermeier, Jannik. Routing in Hybrid Communication Networks with Holes
- Considering Bounding Boxes as Hole Abstractions. Universität Paderborn,
2017.
ieee: J. Sundermeier, Routing in Hybrid Communication Networks with Holes - Considering
Bounding Boxes as Hole Abstractions. Universität Paderborn, 2017.
mla: Sundermeier, Jannik. Routing in Hybrid Communication Networks with Holes
- Considering Bounding Boxes as Hole Abstractions. Universität Paderborn,
2017.
short: J. Sundermeier, Routing in Hybrid Communication Networks with Holes - Considering
Bounding Boxes as Hole Abstractions, Universität Paderborn, 2017.
date_created: 2017-11-14T08:03:45Z
date_updated: 2022-01-06T07:03:25Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Routing in Hybrid Communication Networks with Holes - Considering Bounding
Boxes as Hole Abstractions
type: mastersthesis
user_id: '38705'
year: '2017'
...