---
_id: '10271'
author:
- first_name: N.
  full_name: N., N.
  last_name: N.
citation:
  ama: N. N. <i>Implementation and Evaluation of Authenticated Data Structures Using
    Intel SGX Enclaves</i>. Universität Paderborn; 2019.
  apa: N., N. (2019). <i>Implementation and Evaluation of Authenticated Data Structures
    Using Intel SGX Enclaves</i>. Universität Paderborn.
  bibtex: '@book{N._2019, title={Implementation and Evaluation of Authenticated Data
    Structures Using Intel SGX Enclaves}, publisher={Universität Paderborn}, author={N.,
    N.}, year={2019} }'
  chicago: N., N. <i>Implementation and Evaluation of Authenticated Data Structures
    Using Intel SGX Enclaves</i>. Universität Paderborn, 2019.
  ieee: N. N., <i>Implementation and Evaluation of Authenticated Data Structures Using
    Intel SGX Enclaves</i>. Universität Paderborn, 2019.
  mla: N., N. <i>Implementation and Evaluation of Authenticated Data Structures Using
    Intel SGX Enclaves</i>. Universität Paderborn, 2019.
  short: N. N., Implementation and Evaluation of Authenticated Data Structures Using
    Intel SGX Enclaves, Universität Paderborn, 2019.
date_created: 2019-06-19T11:31:38Z
date_updated: 2022-01-06T06:50:33Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '13'
  name: SFB 901 - Subproject C1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: Implementation and Evaluation of Authenticated Data Structures Using Intel
  SGX Enclaves
type: mastersthesis
user_id: '477'
year: '2019'
...
---
_id: '13652'
author:
- first_name: Kristian
  full_name: Hinnenthal, Kristian
  id: '32229'
  last_name: Hinnenthal
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Martijn
  full_name: Struijs, Martijn
  last_name: Struijs
citation:
  ama: 'Hinnenthal K, Scheideler C, Struijs M. Fast Distributed Algorithms for LP-Type
    Problems of Low Dimension. In: <i>33rd International Symposium on Distributed
    Computing (DISC 2019)</i>. ; 2019. doi:<a href="https://doi.org/10.4230/LIPICS.DISC.2019.23">10.4230/LIPICS.DISC.2019.23</a>'
  apa: Hinnenthal, K., Scheideler, C., &#38; Struijs, M. (2019). Fast Distributed
    Algorithms for LP-Type Problems of Low Dimension. In <i>33rd International Symposium
    on Distributed Computing (DISC 2019)</i>. <a href="https://doi.org/10.4230/LIPICS.DISC.2019.23">https://doi.org/10.4230/LIPICS.DISC.2019.23</a>
  bibtex: '@inproceedings{Hinnenthal_Scheideler_Struijs_2019, title={Fast Distributed
    Algorithms for LP-Type Problems of Low Dimension}, DOI={<a href="https://doi.org/10.4230/LIPICS.DISC.2019.23">10.4230/LIPICS.DISC.2019.23</a>},
    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 <i>33rd International
    Symposium on Distributed Computing (DISC 2019)</i>, 2019. <a href="https://doi.org/10.4230/LIPICS.DISC.2019.23">https://doi.org/10.4230/LIPICS.DISC.2019.23</a>.
  ieee: K. Hinnenthal, C. Scheideler, and M. Struijs, “Fast Distributed Algorithms
    for LP-Type Problems of Low Dimension,” in <i>33rd International Symposium on
    Distributed Computing (DISC 2019)</i>, 2019.
  mla: Hinnenthal, Kristian, et al. “Fast Distributed Algorithms for LP-Type Problems
    of Low Dimension.” <i>33rd International Symposium on Distributed Computing (DISC
    2019)</i>, 2019, doi:<a href="https://doi.org/10.4230/LIPICS.DISC.2019.23">10.4230/LIPICS.DISC.2019.23</a>.
  short: 'K. Hinnenthal, C. Scheideler, M. Struijs, in: 33rd International Symposium
    on Distributed Computing (DISC 2019), 2019.'
date_created: 2019-10-08T11:53:38Z
date_updated: 2022-01-06T06:51:41Z
department:
- _id: '79'
doi: 10.4230/LIPICS.DISC.2019.23
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publication: 33rd International Symposium on Distributed Computing (DISC 2019)
status: public
title: Fast Distributed Algorithms for LP-Type Problems of Low Dimension
type: conference
user_id: '32229'
year: '2019'
...
---
_id: '3422'
abstract:
- lang: eng
  text: "We study the consensus problem in a synchronous distributed system of n nodes
    under an adaptive adversary that has a slightly outdated view of the system and
    can block all incoming and outgoing communication of a constant fraction of the
    nodes in each round. Motivated by a result of Ben-Or and Bar-Joseph (1998), showing
    that any consensus algorithm that is resilient against a linear number of crash
    faults requires $\\tilde \\Omega(\\sqrt n)$ rounds in an n-node network against
    an adaptive adversary, we consider a late adaptive adversary, who has full knowledge
    of the network state at the beginning of the previous round and unlimited computational
    power, but is oblivious to the current state of the nodes. \r\n\r\nOur main contributions
    are randomized distributed algorithms that achieve consensus with high probability
    among all except a small constant fraction of the nodes (i.e., \"almost-everywhere'')
    against a late adaptive adversary who can block up to ε n$ nodes in each round,
    for a small constant ε >0$. Our first protocol achieves binary almost-everywhere
    consensus and also guarantees a decision on the majority input value, thus ensuring
    plurality consensus. We also present an algorithm that achieves the same time
    complexity for multi-value consensus. Both of our algorithms succeed in $O(log
    n)$ rounds with high probability, thus showing an exponential gap to the $\\tilde\\Omega(\\sqrt
    n)$ lower bound of Ben-Or and Bar-Joseph for strongly adaptive crash-failure adversaries,
    which can be strengthened to $\\Omega(n)$ when allowing the adversary to block
    nodes instead of permanently crashing them. Our algorithms are scalable to large
    systems as each node contacts only an (amortized) constant number of peers in
    each communication round. We show that our algorithms are optimal up to constant
    (resp.\\ sub-logarithmic) factors by proving that every almost-everywhere consensus
    protocol takes $\\Omega(log_d n)$ rounds in the worst case, where d is an upper
    bound on the number of communication requests initiated per node in each round.
    We complement our theoretical results with an experimental evaluation of the binary
    almost-everywhere consensus protocol revealing a short convergence time even against
    an adversary blocking a large fraction of nodes."
author:
- first_name: Peter
  full_name: Robinson, Peter
  last_name: Robinson
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Alexander
  full_name: Setzer, Alexander
  id: '11108'
  last_name: Setzer
citation:
  ama: 'Robinson P, Scheideler C, Setzer A. Breaking the $\tilde\Omega(\sqrt{n})$
    Barrier: Fast Consensus under a Late Adversary. In: <i>Proceedings of the 30th
    ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. doi:<a
    href="https://doi.org/10.1145/3210377.3210399">10.1145/3210377.3210399</a>'
  apa: 'Robinson, P., Scheideler, C., &#38; Setzer, A. (n.d.). Breaking the $\tilde\Omega(\sqrt{n})$
    Barrier: Fast Consensus under a Late Adversary. In <i>Proceedings of the 30th
    ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. Wien.
    <a href="https://doi.org/10.1145/3210377.3210399">https://doi.org/10.1145/3210377.3210399</a>'
  bibtex: '@inproceedings{Robinson_Scheideler_Setzer, title={Breaking the $\tilde\Omega(\sqrt{n})$
    Barrier: Fast Consensus under a Late Adversary}, DOI={<a href="https://doi.org/10.1145/3210377.3210399">10.1145/3210377.3210399</a>},
    booktitle={Proceedings of the 30th ACM Symposium on Parallelism in Algorithms
    and Architectures (SPAA)}, author={Robinson, Peter and Scheideler, Christian and
    Setzer, Alexander} }'
  chicago: 'Robinson, Peter, Christian Scheideler, and Alexander Setzer. “Breaking
    the $\tilde\Omega(\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary.”
    In <i>Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures
    (SPAA)</i>, n.d. <a href="https://doi.org/10.1145/3210377.3210399">https://doi.org/10.1145/3210377.3210399</a>.'
  ieee: 'P. Robinson, C. Scheideler, and A. Setzer, “Breaking the $\tilde\Omega(\sqrt{n})$
    Barrier: Fast Consensus under a Late Adversary,” in <i>Proceedings of the 30th
    ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, Wien.'
  mla: 'Robinson, Peter, et al. “Breaking the $\tilde\Omega(\sqrt{n})$ Barrier: Fast
    Consensus under a Late Adversary.” <i>Proceedings of the 30th ACM Symposium on
    Parallelism in Algorithms and Architectures (SPAA)</i>, doi:<a href="https://doi.org/10.1145/3210377.3210399">10.1145/3210377.3210399</a>.'
  short: 'P. Robinson, C. Scheideler, A. Setzer, in: Proceedings of the 30th ACM Symposium
    on Parallelism in Algorithms and Architectures (SPAA), n.d.'
conference:
  end_date: 2018-07-18
  location: Wien
  name: 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
  start_date: 2018-07-16
date_created: 2018-07-04T08:55:45Z
date_updated: 2022-01-06T06:59:16Z
ddc:
- '040'
department:
- _id: '79'
- _id: '34'
- _id: '7'
doi: 10.1145/3210377.3210399
file:
- access_level: closed
  content_type: application/pdf
  creator: asetzer
  date_created: 2018-10-31T13:30:40Z
  date_updated: 2018-10-31T13:30:40Z
  file_id: '5215'
  file_name: p173-robinson.pdf
  file_size: 1675407
  relation: main_file
  success: 1
file_date_updated: 2018-10-31T13:30:40Z
has_accepted_license: '1'
keyword:
- distributed consensus
- randomized algorithm
- adaptive adversary
- complexity lower bound
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '13'
  name: SFB 901 - Subproject C1
publication: Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and
  Architectures (SPAA)
publication_identifier:
  isbn:
  - 978-1-4503-5799-9/18/07
publication_status: accepted
status: public
title: 'Breaking the $\tilde\Omega(\sqrt{n})$ Barrier: Fast Consensus under a Late
  Adversary'
type: conference
user_id: '11108'
year: '2018'
...
---
_id: '3874'
citation:
  ama: Scheideler C, Fineman JT, eds. <i>Proceedings of the 30th on Symposium on Parallelism
    in Algorithms and Architectures</i>. ACM; 2018.
  apa: 'Scheideler, C., &#38; Fineman, J. T. (Eds.). (2018). <i>Proceedings of the
    30th on Symposium on Parallelism in Algorithms and Architectures</i>. Vienna,
    Austria: ACM.'
  bibtex: '@book{Scheideler_Fineman_2018, title={Proceedings of the 30th on Symposium
    on Parallelism in Algorithms and Architectures}, publisher={ACM}, year={2018}
    }'
  chicago: Scheideler, Christian, and Jeremy T. Fineman, eds. <i>Proceedings of the
    30th on Symposium on Parallelism in Algorithms and Architectures</i>. ACM, 2018.
  ieee: C. Scheideler and J. T. Fineman, Eds., <i>Proceedings of the 30th on Symposium
    on Parallelism in Algorithms and Architectures</i>. ACM, 2018.
  mla: Scheideler, Christian, and Jeremy T. Fineman, editors. <i>Proceedings of the
    30th on Symposium on Parallelism in Algorithms and Architectures</i>. ACM, 2018.
  short: C. Scheideler, J.T. Fineman, eds., Proceedings of the 30th on Symposium on
    Parallelism in Algorithms and Architectures, ACM, 2018.
