---
_id: '18639'
author:
- first_name: Tobias
  full_name: Terfort, Tobias
  last_name: Terfort
citation:
  ama: Terfort T. <i>Enhancing Security by Usage of Universal One-Way Hash Functions</i>.
    Universität Paderborn; 2020.
  apa: Terfort, T. (2020). <i>Enhancing Security by Usage of Universal One-Way Hash
    Functions</i>. Universität Paderborn.
  bibtex: '@book{Terfort_2020, title={Enhancing Security by Usage of Universal One-Way
    Hash Functions}, publisher={Universität Paderborn}, author={Terfort, Tobias},
    year={2020} }'
  chicago: Terfort, Tobias. <i>Enhancing Security by Usage of Universal One-Way Hash
    Functions</i>. Universität Paderborn, 2020.
  ieee: T. Terfort, <i>Enhancing Security by Usage of Universal One-Way Hash Functions</i>.
    Universität Paderborn, 2020.
  mla: Terfort, Tobias. <i>Enhancing Security by Usage of Universal One-Way Hash Functions</i>.
    Universität Paderborn, 2020.
  short: T. Terfort, Enhancing Security by Usage of Universal One-Way Hash Functions,
    Universität Paderborn, 2020.
date_created: 2020-08-29T13:30:56Z
date_updated: 2022-01-06T06:53:50Z
department:
- _id: '7'
- _id: '64'
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: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Enhancing Security by Usage of Universal One-Way Hash Functions
type: bachelorsthesis
user_id: '477'
year: '2020'
...
---
_id: '18648'
author:
- first_name: Andreas
  full_name: Guggenmos, Andreas
  last_name: Guggenmos
citation:
  ama: Guggenmos A. <i>Algorithmen Für Selbststabilisierende Skip+-Delaunaygraphen</i>.
    Universität Paderborn; 2020.
  apa: Guggenmos, A. (2020). <i>Algorithmen für selbststabilisierende Skip+-Delaunaygraphen</i>.
    Universität Paderborn.
  bibtex: '@book{Guggenmos_2020, title={Algorithmen für selbststabilisierende Skip+-Delaunaygraphen},
    publisher={Universität Paderborn}, author={Guggenmos, Andreas}, year={2020} }'
  chicago: Guggenmos, Andreas. <i>Algorithmen Für Selbststabilisierende Skip+-Delaunaygraphen</i>.
    Universität Paderborn, 2020.
  ieee: A. Guggenmos, <i>Algorithmen für selbststabilisierende Skip+-Delaunaygraphen</i>.
    Universität Paderborn, 2020.
  mla: Guggenmos, Andreas. <i>Algorithmen Für Selbststabilisierende Skip+-Delaunaygraphen</i>.
    Universität Paderborn, 2020.
  short: A. Guggenmos, Algorithmen Für Selbststabilisierende Skip+-Delaunaygraphen,
    Universität Paderborn, 2020.
date_created: 2020-08-31T07:14:51Z
date_updated: 2022-01-06T06:53:50Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subproject A1
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: Algorithmen für selbststabilisierende Skip+-Delaunaygraphen
type: bachelorsthesis
user_id: '477'
year: '2020'
...
---
_id: '23376'
author:
- first_name: Goran
  full_name: Piskachev, Goran
  last_name: Piskachev
- first_name: Lisa
  full_name: Nguyen Quang Do, Lisa
  last_name: Nguyen Quang Do
- first_name: Oshando
  full_name: Johnson, Oshando
  last_name: Johnson
- first_name: Eric
  full_name: Bodden, Eric
  last_name: Bodden
citation:
  ama: 'Piskachev G, Nguyen Quang Do L, Johnson O, Bodden E. SWAN_ASSIST: Semi-Automated
    Detection of Code-Specific, Security-Relevant Methods. In: <i>2019 34th IEEE/ACM
    International Conference on Automated Software Engineering (ASE)</i>. ; 2020.
    doi:<a href="https://doi.org/10.1109/ase.2019.00110">10.1109/ase.2019.00110</a>'
  apa: 'Piskachev, G., Nguyen Quang Do, L., Johnson, O., &#38; Bodden, E. (2020).
    SWAN_ASSIST: Semi-Automated Detection of Code-Specific, Security-Relevant Methods.
    <i>2019 34th IEEE/ACM International Conference on Automated Software Engineering
    (ASE)</i>. <a href="https://doi.org/10.1109/ase.2019.00110">https://doi.org/10.1109/ase.2019.00110</a>'
  bibtex: '@inproceedings{Piskachev_Nguyen Quang Do_Johnson_Bodden_2020, title={SWAN_ASSIST:
    Semi-Automated Detection of Code-Specific, Security-Relevant Methods}, DOI={<a
    href="https://doi.org/10.1109/ase.2019.00110">10.1109/ase.2019.00110</a>}, booktitle={2019
    34th IEEE/ACM International Conference on Automated Software Engineering (ASE)},
    author={Piskachev, Goran and Nguyen Quang Do, Lisa and Johnson, Oshando and Bodden,
    Eric}, year={2020} }'
  chicago: 'Piskachev, Goran, Lisa Nguyen Quang Do, Oshando Johnson, and Eric Bodden.
    “SWAN_ASSIST: Semi-Automated Detection of Code-Specific, Security-Relevant Methods.”
    In <i>2019 34th IEEE/ACM International Conference on Automated Software Engineering
    (ASE)</i>, 2020. <a href="https://doi.org/10.1109/ase.2019.00110">https://doi.org/10.1109/ase.2019.00110</a>.'
  ieee: 'G. Piskachev, L. Nguyen Quang Do, O. Johnson, and E. Bodden, “SWAN_ASSIST:
    Semi-Automated Detection of Code-Specific, Security-Relevant Methods,” 2020, doi:
    <a href="https://doi.org/10.1109/ase.2019.00110">10.1109/ase.2019.00110</a>.'
  mla: 'Piskachev, Goran, et al. “SWAN_ASSIST: Semi-Automated Detection of Code-Specific,
    Security-Relevant Methods.” <i>2019 34th IEEE/ACM International Conference on
    Automated Software Engineering (ASE)</i>, 2020, doi:<a href="https://doi.org/10.1109/ase.2019.00110">10.1109/ase.2019.00110</a>.'
  short: 'G. Piskachev, L. Nguyen Quang Do, O. Johnson, E. Bodden, in: 2019 34th IEEE/ACM
    International Conference on Automated Software Engineering (ASE), 2020.'
date_created: 2021-08-09T12:03:30Z
date_updated: 2022-01-06T06:55:50Z
department:
- _id: '241'
- _id: '662'
- _id: '76'
doi: 10.1109/ase.2019.00110
language:
- iso: eng
publication: 2019 34th IEEE/ACM International Conference on Automated Software Engineering
  (ASE)
publication_status: published
status: public
title: 'SWAN_ASSIST: Semi-Automated Detection of Code-Specific, Security-Relevant
  Methods'
type: conference
user_id: '5786'
year: '2020'
...
---
_id: '23377'
author:
- first_name: Goran
  full_name: Piskachev, Goran
  last_name: Piskachev
- first_name: Tobias
  full_name: Petrasch, Tobias
  last_name: Petrasch
- first_name: Johannes
  full_name: Späth, Johannes
  last_name: Späth
- first_name: Eric
  full_name: Bodden, Eric
  last_name: Bodden
citation:
  ama: 'Piskachev G, Petrasch T, Späth J, Bodden E. AuthCheck: Program-State Analysis
    for Access-Control Vulnerabilities. In: <i>Lecture Notes in Computer Science</i>.
    ; 2020. doi:<a href="https://doi.org/10.1007/978-3-030-54997-8_34">10.1007/978-3-030-54997-8_34</a>'
  apa: 'Piskachev, G., Petrasch, T., Späth, J., &#38; Bodden, E. (2020). AuthCheck:
    Program-State Analysis for Access-Control Vulnerabilities. In <i>Lecture Notes
    in Computer Science</i>. <a href="https://doi.org/10.1007/978-3-030-54997-8_34">https://doi.org/10.1007/978-3-030-54997-8_34</a>'
  bibtex: '@inbook{Piskachev_Petrasch_Späth_Bodden_2020, place={Cham}, title={AuthCheck:
    Program-State Analysis for Access-Control Vulnerabilities}, DOI={<a href="https://doi.org/10.1007/978-3-030-54997-8_34">10.1007/978-3-030-54997-8_34</a>},
    booktitle={Lecture Notes in Computer Science}, author={Piskachev, Goran and Petrasch,
    Tobias and Späth, Johannes and Bodden, Eric}, year={2020} }'
  chicago: 'Piskachev, Goran, Tobias Petrasch, Johannes Späth, and Eric Bodden. “AuthCheck:
    Program-State Analysis for Access-Control Vulnerabilities.” In <i>Lecture Notes
    in Computer Science</i>. Cham, 2020. <a href="https://doi.org/10.1007/978-3-030-54997-8_34">https://doi.org/10.1007/978-3-030-54997-8_34</a>.'
  ieee: 'G. Piskachev, T. Petrasch, J. Späth, and E. Bodden, “AuthCheck: Program-State
    Analysis for Access-Control Vulnerabilities,” in <i>Lecture Notes in Computer
    Science</i>, Cham, 2020.'
  mla: 'Piskachev, Goran, et al. “AuthCheck: Program-State Analysis for Access-Control
    Vulnerabilities.” <i>Lecture Notes in Computer Science</i>, 2020, doi:<a href="https://doi.org/10.1007/978-3-030-54997-8_34">10.1007/978-3-030-54997-8_34</a>.'
  short: 'G. Piskachev, T. Petrasch, J. Späth, E. Bodden, in: Lecture Notes in Computer
    Science, Cham, 2020.'
