---
_id: '3126'
author:
- first_name: Christoph
full_name: Bader, Christoph
last_name: Bader
- first_name: Dennis
full_name: Hofheinz, Dennis
last_name: Hofheinz
- first_name: Tibor
full_name: Jager, Tibor
id: '64669'
last_name: Jager
- first_name: Eike
full_name: Kiltz, Eike
last_name: Kiltz
- first_name: Yong
full_name: Li, Yong
last_name: Li
citation:
ama: 'Bader C, Hofheinz D, Jager T, Kiltz E, Li Y. Tightly-Secure Authenticated
Key Exchange. In: Theory of Cryptography - 12th Theory of Cryptography Conference,
TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part I. ; 2015:629--658.
doi:10.1007/978-3-662-46494-6_26'
apa: Bader, C., Hofheinz, D., Jager, T., Kiltz, E., & Li, Y. (2015). Tightly-Secure
Authenticated Key Exchange. In Theory of Cryptography - 12th Theory of Cryptography
Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part I
(pp. 629--658). https://doi.org/10.1007/978-3-662-46494-6_26
bibtex: '@inproceedings{Bader_Hofheinz_Jager_Kiltz_Li_2015, title={Tightly-Secure
Authenticated Key Exchange}, DOI={10.1007/978-3-662-46494-6_26},
booktitle={Theory of Cryptography - 12th Theory of Cryptography Conference, TCC
2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part I}, author={Bader,
Christoph and Hofheinz, Dennis and Jager, Tibor and Kiltz, Eike and Li, Yong},
year={2015}, pages={629--658} }'
chicago: Bader, Christoph, Dennis Hofheinz, Tibor Jager, Eike Kiltz, and Yong Li.
“Tightly-Secure Authenticated Key Exchange.” In Theory of Cryptography - 12th
Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015,
Proceedings, Part I, 629--658, 2015. https://doi.org/10.1007/978-3-662-46494-6_26.
ieee: C. Bader, D. Hofheinz, T. Jager, E. Kiltz, and Y. Li, “Tightly-Secure Authenticated
Key Exchange,” in Theory of Cryptography - 12th Theory of Cryptography Conference,
TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part I, 2015, pp.
629--658.
mla: Bader, Christoph, et al. “Tightly-Secure Authenticated Key Exchange.” Theory
of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland,
March 23-25, 2015, Proceedings, Part I, 2015, pp. 629--658, doi:10.1007/978-3-662-46494-6_26.
short: 'C. Bader, D. Hofheinz, T. Jager, E. Kiltz, Y. Li, in: Theory of Cryptography
- 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25,
2015, Proceedings, Part I, 2015, pp. 629--658.'
date_created: 2018-06-07T09:20:48Z
date_updated: 2022-01-06T06:58:57Z
department:
- _id: '558'
doi: 10.1007/978-3-662-46494-6_26
extern: '1'
page: 629--658
publication: Theory of Cryptography - 12th Theory of Cryptography Conference, TCC
2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part I
status: public
title: Tightly-Secure Authenticated Key Exchange
type: conference
user_id: '38235'
year: '2015'
...
---
_id: '313'
abstract:
- lang: eng
text: 'Nowadays, many service providers offer software components in the form of
Software as a Service. Requesters that want to discover those services in order
to use or to integrate them, need to find out which service satisfies their requirements
best. For this purpose, service matching approaches determine how well the specifications
of provided services satisfy their requirements (including structural, behavioral,
and non-functional requirements). In this paper, we describe the tool-suite MatchBox
that allows the integration of existing service matchers and their combination
as part of flexibly configurable matching processes. Taking requirements and service
specifications as an input, MatchBox is able to execute such matching processes
and deliver rich matching results. In contrast to related tools, MatchBox allows
users to take into account many different kinds of requirements, while it also
provides the flexibility to control the matching process in many different ways. '
author:
- first_name: Paul
full_name: Börding, Paul
last_name: Börding
- first_name: Melanie
full_name: Bruns, Melanie
last_name: Bruns
- first_name: Marie Christin
full_name: Platenius, Marie Christin
last_name: Platenius
citation:
ama: 'Börding P, Bruns M, Platenius MC. Comprehensive Service Matching with MatchBox.
In: 10th Joint Meeting of the European Software Engineering Conference and
the ACM SIGSOFT Symposium on the Foundations of Software Engineering (ESEC/FSE’15).
; 2015:974--977. doi:10.1145/2786805.2803181'
apa: Börding, P., Bruns, M., & Platenius, M. C. (2015). Comprehensive Service
Matching with MatchBox. In 10th Joint Meeting of the European Software Engineering
Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering
(ESEC/FSE’15) (pp. 974--977). https://doi.org/10.1145/2786805.2803181
bibtex: '@inproceedings{Börding_Bruns_Platenius_2015, title={Comprehensive Service
Matching with MatchBox}, DOI={10.1145/2786805.2803181},
booktitle={10th Joint Meeting of the European Software Engineering Conference
and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (ESEC/FSE’15)},
author={Börding, Paul and Bruns, Melanie and Platenius, Marie Christin}, year={2015},
pages={974--977} }'
chicago: Börding, Paul, Melanie Bruns, and Marie Christin Platenius. “Comprehensive
Service Matching with MatchBox.” In 10th Joint Meeting of the European Software
Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software
Engineering (ESEC/FSE’15), 974--977, 2015. https://doi.org/10.1145/2786805.2803181.
ieee: P. Börding, M. Bruns, and M. C. Platenius, “Comprehensive Service Matching
with MatchBox,” in 10th Joint Meeting of the European Software Engineering
Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering
(ESEC/FSE’15), 2015, pp. 974--977.
mla: Börding, Paul, et al. “Comprehensive Service Matching with MatchBox.” 10th
Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT
Symposium on the Foundations of Software Engineering (ESEC/FSE’15), 2015,
pp. 974--977, doi:10.1145/2786805.2803181.
short: 'P. Börding, M. Bruns, M.C. Platenius, in: 10th Joint Meeting of the European
Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations
of Software Engineering (ESEC/FSE’15), 2015, pp. 974--977.'
date_created: 2017-10-17T12:41:53Z
date_updated: 2022-01-06T06:58:58Z
ddc:
- '040'
department:
- _id: '76'
doi: 10.1145/2786805.2803181
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:44:26Z
date_updated: 2018-03-20T07:44:26Z
file_id: '1438'
file_name: 313-p974-boerding.pdf
file_size: 875687
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:44:26Z
has_accepted_license: '1'
language:
- iso: eng
page: 974--977
project:
- _id: '1'
name: SFB 901
- _id: '9'
name: SFB 901 - Subprojekt B1
- _id: '3'
name: SFB 901 - Project Area B
publication: 10th Joint Meeting of the European Software Engineering Conference and
the ACM SIGSOFT Symposium on the Foundations of Software Engineering (ESEC/FSE'15)
status: public
title: Comprehensive Service Matching with MatchBox
type: conference
user_id: '477'
year: '2015'
...
---
_id: '316'
author:
- first_name: Jannis
full_name: Pautz, Jannis
last_name: Pautz
citation:
ama: Pautz J. Budget Games with Priced Strategies. Universität Paderborn;
2015.
apa: Pautz, J. (2015). Budget Games with priced strategies. Universität Paderborn.
bibtex: '@book{Pautz_2015, title={Budget Games with priced strategies}, publisher={Universität
Paderborn}, author={Pautz, Jannis}, year={2015} }'
chicago: Pautz, Jannis. Budget Games with Priced Strategies. Universität
Paderborn, 2015.
ieee: J. Pautz, Budget Games with priced strategies. Universität Paderborn,
2015.
mla: Pautz, Jannis. Budget Games with Priced Strategies. Universität Paderborn,
2015.
short: J. Pautz, Budget Games with Priced Strategies, Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:53Z
date_updated: 2022-01-06T06:59:01Z
department:
- _id: '63'
- _id: '541'
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
title: Budget Games with priced strategies
type: bachelorsthesis
user_id: '14052'
year: '2015'
...
---
_id: '3162'
author:
- first_name: Steffen
full_name: Ziegert, Steffen
last_name: Ziegert
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: Ziegert S, Wehrheim H. Temporal plans for software architecture reconfiguration.
Computer Science - R & D. 2015;(3-4):303--320. doi:10.1007/s00450-014-0259-7
apa: Ziegert, S., & Wehrheim, H. (2015). Temporal plans for software architecture
reconfiguration. Computer Science - R & D, (3–4), 303--320. https://doi.org/10.1007/s00450-014-0259-7
bibtex: '@article{Ziegert_Wehrheim_2015, title={Temporal plans for software architecture
reconfiguration}, DOI={10.1007/s00450-014-0259-7},
number={3–4}, journal={Computer Science - R & D}, author={Ziegert, Steffen
and Wehrheim, Heike}, year={2015}, pages={303--320} }'
chicago: 'Ziegert, Steffen, and Heike Wehrheim. “Temporal Plans for Software Architecture
Reconfiguration.” Computer Science - R & D, no. 3–4 (2015): 303--320.
https://doi.org/10.1007/s00450-014-0259-7.'
ieee: S. Ziegert and H. Wehrheim, “Temporal plans for software architecture reconfiguration,”
Computer Science - R & D, no. 3–4, pp. 303--320, 2015.
mla: Ziegert, Steffen, and Heike Wehrheim. “Temporal Plans for Software Architecture
Reconfiguration.” Computer Science - R & D, no. 3–4, 2015, pp. 303--320,
doi:10.1007/s00450-014-0259-7.
short: S. Ziegert, H. Wehrheim, Computer Science - R & D (2015) 303--320.
date_created: 2018-06-13T07:47:56Z
date_updated: 2022-01-06T06:59:01Z
ddc:
- '000'
department:
- _id: '77'
doi: 10.1007/s00450-014-0259-7
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:52:13Z
date_updated: 2018-11-02T15:52:13Z
file_id: '5315'
file_name: TemporalPlansForSoftwareArchit.pdf
file_size: 2136451
relation: main_file
success: 1
file_date_updated: 2018-11-02T15:52:13Z
has_accepted_license: '1'
issue: 3-4
language:
- iso: eng
page: 303--320
project:
- _id: '3'
name: SFB 901 - Project Area B
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subproject B3
publication: Computer Science - R & D
status: public
title: Temporal plans for software architecture reconfiguration
type: journal_article
user_id: '477'
year: '2015'
...
---
_id: '3163'
author:
- first_name: Roland
full_name: Meyer, Roland
last_name: Meyer
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Meyer R, Wehrheim H. From Program Verification to Time and Space: The Scientific
Life of Ernst-R{\"{u}}diger Olderog. In: Meyer R, Platzer A, Wehrheim H, eds.
Correct System Design - Symposium in Honor of Ernst-R{\"{u}}diger Olderog on
the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings.
Lecture Notes in Computer Science. ; 2015:3--4. doi:10.1007/978-3-319-23506-6_1'
apa: 'Meyer, R., & Wehrheim, H. (2015). From Program Verification to Time and
Space: The Scientific Life of Ernst-R{\"{u}}diger Olderog. In R. Meyer, A. Platzer,
& H. Wehrheim (Eds.), Correct System Design - Symposium in Honor of Ernst-R{\"{u}}diger
Olderog on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9,
2015. Proceedings (pp. 3--4). https://doi.org/10.1007/978-3-319-23506-6_1'
bibtex: '@inproceedings{Meyer_Wehrheim_2015, series={Lecture Notes in Computer Science},
title={From Program Verification to Time and Space: The Scientific Life of Ernst-R{\"{u}}diger
Olderog}, DOI={10.1007/978-3-319-23506-6_1},
booktitle={Correct System Design - Symposium in Honor of Ernst-R{\"{u}}diger Olderog
on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015.
Proceedings}, author={Meyer, Roland and Wehrheim, Heike}, editor={Meyer, Roland
and Platzer, Andr{\’{e}} and Wehrheim, HeikeEditors}, year={2015}, pages={3--4},
collection={Lecture Notes in Computer Science} }'
chicago: 'Meyer, Roland, and Heike Wehrheim. “From Program Verification to Time
and Space: The Scientific Life of Ernst-R{\"{u}}diger Olderog.” In Correct
System Design - Symposium in Honor of Ernst-R{\"{u}}diger Olderog on the Occasion
of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings,
edited by Roland Meyer, Andr{\’{e}} Platzer, and Heike Wehrheim, 3--4. Lecture
Notes in Computer Science, 2015. https://doi.org/10.1007/978-3-319-23506-6_1.'
ieee: 'R. Meyer and H. Wehrheim, “From Program Verification to Time and Space: The
Scientific Life of Ernst-R{\"{u}}diger Olderog,” in Correct System Design -
Symposium in Honor of Ernst-R{\"{u}}diger Olderog on the Occasion of His 60th
Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings, 2015, pp.
3--4.'
mla: 'Meyer, Roland, and Heike Wehrheim. “From Program Verification to Time and
Space: The Scientific Life of Ernst-R{\"{u}}diger Olderog.” Correct System
Design - Symposium in Honor of Ernst-R{\"{u}}diger Olderog on the Occasion of
His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings, edited
by Roland Meyer et al., 2015, pp. 3--4, doi:10.1007/978-3-319-23506-6_1.'
short: 'R. Meyer, H. Wehrheim, in: R. Meyer, A. Platzer, H. Wehrheim (Eds.), Correct
System Design - Symposium in Honor of Ernst-R{\"{u}}diger Olderog on the Occasion
of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings, 2015,
pp. 3--4.'
date_created: 2018-06-13T07:49:28Z
date_updated: 2022-01-06T06:59:01Z
department:
- _id: '77'
doi: 10.1007/978-3-319-23506-6_1
editor:
- first_name: Roland
full_name: Meyer, Roland
last_name: Meyer
- first_name: Andr{\'{e}}
full_name: Platzer, Andr{\'{e}}
last_name: Platzer
- first_name: Heike
full_name: Wehrheim, Heike
last_name: Wehrheim
page: 3--4
publication: Correct System Design - Symposium in Honor of Ernst-R{\"{u}}diger Olderog
on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings
series_title: Lecture Notes in Computer Science
status: public
title: 'From Program Verification to Time and Space: The Scientific Life of Ernst-R{\"{u}}diger
Olderog'
type: conference
user_id: '29719'
year: '2015'
...
---
_id: '3164'
author:
- first_name: John
full_name: Derrick, John
last_name: Derrick
- first_name: Brijesh
full_name: Dongol, Brijesh
last_name: Dongol
- first_name: Gerhard
full_name: Schellhorn, Gerhard
last_name: Schellhorn
- first_name: Oleg
full_name: Travkin, Oleg
last_name: Travkin
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Derrick J, Dongol B, Schellhorn G, Travkin O, Wehrheim H. Verifying Opacity
of a Transactional Mutex Lock. In: Bj{\o}rner N, S. de Boer F, eds. {FM} 2015:
Formal Methods - 20th International Symposium, Oslo, Norway, June 24-26, 2015,
Proceedings. Lecture Notes in Computer Science. ; 2015:161--177. doi:10.1007/978-3-319-19249-9_11'
apa: 'Derrick, J., Dongol, B., Schellhorn, G., Travkin, O., & Wehrheim, H. (2015).
Verifying Opacity of a Transactional Mutex Lock. In N. Bj{\o}rner & F. S.
de Boer (Eds.), {FM} 2015: Formal Methods - 20th International Symposium, Oslo,
Norway, June 24-26, 2015, Proceedings (pp. 161--177). https://doi.org/10.1007/978-3-319-19249-9_11'
bibtex: '@inproceedings{Derrick_Dongol_Schellhorn_Travkin_Wehrheim_2015, series={Lecture
Notes in Computer Science}, title={Verifying Opacity of a Transactional Mutex
Lock}, DOI={10.1007/978-3-319-19249-9_11},
booktitle={{FM} 2015: Formal Methods - 20th International Symposium, Oslo, Norway,
June 24-26, 2015, Proceedings}, author={Derrick, John and Dongol, Brijesh and
Schellhorn, Gerhard and Travkin, Oleg and Wehrheim, Heike}, editor={Bj{\o}rner,
Nikolaj and S. de Boer, FrankEditors}, year={2015}, pages={161--177}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Derrick, John, Brijesh Dongol, Gerhard Schellhorn, Oleg Travkin, and Heike
Wehrheim. “Verifying Opacity of a Transactional Mutex Lock.” In {FM} 2015:
Formal Methods - 20th International Symposium, Oslo, Norway, June 24-26, 2015,
Proceedings, edited by Nikolaj Bj{\o}rner and Frank S. de Boer, 161--177.
Lecture Notes in Computer Science, 2015. https://doi.org/10.1007/978-3-319-19249-9_11.'
ieee: 'J. Derrick, B. Dongol, G. Schellhorn, O. Travkin, and H. Wehrheim, “Verifying
Opacity of a Transactional Mutex Lock,” in {FM} 2015: Formal Methods - 20th
International Symposium, Oslo, Norway, June 24-26, 2015, Proceedings, 2015,
pp. 161--177.'
mla: 'Derrick, John, et al. “Verifying Opacity of a Transactional Mutex Lock.” {FM}
2015: Formal Methods - 20th International Symposium, Oslo, Norway, June 24-26,
2015, Proceedings, edited by Nikolaj Bj{\o}rner and Frank S. de Boer, 2015,
pp. 161--177, doi:10.1007/978-3-319-19249-9_11.'
short: 'J. Derrick, B. Dongol, G. Schellhorn, O. Travkin, H. Wehrheim, in: N. Bj{\o}rner,
F. S. de Boer (Eds.), {FM} 2015: Formal Methods - 20th International Symposium,
Oslo, Norway, June 24-26, 2015, Proceedings, 2015, pp. 161--177.'
date_created: 2018-06-13T07:50:43Z
date_updated: 2022-01-06T06:59:01Z
department:
- _id: '77'
doi: 10.1007/978-3-319-19249-9_11
editor:
- first_name: Nikolaj
full_name: Bj{\o}rner, Nikolaj
last_name: Bj{\o}rner
- first_name: Frank
full_name: S. de Boer, Frank
last_name: S. de Boer
page: 161--177
project:
- _id: '78'
name: Validation of Software Transactional Memory
publication: '{FM} 2015: Formal Methods - 20th International Symposium, Oslo, Norway,
June 24-26, 2015, Proceedings'
series_title: Lecture Notes in Computer Science
status: public
title: Verifying Opacity of a Transactional Mutex Lock
type: conference
user_id: '29719'
year: '2015'
...
---
_id: '3165'
author:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
- first_name: Oleg
full_name: Travkin, Oleg
last_name: Travkin
citation:
ama: 'Wehrheim H, Travkin O. {TSO} to {SC} via Symbolic Execution. In: Piterman
N, ed. Hardware and Software: Verification and Testing - 11th International
Haifa Verification Conference, {HVC} 2015, Haifa, Israel, November 17-19, 2015,
Proceedings. Lecture Notes in Computer Science. ; 2015:104--119. doi:10.1007/978-3-319-26287-1_7'
apa: 'Wehrheim, H., & Travkin, O. (2015). {TSO} to {SC} via Symbolic Execution.
In N. Piterman (Ed.), Hardware and Software: Verification and Testing - 11th
International Haifa Verification Conference, {HVC} 2015, Haifa, Israel, November
17-19, 2015, Proceedings (pp. 104--119). https://doi.org/10.1007/978-3-319-26287-1_7'
bibtex: '@inproceedings{Wehrheim_Travkin_2015, series={Lecture Notes in Computer
Science}, title={{TSO} to {SC} via Symbolic Execution}, DOI={10.1007/978-3-319-26287-1_7},
booktitle={Hardware and Software: Verification and Testing - 11th International
Haifa Verification Conference, {HVC} 2015, Haifa, Israel, November 17-19, 2015,
Proceedings}, author={Wehrheim, Heike and Travkin, Oleg}, editor={Piterman, NirEditor},
year={2015}, pages={104--119}, collection={Lecture Notes in Computer Science}
}'
chicago: 'Wehrheim, Heike, and Oleg Travkin. “{TSO} to {SC} via Symbolic Execution.”
In Hardware and Software: Verification and Testing - 11th International Haifa
Verification Conference, {HVC} 2015, Haifa, Israel, November 17-19, 2015, Proceedings,
edited by Nir Piterman, 104--119. Lecture Notes in Computer Science, 2015. https://doi.org/10.1007/978-3-319-26287-1_7.'
ieee: 'H. Wehrheim and O. Travkin, “{TSO} to {SC} via Symbolic Execution,” in Hardware
and Software: Verification and Testing - 11th International Haifa Verification
Conference, {HVC} 2015, Haifa, Israel, November 17-19, 2015, Proceedings,
2015, pp. 104--119.'
mla: 'Wehrheim, Heike, and Oleg Travkin. “{TSO} to {SC} via Symbolic Execution.”
Hardware and Software: Verification and Testing - 11th International Haifa
Verification Conference, {HVC} 2015, Haifa, Israel, November 17-19, 2015, Proceedings,
edited by Nir Piterman, 2015, pp. 104--119, doi:10.1007/978-3-319-26287-1_7.'
short: 'H. Wehrheim, O. Travkin, in: N. Piterman (Ed.), Hardware and Software: Verification
and Testing - 11th International Haifa Verification Conference, {HVC} 2015, Haifa,
Israel, November 17-19, 2015, Proceedings, 2015, pp. 104--119.'
date_created: 2018-06-13T07:52:44Z
date_updated: 2022-01-06T06:59:01Z
department:
- _id: '77'
doi: 10.1007/978-3-319-26287-1_7
editor:
- first_name: Nir
full_name: Piterman, Nir
last_name: Piterman
page: 104--119
publication: 'Hardware and Software: Verification and Testing - 11th International
Haifa Verification Conference, {HVC} 2015, Haifa, Israel, November 17-19, 2015,
Proceedings'
series_title: Lecture Notes in Computer Science
status: public
title: '{TSO} to {SC} via Symbolic Execution'
type: conference
user_id: '29719'
year: '2015'
...
---
_id: '3166'
citation:
ama: Meyer R, Platzer A, Wehrheim H, eds. Correct System Design - Symposium in
Honor of Ernst-R{\"{u}}diger Olderog on the Occasion of His 60th Birthday, Oldenburg,
Germany, September 8-9, 2015. Proceedings.; 2015. doi:10.1007/978-3-319-23506-6
apa: Meyer, R., Platzer, A., & Wehrheim, H. (Eds.). (2015). Correct System
Design - Symposium in Honor of Ernst-R{\"{u}}diger Olderog on the Occasion of
His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings. https://doi.org/10.1007/978-3-319-23506-6
bibtex: '@book{Meyer_Platzer_Wehrheim_2015, series={Lecture Notes in Computer Science},
title={Correct System Design - Symposium in Honor of Ernst-R{\"{u}}diger Olderog
on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015.
Proceedings}, DOI={10.1007/978-3-319-23506-6},
year={2015}, collection={Lecture Notes in Computer Science} }'
chicago: Meyer, Roland, Andr{\’{e}} Platzer, and Heike Wehrheim, eds. Correct
System Design - Symposium in Honor of Ernst-R{\"{u}}diger Olderog on the Occasion
of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings.
Lecture Notes in Computer Science, 2015. https://doi.org/10.1007/978-3-319-23506-6.
ieee: R. Meyer, A. Platzer, and H. Wehrheim, Eds., Correct System Design - Symposium
in Honor of Ernst-R{\"{u}}diger Olderog on the Occasion of His 60th Birthday,
Oldenburg, Germany, September 8-9, 2015. Proceedings. 2015.
mla: Meyer, Roland, et al., editors. Correct System Design - Symposium in Honor
of Ernst-R{\"{u}}diger Olderog on the Occasion of His 60th Birthday, Oldenburg,
Germany, September 8-9, 2015. Proceedings. 2015, doi:10.1007/978-3-319-23506-6.
short: R. Meyer, A. Platzer, H. Wehrheim, eds., Correct System Design - Symposium
in Honor of Ernst-R{\"{u}}diger Olderog on the Occasion of His 60th Birthday,
Oldenburg, Germany, September 8-9, 2015. Proceedings, 2015.
date_created: 2018-06-13T07:54:06Z
date_updated: 2022-01-06T06:59:01Z
department:
- _id: '77'
doi: 10.1007/978-3-319-23506-6
editor:
- first_name: Roland
full_name: Meyer, Roland
last_name: Meyer
- first_name: Andr{\'{e}}
full_name: Platzer, Andr{\'{e}}
last_name: Platzer
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
publication_identifier:
isbn:
- 978-3-319-23505-9
series_title: Lecture Notes in Computer Science
status: public
title: Correct System Design - Symposium in Honor of Ernst-R{\"{u}}diger Olderog on
the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings
type: conference_editor
user_id: '29719'
year: '2015'
...
---
_id: '317'
author:
- first_name: Claudius
full_name: Jähn, Claudius
last_name: Jähn
citation:
ama: Jähn C. Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen.
Universität Paderborn; 2015.
apa: Jähn, C. (2015). Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen.
Universität Paderborn.
bibtex: '@book{Jähn_2015, title={Bewertung von Renderingalgorithmen für komplexe
3-D-Szenen}, publisher={Universität Paderborn}, author={Jähn, Claudius}, year={2015}
}'
chicago: Jähn, Claudius. Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen.
Universität Paderborn, 2015.
ieee: C. Jähn, Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen.
Universität Paderborn, 2015.
mla: Jähn, Claudius. Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen.
Universität Paderborn, 2015.
short: C. Jähn, Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen, Universität
Paderborn, 2015.
date_created: 2017-10-17T12:41:53Z
date_updated: 2022-01-06T06:59:02Z
ddc:
- '040'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:20:34Z
date_updated: 2018-03-21T09:20:34Z
file_id: '1462'
file_name: 317-Dissertation_ClaudiusJaehn.pdf
file_size: 20442332
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:20:34Z
has_accepted_license: '1'
language:
- iso: ger
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen
type: dissertation
user_id: '14052'
year: '2015'
...
---
_id: '318'
author:
- first_name: Zille
full_name: Huma, Zille
last_name: Huma
citation:
ama: Huma Z. Automatic Service Discovery and Composition for Heterogeneous Service
Partners. Universität Paderborn; 2015.
apa: Huma, Z. (2015). Automatic Service Discovery and Composition for heterogeneous
service partners. Universität Paderborn.
bibtex: '@book{Huma_2015, title={Automatic Service Discovery and Composition for
heterogeneous service partners}, publisher={Universität Paderborn}, author={Huma,
Zille}, year={2015} }'
chicago: Huma, Zille. Automatic Service Discovery and Composition for Heterogeneous
Service Partners. Universität Paderborn, 2015.
ieee: Z. Huma, Automatic Service Discovery and Composition for heterogeneous
service partners. Universität Paderborn, 2015.
mla: Huma, Zille. Automatic Service Discovery and Composition for Heterogeneous
Service Partners. Universität Paderborn, 2015.
short: Z. Huma, Automatic Service Discovery and Composition for Heterogeneous Service
Partners, Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:54Z
date_updated: 2022-01-06T06:59:03Z
ddc:
- '040'
department:
- _id: '66'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:42:30Z
date_updated: 2018-03-20T07:42:30Z
file_id: '1435'
file_name: 318-Dissertation_-_Huma.pdf
file_size: 8011875
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:42:30Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '9'
name: SFB 901 - Subprojekt B1
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
title: Automatic Service Discovery and Composition for heterogeneous service partners
type: dissertation
user_id: '477'
year: '2015'
...
---
_id: '319'
abstract:
- lang: eng
text: Services are self-contained and platform independent software components that
aim at maximizing software reuse. The automated composition of services to a target
software artifact has been tackled with many AI techniques, but existing approaches
make unreasonably strong assumptions such as a predefined data flow, are limited
to tiny problem sizes, ignore non-functional properties, or assume offline service
repositories. This paper presents an algorithm that automatically composes services
without making such assumptions. We employ a backward search algorithm that starts
from an empty composition and prepends service calls to already discovered candidates
until a solution is found. Available services are determined during the search
process. We implemented our algorithm, performed an experimental evaluation, and
compared it to other approaches.
author:
- first_name: Felix
full_name: Mohr, Felix
last_name: Mohr
- first_name: Alexander
full_name: Jungmann, Alexander
last_name: Jungmann
- first_name: Hans
full_name: Kleine Büning, Hans
last_name: Kleine Büning
citation:
ama: 'Mohr F, Jungmann A, Kleine Büning H. Automated Online Service Composition.
In: Proceedings of the 12th IEEE International Conference on Services Computing
(SCC). ; 2015:57--64. doi:10.1109/SCC.2015.18'
apa: Mohr, F., Jungmann, A., & Kleine Büning, H. (2015). Automated Online Service
Composition. In Proceedings of the 12th IEEE International Conference on Services
Computing (SCC) (pp. 57--64). https://doi.org/10.1109/SCC.2015.18
bibtex: '@inproceedings{Mohr_Jungmann_Kleine Büning_2015, title={Automated Online
Service Composition}, DOI={10.1109/SCC.2015.18},
booktitle={Proceedings of the 12th IEEE International Conference on Services Computing
(SCC)}, author={Mohr, Felix and Jungmann, Alexander and Kleine Büning, Hans},
year={2015}, pages={57--64} }'
chicago: Mohr, Felix, Alexander Jungmann, and Hans Kleine Büning. “Automated Online
Service Composition.” In Proceedings of the 12th IEEE International Conference
on Services Computing (SCC), 57--64, 2015. https://doi.org/10.1109/SCC.2015.18.
ieee: F. Mohr, A. Jungmann, and H. Kleine Büning, “Automated Online Service Composition,”
in Proceedings of the 12th IEEE International Conference on Services Computing
(SCC), 2015, pp. 57--64.
mla: Mohr, Felix, et al. “Automated Online Service Composition.” Proceedings
of the 12th IEEE International Conference on Services Computing (SCC), 2015,
pp. 57--64, doi:10.1109/SCC.2015.18.
short: 'F. Mohr, A. Jungmann, H. Kleine Büning, in: Proceedings of the 12th IEEE
International Conference on Services Computing (SCC), 2015, pp. 57--64.'
date_created: 2017-10-17T12:41:54Z
date_updated: 2022-01-06T06:59:04Z
ddc:
- '040'
department:
- _id: '355'
doi: 10.1109/SCC.2015.18
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:42:03Z
date_updated: 2018-03-20T07:42:03Z
file_id: '1434'
file_name: 319-07207336.pdf
file_size: 345742
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:42:03Z
has_accepted_license: '1'
language:
- iso: eng
page: 57--64
project:
- _id: '1'
name: SFB 901
- _id: '10'
name: SFB 901 - Subprojekt B2
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 12th IEEE International Conference on Services Computing
(SCC)
status: public
title: Automated Online Service Composition
type: conference
user_id: '477'
year: '2015'
...
---
_id: '270'
author:
- first_name: Sebastian
full_name: Abshoff, Sebastian
last_name: Abshoff
citation:
ama: Abshoff S. On the Complexity of Fundamental Problems in Dynamic Ad-Hoc Networks.
Universität Paderborn; 2015.
apa: Abshoff, S. (2015). On the Complexity of Fundamental Problems in Dynamic
Ad-hoc Networks. Universität Paderborn.
bibtex: '@book{Abshoff_2015, title={On the Complexity of Fundamental Problems in
Dynamic Ad-hoc Networks}, publisher={Universität Paderborn}, author={Abshoff,
Sebastian}, year={2015} }'
chicago: Abshoff, Sebastian. On the Complexity of Fundamental Problems in Dynamic
Ad-Hoc Networks. Universität Paderborn, 2015.
ieee: S. Abshoff, On the Complexity of Fundamental Problems in Dynamic Ad-hoc
Networks. Universität Paderborn, 2015.
mla: Abshoff, Sebastian. On the Complexity of Fundamental Problems in Dynamic
Ad-Hoc Networks. Universität Paderborn, 2015.
short: S. Abshoff, On the Complexity of Fundamental Problems in Dynamic Ad-Hoc Networks,
Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:44Z
date_updated: 2022-01-06T06:57:32Z
ddc:
- '040'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:30:02Z
date_updated: 2018-03-21T09:30:02Z
file_id: '1476'
file_name: 270-Dissertation_-_Abshoff.pdf
file_size: 448614
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:30:02Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: On the Complexity of Fundamental Problems in Dynamic Ad-hoc Networks
type: dissertation
user_id: '477'
year: '2015'
...
---
_id: '271'
abstract:
- lang: eng
text: In \emph{bandwidth allocation games} (BAGs), the strategy of a player consists
of various demands on different resources. The player's utility is at most the
sum of these demands, provided they are fully satisfied. Every resource has a
limited capacity and if it is exceeded by the total demand, it has to be split
between the players. Since these games generally do not have pure Nash equilibria,
we consider approximate pure Nash equilibria, in which no player can improve her
utility by more than some fixed factor $\alpha$ through unilateral strategy changes.
There is a threshold $\alpha_\delta$ (where $\delta$ is a parameter that limits
the demand of each player on a specific resource) such that $\alpha$-approximate
pure Nash equilibria always exist for $\alpha \geq \alpha_\delta$, but not for
$\alpha < \alpha_\delta$. We give both upper and lower bounds on this threshold
$\alpha_\delta$ and show that the corresponding decision problem is ${\sf NP}$-hard.
We also show that the $\alpha$-approximate price of anarchy for BAGs is $\alpha+1$.
For a restricted version of the game, where demands of players only differ slightly
from each other (e.g. symmetric games), we show that approximate Nash equilibria
can be reached (and thus also be computed) in polynomial time using the best-response
dynamic. Finally, we show that a broader class of utility-maximization games (which
includes BAGs) converges quickly towards states whose social welfare is close
to the optimum.
author:
- first_name: Maximilian
full_name: Drees, Maximilian
last_name: Drees
- first_name: Matthias
full_name: Feldotto, Matthias
id: '14052'
last_name: Feldotto
orcid: 0000-0003-1348-6516
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: 'Drees M, Feldotto M, Riechers S, Skopalik A. On Existence and Properties of
Approximate Pure Nash Equilibria in Bandwidth Allocation Games. In: Proceedings
of the 8th International Symposium on Algorithmic Game Theory (SAGT). Lecture
Notes in Computer Science. ; 2015:178-189. doi:10.1007/978-3-662-48433-3_14'
apa: Drees, M., Feldotto, M., Riechers, S., & Skopalik, A. (2015). On Existence
and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games.
In Proceedings of the 8th International Symposium on Algorithmic Game Theory
(SAGT) (pp. 178–189). https://doi.org/10.1007/978-3-662-48433-3_14
bibtex: '@inproceedings{Drees_Feldotto_Riechers_Skopalik_2015, series={Lecture Notes
in Computer Science}, title={On Existence and Properties of Approximate Pure Nash
Equilibria in Bandwidth Allocation Games}, DOI={10.1007/978-3-662-48433-3_14},
booktitle={Proceedings of the 8th International Symposium on Algorithmic Game
Theory (SAGT)}, author={Drees, Maximilian and Feldotto, Matthias and Riechers,
Sören and Skopalik, Alexander}, year={2015}, pages={178–189}, collection={Lecture
Notes in Computer Science} }'
chicago: Drees, Maximilian, Matthias Feldotto, Sören Riechers, and Alexander Skopalik.
“On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth
Allocation Games.” In Proceedings of the 8th International Symposium on Algorithmic
Game Theory (SAGT), 178–89. Lecture Notes in Computer Science, 2015. https://doi.org/10.1007/978-3-662-48433-3_14.
ieee: M. Drees, M. Feldotto, S. Riechers, and A. Skopalik, “On Existence and Properties
of Approximate Pure Nash Equilibria in Bandwidth Allocation Games,” in Proceedings
of the 8th International Symposium on Algorithmic Game Theory (SAGT), 2015,
pp. 178–189.
mla: Drees, Maximilian, et al. “On Existence and Properties of Approximate Pure
Nash Equilibria in Bandwidth Allocation Games.” Proceedings of the 8th International
Symposium on Algorithmic Game Theory (SAGT), 2015, pp. 178–89, doi:10.1007/978-3-662-48433-3_14.
short: 'M. Drees, M. Feldotto, S. Riechers, A. Skopalik, in: Proceedings of the
8th International Symposium on Algorithmic Game Theory (SAGT), 2015, pp. 178–189.'
date_created: 2017-10-17T12:41:45Z
date_updated: 2022-01-06T06:57:34Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
doi: 10.1007/978-3-662-48433-3_14
external_id:
arxiv:
- '1507.02908'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:29:34Z
date_updated: 2018-03-21T09:29:34Z
file_id: '1475'
file_name: 271-chp_3A10.1007_2F978-3-662-48433-3_14.pdf
file_size: 256718
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:29:34Z
has_accepted_license: '1'
page: 178-189
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '16'
name: SFB 901 - Subproject C4
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 8th International Symposium on Algorithmic Game Theory
(SAGT)
series_title: Lecture Notes in Computer Science
status: public
title: On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth
Allocation Games
type: conference
user_id: '14052'
year: '2015'
...
---
_id: '27163'
author:
- first_name: ' Reinhard '
full_name: 'Keil, Reinhard '
last_name: Keil
- first_name: Harald
full_name: Selke, Harald
id: '497'
last_name: Selke
citation:
ama: 'Keil Reinhard , Selke H. Virtual knowledge {\ “a} ume - From the presentation
of content to virtual learning {\” a} tten. In: Keil R, Selke Harald, eds. Vol
330. publishing series of the Heinz Nixdorf Institute, Paderborn; 2015:39-53.'
apa: Keil, Reinhard , & Selke, H. (2015). Virtual knowledge {\ “a} ume -
From the presentation of content to virtual learning {\” a} tten (R. Keil
& Harald Selke, Eds.; Vol. 330, pp. 39–53). publishing series of the Heinz
Nixdorf Institute, Paderborn.
bibtex: '@inproceedings{Keil_Selke_2015, title={Virtual knowledge {\ “a} ume - From
the presentation of content to virtual learning {\” a} tten}, volume={330}, publisher={publishing
series of the Heinz Nixdorf Institute, Paderborn}, author={Keil, Reinhard and
Selke, Harald}, editor={Keil, Reinhard and Selke, Harald}, year={2015}, pages={39–53}
}'
chicago: Keil, Reinhard , and Harald Selke. “Virtual Knowledge {\ ‘A} Ume - From
the Presentation of Content to Virtual Learning {\’ A} Tten.” edited by Reinhard Keil
and Harald Selke, 330:39–53. publishing series of the Heinz Nixdorf Institute,
Paderborn, 2015.
ieee: Reinhard Keil and H. Selke, “Virtual knowledge {\ ‘a} ume - From the presentation
of content to virtual learning {\’ a} tten,” 2015, vol. 330, pp. 39–53.
mla: Keil, Reinhard , and Harald Selke. Virtual Knowledge {\ “A} Ume - From
the Presentation of Content to Virtual Learning {\” A} Tten. Edited by Reinhard Keil
and Harald Selke, vol. 330, publishing series of the Heinz Nixdorf Institute,
Paderborn, 2015, pp. 39–53.
short: 'Reinhard Keil, H. Selke, in: R. Keil, Harald Selke (Eds.), publishing
series of the Heinz Nixdorf Institute, Paderborn, 2015, pp. 39–53.'
date_created: 2021-11-05T22:48:51Z
date_updated: 2022-01-06T06:57:35Z
department:
- _id: '71'
editor:
- first_name: 'Reinhard '
full_name: 'Keil, Reinhard '
last_name: Keil
- first_name: ' Harald'
full_name: Selke, Harald
last_name: Selke
intvolume: ' 330'
language:
- iso: eng
page: 39-53
publication_status: published
publisher: publishing series of the Heinz Nixdorf Institute, Paderborn
status: public
title: Virtual knowledge {\ "a} ume - From the presentation of content to virtual
learning {\" a} tten
type: conference
user_id: '71124'
volume: 330
year: '2015'
...
---
_id: '27164'
author:
- first_name: Florian
full_name: Klompmaker, Florian
last_name: Klompmaker
citation:
ama: Klompmaker F. Development of a Structured Process of Interaction Design
for {\ “U} r Nat {\” U} Local User Interfaces. Universitaetsbibliothek Paderborn;
2015.
apa: Klompmaker, F. (2015). Development of a structured process of interaction
design for {\ “u} r nat {\” u} local user interfaces. Universitaetsbibliothek
Paderborn.
bibtex: '@book{Klompmaker_2015, place={Universit {\ "a} t Paderborn, Heinz Nixdorf
Institute, Contextual Computer Science}, title={Development of a structured process
of interaction design for {\ “u} r nat {\” u} local user interfaces}, publisher={Universitaetsbibliothek
Paderborn}, author={Klompmaker, Florian}, year={2015} }'
chicago: 'Klompmaker, Florian. Development of a Structured Process of Interaction
Design for {\ “U} r Nat {\” U} Local User Interfaces. Universit {\ "a} t Paderborn,
Heinz Nixdorf Institute, Contextual Computer Science: Universitaetsbibliothek
Paderborn, 2015.'
ieee: 'F. Klompmaker, Development of a structured process of interaction design
for {\ “u} r nat {\” u} local user interfaces. Universit {\ "a} t Paderborn,
Heinz Nixdorf Institute, Contextual Computer Science: Universitaetsbibliothek
Paderborn, 2015.'
mla: Klompmaker, Florian. Development of a Structured Process of Interaction
Design for {\ “U} r Nat {\” U} Local User Interfaces. Universitaetsbibliothek
Paderborn, 2015.
short: F. Klompmaker, Development of a Structured Process of Interaction Design
for {\ “U} r Nat {\” U} Local User Interfaces, Universitaetsbibliothek Paderborn,
Universit {\ "a} t Paderborn, Heinz Nixdorf Institute, Contextual Computer Science,
2015.
date_created: 2021-11-05T22:52:55Z
date_updated: 2022-01-06T06:57:35Z
department:
- _id: '71'
language:
- iso: eng
place: Universit {\ "a} t Paderborn, Heinz Nixdorf Institute, Contextual Computer
Science
publisher: Universitaetsbibliothek Paderborn
status: public
title: Development of a structured process of interaction design for {\ "u} r nat
{\" u} local user interfaces
type: dissertation
user_id: '71124'
year: '2015'
...
---
_id: '27165'
abstract:
- lang: eng
text: Patterns serve to codify design knowledge. By embedding them in a hypothesis-driven
design, it is possible to develop them further into sample languages. For this
it is necessary to resolve the underlying conflicts in the form of design hypotheses
and to validate them empirically in order to enable further use and generalization.
In this article, an experiment is presented that describes this procedure and
demonstrates the interplay between theory formation and codification of design
knowledge using two examples.
author:
- first_name: ' Christian'
full_name: Schild, Christian
last_name: Schild
- first_name: Vanessa
full_name: ' Petrausch, Vanessa'
last_name: ' Petrausch'
citation:
ama: 'Schild Christian, Petrausch V. Empirical validation of design patterns .
In: De Gruyter Oldenbourg; 2015:173-182.'
apa: Schild, Christian, & Petrausch, V. (2015). Empirical validation of
design patterns . 173–182.
bibtex: '@inproceedings{Schild_ Petrausch_2015, place={Berlin}, title={Empirical
validation of design patterns }, publisher={De Gruyter Oldenbourg}, author={Schild, Christian
and Petrausch, Vanessa}, year={2015}, pages={173–182} }'
chicago: 'Schild, Christian, and Vanessa Petrausch. “Empirical Validation of Design
Patterns ,” 173–82. Berlin: De Gruyter Oldenbourg, 2015.'
ieee: Christian Schild and V. Petrausch, “Empirical validation of design patterns
,” 2015, pp. 173–182.
mla: Schild, Christian, and Vanessa Petrausch. Empirical Validation of Design
Patterns . De Gruyter Oldenbourg, 2015, pp. 173–82.
short: 'Christian Schild, V. Petrausch, in: De Gruyter Oldenbourg, Berlin, 2015,
pp. 173–182.'
date_created: 2021-11-05T22:57:59Z
date_updated: 2022-01-06T06:57:35Z
department:
- _id: '71'
language:
- iso: eng
page: 173-182
place: Berlin
publication_status: published
publisher: De Gruyter Oldenbourg
status: public
title: 'Empirical validation of design patterns '
type: conference
user_id: '71124'
year: '2015'
...
---
_id: '273'
author:
- first_name: Kathlén
full_name: Kohn, Kathlén
last_name: Kohn
citation:
ama: Kohn K. Number of Voronoi-Relevant Vectors in Lattices with Respect to Arbitrary
Norms. Universität Paderborn; 2015.
apa: Kohn, K. (2015). Number of Voronoi-relevant vectors in lattices with respect
to arbitrary norms. Universität Paderborn.
bibtex: '@book{Kohn_2015, title={Number of Voronoi-relevant vectors in lattices
with respect to arbitrary norms}, publisher={Universität Paderborn}, author={Kohn,
Kathlén}, year={2015} }'
chicago: Kohn, Kathlén. Number of Voronoi-Relevant Vectors in Lattices with Respect
to Arbitrary Norms. Universität Paderborn, 2015.
ieee: K. Kohn, Number of Voronoi-relevant vectors in lattices with respect to
arbitrary norms. Universität Paderborn, 2015.
mla: Kohn, Kathlén. Number of Voronoi-Relevant Vectors in Lattices with Respect
to Arbitrary Norms. Universität Paderborn, 2015.
short: K. Kohn, Number of Voronoi-Relevant Vectors in Lattices with Respect to Arbitrary
Norms, Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:45Z
date_updated: 2022-01-06T06:57:37Z
department:
- _id: '64'
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Number of Voronoi-relevant vectors in lattices with respect to arbitrary norms
type: mastersthesis
user_id: '477'
year: '2015'
...
---
_id: '274'
abstract:
- lang: eng
text: Consider the problem in which n jobs that are classified into k types are
to be scheduled on m identical machines without preemption. A machine requires
a proper setup taking s time units before processing jobs of a given type. The
objective is to minimize the makespan of the resulting schedule. We design and
analyze an approximation algorithm that runs in time polynomial in n,m and k and
computes a solution with an approximation factor that can be made arbitrarily
close to 3/2.
author:
- first_name: Alexander
full_name: Mäcker, Alexander
id: '13536'
last_name: Mäcker
- first_name: Manuel
full_name: Malatyali, Manuel
last_name: Malatyali
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
citation:
ama: 'Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Non-preemptive Scheduling
on Machines with Setup Times. In: Dehne F, Sack JR, Stege U, eds. Algorithms
and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada,
August 5-7, 2015. Proceedings. Lecture Notes in Computer Science. ; 2015:542--553.
doi:10.1007/978-3-319-21840-3_45'
apa: 'Mäcker, A., Malatyali, M., Meyer auf der Heide, F., & Riechers, S. (2015).
Non-preemptive Scheduling on Machines with Setup Times. In F. Dehne, J. R. Sack,
& U. Stege (Eds.), Algorithms and Data Structures: 14th International Symposium,
WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings (pp. 542--553).
https://doi.org/10.1007/978-3-319-21840-3_45'
bibtex: '@inproceedings{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2015, series={Lecture
Notes in Computer Science}, title={Non-preemptive Scheduling on Machines with
Setup Times}, DOI={10.1007/978-3-319-21840-3_45},
booktitle={Algorithms and Data Structures: 14th International Symposium, WADS
2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings}, author={Mäcker, Alexander
and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören},
editor={Dehne, Frank and Sack, Jörg Rüdiger and Stege, UlrikeEditors}, year={2015},
pages={542--553}, collection={Lecture Notes in Computer Science} }'
chicago: 'Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and
Sören Riechers. “Non-Preemptive Scheduling on Machines with Setup Times.” In Algorithms
and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada,
August 5-7, 2015. Proceedings, edited by Frank Dehne, Jörg Rüdiger Sack, and
Ulrike Stege, 542--553. Lecture Notes in Computer Science, 2015. https://doi.org/10.1007/978-3-319-21840-3_45.'
ieee: 'A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Non-preemptive
Scheduling on Machines with Setup Times,” in Algorithms and Data Structures:
14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015.
Proceedings, 2015, pp. 542--553.'
mla: 'Mäcker, Alexander, et al. “Non-Preemptive Scheduling on Machines with Setup
Times.” Algorithms and Data Structures: 14th International Symposium, WADS
2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings, edited by Frank
Dehne et al., 2015, pp. 542--553, doi:10.1007/978-3-319-21840-3_45.'
short: 'A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, in: F. Dehne,
J.R. Sack, U. Stege (Eds.), Algorithms and Data Structures: 14th International
Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings, 2015,
pp. 542--553.'
date_created: 2017-10-17T12:41:45Z
date_updated: 2022-01-06T06:57:39Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-319-21840-3_45
editor:
- first_name: Frank
full_name: Dehne, Frank
last_name: Dehne
- first_name: Jörg Rüdiger
full_name: Sack, Jörg Rüdiger
last_name: Sack
- first_name: Ulrike
full_name: Stege, Ulrike
last_name: Stege
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:28:34Z
date_updated: 2018-03-21T09:28:34Z
file_id: '1473'
file_name: 274-chp_3A10.1007_2F978-3-319-21840-3_45.pdf
file_size: 215498
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:28:34Z
has_accepted_license: '1'
page: 542--553
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '4'
name: SFB 901 - Project Area C
publication: 'Algorithms and Data Structures: 14th International Symposium, WADS 2015,
Victoria, BC, Canada, August 5-7, 2015. Proceedings'
series_title: Lecture Notes in Computer Science
status: public
title: Non-preemptive Scheduling on Machines with Setup Times
type: conference
user_id: '15504'
year: '2015'
...
---
_id: '275'
abstract:
- lang: eng
text: 'We investigate a non-cooperative game-theoretic model for the formation of
communication networks by selfish agents. Each agent aims for a central position
at minimum cost for creating edges. In particular, the general model (Fabrikant
et al., PODC''03) became popular for studying the structure of the Internet or
social networks. Despite its significance, locality in this game was first studied
only recently (Bilò et al., SPAA''14), where a worst case locality model was presented,
which came with a high efficiency loss in terms of quality of equilibria. Our
main contribution is a new and more optimistic view on locality: agents are limited
in their knowledge and actions to their local view ranges, but can probe different
strategies and finally choose the best. We study the influence of our locality
notion on the hardness of computing best responses, convergence to equilibria,
and quality of equilibria. Moreover, we compare the strength of local versus non-local
strategy changes. Our results address the gap between the original model and the
worst case locality variant. On the bright side, our efficiency results are in
line with observations from the original model, yet we have a non-constant lower
bound on the Price of Anarchy.'
author:
- first_name: Andreas
full_name: Cord-Landwehr, Andreas
last_name: Cord-Landwehr
- first_name: Pascal
full_name: Lenzner, Pascal
last_name: Lenzner
citation:
ama: 'Cord-Landwehr A, Lenzner P. Network Creation Games: Think Global - Act Local.
In: Proceedings of the 40th Conference on Mathematical Foundations of Computer
Science (MFCS). LNCS. ; 2015:248--260. doi:10.1007/978-3-662-48054-0_21'
apa: 'Cord-Landwehr, A., & Lenzner, P. (2015). Network Creation Games: Think
Global - Act Local. In Proceedings of the 40th Conference on Mathematical Foundations
of Computer Science (MFCS) (pp. 248--260). https://doi.org/10.1007/978-3-662-48054-0_21'
bibtex: '@inproceedings{Cord-Landwehr_Lenzner_2015, series={LNCS}, title={Network
Creation Games: Think Global - Act Local}, DOI={10.1007/978-3-662-48054-0_21},
booktitle={Proceedings of the 40th Conference on Mathematical Foundations of Computer
Science (MFCS)}, author={Cord-Landwehr, Andreas and Lenzner, Pascal}, year={2015},
pages={248--260}, collection={LNCS} }'
chicago: 'Cord-Landwehr, Andreas, and Pascal Lenzner. “Network Creation Games: Think
Global - Act Local.” In Proceedings of the 40th Conference on Mathematical
Foundations of Computer Science (MFCS), 248--260. LNCS, 2015. https://doi.org/10.1007/978-3-662-48054-0_21.'
ieee: 'A. Cord-Landwehr and P. Lenzner, “Network Creation Games: Think Global -
Act Local,” in Proceedings of the 40th Conference on Mathematical Foundations
of Computer Science (MFCS), 2015, pp. 248--260.'
mla: 'Cord-Landwehr, Andreas, and Pascal Lenzner. “Network Creation Games: Think
Global - Act Local.” Proceedings of the 40th Conference on Mathematical Foundations
of Computer Science (MFCS), 2015, pp. 248--260, doi:10.1007/978-3-662-48054-0_21.'
short: 'A. Cord-Landwehr, P. Lenzner, in: Proceedings of the 40th Conference on
Mathematical Foundations of Computer Science (MFCS), 2015, pp. 248--260.'
date_created: 2017-10-17T12:41:45Z
date_updated: 2022-01-06T06:57:40Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-662-48054-0_21
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:27:12Z
date_updated: 2018-03-21T09:27:12Z
file_id: '1472'
file_name: 275-978-3-662-48054-0_21.pdf
file_size: 279995
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:27:12Z
has_accepted_license: '1'
language:
- iso: eng
page: 248--260
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 40th Conference on Mathematical Foundations of Computer
Science (MFCS)
series_title: LNCS
status: public
title: 'Network Creation Games: Think Global - Act Local'
type: conference
user_id: '477'
year: '2015'
...
---
_id: '277'
author:
- first_name: Nils
full_name: Kothe, Nils
last_name: Kothe
citation:
ama: Kothe N. Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk.
Universität Paderborn; 2015.
apa: Kothe, N. (2015). Multilevel Netzwerk Spiele mit konstanten Entfernungen
im Highspeed-Netzwerk. Universität Paderborn.
bibtex: '@book{Kothe_2015, title={Multilevel Netzwerk Spiele mit konstanten Entfernungen
im Highspeed-Netzwerk}, publisher={Universität Paderborn}, author={Kothe, Nils},
year={2015} }'
chicago: Kothe, Nils. Multilevel Netzwerk Spiele mit konstanten Entfernungen
im Highspeed-Netzwerk. Universität Paderborn, 2015.
ieee: N. Kothe, Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk.
Universität Paderborn, 2015.
mla: Kothe, Nils. Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk.
Universität Paderborn, 2015.
short: N. Kothe, Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk,
Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:46Z
date_updated: 2022-01-06T06:57:44Z
department:
- _id: '63'
- _id: '541'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
title: Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk
type: bachelorsthesis
user_id: '14052'
year: '2015'
...