conference:
  location: Vienna, Austria
date_created: 2018-08-10T10:03:47Z
date_updated: 2022-01-06T06:59:47Z
department:
- _id: '79'
editor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Jeremy T.
  full_name: Fineman, Jeremy T.
  last_name: Fineman
publication_identifier:
  isbn:
  - 978-1-4503-5799-9
publisher: ACM
status: public
title: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures
type: conference_editor
user_id: '15504'
year: '2018'
...
---
_id: '1138'
author:
- first_name: Robert
  full_name: Gmyr, Robert
  last_name: Gmyr
citation:
  ama: Gmyr R. <i>Distributed Algorithms for Overlay Networks and Programmable Matter</i>.
    Universität Paderborn; 2018. doi:<a href="https://doi.org/10.17619/UNIPB/1-265">10.17619/UNIPB/1-265</a>
  apa: Gmyr, R. (2018). <i>Distributed Algorithms for Overlay Networks and Programmable
    Matter</i>. Universität Paderborn. <a href="https://doi.org/10.17619/UNIPB/1-265">https://doi.org/10.17619/UNIPB/1-265</a>
  bibtex: '@book{Gmyr_2018, title={Distributed Algorithms for Overlay Networks and
    Programmable Matter}, DOI={<a href="https://doi.org/10.17619/UNIPB/1-265">10.17619/UNIPB/1-265</a>},
    publisher={Universität Paderborn}, author={Gmyr, Robert}, year={2018} }'
  chicago: Gmyr, Robert. <i>Distributed Algorithms for Overlay Networks and Programmable
    Matter</i>. Universität Paderborn, 2018. <a href="https://doi.org/10.17619/UNIPB/1-265">https://doi.org/10.17619/UNIPB/1-265</a>.
  ieee: R. Gmyr, <i>Distributed Algorithms for Overlay Networks and Programmable Matter</i>.
    Universität Paderborn, 2018.
  mla: Gmyr, Robert. <i>Distributed Algorithms for Overlay Networks and Programmable
    Matter</i>. Universität Paderborn, 2018, doi:<a href="https://doi.org/10.17619/UNIPB/1-265">10.17619/UNIPB/1-265</a>.
  short: R. Gmyr, Distributed Algorithms for Overlay Networks and Programmable Matter,
    Universität Paderborn, 2018.
date_created: 2018-01-31T06:04:03Z
date_updated: 2022-01-06T06:51:00Z
department:
- _id: '79'
doi: 10.17619/UNIPB/1-265
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subproject C1
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '5'
  name: SFB 901 - Subproject A1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: Distributed Algorithms for Overlay Networks and Programmable Matter
type: dissertation
user_id: '477'
year: '2018'
...
---
_id: '1163'
abstract:
- lang: eng
  text: "In this paper we present two major results:\r\nFirst, we introduce the first
    self-stabilizing version of a supervised overlay network (as introduced in~\\cite{DBLP:conf/ispan/KothapalliS05})
    by presenting a self-stabilizing supervised skip ring.\r\nSecondly, we show how
    to use the self-stabilizing supervised skip ring to construct an efficient self-stabilizing
    publish-subscribe system.\r\nThat is, in addition to stabilizing the overlay network,
    every subscriber of a topic will eventually know all of the publications that
    have been issued so far for that topic. The communication work needed to processes
    a subscribe or unsubscribe operation is just a constant in a legitimate state,
    and the communication work of checking whether the system is still in a legitimate
    state is just a constant on expectation for the supervisor as well as any process
    in the system.\r\n"
author:
- first_name: Michael
  full_name: Feldmann, Michael
  id: '23538'
  last_name: Feldmann
- first_name: Christina
  full_name: Kolb, Christina
  id: '43647'
  last_name: Kolb
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Thim Frederik
  full_name: Strothmann, Thim Frederik
  id: '11319'
  last_name: Strothmann
