---
_id: '8750'
abstract:
- lang: eng
  text: In this article we propose a descent method for equality and inequality constrained
    multiobjective optimization problems (MOPs) which generalizes the steepest descent
    method for unconstrained MOPs by Fliege and Svaiter to constrained problems by
    using two active set strategies. Under some regularity assumptions on the problem,
    we show that accumulation points of our descent method satisfy a necessary condition
    for local Pareto optimality. Finally, we show the typical behavior of our method
    in a numerical example.
author:
- first_name: Bennet
  full_name: Gebken, Bennet
  id: '32643'
  last_name: Gebken
- first_name: Sebastian
  full_name: Peitz, Sebastian
  id: '47427'
  last_name: Peitz
  orcid: https://orcid.org/0000-0002-3389-793X
- first_name: Michael
  full_name: Dellnitz, Michael
  last_name: Dellnitz
citation:
  ama: 'Gebken B, Peitz S, Dellnitz M. A Descent Method for Equality and Inequality
    Constrained Multiobjective Optimization Problems. In: <i>Numerical and Evolutionary
    Optimization – NEO 2017</i>. Cham; 2018. doi:<a href="https://doi.org/10.1007/978-3-319-96104-0_2">10.1007/978-3-319-96104-0_2</a>'
  apa: Gebken, B., Peitz, S., &#38; Dellnitz, M. (2018). A Descent Method for Equality
    and Inequality Constrained Multiobjective Optimization Problems. In <i>Numerical
    and Evolutionary Optimization – NEO 2017</i>. Cham. <a href="https://doi.org/10.1007/978-3-319-96104-0_2">https://doi.org/10.1007/978-3-319-96104-0_2</a>
  bibtex: '@inproceedings{Gebken_Peitz_Dellnitz_2018, place={Cham}, title={A Descent
    Method for Equality and Inequality Constrained Multiobjective Optimization Problems},
    DOI={<a href="https://doi.org/10.1007/978-3-319-96104-0_2">10.1007/978-3-319-96104-0_2</a>},
    booktitle={Numerical and Evolutionary Optimization – NEO 2017}, author={Gebken,
    Bennet and Peitz, Sebastian and Dellnitz, Michael}, year={2018} }'
  chicago: Gebken, Bennet, Sebastian Peitz, and Michael Dellnitz. “A Descent Method
    for Equality and Inequality Constrained Multiobjective Optimization Problems.”
    In <i>Numerical and Evolutionary Optimization – NEO 2017</i>. Cham, 2018. <a href="https://doi.org/10.1007/978-3-319-96104-0_2">https://doi.org/10.1007/978-3-319-96104-0_2</a>.
  ieee: B. Gebken, S. Peitz, and M. Dellnitz, “A Descent Method for Equality and Inequality
    Constrained Multiobjective Optimization Problems,” in <i>Numerical and Evolutionary
    Optimization – NEO 2017</i>, 2018.
  mla: Gebken, Bennet, et al. “A Descent Method for Equality and Inequality Constrained
    Multiobjective Optimization Problems.” <i>Numerical and Evolutionary Optimization
    – NEO 2017</i>, 2018, doi:<a href="https://doi.org/10.1007/978-3-319-96104-0_2">10.1007/978-3-319-96104-0_2</a>.
  short: 'B. Gebken, S. Peitz, M. Dellnitz, in: Numerical and Evolutionary Optimization
    – NEO 2017, Cham, 2018.'
conference:
  name: 'NEO 2017: Numerical and Evolutionary Optimization'
date_created: 2019-03-29T13:26:47Z
date_updated: 2022-01-06T07:04:00Z
department:
- _id: '101'
doi: 10.1007/978-3-319-96104-0_2
language:
- iso: eng
place: Cham
publication: Numerical and Evolutionary Optimization – NEO 2017
publication_identifier:
  isbn:
  - '9783319961033'
  - '9783319961040'
  issn:
  - 1860-949X
  - 1860-9503
publication_status: published
status: public
title: A Descent Method for Equality and Inequality Constrained Multiobjective Optimization
  Problems
type: conference
user_id: '47427'
year: '2018'
...
---
_id: '8751'
abstract:
- lang: eng
  text: Multiobjective optimization plays an increasingly important role in modern
    applications, where several criteria are often of equal importance. The task in
    multiobjective optimization and multiobjective optimal control is therefore to
    compute the set of optimal compromises (the Pareto set) between the conflicting
    objectives. The advances in algorithms and the increasing interest in Pareto-optimal
    solutions have led to a wide range of new applications related to optimal and
    feedback control, which results in new challenges such as expensive models or
    real-time applicability. Since the Pareto set generally consists of an infinite
    number of solutions, the computational effort can quickly become challenging,
    which is particularly problematic when the objectives are costly to evaluate or
    when a solution has to be presented very quickly. This article gives an overview
    of recent developments in accelerating multiobjective optimal control for complex
    problems where either PDE constraints are present or where a feedback behavior
    has to be achieved. In the first case, surrogate models yield significant speed-ups.
    Besides classical meta-modeling techniques for multiobjective optimization, a
    promising alternative for control problems is to introduce a surrogate model for
    the system dynamics. In the case of real-time requirements, various promising
    model predictive control approaches have been proposed, using either fast online
    solvers or offline-online decomposition. We also briefly comment on dimension
    reduction in many-objective optimization problems as another technique for reducing
    the numerical effort.
article_type: review
author:
- first_name: Sebastian
  full_name: Peitz, Sebastian
  id: '47427'
  last_name: Peitz
  orcid: https://orcid.org/0000-0002-3389-793X
- first_name: Michael
  full_name: Dellnitz, Michael
  last_name: Dellnitz
citation:
  ama: Peitz S, Dellnitz M. A Survey of Recent Trends in Multiobjective Optimal Control—Surrogate
    Models, Feedback Control and Objective Reduction. <i>Mathematical and Computational
    Applications</i>. 2018;23(2). doi:<a href="https://doi.org/10.3390/mca23020030">10.3390/mca23020030</a>
  apa: Peitz, S., &#38; Dellnitz, M. (2018). A Survey of Recent Trends in Multiobjective
    Optimal Control—Surrogate Models, Feedback Control and Objective Reduction. <i>Mathematical
    and Computational Applications</i>, <i>23</i>(2). <a href="https://doi.org/10.3390/mca23020030">https://doi.org/10.3390/mca23020030</a>
  bibtex: '@article{Peitz_Dellnitz_2018, title={A Survey of Recent Trends in Multiobjective
    Optimal Control—Surrogate Models, Feedback Control and Objective Reduction}, volume={23},
    DOI={<a href="https://doi.org/10.3390/mca23020030">10.3390/mca23020030</a>}, number={2},
    journal={Mathematical and Computational Applications}, author={Peitz, Sebastian
    and Dellnitz, Michael}, year={2018} }'
  chicago: Peitz, Sebastian, and Michael Dellnitz. “A Survey of Recent Trends in Multiobjective
    Optimal Control—Surrogate Models, Feedback Control and Objective Reduction.” <i>Mathematical
    and Computational Applications</i> 23, no. 2 (2018). <a href="https://doi.org/10.3390/mca23020030">https://doi.org/10.3390/mca23020030</a>.
  ieee: S. Peitz and M. Dellnitz, “A Survey of Recent Trends in Multiobjective Optimal
    Control—Surrogate Models, Feedback Control and Objective Reduction,” <i>Mathematical
    and Computational Applications</i>, vol. 23, no. 2, 2018.
  mla: Peitz, Sebastian, and Michael Dellnitz. “A Survey of Recent Trends in Multiobjective
    Optimal Control—Surrogate Models, Feedback Control and Objective Reduction.” <i>Mathematical
    and Computational Applications</i>, vol. 23, no. 2, 2018, doi:<a href="https://doi.org/10.3390/mca23020030">10.3390/mca23020030</a>.
  short: S. Peitz, M. Dellnitz, Mathematical and Computational Applications 23 (2018).
date_created: 2019-03-29T13:27:51Z
date_updated: 2022-01-06T07:04:00Z
department:
- _id: '101'
doi: 10.3390/mca23020030
intvolume: '        23'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://www.mdpi.com/2297-8747/23/2/30/pdf
oa: '1'
publication: Mathematical and Computational Applications
publication_identifier:
  issn:
  - 2297-8747
publication_status: published
status: public
title: A Survey of Recent Trends in Multiobjective Optimal Control—Surrogate Models,
  Feedback Control and Objective Reduction
type: journal_article
user_id: '47427'
volume: 23
year: '2018'
...
---
_id: '8754'
abstract:
- lang: eng
  text: In this chapter, we combine a global, derivative-free subdivision algorithm
    for multiobjective optimization problems with a posteriori error estimates for
    reduced-order models based on Proper Orthogonal Decomposition in order to efficiently
    solve multiobjective optimization problems governed by partial differential equations.
    An error bound for a semilinear heat equation is developed in such a way that
    the errors in the conflicting objectives can be estimated individually. The resulting
    algorithm constructs a library of locally valid reduced-order models online using
    a Greedy (worst-first) search. Using this approach, the number of evaluations
    of the full-order model can be reduced by a factor of more than 1000.
author:
- first_name: Dennis
  full_name: Beermann, Dennis
  last_name: Beermann
- first_name: Michael
  full_name: Dellnitz, Michael
  last_name: Dellnitz
- first_name: Sebastian
  full_name: Peitz, Sebastian
  id: '47427'
  last_name: Peitz
  orcid: https://orcid.org/0000-0002-3389-793X
