---
_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: '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: '25105'
author:
- first_name: Shlomi
full_name: Dolev, Shlomi
last_name: Dolev
- first_name: Ram
full_name: Prasadh Narayanan, Ram
last_name: Prasadh Narayanan
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
citation:
ama: 'Dolev S, Prasadh Narayanan R, Scheideler C, Schindelhauer C. Logarithmic Time
MIMO Based Self-Stabilizing Clock Synchronization. In: Galluccio L, Mitra U, Magarini
M, Abada S, Taynnan Barros M, Krishnaswamy B, eds. NANOCOM ’21: The Eighth
Annual ACM International Conference on Nanoscale Computing and Communication,
Virtual Event, Italy, September 7 - 9, 2021. ACM; 2021:30:1-30:2. doi:10.1145/3477206.3477471'
apa: 'Dolev, S., Prasadh Narayanan, R., Scheideler, C., & Schindelhauer, C.
(2021). Logarithmic Time MIMO Based Self-Stabilizing Clock Synchronization. In
L. Galluccio, U. Mitra, M. Magarini, S. Abada, M. Taynnan Barros, & B. Krishnaswamy
(Eds.), NANOCOM ’21: The Eighth Annual ACM International Conference on Nanoscale
Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021 (p.
30:1-30:2). ACM. https://doi.org/10.1145/3477206.3477471'
bibtex: '@inproceedings{Dolev_Prasadh Narayanan_Scheideler_Schindelhauer_2021, title={Logarithmic
Time MIMO Based Self-Stabilizing Clock Synchronization}, DOI={10.1145/3477206.3477471},
booktitle={NANOCOM ’21: The Eighth Annual ACM International Conference on Nanoscale
Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021}, publisher={ACM},
author={Dolev, Shlomi and Prasadh Narayanan, Ram and Scheideler, Christian and
Schindelhauer, Christian}, editor={Galluccio, Laura and Mitra, Urbashi and Magarini,
Maurizio and Abada, Sergi and Taynnan Barros, Michael and Krishnaswamy, Bhuvana},
year={2021}, pages={30:1-30:2} }'
chicago: 'Dolev, Shlomi, Ram Prasadh Narayanan, Christian Scheideler, and Christian
Schindelhauer. “Logarithmic Time MIMO Based Self-Stabilizing Clock Synchronization.”
In NANOCOM ’21: The Eighth Annual ACM International Conference on Nanoscale
Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021,
edited by Laura Galluccio, Urbashi Mitra, Maurizio Magarini, Sergi Abada, Michael
Taynnan Barros, and Bhuvana Krishnaswamy, 30:1-30:2. ACM, 2021. https://doi.org/10.1145/3477206.3477471.'
ieee: 'S. Dolev, R. Prasadh Narayanan, C. Scheideler, and C. Schindelhauer, “Logarithmic
Time MIMO Based Self-Stabilizing Clock Synchronization,” in NANOCOM ’21: The
Eighth Annual ACM International Conference on Nanoscale Computing and Communication,
Virtual Event, Italy, September 7 - 9, 2021, 2021, p. 30:1-30:2, doi: 10.1145/3477206.3477471.'
mla: 'Dolev, Shlomi, et al. “Logarithmic Time MIMO Based Self-Stabilizing Clock
Synchronization.” NANOCOM ’21: The Eighth Annual ACM International Conference
on Nanoscale Computing and Communication, Virtual Event, Italy, September 7 -
9, 2021, edited by Laura Galluccio et al., ACM, 2021, p. 30:1-30:2, doi:10.1145/3477206.3477471.'
short: 'S. Dolev, R. Prasadh Narayanan, C. Scheideler, C. Schindelhauer, in: L.
Galluccio, U. Mitra, M. Magarini, S. Abada, M. Taynnan Barros, B. Krishnaswamy
(Eds.), NANOCOM ’21: The Eighth Annual ACM International Conference on Nanoscale
Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021, ACM,
2021, p. 30:1-30:2.'
date_created: 2021-09-29T09:09:58Z
date_updated: 2022-01-06T06:56:51Z
doi: 10.1145/3477206.3477471
editor:
- first_name: Laura
full_name: Galluccio, Laura
last_name: Galluccio
- first_name: Urbashi
full_name: Mitra, Urbashi
last_name: Mitra
- first_name: Maurizio
full_name: Magarini, Maurizio
last_name: Magarini
- first_name: Sergi
full_name: Abada, Sergi
last_name: Abada
- first_name: Michael
full_name: Taynnan Barros, Michael
last_name: Taynnan Barros
- first_name: Bhuvana
full_name: Krishnaswamy, Bhuvana
last_name: Krishnaswamy
language:
- iso: eng
page: 30:1-30:2
publication: 'NANOCOM ''21: The Eighth Annual ACM International Conference on Nanoscale
Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021'
publisher: ACM
status: public
title: Logarithmic Time MIMO Based Self-Stabilizing Clock Synchronization
type: conference
user_id: '15504'
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: '27048'
author:
- first_name: Shlomi
full_name: Dolev, Shlomi
last_name: Dolev
- first_name: Ram
full_name: Prasadh Narayanan, Ram
last_name: Prasadh Narayanan
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
citation:
ama: 'Dolev S, Prasadh Narayanan R, Scheideler C, Schindelhauer C. Logarithmic Time
MIMO Based Self-Stabilizing Clock Synchronization. In: Galluccio L, Mitra U, Magarini
M, Abada S, Taynnan Barros M, Krishnaswamy B, eds. NANOCOM ’21: The Eighth
Annual ACM International Conference on Nanoscale Computing and Communication,
Virtual Event, Italy, September 7 - 9, 2021. ACM; 2021:30:1-30:2. doi:10.1145/3477206.3477471'
apa: 'Dolev, S., Prasadh Narayanan, R., Scheideler, C., & Schindelhauer, C.
(2021). Logarithmic Time MIMO Based Self-Stabilizing Clock Synchronization. In
L. Galluccio, U. Mitra, M. Magarini, S. Abada, M. Taynnan Barros, & B. Krishnaswamy
(Eds.), NANOCOM ’21: The Eighth Annual ACM International Conference on Nanoscale
Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021 (p.
30:1-30:2). ACM. https://doi.org/10.1145/3477206.3477471'
bibtex: '@inproceedings{Dolev_Prasadh Narayanan_Scheideler_Schindelhauer_2021, title={Logarithmic
Time MIMO Based Self-Stabilizing Clock Synchronization}, DOI={10.1145/3477206.3477471},
booktitle={NANOCOM ’21: The Eighth Annual ACM International Conference on Nanoscale
Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021}, publisher={ACM},
author={Dolev, Shlomi and Prasadh Narayanan, Ram and Scheideler, Christian and
Schindelhauer, Christian}, editor={Galluccio, Laura and Mitra, Urbashi and Magarini,
Maurizio and Abada, Sergi and Taynnan Barros, Michael and Krishnaswamy, Bhuvana},
year={2021}, pages={30:1-30:2} }'
chicago: 'Dolev, Shlomi, Ram Prasadh Narayanan, Christian Scheideler, and Christian
Schindelhauer. “Logarithmic Time MIMO Based Self-Stabilizing Clock Synchronization.”
In NANOCOM ’21: The Eighth Annual ACM International Conference on Nanoscale
Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021,
edited by Laura Galluccio, Urbashi Mitra, Maurizio Magarini, Sergi Abada, Michael
Taynnan Barros, and Bhuvana Krishnaswamy, 30:1-30:2. ACM, 2021. https://doi.org/10.1145/3477206.3477471.'
ieee: 'S. Dolev, R. Prasadh Narayanan, C. Scheideler, and C. Schindelhauer, “Logarithmic
Time MIMO Based Self-Stabilizing Clock Synchronization,” in NANOCOM ’21: The
Eighth Annual ACM International Conference on Nanoscale Computing and Communication,
Virtual Event, Italy, September 7 - 9, 2021, 2021, p. 30:1-30:2, doi: 10.1145/3477206.3477471.'
mla: 'Dolev, Shlomi, et al. “Logarithmic Time MIMO Based Self-Stabilizing Clock
Synchronization.” NANOCOM ’21: The Eighth Annual ACM International Conference
on Nanoscale Computing and Communication, Virtual Event, Italy, September 7 -
9, 2021, edited by Laura Galluccio et al., ACM, 2021, p. 30:1-30:2, doi:10.1145/3477206.3477471.'
short: 'S. Dolev, R. Prasadh Narayanan, C. Scheideler, C. Schindelhauer, in: L.
Galluccio, U. Mitra, M. Magarini, S. Abada, M. Taynnan Barros, B. Krishnaswamy
(Eds.), NANOCOM ’21: The Eighth Annual ACM International Conference on Nanoscale
Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021, ACM,
2021, p. 30:1-30:2.'
date_created: 2021-11-02T09:57:53Z
date_updated: 2022-01-06T06:57:33Z
doi: 10.1145/3477206.3477471
editor:
- first_name: Laura
full_name: Galluccio, Laura
last_name: Galluccio
- first_name: Urbashi
full_name: Mitra, Urbashi
last_name: Mitra
- first_name: Maurizio
full_name: Magarini, Maurizio
last_name: Magarini
- first_name: Sergi
full_name: Abada, Sergi
last_name: Abada
- first_name: Michael
full_name: Taynnan Barros, Michael
last_name: Taynnan Barros
- first_name: Bhuvana
full_name: Krishnaswamy, Bhuvana
last_name: Krishnaswamy
language:
- iso: eng
page: 30:1-30:2
publication: 'NANOCOM ''21: The Eighth Annual ACM International Conference on Nanoscale
Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021'
publisher: ACM
status: public
title: Logarithmic Time MIMO Based Self-Stabilizing Clock Synchronization
type: conference
user_id: '15504'
year: '2021'
...
---
_id: '27050'
author:
- first_name: Joshua
full_name: J. Daymude, Joshua
last_name: J. Daymude
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'J. Daymude J, W. Richa A, Scheideler C. The Canonical Amoebot Model: Algorithms
and Concurrency Control. In: Gilbert S, ed. 35th International Symposium on
Distributed Computing, DISC 2021, October 4-8, 2021, Freiburg, Germany (Virtual
Conference). Vol 209. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik;
2021:20:1-20:19. doi:10.4230/LIPIcs.DISC.2021.20'
apa: 'J. Daymude, J., W. Richa, A., & Scheideler, C. (2021). The Canonical Amoebot
Model: Algorithms and Concurrency Control. In S. Gilbert (Ed.), 35th International
Symposium on Distributed Computing, DISC 2021, October 4-8, 2021, Freiburg, Germany
(Virtual Conference) (Vol. 209, p. 20:1-20:19). Schloss Dagstuhl - Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPIcs.DISC.2021.20'
bibtex: '@inproceedings{J. Daymude_W. Richa_Scheideler_2021, series={LIPIcs}, title={The
Canonical Amoebot Model: Algorithms and Concurrency Control}, volume={209}, DOI={10.4230/LIPIcs.DISC.2021.20},
booktitle={35th International Symposium on Distributed Computing, DISC 2021, October
4-8, 2021, Freiburg, Germany (Virtual Conference)}, publisher={Schloss Dagstuhl
- Leibniz-Zentrum für Informatik}, author={J. Daymude, Joshua and W. Richa, Andrea
and Scheideler, Christian}, editor={Gilbert, Seth}, year={2021}, pages={20:1-20:19},
collection={LIPIcs} }'
chicago: 'J. Daymude, Joshua, Andrea W. Richa, and Christian Scheideler. “The Canonical
Amoebot Model: Algorithms and Concurrency Control.” In 35th International Symposium
on Distributed Computing, DISC 2021, October 4-8, 2021, Freiburg, Germany (Virtual
Conference), edited by Seth Gilbert, 209:20:1-20:19. LIPIcs. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.DISC.2021.20.'
ieee: 'J. J. Daymude, A. W. Richa, and C. Scheideler, “The Canonical Amoebot Model:
Algorithms and Concurrency Control,” in 35th International Symposium on Distributed
Computing, DISC 2021, October 4-8, 2021, Freiburg, Germany (Virtual Conference),
2021, vol. 209, p. 20:1-20:19, doi: 10.4230/LIPIcs.DISC.2021.20.'
mla: 'J. Daymude, Joshua, et al. “The Canonical Amoebot Model: Algorithms and Concurrency
Control.” 35th International Symposium on Distributed Computing, DISC 2021,
October 4-8, 2021, Freiburg, Germany (Virtual Conference), edited by Seth
Gilbert, vol. 209, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, p.
20:1-20:19, doi:10.4230/LIPIcs.DISC.2021.20.'
short: 'J. J. Daymude, A. W. Richa, C. Scheideler, in: S. Gilbert (Ed.), 35th International
Symposium on Distributed Computing, DISC 2021, October 4-8, 2021, Freiburg, Germany
(Virtual Conference), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021,
p. 20:1-20:19.'
date_created: 2021-11-02T10:00:00Z
date_updated: 2022-01-06T06:57:33Z
doi: 10.4230/LIPIcs.DISC.2021.20
editor:
- first_name: Seth
full_name: Gilbert, Seth
last_name: Gilbert
intvolume: ' 209'
language:
- iso: eng
page: 20:1-20:19
publication: 35th International Symposium on Distributed Computing, DISC 2021, October
4-8, 2021, Freiburg, Germany (Virtual Conference)
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
series_title: LIPIcs
status: public
title: 'The Canonical Amoebot Model: Algorithms and Concurrency Control'
type: conference
user_id: '15504'
volume: 209
year: '2021'
...
---
_id: '22283'
abstract:
- lang: eng
text: " We show how to construct an overlay network of constant degree and diameter
$O(\\log n)$ in time $O(\\log n)$ starting from an arbitrary weakly connected
graph.\r\n We assume a synchronous communication network in which nodes can
send messages to nodes they know the identifier of and establish new connections
by sending node identifiers.\r\n If the initial network's graph is weakly connected
and has constant degree, then our algorithm constructs the desired topology with
each node sending and receiving only $O(\\log n)$ messages in each round in time
$O(\\log n)$, w.h.p., which beats the currently best $O(\\log^{3/2} n)$ time algorithm
of [Götte et al., SIROCCO'19].\r\n Since the problem cannot be solved faster
than by using pointer jumping for $O(\\log n)$ rounds (which would even require
each node to communicate $\\Omega(n)$ bits), our algorithm is asymptotically optimal.\r\n
\ We achieve this speedup by using short random walks to repeatedly establish
random connections between the nodes that quickly reduce the conductance of the
graph using an observation of [Kwok and Lau, APPROX'14].\r\n \r\n Additionally,
we show how our algorithm can be used to efficiently solve graph problems in \\emph{hybrid
networks} [Augustine et al., SODA'20].\r\n Motivated by the idea that nodes
possess two different modes of communication, we assume that communication of
the \\emph{initial} edges is unrestricted. In contrast, only polylogarithmically
many messages can be communicated over edges that have been established throughout
an algorithm's execution.\r\n For an (undirected) graph $G$ with arbitrary
degree, we show how to compute connected components, a spanning tree, and biconnected
components in time $O(\\log n)$, w.h.p.\r\n Furthermore, we show how to compute
an MIS in time $O(\\log d + \\log \\log n)$, w.h.p., where $d$ is the initial
degree of $G$."
author:
- first_name: Thorsten
full_name: Götte, Thorsten
id: '34727'
last_name: Götte
- 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: Julian
full_name: Werthmann, Julian
id: '50024'
last_name: Werthmann
citation:
ama: 'Götte T, Hinnenthal K, Scheideler C, Werthmann J. Time-Optimal Construction
of Overlays. In: Censor-Hillel K, ed. Proc. of the 40th ACM Symposium on Principles
of Distributed Computing (PODC ’21). New York: ACM. doi:10.1145/3465084.3467932'
apa: 'Götte, T., Hinnenthal, K., Scheideler, C., & Werthmann, J. (n.d.). Time-Optimal
Construction of Overlays. In K. Censor-Hillel (Ed.), Proc. of the 40th ACM
Symposium on Principles of Distributed Computing (PODC ’21). New York: ACM.
https://doi.org/10.1145/3465084.3467932'
bibtex: '@inproceedings{Götte_Hinnenthal_Scheideler_Werthmann, place={New York},
title={Time-Optimal Construction of Overlays}, DOI={10.1145/3465084.3467932},
booktitle={Proc. of the 40th ACM Symposium on Principles of Distributed Computing
(PODC ’21)}, publisher={ACM}, author={Götte, Thorsten and Hinnenthal, Kristian
and Scheideler, Christian and Werthmann, Julian}, editor={Censor-Hillel, KerenEditor}
}'
chicago: 'Götte, Thorsten, Kristian Hinnenthal, Christian Scheideler, and Julian
Werthmann. “Time-Optimal Construction of Overlays.” In Proc. of the 40th ACM
Symposium on Principles of Distributed Computing (PODC ’21), edited by Keren
Censor-Hillel. New York: ACM, n.d. https://doi.org/10.1145/3465084.3467932.'
ieee: T. Götte, K. Hinnenthal, C. Scheideler, and J. Werthmann, “Time-Optimal Construction
of Overlays,” in Proc. of the 40th ACM Symposium on Principles of Distributed
Computing (PODC ’21), Virtual.
mla: Götte, Thorsten, et al. “Time-Optimal Construction of Overlays.” Proc. of
the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21),
edited by Keren Censor-Hillel, ACM, doi:10.1145/3465084.3467932.
short: 'T. Götte, K. Hinnenthal, C. Scheideler, J. Werthmann, in: K. Censor-Hillel
(Ed.), Proc. of the 40th ACM Symposium on Principles of Distributed Computing
(PODC ’21), ACM, New York, n.d.'
conference:
end_date: 2021-07-30
location: Virtual
name: ACM Symposium on Principles of Distributed Computing (PODC)
start_date: 2021-07-26
date_created: 2021-06-06T19:10:26Z
date_updated: 2022-01-06T06:55:30Z
ddc:
- '000'
department:
- _id: '34'
doi: 10.1145/3465084.3467932
editor:
- first_name: Keren
full_name: Censor-Hillel, Keren
last_name: Censor-Hillel
file:
- access_level: closed
content_type: application/pdf
creator: thgoette
date_created: 2021-06-06T19:12:49Z
date_updated: 2021-06-06T19:12:49Z
file_id: '22284'
file_name: Wicked_Fast_Overlay_Construction(1).pdf
file_size: 590875
relation: main_file
success: 1
file_date_updated: 2021-06-06T19:12:49Z
has_accepted_license: '1'
language:
- iso: eng
place: New York
project:
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
- _id: '1'
name: SFB 901
publication: Proc. of the 40th ACM Symposium on Principles of Distributed Computing
(PODC '21)
publication_status: accepted
publisher: ACM
status: public
title: Time-Optimal Construction of Overlays
type: conference
user_id: '477'
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: '26888'
author:
- first_name: Thorsten
full_name: Götte, Thorsten
id: '34727'
last_name: Götte
- 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: 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. In: Algorithms for Sensor Systems (ALGOSENSORS ’21).
; 2021. doi:10.1007/978-3-030-89240-1_7'
apa: 'Götte, T., Kolb, C., Scheideler, C., & Werthmann, J. (2021). Beep-And-Sleep:
Message and Energy Efficient Set Cover. In Algorithms for Sensor Systems (ALGOSENSORS
’21). ALGOSENSORS 2021, Lisbon, Portgual. https://doi.org/10.1007/978-3-030-89240-1_7'
bibtex: '@inbook{Götte_Kolb_Scheideler_Werthmann_2021, place={Cham}, title={Beep-And-Sleep:
Message and Energy Efficient Set Cover}, DOI={10.1007/978-3-030-89240-1_7},
booktitle={Algorithms for Sensor Systems (ALGOSENSORS ’21)}, author={Götte, Thorsten
and Kolb, Christina and Scheideler, Christian and Werthmann, Julian}, year={2021}
}'
chicago: 'Götte, Thorsten, Christina Kolb, Christian Scheideler, and Julian Werthmann.
“Beep-And-Sleep: Message and Energy Efficient Set Cover.” In Algorithms for
Sensor Systems (ALGOSENSORS ’21). Cham, 2021. https://doi.org/10.1007/978-3-030-89240-1_7.'
ieee: 'T. Götte, C. Kolb, C. Scheideler, and J. Werthmann, “Beep-And-Sleep: Message
and Energy Efficient Set Cover,” in Algorithms for Sensor Systems (ALGOSENSORS
’21), Cham, 2021.'
mla: 'Götte, Thorsten, et al. “Beep-And-Sleep: Message and Energy Efficient Set
Cover.” Algorithms for Sensor Systems (ALGOSENSORS ’21), 2021, doi:10.1007/978-3-030-89240-1_7.'
short: 'T. Götte, C. Kolb, C. Scheideler, J. Werthmann, in: Algorithms for Sensor
Systems (ALGOSENSORS ’21), Cham, 2021.'
conference:
location: Lisbon, Portgual
name: ALGOSENSORS 2021
date_created: 2021-10-26T12:06:04Z
date_updated: 2022-11-18T10:01:36Z
doi: 10.1007/978-3-030-89240-1_7
language:
- iso: eng
place: Cham
project:
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '1'
name: 'SFB 901: SFB 901'
publication: Algorithms for Sensor Systems (ALGOSENSORS '21)
publication_identifier:
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: 'Beep-And-Sleep: Message and Energy Efficient Set Cover'
type: book_chapter
user_id: '477'
year: '2021'
...
---
_id: '27051'
author:
- first_name: John
full_name: Augustine, John
last_name: Augustine
- first_name: Kristian
full_name: Hinnenthal, Kristian
id: '32229'
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
citation:
ama: 'Augustine J, Hinnenthal K, Kuhn F, Scheideler C, Schneider P. Shortest Paths
in a Hybrid Network Model. In: Chawla S, ed. Proceedings of the 2020 ACM-SIAM
Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January
5-8, 2020. SIAM; 2020:1280-1299. doi:10.1137/1.9781611975994.78'
apa: Augustine, J., Hinnenthal, K., Kuhn, F., Scheideler, C., & Schneider, P.
(2020). Shortest Paths in a Hybrid Network Model. In S. Chawla (Ed.), Proceedings
of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City,
UT, USA, January 5-8, 2020 (pp. 1280–1299). SIAM. https://doi.org/10.1137/1.9781611975994.78
bibtex: '@inproceedings{Augustine_Hinnenthal_Kuhn_Scheideler_Schneider_2020, title={Shortest
Paths in a Hybrid Network Model}, DOI={10.1137/1.9781611975994.78},
booktitle={Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms,
SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020}, publisher={SIAM}, author={Augustine,
John and Hinnenthal, Kristian and Kuhn, Fabian and Scheideler, Christian and Schneider,
Philipp}, editor={Chawla, Shuchi}, year={2020}, pages={1280–1299} }'
chicago: Augustine, John, Kristian Hinnenthal, Fabian Kuhn, Christian Scheideler,
and Philipp Schneider. “Shortest Paths in a Hybrid Network Model.” In Proceedings
of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City,
UT, USA, January 5-8, 2020, edited by Shuchi Chawla, 1280–99. SIAM, 2020.
https://doi.org/10.1137/1.9781611975994.78.
ieee: 'J. Augustine, K. Hinnenthal, F. Kuhn, C. Scheideler, and P. Schneider, “Shortest
Paths in a Hybrid Network Model,” in Proceedings of the 2020 ACM-SIAM Symposium
on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020,
2020, pp. 1280–1299, doi: 10.1137/1.9781611975994.78.'
mla: Augustine, John, et al. “Shortest Paths in a Hybrid Network Model.” Proceedings
of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City,
UT, USA, January 5-8, 2020, edited by Shuchi Chawla, SIAM, 2020, pp. 1280–99,
doi:10.1137/1.9781611975994.78.
short: 'J. Augustine, K. Hinnenthal, F. Kuhn, C. Scheideler, P. Schneider, in: S.
Chawla (Ed.), Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms,
SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020, SIAM, 2020, pp. 1280–1299.'
date_created: 2021-11-02T10:01:42Z
date_updated: 2022-01-06T06:57:33Z
doi: 10.1137/1.9781611975994.78
editor:
- first_name: Shuchi
full_name: Chawla, Shuchi
last_name: Chawla
language:
- iso: eng
page: 1280-1299
publication: Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA
2020, Salt Lake City, UT, USA, January 5-8, 2020
publisher: SIAM
status: public
title: Shortest Paths in a Hybrid Network Model
type: conference
user_id: '15504'
year: '2020'
...
---
_id: '17808'
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
full_name: Strothmann, Thim
last_name: Strothmann
citation:
ama: Gmyr R, Hinnenthal K, Kostitsyna I, et al. Forming tile shapes with simple
robots. Nat Comput. 2020;19(2):375-390. doi:10.1007/s11047-019-09774-2
apa: Gmyr, R., Hinnenthal, K., Kostitsyna, I., Kuhn, F., Rudolph, D., Scheideler,
C., & Strothmann, T. (2020). Forming tile shapes with simple robots. Nat.
Comput., 19(2), 375–390. https://doi.org/10.1007/s11047-019-09774-2
bibtex: '@article{Gmyr_Hinnenthal_Kostitsyna_Kuhn_Rudolph_Scheideler_Strothmann_2020,
title={Forming tile shapes with simple robots}, volume={19}, DOI={10.1007/s11047-019-09774-2},
number={2}, journal={Nat. Comput.}, author={Gmyr, Robert and Hinnenthal, Kristian
and Kostitsyna, Irina and Kuhn, Fabian and Rudolph, Dorian and Scheideler, Christian
and Strothmann, Thim}, year={2020}, pages={375–390} }'
chicago: 'Gmyr, Robert, Kristian Hinnenthal, Irina Kostitsyna, Fabian Kuhn, Dorian
Rudolph, Christian Scheideler, and Thim Strothmann. “Forming Tile Shapes with
Simple Robots.” Nat. Comput. 19, no. 2 (2020): 375–90. https://doi.org/10.1007/s11047-019-09774-2.'
ieee: R. Gmyr et al., “Forming tile shapes with simple robots,” Nat. Comput.,
vol. 19, no. 2, pp. 375–390, 2020.
mla: Gmyr, Robert, et al. “Forming Tile Shapes with Simple Robots.” Nat. Comput.,
vol. 19, no. 2, 2020, pp. 375–90, doi:10.1007/s11047-019-09774-2.
short: R. Gmyr, K. Hinnenthal, I. Kostitsyna, F. Kuhn, D. Rudolph, C. Scheideler,
T. Strothmann, Nat. Comput. 19 (2020) 375–390.
date_created: 2020-08-11T10:57:26Z
date_updated: 2022-01-06T06:53:20Z
doi: 10.1007/s11047-019-09774-2
intvolume: ' 19'
issue: '2'
language:
- iso: eng
page: 375-390
publication: Nat. Comput.
status: public
title: Forming tile shapes with simple robots
type: journal_article
user_id: '15504'
volume: 19
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: '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: '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: '16346'
author:
- first_name: Joshua J.
full_name: Daymude, Joshua J.
last_name: Daymude
- 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: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Andréa W.
full_name: Richa, Andréa W.
last_name: Richa
citation:
ama: 'Daymude JJ, Gmyr R, Hinnenthal K, Kostitsyna I, Scheideler C, Richa AW. Convex
Hull Formation for Programmable Matter. In: Proceedings of the 21st International
Conference on Distributed Computing and Networking. ; 2020. doi:10.1145/3369740.3372916'
apa: Daymude, J. J., Gmyr, R., Hinnenthal, K., Kostitsyna, I., Scheideler, C., &
Richa, A. W. (2020). Convex Hull Formation for Programmable Matter. In Proceedings
of the 21st International Conference on Distributed Computing and Networking.
https://doi.org/10.1145/3369740.3372916
bibtex: '@inproceedings{Daymude_Gmyr_Hinnenthal_Kostitsyna_Scheideler_Richa_2020,
title={Convex Hull Formation for Programmable Matter}, DOI={10.1145/3369740.3372916},
booktitle={Proceedings of the 21st International Conference on Distributed Computing
and Networking}, author={Daymude, Joshua J. and Gmyr, Robert and Hinnenthal, Kristian
and Kostitsyna, Irina and Scheideler, Christian and Richa, Andréa W.}, year={2020}
}'
chicago: Daymude, Joshua J., Robert Gmyr, Kristian Hinnenthal, Irina Kostitsyna,
Christian Scheideler, and Andréa W. Richa. “Convex Hull Formation for Programmable
Matter.” In Proceedings of the 21st International Conference on Distributed
Computing and Networking, 2020. https://doi.org/10.1145/3369740.3372916.
ieee: J. J. Daymude, R. Gmyr, K. Hinnenthal, I. Kostitsyna, C. Scheideler, and A.
W. Richa, “Convex Hull Formation for Programmable Matter,” in Proceedings of
the 21st International Conference on Distributed Computing and Networking,
2020.
mla: Daymude, Joshua J., et al. “Convex Hull Formation for Programmable Matter.”
Proceedings of the 21st International Conference on Distributed Computing and
Networking, 2020, doi:10.1145/3369740.3372916.
short: 'J.J. Daymude, R. Gmyr, K. Hinnenthal, I. Kostitsyna, C. Scheideler, A.W.
Richa, in: Proceedings of the 21st International Conference on Distributed Computing
and Networking, 2020.'
date_created: 2020-03-26T07:33:41Z
date_updated: 2022-01-06T06:52:49Z
doi: 10.1145/3369740.3372916
language:
- iso: eng
publication: Proceedings of the 21st International Conference on Distributed Computing
and Networking
publication_identifier:
isbn:
- '9781450377515'
publication_status: published
status: public
title: Convex Hull Formation for Programmable Matter
type: conference
user_id: '32229'
year: '2020'
...
---
_id: '7636'
abstract:
- lang: eng
text: "Self-stabilizing overlay networks have the advantage of being able to recover
from illegal states and faults. \r\nHowever, the majority of these networks cannot
give any guarantees on their functionality while the recovery process is going
on. \r\nWe are especially interested in searchability, i.e., the functionality
that search messages for a specific node are answered successfully if a node exists
in the network. \r\nIn this paper we investigate overlay networks that ensure
the maintenance of monotonic searchability while the self-stabilization is going
on. \r\nMore precisely, once a search message from node u to another node v is
successfully delivered, all future search messages from u to v succeed as well.\r\nWe
extend the existing research by focusing on skip graphs and present a solution
for two scenarios: (i) the goal topology is a super graph of the perfect skip
graph and (ii) the goal topology is exactly the perfect skip graph.\r\n"
author:
- first_name: Linghui
full_name: Luo, Linghui
last_name: Luo
- 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: 'Luo L, Scheideler C, Strothmann TF. MultiSkipGraph: A Self-stabilizing Overlay
Network that Maintains Monotonic Searchability. In: Proceedings of the 2019
IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19).
; 2019.'
apa: 'Luo, L., Scheideler, C., & Strothmann, T. F. (2019). MultiSkipGraph: A
Self-stabilizing Overlay Network that Maintains Monotonic Searchability. In Proceedings
of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium
(IPDPS ’19). Rio de Janeiro, Brazil.'
bibtex: '@inproceedings{Luo_Scheideler_Strothmann_2019, title={MultiSkipGraph: A
Self-stabilizing Overlay Network that Maintains Monotonic Searchability}, booktitle={Proceedings
of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium
(IPDPS ’19)}, author={Luo, Linghui and Scheideler, Christian and Strothmann, Thim
Frederik}, year={2019} }'
chicago: 'Luo, Linghui, Christian Scheideler, and Thim Frederik Strothmann. “MultiSkipGraph:
A Self-Stabilizing Overlay Network That Maintains Monotonic Searchability.” In
Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing
Symposium (IPDPS ’19), 2019.'
ieee: 'L. Luo, C. Scheideler, and T. F. Strothmann, “MultiSkipGraph: A Self-stabilizing
Overlay Network that Maintains Monotonic Searchability,” in Proceedings of
the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium
(IPDPS ’19), Rio de Janeiro, Brazil, 2019.'
mla: 'Luo, Linghui, et al. “MultiSkipGraph: A Self-Stabilizing Overlay Network That
Maintains Monotonic Searchability.” Proceedings of the 2019 IEEE 33rd International
Parallel and Distributed Processing Symposium (IPDPS ’19), 2019.'
short: 'L. Luo, C. Scheideler, T.F. Strothmann, in: Proceedings of the 2019 IEEE
33rd International Parallel and Distributed Processing Symposium (IPDPS ’19),
2019.'
conference:
end_date: 2019-05-25
location: Rio de Janeiro, Brazil
name: 2019 IEEE 33rd International Parallel and Distributed Processing Symposium
(IPDPS '19)
start_date: 2019-05-20
date_created: 2019-02-12T13:39:20Z
date_updated: 2022-01-06T07:03:42Z
ddc:
- '006'
department:
- _id: '66'
file:
- access_level: closed
content_type: application/pdf
creator: thim
date_created: 2019-02-12T13:37:35Z
date_updated: 2019-02-12T13:37:35Z
file_id: '7637'
file_name: IPDPS_main.pdf
file_size: 372026
relation: main_file
file_date_updated: 2019-02-12T13:37:35Z
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 2019 IEEE 33rd International Parallel and Distributed
Processing Symposium (IPDPS '19)
status: public
title: 'MultiSkipGraph: A Self-stabilizing Overlay Network that Maintains Monotonic
Searchability'
type: conference
user_id: '477'
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'
...