citation:
  ama: 'Feldmann M, Kolb C, Scheideler C, Strothmann TF. Self-Stabilizing Supervised
    Publish-Subscribe Systems. In: <i>Proceedings of the 32nd IEEE International Parallel
    &#38; Distributed Processing Symposium (IPDPS)</i>. IEEE; 2018. doi:<a href="https://doi.org/10.1109/IPDPS.2018.00114">10.1109/IPDPS.2018.00114</a>'
  apa: 'Feldmann, M., Kolb, C., Scheideler, C., &#38; Strothmann, T. F. (2018). Self-Stabilizing
    Supervised Publish-Subscribe Systems. In <i>Proceedings of the 32nd IEEE International
    Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. Vancouver: IEEE.
    <a href="https://doi.org/10.1109/IPDPS.2018.00114">https://doi.org/10.1109/IPDPS.2018.00114</a>'
  bibtex: '@inproceedings{Feldmann_Kolb_Scheideler_Strothmann_2018, title={Self-Stabilizing
    Supervised Publish-Subscribe Systems}, DOI={<a href="https://doi.org/10.1109/IPDPS.2018.00114">10.1109/IPDPS.2018.00114</a>},
    booktitle={Proceedings of the 32nd IEEE International Parallel &#38; Distributed
    Processing Symposium (IPDPS)}, publisher={IEEE}, author={Feldmann, Michael and
    Kolb, Christina and Scheideler, Christian and Strothmann, Thim Frederik}, year={2018}
    }'
  chicago: Feldmann, Michael, Christina Kolb, Christian Scheideler, and Thim Frederik
    Strothmann. “Self-Stabilizing Supervised Publish-Subscribe Systems.” In <i>Proceedings
    of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium
    (IPDPS)</i>. IEEE, 2018. <a href="https://doi.org/10.1109/IPDPS.2018.00114">https://doi.org/10.1109/IPDPS.2018.00114</a>.
  ieee: M. Feldmann, C. Kolb, C. Scheideler, and T. F. Strothmann, “Self-Stabilizing
    Supervised Publish-Subscribe Systems,” in <i>Proceedings of the 32nd IEEE International
    Parallel &#38; Distributed Processing Symposium (IPDPS)</i>, Vancouver, 2018.
  mla: Feldmann, Michael, et al. “Self-Stabilizing Supervised Publish-Subscribe Systems.”
    <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing
    Symposium (IPDPS)</i>, IEEE, 2018, doi:<a href="https://doi.org/10.1109/IPDPS.2018.00114">10.1109/IPDPS.2018.00114</a>.
  short: 'M. Feldmann, C. Kolb, C. Scheideler, T.F. Strothmann, in: Proceedings of
    the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS),
    IEEE, 2018.'
conference:
  end_date: 2018-5-24
  location: Vancouver
  name: 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)
  start_date: 2018-5-22
date_created: 2018-02-01T13:56:01Z
date_updated: 2022-01-06T06:51:05Z
ddc:
- '040'
department:
- _id: '79'
- _id: '66'
doi: 10.1109/IPDPS.2018.00114
external_id:
  arxiv:
  - '1710.08128'
file:
- access_level: closed
  content_type: application/pdf
  creator: mfeldma2
  date_created: 2018-10-31T13:25:37Z
  date_updated: 2018-10-31T13:25:37Z
  file_id: '5211'
  file_name: 08425258.pdf
  file_size: 239559
  relation: main_file
  success: 1
file_date_updated: 2018-10-31T13:25:37Z
has_accepted_license: '1'
keyword:
- Topological Self-stabilization
- Supervised Overlay
- Publish-Subscribe System
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publication: Proceedings of the 32nd IEEE International Parallel & Distributed Processing
  Symposium (IPDPS)
publisher: IEEE
status: public
title: Self-Stabilizing Supervised Publish-Subscribe Systems
type: conference
user_id: '11319'
year: '2018'
...
---
_id: '1164'
abstract:
- lang: eng
  text: "We propose a distributed protocol for a queue, called Skueue, which spreads
    its data fairly onto multiple processes, avoiding bottlenecks in high throughput
    scenarios.\r\nSkueuecan be used in highly dynamic environments, through the addition
    of join and leave requests to the standard queue operations enqueue and dequeue.\r\nFurthermore
    Skueue satisfies sequential consistency in the asynchronous message passing model.\r\nScalability
    is achieved by aggregating multiple requests to a batch, which can then be processed
    in a distributed fashion without hurting the queue semantics.\r\nOperations in
    Skueue need a logarithmic number of rounds w.h.p. until they are processed, even
    under a high rate of incoming requests."
author:
- first_name: Michael
  full_name: Feldmann, Michael
  id: '23538'
  last_name: Feldmann
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Alexander
  full_name: Setzer, Alexander
  id: '11108'
  last_name: Setzer
citation:
  ama: 'Feldmann M, Scheideler C, Setzer A. Skueue: A Scalable and Sequentially Consistent
    Distributed Queue. In: <i>Proceedings of the 32nd IEEE International Parallel
    &#38; Distributed Processing Symposium (IPDPS)</i>. IEEE; 2018. doi:<a href="https://doi.org/10.1109/IPDPS.2018.00113">10.1109/IPDPS.2018.00113</a>'
  apa: 'Feldmann, M., Scheideler, C., &#38; Setzer, A. (2018). Skueue: A Scalable
    and Sequentially Consistent Distributed Queue. In <i>Proceedings of the 32nd IEEE
    International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. Vancouver:
    IEEE. <a href="https://doi.org/10.1109/IPDPS.2018.00113">https://doi.org/10.1109/IPDPS.2018.00113</a>'
  bibtex: '@inproceedings{Feldmann_Scheideler_Setzer_2018, title={Skueue: A Scalable
    and Sequentially Consistent Distributed Queue}, DOI={<a href="https://doi.org/10.1109/IPDPS.2018.00113">10.1109/IPDPS.2018.00113</a>},
    booktitle={Proceedings of the 32nd IEEE International Parallel &#38; Distributed
    Processing Symposium (IPDPS)}, publisher={IEEE}, author={Feldmann, Michael and
    Scheideler, Christian and Setzer, Alexander}, year={2018} }'
  chicago: 'Feldmann, Michael, Christian Scheideler, and Alexander Setzer. “Skueue:
    A Scalable and Sequentially Consistent Distributed Queue.” In <i>Proceedings of
    the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>.
    IEEE, 2018. <a href="https://doi.org/10.1109/IPDPS.2018.00113">https://doi.org/10.1109/IPDPS.2018.00113</a>.'
  ieee: 'M. Feldmann, C. Scheideler, and A. Setzer, “Skueue: A Scalable and Sequentially
    Consistent Distributed Queue,” in <i>Proceedings of the 32nd IEEE International
    Parallel &#38; Distributed Processing Symposium (IPDPS)</i>, Vancouver, 2018.'
  mla: 'Feldmann, Michael, et al. “Skueue: A Scalable and Sequentially Consistent
    Distributed Queue.” <i>Proceedings of the 32nd IEEE International Parallel &#38;
    Distributed Processing Symposium (IPDPS)</i>, IEEE, 2018, doi:<a href="https://doi.org/10.1109/IPDPS.2018.00113">10.1109/IPDPS.2018.00113</a>.'
  short: 'M. Feldmann, C. Scheideler, A. Setzer, in: Proceedings of the 32nd IEEE
    International Parallel &#38; Distributed Processing Symposium (IPDPS), IEEE, 2018.'
conference:
  end_date: 2018-5-24
  location: Vancouver
  name: 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)
  start_date: 2018-5-22
date_created: 2018-02-01T14:00:36Z
date_updated: 2022-01-06T06:51:05Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1109/IPDPS.2018.00113
external_id:
  arxiv:
  - '1802.07504'
file:
- access_level: closed
  content_type: application/pdf
  creator: mfeldma2
  date_created: 2018-10-31T13:29:26Z
  date_updated: 2018-10-31T13:29:26Z
  file_id: '5212'
  file_name: 08425257.pdf
  file_size: 218420
  relation: main_file
  success: 1
file_date_updated: 2018-10-31T13:29:26Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publication: Proceedings of the 32nd IEEE International Parallel & Distributed Processing
  Symposium (IPDPS)
publisher: IEEE
status: public
title: 'Skueue: A Scalable and Sequentially Consistent Distributed Queue'
type: conference
user_id: '23538'
year: '2018'
...
---
_id: '1796'
author:
- first_name: Joshua
  full_name: J. Daymude, Joshua
  last_name: J. Daymude
- first_name: Zahra
  full_name: Derakhshandeh, Zahra
  last_name: Derakhshandeh