- first_name: Stefan
  full_name: Volkwein, Stefan
  last_name: Volkwein
citation:
  ama: 'Beermann D, Dellnitz M, Peitz S, Volkwein S. Set-Oriented Multiobjective Optimal
    Control of PDEs Using Proper Orthogonal Decomposition. In: <i>Reduced-Order Modeling
    (ROM) for Simulation and Optimization</i>. Cham; 2018:47-72. doi:<a href="https://doi.org/10.1007/978-3-319-75319-5_3">10.1007/978-3-319-75319-5_3</a>'
  apa: Beermann, D., Dellnitz, M., Peitz, S., &#38; Volkwein, S. (2018). Set-Oriented
    Multiobjective Optimal Control of PDEs Using Proper Orthogonal Decomposition.
    In <i>Reduced-Order Modeling (ROM) for Simulation and Optimization</i> (pp. 47–72).
    Cham. <a href="https://doi.org/10.1007/978-3-319-75319-5_3">https://doi.org/10.1007/978-3-319-75319-5_3</a>
  bibtex: '@inbook{Beermann_Dellnitz_Peitz_Volkwein_2018, place={Cham}, title={Set-Oriented
    Multiobjective Optimal Control of PDEs Using Proper Orthogonal Decomposition},
    DOI={<a href="https://doi.org/10.1007/978-3-319-75319-5_3">10.1007/978-3-319-75319-5_3</a>},
    booktitle={Reduced-Order Modeling (ROM) for Simulation and Optimization}, author={Beermann,
    Dennis and Dellnitz, Michael and Peitz, Sebastian and Volkwein, Stefan}, year={2018},
    pages={47–72} }'
  chicago: Beermann, Dennis, Michael Dellnitz, Sebastian Peitz, and Stefan Volkwein.
    “Set-Oriented Multiobjective Optimal Control of PDEs Using Proper Orthogonal Decomposition.”
    In <i>Reduced-Order Modeling (ROM) for Simulation and Optimization</i>, 47–72.
    Cham, 2018. <a href="https://doi.org/10.1007/978-3-319-75319-5_3">https://doi.org/10.1007/978-3-319-75319-5_3</a>.
  ieee: D. Beermann, M. Dellnitz, S. Peitz, and S. Volkwein, “Set-Oriented Multiobjective
    Optimal Control of PDEs Using Proper Orthogonal Decomposition,” in <i>Reduced-Order
    Modeling (ROM) for Simulation and Optimization</i>, Cham, 2018, pp. 47–72.
  mla: Beermann, Dennis, et al. “Set-Oriented Multiobjective Optimal Control of PDEs
    Using Proper Orthogonal Decomposition.” <i>Reduced-Order Modeling (ROM) for Simulation
    and Optimization</i>, 2018, pp. 47–72, doi:<a href="https://doi.org/10.1007/978-3-319-75319-5_3">10.1007/978-3-319-75319-5_3</a>.
  short: 'D. Beermann, M. Dellnitz, S. Peitz, S. Volkwein, in: Reduced-Order Modeling
    (ROM) for Simulation and Optimization, Cham, 2018, pp. 47–72.'
date_created: 2019-03-29T13:31:20Z
date_updated: 2022-01-06T07:04:00Z
department:
- _id: '101'
doi: 10.1007/978-3-319-75319-5_3
language:
- iso: eng
page: 47-72
place: Cham
project:
- _id: '52'
  name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: Reduced-Order Modeling (ROM) for Simulation and Optimization
publication_identifier:
  isbn:
  - '9783319753188'
  - '9783319753195'
publication_status: published
status: public
title: Set-Oriented Multiobjective Optimal Control of PDEs Using Proper Orthogonal
  Decomposition
type: book_chapter
user_id: '47427'
year: '2018'
...
---
_id: '8755'
abstract:
- lang: eng
  text: Dynamic mode decomposition (DMD) is a recently developed tool for the analysis
    of the behavior of complex dynamical systems. In this paper, we will propose an
    extension of DMD that exploits low-rank tensor decompositions of potentially high-dimensional
    data sets to compute the corresponding DMD modes and eigenvalues. The goal is
    to reduce the computational complexity and also the amount of memory required
    to store the data in order to mitigate the curse of dimensionality. The efficiency
    of these tensor-based methods will be illustrated with the aid of several different
    fluid dynamics problems such as the von Kármán vortex street and the simulation
    of two merging vortices.
article_type: original
author:
- first_name: Stefan
  full_name: Klus, Stefan
  last_name: Klus
- first_name: Patrick
  full_name: Gelß, Patrick
  last_name: Gelß
- first_name: Sebastian
  full_name: Peitz, Sebastian
  id: '47427'
  last_name: Peitz
  orcid: https://orcid.org/0000-0002-3389-793X
- first_name: Christof
  full_name: Schütte, Christof
  last_name: Schütte
citation:
  ama: Klus S, Gelß P, Peitz S, Schütte C. Tensor-based dynamic mode decomposition.
    <i>Nonlinearity</i>. 2018;31(7):3359-3380. doi:<a href="https://doi.org/10.1088/1361-6544/aabc8f">10.1088/1361-6544/aabc8f</a>
  apa: Klus, S., Gelß, P., Peitz, S., &#38; Schütte, C. (2018). Tensor-based dynamic
    mode decomposition. <i>Nonlinearity</i>, <i>31</i>(7), 3359–3380. <a href="https://doi.org/10.1088/1361-6544/aabc8f">https://doi.org/10.1088/1361-6544/aabc8f</a>
  bibtex: '@article{Klus_Gelß_Peitz_Schütte_2018, title={Tensor-based dynamic mode
    decomposition}, volume={31}, DOI={<a href="https://doi.org/10.1088/1361-6544/aabc8f">10.1088/1361-6544/aabc8f</a>},
    number={7}, journal={Nonlinearity}, author={Klus, Stefan and Gelß, Patrick and
    Peitz, Sebastian and Schütte, Christof}, year={2018}, pages={3359–3380} }'
  chicago: 'Klus, Stefan, Patrick Gelß, Sebastian Peitz, and Christof Schütte. “Tensor-Based
    Dynamic Mode Decomposition.” <i>Nonlinearity</i> 31, no. 7 (2018): 3359–80. <a
    href="https://doi.org/10.1088/1361-6544/aabc8f">https://doi.org/10.1088/1361-6544/aabc8f</a>.'
  ieee: S. Klus, P. Gelß, S. Peitz, and C. Schütte, “Tensor-based dynamic mode decomposition,”
    <i>Nonlinearity</i>, vol. 31, no. 7, pp. 3359–3380, 2018.
  mla: Klus, Stefan, et al. “Tensor-Based Dynamic Mode Decomposition.” <i>Nonlinearity</i>,
    vol. 31, no. 7, 2018, pp. 3359–80, doi:<a href="https://doi.org/10.1088/1361-6544/aabc8f">10.1088/1361-6544/aabc8f</a>.
  short: S. Klus, P. Gelß, S. Peitz, C. Schütte, Nonlinearity 31 (2018) 3359–3380.
date_created: 2019-03-29T13:32:04Z
date_updated: 2022-01-06T07:04:00Z
department:
- _id: '101'
doi: 10.1088/1361-6544/aabc8f
intvolume: '        31'
issue: '7'
language:
- iso: eng
page: 3359-3380
project:
- _id: '52'
  name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: Nonlinearity
publication_identifier:
  issn:
  - 0951-7715
  - 1361-6544
publication_status: published
status: public
title: Tensor-based dynamic mode decomposition
type: journal_article
user_id: '47427'
volume: 31
year: '2018'
...
---
_id: '8757'
abstract:
- lang: eng
  text: A framework for set‐oriented multiobjective optimal control of partial differential
    equations using reduced order modeling has recently been developed [1]. Following
    concepts from localized reduced bases methods, error estimators for the reduced
    cost functionals are utilized to construct a library of locally valid reduced
    order models. This way, a superset of the Pareto set can efficiently be computed
    while maintaining a prescribed error bound. In this article, this algorithm is
    applied to a problem with non‐smooth objective functionals. Using an academic
    example, we show that the extension to non‐smooth problems can be realized in
    a straightforward manner. We then discuss the implications on the numerical results.
author:
- first_name: Dennis
  full_name: Beermann, Dennis
  last_name: Beermann
- first_name: Michael
  full_name: Dellnitz, Michael
  last_name: Dellnitz
- first_name: Sebastian
  full_name: Peitz, Sebastian
  id: '47427'
  last_name: Peitz
  orcid: https://orcid.org/0000-0002-3389-793X
- first_name: Stefan
  full_name: Volkwein, Stefan
  last_name: Volkwein