date_created: 2021-08-09T12:05:09Z
date_updated: 2022-01-06T06:55:50Z
department:
- _id: '241'
- _id: '662'
- _id: '76'
doi: 10.1007/978-3-030-54997-8_34
language:
- iso: eng
place: Cham
publication: Lecture Notes in Computer Science
publication_identifier:
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: 'AuthCheck: Program-State Analysis for Access-Control Vulnerabilities'
type: book_chapter
user_id: '5786'
year: '2020'
...
---
_id: '7283'
author:
- first_name: Milad
  full_name: Alshomary, Milad
  id: '73059'
  last_name: Alshomary
- first_name: Nick
  full_name: Düsterhus, Nick
  last_name: Düsterhus
- first_name: Henning
  full_name: Wachsmuth, Henning
  id: '3900'
  last_name: Wachsmuth
citation:
  ama: 'Alshomary M, Düsterhus N, Wachsmuth H. Extractive Snippet Generation for Arguments.
    In: <i>Proceedings of 43rd International ACM SIGIR Conference on Research and
    Development in Information Retrieval</i>. ; 2020:1969-1972.'
  apa: Alshomary, M., Düsterhus, N., &#38; Wachsmuth, H. (2020). Extractive Snippet
    Generation for Arguments. In <i>Proceedings of 43rd International ACM SIGIR Conference
    on Research and Development in Information Retrieval</i> (pp. 1969–1972). Xi’an,
    China.
  bibtex: '@inproceedings{Alshomary_Düsterhus_Wachsmuth_2020, title={Extractive Snippet
    Generation for Arguments}, booktitle={Proceedings of 43rd International ACM SIGIR
    Conference on Research and Development in Information Retrieval}, author={Alshomary,
    Milad and Düsterhus, Nick and Wachsmuth, Henning}, year={2020}, pages={1969–1972}
    }'
  chicago: Alshomary, Milad, Nick Düsterhus, and Henning Wachsmuth. “Extractive Snippet
    Generation for Arguments.” In <i>Proceedings of 43rd International ACM SIGIR Conference
    on Research and Development in Information Retrieval</i>, 1969–72, 2020.
  ieee: M. Alshomary, N. Düsterhus, and H. Wachsmuth, “Extractive Snippet Generation
    for Arguments,” in <i>Proceedings of 43rd International ACM SIGIR Conference on
    Research and Development in Information Retrieval</i>, Xi’an, China, 2020, pp.
    1969–1972.
  mla: Alshomary, Milad, et al. “Extractive Snippet Generation for Arguments.” <i>Proceedings
    of 43rd International ACM SIGIR Conference on Research and Development in Information
    Retrieval</i>, 2020, pp. 1969–72.
  short: 'M. Alshomary, N. Düsterhus, H. Wachsmuth, in: Proceedings of 43rd International
    ACM SIGIR Conference on Research and Development in Information Retrieval, 2020,
    pp. 1969–1972.'
conference:
  end_date: 20202.07.30
  location: Xi'an, China
  name: 43rd International ACM SIGIR Conference on Research and Development in Information
    Retrieval (SIGIR20)
  start_date: 20202.07.25
date_created: 2019-01-31T08:06:15Z
date_updated: 2022-01-06T07:03:32Z
ddc:
- '000'
department:
- _id: '600'
- _id: '568'
file:
- access_level: closed
  content_type: application/pdf
  creator: sile2804
  date_created: 2020-05-26T08:41:56Z
  date_updated: 2020-05-26T08:41:56Z
  file_id: '17062'
  file_name: sigir20-argument-argument-snippet-generation-frame.pdf
  file_size: 807341
  relation: main_file
  success: 1
file_date_updated: 2020-05-26T08:41:56Z
has_accepted_license: '1'
language:
- iso: eng
page: 1969-1972
publication: Proceedings of 43rd International ACM SIGIR Conference on Research and
  Development in Information Retrieval
status: public
title: Extractive Snippet Generation for Arguments
type: conference
user_id: '82920'
year: '2020'
...
---
_id: '16487'
author:
- first_name: Jan
  full_name: Bobolz, Jan
  id: '27207'
  last_name: Bobolz
- first_name: Fabian
  full_name: Eidens, Fabian
  id: '25078'
  last_name: Eidens
- first_name: Stephan
  full_name: Krenn, Stephan
  last_name: Krenn
- first_name: Daniel
  full_name: Slamanig, Daniel
  last_name: Slamanig
- first_name: Christoph
  full_name: Striecks, Christoph
  last_name: Striecks
citation:
  ama: 'Bobolz J, Eidens F, Krenn S, Slamanig D, Striecks C. Privacy-Preserving Incentive
    Systems with Highly Efficient Point-Collection. In: <i>Proceedings of the 15th
    ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20),</i>.
    New York, NY, USA: ACM; 2020. doi:<a href="https://doi.org/10.1145/3320269.3384769">10.1145/3320269.3384769</a>'
  apa: 'Bobolz, J., Eidens, F., Krenn, S., Slamanig, D., &#38; Striecks, C. (2020).
    Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection. In
    <i>Proceedings of the 15th ACM Asia Conference on Computer and Communications
    Security (ASIA CCS ’20),</i>. New York, NY, USA: ACM. <a href="https://doi.org/10.1145/3320269.3384769">https://doi.org/10.1145/3320269.3384769</a>'
  bibtex: '@inproceedings{Bobolz_Eidens_Krenn_Slamanig_Striecks_2020, place={New York,
    NY, USA}, title={Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection},
    DOI={<a href="https://doi.org/10.1145/3320269.3384769">10.1145/3320269.3384769</a>},
    booktitle={Proceedings of the 15th ACM Asia Conference on Computer and Communications
    Security (ASIA CCS ’20),}, publisher={ACM}, author={Bobolz, Jan and Eidens, Fabian
    and Krenn, Stephan and Slamanig, Daniel and Striecks, Christoph}, year={2020}
    }'
  chicago: 'Bobolz, Jan, Fabian Eidens, Stephan Krenn, Daniel Slamanig, and Christoph
    Striecks. “Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection.”
    In <i>Proceedings of the 15th ACM Asia Conference on Computer and Communications
    Security (ASIA CCS ’20),</i>. New York, NY, USA: ACM, 2020. <a href="https://doi.org/10.1145/3320269.3384769">https://doi.org/10.1145/3320269.3384769</a>.'
  ieee: J. Bobolz, F. Eidens, S. Krenn, D. Slamanig, and C. Striecks, “Privacy-Preserving
    Incentive Systems with Highly Efficient Point-Collection,” in <i>Proceedings of
    the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS
    ’20),</i> Taiwan, 2020.
  mla: Bobolz, Jan, et al. “Privacy-Preserving Incentive Systems with Highly Efficient
    Point-Collection.” <i>Proceedings of the 15th ACM Asia Conference on Computer
    and Communications Security (ASIA CCS ’20),</i> ACM, 2020, doi:<a href="https://doi.org/10.1145/3320269.3384769">10.1145/3320269.3384769</a>.
  short: 'J. Bobolz, F. Eidens, S. Krenn, D. Slamanig, C. Striecks, in: Proceedings
    of the 15th ACM Asia Conference on Computer and Communications Security (ASIA
    CCS ’20), ACM, New York, NY, USA, 2020.'
conference:
  location: Taiwan
  name: ASIA CCS'20
date_created: 2020-04-09T10:00:29Z
date_updated: 2022-01-06T06:52:51Z
ddc:
- '000'
department:
- _id: '64'
doi: 10.1145/3320269.3384769
file:
- access_level: closed
  content_type: application/pdf
  creator: feidens
  date_created: 2020-04-09T09:59:03Z
  date_updated: 2020-04-09T09:59:03Z
  file_id: '16488'
  file_name: main.pdf
  file_size: 553623
  relation: main_file
  success: 1
file_date_updated: 2020-04-09T09:59:03Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://eprint.iacr.org/2020/382
oa: '1'
place: New York, NY, USA
project:
- _id: '1'
  name: SFB 901
- _id: '84'
  name: SFB 901 -Subproject T2
- _id: '82'
  name: SFB 901 - Project Area T
publication: Proceedings of the 15th ACM Asia Conference on Computer and Communications
  Security (ASIA CCS ’20),
publisher: ACM
status: public
title: Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection
type: conference
user_id: '477'
year: '2020'
...
---
_id: '16570'
author:
- first_name: Ivan
  full_name: Jovanovikj, Ivan
  id: '39187'
  last_name: Jovanovikj
  orcid: https://orcid.org/0000-0002-1838-794X
- first_name: Enes
  full_name: Yigitbas, Enes
  id: '8447'
  last_name: Yigitbas
  orcid: 0000-0002-5967-833X
- first_name: Stefan
  full_name: Sauer, Stefan
  id: '447'
  last_name: Sauer
- first_name: Gregor
  full_name: Engels, Gregor
  id: '107'
  last_name: Engels