- first_name: Robert
  full_name: Gmyr, Robert
  last_name: Gmyr
- first_name: Alexandra
  full_name: Porter, Alexandra
  last_name: Porter
- first_name: Andrea
  full_name: W. Richa, Andrea
  last_name: W. Richa
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Thim Frederik
  full_name: Strothmann, Thim Frederik
  id: '11319'
  last_name: Strothmann
citation:
  ama: J. Daymude J, Derakhshandeh Z, Gmyr R, et al. On the runtime of universal coating
    for programmable matter. <i>Natural Computing</i>. 2018;(1):81--96. doi:<a href="https://doi.org/10.1007/s11047-017-9658-6">10.1007/s11047-017-9658-6</a>
  apa: J. Daymude, J., Derakhshandeh, Z., Gmyr, R., Porter, A., W. Richa, A., Scheideler,
    C., &#38; Strothmann, T. F. (2018). On the runtime of universal coating for programmable
    matter. <i>Natural Computing</i>, (1), 81--96. <a href="https://doi.org/10.1007/s11047-017-9658-6">https://doi.org/10.1007/s11047-017-9658-6</a>
  bibtex: '@article{J. Daymude_Derakhshandeh_Gmyr_Porter_W. Richa_Scheideler_Strothmann_2018,
    title={On the runtime of universal coating for programmable matter}, DOI={<a href="https://doi.org/10.1007/s11047-017-9658-6">10.1007/s11047-017-9658-6</a>},
    number={1}, journal={Natural Computing}, author={J. Daymude, Joshua and Derakhshandeh,
    Zahra and Gmyr, Robert and Porter, Alexandra and W. Richa, Andrea and Scheideler,
    Christian and Strothmann, Thim Frederik}, year={2018}, pages={81--96} }'
  chicago: 'J. Daymude, Joshua, Zahra Derakhshandeh, Robert Gmyr, Alexandra Porter,
    Andrea W. Richa, Christian Scheideler, and Thim Frederik Strothmann. “On the Runtime
    of Universal Coating for Programmable Matter.” <i>Natural Computing</i>, no. 1
    (2018): 81--96. <a href="https://doi.org/10.1007/s11047-017-9658-6">https://doi.org/10.1007/s11047-017-9658-6</a>.'
  ieee: J. J. Daymude <i>et al.</i>, “On the runtime of universal coating for programmable
    matter,” <i>Natural Computing</i>, no. 1, pp. 81--96, 2018.
  mla: J. Daymude, Joshua, et al. “On the Runtime of Universal Coating for Programmable
    Matter.” <i>Natural Computing</i>, no. 1, 2018, pp. 81--96, doi:<a href="https://doi.org/10.1007/s11047-017-9658-6">10.1007/s11047-017-9658-6</a>.
  short: J. J. Daymude, Z. Derakhshandeh, R. Gmyr, A. Porter, A. W. Richa, C. Scheideler,
    T.F. Strothmann, Natural Computing (2018) 81--96.
date_created: 2018-03-27T06:23:58Z
date_updated: 2022-01-06T06:53:24Z
department:
- _id: '79'
- _id: '66'
doi: 10.1007/s11047-017-9658-6
issue: '1'
language:
- iso: eng
page: 81--96
publication: Natural Computing
status: public
title: On the runtime of universal coating for programmable matter
type: journal_article
user_id: '11319'
year: '2018'
...
---
_id: '18030'
author:
- first_name: N.
  full_name: N., N.
  last_name: N.
citation:
  ama: N. N. <i>Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List
    Und Build-Multilist Mit Systemverlassenden Knoten</i>. Universität Paderborn;
    2018.
  apa: N., N. (2018). <i>Monotone Suchbarkeit bei den selbststabilisierenden Protokollen
    Build-List und Build-Multilist mit systemverlassenden Knoten</i>. Universität
    Paderborn.
  bibtex: '@book{N._2018, title={Monotone Suchbarkeit bei den selbststabilisierenden
    Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten}, publisher={Universität
    Paderborn}, author={N., N.}, year={2018} }'
  chicago: N., N. <i>Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen
    Build-List Und Build-Multilist Mit Systemverlassenden Knoten</i>. Universität
    Paderborn, 2018.
  ieee: N. N., <i>Monotone Suchbarkeit bei den selbststabilisierenden Protokollen
    Build-List und Build-Multilist mit systemverlassenden Knoten</i>. Universität
    Paderborn, 2018.
  mla: N., N. <i>Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List
    Und Build-Multilist Mit Systemverlassenden Knoten</i>. Universität Paderborn,
    2018.
  short: N. N., Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List
    Und Build-Multilist Mit Systemverlassenden Knoten, Universität Paderborn, 2018.
date_created: 2020-08-18T08:44:22Z
date_updated: 2022-01-06T06:53:25Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List
  und Build-Multilist mit systemverlassenden Knoten
type: bachelorsthesis
user_id: '477'
year: '2018'
...
---
_id: '18031'
author:
- first_name: N.
  full_name: N., N.
  last_name: N.
citation:
  ama: N. N. <i>Gathering Strategien Für Mobile Roboterschwärme Im Gitternetz</i>.;
    2018.
  apa: N., N. (2018). <i>Gathering Strategien für mobile Roboterschwärme im Gitternetz</i>.
  bibtex: '@book{N._2018, title={Gathering Strategien für mobile Roboterschwärme im
    Gitternetz}, author={N., N.}, year={2018} }'
  chicago: N., N. <i>Gathering Strategien Für Mobile Roboterschwärme Im Gitternetz</i>,
    2018.
  ieee: N. N., <i>Gathering Strategien für mobile Roboterschwärme im Gitternetz</i>.
    2018.
  mla: N., N. <i>Gathering Strategien Für Mobile Roboterschwärme Im Gitternetz</i>.
    2018.
  short: N. N., Gathering Strategien Für Mobile Roboterschwärme Im Gitternetz, 2018.
date_created: 2020-08-18T08:45:09Z
date_updated: 2022-01-06T06:53:25Z
department:
- _id: '79'
language:
- iso: eng
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: Gathering Strategien für mobile Roboterschwärme im Gitternetz
type: bachelorsthesis
user_id: '15504'
year: '2018'
...
---
_id: '18032'
author:
- first_name: N.
  full_name: N., N.
  last_name: N.
citation:
  ama: N. N. <i>Decontaminating Planar Regions with Finite Automaton Robots and Tiles</i>.;
    2018.
  apa: N., N. (2018). <i>Decontaminating Planar Regions with Finite Automaton Robots
    and Tiles</i>.
  bibtex: '@book{N._2018, title={Decontaminating Planar Regions with Finite Automaton
    Robots and Tiles}, author={N., N.}, year={2018} }'
  chicago: N., N. <i>Decontaminating Planar Regions with Finite Automaton Robots and
    Tiles</i>, 2018.
  ieee: N. N., <i>Decontaminating Planar Regions with Finite Automaton Robots and
    Tiles</i>. 2018.
  mla: N., N. <i>Decontaminating Planar Regions with Finite Automaton Robots and Tiles</i>.
    2018.
  short: N. N., Decontaminating Planar Regions with Finite Automaton Robots and Tiles,
    2018.
date_created: 2020-08-18T08:45:53Z
date_updated: 2022-01-06T06:53:25Z
department:
- _id: '79'
language:
- iso: eng
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: Decontaminating Planar Regions with Finite Automaton Robots and Tiles
type: bachelorsthesis
user_id: '15504'
year: '2018'
...
---
_id: '18033'
author:
- first_name: Robin
  full_name: Wulfes, Robin
  last_name: Wulfes
