---
_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'
...
---
_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: '9599'
author:
- first_name: Joshua J.
full_name: Daymude, Joshua J.
last_name: Daymude
- first_name: Kristian
full_name: Hinnenthal, Kristian
id: '32229'
last_name: Hinnenthal
- 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, Hinnenthal K, Richa AW, Scheideler C. Computing by Programmable
Particles. In: Distributed Computing by Mobile Entities, Current Research in
Moving and Computing. Springer, Cham; 2019:615-681. doi:https://doi.org/10.1007/978-3-030-11072-7_22'
apa: Daymude, J. J., Hinnenthal, K., Richa, A. W., & Scheideler, C. (2019).
Computing by Programmable Particles. In Distributed Computing by Mobile Entities,
Current Research in Moving and Computing. (pp. 615–681). Springer, Cham. https://doi.org/10.1007/978-3-030-11072-7_22
bibtex: '@inbook{Daymude_Hinnenthal_Richa_Scheideler_2019, title={Computing by Programmable
Particles}, DOI={https://doi.org/10.1007/978-3-030-11072-7_22},
booktitle={Distributed Computing by Mobile Entities, Current Research in Moving
and Computing.}, publisher={Springer, Cham}, author={Daymude, Joshua J. and Hinnenthal,
Kristian and Richa, Andréa W. and Scheideler, Christian}, year={2019}, pages={615–681}
}'
chicago: Daymude, Joshua J., Kristian Hinnenthal, Andréa W. Richa, and Christian
Scheideler. “Computing by Programmable Particles.” In Distributed Computing
by Mobile Entities, Current Research in Moving and Computing., 615–81. Springer,
Cham, 2019. https://doi.org/10.1007/978-3-030-11072-7_22.
ieee: J. J. Daymude, K. Hinnenthal, A. W. Richa, and C. Scheideler, “Computing by
Programmable Particles,” in Distributed Computing by Mobile Entities, Current
Research in Moving and Computing., Springer, Cham, 2019, pp. 615–681.
mla: Daymude, Joshua J., et al. “Computing by Programmable Particles.” Distributed
Computing by Mobile Entities, Current Research in Moving and Computing., Springer,
Cham, 2019, pp. 615–81, doi:https://doi.org/10.1007/978-3-030-11072-7_22.
short: 'J.J. Daymude, K. Hinnenthal, A.W. Richa, C. Scheideler, in: Distributed
Computing by Mobile Entities, Current Research in Moving and Computing., Springer,
Cham, 2019, pp. 615–681.'
date_created: 2019-05-02T09:38:58Z
date_updated: 2022-01-06T07:04:16Z
doi: https://doi.org/10.1007/978-3-030-11072-7_22
language:
- iso: eng
page: 615-681
publication: Distributed Computing by Mobile Entities, Current Research in Moving
and Computing.
publisher: Springer, Cham
status: public
title: Computing by Programmable Particles
type: book_chapter
user_id: '32229'
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: '12944'
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
citation:
ama: 'Götte T, Hinnenthal K, Scheideler C. Faster Construction of Overlay Networks.
In: Structural Information and Communication Complexity. Cham; 2019. doi:10.1007/978-3-030-24922-9_18'
apa: Götte, T., Hinnenthal, K., & Scheideler, C. (2019). Faster Construction
of Overlay Networks. In Structural Information and Communication Complexity.
Cham. https://doi.org/10.1007/978-3-030-24922-9_18
bibtex: '@inproceedings{Götte_Hinnenthal_Scheideler_2019, place={Cham}, title={Faster
Construction of Overlay Networks}, DOI={10.1007/978-3-030-24922-9_18},
booktitle={Structural Information and Communication Complexity}, author={Götte,
Thorsten and Hinnenthal, Kristian and Scheideler, Christian}, year={2019} }'
chicago: Götte, Thorsten, Kristian Hinnenthal, and Christian Scheideler. “Faster
Construction of Overlay Networks.” In Structural Information and Communication
Complexity. Cham, 2019. https://doi.org/10.1007/978-3-030-24922-9_18.
ieee: T. Götte, K. Hinnenthal, and C. Scheideler, “Faster Construction of Overlay
Networks,” in Structural Information and Communication Complexity, 2019.
mla: Götte, Thorsten, et al. “Faster Construction of Overlay Networks.” Structural
Information and Communication Complexity, 2019, doi:10.1007/978-3-030-24922-9_18.
short: 'T. Götte, K. Hinnenthal, C. Scheideler, in: Structural Information and Communication
Complexity, Cham, 2019.'
date_created: 2019-08-19T07:18:57Z
date_updated: 2022-01-06T06:51:27Z
doi: 10.1007/978-3-030-24922-9_18
language:
- iso: eng
place: Cham
publication: Structural Information and Communication Complexity
publication_status: published
status: public
title: Faster Construction of Overlay Networks
type: conference
user_id: '32229'
year: '2019'
...
---
_id: '15627'
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: Proceedings of the Fourteenth Annual ACM-SIAM
Symposium on Discrete Algorithms. Philadelphia, PA; 2019:1280-1299. doi:10.1137/1.9781611975994.78'
apa: Augustine, J., Hinnenthal, K., Kuhn, F., Scheideler, C., & Schneider, P.
(2019). Shortest Paths in a Hybrid Network Model. In Proceedings of the Fourteenth
Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1280–1299). Philadelphia,
PA. https://doi.org/10.1137/1.9781611975994.78
bibtex: '@inproceedings{Augustine_Hinnenthal_Kuhn_Scheideler_Schneider_2019, place={Philadelphia,
PA}, title={Shortest Paths in a Hybrid Network Model}, DOI={10.1137/1.9781611975994.78},
booktitle={Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete
Algorithms}, author={Augustine, John and Hinnenthal, Kristian and Kuhn, Fabian
and Scheideler, Christian and Schneider, Philipp}, year={2019}, 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 Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1280–99.
Philadelphia, PA, 2019. 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 Fourteenth Annual ACM-SIAM
Symposium on Discrete Algorithms, 2019, pp. 1280–1299.
mla: Augustine, John, et al. “Shortest Paths in a Hybrid Network Model.” Proceedings
of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019,
pp. 1280–99, doi:10.1137/1.9781611975994.78.
short: 'J. Augustine, K. Hinnenthal, F. Kuhn, C. Scheideler, P. Schneider, in: Proceedings
of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia,
PA, 2019, pp. 1280–1299.'
date_created: 2020-01-22T09:07:36Z
date_updated: 2022-01-06T06:52:30Z
doi: 10.1137/1.9781611975994.78
language:
- iso: eng
page: 1280-1299
place: Philadelphia, PA
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 Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms
publication_identifier:
isbn:
- '9781611975994'
publication_status: published
status: public
title: Shortest Paths in a Hybrid Network Model
type: conference
user_id: '32229'
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: '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'
...