---
_id: '3872'
abstract:
- lang: eng
text: 'This paper considers the problem of how to efficiently share a wireless medium
which is subject to harsh external interference or even jamming. So far, this
problem is understood only in simplistic single-hop or unit disk graph models.
We in this paper initiate the study of MAC protocols for the SINR interference
model (a.k.a. physical model). This paper makes two contributions. First, we introduce
a new adversarial SINR model which captures a wide range of interference phenomena.
Concretely, we consider a powerful, adaptive adversary which can jam nodes at
arbitrary times and which is only limited by some energy budget. Our second contribution
is a distributed MAC protocol called Sade which provably achieves a constant competitive
throughput in this environment: we show that, with high probability, the protocol
ensures that a constant fraction of the non-blocked time periods is used for successful
transmissions.'
author:
- first_name: Adrian
full_name: Ogierman, Adrian
last_name: Ogierman
- first_name: Andrea
full_name: Richa, Andrea
last_name: Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: Jin
full_name: Zhang, Jin
last_name: Zhang
citation:
ama: 'Ogierman A, Richa A, Scheideler C, Schmid S, Zhang J. Sade: competitive MAC
under adversarial SINR. Distributed Computing. 2017;31(3):241-254. doi:10.1007/s00446-017-0307-1'
apa: 'Ogierman, A., Richa, A., Scheideler, C., Schmid, S., & Zhang, J. (2017).
Sade: competitive MAC under adversarial SINR. Distributed Computing, 31(3),
241–254. https://doi.org/10.1007/s00446-017-0307-1'
bibtex: '@article{Ogierman_Richa_Scheideler_Schmid_Zhang_2017, title={Sade: competitive
MAC under adversarial SINR}, volume={31}, DOI={10.1007/s00446-017-0307-1},
number={3}, journal={Distributed Computing}, publisher={Springer Nature}, author={Ogierman,
Adrian and Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang,
Jin}, year={2017}, pages={241–254} }'
chicago: 'Ogierman, Adrian, Andrea Richa, Christian Scheideler, Stefan Schmid, and
Jin Zhang. “Sade: Competitive MAC under Adversarial SINR.” Distributed Computing
31, no. 3 (2017): 241–54. https://doi.org/10.1007/s00446-017-0307-1.'
ieee: 'A. Ogierman, A. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Sade: competitive
MAC under adversarial SINR,” Distributed Computing, vol. 31, no. 3, pp.
241–254, 2017.'
mla: 'Ogierman, Adrian, et al. “Sade: Competitive MAC under Adversarial SINR.” Distributed
Computing, vol. 31, no. 3, Springer Nature, 2017, pp. 241–54, doi:10.1007/s00446-017-0307-1.'
short: A. Ogierman, A. Richa, C. Scheideler, S. Schmid, J. Zhang, Distributed Computing
31 (2017) 241–254.
date_created: 2018-08-10T07:05:12Z
date_updated: 2022-01-06T06:59:47Z
department:
- _id: '79'
doi: 10.1007/s00446-017-0307-1
intvolume: ' 31'
issue: '3'
page: 241-254
publication: Distributed Computing
publication_identifier:
issn:
- 0178-2770
- 1432-0452
publication_status: published
publisher: Springer Nature
status: public
title: 'Sade: competitive MAC under adversarial SINR'
type: journal_article
user_id: '15504'
volume: 31
year: '2017'
...
---
_id: '3881'
author:
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
- first_name: Nona
full_name: Naderi, Nona
last_name: Naderi
- first_name: Yufang
full_name: Hou, Yufang
last_name: Hou
- first_name: Yonatan
full_name: Bilu, Yonatan
last_name: Bilu
- first_name: Vinodkumar
full_name: Prabhakaran, Vinodkumar
last_name: Prabhakaran
- first_name: Tim Alberdingk
full_name: Thijm, Tim Alberdingk
last_name: Thijm
- first_name: Graeme
full_name: Hirst, Graeme
last_name: Hirst
- first_name: Benno
full_name: Stein, Benno
last_name: Stein
citation:
ama: 'Wachsmuth H, Naderi N, Hou Y, et al. Computational Argumentation Quality Assessment
in Natural Language. In: Proceedings of the 15th Conference of the European
Chapter of the Association for Computational Linguistics: Volume 1, Long Papers.
; 2017:176-187.'
apa: 'Wachsmuth, H., Naderi, N., Hou, Y., Bilu, Y., Prabhakaran, V., Thijm, T. A.,
… Stein, B. (2017). Computational Argumentation Quality Assessment in Natural
Language. In Proceedings of the 15th Conference of the European Chapter of
the Association for Computational Linguistics: Volume 1, Long Papers (pp.
176–187).'
bibtex: '@inproceedings{Wachsmuth_Naderi_Hou_Bilu_Prabhakaran_Thijm_Hirst_Stein_2017,
title={Computational Argumentation Quality Assessment in Natural Language}, booktitle={Proceedings
of the 15th Conference of the European Chapter of the Association for Computational
Linguistics: Volume 1, Long Papers}, author={Wachsmuth, Henning and Naderi, Nona
and Hou, Yufang and Bilu, Yonatan and Prabhakaran, Vinodkumar and Thijm, Tim Alberdingk
and Hirst, Graeme and Stein, Benno}, year={2017}, pages={176–187} }'
chicago: 'Wachsmuth, Henning, Nona Naderi, Yufang Hou, Yonatan Bilu, Vinodkumar
Prabhakaran, Tim Alberdingk Thijm, Graeme Hirst, and Benno Stein. “Computational
Argumentation Quality Assessment in Natural Language.” In Proceedings of the
15th Conference of the European Chapter of the Association for Computational Linguistics:
Volume 1, Long Papers, 176–87, 2017.'
ieee: 'H. Wachsmuth et al., “Computational Argumentation Quality Assessment
in Natural Language,” in Proceedings of the 15th Conference of the European
Chapter of the Association for Computational Linguistics: Volume 1, Long Papers,
2017, pp. 176–187.'
mla: 'Wachsmuth, Henning, et al. “Computational Argumentation Quality Assessment
in Natural Language.” Proceedings of the 15th Conference of the European Chapter
of the Association for Computational Linguistics: Volume 1, Long Papers, 2017,
pp. 176–87.'
short: 'H. Wachsmuth, N. Naderi, Y. Hou, Y. Bilu, V. Prabhakaran, T.A. Thijm, G.
Hirst, B. Stein, in: Proceedings of the 15th Conference of the European Chapter
of the Association for Computational Linguistics: Volume 1, Long Papers, 2017,
pp. 176–187.'
date_created: 2018-08-11T16:17:16Z
date_updated: 2022-01-06T06:59:47Z
department:
- _id: '600'
- _id: '568'
language:
- iso: eng
main_file_link:
- url: https://www.aclweb.org/anthology/E17-1017.pdf
page: 176-187
publication: 'Proceedings of the 15th Conference of the European Chapter of the Association
for Computational Linguistics: Volume 1, Long Papers'
status: public
title: Computational Argumentation Quality Assessment in Natural Language
type: conference
user_id: '82920'
year: '2017'
...
---
_id: '3882'
author:
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
- first_name: Benno
full_name: Stein, Benno
last_name: Stein
citation:
ama: 'Wachsmuth H, Stein B. A Universal Model for Discourse-Level Argumentation
Analysis. Special Section of the ACM Transactions on Internet Technology: Argumentation
in Social Media. 2017;(3):1-24.'
apa: 'Wachsmuth, H., & Stein, B. (2017). A Universal Model for Discourse-Level
Argumentation Analysis. Special Section of the ACM Transactions on Internet
Technology: Argumentation in Social Media, (3), 1–24.'
bibtex: '@article{Wachsmuth_Stein_2017, title={A Universal Model for Discourse-Level
Argumentation Analysis}, number={3}, journal={Special Section of the ACM Transactions
on Internet Technology: Argumentation in Social Media}, author={Wachsmuth, Henning
and Stein, Benno}, year={2017}, pages={1–24} }'
chicago: 'Wachsmuth, Henning, and Benno Stein. “A Universal Model for Discourse-Level
Argumentation Analysis.” Special Section of the ACM Transactions on Internet
Technology: Argumentation in Social Media, no. 3 (2017): 1–24.'
ieee: 'H. Wachsmuth and B. Stein, “A Universal Model for Discourse-Level Argumentation
Analysis,” Special Section of the ACM Transactions on Internet Technology:
Argumentation in Social Media, no. 3, pp. 1–24, 2017.'
mla: 'Wachsmuth, Henning, and Benno Stein. “A Universal Model for Discourse-Level
Argumentation Analysis.” Special Section of the ACM Transactions on Internet
Technology: Argumentation in Social Media, no. 3, 2017, pp. 1–24.'
short: 'H. Wachsmuth, B. Stein, Special Section of the ACM Transactions on Internet
Technology: Argumentation in Social Media (2017) 1–24.'
date_created: 2018-08-11T16:18:03Z
date_updated: 2022-01-06T06:59:47Z
department:
- _id: '568'
- _id: '600'
issue: '3'
language:
- iso: eng
main_file_link:
- url: https://dl.acm.org/doi/pdf/10.1145/2957757
page: 1-24
publication: 'Special Section of the ACM Transactions on Internet Technology: Argumentation
in Social Media'
publication_identifier:
issn:
- 1533-5399
status: public
title: A Universal Model for Discourse-Level Argumentation Analysis
type: journal_article
user_id: '82920'
year: '2017'
...
---
_id: '3883'
author:
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
- first_name: Nona
full_name: Naderi, Nona
last_name: Naderi
- first_name: Ivan
full_name: Habernal, Ivan
last_name: Habernal
- first_name: Yufang
full_name: Hou, Yufang
last_name: Hou
- first_name: Graeme
full_name: Hirst, Graeme
last_name: Hirst
- first_name: Iryna
full_name: Gurevych, Iryna
last_name: Gurevych
- first_name: Benno
full_name: Stein, Benno
last_name: Stein
citation:
ama: 'Wachsmuth H, Naderi N, Habernal I, et al. Argumentation Quality Assessment:
Theory vs. Practice. In: Proceedings of the 55th Annual Meeting of the Association
for Computational Linguistics (Volume 2: Short Papers). ; 2017:250-255. doi:10.18653/v1/P17-2039'
apa: 'Wachsmuth, H., Naderi, N., Habernal, I., Hou, Y., Hirst, G., Gurevych, I.,
& Stein, B. (2017). Argumentation Quality Assessment: Theory vs. Practice.
In Proceedings of the 55th Annual Meeting of the Association for Computational
Linguistics (Volume 2: Short Papers) (pp. 250–255). https://doi.org/10.18653/v1/P17-2039'
bibtex: '@inproceedings{Wachsmuth_Naderi_Habernal_Hou_Hirst_Gurevych_Stein_2017,
title={Argumentation Quality Assessment: Theory vs. Practice}, DOI={10.18653/v1/P17-2039},
booktitle={Proceedings of the 55th Annual Meeting of the Association for Computational
Linguistics (Volume 2: Short Papers)}, author={Wachsmuth, Henning and Naderi,
Nona and Habernal, Ivan and Hou, Yufang and Hirst, Graeme and Gurevych, Iryna
and Stein, Benno}, year={2017}, pages={250–255} }'
chicago: 'Wachsmuth, Henning, Nona Naderi, Ivan Habernal, Yufang Hou, Graeme Hirst,
Iryna Gurevych, and Benno Stein. “Argumentation Quality Assessment: Theory vs.
Practice.” In Proceedings of the 55th Annual Meeting of the Association for
Computational Linguistics (Volume 2: Short Papers), 250–55, 2017. https://doi.org/10.18653/v1/P17-2039.'
ieee: 'H. Wachsmuth et al., “Argumentation Quality Assessment: Theory vs.
Practice,” in Proceedings of the 55th Annual Meeting of the Association for
Computational Linguistics (Volume 2: Short Papers), 2017, pp. 250–255.'
mla: 'Wachsmuth, Henning, et al. “Argumentation Quality Assessment: Theory vs. Practice.”
Proceedings of the 55th Annual Meeting of the Association for Computational
Linguistics (Volume 2: Short Papers), 2017, pp. 250–55, doi:10.18653/v1/P17-2039.'
short: 'H. Wachsmuth, N. Naderi, I. Habernal, Y. Hou, G. Hirst, I. Gurevych, B.
Stein, in: Proceedings of the 55th Annual Meeting of the Association for Computational
Linguistics (Volume 2: Short Papers), 2017, pp. 250–255.'
date_created: 2018-08-11T16:18:38Z
date_updated: 2022-01-06T06:59:47Z
department:
- _id: '568'
- _id: '600'
doi: 10.18653/v1/P17-2039
language:
- iso: eng
main_file_link:
- url: https://www.aclweb.org/anthology/P17-2039.pdf
page: 250-255
publication: 'Proceedings of the 55th Annual Meeting of the Association for Computational
Linguistics (Volume 2: Short Papers)'
status: public
title: 'Argumentation Quality Assessment: Theory vs. Practice'
type: conference
user_id: '82920'
year: '2017'
...
---
_id: '3904'
author:
- first_name: Matthias
full_name: Hagen, Matthias
last_name: Hagen
- first_name: Johannes
full_name: Kiesel, Johannes
last_name: Kiesel
- first_name: Milad
full_name: Alshomary, Milad
id: '73059'
last_name: Alshomary
- first_name: Benno
full_name: Stein, Benno
last_name: Stein
citation:
ama: 'Hagen M, Kiesel J, Alshomary M, Stein B. Webis at the CLEF 2017 Dynamic Search
Lab. In: Working Notes of CLEF 2017 - Conference and Labs of the Evaluation
Forum. ; 2017.'
apa: Hagen, M., Kiesel, J., Alshomary, M., & Stein, B. (2017). Webis at the
CLEF 2017 Dynamic Search Lab. In Working Notes of CLEF 2017 - Conference and
Labs of the Evaluation Forum.
bibtex: '@inproceedings{Hagen_Kiesel_Alshomary_Stein_2017, title={Webis at the CLEF
2017 Dynamic Search Lab}, booktitle={Working Notes of CLEF 2017 - Conference and
Labs of the Evaluation Forum}, author={Hagen, Matthias and Kiesel, Johannes and
Alshomary, Milad and Stein, Benno}, year={2017} }'
chicago: Hagen, Matthias, Johannes Kiesel, Milad Alshomary, and Benno Stein. “Webis
at the CLEF 2017 Dynamic Search Lab.” In Working Notes of CLEF 2017 - Conference
and Labs of the Evaluation Forum, 2017.
ieee: M. Hagen, J. Kiesel, M. Alshomary, and B. Stein, “Webis at the CLEF 2017 Dynamic
Search Lab,” in Working Notes of CLEF 2017 - Conference and Labs of the Evaluation
Forum, 2017.
mla: Hagen, Matthias, et al. “Webis at the CLEF 2017 Dynamic Search Lab.” Working
Notes of CLEF 2017 - Conference and Labs of the Evaluation Forum, 2017.
short: 'M. Hagen, J. Kiesel, M. Alshomary, B. Stein, in: Working Notes of CLEF 2017
- Conference and Labs of the Evaluation Forum, 2017.'
date_created: 2018-08-14T13:28:44Z
date_updated: 2022-01-06T06:59:54Z
department:
- _id: '600'
language:
- iso: eng
main_file_link:
- url: http://ceur-ws.org/Vol-1866/paper_198.pdf
publication: Working Notes of CLEF 2017 - Conference and Labs of the Evaluation Forum
status: public
title: Webis at the CLEF 2017 Dynamic Search Lab
type: conference
user_id: '73059'
year: '2017'
...
---
_id: '2908'
author:
- first_name: Kathrin
full_name: Bujna, Kathrin
last_name: Bujna
citation:
ama: Bujna K. Soft Clustering Algorithms - Theoretical and Practical Improvements.
Universität Paderborn; 2017. doi:10.17619/UNIPB/1-226
apa: Bujna, K. (2017). Soft Clustering Algorithms - Theoretical and Practical
Improvements. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-226
bibtex: '@book{Bujna_2017, title={Soft Clustering Algorithms - Theoretical and Practical
Improvements}, DOI={10.17619/UNIPB/1-226},
publisher={Universität Paderborn}, author={Bujna, Kathrin}, year={2017} }'
chicago: Bujna, Kathrin. Soft Clustering Algorithms - Theoretical and Practical
Improvements. Universität Paderborn, 2017. https://doi.org/10.17619/UNIPB/1-226.
ieee: K. Bujna, Soft Clustering Algorithms - Theoretical and Practical Improvements.
Universität Paderborn, 2017.
mla: Bujna, Kathrin. Soft Clustering Algorithms - Theoretical and Practical Improvements.
Universität Paderborn, 2017, doi:10.17619/UNIPB/1-226.
short: K. Bujna, Soft Clustering Algorithms - Theoretical and Practical Improvements,
Universität Paderborn, 2017.
date_created: 2018-05-25T10:02:30Z
date_updated: 2022-01-06T06:58:46Z
department:
- _id: '64'
doi: 10.17619/UNIPB/1-226
main_file_link:
- url: http://nbn-resolving.de/urn:nbn:de:hbz:466:2-29759
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Soft Clustering Algorithms - Theoretical and Practical Improvements
type: dissertation
user_id: '25078'
year: '2017'
...
---
_id: '2967'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Gennadij
full_name: Liske, Gennadij
last_name: Liske
citation:
ama: 'Blömer J, Liske G. Subtleties in Security Definitions for Predicate Encryption
with Public Index. In: Proceedings of the International Conference of Mathematical
Aspects of Computer and Information Sciences (MACIS). Vol 10693. Lecture Notes
in Computer Science. Cham: Springer International Publishing; 2017:438-453. doi:10.1007/978-3-319-72453-9_35'
apa: 'Blömer, J., & Liske, G. (2017). Subtleties in Security Definitions for
Predicate Encryption with Public Index. In Proceedings of the International
Conference of Mathematical Aspects of Computer and Information Sciences (MACIS)
(Vol. 10693, pp. 438–453). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-72453-9_35'
bibtex: '@inproceedings{Blömer_Liske_2017, place={Cham}, series={Lecture Notes in
Computer Science}, title={Subtleties in Security Definitions for Predicate Encryption
with Public Index}, volume={10693}, DOI={10.1007/978-3-319-72453-9_35},
booktitle={Proceedings of the International Conference of Mathematical Aspects
of Computer and Information Sciences (MACIS)}, publisher={Springer International
Publishing}, author={Blömer, Johannes and Liske, Gennadij}, year={2017}, pages={438–453},
collection={Lecture Notes in Computer Science} }'
chicago: 'Blömer, Johannes, and Gennadij Liske. “Subtleties in Security Definitions
for Predicate Encryption with Public Index.” In Proceedings of the International
Conference of Mathematical Aspects of Computer and Information Sciences (MACIS),
10693:438–53. Lecture Notes in Computer Science. Cham: Springer International
Publishing, 2017. https://doi.org/10.1007/978-3-319-72453-9_35.'
ieee: J. Blömer and G. Liske, “Subtleties in Security Definitions for Predicate
Encryption with Public Index,” in Proceedings of the International Conference
of Mathematical Aspects of Computer and Information Sciences (MACIS), 2017,
vol. 10693, pp. 438–453.
mla: Blömer, Johannes, and Gennadij Liske. “Subtleties in Security Definitions for
Predicate Encryption with Public Index.” Proceedings of the International Conference
of Mathematical Aspects of Computer and Information Sciences (MACIS), vol.
10693, Springer International Publishing, 2017, pp. 438–53, doi:10.1007/978-3-319-72453-9_35.
short: 'J. Blömer, G. Liske, in: Proceedings of the International Conference of
Mathematical Aspects of Computer and Information Sciences (MACIS), Springer International
Publishing, Cham, 2017, pp. 438–453.'
date_created: 2018-06-04T12:17:48Z
date_updated: 2022-01-06T06:58:49Z
ddc:
- '000'
department:
- _id: '64'
doi: 10.1007/978-3-319-72453-9_35
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:52:10Z
date_updated: 2018-11-02T14:52:10Z
file_id: '5286'
file_name: SubtletiesInSecurityDefinition.pdf
file_size: 463904
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:52:10Z
has_accepted_license: '1'
intvolume: ' 10693'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2017/453.pdf
oa: '1'
page: 438-453
place: Cham
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 International Conference of Mathematical Aspects of
Computer and Information Sciences (MACIS)
publication_identifier:
isbn:
- '9783319724522'
- '9783319724539'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
series_title: Lecture Notes in Computer Science
status: public
title: Subtleties in Security Definitions for Predicate Encryption with Public Index
type: conference
user_id: '477'
volume: 10693
year: '2017'
...
---
_id: '3108'
author:
- first_name: Tibor
full_name: Jager, Tibor
id: '64669'
last_name: Jager
- first_name: Florian
full_name: Kohlar, Florian
last_name: Kohlar
- first_name: Sven
full_name: Schäge, Sven
last_name: Schäge
- first_name: Jörg
full_name: Schwenk, Jörg
last_name: Schwenk
citation:
ama: Jager T, Kohlar F, Schäge S, Schwenk J. Authenticated Confidential Channel
Establishment and the Security of TLS-DHE. J Cryptology. 2017;(4):1276--1324.
doi:10.1007/s00145-016-9248-2
apa: Jager, T., Kohlar, F., Schäge, S., & Schwenk, J. (2017). Authenticated
Confidential Channel Establishment and the Security of TLS-DHE. J. Cryptology,
(4), 1276--1324. https://doi.org/10.1007/s00145-016-9248-2
bibtex: '@article{Jager_Kohlar_Schäge_Schwenk_2017, title={Authenticated Confidential
Channel Establishment and the Security of TLS-DHE}, DOI={10.1007/s00145-016-9248-2},
number={4}, journal={J. Cryptology}, author={Jager, Tibor and Kohlar, Florian
and Schäge, Sven and Schwenk, Jörg}, year={2017}, pages={1276--1324} }'
chicago: 'Jager, Tibor, Florian Kohlar, Sven Schäge, and Jörg Schwenk. “Authenticated
Confidential Channel Establishment and the Security of TLS-DHE.” J. Cryptology,
no. 4 (2017): 1276--1324. https://doi.org/10.1007/s00145-016-9248-2.'
ieee: T. Jager, F. Kohlar, S. Schäge, and J. Schwenk, “Authenticated Confidential
Channel Establishment and the Security of TLS-DHE,” J. Cryptology, no.
4, pp. 1276--1324, 2017.
mla: Jager, Tibor, et al. “Authenticated Confidential Channel Establishment and
the Security of TLS-DHE.” J. Cryptology, no. 4, 2017, pp. 1276--1324, doi:10.1007/s00145-016-9248-2.
short: T. Jager, F. Kohlar, S. Schäge, J. Schwenk, J. Cryptology (2017) 1276--1324.
date_created: 2018-06-07T08:58:36Z
date_updated: 2022-01-06T06:58:56Z
department:
- _id: '558'
doi: 10.1007/s00145-016-9248-2
issue: '4'
page: 1276--1324
publication: J. Cryptology
status: public
title: Authenticated Confidential Channel Establishment and the Security of TLS-DHE
type: journal_article
user_id: '38235'
year: '2017'
...
---
_id: '3109'
author:
- first_name: Britta
full_name: Hale, Britta
last_name: Hale
- first_name: Tibor
full_name: Jager, Tibor
id: '64669'
last_name: Jager
- first_name: Sebastian
full_name: Lauer, Sebastian
last_name: Lauer
- first_name: Jörg
full_name: Schwenk, Jörg
last_name: Schwenk
citation:
ama: 'Hale B, Jager T, Lauer S, Schwenk J. Simple Security Definitions for and Constructions
of 0-RTT Key Exchange. In: Applied Cryptography and Network Security - 15th
International Conference, ACNS 2017, Kanazawa, Japan, July 10-12, 2017, Proceedings.
; 2017:20--38. doi:10.1007/978-3-319-61204-1_2'
apa: Hale, B., Jager, T., Lauer, S., & Schwenk, J. (2017). Simple Security Definitions
for and Constructions of 0-RTT Key Exchange. In Applied Cryptography and Network
Security - 15th International Conference, ACNS 2017, Kanazawa, Japan, July 10-12,
2017, Proceedings (pp. 20--38). https://doi.org/10.1007/978-3-319-61204-1_2
bibtex: '@inproceedings{Hale_Jager_Lauer_Schwenk_2017, title={Simple Security Definitions
for and Constructions of 0-RTT Key Exchange}, DOI={10.1007/978-3-319-61204-1_2},
booktitle={Applied Cryptography and Network Security - 15th International Conference,
ACNS 2017, Kanazawa, Japan, July 10-12, 2017, Proceedings}, author={Hale, Britta
and Jager, Tibor and Lauer, Sebastian and Schwenk, Jörg}, year={2017}, pages={20--38}
}'
chicago: Hale, Britta, Tibor Jager, Sebastian Lauer, and Jörg Schwenk. “Simple Security
Definitions for and Constructions of 0-RTT Key Exchange.” In Applied Cryptography
and Network Security - 15th International Conference, ACNS 2017, Kanazawa, Japan,
July 10-12, 2017, Proceedings, 20--38, 2017. https://doi.org/10.1007/978-3-319-61204-1_2.
ieee: B. Hale, T. Jager, S. Lauer, and J. Schwenk, “Simple Security Definitions
for and Constructions of 0-RTT Key Exchange,” in Applied Cryptography and Network
Security - 15th International Conference, ACNS 2017, Kanazawa, Japan, July 10-12,
2017, Proceedings, 2017, pp. 20--38.
mla: Hale, Britta, et al. “Simple Security Definitions for and Constructions of
0-RTT Key Exchange.” Applied Cryptography and Network Security - 15th International
Conference, ACNS 2017, Kanazawa, Japan, July 10-12, 2017, Proceedings, 2017,
pp. 20--38, doi:10.1007/978-3-319-61204-1_2.
short: 'B. Hale, T. Jager, S. Lauer, J. Schwenk, in: Applied Cryptography and Network
Security - 15th International Conference, ACNS 2017, Kanazawa, Japan, July 10-12,
2017, Proceedings, 2017, pp. 20--38.'
date_created: 2018-06-07T09:07:59Z
date_updated: 2022-01-06T06:58:56Z
department:
- _id: '558'
doi: 10.1007/978-3-319-61204-1_2
page: 20--38
publication: Applied Cryptography and Network Security - 15th International Conference,
ACNS 2017, Kanazawa, Japan, July 10-12, 2017, Proceedings
status: public
title: Simple Security Definitions for and Constructions of 0-RTT Key Exchange
type: conference
user_id: '38235'
year: '2017'
...
---
_id: '3110'
author:
- first_name: Felix
full_name: Günther, Felix
last_name: Günther
- first_name: Britta
full_name: Hale, Britta
last_name: Hale
- first_name: Tibor
full_name: Jager, Tibor
id: '64669'
last_name: Jager
- first_name: Sebastian
full_name: Lauer, Sebastian
last_name: Lauer
citation:
ama: 'Günther F, Hale B, Jager T, Lauer S. 0-RTT Key Exchange with Full Forward
Secrecy. In: Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International
Conference on the Theory and Applications of Cryptographic Techniques, Paris,
France, April 30 - May 4, 2017, Proceedings, Part III. ; 2017:519--548. doi:10.1007/978-3-319-56617-7_18'
apa: Günther, F., Hale, B., Jager, T., & Lauer, S. (2017). 0-RTT Key Exchange
with Full Forward Secrecy. In Advances in Cryptology - EUROCRYPT 2017 - 36th
Annual International Conference on the Theory and Applications of Cryptographic
Techniques, Paris, France, April 30 - May 4, 2017, Proceedings, Part III (pp.
519--548). https://doi.org/10.1007/978-3-319-56617-7_18
bibtex: '@inproceedings{Günther_Hale_Jager_Lauer_2017, title={0-RTT Key Exchange
with Full Forward Secrecy}, DOI={10.1007/978-3-319-56617-7_18},
booktitle={Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International
Conference on the Theory and Applications of Cryptographic Techniques, Paris,
France, April 30 - May 4, 2017, Proceedings, Part III}, author={Günther, Felix
and Hale, Britta and Jager, Tibor and Lauer, Sebastian}, year={2017}, pages={519--548}
}'
chicago: Günther, Felix, Britta Hale, Tibor Jager, and Sebastian Lauer. “0-RTT Key
Exchange with Full Forward Secrecy.” In Advances in Cryptology - EUROCRYPT
2017 - 36th Annual International Conference on the Theory and Applications of
Cryptographic Techniques, Paris, France, April 30 - May 4, 2017, Proceedings,
Part III, 519--548, 2017. https://doi.org/10.1007/978-3-319-56617-7_18.
ieee: F. Günther, B. Hale, T. Jager, and S. Lauer, “0-RTT Key Exchange with Full
Forward Secrecy,” in Advances in Cryptology - EUROCRYPT 2017 - 36th Annual
International Conference on the Theory and Applications of Cryptographic Techniques,
Paris, France, April 30 - May 4, 2017, Proceedings, Part III, 2017, pp. 519--548.
mla: Günther, Felix, et al. “0-RTT Key Exchange with Full Forward Secrecy.” Advances
in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory
and Applications of Cryptographic Techniques, Paris, France, April 30 - May 4,
2017, Proceedings, Part III, 2017, pp. 519--548, doi:10.1007/978-3-319-56617-7_18.
short: 'F. Günther, B. Hale, T. Jager, S. Lauer, in: Advances in Cryptology - EUROCRYPT
2017 - 36th Annual International Conference on the Theory and Applications of
Cryptographic Techniques, Paris, France, April 30 - May 4, 2017, Proceedings,
Part III, 2017, pp. 519--548.'
date_created: 2018-06-07T09:10:17Z
date_updated: 2022-01-06T06:58:56Z
department:
- _id: '558'
doi: 10.1007/978-3-319-56617-7_18
page: 519--548
publication: Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference
on the Theory and Applications of Cryptographic Techniques, Paris, France, April
30 - May 4, 2017, Proceedings, Part III
status: public
title: 0-RTT Key Exchange with Full Forward Secrecy
type: conference
user_id: '38235'
year: '2017'
...
---
_id: '3111'
author:
- first_name: Tibor
full_name: Jager, Tibor
id: '64669'
last_name: Jager
- first_name: Martijn
full_name: Stam, Martijn
last_name: Stam
- first_name: Ryan
full_name: Stanley-Oakes, Ryan
last_name: Stanley-Oakes
- first_name: Bogdan
full_name: Warinschi, Bogdan
last_name: Warinschi
citation:
ama: 'Jager T, Stam M, Stanley-Oakes R, Warinschi B. Multi-key Authenticated Encryption
with Corruptions: Reductions Are Lossy. In: Theory of Cryptography - 15th International
Conference, TCC 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part
I. ; 2017:409--441. doi:10.1007/978-3-319-70500-2_14'
apa: 'Jager, T., Stam, M., Stanley-Oakes, R., & Warinschi, B. (2017). Multi-key
Authenticated Encryption with Corruptions: Reductions Are Lossy. In Theory
of Cryptography - 15th International Conference, TCC 2017, Baltimore, MD, USA,
November 12-15, 2017, Proceedings, Part I (pp. 409--441). https://doi.org/10.1007/978-3-319-70500-2_14'
bibtex: '@inproceedings{Jager_Stam_Stanley-Oakes_Warinschi_2017, title={Multi-key
Authenticated Encryption with Corruptions: Reductions Are Lossy}, DOI={10.1007/978-3-319-70500-2_14},
booktitle={Theory of Cryptography - 15th International Conference, TCC 2017, Baltimore,
MD, USA, November 12-15, 2017, Proceedings, Part I}, author={Jager, Tibor and
Stam, Martijn and Stanley-Oakes, Ryan and Warinschi, Bogdan}, year={2017}, pages={409--441}
}'
chicago: 'Jager, Tibor, Martijn Stam, Ryan Stanley-Oakes, and Bogdan Warinschi.
“Multi-Key Authenticated Encryption with Corruptions: Reductions Are Lossy.” In
Theory of Cryptography - 15th International Conference, TCC 2017, Baltimore,
MD, USA, November 12-15, 2017, Proceedings, Part I, 409--441, 2017. https://doi.org/10.1007/978-3-319-70500-2_14.'
ieee: 'T. Jager, M. Stam, R. Stanley-Oakes, and B. Warinschi, “Multi-key Authenticated
Encryption with Corruptions: Reductions Are Lossy,” in Theory of Cryptography
- 15th International Conference, TCC 2017, Baltimore, MD, USA, November 12-15,
2017, Proceedings, Part I, 2017, pp. 409--441.'
mla: 'Jager, Tibor, et al. “Multi-Key Authenticated Encryption with Corruptions:
Reductions Are Lossy.” Theory of Cryptography - 15th International Conference,
TCC 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part I, 2017,
pp. 409--441, doi:10.1007/978-3-319-70500-2_14.'
short: 'T. Jager, M. Stam, R. Stanley-Oakes, B. Warinschi, in: Theory of Cryptography
- 15th International Conference, TCC 2017, Baltimore, MD, USA, November 12-15,
2017, Proceedings, Part I, 2017, pp. 409--441.'
date_created: 2018-06-07T09:11:07Z
date_updated: 2022-01-06T06:58:56Z
department:
- _id: '558'
doi: 10.1007/978-3-319-70500-2_14
page: 409--441
publication: Theory of Cryptography - 15th International Conference, TCC 2017, Baltimore,
MD, USA, November 12-15, 2017, Proceedings, Part I
status: public
title: 'Multi-key Authenticated Encryption with Corruptions: Reductions Are Lossy'
type: conference
user_id: '38235'
year: '2017'
...
---
_id: '3155'
author:
- first_name: Manuel
full_name: Töws, Manuel
last_name: Töws
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Töws M, Wehrheim H. Policy Dependent and Independent Information Flow Analyses.
In: Duan Z, Ong L, eds. Formal Methods and Software Engineering - 19th International
Conference on Formal Engineering Methods, {ICFEM} 2017, Xi’an, China, November
13-17, 2017, Proceedings. Lecture Notes in Computer Science. ; 2017:362--378.
doi:10.1007/978-3-319-68690-5_22'
apa: Töws, M., & Wehrheim, H. (2017). Policy Dependent and Independent Information
Flow Analyses. In Z. Duan & L. Ong (Eds.), Formal Methods and Software
Engineering - 19th International Conference on Formal Engineering Methods, {ICFEM}
2017, Xi’an, China, November 13-17, 2017, Proceedings (pp. 362--378). https://doi.org/10.1007/978-3-319-68690-5_22
bibtex: '@inproceedings{Töws_Wehrheim_2017, series={Lecture Notes in Computer Science},
title={Policy Dependent and Independent Information Flow Analyses}, DOI={10.1007/978-3-319-68690-5_22},
booktitle={Formal Methods and Software Engineering - 19th International Conference
on Formal Engineering Methods, {ICFEM} 2017, Xi’an, China, November 13-17, 2017,
Proceedings}, author={Töws, Manuel and Wehrheim, Heike}, editor={Duan, Zhenhua
and Ong, LukeEditors}, year={2017}, pages={362--378}, collection={Lecture Notes
in Computer Science} }'
chicago: Töws, Manuel, and Heike Wehrheim. “Policy Dependent and Independent Information
Flow Analyses.” In Formal Methods and Software Engineering - 19th International
Conference on Formal Engineering Methods, {ICFEM} 2017, Xi’an, China, November
13-17, 2017, Proceedings, edited by Zhenhua Duan and Luke Ong, 362--378. Lecture
Notes in Computer Science, 2017. https://doi.org/10.1007/978-3-319-68690-5_22.
ieee: M. Töws and H. Wehrheim, “Policy Dependent and Independent Information Flow
Analyses,” in Formal Methods and Software Engineering - 19th International
Conference on Formal Engineering Methods, {ICFEM} 2017, Xi’an, China, November
13-17, 2017, Proceedings, 2017, pp. 362--378.
mla: Töws, Manuel, and Heike Wehrheim. “Policy Dependent and Independent Information
Flow Analyses.” Formal Methods and Software Engineering - 19th International
Conference on Formal Engineering Methods, {ICFEM} 2017, Xi’an, China, November
13-17, 2017, Proceedings, edited by Zhenhua Duan and Luke Ong, 2017, pp. 362--378,
doi:10.1007/978-3-319-68690-5_22.
short: 'M. Töws, H. Wehrheim, in: Z. Duan, L. Ong (Eds.), Formal Methods and Software
Engineering - 19th International Conference on Formal Engineering Methods, {ICFEM}
2017, Xi’an, China, November 13-17, 2017, Proceedings, 2017, pp. 362--378.'
date_created: 2018-06-13T07:35:49Z
date_updated: 2022-01-06T06:59:00Z
department:
- _id: '77'
doi: 10.1007/978-3-319-68690-5_22
editor:
- first_name: Zhenhua
full_name: Duan, Zhenhua
last_name: Duan
- first_name: Luke
full_name: Ong, Luke
last_name: Ong
page: 362--378
publication: Formal Methods and Software Engineering - 19th International Conference
on Formal Engineering Methods, {ICFEM} 2017, Xi'an, China, November 13-17, 2017,
Proceedings
series_title: Lecture Notes in Computer Science
status: public
title: Policy Dependent and Independent Information Flow Analyses
type: conference
user_id: '29719'
year: '2017'
...
---
_id: '3156'
author:
- first_name: Jürgen
full_name: König, Jürgen
last_name: König
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'König J, Wehrheim H. Value-Based or Conflict-Based? Opacity Definitions for
STMs. In: Van Hung D, Kapur D, eds. Theoretical Aspects of Computing - {ICTAC}
2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings.
Lecture Notes in Computer Science. ; 2017:118--135. doi:10.1007/978-3-319-67729-3_8'
apa: König, J., & Wehrheim, H. (2017). Value-Based or Conflict-Based? Opacity
Definitions for STMs. In D. Van Hung & D. Kapur (Eds.), Theoretical Aspects
of Computing - {ICTAC} 2017 - 14th International Colloquium, Hanoi, Vietnam, October
23-27, 2017, Proceedings (pp. 118--135). https://doi.org/10.1007/978-3-319-67729-3_8
bibtex: '@inproceedings{König_Wehrheim_2017, series={Lecture Notes in Computer Science},
title={Value-Based or Conflict-Based? Opacity Definitions for STMs}, DOI={10.1007/978-3-319-67729-3_8},
booktitle={Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International
Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings}, author={König,
Jürgen and Wehrheim, Heike}, editor={Van Hung, Dang and Kapur, DeepakEditors},
year={2017}, pages={118--135}, collection={Lecture Notes in Computer Science}
}'
chicago: König, Jürgen, and Heike Wehrheim. “Value-Based or Conflict-Based? Opacity
Definitions for STMs.” In Theoretical Aspects of Computing - {ICTAC} 2017 -
14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings,
edited by Dang Van Hung and Deepak Kapur, 118--135. Lecture Notes in Computer
Science, 2017. https://doi.org/10.1007/978-3-319-67729-3_8.
ieee: J. König and H. Wehrheim, “Value-Based or Conflict-Based? Opacity Definitions
for STMs,” in Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International
Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings, 2017, pp. 118--135.
mla: König, Jürgen, and Heike Wehrheim. “Value-Based or Conflict-Based? Opacity
Definitions for STMs.” Theoretical Aspects of Computing - {ICTAC} 2017 - 14th
International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings,
edited by Dang Van Hung and Deepak Kapur, 2017, pp. 118--135, doi:10.1007/978-3-319-67729-3_8.
short: 'J. König, H. Wehrheim, in: D. Van Hung, D. Kapur (Eds.), Theoretical Aspects
of Computing - {ICTAC} 2017 - 14th International Colloquium, Hanoi, Vietnam, October
23-27, 2017, Proceedings, 2017, pp. 118--135.'
date_created: 2018-06-13T07:37:18Z
date_updated: 2022-01-06T06:59:00Z
department:
- _id: '77'
doi: 10.1007/978-3-319-67729-3_8
editor:
- first_name: Dang
full_name: Van Hung, Dang
last_name: Van Hung
- first_name: Deepak
full_name: Kapur, Deepak
last_name: Kapur
page: 118--135
project:
- _id: '78'
name: Validation of Software Transactional Memory
publication: Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International
Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings
series_title: Lecture Notes in Computer Science
status: public
title: Value-Based or Conflict-Based? Opacity Definitions for STMs
type: conference
user_id: '29719'
year: '2017'
...
---
_id: '2741'
author:
- first_name: Shehzad
full_name: Ali Ashraf, Shehzad
last_name: Ali Ashraf
- first_name: Y.-P. Eric
full_name: Wang, Y.-P. Eric
last_name: Wang
- first_name: 'Sameh '
full_name: 'Eldessoki, Sameh '
last_name: Eldessoki
- first_name: Bernd
full_name: Holfeld, Bernd
last_name: Holfeld
- first_name: 'Donald '
full_name: 'Parruca, Donald '
last_name: Parruca
- first_name: Martin
full_name: Serror, Martin
last_name: Serror
- first_name: James
full_name: Gross, James
last_name: Gross
citation:
ama: 'Ali Ashraf S, Wang Y-PE, Eldessoki S, et al. From Radio Design to System Evaluations
for Ultra-Reliable and Low-Latency Communication . In: Dresden: Proceedings of
23th European Wireless Conference 2017, 17- 19.05.2017; 2017.'
apa: 'Ali Ashraf, S., Wang, Y.-P. E., Eldessoki, S., Holfeld, B., Parruca, D., Serror,
M., & Gross, J. (2017). From Radio Design to System Evaluations for Ultra-Reliable
and Low-Latency Communication . Dresden: Proceedings of 23th European Wireless
Conference 2017, 17- 19.05.2017.'
bibtex: '@inproceedings{Ali Ashraf_Wang_Eldessoki_Holfeld_Parruca_Serror_Gross_2017,
place={Dresden}, title={From Radio Design to System Evaluations for Ultra-Reliable
and Low-Latency Communication }, publisher={Proceedings of 23th European Wireless
Conference 2017, 17- 19.05.2017}, author={Ali Ashraf, Shehzad and Wang, Y.-P.
Eric and Eldessoki, Sameh and Holfeld, Bernd and Parruca, Donald and Serror,
Martin and Gross, James}, year={2017} }'
chicago: 'Ali Ashraf, Shehzad, Y.-P. Eric Wang, Sameh Eldessoki, Bernd Holfeld,
Donald Parruca, Martin Serror, and James Gross. “From Radio Design to System
Evaluations for Ultra-Reliable and Low-Latency Communication .” Dresden: Proceedings
of 23th European Wireless Conference 2017, 17- 19.05.2017, 2017.'
ieee: S. Ali Ashraf et al., “From Radio Design to System Evaluations for
Ultra-Reliable and Low-Latency Communication ,” 2017.
mla: Ali Ashraf, Shehzad, et al. From Radio Design to System Evaluations for
Ultra-Reliable and Low-Latency Communication . Proceedings of 23th European
Wireless Conference 2017, 17- 19.05.2017, 2017.
short: 'S. Ali Ashraf, Y.-P.E. Wang, S. Eldessoki, B. Holfeld, D. Parruca, M. Serror,
J. Gross, in: Proceedings of 23th European Wireless Conference 2017, 17- 19.05.2017,
Dresden, 2017.'
date_created: 2018-05-14T10:46:57Z
date_updated: 2022-01-06T06:57:39Z
department:
- _id: '75'
main_file_link:
- url: https://ieeexplore.ieee.org/document/8011336/
place: Dresden
project:
- _id: '29'
name: 'Verbundprojekt: Koordinierte Industriekommunikation - Latenzarme und verlässliche
Industriekommunikation - Teilvorhaben: Verteilte Koordination'
publisher: Proceedings of 23th European Wireless Conference 2017, 17- 19.05.2017
status: public
title: 'From Radio Design to System Evaluations for Ultra-Reliable and Low-Latency
Communication '
type: conference
user_id: '15572'
year: '2017'
...
---
_id: '112'
abstract:
- lang: eng
text: We study a model of selfish resource allocation that seeks to incorporate
dependencies among resources as they exist in in modern networked environments.
Our model is inspired by utility functions with constant elasticity of substitution
(CES) which is a well-studied model in economics. We consider congestion games
with different aggregation functions. In particular, we study $L_p$ norms and
analyze the existence and complexity of (approximate) pure Nash equilibria. Additionally,
we give an almost tight characterization based on monotonicity properties to describe
the set of aggregation functions that guarantee the existence of pure Nash equilibria.
author:
- first_name: Matthias
full_name: Feldotto, Matthias
id: '14052'
last_name: Feldotto
orcid: 0000-0003-1348-6516
- first_name: Lennart
full_name: Leder, Lennart
last_name: Leder
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: 'Feldotto M, Leder L, Skopalik A. Congestion Games with Complementarities.
In: Proceedings of the 10th International Conference on Algorithms and Complexity
(CIAC). LNCS. ; 2017:222--233. doi:10.1007/978-3-319-57586-5_19'
apa: Feldotto, M., Leder, L., & Skopalik, A. (2017). Congestion Games with Complementarities.
In Proceedings of the 10th International Conference on Algorithms and Complexity
(CIAC) (pp. 222--233). https://doi.org/10.1007/978-3-319-57586-5_19
bibtex: '@inproceedings{Feldotto_Leder_Skopalik_2017, series={LNCS}, title={Congestion
Games with Complementarities}, DOI={10.1007/978-3-319-57586-5_19},
booktitle={Proceedings of the 10th International Conference on Algorithms and
Complexity (CIAC)}, author={Feldotto, Matthias and Leder, Lennart and Skopalik,
Alexander}, year={2017}, pages={222--233}, collection={LNCS} }'
chicago: Feldotto, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion
Games with Complementarities.” In Proceedings of the 10th International Conference
on Algorithms and Complexity (CIAC), 222--233. LNCS, 2017. https://doi.org/10.1007/978-3-319-57586-5_19.
ieee: M. Feldotto, L. Leder, and A. Skopalik, “Congestion Games with Complementarities,”
in Proceedings of the 10th International Conference on Algorithms and Complexity
(CIAC), 2017, pp. 222--233.
mla: Feldotto, Matthias, et al. “Congestion Games with Complementarities.” Proceedings
of the 10th International Conference on Algorithms and Complexity (CIAC),
2017, pp. 222--233, doi:10.1007/978-3-319-57586-5_19.
short: 'M. Feldotto, L. Leder, A. Skopalik, in: Proceedings of the 10th International
Conference on Algorithms and Complexity (CIAC), 2017, pp. 222--233.'
date_created: 2017-10-17T12:41:13Z
date_updated: 2022-01-06T06:50:58Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
doi: 10.1007/978-3-319-57586-5_19
external_id:
arxiv:
- '1701.07304'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T13:05:37Z
date_updated: 2018-03-21T13:05:37Z
file_id: '1566'
file_name: 112-FeldottoLederSkopalik2017.pdf
file_size: 264089
relation: main_file
success: 1
file_date_updated: 2018-03-21T13:05:37Z
has_accepted_license: '1'
page: 222--233
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 10th International Conference on Algorithms and Complexity
(CIAC)
series_title: LNCS
status: public
title: Congestion Games with Complementarities
type: conference
user_id: '14052'
year: '2017'
...
---
_id: '113'
abstract:
- lang: eng
text: We study the computation of approximate pure Nash equilibria in Shapley value
(SV) weighted congestion games, introduced in [19]. This class of games considers
weighted congestion games in which Shapley values are used as an alternative (to
proportional shares) for distributing the total cost of each resource among its
users. We focus on the interesting subclass of such games with polynomial resource
cost functions and present an algorithm that computes approximate pure Nash equilibria
with a polynomial number of strategy updates. Since computing a single strategy
update is hard, we apply sampling techniques which allow us to achieve polynomial
running time. The algorithm builds on the algorithmic ideas of [7], however, to
the best of our knowledge, this is the first algorithmic result on computation
of approximate equilibria using other than proportional shares as player costs
in this setting. We present a novel relation that approximates the Shapley value
of a player by her proportional share and vice versa. As side results, we upper
bound the approximate price of anarchy of such games and significantly improve
the best known factor for computing approximate pure Nash equilibria in weighted
congestion games of [7].
author:
- first_name: Matthias
full_name: Feldotto, Matthias
id: '14052'
last_name: Feldotto
orcid: 0000-0003-1348-6516
- first_name: Martin
full_name: Gairing, Martin
last_name: Gairing
- first_name: Grammateia
full_name: Kotsialou, Grammateia
last_name: Kotsialou
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: 'Feldotto M, Gairing M, Kotsialou G, Skopalik A. Computing Approximate Pure
Nash Equilibria in Shapley Value Weighted Congestion Games. In: Proceedings
of the 13th International Conference on Web and Internet Economics (WINE).
; 2017. doi:10.1007/978-3-319-71924-5_14'
apa: Feldotto, M., Gairing, M., Kotsialou, G., & Skopalik, A. (2017). Computing
Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games. In
Proceedings of the 13th International Conference on Web and Internet Economics
(WINE). https://doi.org/10.1007/978-3-319-71924-5_14
bibtex: '@inproceedings{Feldotto_Gairing_Kotsialou_Skopalik_2017, title={Computing
Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games},
DOI={10.1007/978-3-319-71924-5_14},
booktitle={Proceedings of the 13th International Conference on Web and Internet
Economics (WINE)}, author={Feldotto, Matthias and Gairing, Martin and Kotsialou,
Grammateia and Skopalik, Alexander}, year={2017} }'
chicago: Feldotto, Matthias, Martin Gairing, Grammateia Kotsialou, and Alexander
Skopalik. “Computing Approximate Pure Nash Equilibria in Shapley Value Weighted
Congestion Games.” In Proceedings of the 13th International Conference on Web
and Internet Economics (WINE), 2017. https://doi.org/10.1007/978-3-319-71924-5_14.
ieee: M. Feldotto, M. Gairing, G. Kotsialou, and A. Skopalik, “Computing Approximate
Pure Nash Equilibria in Shapley Value Weighted Congestion Games,” in Proceedings
of the 13th International Conference on Web and Internet Economics (WINE),
2017.
mla: Feldotto, Matthias, et al. “Computing Approximate Pure Nash Equilibria in Shapley
Value Weighted Congestion Games.” Proceedings of the 13th International Conference
on Web and Internet Economics (WINE), 2017, doi:10.1007/978-3-319-71924-5_14.
short: 'M. Feldotto, M. Gairing, G. Kotsialou, A. Skopalik, in: Proceedings of the
13th International Conference on Web and Internet Economics (WINE), 2017.'
date_created: 2017-10-17T12:41:13Z
date_updated: 2022-01-06T06:50:59Z
ddc:
- '000'
department:
- _id: '63'
- _id: '541'
doi: 10.1007/978-3-319-71924-5_14
external_id:
arxiv:
- '1710.01634'
file:
- access_level: closed
content_type: application/pdf
creator: feldi
date_created: 2018-10-31T17:01:32Z
date_updated: 2018-10-31T17:01:32Z
file_id: '5231'
file_name: Feldotto2017_Chapter_ComputingApproximatePureNashEq.pdf
file_size: 279055
relation: main_file
success: 1
file_date_updated: 2018-10-31T17:01:32Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 13th International Conference on Web and Internet
Economics (WINE)
status: public
title: Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion
Games
type: conference
user_id: '14052'
year: '2017'
...
---
_id: '114'
abstract:
- lang: eng
text: Proof witnesses are proof artifacts showing correctness of programs wrt. safety
properties. The recent past has seen a rising interest in witnesses as (a) proofs
in a proof-carrying-code context, (b) certificates for the correct functioning
of verification tools, or simply (c) exchange formats for (partial) verification
results. As witnesses in all theses scenarios need to be stored and processed,
witnesses are required to be as small as possible. However, software verification
tools – the prime suppliers of witnesses – do not necessarily construct small
witnesses. In this paper, we present a formal account of proof witnesses. We introduce
the concept of weakenings, reducing the complexity of proof witnesses while preserving
the ability of witnessing safety. We develop aweakening technique for a specific
class of program analyses, and prove it to be sound. Finally, we experimentally
demonstrate our weakening technique to indeed achieve a size reduction of proof
witnesses.
author:
- 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: 'Jakobs M-C, Wehrheim H. Compact Proof Witnesses. In: Barrett C, Davies M,
Kahsai T, eds. NASA Formal Methods: 9th International Symposium. Lecture
Notes in Computer Science. ; 2017:389-403. doi:10.1007/978-3-319-57288-8_28'
apa: 'Jakobs, M.-C., & Wehrheim, H. (2017). Compact Proof Witnesses. In C. Barrett,
M. Davies, & T. Kahsai (Eds.), NASA Formal Methods: 9th International Symposium
(pp. 389–403). https://doi.org/10.1007/978-3-319-57288-8_28'
bibtex: '@inproceedings{Jakobs_Wehrheim_2017, series={Lecture Notes in Computer
Science}, title={Compact Proof Witnesses}, DOI={10.1007/978-3-319-57288-8_28},
booktitle={NASA Formal Methods: 9th International Symposium}, author={Jakobs,
Marie-Christine and Wehrheim, Heike}, editor={Barrett, Clark and Davies, Misty
and Kahsai, TemesghenEditors}, year={2017}, pages={389–403}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Jakobs, Marie-Christine, and Heike Wehrheim. “Compact Proof Witnesses.”
In NASA Formal Methods: 9th International Symposium, edited by Clark Barrett,
Misty Davies, and Temesghen Kahsai, 389–403. Lecture Notes in Computer Science,
2017. https://doi.org/10.1007/978-3-319-57288-8_28.'
ieee: 'M.-C. Jakobs and H. Wehrheim, “Compact Proof Witnesses,” in NASA Formal
Methods: 9th International Symposium, 2017, pp. 389–403.'
mla: 'Jakobs, Marie-Christine, and Heike Wehrheim. “Compact Proof Witnesses.” NASA
Formal Methods: 9th International Symposium, edited by Clark Barrett et al.,
2017, pp. 389–403, doi:10.1007/978-3-319-57288-8_28.'
short: 'M.-C. Jakobs, H. Wehrheim, in: C. Barrett, M. Davies, T. Kahsai (Eds.),
NASA Formal Methods: 9th International Symposium, 2017, pp. 389–403.'
date_created: 2017-10-17T12:41:13Z
date_updated: 2022-01-06T06:51:00Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-319-57288-8_28
editor:
- first_name: Clark
full_name: Barrett, Clark
last_name: Barrett
- first_name: Misty
full_name: Davies, Misty
last_name: Davies
- first_name: Temesghen
full_name: Kahsai, Temesghen
last_name: Kahsai
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T13:05:02Z
date_updated: 2018-03-21T13:05:02Z
file_id: '1565'
file_name: 114-chp_3A10.1007_2F978-3-319-57288-8_28.pdf
file_size: 492800
relation: main_file
success: 1
file_date_updated: 2018-03-21T13:05:02Z
has_accepted_license: '1'
language:
- iso: eng
page: 389-403
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: 'NASA Formal Methods: 9th International Symposium'
series_title: Lecture Notes in Computer Science
status: public
title: Compact Proof Witnesses
type: conference
user_id: '477'
year: '2017'
...
---
_id: '115'
abstract:
- lang: eng
text: 'Whenever customers have to decide between different instances of the same
product, they are interested in buying the best product. In contrast, companies
are interested in reducing the construction effort (and usually as a consequence
thereof, the quality) to gain profit. The described setting is widely known as
opposed preferences in quality of the product and also applies to the context
of service-oriented computing. In general, service-oriented computing emphasizes
the construction of large software systems out of existing services, where services
are small and self-contained pieces of software that adhere to a specified interface.
Several implementations of the same interface are considered as several instances
of the same service. Thereby, customers are interested in buying the best service
implementation for their service composition wrt. to metrics, such as costs, energy,
memory consumption, or execution time. One way to ensure the service quality is
to employ certificates, which can come in different kinds: Technical certificates
proving correctness can be automatically constructed by the service provider and
again be automatically checked by the user. Digital certificates allow proof of
the integrity of a product. Other certificates might be rolled out if service
providers follow a good software construction principle, which is checked in annual
audits. Whereas all of these certificates are handled differently in service markets,
what they have in common is that they influence the buying decisions of customers.
In this paper, we review state-of-the-art developments in certification with respect
to service-oriented computing. We not only discuss how certificates are constructed
and handled in service-oriented computing but also review the effects of certificates
on the market from an economic perspective.'
author:
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
- first_name: Julia
full_name: Krämer, Julia
last_name: Krämer
- first_name: Dirk
full_name: van Straaten, Dirk
id: '10311'
last_name: van Straaten
- first_name: Theodor
full_name: Lettmann, Theodor
id: '315'
last_name: Lettmann
orcid: 0000-0001-5859-2457
citation:
ama: 'Jakobs M-C, Krämer J, van Straaten D, Lettmann T. Certification Matters for
Service Markets. In: Marcelo De Barros, Janusz Klink,Tadeus Uhl TP, ed. The
Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION).
; 2017:7-12.'
apa: Jakobs, M.-C., Krämer, J., van Straaten, D., & Lettmann, T. (2017). Certification
Matters for Service Markets. In T. P. Marcelo De Barros, Janusz Klink,Tadeus Uhl
(Ed.), The Ninth International Conferences on Advanced Service Computing (SERVICE
COMPUTATION) (pp. 7–12).
bibtex: '@inproceedings{Jakobs_Krämer_van Straaten_Lettmann_2017, title={Certification
Matters for Service Markets}, booktitle={The Ninth International Conferences on
Advanced Service Computing (SERVICE COMPUTATION)}, author={Jakobs, Marie-Christine
and Krämer, Julia and van Straaten, Dirk and Lettmann, Theodor}, editor={Marcelo
De Barros, Janusz Klink,Tadeus Uhl, Thomas PrinzEditor}, year={2017}, pages={7–12}
}'
chicago: Jakobs, Marie-Christine, Julia Krämer, Dirk van Straaten, and Theodor Lettmann.
“Certification Matters for Service Markets.” In The Ninth International Conferences
on Advanced Service Computing (SERVICE COMPUTATION), edited by Thomas Prinz
Marcelo De Barros, Janusz Klink,Tadeus Uhl, 7–12, 2017.
ieee: M.-C. Jakobs, J. Krämer, D. van Straaten, and T. Lettmann, “Certification Matters
for Service Markets,” in The Ninth International Conferences on Advanced Service
Computing (SERVICE COMPUTATION), 2017, pp. 7–12.
mla: Jakobs, Marie-Christine, et al. “Certification Matters for Service Markets.”
The Ninth International Conferences on Advanced Service Computing (SERVICE
COMPUTATION), edited by Thomas Prinz Marcelo De Barros, Janusz Klink,Tadeus
Uhl, 2017, pp. 7–12.
short: 'M.-C. Jakobs, J. Krämer, D. van Straaten, T. Lettmann, in: T.P. Marcelo
De Barros, Janusz Klink,Tadeus Uhl (Ed.), The Ninth International Conferences
on Advanced Service Computing (SERVICE COMPUTATION), 2017, pp. 7–12.'
date_created: 2017-10-17T12:41:14Z
date_updated: 2022-01-06T06:51:02Z
ddc:
- '040'
department:
- _id: '77'
- _id: '355'
- _id: '179'
editor:
- first_name: Thomas Prinz
full_name: Marcelo De Barros, Janusz Klink,Tadeus Uhl, Thomas Prinz
last_name: Marcelo De Barros, Janusz Klink,Tadeus Uhl
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T13:04:12Z
date_updated: 2018-03-21T13:04:12Z
file_id: '1564'
file_name: 115-JakobsKraemerVanStraatenLettmann2017.pdf
file_size: 133531
relation: main_file
success: 1
file_date_updated: 2018-03-21T13:04:12Z
has_accepted_license: '1'
language:
- iso: eng
page: 7-12
project:
- _id: '1'
name: SFB 901
- _id: '10'
name: SFB 901 - Subprojekt B2
- _id: '11'
name: SFB 901 - Subproject B3
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '8'
name: SFB 901 - Subproject A4
- _id: '2'
name: SFB 901 - Project Area A
- _id: '3'
name: SFB 901 - Project Area B
publication: The Ninth International Conferences on Advanced Service Computing (SERVICE
COMPUTATION)
status: public
title: Certification Matters for Service Markets
type: conference
user_id: '477'
year: '2017'
...
---
_id: '1157'
author:
- first_name: Linus Matthias
full_name: Witschen, Linus Matthias
id: '49051'
last_name: Witschen
citation:
ama: Witschen LM. A Framework for the Synthesis of Approximate Circuits.
Universität Paderborn; 2017.
apa: Witschen, L. M. (2017). A Framework for the Synthesis of Approximate Circuits.
Universität Paderborn.
bibtex: '@book{Witschen_2017, title={A Framework for the Synthesis of Approximate
Circuits}, publisher={Universität Paderborn}, author={Witschen, Linus Matthias},
year={2017} }'
chicago: Witschen, Linus Matthias. A Framework for the Synthesis of Approximate
Circuits. Universität Paderborn, 2017.
ieee: L. M. Witschen, A Framework for the Synthesis of Approximate Circuits.
Universität Paderborn, 2017.
mla: Witschen, Linus Matthias. A Framework for the Synthesis of Approximate Circuits.
Universität Paderborn, 2017.
short: L.M. Witschen, A Framework for the Synthesis of Approximate Circuits, Universität
Paderborn, 2017.
date_created: 2018-02-01T14:21:19Z
date_updated: 2022-01-06T06:51:03Z
department:
- _id: '78'
- _id: '7'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
- first_name: Tobias
full_name: Wiersema, Tobias
id: '3118'
last_name: Wiersema
title: A Framework for the Synthesis of Approximate Circuits
type: mastersthesis
user_id: '477'
year: '2017'
...
---
_id: '1158'
abstract:
- lang: eng
text: In this paper, we present the annotation challenges we have encountered when
working on a historical language that was undergoing elaboration processes. We
especially focus on syntactic ambiguity and gradience in Middle Low German, which
causes uncertainty to some extent. Since current annotation tools consider construction
contexts and the dynamics of the grammaticalization only partially, we plan to
extend CorA – a web-based annotation tool for historical and other non-standard
language data – to capture elaboration phenomena and annotator unsureness. Moreover,
we seek to interactively learn morphological as well as syntactic annotations.
author:
- first_name: Nina
full_name: Seemann, Nina
id: '65408'
last_name: Seemann
- first_name: Marie-Luis
full_name: Merten, Marie-Luis
last_name: Merten
- first_name: Michaela
full_name: Geierhos, Michaela
id: '42496'
last_name: Geierhos
orcid: 0000-0002-8180-5606
- first_name: Doris
full_name: Tophinke, Doris
last_name: Tophinke
- first_name: Eyke
full_name: Hüllermeier, Eyke
last_name: Hüllermeier
citation:
ama: 'Seemann N, Merten M-L, Geierhos M, Tophinke D, Hüllermeier E. Annotation Challenges
for Reconstructing the Structural Elaboration of Middle Low German. In: Proceedings
of the Joint SIGHUM Workshop on Computational Linguistics for Cultural Heritage,
Social Sciences, Humanities and Literature. Stroudsburg, PA, USA: Association
for Computational Linguistics (ACL); 2017:40-45. doi:10.18653/v1/W17-2206'
apa: 'Seemann, N., Merten, M.-L., Geierhos, M., Tophinke, D., & Hüllermeier,
E. (2017). Annotation Challenges for Reconstructing the Structural Elaboration
of Middle Low German. In Proceedings of the Joint SIGHUM Workshop on Computational
Linguistics for Cultural Heritage, Social Sciences, Humanities and Literature
(pp. 40–45). Stroudsburg, PA, USA: Association for Computational Linguistics (ACL).
https://doi.org/10.18653/v1/W17-2206'
bibtex: '@inproceedings{Seemann_Merten_Geierhos_Tophinke_Hüllermeier_2017, place={Stroudsburg,
PA, USA}, title={Annotation Challenges for Reconstructing the Structural Elaboration
of Middle Low German}, DOI={10.18653/v1/W17-2206},
booktitle={Proceedings of the Joint SIGHUM Workshop on Computational Linguistics
for Cultural Heritage, Social Sciences, Humanities and Literature}, publisher={Association
for Computational Linguistics (ACL)}, author={Seemann, Nina and Merten, Marie-Luis
and Geierhos, Michaela and Tophinke, Doris and Hüllermeier, Eyke}, year={2017},
pages={40–45} }'
chicago: 'Seemann, Nina, Marie-Luis Merten, Michaela Geierhos, Doris Tophinke, and
Eyke Hüllermeier. “Annotation Challenges for Reconstructing the Structural Elaboration
of Middle Low German.” In Proceedings of the Joint SIGHUM Workshop on Computational
Linguistics for Cultural Heritage, Social Sciences, Humanities and Literature,
40–45. Stroudsburg, PA, USA: Association for Computational Linguistics (ACL),
2017. https://doi.org/10.18653/v1/W17-2206.'
ieee: N. Seemann, M.-L. Merten, M. Geierhos, D. Tophinke, and E. Hüllermeier, “Annotation
Challenges for Reconstructing the Structural Elaboration of Middle Low German,”
in Proceedings of the Joint SIGHUM Workshop on Computational Linguistics for
Cultural Heritage, Social Sciences, Humanities and Literature, Vancouver,
BC, Canada, 2017, pp. 40–45.
mla: Seemann, Nina, et al. “Annotation Challenges for Reconstructing the Structural
Elaboration of Middle Low German.” Proceedings of the Joint SIGHUM Workshop
on Computational Linguistics for Cultural Heritage, Social Sciences, Humanities
and Literature, Association for Computational Linguistics (ACL), 2017, pp.
40–45, doi:10.18653/v1/W17-2206.
short: 'N. Seemann, M.-L. Merten, M. Geierhos, D. Tophinke, E. Hüllermeier, in:
Proceedings of the Joint SIGHUM Workshop on Computational Linguistics for Cultural
Heritage, Social Sciences, Humanities and Literature, Association for Computational
Linguistics (ACL), Stroudsburg, PA, USA, 2017, pp. 40–45.'
conference:
end_date: 2017-08-04
location: Vancouver, BC, Canada
name: Joint SIGHUM Workshop on Computational Linguistics for Cultural Heritage,
Social Sciences, Humanities and Literature (LaTeCH-CLfL 2017)
start_date: 2017-07-31
date_created: 2018-01-31T15:32:33Z
date_updated: 2022-01-06T06:51:03Z
department:
- _id: '36'
- _id: '579'
- _id: '115'
- _id: '355'
- _id: '615'
doi: 10.18653/v1/W17-2206
language:
- iso: eng
page: 40-45
place: Stroudsburg, PA, USA
project:
- _id: '39'
name: InterGramm
publication: Proceedings of the Joint SIGHUM Workshop on Computational Linguistics
for Cultural Heritage, Social Sciences, Humanities and Literature
publication_status: published
publisher: Association for Computational Linguistics (ACL)
quality_controlled: '1'
status: public
title: Annotation Challenges for Reconstructing the Structural Elaboration of Middle
Low German
type: conference
user_id: '13929'
year: '2017'
...