citation:
  ama: Wulfes R. <i>Load-Balanced Routing in Hybriden Kommunikationsnetzwerken</i>.
    Universität Paderborn; 2018.
  apa: Wulfes, R. (2018). <i>Load-Balanced Routing in Hybriden Kommunikationsnetzwerken</i>.
    Universität Paderborn.
  bibtex: '@book{Wulfes_2018, title={Load-Balanced Routing in Hybriden Kommunikationsnetzwerken},
    publisher={Universität Paderborn}, author={Wulfes, Robin}, year={2018} }'
  chicago: Wulfes, Robin. <i>Load-Balanced Routing in Hybriden Kommunikationsnetzwerken</i>.
    Universität Paderborn, 2018.
  ieee: R. Wulfes, <i>Load-Balanced Routing in Hybriden Kommunikationsnetzwerken</i>.
    Universität Paderborn, 2018.
  mla: Wulfes, Robin. <i>Load-Balanced Routing in Hybriden Kommunikationsnetzwerken</i>.
    Universität Paderborn, 2018.
  short: R. Wulfes, Load-Balanced Routing in Hybriden Kommunikationsnetzwerken, Universität
    Paderborn, 2018.
date_created: 2020-08-18T08:46:50Z
date_updated: 2022-01-06T06:53:25Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: Load-Balanced Routing in Hybriden Kommunikationsnetzwerken
type: bachelorsthesis
user_id: '477'
year: '2018'
...
---
_id: '5764'
author:
- first_name: Robert
  full_name: Gmyr, Robert
  last_name: Gmyr
- first_name: Kristian
  full_name: Hinnenthal, Kristian
  id: '32229'
  last_name: Hinnenthal
- first_name: Irina
  full_name: Kostitsyna, Irina
  last_name: Kostitsyna
- first_name: Fabian
  full_name: Kuhn, Fabian
  last_name: Kuhn
- first_name: Dorian
  full_name: Rudolph, Dorian
  last_name: Rudolph
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Thim Frederik
  full_name: Strothmann, Thim Frederik
  id: '11319'
  last_name: Strothmann
citation:
  ama: 'Gmyr R, Hinnenthal K, Kostitsyna I, et al. Forming Tile Shapes with Simple
    Robots. In: <i>Proceedings of the 24th International Conference on DNA Computing
    and Molecular Programming</i>. Springer International Publishing; 2018:122-138.
    doi:<a href="https://doi.org/10.1007/978-3-030-00030-1_8">10.1007/978-3-030-00030-1_8</a>'
  apa: Gmyr, R., Hinnenthal, K., Kostitsyna, I., Kuhn, F., Rudolph, D., Scheideler,
    C., &#38; Strothmann, T. F. (2018). Forming Tile Shapes with Simple Robots. In
    <i>Proceedings of the 24th International Conference on DNA Computing and Molecular
    Programming</i> (pp. 122–138). Springer International Publishing. <a href="https://doi.org/10.1007/978-3-030-00030-1_8">https://doi.org/10.1007/978-3-030-00030-1_8</a>
  bibtex: '@inproceedings{Gmyr_Hinnenthal_Kostitsyna_Kuhn_Rudolph_Scheideler_Strothmann_2018,
    title={Forming Tile Shapes with Simple Robots}, DOI={<a href="https://doi.org/10.1007/978-3-030-00030-1_8">10.1007/978-3-030-00030-1_8</a>},
    booktitle={Proceedings of the 24th International Conference on DNA Computing and
    Molecular Programming}, publisher={Springer International Publishing}, author={Gmyr,
    Robert and Hinnenthal, Kristian and Kostitsyna, Irina and Kuhn, Fabian and Rudolph,
    Dorian and Scheideler, Christian and Strothmann, Thim Frederik}, year={2018},
    pages={122–138} }'
  chicago: Gmyr, Robert, Kristian Hinnenthal, Irina Kostitsyna, Fabian Kuhn, Dorian
    Rudolph, Christian Scheideler, and Thim Frederik Strothmann. “Forming Tile Shapes
    with Simple Robots.” In <i>Proceedings of the 24th International Conference on
    DNA Computing and Molecular Programming</i>, 122–38. Springer International Publishing,
    2018. <a href="https://doi.org/10.1007/978-3-030-00030-1_8">https://doi.org/10.1007/978-3-030-00030-1_8</a>.
  ieee: R. Gmyr <i>et al.</i>, “Forming Tile Shapes with Simple Robots,” in <i>Proceedings
    of the 24th International Conference on DNA Computing and Molecular Programming</i>,
    2018, pp. 122–138.
  mla: Gmyr, Robert, et al. “Forming Tile Shapes with Simple Robots.” <i>Proceedings
    of the 24th International Conference on DNA Computing and Molecular Programming</i>,
    Springer International Publishing, 2018, pp. 122–38, doi:<a href="https://doi.org/10.1007/978-3-030-00030-1_8">10.1007/978-3-030-00030-1_8</a>.
  short: 'R. Gmyr, K. Hinnenthal, I. Kostitsyna, F. Kuhn, D. Rudolph, C. Scheideler,
    T.F. Strothmann, in: Proceedings of the 24th International Conference on DNA Computing
    and Molecular Programming, Springer International Publishing, 2018, pp. 122–138.'
date_created: 2018-11-19T15:35:45Z
date_updated: 2022-01-06T07:02:38Z
department:
- _id: '79'
- _id: '66'
doi: 10.1007/978-3-030-00030-1_8
language:
- iso: eng
page: 122-138
publication: Proceedings of the 24th International Conference on DNA Computing and
  Molecular Programming
publication_status: published
publisher: Springer International Publishing
status: public
title: Forming Tile Shapes with Simple Robots
type: conference
user_id: '11319'
year: '2018'
...
---
_id: '5820'
abstract:
- lang: eng
  text: "In this paper, we investigate the use of trusted execution environments (TEEs,
    such as Intel's SGX) for an anonymous communication infrastructure over untrusted
    networks.\r\nFor this, we present the general idea of exploiting trusted execution
    environments for the purpose of anonymous communication, including a continuous-time
    security framework that models strong anonymity guarantees in the presence of
    an adversary that observes all network traffic and can adaptively corrupt a constant
    fraction of participating nodes.\r\nIn our framework, a participating node can
    generate a number of unlinkable pseudonyms. Messages are sent from and to pseudonyms,
    allowing both senders and receivers of messages to remain anonymous. We introduce
    a concrete construction, which shows viability of our TEE-based approach to anonymous
    communication. The construction draws from techniques from cryptography and overlay
    networks. \r\nOur techniques are very general and can be used as a basis for future
    constructions with similar goals."
author:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
- first_name: Jan
  full_name: Bobolz, Jan
  id: '27207'
  last_name: Bobolz
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Alexander
  full_name: Setzer, Alexander
  id: '11108'
  last_name: Setzer
citation:
  ama: Blömer J, Bobolz J, Scheideler C, Setzer A. <i>Provably Anonymous Communication
    Based on Trusted Execution Environments</i>.
  apa: Blömer, J., Bobolz, J., Scheideler, C., &#38; Setzer, A. (n.d.). <i>Provably
    Anonymous Communication Based on Trusted Execution Environments</i>.
  bibtex: '@book{Blömer_Bobolz_Scheideler_Setzer, title={Provably Anonymous Communication
    Based on Trusted Execution Environments}, author={Blömer, Johannes and Bobolz,
    Jan and Scheideler, Christian and Setzer, Alexander} }'
  chicago: Blömer, Johannes, Jan Bobolz, Christian Scheideler, and Alexander Setzer.
    <i>Provably Anonymous Communication Based on Trusted Execution Environments</i>,
    n.d.
  ieee: J. Blömer, J. Bobolz, C. Scheideler, and A. Setzer, <i>Provably Anonymous
    Communication Based on Trusted Execution Environments</i>. .
  mla: Blömer, Johannes, et al. <i>Provably Anonymous Communication Based on Trusted
    Execution Environments</i>.
  short: J. Blömer, J. Bobolz, C. Scheideler, A. Setzer, Provably Anonymous Communication
    Based on Trusted Execution Environments, n.d.
date_created: 2018-11-25T08:08:40Z
date_updated: 2022-01-06T07:02:43Z
ddc:
- '000'
department:
- _id: '7'
- _id: '64'
- _id: '79'
file:
- access_level: closed
  content_type: application/pdf
  creator: jbobolz
  date_created: 2018-12-31T09:55:30Z
  date_updated: 2018-12-31T09:55:30Z
  file_id: '6435'
  file_name: draft-2018.pdf
  file_size: 470968
  relation: main_file
  success: 1