citation:
  ama: 'Beermann D, Dellnitz M, Peitz S, Volkwein S. POD-based multiobjective optimal
    control of PDEs with non-smooth objectives. In: <i>PAMM</i>. ; 2018:51-54. doi:<a
    href="https://doi.org/10.1002/pamm.201710015">10.1002/pamm.201710015</a>'
  apa: Beermann, D., Dellnitz, M., Peitz, S., &#38; Volkwein, S. (2018). POD-based
    multiobjective optimal control of PDEs with non-smooth objectives. In <i>PAMM</i>
    (pp. 51–54). <a href="https://doi.org/10.1002/pamm.201710015">https://doi.org/10.1002/pamm.201710015</a>
  bibtex: '@inproceedings{Beermann_Dellnitz_Peitz_Volkwein_2018, title={POD-based
    multiobjective optimal control of PDEs with non-smooth objectives}, DOI={<a href="https://doi.org/10.1002/pamm.201710015">10.1002/pamm.201710015</a>},
    booktitle={PAMM}, author={Beermann, Dennis and Dellnitz, Michael and Peitz, Sebastian
    and Volkwein, Stefan}, year={2018}, pages={51–54} }'
  chicago: Beermann, Dennis, Michael Dellnitz, Sebastian Peitz, and Stefan Volkwein.
    “POD-Based Multiobjective Optimal Control of PDEs with Non-Smooth Objectives.”
    In <i>PAMM</i>, 51–54, 2018. <a href="https://doi.org/10.1002/pamm.201710015">https://doi.org/10.1002/pamm.201710015</a>.
  ieee: D. Beermann, M. Dellnitz, S. Peitz, and S. Volkwein, “POD-based multiobjective
    optimal control of PDEs with non-smooth objectives,” in <i>PAMM</i>, 2018, pp.
    51–54.
  mla: Beermann, Dennis, et al. “POD-Based Multiobjective Optimal Control of PDEs
    with Non-Smooth Objectives.” <i>PAMM</i>, 2018, pp. 51–54, doi:<a href="https://doi.org/10.1002/pamm.201710015">10.1002/pamm.201710015</a>.
  short: 'D. Beermann, M. Dellnitz, S. Peitz, S. Volkwein, in: PAMM, 2018, pp. 51–54.'
date_created: 2019-03-29T13:34:25Z
date_updated: 2022-01-06T07:04:00Z
department:
- _id: '101'
doi: 10.1002/pamm.201710015
language:
- iso: eng
page: 51-54
project:
- _id: '52'
  name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: PAMM
publication_identifier:
  issn:
  - 1617-7061
publication_status: published
status: public
title: POD-based multiobjective optimal control of PDEs with non-smooth objectives
type: conference
user_id: '47427'
year: '2018'
...
---
_id: '8844'
author:
- first_name: Ivan
  full_name: Jovanovikj, Ivan
  id: '39187'
  last_name: Jovanovikj
  orcid: https://orcid.org/0000-0002-1838-794X
- first_name: Baris
  full_name: Güldali, Baris
  last_name: Güldali
citation:
  ama: 'Jovanovikj I, Güldali B. <i>Presentation: Who Guards the Guards? On the Validation
    of Test Case Migration</i>. User Conference on Advanced Automated Testing (UCAAT
    2018), Paris; 2018.'
  apa: 'Jovanovikj, I., &#38; Güldali, B. (2018). <i>Presentation: Who Guards the
    Guards? On the Validation of Test Case Migration</i>. User Conference on Advanced
    Automated Testing (UCAAT 2018), Paris.'
  bibtex: '@book{Jovanovikj_Güldali_2018, place={User Conference on Advanced Automated
    Testing (UCAAT 2018), Paris}, title={Presentation: Who Guards the Guards? On the
    Validation of Test Case Migration}, author={Jovanovikj, Ivan and Güldali, Baris},
    year={2018} }'
  chicago: 'Jovanovikj, Ivan, and Baris Güldali. <i>Presentation: Who Guards the Guards?
    On the Validation of Test Case Migration</i>. User Conference on Advanced Automated
    Testing (UCAAT 2018), Paris, 2018.'
  ieee: 'I. Jovanovikj and B. Güldali, <i>Presentation: Who Guards the Guards? On
    the Validation of Test Case Migration</i>. User Conference on Advanced Automated
    Testing (UCAAT 2018), Paris, 2018.'
  mla: 'Jovanovikj, Ivan, and Baris Güldali. <i>Presentation: Who Guards the Guards?
    On the Validation of Test Case Migration</i>. 2018.'
  short: 'I. Jovanovikj, B. Güldali, Presentation: Who Guards the Guards? On the Validation
    of Test Case Migration, User Conference on Advanced Automated Testing (UCAAT 2018),
    Paris, 2018.'
date_created: 2019-04-08T07:46:36Z
date_updated: 2022-01-06T07:04:03Z
department:
- _id: '66'
language:
- iso: eng
place: User Conference on Advanced Automated Testing (UCAAT 2018), Paris
status: public
title: 'Presentation: Who Guards the Guards? On the Validation of Test Case Migration'
type: misc
user_id: '39187'
year: '2018'
...
---
_id: '9606'
author:
- first_name: Jia
  full_name: Liu, Jia
  last_name: Liu
- first_name: Tibor
  full_name: Jager, Tibor
  id: '64669'
  last_name: Jager
- first_name: Saqib
  full_name: Kakvi, Saqib
  id: '66268'
  last_name: Kakvi
- first_name: Bogdan
  full_name: Warinschi, Bogdan
  last_name: Warinschi
citation:
  ama: Liu J, Jager T, Kakvi S, Warinschi B. How to build time-lock encryption. <i>Designs,
    Codes and Cryptography</i>. 2018:2549-2586. doi:<a href="https://doi.org/10.1007/s10623-018-0461-x">10.1007/s10623-018-0461-x</a>
  apa: Liu, J., Jager, T., Kakvi, S., &#38; Warinschi, B. (2018). How to build time-lock
    encryption. <i>Designs, Codes and Cryptography</i>, 2549–2586. <a href="https://doi.org/10.1007/s10623-018-0461-x">https://doi.org/10.1007/s10623-018-0461-x</a>
  bibtex: '@article{Liu_Jager_Kakvi_Warinschi_2018, title={How to build time-lock
    encryption}, DOI={<a href="https://doi.org/10.1007/s10623-018-0461-x">10.1007/s10623-018-0461-x</a>},
    journal={Designs, Codes and Cryptography}, author={Liu, Jia and Jager, Tibor and
    Kakvi, Saqib and Warinschi, Bogdan}, year={2018}, pages={2549–2586} }'
  chicago: Liu, Jia, Tibor Jager, Saqib Kakvi, and Bogdan Warinschi. “How to Build
    Time-Lock Encryption.” <i>Designs, Codes and Cryptography</i>, 2018, 2549–86.
    <a href="https://doi.org/10.1007/s10623-018-0461-x">https://doi.org/10.1007/s10623-018-0461-x</a>.
  ieee: J. Liu, T. Jager, S. Kakvi, and B. Warinschi, “How to build time-lock encryption,”
    <i>Designs, Codes and Cryptography</i>, pp. 2549–2586, 2018.
  mla: Liu, Jia, et al. “How to Build Time-Lock Encryption.” <i>Designs, Codes and
    Cryptography</i>, 2018, pp. 2549–86, doi:<a href="https://doi.org/10.1007/s10623-018-0461-x">10.1007/s10623-018-0461-x</a>.
  short: J. Liu, T. Jager, S. Kakvi, B. Warinschi, Designs, Codes and Cryptography
    (2018) 2549–2586.
date_created: 2019-05-03T12:42:01Z
date_updated: 2022-01-06T07:04:16Z
department:
- _id: '558'
doi: 10.1007/s10623-018-0461-x
language:
- iso: eng
page: 2549-2586
publication: Designs, Codes and Cryptography
publication_identifier:
  issn:
  - 0925-1022
  - 1573-7586
publication_status: published
status: public
title: How to build time-lock encryption
type: journal_article
user_id: '66268'
year: '2018'
...
---
_id: '4165'
abstract:
- lang: eng
  text: Metal nanoparticles host localized plasmon excitations that allow the manipulation
    of optical fields at the nanoscale. Despite the availability of several techniques
    for imaging plasmons, direct access into the symmetries of these excitations remains
    elusive, thus hindering progress in the development of applications. Here, we
    present a combination of angle-, polarization-, and space-resolved cathodoluminescence
    spectroscopy methods to selectively access the symmetry and degeneracy of plasmonic
    states in lithographically fabricated gold nanoprisms. We experimentally reveal
    and spatially map degenerate states of multipole plasmon modes with nanometer
    spatial resolution and further provide recipes for resolving optically dark and
    out-of-plane modes. Full-wave simulations in conjunction with a simple tight-binding
    model explain the complex plasmon structure in these particles and reveal intriguing
    mode-symmetry phenomena. Our approach introduces systematics for a comprehensive
    symmetry characterization of plasmonic states in high-symmetry nanostructures.
article_type: original
author:
- first_name: Viktor
  full_name: Myroshnychenko, Viktor
  id: '46371'
  last_name: Myroshnychenko
- first_name: Natsuki
  full_name: Nishio, Natsuki
  last_name: Nishio
- first_name: F. Javier
  full_name: García de Abajo, F. Javier
  last_name: García de Abajo
- first_name: Jens
  full_name: Förstner, Jens
  id: '158'
  last_name: Förstner
  orcid: 0000-0001-7059-9862
- first_name: Naoki
  full_name: Yamamoto, Naoki
  last_name: Yamamoto