citation:
  ama: Jovanovikj I, Yigitbas E, Sauer S, Engels G. Challenges in Model-Driven Development
    of Multi-Platform Augmented Reality Applications . <i>Softwaretechnik-Trends,
    Proceedings of the 22st Workshop Software-Reengineering &#38; Evolution (WSRE)
    &#38; 11h Workshop Design for Future (DFF)</i>. 2020.
  apa: Jovanovikj, I., Yigitbas, E., Sauer, S., &#38; Engels, G. (2020). Challenges
    in Model-Driven Development of Multi-Platform Augmented Reality Applications .
    <i>Softwaretechnik-Trends, Proceedings of the 22st Workshop Software-Reengineering
    &#38; Evolution (WSRE) &#38; 11h Workshop Design for Future (DFF)</i>.
  bibtex: '@article{Jovanovikj_Yigitbas_Sauer_Engels_2020, title={Challenges in Model-Driven
    Development of Multi-Platform Augmented Reality Applications }, journal={Softwaretechnik-Trends,
    Proceedings of the 22st Workshop Software-Reengineering &#38; Evolution (WSRE)
    &#38; 11h Workshop Design for Future (DFF)}, author={Jovanovikj, Ivan and Yigitbas,
    Enes and Sauer, Stefan and Engels, Gregor}, year={2020} }'
  chicago: Jovanovikj, Ivan, Enes Yigitbas, Stefan Sauer, and Gregor Engels. “Challenges
    in Model-Driven Development of Multi-Platform Augmented Reality Applications .”
    <i>Softwaretechnik-Trends, Proceedings of the 22st Workshop Software-Reengineering
    &#38; Evolution (WSRE) &#38; 11h Workshop Design for Future (DFF)</i>, 2020.
  ieee: I. Jovanovikj, E. Yigitbas, S. Sauer, and G. Engels, “Challenges in Model-Driven
    Development of Multi-Platform Augmented Reality Applications ,” <i>Softwaretechnik-Trends,
    Proceedings of the 22st Workshop Software-Reengineering &#38; Evolution (WSRE)
    &#38; 11h Workshop Design for Future (DFF)</i>, 2020.
  mla: Jovanovikj, Ivan, et al. “Challenges in Model-Driven Development of Multi-Platform
    Augmented Reality Applications .” <i>Softwaretechnik-Trends, Proceedings of the
    22st Workshop Software-Reengineering &#38; Evolution (WSRE) &#38; 11h Workshop
    Design for Future (DFF)</i>, 2020.
  short: I. Jovanovikj, E. Yigitbas, S. Sauer, G. Engels, Softwaretechnik-Trends,
    Proceedings of the 22st Workshop Software-Reengineering &#38; Evolution (WSRE)
    &#38; 11h Workshop Design for Future (DFF) (2020).
date_created: 2020-04-15T13:54:26Z
date_updated: 2022-01-06T06:52:52Z
department:
- _id: '66'
- _id: '534'
language:
- iso: eng
publication: Softwaretechnik-Trends, Proceedings of the 22st Workshop Software-Reengineering
  & Evolution (WSRE) & 11h Workshop Design for Future (DFF)
status: public
title: 'Challenges in Model-Driven Development of Multi-Platform Augmented Reality
  Applications '
type: journal_article
user_id: '8447'
year: '2020'
...
---
_id: '16724'
author:
- first_name: Arnab
  full_name: Sharma, Arnab
  id: '67200'
  last_name: Sharma
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
citation:
  ama: 'Sharma A, Wehrheim H. Higher Income, Larger Loan? Monotonicity Testing of
    Machine Learning Models. In: <i>Proceedings of the ACM SIGSOFT International Symposium
    on Software Testing and Analysis (ISSTA).</i> ACM.'
  apa: Sharma, A., &#38; Wehrheim, H. (n.d.). Higher Income, Larger Loan? Monotonicity
    Testing of Machine Learning Models. In <i>Proceedings of the ACM SIGSOFT International
    Symposium on Software Testing and Analysis (ISSTA).</i> ACM.
  bibtex: '@inproceedings{Sharma_Wehrheim, title={Higher Income, Larger Loan? Monotonicity
    Testing of Machine Learning Models}, booktitle={Proceedings of the ACM SIGSOFT
    International Symposium on Software Testing and Analysis (ISSTA).}, publisher={ACM},
    author={Sharma, Arnab and Wehrheim, Heike} }'
  chicago: Sharma, Arnab, and Heike Wehrheim. “Higher Income, Larger Loan? Monotonicity
    Testing of Machine Learning Models.” In <i>Proceedings of the ACM SIGSOFT International
    Symposium on Software Testing and Analysis (ISSTA).</i> ACM, n.d.
  ieee: A. Sharma and H. Wehrheim, “Higher Income, Larger Loan? Monotonicity Testing
    of Machine Learning Models,” in <i>Proceedings of the ACM SIGSOFT International
    Symposium on Software Testing and Analysis (ISSTA).</i>
  mla: Sharma, Arnab, and Heike Wehrheim. “Higher Income, Larger Loan? Monotonicity
    Testing of Machine Learning Models.” <i>Proceedings of the ACM SIGSOFT International
    Symposium on Software Testing and Analysis (ISSTA).</i>, ACM.
  short: 'A. Sharma, H. Wehrheim, in: Proceedings of the ACM SIGSOFT International
    Symposium on Software Testing and Analysis (ISSTA)., ACM, n.d.'
date_created: 2020-04-19T14:01:53Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '7'
- _id: '77'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '3'
  name: SFB 901 - Project Area B
- _id: '11'
  name: SFB 901 - Subproject B3
publication: Proceedings of the ACM SIGSOFT International Symposium on Software Testing
  and Analysis (ISSTA).
publication_status: accepted
publisher: ACM
status: public
title: Higher Income, Larger Loan? Monotonicity Testing of Machine Learning Models
type: conference
user_id: '477'
year: '2020'
...
---
_id: '16725'
author:
- first_name: Cedric
  full_name: Richter, Cedric
  id: '50003'
  last_name: Richter
- first_name: Eyke
  full_name: Hüllermeier, Eyke
  id: '48129'
  last_name: Hüllermeier
- first_name: Marie-Christine
  full_name: Jakobs, Marie-Christine
  last_name: Jakobs
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
citation:
  ama: Richter C, Hüllermeier E, Jakobs M-C, Wehrheim H. Algorithm Selection for Software
    Validation Based on Graph Kernels. <i>Journal of Automated Software Engineering</i>.
  apa: Richter, C., Hüllermeier, E., Jakobs, M.-C., &#38; Wehrheim, H. (n.d.). Algorithm
    Selection for Software Validation Based on Graph Kernels. <i>Journal of Automated
    Software Engineering</i>.
  bibtex: '@article{Richter_Hüllermeier_Jakobs_Wehrheim, title={Algorithm Selection
    for Software Validation Based on Graph Kernels}, journal={Journal of Automated
    Software Engineering}, publisher={Springer}, author={Richter, Cedric and Hüllermeier,
    Eyke and Jakobs, Marie-Christine and Wehrheim, Heike} }'
  chicago: Richter, Cedric, Eyke Hüllermeier, Marie-Christine Jakobs, and Heike Wehrheim.
    “Algorithm Selection for Software Validation Based on Graph Kernels.” <i>Journal
    of Automated Software Engineering</i>, n.d.
  ieee: C. Richter, E. Hüllermeier, M.-C. Jakobs, and H. Wehrheim, “Algorithm Selection
    for Software Validation Based on Graph Kernels,” <i>Journal of Automated Software
    Engineering</i>.
  mla: Richter, Cedric, et al. “Algorithm Selection for Software Validation Based
    on Graph Kernels.” <i>Journal of Automated Software Engineering</i>, Springer.
  short: C. Richter, E. Hüllermeier, M.-C. Jakobs, H. Wehrheim, Journal of Automated
    Software Engineering (n.d.).
date_created: 2020-04-19T14:08:06Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '7'
- _id: '77'
- _id: '355'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '3'
  name: SFB 901 - Project Area B
- _id: '11'
  name: SFB 901 - Subproject B3
- _id: '12'
  name: SFB 901 - Subproject B4
publication: Journal of Automated Software Engineering
publication_status: accepted
publisher: Springer
status: public
title: Algorithm Selection for Software Validation Based on Graph Kernels
type: journal_article
user_id: '477'
year: '2020'
...
---
_id: '16902'
abstract:
- lang: eng
  text: "The maintenance of efficient and robust overlay networks is one\r\nof the
    most fundamental and reoccurring themes in networking.\r\nThis paper presents
    a survey of state-of-the-art \r\nalgorithms to design and repair overlay networks
    in a distributed\r\nmanner. In particular, we discuss basic algorithmic primitives\r\nto
    preserve connectivity, review algorithms for the fundamental\r\nproblem of graph
    linearization, and then survey self-stabilizing\r\nalgorithms for metric and scalable
    topologies. \r\nWe also identify open problems and avenues for future research.\r\n"
author:
- first_name: Michael
  full_name: Feldmann, Michael
  id: '23538'
  last_name: Feldmann
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Stefan
  full_name: Schmid, Stefan
  last_name: Schmid