file_date_updated: 2018-12-31T09:55:30Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '13'
  name: SFB 901 - Subproject C1
publication_status: draft
status: public
title: Provably Anonymous Communication Based on Trusted Execution Environments
type: working_paper
user_id: '27207'
year: '2018'
...
---
_id: '5984'
alternative_title:
- Special Issue of SIROCCO 2015
author:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
citation:
  ama: Scheideler C. Preface. <i>Theor Comput Sci</i>. 2018;751:1. doi:<a href="https://doi.org/10.1016/j.tcs.2018.11.004">10.1016/j.tcs.2018.11.004</a>
  apa: Scheideler, C. (2018). Preface. <i>Theor. Comput. Sci.</i>, <i>751</i>, 1.
    <a href="https://doi.org/10.1016/j.tcs.2018.11.004">https://doi.org/10.1016/j.tcs.2018.11.004</a>
  bibtex: '@article{Scheideler_2018, title={Preface}, volume={751}, DOI={<a href="https://doi.org/10.1016/j.tcs.2018.11.004">10.1016/j.tcs.2018.11.004</a>},
    journal={Theor. Comput. Sci.}, author={Scheideler, Christian}, year={2018}, pages={1}
    }'
  chicago: 'Scheideler, Christian. “Preface.” <i>Theor. Comput. Sci.</i> 751 (2018):
    1. <a href="https://doi.org/10.1016/j.tcs.2018.11.004">https://doi.org/10.1016/j.tcs.2018.11.004</a>.'
  ieee: C. Scheideler, “Preface,” <i>Theor. Comput. Sci.</i>, vol. 751, p. 1, 2018.
  mla: Scheideler, Christian. “Preface.” <i>Theor. Comput. Sci.</i>, vol. 751, 2018,
    p. 1, doi:<a href="https://doi.org/10.1016/j.tcs.2018.11.004">10.1016/j.tcs.2018.11.004</a>.
  short: C. Scheideler, Theor. Comput. Sci. 751 (2018) 1.
date_created: 2018-11-30T08:08:23Z
date_updated: 2022-01-06T07:02:49Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1016/j.tcs.2018.11.004
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2019-01-11T10:20:16Z
  date_updated: 2019-01-11T10:20:16Z
  file_id: '6620'
  file_name: Preface.pdf
  file_size: 112676
  relation: main_file
  success: 1
file_date_updated: 2019-01-11T10:20:16Z
has_accepted_license: '1'
intvolume: '       751'
language:
- iso: eng
page: '1'
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publication: Theor. Comput. Sci.
status: public
title: Preface
type: journal_article
user_id: '15504'
volume: 751
year: '2018'
...
---
_id: '5985'
author:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
citation:
  ama: 'Scheideler C. Relays: Towards a Link Layer for Robust and Secure Fog Computing.
    In: <i>Proceedings of the 2018 Workshop on Theory and Practice for Integrated
    Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom,
    July 27, 2018</i>. ; 2018:1-2. doi:<a href="https://doi.org/10.1145/3229774.3229781">10.1145/3229774.3229781</a>'
  apa: 'Scheideler, C. (2018). Relays: Towards a Link Layer for Robust and Secure
    Fog Computing. In <i>Proceedings of the 2018 Workshop on Theory and Practice for
    Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United
    Kingdom, July 27, 2018</i> (pp. 1–2). <a href="https://doi.org/10.1145/3229774.3229781">https://doi.org/10.1145/3229774.3229781</a>'
  bibtex: '@inproceedings{Scheideler_2018, title={Relays: Towards a Link Layer for
    Robust and Secure Fog Computing}, DOI={<a href="https://doi.org/10.1145/3229774.3229781">10.1145/3229774.3229781</a>},
    booktitle={Proceedings of the 2018 Workshop on Theory and Practice for Integrated
    Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom,
    July 27, 2018}, author={Scheideler, Christian}, year={2018}, pages={1–2} }'
  chicago: 'Scheideler, Christian. “Relays: Towards a Link Layer for Robust and Secure
    Fog Computing.” In <i>Proceedings of the 2018 Workshop on Theory and Practice
    for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham,
    United Kingdom, July 27, 2018</i>, 1–2, 2018. <a href="https://doi.org/10.1145/3229774.3229781">https://doi.org/10.1145/3229774.3229781</a>.'
  ieee: 'C. Scheideler, “Relays: Towards a Link Layer for Robust and Secure Fog Computing,”
    in <i>Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud,
    Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July
    27, 2018</i>, 2018, pp. 1–2.'
  mla: 'Scheideler, Christian. “Relays: Towards a Link Layer for Robust and Secure
    Fog Computing.” <i>Proceedings of the 2018 Workshop on Theory and Practice for
    Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United
    Kingdom, July 27, 2018</i>, 2018, pp. 1–2, doi:<a href="https://doi.org/10.1145/3229774.3229781">10.1145/3229774.3229781</a>.'
  short: 'C. Scheideler, in: Proceedings of the 2018 Workshop on Theory and Practice
    for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham,
    United Kingdom, July 27, 2018, 2018, pp. 1–2.'
date_created: 2018-11-30T08:11:27Z
date_updated: 2022-01-06T07:02:49Z
ddc:
- '004'
department:
- _id: '79'
doi: 10.1145/3229774.3229781
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-12-12T15:12:02Z
  date_updated: 2018-12-12T15:12:02Z
  file_id: '6194'
  file_name: p1-scheideler.pdf
  file_size: 1420210
  relation: main_file
file_date_updated: 2018-12-12T15:12:02Z
has_accepted_license: '1'
language:
- iso: eng
page: 1-2
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '13'
  name: SFB 901 - Subproject C1
publication: Proceedings of the 2018 Workshop on Theory and Practice for Integrated
  Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom,
  July 27, 2018
status: public
title: 'Relays: Towards a Link Layer for Robust and Secure Fog Computing'
type: conference
user_id: '477'
year: '2018'
...
---
_id: '5986'
author:
- first_name: Robert
  full_name: Gmyr, Robert
  last_name: Gmyr
- first_name: Kristian
  full_name: Hinnenthal, Kristian
  id: '32229'
  last_name: Hinnenthal
- first_name: Irina
  full_name: Kostitsyna, Irina
  last_name: Kostitsyna
- first_name: Fabian
  full_name: Kuhn, Fabian
  last_name: Kuhn