citation:
  ama: Myroshnychenko V, Nishio N, García de Abajo FJ, Förstner J, Yamamoto N. Unveiling
    and Imaging Degenerate States in Plasmonic Nanoparticles with Nanometer Resolution.
    <i>ACS Nano</i>. 2018;12(8):8436-8446. doi:<a href="https://doi.org/10.1021/acsnano.8b03926">10.1021/acsnano.8b03926</a>
  apa: Myroshnychenko, V., Nishio, N., García de Abajo, F. J., Förstner, J., &#38;
    Yamamoto, N. (2018). Unveiling and Imaging Degenerate States in Plasmonic Nanoparticles
    with Nanometer Resolution. <i>ACS Nano</i>, <i>12</i>(8), 8436–8446. <a href="https://doi.org/10.1021/acsnano.8b03926">https://doi.org/10.1021/acsnano.8b03926</a>
  bibtex: '@article{Myroshnychenko_Nishio_García de Abajo_Förstner_Yamamoto_2018,
    title={Unveiling and Imaging Degenerate States in Plasmonic Nanoparticles with
    Nanometer Resolution}, volume={12}, DOI={<a href="https://doi.org/10.1021/acsnano.8b03926">10.1021/acsnano.8b03926</a>},
    number={8}, journal={ACS Nano}, publisher={American Chemical Society (ACS)}, author={Myroshnychenko,
    Viktor and Nishio, Natsuki and García de Abajo, F. Javier and Förstner, Jens and
    Yamamoto, Naoki}, year={2018}, pages={8436–8446} }'
  chicago: 'Myroshnychenko, Viktor, Natsuki Nishio, F. Javier García de Abajo, Jens
    Förstner, and Naoki Yamamoto. “Unveiling and Imaging Degenerate States in Plasmonic
    Nanoparticles with Nanometer Resolution.” <i>ACS Nano</i> 12, no. 8 (2018): 8436–46.
    <a href="https://doi.org/10.1021/acsnano.8b03926">https://doi.org/10.1021/acsnano.8b03926</a>.'
  ieee: V. Myroshnychenko, N. Nishio, F. J. García de Abajo, J. Förstner, and N. Yamamoto,
    “Unveiling and Imaging Degenerate States in Plasmonic Nanoparticles with Nanometer
    Resolution,” <i>ACS Nano</i>, vol. 12, no. 8, pp. 8436–8446, 2018.
  mla: Myroshnychenko, Viktor, et al. “Unveiling and Imaging Degenerate States in
    Plasmonic Nanoparticles with Nanometer Resolution.” <i>ACS Nano</i>, vol. 12,
    no. 8, American Chemical Society (ACS), 2018, pp. 8436–46, doi:<a href="https://doi.org/10.1021/acsnano.8b03926">10.1021/acsnano.8b03926</a>.
  short: V. Myroshnychenko, N. Nishio, F.J. García de Abajo, J. Förstner, N. Yamamoto,
    ACS Nano 12 (2018) 8436–8446.
date_created: 2018-08-28T07:44:24Z
date_updated: 2022-01-06T07:00:27Z
ddc:
- '530'
department:
- _id: '61'
- _id: '230'
doi: 10.1021/acsnano.8b03926
file:
- access_level: open_access
  content_type: application/pdf
  creator: hclaudia
  date_created: 2018-08-28T07:45:47Z
  date_updated: 2018-09-03T13:54:21Z
  file_id: '4166'
  file_name: 2018 Myroshnychenko,Nishio,Garcia de Abajo,Förstner,Yamamoto_Unveiling
    and Imaging Degenerate States in Plasmonic Nanoparticles with Nanometer Resolution.pdf
  file_size: 4463352
  relation: main_file
file_date_updated: 2018-09-03T13:54:21Z
has_accepted_license: '1'
intvolume: '        12'
issue: '8'
keyword:
- tet_topic_plasmonics
language:
- iso: eng
oa: '1'
page: 8436-8446
project:
- _id: '53'
  name: TRR 142
- _id: '56'
  name: TRR 142 - Project Area C
- _id: '75'
  name: TRR 142 - Subproject C5
publication: ACS Nano
publication_identifier:
  issn:
  - 1936-0851
  - 1936-086X
publication_status: published
publisher: American Chemical Society (ACS)
status: public
title: Unveiling and Imaging Degenerate States in Plasmonic Nanoparticles with Nanometer
  Resolution
type: journal_article
urn: '41659'
user_id: '158'
volume: 12
year: '2018'
...
---
_id: '4236'
author:
- first_name: Henning
  full_name: Wachsmuth, Henning
  id: '3900'
  last_name: Wachsmuth
- first_name: Manfred
  full_name: Stede, Manfred
  last_name: Stede
- first_name: Roxanne
  full_name: El Baff, Roxanne
  last_name: El Baff
- first_name: Khalid
  full_name: Al Khatib, Khalid
  last_name: Al Khatib
- first_name: Maria
  full_name: Skeppstedt, Maria
  last_name: Skeppstedt
- first_name: Benno
  full_name: Stein, Benno
  last_name: Stein
citation:
  ama: 'Wachsmuth H, Stede M, El Baff R, Al Khatib K, Skeppstedt M, Stein B. Argumentation
    Synthesis following Rhetorical Strategies. In: <i>Proceedings of the 27th International
    Conference on Computational Linguistics</i>. ; 2018:3753-3765.'
  apa: Wachsmuth, H., Stede, M., El Baff, R., Al Khatib, K., Skeppstedt, M., &#38;
    Stein, B. (2018). Argumentation Synthesis following Rhetorical Strategies. In
    <i>Proceedings of the 27th International Conference on Computational Linguistics</i>
    (pp. 3753–3765).
  bibtex: '@inproceedings{Wachsmuth_Stede_El Baff_Al Khatib_Skeppstedt_Stein_2018,
    title={Argumentation Synthesis following Rhetorical Strategies}, booktitle={Proceedings
    of the 27th International Conference on Computational Linguistics}, author={Wachsmuth,
    Henning and Stede, Manfred and El Baff, Roxanne and Al Khatib, Khalid and Skeppstedt,
    Maria and Stein, Benno}, year={2018}, pages={3753–3765} }'
  chicago: Wachsmuth, Henning, Manfred Stede, Roxanne El Baff, Khalid Al Khatib, Maria
    Skeppstedt, and Benno Stein. “Argumentation Synthesis Following Rhetorical Strategies.”
    In <i>Proceedings of the 27th International Conference on Computational Linguistics</i>,
    3753–65, 2018.
  ieee: H. Wachsmuth, M. Stede, R. El Baff, K. Al Khatib, M. Skeppstedt, and B. Stein,
    “Argumentation Synthesis following Rhetorical Strategies,” in <i>Proceedings of
    the 27th International Conference on Computational Linguistics</i>, 2018, pp.
    3753–3765.
  mla: Wachsmuth, Henning, et al. “Argumentation Synthesis Following Rhetorical Strategies.”
    <i>Proceedings of the 27th International Conference on Computational Linguistics</i>,
    2018, pp. 3753–65.
  short: 'H. Wachsmuth, M. Stede, R. El Baff, K. Al Khatib, M. Skeppstedt, B. Stein,
    in: Proceedings of the 27th International Conference on Computational Linguistics,
    2018, pp. 3753–3765.'
conference:
  name: ACL 18
date_created: 2018-08-29T07:48:35Z
date_updated: 2022-01-06T07:00:40Z
department:
- _id: '600'
- _id: '568'
keyword:
- argument
language:
- iso: eng
main_file_link:
- url: 'http://aclweb.org/anthology/C18-1318 '
page: 3753-3765
publication: Proceedings of the 27th International Conference on Computational Linguistics
related_material:
  link:
  - relation: other
    url: http://argumentation.bplaced.net/arguana-publications/posters/wachsmuth18b-coling.pdf
  - relation: research_paper
    url: http://argumentation.bplaced.net/arguana-publications/papers/wachsmuth18b-coling.pdf
status: public
title: Argumentation Synthesis following Rhetorical Strategies
type: conference
user_id: '3900'
year: '2018'
...
---
_id: '4324'
abstract:
- lang: eng
  text: "We study the dependence of the intensity and linear polarization of light
    scattered by isolated particles with the compact\r\nirregular shape on their size
    using the discontinuous Galerkin time domain numerical method. The size parameter
    of particles varies in the range of X = 10 to 150, and the complex refractive
    index is m = 1.5 + 0i. Our results show\r\nthat the backscattering negative polarization
    branch weakens monotonously, but does not disappear at large sizes, up to the
    geometrical optics regime, and can be simulated without accounting for wave effects.
    The intensity backscattering surge becomes narrower with increasing particle size.
    For X = 150, the surge width is several degrees."
article_type: original
author:
- first_name: Yevgen
  full_name: Grynko, Yevgen
  id: '26059'
  last_name: Grynko
- first_name: Yuriy
  full_name: Shkuratov, Yuriy
  last_name: Shkuratov
- first_name: Jens
  full_name: Förstner, Jens
  id: '158'
  last_name: Förstner
  orcid: 0000-0001-7059-9862
citation:
  ama: Grynko Y, Shkuratov Y, Förstner J. Intensity surge and negative polarization
    of light from compact irregular particles. <i>Optics Letters</i>. 2018;43(15):3562.
    doi:<a href="https://doi.org/10.1364/ol.43.003562">10.1364/ol.43.003562</a>
  apa: Grynko, Y., Shkuratov, Y., &#38; Förstner, J. (2018). Intensity surge and negative
    polarization of light from compact irregular particles. <i>Optics Letters</i>,
    <i>43</i>(15), 3562. <a href="https://doi.org/10.1364/ol.43.003562">https://doi.org/10.1364/ol.43.003562</a>
  bibtex: '@article{Grynko_Shkuratov_Förstner_2018, title={Intensity surge and negative
    polarization of light from compact irregular particles}, volume={43}, DOI={<a
    href="https://doi.org/10.1364/ol.43.003562">10.1364/ol.43.003562</a>}, number={15},
    journal={Optics Letters}, publisher={The Optical Society}, author={Grynko, Yevgen
    and Shkuratov, Yuriy and Förstner, Jens}, year={2018}, pages={3562} }'
  chicago: 'Grynko, Yevgen, Yuriy Shkuratov, and Jens Förstner. “Intensity Surge and
    Negative Polarization of Light from Compact Irregular Particles.” <i>Optics Letters</i>
    43, no. 15 (2018): 3562. <a href="https://doi.org/10.1364/ol.43.003562">https://doi.org/10.1364/ol.43.003562</a>.'
  ieee: Y. Grynko, Y. Shkuratov, and J. Förstner, “Intensity surge and negative polarization
    of light from compact irregular particles,” <i>Optics Letters</i>, vol. 43, no.
    15, p. 3562, 2018.
  mla: Grynko, Yevgen, et al. “Intensity Surge and Negative Polarization of Light
    from Compact Irregular Particles.” <i>Optics Letters</i>, vol. 43, no. 15, The
    Optical Society, 2018, p. 3562, doi:<a href="https://doi.org/10.1364/ol.43.003562">10.1364/ol.43.003562</a>.
  short: Y. Grynko, Y. Shkuratov, J. Förstner, Optics Letters 43 (2018) 3562.