citation:
  ama: Feldmann M, Scheideler C, Schmid S. Survey on Algorithms for Self-Stabilizing
    Overlay Networks. <i>ACM Computing Surveys</i>. 2020. doi:<a href="https://doi.org/10.1145/3397190">10.1145/3397190</a>
  apa: Feldmann, M., Scheideler, C., &#38; Schmid, S. (2020). Survey on Algorithms
    for Self-Stabilizing Overlay Networks. <i>ACM Computing Surveys</i>. <a href="https://doi.org/10.1145/3397190">https://doi.org/10.1145/3397190</a>
  bibtex: '@article{Feldmann_Scheideler_Schmid_2020, title={Survey on Algorithms for
    Self-Stabilizing Overlay Networks}, DOI={<a href="https://doi.org/10.1145/3397190">10.1145/3397190</a>},
    journal={ACM Computing Surveys}, publisher={ACM}, author={Feldmann, Michael and
    Scheideler, Christian and Schmid, Stefan}, year={2020} }'
  chicago: Feldmann, Michael, Christian Scheideler, and Stefan Schmid. “Survey on
    Algorithms for Self-Stabilizing Overlay Networks.” <i>ACM Computing Surveys</i>,
    2020. <a href="https://doi.org/10.1145/3397190">https://doi.org/10.1145/3397190</a>.
  ieee: M. Feldmann, C. Scheideler, and S. Schmid, “Survey on Algorithms for Self-Stabilizing
    Overlay Networks,” <i>ACM Computing Surveys</i>, 2020.
  mla: Feldmann, Michael, et al. “Survey on Algorithms for Self-Stabilizing Overlay
    Networks.” <i>ACM Computing Surveys</i>, ACM, 2020, doi:<a href="https://doi.org/10.1145/3397190">10.1145/3397190</a>.
  short: M. Feldmann, C. Scheideler, S. Schmid, ACM Computing Surveys (2020).
date_created: 2020-04-29T07:09:50Z
date_updated: 2022-01-06T06:52:58Z
department:
- _id: '79'
doi: 10.1145/3397190
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publication: ACM Computing Surveys
publisher: ACM
status: public
title: Survey on Algorithms for Self-Stabilizing Overlay Networks
type: journal_article
user_id: '23538'
year: '2020'
...
---
_id: '16903'
abstract:
- lang: eng
  text: "We consider the clock synchronization problem in the (discrete) beeping model:
    Given a network of $n$ nodes with each node having a clock value $\\delta(v) \\in
    \\{0,\\ldots T-1\\}$, the goal is to synchronize the clock values of all nodes
    such that they have the same value in any round.\r\nAs is standard in clock synchronization,
    we assume \\emph{arbitrary activations} for all nodes, i.e., the nodes start their
    protocol at an arbitrary round (not limited to $\\{0,\\ldots,T-1\\}$).\r\nWe give
    an asymptotically optimal algorithm that runs in $4D + \\Bigl\\lfloor \\frac{D}{\\lfloor
    T/4 \\rfloor} \\Bigr \\rfloor \\cdot (T \\mod 4) = O(D)$ rounds, where $D$ is
    the diameter of the network.\r\nOnce all nodes are in sync, they beep at the same
    round every $T$ rounds.\r\nThe algorithm drastically improves on the $O(T D)$-bound
    of \\cite{firefly_sync} (where $T$ is required to be at least $4n$, so the bound
    is no better than $O(nD)$).\r\nOur algorithm is very simple as nodes only have
    to maintain $3$ bits in addition to the $\\lceil \\log T \\rceil$ bits needed
    to maintain the clock.\r\nFurthermore we investigate the complexity of \\emph{self-stabilizing}
    solutions for the clock synchronization problem: We first show lower bounds of
    $\\Omega(\\max\\{T,n\\})$ rounds on the runtime and $\\Omega(\\log(\\max\\{T,n\\}))$
    bits of memory required for any such protocol.\r\nAfterwards we present a protocol
    that runs in $O(\\max\\{T,n\\})$ rounds using at most $O(\\log(\\max\\{T,n\\}))$
    bits at each node, which is asymptotically optimal with regards to both, runtime
    and memory requirements."
author:
- first_name: Michael
  full_name: Feldmann, Michael
  id: '23538'
  last_name: Feldmann
- first_name: Ardalan
  full_name: Khazraei, Ardalan
  last_name: Khazraei
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
citation:
  ama: 'Feldmann M, Khazraei A, Scheideler C. Time- and Space-Optimal Discrete Clock
    Synchronization in the Beeping Model. In: <i>Proceedings of the 32nd ACM Symposium
    on Parallelism in Algorithms and Architectures (SPAA)</i>. ACM; 2020. doi:<a href="https://doi.org/10.1145/3350755.3400246">10.1145/3350755.3400246</a>'
  apa: Feldmann, M., Khazraei, A., &#38; Scheideler, C. (2020). Time- and Space-Optimal
    Discrete Clock Synchronization in the Beeping Model. In <i>Proceedings of the
    32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>.
    ACM. <a href="https://doi.org/10.1145/3350755.3400246">https://doi.org/10.1145/3350755.3400246</a>
  bibtex: '@inproceedings{Feldmann_Khazraei_Scheideler_2020, title={Time- and Space-Optimal
    Discrete Clock Synchronization in the Beeping Model}, DOI={<a href="https://doi.org/10.1145/3350755.3400246">10.1145/3350755.3400246</a>},
    booktitle={Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms
    and Architectures (SPAA)}, publisher={ACM}, author={Feldmann, Michael and Khazraei,
    Ardalan and Scheideler, Christian}, year={2020} }'
  chicago: Feldmann, Michael, Ardalan Khazraei, and Christian Scheideler. “Time- and
    Space-Optimal Discrete Clock Synchronization in the Beeping Model.” In <i>Proceedings
    of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>.
    ACM, 2020. <a href="https://doi.org/10.1145/3350755.3400246">https://doi.org/10.1145/3350755.3400246</a>.
  ieee: M. Feldmann, A. Khazraei, and C. Scheideler, “Time- and Space-Optimal Discrete
    Clock Synchronization in the Beeping Model,” in <i>Proceedings of the 32nd ACM
    Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2020.
  mla: Feldmann, Michael, et al. “Time- and Space-Optimal Discrete Clock Synchronization
    in the Beeping Model.” <i>Proceedings of the 32nd ACM Symposium on Parallelism
    in Algorithms and Architectures (SPAA)</i>, ACM, 2020, doi:<a href="https://doi.org/10.1145/3350755.3400246">10.1145/3350755.3400246</a>.
  short: 'M. Feldmann, A. Khazraei, C. Scheideler, in: Proceedings of the 32nd ACM
    Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2020.'
date_created: 2020-04-29T07:16:35Z
date_updated: 2022-01-06T06:52:58Z
department:
- _id: '79'
doi: 10.1145/3350755.3400246
external_id:
  arxiv:
  - '2005.07388'
language:
- iso: eng
project:
- _id: '96'
  name: Algorithmen für programmierbare Materie in einem physiologischen Medium
publication: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and
  Architectures (SPAA)
publisher: ACM
status: public
title: Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model
type: conference
user_id: '23538'
year: '2020'
...
---
_id: '16933'
abstract:
- lang: eng
  text: The continuous innovation of its business models is an important task for
    a company to stay competitive. During this process, the company has to validate
    various hypotheses about its business models by adapting to uncertain and changing
    customer needs effectively and efficiently. This adaptation, in turn, can be supported
    by the concept of Software Product Lines (SPLs). SPLs reduce the time to market
    by deriving products for customers with changing requirements using a common set
    of features, structured as a feature model. Analogously, we support the process
    of business model adaptation by applying the engineering process of SPLs to the
    structure of the Business Model Canvas (BMC). We call this concept a Business
    Model Decision Line (BMDL). The BMDL matches business domain knowledge in the
    form of a feature model with customer needs to derive hypotheses about the business
    model together with experiments for validation. Our approach is effective by providing
    a comprehensive overview of possible business model adaptations and efficient
    by reusing experiments for different hypotheses. We implement our approach in
    a tool and illustrate the usefulness with an example of developing business models
    for a mobile application.
author:
- first_name: Sebastian
  full_name: Gottschalk, Sebastian
  id: '47208'
  last_name: Gottschalk
- first_name: Florian
  full_name: Rittmeier, Florian
  id: '5281'
  last_name: Rittmeier
- first_name: Gregor
  full_name: Engels, Gregor
  id: '107'
  last_name: Engels
citation:
  ama: 'Gottschalk S, Rittmeier F, Engels G. Hypothesis-driven Adaptation of Business
    Models based on Product Line Engineering. In: <i>Proceedings of the 22nd IEEE
    International Conference on Business Informatics</i>. IEEE; 2020. doi:<a href="https://doi.org/10.1109/CBI49978.2020.00022">10.1109/CBI49978.2020.00022</a>'
  apa: 'Gottschalk, S., Rittmeier, F., &#38; Engels, G. (2020). Hypothesis-driven
    Adaptation of Business Models based on Product Line Engineering. In <i>Proceedings
    of the 22nd IEEE International Conference on Business Informatics</i>. Antwerp:
    IEEE. <a href="https://doi.org/10.1109/CBI49978.2020.00022">https://doi.org/10.1109/CBI49978.2020.00022</a>'
  bibtex: '@inproceedings{Gottschalk_Rittmeier_Engels_2020, title={Hypothesis-driven
    Adaptation of Business Models based on Product Line Engineering}, DOI={<a href="https://doi.org/10.1109/CBI49978.2020.00022">10.1109/CBI49978.2020.00022</a>},
    booktitle={Proceedings of the 22nd IEEE International Conference on Business Informatics},
    publisher={IEEE}, author={Gottschalk, Sebastian and Rittmeier, Florian and Engels,
    Gregor}, year={2020} }'
  chicago: Gottschalk, Sebastian, Florian Rittmeier, and Gregor Engels. “Hypothesis-Driven
    Adaptation of Business Models Based on Product Line Engineering.” In <i>Proceedings
    of the 22nd IEEE International Conference on Business Informatics</i>. IEEE, 2020.
    <a href="https://doi.org/10.1109/CBI49978.2020.00022">https://doi.org/10.1109/CBI49978.2020.00022</a>.
  ieee: S. Gottschalk, F. Rittmeier, and G. Engels, “Hypothesis-driven Adaptation
    of Business Models based on Product Line Engineering,” in <i>Proceedings of the
    22nd IEEE International Conference on Business Informatics</i>, Antwerp, 2020.
  mla: Gottschalk, Sebastian, et al. “Hypothesis-Driven Adaptation of Business Models
    Based on Product Line Engineering.” <i>Proceedings of the 22nd IEEE International
    Conference on Business Informatics</i>, IEEE, 2020, doi:<a href="https://doi.org/10.1109/CBI49978.2020.00022">10.1109/CBI49978.2020.00022</a>.
  short: 'S. Gottschalk, F. Rittmeier, G. Engels, in: Proceedings of the 22nd IEEE
    International Conference on Business Informatics, IEEE, 2020.'