- first_name: Dorian
  full_name: Rudolph, Dorian
  last_name: Rudolph
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
citation:
  ama: 'Gmyr R, Hinnenthal K, Kostitsyna I, Kuhn F, Rudolph D, Scheideler C. Shape
    Recognition by a Finite Automaton Robot. In: <i>43rd International Symposium on
    Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool,
    UK</i>. ; 2018:52:1-52:15. doi:<a href="https://doi.org/10.4230/LIPIcs.MFCS.2018.52">10.4230/LIPIcs.MFCS.2018.52</a>'
  apa: Gmyr, R., Hinnenthal, K., Kostitsyna, I., Kuhn, F., Rudolph, D., &#38; Scheideler,
    C. (2018). Shape Recognition by a Finite Automaton Robot. In <i>43rd International
    Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31,
    2018, Liverpool, UK</i> (pp. 52:1-52:15). <a href="https://doi.org/10.4230/LIPIcs.MFCS.2018.52">https://doi.org/10.4230/LIPIcs.MFCS.2018.52</a>
  bibtex: '@inproceedings{Gmyr_Hinnenthal_Kostitsyna_Kuhn_Rudolph_Scheideler_2018,
    title={Shape Recognition by a Finite Automaton Robot}, DOI={<a href="https://doi.org/10.4230/LIPIcs.MFCS.2018.52">10.4230/LIPIcs.MFCS.2018.52</a>},
    booktitle={43rd International Symposium on Mathematical Foundations of Computer
    Science, MFCS 2018, August 27-31, 2018, Liverpool, UK}, author={Gmyr, Robert and
    Hinnenthal, Kristian and Kostitsyna, Irina and Kuhn, Fabian and Rudolph, Dorian
    and Scheideler, Christian}, year={2018}, pages={52:1-52:15} }'
  chicago: Gmyr, Robert, Kristian Hinnenthal, Irina Kostitsyna, Fabian Kuhn, Dorian
    Rudolph, and Christian Scheideler. “Shape Recognition by a Finite Automaton Robot.”
    In <i>43rd International Symposium on Mathematical Foundations of Computer Science,
    MFCS 2018, August 27-31, 2018, Liverpool, UK</i>, 52:1-52:15, 2018. <a href="https://doi.org/10.4230/LIPIcs.MFCS.2018.52">https://doi.org/10.4230/LIPIcs.MFCS.2018.52</a>.
  ieee: R. Gmyr, K. Hinnenthal, I. Kostitsyna, F. Kuhn, D. Rudolph, and C. Scheideler,
    “Shape Recognition by a Finite Automaton Robot,” in <i>43rd International Symposium
    on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018,
    Liverpool, UK</i>, 2018, pp. 52:1-52:15.
  mla: Gmyr, Robert, et al. “Shape Recognition by a Finite Automaton Robot.” <i>43rd
    International Symposium on Mathematical Foundations of Computer Science, MFCS
    2018, August 27-31, 2018, Liverpool, UK</i>, 2018, pp. 52:1-52:15, doi:<a href="https://doi.org/10.4230/LIPIcs.MFCS.2018.52">10.4230/LIPIcs.MFCS.2018.52</a>.
  short: 'R. Gmyr, K. Hinnenthal, I. Kostitsyna, F. Kuhn, D. Rudolph, C. Scheideler,
    in: 43rd International Symposium on Mathematical Foundations of Computer Science,
    MFCS 2018, August 27-31, 2018, Liverpool, UK, 2018, pp. 52:1-52:15.'
date_created: 2018-11-30T08:13:58Z
date_updated: 2022-01-06T07:02:49Z
department:
- _id: '79'
doi: 10.4230/LIPIcs.MFCS.2018.52
language:
- iso: eng
page: 52:1-52:15
publication: 43rd International Symposium on Mathematical Foundations of Computer
  Science, MFCS 2018, August 27-31, 2018, Liverpool, UK
status: public
title: Shape Recognition by a Finite Automaton Robot
type: conference
user_id: '15504'
year: '2018'
...
---
_id: '4411'
abstract:
- lang: eng
  text: "While a lot of research in distributed computing has covered solutions for
    self-stabilizing computing and topologies, there is far less work on self-stabilization
    for distributed data structures.\r\nConsidering crashing peers in peer-to-peer
    networks, it should not be taken for granted that a distributed data structure
    remains intact.\r\nIn this work, we present a self-stabilizing protocol for a
    distributed data structure called the hashed Patricia Trie (Kniesburges and Scheideler
    WALCOM'11) that enables efficient prefix search on a set of keys.\r\nThe data
    structure has a wide area of applications including string matching problems while
    offering low overhead and efficient operations when embedded on top of a distributed
    hash table.\r\nEspecially, longest prefix matching for $x$ can be done in $\\mathcal{O}(\\log
    |x|)$ hash table read accesses.\r\nWe show how to maintain the structure in a
    self-stabilizing way.\r\nOur protocol assures low overhead in a legal state and
    a total (asymptotically optimal) memory demand of $\\Theta(d)$ bits, where $d$
    is the number of bits needed for storing all keys."
author:
- first_name: Till
  full_name: Knollmann, Till
  id: '39241'
  last_name: Knollmann
  orcid: 0000-0003-2014-4696
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
citation:
  ama: 'Knollmann T, Scheideler C. A Self-Stabilizing Hashed Patricia Trie. In: Izumi
    T, Kuznetsov P, eds. <i>Proceedings of the 20th International Symposium on Stabilization,
    Safety, and Security of Distributed Systems (SSS)</i>. Vol 11201. Lecture Notes
    of Computer Science. Springer, Cham; 2018. doi:<a href="https://doi.org/10.1007/978-3-030-03232-6_1">10.1007/978-3-030-03232-6_1</a>'
  apa: 'Knollmann, T., &#38; Scheideler, C. (2018). A Self-Stabilizing Hashed Patricia
    Trie. In T. Izumi &#38; P. Kuznetsov (Eds.), <i>Proceedings of the 20th International
    Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>
    (Vol. 11201). Tokyo: Springer, Cham. <a href="https://doi.org/10.1007/978-3-030-03232-6_1">https://doi.org/10.1007/978-3-030-03232-6_1</a>'
  bibtex: '@inproceedings{Knollmann_Scheideler_2018, series={Lecture Notes of Computer
    Science}, title={A Self-Stabilizing Hashed Patricia Trie}, volume={11201}, DOI={<a
    href="https://doi.org/10.1007/978-3-030-03232-6_1">10.1007/978-3-030-03232-6_1</a>},
    booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety,
    and Security of Distributed Systems (SSS)}, publisher={Springer, Cham}, author={Knollmann,
    Till and Scheideler, Christian}, editor={Izumi, Taisuke and Kuznetsov, PetrEditors},
    year={2018}, collection={Lecture Notes of Computer Science} }'
  chicago: Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia
    Trie.” In <i>Proceedings of the 20th International Symposium on Stabilization,
    Safety, and Security of Distributed Systems (SSS)</i>, edited by Taisuke Izumi
    and Petr Kuznetsov, Vol. 11201. Lecture Notes of Computer Science. Springer, Cham,
    2018. <a href="https://doi.org/10.1007/978-3-030-03232-6_1">https://doi.org/10.1007/978-3-030-03232-6_1</a>.
  ieee: T. Knollmann and C. Scheideler, “A Self-Stabilizing Hashed Patricia Trie,”
    in <i>Proceedings of the 20th International Symposium on Stabilization, Safety,
    and Security of Distributed Systems (SSS)</i>, Tokyo, 2018, vol. 11201.
  mla: Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia
    Trie.” <i>Proceedings of the 20th International Symposium on Stabilization, Safety,
    and Security of Distributed Systems (SSS)</i>, edited by Taisuke Izumi and Petr
    Kuznetsov, vol. 11201, Springer, Cham, 2018, doi:<a href="https://doi.org/10.1007/978-3-030-03232-6_1">10.1007/978-3-030-03232-6_1</a>.
  short: 'T. Knollmann, C. Scheideler, in: T. Izumi, P. Kuznetsov (Eds.), Proceedings
    of the 20th International Symposium on Stabilization, Safety, and Security of
    Distributed Systems (SSS), Springer, Cham, 2018.'
conference:
  end_date: 2018-11-07
  location: Tokyo
  name: 20th International Symposium on Stabilization, Safety, and Security of Distributed
    Systems (SSS)
  start_date: 2018-11-04
date_created: 2018-09-17T13:12:18Z
date_updated: 2022-01-06T07:01:02Z
ddc:
- '000'
department:
- _id: '63'
- _id: '79'
doi: 10.1007/978-3-030-03232-6_1
editor:
- first_name: Taisuke
  full_name: Izumi, Taisuke
  last_name: Izumi
- first_name: Petr
  full_name: Kuznetsov, Petr
  last_name: Kuznetsov
external_id:
  arxiv:
  - '1809.04923'
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T14:38:37Z
  date_updated: 2018-11-02T14:38:37Z
  file_id: '5277'
  file_name: ASelf-stabilizingHashedPatrici.pdf
  file_size: 500005
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T14:38:37Z
has_accepted_license: '1'
intvolume: '     11201'
keyword:
- Self-Stabilizing
- Prefix Search
- Distributed Data Structure
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publication: Proceedings of the 20th International Symposium on Stabilization, Safety,
  and Security of Distributed Systems (SSS)