date_created: 2018-08-30T10:17:08Z
date_updated: 2022-01-06T07:00:55Z
ddc:
- '530'
department:
- _id: '61'
doi: 10.1364/ol.43.003562
file:
- access_level: open_access
  content_type: application/pdf
  creator: hclaudia
  date_created: 2018-08-30T10:18:10Z
  date_updated: 2021-07-27T21:04:54Z
  file_id: '4325'
  file_name: 2018-07 Grynko,Shkuratov,Förstner_Intensity surge and negative polarization
    of light from compact irregular particles.pdf
  file_size: 1797893
  relation: main_file
file_date_updated: 2021-07-27T21:04:54Z
has_accepted_license: '1'
intvolume: '        43'
issue: '15'
keyword:
- tet_topic_scattering
language:
- iso: eng
oa: '1'
page: '3562'
publication: Optics Letters
publication_identifier:
  issn:
  - 0146-9592
  - 1539-4794
publication_status: published
publisher: The Optical Society
status: public
title: Intensity surge and negative polarization of light from compact irregular particles
type: journal_article
user_id: '158'
volume: 43
year: '2018'
...
---
_id: '4344'
author:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
- first_name: Sascha
  full_name: Brauer, Sascha
  id: '13291'
  last_name: Brauer
- first_name: Kathrin
  full_name: Bujna, Kathrin
  last_name: Bujna
citation:
  ama: 'Blömer J, Brauer S, Bujna K. Coresets for Fuzzy K-Means with Applications.
    In: <i>29th International Symposium on Algorithms and Computation  (ISAAC 2018)</i>.
    Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik; 2018:46:1--46:12. doi:<a href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.46">10.4230/LIPIcs.ISAAC.2018.46</a>'
  apa: 'Blömer, J., Brauer, S., &#38; Bujna, K. (2018). Coresets for Fuzzy K-Means
    with Applications. In <i>29th International Symposium on Algorithms and Computation 
    (ISAAC 2018)</i> (pp. 46:1--46:12). Jiaoxi, Yilan County, Taiwan: Schloss Dagstuhl--Leibniz-Zentrum
    fuer Informatik. <a href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.46">https://doi.org/10.4230/LIPIcs.ISAAC.2018.46</a>'
  bibtex: '@inproceedings{Blömer_Brauer_Bujna_2018, title={Coresets for Fuzzy K-Means
    with Applications}, DOI={<a href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.46">10.4230/LIPIcs.ISAAC.2018.46</a>},
    booktitle={29th International Symposium on Algorithms and Computation  (ISAAC
    2018)}, publisher={Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, author={Blömer,
    Johannes and Brauer, Sascha and Bujna, Kathrin}, year={2018}, pages={46:1--46:12}
    }'
  chicago: Blömer, Johannes, Sascha Brauer, and Kathrin Bujna. “Coresets for Fuzzy
    K-Means with Applications.” In <i>29th International Symposium on Algorithms and
    Computation  (ISAAC 2018)</i>, 46:1--46:12. Schloss Dagstuhl--Leibniz-Zentrum
    fuer Informatik, 2018. <a href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.46">https://doi.org/10.4230/LIPIcs.ISAAC.2018.46</a>.
  ieee: J. Blömer, S. Brauer, and K. Bujna, “Coresets for Fuzzy K-Means with Applications,”
    in <i>29th International Symposium on Algorithms and Computation  (ISAAC 2018)</i>,
    Jiaoxi, Yilan County, Taiwan, 2018, pp. 46:1--46:12.
  mla: Blömer, Johannes, et al. “Coresets for Fuzzy K-Means with Applications.” <i>29th
    International Symposium on Algorithms and Computation  (ISAAC 2018)</i>, Schloss
    Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018, pp. 46:1--46:12, doi:<a href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.46">10.4230/LIPIcs.ISAAC.2018.46</a>.
  short: 'J. Blömer, S. Brauer, K. Bujna, in: 29th International Symposium on Algorithms
    and Computation  (ISAAC 2018), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik,
    2018, pp. 46:1--46:12.'
conference:
  end_date: 2018-12-19
  location: Jiaoxi, Yilan County, Taiwan
  name: 29th International Symposium on Algorithms and Computation (ISAAC)
  start_date: 2018-12-17
date_created: 2018-09-03T08:04:19Z
date_updated: 2022-01-06T07:00:57Z
department:
- _id: '64'
doi: 10.4230/LIPIcs.ISAAC.2018.46
language:
- iso: eng
page: 46:1--46:12
project:
- _id: '45'
  name: Soft-Clustering - Von Heuristiken zu Approximationsalgorithmen
publication: 29th International Symposium on Algorithms and Computation  (ISAAC 2018)
publication_identifier:
  isbn:
  - 978-3-95977-094-1
publication_status: published
publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
status: public
title: Coresets for Fuzzy K-Means with Applications
type: conference
user_id: '13291'
year: '2018'
...
---
_id: '4351'
abstract:
- lang: eng
  text: "\tWe extend the concept of monotonic searchability~\\cite{DBLP:conf/opodis/ScheidelerSS15}~\\cite{DBLP:conf/wdag/ScheidelerSS16}
    for self-stabilizing systems from one to multiple dimensions.\r\n\tA system is
    self-stabilizing if it can recover to a legitimate state from any initial illegal
    state.\r\n\tThese kind of systems are most often used in distributed applications.\r\n\tMonotonic
    searchability provides guarantees when searching for nodes while the recovery
    process is going on.\r\n\tMore precisely, if a search request started at some
    node $u$ succeeds in reaching its destination $v$, then all future search requests
    from $u$ to $v$ succeed as well.\r\n\tAlthough there already exists a self-stabilizing
    protocol for a two-dimensional topology~\\cite{DBLP:journals/tcs/JacobRSS12} and
    an universal approach for monotonic searchability~\\cite{DBLP:conf/wdag/ScheidelerSS16},
    it is not clear how both of these concepts fit together effectively.\r\n\tThe
    latter concept even comes with some restrictive assumptions on messages, which
    is not the case for our protocol.\r\n\tWe propose a simple novel protocol for
    a self-stabilizing two-dimensional quadtree that satisfies monotonic searchability.\r\n\tOur
    protocol can easily be extended to higher dimensions and offers routing in $\\mathcal
    O(\\log n)$ hops for any search request.\r\n"
author:
- first_name: Michael
  full_name: Feldmann, Michael
  id: '23538'
  last_name: Feldmann
- first_name: Christina
  full_name: Kolb, Christina
  id: '43647'
  last_name: Kolb
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
citation:
  ama: 'Feldmann M, Kolb C, Scheideler C. Self-stabilizing Overlays for high-dimensional
    Monotonic Searchability. In: <i>Proceedings of the 20th International Symposium
    on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>. Vol 11201.
    Lecture Notes in Computer Science. Springer, Cham; 2018:16-31. doi:<a href="https://doi.org/10.1007/978-3-030-03232-6_2">10.1007/978-3-030-03232-6_2</a>'
  apa: Feldmann, M., Kolb, C., &#38; Scheideler, C. (2018). Self-stabilizing Overlays
    for high-dimensional Monotonic Searchability. In <i>Proceedings of the 20th International
    Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>
    (Vol. 11201, pp. 16–31). Springer, Cham. <a href="https://doi.org/10.1007/978-3-030-03232-6_2">https://doi.org/10.1007/978-3-030-03232-6_2</a>
  bibtex: '@inproceedings{Feldmann_Kolb_Scheideler_2018, series={Lecture Notes in
    Computer Science}, title={Self-stabilizing Overlays for high-dimensional Monotonic
    Searchability}, volume={11201}, DOI={<a href="https://doi.org/10.1007/978-3-030-03232-6_2">10.1007/978-3-030-03232-6_2</a>},
    booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety,
    and Security of Distributed Systems (SSS)}, publisher={Springer, Cham}, author={Feldmann,
    Michael and Kolb, Christina and Scheideler, Christian}, year={2018}, pages={16–31},
    collection={Lecture Notes in Computer Science} }'
  chicago: Feldmann, Michael, Christina Kolb, and Christian Scheideler. “Self-Stabilizing
    Overlays for High-Dimensional Monotonic Searchability.” In <i>Proceedings of the
    20th International Symposium on Stabilization, Safety, and Security of Distributed
    Systems (SSS)</i>, 11201:16–31. Lecture Notes in Computer Science. Springer, Cham,
    2018. <a href="https://doi.org/10.1007/978-3-030-03232-6_2">https://doi.org/10.1007/978-3-030-03232-6_2</a>.
  ieee: M. Feldmann, C. Kolb, and C. Scheideler, “Self-stabilizing Overlays for high-dimensional
    Monotonic Searchability,” in <i>Proceedings of the 20th International Symposium
    on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 2018,
    vol. 11201, pp. 16–31.
  mla: Feldmann, Michael, et al. “Self-Stabilizing Overlays for High-Dimensional Monotonic
    Searchability.” <i>Proceedings of the 20th International Symposium on Stabilization,
    Safety, and Security of Distributed Systems (SSS)</i>, vol. 11201, Springer, Cham,
    2018, pp. 16–31, doi:<a href="https://doi.org/10.1007/978-3-030-03232-6_2">10.1007/978-3-030-03232-6_2</a>.
  short: 'M. Feldmann, C. Kolb, C. Scheideler, in: Proceedings of the 20th International
    Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS),
    Springer, Cham, 2018, pp. 16–31.'