conference:
  end_date: 2020-06-24
  location: Antwerp
  name: 22nd IEEE International Conference on Business Informatics
  start_date: 2020-06-22
date_created: 2020-05-04T12:16:54Z
date_updated: 2022-01-06T06:52:59Z
ddc:
- '006'
department:
- _id: '66'
doi: 10.1109/CBI49978.2020.00022
file:
- access_level: open_access
  content_type: application/pdf
  creator: sego
  date_created: 2020-07-14T09:33:00Z
  date_updated: 2020-07-14T09:33:00Z
  file_id: '17383'
  file_name: CBI.pdf
  file_size: 569290
  relation: main_file
file_date_updated: 2020-07-14T09:33:00Z
has_accepted_license: '1'
keyword:
- Business Model Decision Line
- Business Model Adaptation
- Hypothesis-driven Adaptation
- Software Product Line
- Feature Model
language:
- iso: eng
oa: '1'
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '17'
  name: SFB 901 - Subproject C5
publication: Proceedings of the 22nd IEEE International Conference on Business Informatics
publisher: IEEE
status: public
title: Hypothesis-driven Adaptation of Business Models based on Product Line Engineering
type: conference
user_id: '47208'
year: '2020'
...
---
_id: '16934'
abstract:
- lang: eng
  text: 'To build successful products, the developers have to adapt their product
    features and business models to uncertain customer needs. This adaptation is part
    of the research discipline of Hypotheses Engineering (HE) where customer needs
    can be seen as hypotheses that need to be tested iteratively by conducting experiments
    together with the customer. So far, modeling support and associated traceability
    of this iterative process are missing. Both, in turn, are important to document
    the adaptation to the customer needs and identify experiments that provide most
    evidence to the customer needs. To target this issue, we introduce a model-based
    HE approach with a twofold contribution: First, we develop a modeling language
    that models hypotheses and experiments as interrelated hierarchies together with
    a mapping between them. While the hypotheses are labeled with a score level of
    their current evidence, the experiments are labeled with a score level of maximum
    evidence that can be achieved during conduction. Second, we provide an iterative
    process to determine experiments that offer the most evidence improvement to the
    modeled hypotheses. We illustrate the usefulness of the approach with an example
    of testing the business model of a mobile application.'
author:
- first_name: Sebastian
  full_name: Gottschalk, Sebastian
  id: '47208'
  last_name: Gottschalk
- first_name: Enes
  full_name: Yigitbas, Enes
  id: '8447'
  last_name: Yigitbas
  orcid: 0000-0002-5967-833X
- first_name: Gregor
  full_name: Engels, Gregor
  id: '107'
  last_name: Engels
citation:
  ama: 'Gottschalk S, Yigitbas E, Engels G. Model-based Hypothesis Engineering for
    Supporting Adaptation to Uncertain Customer Needs. In: Shishkov B, ed. <i>Business
    Modeling and Software Design</i>. Vol 391. Lecture Notes in Business Information
    Processing. Springer International Publishing; 2020:276-286. doi:<a href="https://doi.org/10.1007/978-3-030-52306-0_18">10.1007/978-3-030-52306-0_18</a>'
  apa: 'Gottschalk, S., Yigitbas, E., &#38; Engels, G. (2020). Model-based Hypothesis
    Engineering for Supporting Adaptation to Uncertain Customer Needs. In B. Shishkov
    (Ed.), <i>Business Modeling and Software Design</i> (Vol. 391, pp. 276–286). Potsdam:
    Springer International Publishing. <a href="https://doi.org/10.1007/978-3-030-52306-0_18">https://doi.org/10.1007/978-3-030-52306-0_18</a>'
  bibtex: '@inproceedings{Gottschalk_Yigitbas_Engels_2020, series={Lecture Notes in
    Business Information Processing}, title={Model-based Hypothesis Engineering for
    Supporting Adaptation to Uncertain Customer Needs}, volume={391}, DOI={<a href="https://doi.org/10.1007/978-3-030-52306-0_18">10.1007/978-3-030-52306-0_18</a>},
    booktitle={Business Modeling and Software Design}, publisher={Springer International
    Publishing}, author={Gottschalk, Sebastian and Yigitbas, Enes and Engels, Gregor},
    editor={Shishkov, BorisEditor}, year={2020}, pages={276–286}, collection={Lecture
    Notes in Business Information Processing} }'
  chicago: Gottschalk, Sebastian, Enes Yigitbas, and Gregor Engels. “Model-Based Hypothesis
    Engineering for Supporting Adaptation to Uncertain Customer Needs.” In <i>Business
    Modeling and Software Design</i>, edited by Boris Shishkov, 391:276–86. Lecture
    Notes in Business Information Processing. Springer International Publishing, 2020.
    <a href="https://doi.org/10.1007/978-3-030-52306-0_18">https://doi.org/10.1007/978-3-030-52306-0_18</a>.
  ieee: S. Gottschalk, E. Yigitbas, and G. Engels, “Model-based Hypothesis Engineering
    for Supporting Adaptation to Uncertain Customer Needs,” in <i>Business Modeling
    and Software Design</i>, Potsdam, 2020, vol. 391, pp. 276–286.
  mla: Gottschalk, Sebastian, et al. “Model-Based Hypothesis Engineering for Supporting
    Adaptation to Uncertain Customer Needs.” <i>Business Modeling and Software Design</i>,
    edited by Boris Shishkov, vol. 391, Springer International Publishing, 2020, pp.
    276–86, doi:<a href="https://doi.org/10.1007/978-3-030-52306-0_18">10.1007/978-3-030-52306-0_18</a>.
  short: 'S. Gottschalk, E. Yigitbas, G. Engels, in: B. Shishkov (Ed.), Business Modeling
    and Software Design, Springer International Publishing, 2020, pp. 276–286.'
conference:
  end_date: 2020-07-08
  location: Potsdam
  name: '10th International Symposium on Business Modeling and Software Design '
  start_date: 2020-07-06
date_created: 2020-05-04T12:27:38Z
date_updated: 2022-01-06T06:52:59Z
ddc:
- '006'
department:
- _id: '66'
doi: 10.1007/978-3-030-52306-0_18
editor:
- first_name: Boris
  full_name: Shishkov, Boris
  last_name: Shishkov
file:
- access_level: open_access
  content_type: application/pdf
  creator: sego
  date_created: 2020-07-14T09:25:30Z
  date_updated: 2020-07-14T09:28:33Z
  file_id: '17380'
  file_name: BMSD20.pdf
  file_size: 267658
  relation: main_file
file_date_updated: 2020-07-14T09:28:33Z
has_accepted_license: '1'
intvolume: '       391'
keyword:
- Hypothesis Engineering
- Model-based
- Customer Need Adaptation
- Business Model
- Product Features
language:
- iso: eng
oa: '1'
page: 276-286
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '17'
  name: SFB 901 - Subproject C5
publication: Business Modeling and Software Design
publisher: Springer International Publishing
series_title: Lecture Notes in Business Information Processing
status: public
title: Model-based Hypothesis Engineering for Supporting Adaptation to Uncertain Customer
  Needs