publisher: Springer, Cham
series_title: Lecture Notes of Computer Science
status: public
title: A Self-Stabilizing Hashed Patricia Trie
type: conference
user_id: '39241'
volume: 11201
year: '2018'
...
---
_id: '4563'
abstract:
- lang: eng
  text: "Routing is a challenging problem for wireless ad hoc networks, especially
    when the nodes are mobile and spread so widely that in most cases multiple hops
    are needed to route a message from one node to another. In fact, it is known that
    any online routing protocol has a poor performance in the worst case, in a sense
    that there is a distribution of nodes resulting in bad routing paths for that
    protocol, even if the nodes know their geographic positions and the geographic
    position of the destination of a message is known. The reason for that is that
    radio holes in the ad hoc network may require messages to take long detours in
    order to get to a destination, which are hard to find in an online fashion.\r\n\r\nIn
    this paper, we assume that the wireless ad hoc network can make limited use of
    long-range links provided by a global communication infrastructure like a cellular
    infrastructure or a satellite in order to compute an abstraction of the wireless
    ad hoc network that allows the messages to be sent along near-shortest paths in
    the ad hoc network. We present distributed algorithms that compute an abstraction
    of the ad hoc network in $\\mathcal{O}\\left(\\log ^2 n\\right)$ time using long-range
    links, which results in $c$-competitive routing paths between any two nodes of
    the ad hoc network for some constant $c$ if the convex hulls of the radio holes
    do not intersect. We also show that the storage needed for the abstraction just
    depends on the number and size of the radio holes in the wireless ad hoc network
    and is independent on the total number of nodes, and this information just has
    to be known to a few nodes for the routing to work.\r\n"
author:
- first_name: Daniel
  full_name: Jung, Daniel
  id: '37827'
  last_name: Jung
- first_name: Christina
  full_name: Kolb, Christina
  id: '43647'
  last_name: Kolb
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Jannik
  full_name: Sundermeier, Jannik
  id: '38705'
  last_name: Sundermeier
citation:
  ama: 'Jung D, Kolb C, Scheideler C, Sundermeier J. Competitive Routing in Hybrid
    Communication Networks. In: <i>Proceedings of the 14th International Symposium
    on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) </i>. Springer;
    2018.'
  apa: 'Jung, D., Kolb, C., Scheideler, C., &#38; Sundermeier, J. (2018). Competitive
    Routing in Hybrid Communication Networks. In <i>Proceedings of the 14th International
    Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) </i>.
    Helsinki: Springer.'
  bibtex: '@inproceedings{Jung_Kolb_Scheideler_Sundermeier_2018, title={Competitive
    Routing in Hybrid Communication Networks}, booktitle={Proceedings of the 14th
    International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS)
    }, publisher={Springer}, author={Jung, Daniel and Kolb, Christina and Scheideler,
    Christian and Sundermeier, Jannik}, year={2018} }'
  chicago: Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier.
    “Competitive Routing in Hybrid Communication Networks.” In <i>Proceedings of the
    14th International Symposium on Algorithms and Experiments for Wireless Networks
    (ALGOSENSORS) </i>. Springer, 2018.
  ieee: D. Jung, C. Kolb, C. Scheideler, and J. Sundermeier, “Competitive Routing
    in Hybrid Communication Networks,” in <i>Proceedings of the 14th International
    Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) </i>,
    Helsinki, 2018.
  mla: Jung, Daniel, et al. “Competitive Routing in Hybrid Communication Networks.”
    <i>Proceedings of the 14th International Symposium on Algorithms and Experiments
    for Wireless Networks (ALGOSENSORS) </i>, Springer, 2018.
  short: 'D. Jung, C. Kolb, C. Scheideler, J. Sundermeier, in: Proceedings of the
    14th International Symposium on Algorithms and Experiments for Wireless Networks
    (ALGOSENSORS) , Springer, 2018.'
conference:
  end_date: 2018-08-24
  location: Helsinki
  name: '14th International Symposium on Algorithms and Experiments for Wireless Networks
    (ALGOSENSORS) '
  start_date: 2018-08-23
date_created: 2018-10-02T07:06:05Z
date_updated: 2022-01-06T07:01:11Z
ddc:
- '000'
department:
- _id: '63'
- _id: '79'
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2019-01-11T10:32:38Z
  date_updated: 2019-01-11T10:32:38Z
  file_id: '6621'
  file_name: 23hybrid.pdf
  file_size: 349034
  relation: main_file
  success: 1
file_date_updated: 2019-01-11T10:32:38Z
has_accepted_license: '1'
keyword:
- greedy routing
- ad hoc networks
- convex hulls
- c-competitiveness
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publication: 'Proceedings of the 14th International Symposium on Algorithms and Experiments
  for Wireless Networks (ALGOSENSORS) '
publisher: Springer
status: public
title: Competitive Routing in Hybrid Communication Networks
type: conference
user_id: '38705'
year: '2018'
...
---
_id: '4565'
author:
- first_name: Daniel
  full_name: Jung, Daniel
  id: '37827'
  last_name: Jung
- first_name: Christina
  full_name: Kolb, Christina
  id: '43647'
  last_name: Kolb
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Jannik
  full_name: Sundermeier, Jannik
  id: '38705'
  last_name: Sundermeier
citation:
  ama: 'Jung D, Kolb C, Scheideler C, Sundermeier J. Brief Announcement: Competitive
    Routing in Hybrid Communication Networks. In: <i>Proceedings of the 30th on Symposium
    on Parallelism in Algorithms and Architectures (SPAA)</i>. ACM Press; 2018. doi:<a
    href="https://doi.org/10.1145/3210377.3210663">10.1145/3210377.3210663</a>'
  apa: 'Jung, D., Kolb, C., Scheideler, C., &#38; Sundermeier, J. (2018). Brief Announcement:
    Competitive Routing in Hybrid Communication Networks. In <i>Proceedings of the
    30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. Wien:
    ACM Press. <a href="https://doi.org/10.1145/3210377.3210663">https://doi.org/10.1145/3210377.3210663</a>'
  bibtex: '@inproceedings{Jung_Kolb_Scheideler_Sundermeier_2018, title={Brief Announcement:
    Competitive Routing in Hybrid Communication Networks}, DOI={<a href="https://doi.org/10.1145/3210377.3210663">10.1145/3210377.3210663</a>},
    booktitle={Proceedings of the 30th on Symposium on Parallelism in Algorithms and
    Architectures (SPAA)}, publisher={ACM Press}, author={Jung, Daniel and Kolb, Christina
    and Scheideler, Christian and Sundermeier, Jannik}, year={2018} }'
  chicago: 'Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier.
    “Brief Announcement: Competitive Routing in Hybrid Communication Networks.” In
    <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures
    (SPAA)</i>. ACM Press, 2018. <a href="https://doi.org/10.1145/3210377.3210663">https://doi.org/10.1145/3210377.3210663</a>.'
  ieee: 'D. Jung, C. Kolb, C. Scheideler, and J. Sundermeier, “Brief Announcement:
    Competitive Routing in Hybrid Communication Networks,” in <i>Proceedings of the
    30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, Wien,
    2018.'
  mla: 'Jung, Daniel, et al. “Brief Announcement: Competitive Routing in Hybrid Communication
    Networks.” <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms
    and Architectures (SPAA)</i>, ACM Press, 2018, doi:<a href="https://doi.org/10.1145/3210377.3210663">10.1145/3210377.3210663</a>.'
  short: 'D. Jung, C. Kolb, C. Scheideler, J. Sundermeier, in: Proceedings of the
    30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM Press,
    2018.'
conference:
  end_date: 2018-07-18
  location: Wien
  name: SPAA'18
  start_date: 2018-07-17
date_created: 2018-10-02T07:34:47Z
date_updated: 2022-01-06T07:01:12Z
ddc:
- '000'
department:
- _id: '63'
- _id: '79'
doi: 10.1145/3210377.3210663
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T13:48:10Z
  date_updated: 2018-11-02T13:48:10Z
  file_id: '5254'
  file_name: p231-jung-1.pdf
  file_size: 1025077
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T13:48:10Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publication: Proceedings of the 30th on Symposium on Parallelism in Algorithms and
  Architectures (SPAA)
publication_identifier:
  isbn:
  - '9781450357999'
publication_status: published
publisher: ACM Press
status: public
title: 'Brief Announcement: Competitive Routing in Hybrid Communication Networks'
type: conference
user_id: '38705'
year: '2018'
...