date_created: 2018-09-04T14:15:39Z
date_updated: 2022-01-06T07:00:58Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-030-03232-6_2
external_id:
  arxiv:
  - '1808.10300'
file:
- access_level: closed
  content_type: application/pdf
  creator: mfeldma2
  date_created: 2018-10-31T13:24:17Z
  date_updated: 2018-10-31T13:24:17Z
  file_id: '5210'
  file_name: Feldmann2018_Chapter_Self-stabilizingOverlaysForHig.pdf
  file_size: 329823
  relation: main_file
  success: 1
file_date_updated: 2018-10-31T13:24:17Z
has_accepted_license: '1'
intvolume: '     11201'
language:
- iso: eng
page: '16-31 '
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publication: Proceedings of the 20th International Symposium on Stabilization, Safety,
  and Security of Distributed Systems (SSS)
publication_identifier:
  unknown:
  - 978-3-030-03231-9
publisher: Springer, Cham
series_title: Lecture Notes in Computer Science
status: public
title: Self-stabilizing Overlays for high-dimensional Monotonic Searchability
type: conference
user_id: '23538'
volume: 11201
year: '2018'
...
---
_id: '4375'
abstract:
- lang: eng
  text: "We present a peer-to-peer network that supports the efficient processing
    of orthogonal range queries $R=\\bigtimes_{i=1}^{d}[a_i,\\,b_i]$ in a $d$-dimensional
    point space.\\\\\r\nThe  network is the same for each dimension, namely a distance
    halving network like the one introduced by Naor and Wieder (ACM TALG'07).\r\nWe
    show how to execute such range queries using $\\mathcal{O}\\left(2^{d'}d\\,\\log
    m + d\\,|R|\\right)$ hops (and the same number of messages) in total. Here $[m]^d$
    is the ground set, $|R|$ is the size and $d'$ the dimension of the queried range.\r\nFurthermore,
    if the peers form a distributed network, the query can be answered in $\\mathcal{O}\\left(d\\,\\log
    m + d\\,\\sum_{i=1}^{d}(b_i-a_i+1)\\right)$ communication rounds.\r\nOur algorithms
    are based on a mapping of the Hilbert Curve through $[m]^d$ to the peers."
author:
- first_name: Markus
  full_name: Benter, Markus
  last_name: Benter
- first_name: Till
  full_name: Knollmann, Till
  id: '39241'
  last_name: Knollmann
  orcid: 0000-0003-2014-4696
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Alexander
  full_name: Setzer, Alexander
  id: '11108'
  last_name: Setzer
- first_name: Jannik
  full_name: Sundermeier, Jannik
  id: '38705'
  last_name: Sundermeier
citation:
  ama: 'Benter M, Knollmann T, Meyer auf der Heide F, Setzer A, Sundermeier J. A Peer-to-Peer
    based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension.
    In: <i>Proceedings of the 4th International Symposium on Algorithmic Aspects of
    Cloud Computing (ALGOCLOUD)</i>. ; 2018. doi:<a href="https://doi.org/10.1007/978-3-030-19759-9_4">10.1007/978-3-030-19759-9_4</a>'
  apa: Benter, M., Knollmann, T., Meyer auf der Heide, F., Setzer, A., &#38; Sundermeier,
    J. (2018). A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries
    of arbitrary Dimension. In <i>Proceedings of the 4th International Symposium on
    Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>. Helsinki. <a href="https://doi.org/10.1007/978-3-030-19759-9_4">https://doi.org/10.1007/978-3-030-19759-9_4</a>
  bibtex: '@inproceedings{Benter_Knollmann_Meyer auf der Heide_Setzer_Sundermeier_2018,
    title={A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries
    of arbitrary Dimension}, DOI={<a href="https://doi.org/10.1007/978-3-030-19759-9_4">10.1007/978-3-030-19759-9_4</a>},
    booktitle={Proceedings of the 4th International Symposium on Algorithmic Aspects
    of Cloud Computing (ALGOCLOUD)}, author={Benter, Markus and Knollmann, Till and
    Meyer auf der Heide, Friedhelm and Setzer, Alexander and Sundermeier, Jannik},
    year={2018} }'
  chicago: Benter, Markus, Till Knollmann, Friedhelm Meyer auf der Heide, Alexander
    Setzer, and Jannik Sundermeier. “A Peer-to-Peer Based Cloud Storage Supporting
    Orthogonal Range Queries of Arbitrary Dimension.” In <i>Proceedings of the 4th
    International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>,
    2018. <a href="https://doi.org/10.1007/978-3-030-19759-9_4">https://doi.org/10.1007/978-3-030-19759-9_4</a>.
  ieee: M. Benter, T. Knollmann, F. Meyer auf der Heide, A. Setzer, and J. Sundermeier,
    “A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary
    Dimension,” in <i>Proceedings of the 4th International Symposium on Algorithmic
    Aspects of Cloud Computing (ALGOCLOUD)</i>, Helsinki, 2018.
  mla: Benter, Markus, et al. “A Peer-to-Peer Based Cloud Storage Supporting Orthogonal
    Range Queries of Arbitrary Dimension.” <i>Proceedings of the 4th International
    Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>, 2018, doi:<a
    href="https://doi.org/10.1007/978-3-030-19759-9_4">10.1007/978-3-030-19759-9_4</a>.
  short: 'M. Benter, T. Knollmann, F. Meyer auf der Heide, A. Setzer, J. Sundermeier,
    in: Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud
    Computing (ALGOCLOUD), 2018.'
conference:
  end_date: 2018-08-21
  location: Helsinki
  name: 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)
  start_date: 2018-08-20
date_created: 2018-09-11T05:26:59Z
date_updated: 2022-01-06T07:01:00Z
ddc:
- '000'
department:
- _id: '63'
- _id: '79'
doi: 10.1007/978-3-030-19759-9_4
file:
- access_level: closed
  content_type: application/pdf
  creator: tillk
  date_created: 2018-11-27T10:03:33Z
  date_updated: 2018-11-27T10:03:33Z
  file_id: '5863'
  file_name: A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries
    of arbitrary Dimension.pdf
  file_size: 1122875
  relation: main_file
  success: 1
file_date_updated: 2018-11-27T10:03:33Z
has_accepted_license: '1'
keyword:
- Distributed Storage
- Multi-Dimensional Range Queries
- Peer-to-Peer
- Hilbert Curve
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publication: Proceedings of the 4th International Symposium on Algorithmic Aspects
  of Cloud Computing (ALGOCLOUD)
status: public
title: A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary
  Dimension
type: conference
user_id: '14955'
year: '2018'
...
---
_id: '4999'
author:
- first_name: Felix
  full_name: Pauck, Felix
  id: '22398'
  last_name: Pauck
- first_name: Eric
  full_name: Bodden, Eric
  id: '59256'
  last_name: Bodden
  orcid: 0000-0003-3470-3647
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
citation:
  ama: 'Pauck F, Bodden E, Wehrheim H. Do Android taint analysis tools keep their
    promises? In: <i>Proceedings of the 2018 26th ACM Joint Meeting on European Software
    Engineering Conference and Symposium on the Foundations of Software Engineering 
    - ESEC/FSE 2018</i>. ACM Press; 2018. doi:<a href="https://doi.org/10.1145/3236024.3236029">10.1145/3236024.3236029</a>'
  apa: Pauck, F., Bodden, E., &#38; Wehrheim, H. (2018). Do Android taint analysis
    tools keep their promises? In <i>Proceedings of the 2018 26th ACM Joint Meeting
    on European Software Engineering Conference and Symposium on the Foundations of
    Software Engineering  - ESEC/FSE 2018</i>. ACM Press. <a href="https://doi.org/10.1145/3236024.3236029">https://doi.org/10.1145/3236024.3236029</a>
  bibtex: '@inproceedings{Pauck_Bodden_Wehrheim_2018, title={Do Android taint analysis
    tools keep their promises?}, DOI={<a href="https://doi.org/10.1145/3236024.3236029">10.1145/3236024.3236029</a>},
    booktitle={Proceedings of the 2018 26th ACM Joint Meeting on European Software
    Engineering Conference and Symposium on the Foundations of Software Engineering 
    - ESEC/FSE 2018}, publisher={ACM Press}, author={Pauck, Felix and Bodden, Eric
    and Wehrheim, Heike}, year={2018} }'
  chicago: Pauck, Felix, Eric Bodden, and Heike Wehrheim. “Do Android Taint Analysis
    Tools Keep Their Promises?” In <i>Proceedings of the 2018 26th ACM Joint Meeting
    on European Software Engineering Conference and Symposium on the Foundations of
    Software Engineering  - ESEC/FSE 2018</i>. ACM Press, 2018. <a href="https://doi.org/10.1145/3236024.3236029">https://doi.org/10.1145/3236024.3236029</a>.
  ieee: F. Pauck, E. Bodden, and H. Wehrheim, “Do Android taint analysis tools keep
    their promises?,” in <i>Proceedings of the 2018 26th ACM Joint Meeting on European
    Software Engineering Conference and Symposium on the Foundations of Software Engineering 
    - ESEC/FSE 2018</i>, 2018.
  mla: Pauck, Felix, et al. “Do Android Taint Analysis Tools Keep Their Promises?”
    <i>Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering
    Conference and Symposium on the Foundations of Software Engineering  - ESEC/FSE
    2018</i>, ACM Press, 2018, doi:<a href="https://doi.org/10.1145/3236024.3236029">10.1145/3236024.3236029</a>.
  short: 'F. Pauck, E. Bodden, H. Wehrheim, in: Proceedings of the 2018 26th ACM Joint
    Meeting on European Software Engineering Conference and Symposium on the Foundations
    of Software Engineering  - ESEC/FSE 2018, ACM Press, 2018.'