type: conference
user_id: '47208'
volume: 391
year: '2020'
...
---
_id: '16968'
abstract:
- lang: eng
  text: "In this work, we initiate the research about the Gathering problem for robots\r\nwith
    limited viewing range in the three-dimensional Euclidean space. In the\r\nGathering
    problem, a set of initially scattered robots is required to gather at\r\nthe same
    position. The robots' capabilities are very restricted -- they do not\r\nagree
    on any coordinate system or compass, have a limited viewing range, have\r\nno
    memory of the past and cannot communicate. We study the problem in two\r\ndifferent
    time models, in FSYNC (fully synchronized discrete rounds) and the\r\ncontinuous
    time model. For FSYNC, we introduce the 3D-Go-To-The-Center-strategy\r\nand prove
    a runtime of $\\Theta(n^2)$ that matches the currently best runtime\r\nbound for
    the same model in the Euclidean plane [SPAA'11]. Our main result is\r\nthe generalization
    of contracting strategies (continuous time) from\r\n[Algosensors'17] to three
    dimensions. In contracting strategies, every robot\r\nthat is located on the global
    convex hull of all robots' positions moves with\r\nfull speed towards the inside
    of the convex hull. We prove a runtime bound of\r\n$O(\\Delta \\cdot n^{3/2})$
    for any three-dimensional contracting strategy, where\r\n$\\Delta$ denotes the
    diameter of the initial configuration. This comes up to a\r\nfactor of $\\sqrt{n}$
    close to the lower bound of $\\Omega (\\Delta \\cdot n)$\r\nwhich is already true
    in two dimensions. In general, it might be hard for\r\nrobots with limited viewing
    range to decide whether they are located on the\r\nglobal convex hull and which
    movement maintains the connectivity of the swarm,\r\nrendering the design of concrete
    contracting strategies a challenging task. We\r\nprove that the continuous variant
    of 3D-Go-To-The-Center is contracting and\r\nkeeps the swarm connected. Moreover,
    we give a simple design criterion for\r\nthree-dimensional contracting strategies
    that maintains the connectivity of the\r\nswarm and introduce an exemplary strategy
    based on this criterion."
- lang: eng
  text: Best Student Paper Award
author:
- first_name: Michael
  full_name: Braun, Michael
  last_name: Braun
- first_name: Jannik
  full_name: Castenow, Jannik
  id: '38705'
  last_name: Castenow
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: 'Braun M, Castenow J, Meyer auf der Heide F. Local Gathering of Mobile Robots
    in Three Dimensions. In: <i>Proceedings of the 27th Conference on Structural Information
    and Communication Complexity (SIROCCO)</i>. Springer; 2020. doi:<a href="https://doi.org/10.1007/978-3-030-54921-3_4">10.1007/978-3-030-54921-3_4</a>'
  apa: 'Braun, M., Castenow, J., &#38; Meyer auf der Heide, F. (2020). Local Gathering
    of Mobile Robots in Three Dimensions. In <i>Proceedings of the 27th Conference
    on Structural Information and Communication Complexity (SIROCCO)</i>. Paderborn:
    Springer. <a href="https://doi.org/10.1007/978-3-030-54921-3_4">https://doi.org/10.1007/978-3-030-54921-3_4</a>'
  bibtex: '@inproceedings{Braun_Castenow_Meyer auf der Heide_2020, title={Local Gathering
    of Mobile Robots in Three Dimensions}, DOI={<a href="https://doi.org/10.1007/978-3-030-54921-3_4">10.1007/978-3-030-54921-3_4</a>},
    booktitle={Proceedings of the 27th Conference on Structural Information and Communication
    Complexity (SIROCCO)}, publisher={Springer}, author={Braun, Michael and Castenow,
    Jannik and Meyer auf der Heide, Friedhelm}, year={2020} }'
  chicago: Braun, Michael, Jannik Castenow, and Friedhelm Meyer auf der Heide. “Local
    Gathering of Mobile Robots in Three Dimensions.” In <i>Proceedings of the 27th
    Conference on Structural Information and Communication Complexity (SIROCCO)</i>.
    Springer, 2020. <a href="https://doi.org/10.1007/978-3-030-54921-3_4">https://doi.org/10.1007/978-3-030-54921-3_4</a>.
  ieee: M. Braun, J. Castenow, and F. Meyer auf der Heide, “Local Gathering of Mobile
    Robots in Three Dimensions,” in <i>Proceedings of the 27th Conference on Structural
    Information and Communication Complexity (SIROCCO)</i>, Paderborn, 2020.
  mla: Braun, Michael, et al. “Local Gathering of Mobile Robots in Three Dimensions.”
    <i>Proceedings of the 27th Conference on Structural Information and Communication
    Complexity (SIROCCO)</i>, Springer, 2020, doi:<a href="https://doi.org/10.1007/978-3-030-54921-3_4">10.1007/978-3-030-54921-3_4</a>.
  short: 'M. Braun, J. Castenow, F. Meyer auf der Heide, in: Proceedings of the 27th
    Conference on Structural Information and Communication Complexity (SIROCCO), Springer,
    2020.'
conference:
  end_date: 2020-07-01
  location: Paderborn
  name: SIROCCO 2020
  start_date: 2020-06-29
date_created: 2020-05-18T06:48:35Z
date_updated: 2022-01-06T06:53:00Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/978-3-030-54921-3_4
external_id:
  arxiv:
  - arXiv:2005.07495
file:
- access_level: closed
  content_type: application/pdf
  creator: janniksu
  date_created: 2020-07-31T08:22:16Z
  date_updated: 2020-07-31T08:22:16Z
  file_id: '17504'
  file_name: localGathering.pdf
  file_size: 505712
  relation: main_file
  success: 1
file_date_updated: 2020-07-31T08:22:16Z
has_accepted_license: '1'
language:
- iso: eng
publication: Proceedings of the 27th Conference on Structural Information and Communication
  Complexity (SIROCCO)
publisher: Springer
status: public
title: Local Gathering of Mobile Robots in Three Dimensions
type: conference
user_id: '38705'
year: '2020'
...
---
_id: '17063'
author:
- first_name: Tim
  full_name: Hansmeier, Tim
  id: '49992'
  last_name: Hansmeier
  orcid: 0000-0003-1377-3339
- first_name: Paul
  full_name: Kaufmann, Paul
  last_name: Kaufmann
- first_name: Marco
  full_name: Platzner, Marco
  id: '398'
  last_name: Platzner
citation:
  ama: 'Hansmeier T, Kaufmann P, Platzner M. An Adaption Mechanism for the Error Threshold
    of XCSF. In: <i>GECCO ’20: Proceedings of the Genetic and Evolutionary Computation
    Conference Companion</i>. Association for Computing Machinery (ACM); 2020:1756-1764.
    doi:<a href="https://doi.org/10.1145/3377929.3398106">10.1145/3377929.3398106</a>'
  apa: 'Hansmeier, T., Kaufmann, P., &#38; Platzner, M. (2020). An Adaption Mechanism
    for the Error Threshold of XCSF. <i>GECCO ’20: Proceedings of the Genetic and
    Evolutionary Computation Conference Companion</i>, 1756–1764. <a href="https://doi.org/10.1145/3377929.3398106">https://doi.org/10.1145/3377929.3398106</a>'
  bibtex: '@inproceedings{Hansmeier_Kaufmann_Platzner_2020, place={New York, NY, United
    States}, title={An Adaption Mechanism for the Error Threshold of XCSF}, DOI={<a
    href="https://doi.org/10.1145/3377929.3398106">10.1145/3377929.3398106</a>}, booktitle={GECCO
    ’20: Proceedings of the Genetic and Evolutionary Computation Conference Companion},
    publisher={Association for Computing Machinery (ACM)}, author={Hansmeier, Tim
    and Kaufmann, Paul and Platzner, Marco}, year={2020}, pages={1756–1764} }'
  chicago: 'Hansmeier, Tim, Paul Kaufmann, and Marco Platzner. “An Adaption Mechanism
    for the Error Threshold of XCSF.” In <i>GECCO ’20: Proceedings of the Genetic
    and Evolutionary Computation Conference Companion</i>, 1756–64. New York, NY,
    United States: Association for Computing Machinery (ACM), 2020. <a href="https://doi.org/10.1145/3377929.3398106">https://doi.org/10.1145/3377929.3398106</a>.'
  ieee: 'T. Hansmeier, P. Kaufmann, and M. Platzner, “An Adaption Mechanism for the
    Error Threshold of XCSF,” in <i>GECCO ’20: Proceedings of the Genetic and Evolutionary
    Computation Conference Companion</i>, Cancún, Mexico, 2020, pp. 1756–1764, doi:
    <a href="https://doi.org/10.1145/3377929.3398106">10.1145/3377929.3398106</a>.'
  mla: 'Hansmeier, Tim, et al. “An Adaption Mechanism for the Error Threshold of XCSF.”
    <i>GECCO ’20: Proceedings of the Genetic and Evolutionary Computation Conference
    Companion</i>, Association for Computing Machinery (ACM), 2020, pp. 1756–64, doi:<a
    href="https://doi.org/10.1145/3377929.3398106">10.1145/3377929.3398106</a>.'
  short: 'T. Hansmeier, P. Kaufmann, M. Platzner, in: GECCO ’20: Proceedings of the
    Genetic and Evolutionary Computation Conference Companion, Association for Computing
    Machinery (ACM), New York, NY, United States, 2020, pp. 1756–1764.'
conference:
  end_date: 2020-07-12
  location: Cancún, Mexico
  name: International Workshop on Learning Classifier Systems (IWLCS 2020)
  start_date: 2020-07-08
date_created: 2020-05-27T14:14:58Z
date_updated: 2022-01-06T06:53:03Z
department:
- _id: '78'
doi: 10.1145/3377929.3398106
language:
- iso: eng
page: 1756-1764
place: New York, NY, United States
project:
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '1'
  name: SFB 901
- _id: '14'
  name: SFB 901 - Subproject C2
publication: 'GECCO ''20: Proceedings of the Genetic and Evolutionary Computation
  Conference Companion'
publication_identifier:
  isbn:
  - 978-1-4503-7127-8
publication_status: published
publisher: Association for Computing Machinery (ACM)
status: public
title: An Adaption Mechanism for the Error Threshold of XCSF
type: conference
user_id: '477'
year: '2020'
...
---
_id: '17082'
abstract:
- lang: eng
  text: Data-parallel applications run on cluster of servers in a datacenter and their
    communication triggers correlated resource demand on multiple links that can be
    abstracted as coflow. They often desire predictable network performance, which
    can be passed to network via coflow abstraction for application-aware network
    scheduling. In this paper, we propose a heuristic and an optimization algorithm
    for predictable network performance such that they guarantee coflows completion
    within their deadlines. The algorithms also ensure high network utilization, i.e.,
    it's work-conserving, and avoids starvation of coflows. We evaluate both algorithms
    via trace-driven simulation and show that they admit 1.1x more coflows than the
    Varys scheme while meeting their deadlines.