date_created: 2018-10-30T08:03:17Z
date_updated: 2022-01-06T07:01:34Z
ddc:
- '004'
department:
- _id: '77'
- _id: '76'
doi: 10.1145/3236024.3236029
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T13:37:38Z
  date_updated: 2018-11-02T13:37:38Z
  file_id: '5251'
  file_name: fse18main-id76-p.pdf
  file_size: 524169
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T13:37:38Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '3'
  name: SFB 901 - Project Area B
- _id: '12'
  name: SFB 901 - Subproject B4
- _id: '1'
  name: SFB 901
publication: Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering
  Conference and Symposium on the Foundations of Software Engineering  - ESEC/FSE
  2018
publication_identifier:
  isbn:
  - '9781450355735'
publication_status: published
publisher: ACM Press
status: public
title: Do Android taint analysis tools keep their promises?
type: conference
user_id: '477'
year: '2018'
...
---
_id: '5203'
author:
- first_name: Stefan
  full_name: Krüger, Stefan
  last_name: Krüger
- first_name: Johannes
  full_name: Späth, Johannes
  last_name: Späth
- first_name: Karim
  full_name: Ali, Karim
  last_name: Ali
- first_name: Eric
  full_name: Bodden, Eric
  id: '59256'
  last_name: Bodden
  orcid: 0000-0003-3470-3647
- first_name: Mira
  full_name: Mezini, Mira
  last_name: Mezini
citation:
  ama: 'Krüger S, Späth J, Ali K, Bodden E, Mezini M. CrySL: An Extensible Approach
    to Validating the Correct Usage of Cryptographic APIs. In: <i>European Conference
    on Object-Oriented Programming (ECOOP)</i>. ; 2018:10:1-10:27.'
  apa: 'Krüger, S., Späth, J., Ali, K., Bodden, E., &#38; Mezini, M. (2018). CrySL:
    An Extensible Approach to Validating the Correct Usage of Cryptographic APIs.
    In <i>European Conference on Object-Oriented Programming (ECOOP)</i> (pp. 10:1-10:27).'
  bibtex: '@inproceedings{Krüger_Späth_Ali_Bodden_Mezini_2018, title={CrySL: An Extensible
    Approach to Validating the Correct Usage of Cryptographic APIs}, booktitle={European
    Conference on Object-Oriented Programming (ECOOP)}, author={Krüger, Stefan and
    Späth, Johannes and Ali, Karim and Bodden, Eric and Mezini, Mira}, year={2018},
    pages={10:1-10:27} }'
  chicago: 'Krüger, Stefan, Johannes Späth, Karim Ali, Eric Bodden, and Mira Mezini.
    “CrySL: An Extensible Approach to Validating the Correct Usage of Cryptographic
    APIs.” In <i>European Conference on Object-Oriented Programming (ECOOP)</i>, 10:1-10:27,
    2018.'
  ieee: 'S. Krüger, J. Späth, K. Ali, E. Bodden, and M. Mezini, “CrySL: An Extensible
    Approach to Validating the Correct Usage of Cryptographic APIs,” in <i>European
    Conference on Object-Oriented Programming (ECOOP)</i>, 2018, pp. 10:1-10:27.'
  mla: 'Krüger, Stefan, et al. “CrySL: An Extensible Approach to Validating the Correct
    Usage of Cryptographic APIs.” <i>European Conference on Object-Oriented Programming
    (ECOOP)</i>, 2018, pp. 10:1-10:27.'
  short: 'S. Krüger, J. Späth, K. Ali, E. Bodden, M. Mezini, in: European Conference
    on Object-Oriented Programming (ECOOP), 2018, pp. 10:1-10:27.'
date_created: 2018-10-31T12:37:29Z
date_updated: 2022-01-06T07:01:44Z
ddc:
- '000'
department:
- _id: '76'
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T13:51:05Z
  date_updated: 2018-11-02T13:51:05Z
  file_id: '5255'
  file_name: ksa+18crysl.pdf
  file_size: 747259
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T13:51:05Z
has_accepted_license: '1'
keyword:
- ITSECWEBSITE
- CROSSING
language:
- iso: eng
main_file_link:
- url: http://bodden.de/pubs/ksa+18crysl.pdf
page: 10:1-10:27
project:
- _id: '1'
  name: SFB 901
- _id: '3'
  name: SFB 901 - Project Area B
- _id: '12'
  name: SFB 901 - Subproject B4
publication: European Conference on Object-Oriented Programming (ECOOP)
status: public
title: 'CrySL: An Extensible Approach to Validating the Correct Usage of Cryptographic
  APIs'
type: conference
user_id: '477'
year: '2018'
...
---
_id: '5216'
abstract:
- lang: eng
  text: A fundamental problem for overlay networks is to safely exclude leaving nodes,
    i.e., the nodes requesting to leave the overlay network are excluded from it without
    affecting its connectivity. To rigorously study self-stabilizing solutions to
    this problem, the Finite Departure Problem (FDP) has been proposed [9]. In the
    FDP we are given a network of processes in an arbitrary state, and the goal is
    to eventually arrive at (and stay in) a state in which all leaving processes irrevocably
    decided to leave the system while for all weakly-connected components in the initial
    overlay network, all staying processes in that component will still form a weakly
    connected component. In the standard interconnection model, the FDP is known to
    be unsolvable by local control protocols, so oracles have been investigated that
    allow the problem to be solved [9]. To avoid the use of oracles, we introduce
    a new interconnection model based on relays. Despite the relay model appearing
    to be rather restrictive, we show that it is universal, i.e., it is possible to
    transform any weakly-connected topology into any other weakly-connected topology,
    which is important for being a useful interconnection model for overlay networks.
    Apart from this, our model allows processes to grant and revoke access rights,
    which is why we believe it to be of interest beyond the scope of this paper. We
    show how to implement the relay layer in a self-stabilizing way and identify properties
    protocols need to satisfy so that the relay layer can recover while serving protocol
    requests.
author:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Alexander
  full_name: Setzer, Alexander
  id: '11108'
  last_name: Setzer
citation:
  ama: 'Scheideler C, Setzer A. Relays: A New Approach for the Finite Departure Problem
    in Overlay Networks. In: <i>Proceedings of the 20th International Symposium on
    Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i>. ; 2018.
    doi:<a href="https://doi.org/10.1007/978-3-030-03232-6_16">10.1007/978-3-030-03232-6_16</a>'
  apa: 'Scheideler, C., &#38; Setzer, A. (2018). Relays: A New Approach for the Finite
    Departure Problem in Overlay Networks. In <i>Proceedings of the 20th International
    Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i>.
    Tokyo, Japan. <a href="https://doi.org/10.1007/978-3-030-03232-6_16">https://doi.org/10.1007/978-3-030-03232-6_16</a>'
  bibtex: '@inproceedings{Scheideler_Setzer_2018, title={Relays: A New Approach for
    the Finite Departure Problem in Overlay Networks}, DOI={<a href="https://doi.org/10.1007/978-3-030-03232-6_16">10.1007/978-3-030-03232-6_16</a>},
    booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety,
    and Security of Distributed Systems (SSS 2018)}, author={Scheideler, Christian
    and Setzer, Alexander}, year={2018} }'
  chicago: 'Scheideler, Christian, and Alexander Setzer. “Relays: A New Approach for
    the Finite Departure Problem in Overlay Networks.” In <i>Proceedings of the 20th
    International Symposium on Stabilization, Safety, and Security of Distributed
    Systems (SSS 2018)</i>, 2018. <a href="https://doi.org/10.1007/978-3-030-03232-6_16">https://doi.org/10.1007/978-3-030-03232-6_16</a>.'
  ieee: 'C. Scheideler and A. Setzer, “Relays: A New Approach for the Finite Departure
    Problem in Overlay Networks,” in <i>Proceedings of the 20th International Symposium
    on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i>,
    Tokyo, Japan, 2018.'
  mla: 'Scheideler, Christian, and Alexander Setzer. “Relays: A New Approach for the
    Finite Departure Problem in Overlay Networks.” <i>Proceedings of the 20th International
    Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i>,
    2018, doi:<a href="https://doi.org/10.1007/978-3-030-03232-6_16">10.1007/978-3-030-03232-6_16</a>.'
  short: 'C. Scheideler, A. Setzer, in: Proceedings of the 20th International Symposium
    on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), 2018.'