author:
- first_name: Asif
  full_name: Hasnain, Asif
  id: '63288'
  last_name: Hasnain
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  ama: 'Hasnain A, Karl H. Coflow Scheduling with Performance Guarantees for Data
    Center Applications. In: <i>2020 20th IEEE/ACM International Symposium on Cluster,
    Cloud and Internet Computing (CCGRID)</i>. IEEE Computer Society; 2020. doi:<a
    href="https://doi.org/10.1109/CCGrid49817.2020.00010">https://doi.org/10.1109/CCGrid49817.2020.00010</a>'
  apa: 'Hasnain, A., &#38; Karl, H. (2020). Coflow Scheduling with Performance Guarantees
    for Data Center Applications. In <i>2020 20th IEEE/ACM International Symposium
    on Cluster, Cloud and Internet Computing (CCGRID)</i>. Melbourne, Australia: IEEE
    Computer Society. <a href="https://doi.org/10.1109/CCGrid49817.2020.00010">https://doi.org/10.1109/CCGrid49817.2020.00010</a>'
  bibtex: '@inproceedings{Hasnain_Karl_2020, title={Coflow Scheduling with Performance
    Guarantees for Data Center Applications}, DOI={<a href="https://doi.org/10.1109/CCGrid49817.2020.00010">https://doi.org/10.1109/CCGrid49817.2020.00010</a>},
    booktitle={2020 20th IEEE/ACM International Symposium on Cluster, Cloud and Internet
    Computing (CCGRID)}, publisher={IEEE Computer Society}, author={Hasnain, Asif
    and Karl, Holger}, year={2020} }'
  chicago: Hasnain, Asif, and Holger Karl. “Coflow Scheduling with Performance Guarantees
    for Data Center Applications.” In <i>2020 20th IEEE/ACM International Symposium
    on Cluster, Cloud and Internet Computing (CCGRID)</i>. IEEE Computer Society,
    2020. <a href="https://doi.org/10.1109/CCGrid49817.2020.00010">https://doi.org/10.1109/CCGrid49817.2020.00010</a>.
  ieee: A. Hasnain and H. Karl, “Coflow Scheduling with Performance Guarantees for
    Data Center Applications,” in <i>2020 20th IEEE/ACM International Symposium on
    Cluster, Cloud and Internet Computing (CCGRID)</i>, Melbourne, Australia, 2020.
  mla: Hasnain, Asif, and Holger Karl. “Coflow Scheduling with Performance Guarantees
    for Data Center Applications.” <i>2020 20th IEEE/ACM International Symposium on
    Cluster, Cloud and Internet Computing (CCGRID)</i>, IEEE Computer Society, 2020,
    doi:<a href="https://doi.org/10.1109/CCGrid49817.2020.00010">https://doi.org/10.1109/CCGrid49817.2020.00010</a>.
  short: 'A. Hasnain, H. Karl, in: 2020 20th IEEE/ACM International Symposium on Cluster,
    Cloud and Internet Computing (CCGRID), IEEE Computer Society, 2020.'
conference:
  location: Melbourne, Australia
  name: 2020 20th IEEE/ACM International Symposium on Cluster, Cloud and Internet
    Computing (CCGRID)
date_created: 2020-06-06T07:40:45Z
date_updated: 2022-01-06T06:53:04Z
ddc:
- '000'
department:
- _id: '75'
doi: https://doi.org/10.1109/CCGrid49817.2020.00010
keyword:
- Coflow
- Scheduling
- Deadlines
- Data centers
language:
- iso: eng
main_file_link:
- url: https://ieeexplore.ieee.org/abstract/document/9139642
project:
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '16'
  name: SFB 901 - Subproject C4
- _id: '1'
  name: SFB 901
publication: 2020 20th IEEE/ACM International Symposium on Cluster, Cloud and Internet
  Computing (CCGRID)
publication_status: published
publisher: IEEE Computer Society
status: public
title: Coflow Scheduling with Performance Guarantees for Data Center Applications
type: conference
user_id: '63288'
year: '2020'
...
---
_id: '17084'
author:
- first_name: Nils
  full_name: Weidmann, Nils
  id: '53103'
  last_name: Weidmann
- first_name: Anthony
  full_name: Anjorin, Anthony
  last_name: Anjorin
citation:
  ama: 'Weidmann N, Anjorin A. Schema Compliant Consistency Management via Triple
    Graph Grammars and Integer Linear Programming. In: Wehrheim H, Cabot J, eds. <i>Proceedings
    of the 23rd International Conference on Fundamental Approaches to Software Engineering,
    FASE 2020</i>. Cham: Springer; 2020. doi:<a href="https://doi.org/10.1007/978-3-030-45234-6_16">10.1007/978-3-030-45234-6_16</a>'
  apa: 'Weidmann, N., &#38; Anjorin, A. (2020). Schema Compliant Consistency Management
    via Triple Graph Grammars and Integer Linear Programming. In H. Wehrheim &#38;
    J. Cabot (Eds.), <i>Proceedings of the 23rd International Conference on Fundamental
    Approaches to Software Engineering, FASE 2020</i>. Cham: Springer. <a href="https://doi.org/10.1007/978-3-030-45234-6_16">https://doi.org/10.1007/978-3-030-45234-6_16</a>'
  bibtex: '@inproceedings{Weidmann_Anjorin_2020, place={Cham}, title={Schema Compliant
    Consistency Management via Triple Graph Grammars and Integer Linear Programming},
    DOI={<a href="https://doi.org/10.1007/978-3-030-45234-6_16">10.1007/978-3-030-45234-6_16</a>},
    booktitle={Proceedings of the 23rd International Conference on Fundamental Approaches
    to Software Engineering, FASE 2020}, publisher={Springer}, author={Weidmann, Nils
    and Anjorin, Anthony}, editor={Wehrheim, Heike and Cabot, JordiEditors}, year={2020}
    }'
  chicago: 'Weidmann, Nils, and Anthony Anjorin. “Schema Compliant Consistency Management
    via Triple Graph Grammars and Integer Linear Programming.” In <i>Proceedings of
    the 23rd International Conference on Fundamental Approaches to Software Engineering,
    FASE 2020</i>, edited by Heike Wehrheim and Jordi Cabot. Cham: Springer, 2020.
    <a href="https://doi.org/10.1007/978-3-030-45234-6_16">https://doi.org/10.1007/978-3-030-45234-6_16</a>.'
  ieee: N. Weidmann and A. Anjorin, “Schema Compliant Consistency Management via Triple
    Graph Grammars and Integer Linear Programming,” in <i>Proceedings of the 23rd
    International Conference on Fundamental Approaches to Software Engineering, FASE
    2020</i>, Dublin, Ireland, 2020.
  mla: Weidmann, Nils, and Anthony Anjorin. “Schema Compliant Consistency Management
    via Triple Graph Grammars and Integer Linear Programming.” <i>Proceedings of the
    23rd International Conference on Fundamental Approaches to Software Engineering,
    FASE 2020</i>, edited by Heike Wehrheim and Jordi Cabot, Springer, 2020, doi:<a
    href="https://doi.org/10.1007/978-3-030-45234-6_16">10.1007/978-3-030-45234-6_16</a>.
  short: 'N. Weidmann, A. Anjorin, in: H. Wehrheim, J. Cabot (Eds.), Proceedings of
    the 23rd International Conference on Fundamental Approaches to Software Engineering,
    FASE 2020, Springer, Cham, 2020.'
conference:
  end_date: 2020-04-30
  location: Dublin, Ireland
  name: Fundamental Approaches to Software Engineering - 23rd International Conference,
    FASE 2020
  start_date: 2020-04-25
date_created: 2020-06-06T09:50:42Z
date_updated: 2022-01-06T06:53:04Z
department:
- _id: '28'
- _id: '66'
- _id: '534'
doi: 10.1007/978-3-030-45234-6_16
editor:
- first_name: Heike
  full_name: Wehrheim, Heike
  last_name: Wehrheim
- first_name: Jordi
  full_name: Cabot, Jordi
  last_name: Cabot
language:
- iso: eng
place: Cham
publication: Proceedings of the 23rd International Conference on Fundamental Approaches
  to Software Engineering, FASE 2020
publication_identifier:
  isbn:
  - '9783030452339'
  - '9783030452346'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer
status: public
title: Schema Compliant Consistency Management via Triple Graph Grammars and Integer
  Linear Programming
type: conference
user_id: '53103'
year: '2020'
...
---
_id: '17092'
abstract:
- lang: eng
  text: <jats:p>Radiation tolerance in FPGAs is an important field of research particularly
    for reliable computation in electronics used in aerospace and satellite missions.
    The motivation behind this research is the degradation of reliability in FPGA
    hardware due to single-event effects caused by radiation particles. Redundancy
    is a commonly used technique to enhance the fault-tolerance capability of radiation-sensitive
    applications. However, redundancy comes with an overhead in terms of excessive
    area consumption, latency, and power dissipation. Moreover, the redundant circuit
    implementations vary in structure and resource usage with the redundancy insertion
    algorithms as well as number of used redundant stages. The radiation environment
    varies during the operation time span of the mission depending on the orbit and
    space weather conditions. Therefore, the overheads due to redundancy should also
    be optimized at run-time with respect to the current radiation level. In this
    paper, we propose a technique called Dynamic Reliability Management (DRM) that
    utilizes the radiation data, interprets it, selects a suitable redundancy level,
    and performs the run-time reconfiguration, thus varying the reliability levels
    of the target computation modules. DRM is composed of two parts. The design-time
    tool flow of DRM generates a library of various redundant implementations of the
    circuit with different magnitudes of performance factors. The run-time tool flow,
    while utilizing the radiation/error-rate data, selects a required redundancy level
    and reconfigures the computation module with the corresponding redundant implementation.
    Both parts of DRM have been verified by experimentation on various benchmarks.
    The most significant finding we have from this experimentation is that the performance
    can be scaled multiple times by using partial reconfiguration feature of DRM,
    e.g., 7.7 and 3.7 times better performance results obtained for our data sorter
    and matrix multiplier case studies compared with static reliability management
    techniques. Therefore, DRM allows for maintaining a suitable trade-off between
    computation reliability and performance overhead during run-time of an application.</jats:p>
author:
- first_name: Jahanzeb
  full_name: Anwer, Jahanzeb
  last_name: Anwer
- first_name: Sebastian
  full_name: Meisner, Sebastian
  last_name: Meisner
- first_name: Marco
  full_name: Platzner, Marco
  id: '398'
  last_name: Platzner
citation:
  ama: Anwer J, Meisner S, Platzner M. Dynamic Reliability Management for FPGA-Based
    Systems. <i>International Journal of Reconfigurable Computing</i>. 2020:1-19.
    doi:<a href="https://doi.org/10.1155/2020/2808710">10.1155/2020/2808710</a>
  apa: Anwer, J., Meisner, S., &#38; Platzner, M. (2020). Dynamic Reliability Management
    for FPGA-Based Systems. <i>International Journal of Reconfigurable Computing</i>,
    1–19. <a href="https://doi.org/10.1155/2020/2808710">https://doi.org/10.1155/2020/2808710</a>
  bibtex: '@article{Anwer_Meisner_Platzner_2020, title={Dynamic Reliability Management
    for FPGA-Based Systems}, DOI={<a href="https://doi.org/10.1155/2020/2808710">10.1155/2020/2808710</a>},
    journal={International Journal of Reconfigurable Computing}, author={Anwer, Jahanzeb
    and Meisner, Sebastian and Platzner, Marco}, year={2020}, pages={1–19} }'
  chicago: Anwer, Jahanzeb, Sebastian Meisner, and Marco Platzner. “Dynamic Reliability
    Management for FPGA-Based Systems.” <i>International Journal of Reconfigurable
    Computing</i>, 2020, 1–19. <a href="https://doi.org/10.1155/2020/2808710">https://doi.org/10.1155/2020/2808710</a>.
  ieee: J. Anwer, S. Meisner, and M. Platzner, “Dynamic Reliability Management for
    FPGA-Based Systems,” <i>International Journal of Reconfigurable Computing</i>,
    pp. 1–19, 2020.
  mla: Anwer, Jahanzeb, et al. “Dynamic Reliability Management for FPGA-Based Systems.”
    <i>International Journal of Reconfigurable Computing</i>, 2020, pp. 1–19, doi:<a
    href="https://doi.org/10.1155/2020/2808710">10.1155/2020/2808710</a>.
  short: J. Anwer, S. Meisner, M. Platzner, International Journal of Reconfigurable
    Computing (2020) 1–19.
date_created: 2020-06-15T11:25:07Z
date_updated: 2022-01-06T06:53:04Z
department:
- _id: '78'
doi: 10.1155/2020/2808710
language:
- iso: eng
page: 1-19
publication: International Journal of Reconfigurable Computing
publication_identifier:
  issn:
  - 1687-7195
  - 1687-7209
publication_status: published
status: public
title: Dynamic Reliability Management for FPGA-Based Systems
type: journal_article
user_id: '398'
year: '2020'
...
---
_id: '10790'
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
- first_name: Daniel
  full_name: Kuntze, Daniel
  last_name: Kuntze
citation:
  ama: Blömer J, Brauer S, Bujna K, Kuntze D. How well do SEM algorithms imitate EM
    algorithms? A non-asymptotic analysis for mixture models. <i>Advances in Data
    Analysis and Classification</i>. 2020;14:147–173. doi:<a href="https://doi.org/10.1007/s11634-019-00366-7">10.1007/s11634-019-00366-7</a>
  apa: Blömer, J., Brauer, S., Bujna, K., &#38; Kuntze, D. (2020). How well do SEM
    algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models.
    <i>Advances in Data Analysis and Classification</i>, <i>14</i>, 147–173. <a href="https://doi.org/10.1007/s11634-019-00366-7">https://doi.org/10.1007/s11634-019-00366-7</a>
  bibtex: '@article{Blömer_Brauer_Bujna_Kuntze_2020, title={How well do SEM algorithms
    imitate EM algorithms? A non-asymptotic analysis for mixture models}, volume={14},
    DOI={<a href="https://doi.org/10.1007/s11634-019-00366-7">10.1007/s11634-019-00366-7</a>},
    journal={Advances in Data Analysis and Classification}, author={Blömer, Johannes
    and Brauer, Sascha and Bujna, Kathrin and Kuntze, Daniel}, year={2020}, pages={147–173}
    }'
  chicago: 'Blömer, Johannes, Sascha Brauer, Kathrin Bujna, and Daniel Kuntze. “How
    Well Do SEM Algorithms Imitate EM Algorithms? A Non-Asymptotic Analysis for Mixture
    Models.” <i>Advances in Data Analysis and Classification</i> 14 (2020): 147–173.
    <a href="https://doi.org/10.1007/s11634-019-00366-7">https://doi.org/10.1007/s11634-019-00366-7</a>.'
  ieee: J. Blömer, S. Brauer, K. Bujna, and D. Kuntze, “How well do SEM algorithms
    imitate EM algorithms? A non-asymptotic analysis for mixture models,” <i>Advances
    in Data Analysis and Classification</i>, vol. 14, pp. 147–173, 2020.
  mla: Blömer, Johannes, et al. “How Well Do SEM Algorithms Imitate EM Algorithms?
    A Non-Asymptotic Analysis for Mixture Models.” <i>Advances in Data Analysis and
    Classification</i>, vol. 14, 2020, pp. 147–173, doi:<a href="https://doi.org/10.1007/s11634-019-00366-7">10.1007/s11634-019-00366-7</a>.
  short: J. Blömer, S. Brauer, K. Bujna, D. Kuntze, Advances in Data Analysis and
    Classification 14 (2020) 147–173.
date_created: 2019-07-11T08:08:25Z
date_updated: 2022-01-06T06:50:50Z
department:
- _id: '64'
doi: 10.1007/s11634-019-00366-7
intvolume: '        14'
language:
- iso: eng
page: 147–173
project:
- _id: '45'
  name: Soft-Clustering - Von Heuristiken zu Approximationsalgorithmen
publication: Advances in Data Analysis and Classification
publication_identifier:
  issn:
  - 1862-5347
  - 1862-5355
publication_status: published
status: public
title: How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis
  for mixture models
type: journal_article
user_id: '13291'
volume: 14
year: '2020'
...
---
_id: '15482'
author:
- first_name: Nils
  full_name: Löken, Nils
  id: '13703'
  last_name: Löken
citation:
  ama: Löken N. <i>Cryptography for the Crowd — A Study of Cryptographic Schemes with
    Applications to Crowd Work</i>.; 2020. doi:<a href="https://doi.org/10.17619/UNIPB/1-854">10.17619/UNIPB/1-854</a>
  apa: Löken, N. (2020). <i>Cryptography for the Crowd — A Study of Cryptographic
    Schemes with Applications to Crowd Work</i>. <a href="https://doi.org/10.17619/UNIPB/1-854">https://doi.org/10.17619/UNIPB/1-854</a>
  bibtex: '@book{Löken_2020, title={Cryptography for the Crowd — A Study of Cryptographic
    Schemes with Applications to Crowd Work}, DOI={<a href="https://doi.org/10.17619/UNIPB/1-854">10.17619/UNIPB/1-854</a>},
    author={Löken, Nils}, year={2020} }'
  chicago: Löken, Nils. <i>Cryptography for the Crowd — A Study of Cryptographic Schemes
    with Applications to Crowd Work</i>, 2020. <a href="https://doi.org/10.17619/UNIPB/1-854">https://doi.org/10.17619/UNIPB/1-854</a>.
  ieee: N. Löken, <i>Cryptography for the Crowd — A Study of Cryptographic Schemes
    with Applications to Crowd Work</i>. 2020.
  mla: Löken, Nils. <i>Cryptography for the Crowd — A Study of Cryptographic Schemes
    with Applications to Crowd Work</i>. 2020, doi:<a href="https://doi.org/10.17619/UNIPB/1-854">10.17619/UNIPB/1-854</a>.
  short: N. Löken, Cryptography for the Crowd — A Study of Cryptographic Schemes with
    Applications to Crowd Work, 2020.
date_created: 2020-01-10T08:23:30Z
date_updated: 2022-01-06T06:52:27Z
department:
- _id: '64'
- _id: '568'
doi: 10.17619/UNIPB/1-854
language:
- iso: eng
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Cryptography for the Crowd — A Study of Cryptographic Schemes with Applications
  to Crowd Work
type: dissertation
user_id: '13703'
year: '2020'
...