conference:
  location: Tokyo, Japan
  name: 20th International Symposium on Stabilization, Safety, and Security of Distributed
    Systems (SSS 2018)
date_created: 2018-10-31T13:33:05Z
date_updated: 2022-01-06T07:01:47Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-030-03232-6_16
file:
- access_level: closed
  content_type: application/pdf
  creator: asetzer
  date_created: 2018-10-31T15:51:45Z
  date_updated: 2018-10-31T16:09:48Z
  file_id: '5223'
  file_name: Scheideler-Setzer2018_Chapter_RelaysANewApproachForTheFinite.pdf
  file_size: 369818
  relation: main_file
file_date_updated: 2018-10-31T16:09:48Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '13'
  name: SFB 901 - Subproject C1
publication: Proceedings of the 20th International Symposium on Stabilization, Safety,
  and Security of Distributed Systems (SSS 2018)
publication_status: published
status: public
title: 'Relays: A New Approach for the Finite Departure Problem in Overlay Networks'
type: conference
user_id: '11108'
year: '2018'
...
---
_id: '5222'
abstract:
- lang: eng
  text: 'We present a self-stabilizing protocol for an overlay network that constructs
    the Minimum Spanning Tree (MST) for an underlay that is modeled by a weighted
    tree. The weight of an overlay edge between two nodes is the weighted length of
    their shortest path in the tree. We rigorously prove that our protocol works correctly
    under asynchronous and non-FIFO message delivery. Further, the protocol stabilizes
    after O(N^2) asynchronous rounds where N is the number of nodes in the overlay. '
author:
- first_name: Thorsten
  full_name: Götte, Thorsten
  id: '34727'
  last_name: Götte
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Alexander
  full_name: Setzer, Alexander
  id: '11108'
  last_name: Setzer
citation:
  ama: 'Götte T, Scheideler C, Setzer A. On Underlay-Aware Self-Stabilizing Overlay
    Networks. In: <i>Proceedings of the 20th International Symposium on Stabilization,
    Safety, and Security of Distributed Systems (SSS 2018)</i>. Vol 11201. Lecture
    Notes in Computer Science. Springer; 2018:50-64.'
  apa: 'Götte, T., Scheideler, C., &#38; Setzer, A. (2018). On Underlay-Aware Self-Stabilizing
    Overlay Networks. In <i>Proceedings of the 20th International Symposium on Stabilization,
    Safety, and Security of Distributed Systems (SSS 2018)</i> (Vol. 11201, pp. 50–64).
    Tokyo, Japan: Springer.'
  bibtex: '@inproceedings{Götte_Scheideler_Setzer_2018, series={Lecture Notes in Computer
    Science}, title={On Underlay-Aware Self-Stabilizing Overlay Networks}, volume={11201},
    booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety,
    and Security of Distributed Systems (SSS 2018)}, publisher={Springer}, author={Götte,
    Thorsten and Scheideler, Christian and Setzer, Alexander}, year={2018}, pages={50–64},
    collection={Lecture Notes in Computer Science} }'
  chicago: Götte, Thorsten, Christian Scheideler, and Alexander Setzer. “On Underlay-Aware
    Self-Stabilizing Overlay Networks.” In <i>Proceedings of the 20th International
    Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i>,
    11201:50–64. Lecture Notes in Computer Science. Springer, 2018.
  ieee: T. Götte, C. Scheideler, and A. Setzer, “On Underlay-Aware Self-Stabilizing
    Overlay Networks,” in <i>Proceedings of the 20th International Symposium on Stabilization,
    Safety, and Security of Distributed Systems (SSS 2018)</i>, Tokyo, Japan, 2018,
    vol. 11201, pp. 50–64.
  mla: Götte, Thorsten, et al. “On Underlay-Aware Self-Stabilizing Overlay Networks.”
    <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and
    Security of Distributed Systems (SSS 2018)</i>, vol. 11201, Springer, 2018, pp.
    50–64.
  short: 'T. Götte, C. Scheideler, A. Setzer, in: Proceedings of the 20th International
    Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018),
    Springer, 2018, pp. 50–64.'
conference:
  location: Tokyo, Japan
  name: ' 20th International Symposium on Stabilization, Safety, and Security of Distributed
    Systems (SSS 2018)'
date_created: 2018-10-31T15:44:30Z
date_updated: 2022-01-06T07:01:47Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: closed
  content_type: application/pdf
  creator: thgoette
  date_created: 2018-10-31T15:59:26Z
  date_updated: 2018-10-31T15:59:26Z
  file_id: '5224'
  file_name: sss18_camera.pdf
  file_size: 367812
  relation: main_file
  success: 1
file_date_updated: 2018-10-31T15:59:26Z
has_accepted_license: '1'
intvolume: '     11201'
language:
- iso: eng
page: 50-64
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publication: Proceedings of the 20th International Symposium on Stabilization, Safety,
  and Security of Distributed Systems (SSS 2018)
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: On Underlay-Aware Self-Stabilizing Overlay Networks
type: conference
user_id: '477'
volume: 11201
year: '2018'
...
---
_id: '5368'
author:
- first_name: Moritz
  full_name: Jochmaring, Moritz
  last_name: Jochmaring
citation:
  ama: Jochmaring M. <i>Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen
    Build-List Und Build-Multilist Mit Systemverlassenden Knoten</i>. Universität
    Paderborn; 2018.
  apa: Jochmaring, M. (2018). <i>Monotone Suchbarkeit bei den selbststabilisierenden
    Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten</i>.
    Universität Paderborn.
  bibtex: '@book{Jochmaring_2018, title={Monotone Suchbarkeit bei den selbststabilisierenden
    Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten}, publisher={Universität
    Paderborn}, author={Jochmaring, Moritz}, year={2018} }'
  chicago: Jochmaring, Moritz. <i>Monotone Suchbarkeit Bei Den Selbststabilisierenden
    Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten</i>.
    Universität Paderborn, 2018.
  ieee: M. Jochmaring, <i>Monotone Suchbarkeit bei den selbststabilisierenden Protokollen
    Build-List und Build-Multilist mit systemverlassenden Knoten</i>. Universität
    Paderborn, 2018.
  mla: Jochmaring, Moritz. <i>Monotone Suchbarkeit Bei Den Selbststabilisierenden
    Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten</i>.
    Universität Paderborn, 2018.
  short: M. Jochmaring, Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen
    Build-List Und Build-Multilist Mit Systemverlassenden Knoten, Universität Paderborn,
    2018.
date_created: 2018-11-06T06:21:37Z
date_updated: 2022-01-06T07:01:50Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List
  und Build-Multilist mit systemverlassenden Knoten
type: bachelorsthesis
user_id: '477'
year: '2018'
...
---
_id: '5403'
author:
- first_name: Marcel
  full_name: Geromel, Marcel
  last_name: Geromel
citation:
  ama: Geromel M. <i>Mobile Facility Leasing</i>. Universität Paderborn; 2018.
  apa: Geromel, M. (2018). <i>Mobile Facility Leasing</i>. Universität Paderborn.
  bibtex: '@book{Geromel_2018, title={Mobile Facility Leasing}, publisher={Universität
    Paderborn}, author={Geromel, Marcel}, year={2018} }'
  chicago: Geromel, Marcel. <i>Mobile Facility Leasing</i>. Universität Paderborn,
    2018.
  ieee: M. Geromel, <i>Mobile Facility Leasing</i>. Universität Paderborn, 2018.
  mla: Geromel, Marcel. <i>Mobile Facility Leasing</i>. Universität Paderborn, 2018.
  short: M. Geromel, Mobile Facility Leasing, Universität Paderborn, 2018.
date_created: 2018-11-07T09:20:59Z
date_updated: 2022-01-06T07:01:51Z
department:
- _id: '63'
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: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
title: Mobile Facility Leasing
type: bachelorsthesis
user_id: '477'
year: '2018'
...
---
_id: '5404'
author:
- first_name: Patrick Irenäus
  full_name: Kolpaczki, Patrick Irenäus
  last_name: Kolpaczki
citation:
  ama: Kolpaczki PI. <i>Online Algorithmen Für Das K-Page Migration Problem</i>. Universität
    Paderborn; 2018.
  apa: Kolpaczki, P. I. (2018). <i>Online Algorithmen für das k-Page Migration Problem</i>.
    Universität Paderborn.
  bibtex: '@book{Kolpaczki_2018, title={Online Algorithmen für das k-Page Migration
    Problem}, publisher={Universität Paderborn}, author={Kolpaczki, Patrick Irenäus},
    year={2018} }'
  chicago: Kolpaczki, Patrick Irenäus. <i>Online Algorithmen Für Das K-Page Migration
    Problem</i>. Universität Paderborn, 2018.
  ieee: P. I. Kolpaczki, <i>Online Algorithmen für das k-Page Migration Problem</i>.
    Universität Paderborn, 2018.
  mla: Kolpaczki, Patrick Irenäus. <i>Online Algorithmen Für Das K-Page Migration
    Problem</i>. Universität Paderborn, 2018.
  short: P.I. Kolpaczki, Online Algorithmen Für Das K-Page Migration Problem, Universität
    Paderborn, 2018.
date_created: 2018-11-07T09:23:17Z
date_updated: 2022-01-06T07:01:51Z
department:
- _id: '63'
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: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
title: Online Algorithmen für das k-Page Migration Problem
type: bachelorsthesis
user_id: '477'
year: '2018'
...