---
_id: '3307'
author:
- first_name: Bernd
full_name: Frick, Bernd
last_name: Frick
- first_name: Daniel
full_name: Kaimann, Daniel
id: '18949'
last_name: Kaimann
citation:
ama: Frick B, Kaimann D. The impact of customer reviews and advertisement efforts
on the performance of experience goods in electronic markets. Applied Economics
Letters. 2017;24(17):1237-1240. doi:10.1080/13504851.2016.1270399
apa: Frick, B., & Kaimann, D. (2017). The impact of customer reviews and advertisement
efforts on the performance of experience goods in electronic markets. Applied
Economics Letters, 24(17), 1237–1240. https://doi.org/10.1080/13504851.2016.1270399
bibtex: '@article{Frick_Kaimann_2017, title={The impact of customer reviews and
advertisement efforts on the performance of experience goods in electronic markets},
volume={24}, DOI={10.1080/13504851.2016.1270399},
number={17}, journal={Applied Economics Letters}, publisher={Taylor & Francis},
author={Frick, Bernd and Kaimann, Daniel}, year={2017}, pages={1237–1240} }'
chicago: 'Frick, Bernd, and Daniel Kaimann. “The Impact of Customer Reviews and
Advertisement Efforts on the Performance of Experience Goods in Electronic Markets.”
Applied Economics Letters 24, no. 17 (2017): 1237–40. https://doi.org/10.1080/13504851.2016.1270399.'
ieee: B. Frick and D. Kaimann, “The impact of customer reviews and advertisement
efforts on the performance of experience goods in electronic markets,” Applied
Economics Letters, vol. 24, no. 17, pp. 1237–1240, 2017.
mla: Frick, Bernd, and Daniel Kaimann. “The Impact of Customer Reviews and Advertisement
Efforts on the Performance of Experience Goods in Electronic Markets.” Applied
Economics Letters, vol. 24, no. 17, Taylor & Francis, 2017, pp. 1237–40,
doi:10.1080/13504851.2016.1270399.
short: B. Frick, D. Kaimann, Applied Economics Letters 24 (2017) 1237–1240.
date_created: 2018-06-22T11:25:35Z
date_updated: 2022-01-06T06:59:10Z
ddc:
- '000'
department:
- _id: '183'
doi: 10.1080/13504851.2016.1270399
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:37:41Z
date_updated: 2018-11-02T15:37:41Z
file_id: '5308'
file_name: FrickKaimann.pdf
file_size: 700352
relation: main_file
success: 1
file_date_updated: 2018-11-02T15:37:41Z
has_accepted_license: '1'
intvolume: ' 24'
issue: '17'
language:
- iso: eng
page: 1237-1240
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '8'
name: SFB 901 - Subproject A4
publication: Applied Economics Letters
publisher: Taylor & Francis
status: public
title: The impact of customer reviews and advertisement efforts on the performance
of experience goods in electronic markets
type: journal_article
user_id: '477'
volume: 24
year: '2017'
...
---
_id: '3312'
author:
- first_name: Mana
full_name: Zarindast, Mana
id: '18949'
last_name: Zarindast
citation:
ama: 'Zarindast M. The Role of EWOM in the Movie Industry: The Effect of Online
User Ratings on Box Office Sales . Universität Paderborn; 2017.'
apa: 'Zarindast, M. (2017). The role of eWOM in the movie industry: The effect
of online user ratings on box office sales . Universität Paderborn.'
bibtex: '@book{Zarindast_2017, title={The role of eWOM in the movie industry: The
effect of online user ratings on box office sales }, publisher={Universität Paderborn},
author={Zarindast, Mana}, year={2017} }'
chicago: 'Zarindast, Mana. The Role of EWOM in the Movie Industry: The Effect
of Online User Ratings on Box Office Sales . Universität Paderborn, 2017.'
ieee: 'M. Zarindast, The role of eWOM in the movie industry: The effect of online
user ratings on box office sales . Universität Paderborn, 2017.'
mla: 'Zarindast, Mana. The Role of EWOM in the Movie Industry: The Effect of
Online User Ratings on Box Office Sales . Universität Paderborn, 2017.'
short: 'M. Zarindast, The Role of EWOM in the Movie Industry: The Effect of Online
User Ratings on Box Office Sales , Universität Paderborn, 2017.'
date_created: 2018-06-22T12:09:27Z
date_updated: 2022-01-06T06:59:10Z
language:
- iso: eng
project:
- _id: '2'
name: SFB 901 - Project Area A
- _id: '8'
name: SFB 901 - Subproject A4
- _id: '1'
name: SFB 901
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Bernd
full_name: Frick, Bernd
last_name: Frick
- first_name: Daniel
full_name: Kaimann, Daniel
id: '18949'
last_name: Kaimann
title: 'The role of eWOM in the movie industry: The effect of online user ratings
on box office sales '
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '3325'
author:
- first_name: Vitalik
full_name: Melnikov, Vitalik
last_name: Melnikov
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
citation:
ama: 'Melnikov V, Hüllermeier E. Optimizing the Structure of Nested Dichotomies:
A Comparison of Two Heuristics. In: Proceedings. 27. Workshop Computational
Intelligence, Dortmund, 23. - 24. November 2017. KIT Scientific Publishing;
2017. doi:10.5445/KSP/1000074341'
apa: 'Melnikov, V., & Hüllermeier, E. (2017). Optimizing the Structure of Nested
Dichotomies: A Comparison of Two Heuristics. In Proceedings. 27. Workshop Computational
Intelligence, Dortmund, 23. - 24. November 2017. KIT Scientific Publishing.
https://doi.org/10.5445/KSP/1000074341'
bibtex: '@inproceedings{Melnikov_Hüllermeier_2017, title={Optimizing the Structure
of Nested Dichotomies: A Comparison of Two Heuristics}, DOI={10.5445/KSP/1000074341},
booktitle={Proceedings. 27. Workshop Computational Intelligence, Dortmund, 23.
- 24. November 2017}, publisher={KIT Scientific Publishing}, author={Melnikov,
Vitalik and Hüllermeier, Eyke}, year={2017} }'
chicago: 'Melnikov, Vitalik, and Eyke Hüllermeier. “Optimizing the Structure of
Nested Dichotomies: A Comparison of Two Heuristics.” In Proceedings. 27. Workshop
Computational Intelligence, Dortmund, 23. - 24. November 2017. KIT Scientific
Publishing, 2017. https://doi.org/10.5445/KSP/1000074341.'
ieee: 'V. Melnikov and E. Hüllermeier, “Optimizing the Structure of Nested Dichotomies:
A Comparison of Two Heuristics,” in Proceedings. 27. Workshop Computational
Intelligence, Dortmund, 23. - 24. November 2017, 2017.'
mla: 'Melnikov, Vitalik, and Eyke Hüllermeier. “Optimizing the Structure of Nested
Dichotomies: A Comparison of Two Heuristics.” Proceedings. 27. Workshop Computational
Intelligence, Dortmund, 23. - 24. November 2017, KIT Scientific Publishing,
2017, doi:10.5445/KSP/1000074341.'
short: 'V. Melnikov, E. Hüllermeier, in: Proceedings. 27. Workshop Computational
Intelligence, Dortmund, 23. - 24. November 2017, KIT Scientific Publishing, 2017.'
date_created: 2018-06-25T08:14:49Z
date_updated: 2022-01-06T06:59:10Z
ddc:
- '000'
department:
- _id: '355'
doi: 10.5445/KSP/1000074341
file:
- access_level: closed
content_type: application/pdf
creator: melnikov
date_created: 2018-11-30T09:47:59Z
date_updated: 2018-11-30T09:47:59Z
file_id: '5987'
file_name: main.pdf
file_size: 1829552
relation: main_file
success: 1
file_date_updated: 2018-11-30T09:47:59Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '11'
name: SFB 901 - Subproject B3
- _id: '3'
name: SFB 901 - Project Area B
- _id: '1'
name: SFB 901
publication: Proceedings. 27. Workshop Computational Intelligence, Dortmund, 23. -
24. November 2017
publisher: KIT Scientific Publishing
status: public
title: 'Optimizing the Structure of Nested Dichotomies: A Comparison of Two Heuristics'
type: conference
user_id: '15504'
year: '2017'
...
---
_id: '3512'
author:
- first_name: Paul
full_name: Börding, Paul
last_name: Börding
citation:
ama: Börding P. Testing Java Method Contracts. Universität Paderborn; 2017.
apa: Börding, P. (2017). Testing Java Method Contracts. Universität Paderborn.
bibtex: '@book{Börding_2017, title={Testing Java Method Contracts}, publisher={Universität
Paderborn}, author={Börding, Paul}, year={2017} }'
chicago: Börding, Paul. Testing Java Method Contracts. Universität Paderborn,
2017.
ieee: P. Börding, Testing Java Method Contracts. Universität Paderborn, 2017.
mla: Börding, Paul. Testing Java Method Contracts. Universität Paderborn,
2017.
short: P. Börding, Testing Java Method Contracts, Universität Paderborn, 2017.
date_created: 2018-07-09T09:32:41Z
date_updated: 2022-01-06T06:59:21Z
department:
- _id: '7'
- _id: '77'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '11'
name: SFB 901 - Subproject B3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
title: Testing Java Method Contracts
type: mastersthesis
user_id: '477'
year: '2017'
...
---
_id: '3580'
author:
- first_name: Tim
full_name: Hansmeier, Tim
id: '49992'
last_name: Hansmeier
orcid: 0000-0003-1377-3339
citation:
ama: Hansmeier T. An FPGA Accelerator for Checking Resolution Proofs. Universität
Paderborn; 2017.
apa: Hansmeier, T. (2017). An FPGA Accelerator for Checking Resolution Proofs.
Universität Paderborn.
bibtex: '@book{Hansmeier_2017, title={An FPGA Accelerator for Checking Resolution
Proofs}, publisher={Universität Paderborn}, author={Hansmeier, Tim}, year={2017}
}'
chicago: Hansmeier, Tim. An FPGA Accelerator for Checking Resolution Proofs.
Universität Paderborn, 2017.
ieee: T. Hansmeier, An FPGA Accelerator for Checking Resolution Proofs. Universität
Paderborn, 2017.
mla: Hansmeier, Tim. An FPGA Accelerator for Checking Resolution Proofs.
Universität Paderborn, 2017.
short: T. Hansmeier, An FPGA Accelerator for Checking Resolution Proofs, Universität
Paderborn, 2017.
date_created: 2018-07-20T13:44:34Z
date_updated: 2022-01-06T06:59:25Z
department:
- _id: '78'
- _id: '34'
- _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
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
title: An FPGA Accelerator for Checking Resolution Proofs
type: bachelorsthesis
user_id: '3118'
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: '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: '116'
author:
- first_name: Gennadij
full_name: Liske, Gennadij
last_name: Liske
citation:
ama: Liske G. CCA-Security for Predicate Encryption Schemes. Universität
Paderborn; 2017. doi:10.17619/UNIPB/1-220
apa: Liske, G. (2017). CCA-Security for Predicate Encryption Schemes. Universität
Paderborn. https://doi.org/10.17619/UNIPB/1-220
bibtex: '@book{Liske_2017, title={CCA-Security for Predicate Encryption Schemes},
DOI={10.17619/UNIPB/1-220},
publisher={Universität Paderborn}, author={Liske, Gennadij}, year={2017} }'
chicago: Liske, Gennadij. CCA-Security for Predicate Encryption Schemes.
Universität Paderborn, 2017. https://doi.org/10.17619/UNIPB/1-220.
ieee: G. Liske, CCA-Security for Predicate Encryption Schemes. Universität
Paderborn, 2017.
mla: Liske, Gennadij. CCA-Security for Predicate Encryption Schemes. Universität
Paderborn, 2017, doi:10.17619/UNIPB/1-220.
short: G. Liske, CCA-Security for Predicate Encryption Schemes, Universität Paderborn,
2017.
date_created: 2017-10-17T12:41:14Z
date_updated: 2022-01-06T06:51:04Z
department:
- _id: '64'
doi: 10.17619/UNIPB/1-220
main_file_link:
- url: http://nbn-resolving.de/urn:nbn:de:hbz:466:2-29690
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: CCA-Security for Predicate Encryption Schemes
type: dissertation
user_id: '25078'
year: '2017'
...
---
_id: '1767'
abstract:
- lang: eng
text: 'Conditional Value-at-Risk, denoted as CVaRα, is becoming the prevailing measure
of risk over two paramount economic domains: the insurance domain and the financial
domain; α∈(0,1) is the confidence level. In this work, we study the strategic
equilibria for an economic system modeled as a game, where risk-averse players
seek to minimize the Conditional Value-at-Risk of their costs. Concretely, in
a CVaRα -equilibrium, the mixed strategy of each player is a best-response. We
establish two significant properties of CVaRα at equilibrium: (1) The Optimal-Value
property: For any best-response of a player, each mixed strategy in the support
gives the same cost to the player. This follows directly from the concavity of
CVaRα in the involved probabilities, which we establish. (2) The Crawford property:
For every α, there is a 2-player game with no CVaRα-equilibrium. The property
is established using the Optimal-Value property and a new functional property
of CVaRα, called Weak-Equilibrium-for- VaRα, we establish. On top of these properties,
we show, as one of our two main results, that deciding the existence of a CVaRα-equilibrium
is strongly NP-hard even for 2-player games. As our other main result, we show
the strong NP-hardness of deciding the existence of a V-equilibrium, over 2-player
games, for any valuation V with the Optimal-Value and the Crawford properties.
This result has a rich potential since we prove that the very significant and
broad class of strictly quasiconcave valuations has the Optimal-Value property.'
author:
- first_name: Marios
full_name: Mavronicolas, Marios
last_name: Mavronicolas
- first_name: Burkhard
full_name: Monien, Burkhard
last_name: Monien
citation:
ama: 'Mavronicolas M, Monien B. Conditional Value-at-Risk: Structure and Complexity
of Equilibria. In: Proceedings of the 10th International Symposium on Algorithmic
Game Theory (SAGT 2017). Vol 10504. LNCS. ; 2017:131--143. doi:10.1007/978-3-319-66700-3_11'
apa: 'Mavronicolas, M., & Monien, B. (2017). Conditional Value-at-Risk: Structure
and Complexity of Equilibria. In Proceedings of the 10th International Symposium
on Algorithmic Game Theory (SAGT 2017) (Vol. 10504, pp. 131--143). L’Aquila,
Italy. https://doi.org/10.1007/978-3-319-66700-3_11'
bibtex: '@inproceedings{Mavronicolas_Monien_2017, series={LNCS}, title={Conditional
Value-at-Risk: Structure and Complexity of Equilibria}, volume={10504}, DOI={10.1007/978-3-319-66700-3_11},
booktitle={Proceedings of the 10th International Symposium on Algorithmic Game
Theory (SAGT 2017)}, author={Mavronicolas, Marios and Monien, Burkhard}, year={2017},
pages={131--143}, collection={LNCS} }'
chicago: 'Mavronicolas, Marios, and Burkhard Monien. “Conditional Value-at-Risk:
Structure and Complexity of Equilibria.” In Proceedings of the 10th International
Symposium on Algorithmic Game Theory (SAGT 2017), 10504:131--143. LNCS, 2017.
https://doi.org/10.1007/978-3-319-66700-3_11.'
ieee: 'M. Mavronicolas and B. Monien, “Conditional Value-at-Risk: Structure and
Complexity of Equilibria,” in Proceedings of the 10th International Symposium
on Algorithmic Game Theory (SAGT 2017), L’Aquila, Italy, 2017, vol. 10504,
pp. 131--143.'
mla: 'Mavronicolas, Marios, and Burkhard Monien. “Conditional Value-at-Risk: Structure
and Complexity of Equilibria.” Proceedings of the 10th International Symposium
on Algorithmic Game Theory (SAGT 2017), vol. 10504, 2017, pp. 131--143, doi:10.1007/978-3-319-66700-3_11.'
short: 'M. Mavronicolas, B. Monien, in: Proceedings of the 10th International Symposium
on Algorithmic Game Theory (SAGT 2017), 2017, pp. 131--143.'
conference:
end_date: 2017-09-14
location: L'Aquila, Italy
name: 10th International Symposium on Algorithmic Game Theory (SAGT 2017)
start_date: 2017-09-12
date_created: 2018-03-23T13:58:02Z
date_updated: 2022-01-06T06:53:16Z
ddc:
- '000'
department:
- _id: '7'
doi: 10.1007/978-3-319-66700-3_11
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:53:56Z
date_updated: 2018-11-02T14:53:56Z
file_id: '5287'
file_name: ConditionalValue-at-RiskStruct.pdf
file_size: 352365
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:53:56Z
has_accepted_license: '1'
intvolume: ' 10504'
language:
- iso: eng
page: 131--143
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
publication: Proceedings of the 10th International Symposium on Algorithmic Game Theory
(SAGT 2017)
series_title: LNCS
status: public
title: 'Conditional Value-at-Risk: Structure and Complexity of Equilibria'
type: conference
user_id: '477'
volume: 10504
year: '2017'
...
---
_id: '2344'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Peter
full_name: Günther, Peter
last_name: Günther
- first_name: Volker
full_name: Krummel, Volker
last_name: Krummel
- first_name: Nils
full_name: Löken, Nils
id: '13703'
last_name: Löken
citation:
ama: 'Blömer J, Günther P, Krummel V, Löken N. Attribute-Based Encryption as a Service
for Access Control in Large-Scale Organizations. In: Foundations and Practice
of Security. Cham: Springer International Publishing; 2017:3-17. doi:10.1007/978-3-319-75650-9_1'
apa: 'Blömer, J., Günther, P., Krummel, V., & Löken, N. (2017). Attribute-Based
Encryption as a Service for Access Control in Large-Scale Organizations. In Foundations
and Practice of Security (pp. 3–17). Cham: Springer International Publishing.
https://doi.org/10.1007/978-3-319-75650-9_1'
bibtex: '@inproceedings{Blömer_Günther_Krummel_Löken_2017, place={Cham}, title={Attribute-Based
Encryption as a Service for Access Control in Large-Scale Organizations}, DOI={10.1007/978-3-319-75650-9_1},
booktitle={Foundations and Practice of Security}, publisher={Springer International
Publishing}, author={Blömer, Johannes and Günther, Peter and Krummel, Volker and
Löken, Nils}, year={2017}, pages={3–17} }'
chicago: 'Blömer, Johannes, Peter Günther, Volker Krummel, and Nils Löken. “Attribute-Based
Encryption as a Service for Access Control in Large-Scale Organizations.” In Foundations
and Practice of Security, 3–17. Cham: Springer International Publishing, 2017.
https://doi.org/10.1007/978-3-319-75650-9_1.'
ieee: J. Blömer, P. Günther, V. Krummel, and N. Löken, “Attribute-Based Encryption
as a Service for Access Control in Large-Scale Organizations,” in Foundations
and Practice of Security, 2017, pp. 3–17.
mla: Blömer, Johannes, et al. “Attribute-Based Encryption as a Service for Access
Control in Large-Scale Organizations.” Foundations and Practice of Security,
Springer International Publishing, 2017, pp. 3–17, doi:10.1007/978-3-319-75650-9_1.
short: 'J. Blömer, P. Günther, V. Krummel, N. Löken, in: Foundations and Practice
of Security, Springer International Publishing, Cham, 2017, pp. 3–17.'
date_created: 2018-04-13T11:40:48Z
date_updated: 2022-01-06T06:55:55Z
ddc:
- '000'
department:
- _id: '64'
doi: 10.1007/978-3-319-75650-9_1
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:04:13Z
date_updated: 2018-11-02T15:04:13Z
file_id: '5292'
file_name: Attribute-BasedEncryptionAsASe.pdf
file_size: 634736
relation: main_file
success: 1
- access_level: open_access
content_type: application/pdf
creator: nilo
date_created: 2018-11-08T09:53:34Z
date_updated: 2018-11-08T09:53:34Z
file_id: '5425'
file_name: abe_aas.pdf
file_size: 522516
relation: main_file
file_date_updated: 2018-11-08T09:53:34Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 3-17
place: Cham
project:
- _id: '13'
name: SFB 901 - Subproject C1
- _id: '4'
name: SFB 901 - Project Area C
- _id: '1'
name: SFB 901
- _id: '43'
name: Securing the Financial Cloud
publication: Foundations and Practice of Security
publication_identifier:
isbn:
- '9783319756493'
- '9783319756509'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations
type: conference
user_id: '13703'
year: '2017'
...
---
_id: '18026'
author:
- first_name: 'Michél '
full_name: 'Burkhardt, Michél '
last_name: Burkhardt
citation:
ama: Burkhardt M. Untersuchungen Zum Cone-Hashing. Universität Paderborn;
2017.
apa: Burkhardt, M. (2017). Untersuchungen zum Cone-Hashing. Universität Paderborn.
bibtex: '@book{Burkhardt_2017, title={Untersuchungen zum Cone-Hashing}, publisher={Universität
Paderborn}, author={Burkhardt, Michél }, year={2017} }'
chicago: Burkhardt, Michél . Untersuchungen Zum Cone-Hashing. Universität
Paderborn, 2017.
ieee: M. Burkhardt, Untersuchungen zum Cone-Hashing. Universität Paderborn,
2017.
mla: Burkhardt, Michél. Untersuchungen Zum Cone-Hashing. Universität Paderborn,
2017.
short: M. Burkhardt, Untersuchungen Zum Cone-Hashing, Universität Paderborn, 2017.
date_created: 2020-08-18T08:39:19Z
date_updated: 2022-01-06T06:53:25Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Untersuchungen zum Cone-Hashing
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '18027'
author:
- first_name: Ngoc Chi
full_name: Banh, Ngoc Chi
last_name: Banh
citation:
ama: Banh NC. An Asynchronous Adaption of a Churn-Resistant Overlay Network.
Universität Paderborn; 2017.
apa: Banh, N. C. (2017). An Asynchronous Adaption of a Churn-resistant Overlay
Network. Universität Paderborn.
bibtex: '@book{Banh_2017, title={An Asynchronous Adaption of a Churn-resistant Overlay
Network}, publisher={Universität Paderborn}, author={Banh, Ngoc Chi}, year={2017}
}'
chicago: Banh, Ngoc Chi. An Asynchronous Adaption of a Churn-Resistant Overlay
Network. Universität Paderborn, 2017.
ieee: N. C. Banh, An Asynchronous Adaption of a Churn-resistant Overlay Network.
Universität Paderborn, 2017.
mla: Banh, Ngoc Chi. An Asynchronous Adaption of a Churn-Resistant Overlay Network.
Universität Paderborn, 2017.
short: N.C. Banh, An Asynchronous Adaption of a Churn-Resistant Overlay Network,
Universität Paderborn, 2017.
date_created: 2020-08-18T08:40:19Z
date_updated: 2022-01-06T06:53:25Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: An Asynchronous Adaption of a Churn-resistant Overlay Network
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '18028'
author:
- first_name: Andreas
full_name: Schenk, Andreas
last_name: Schenk
citation:
ama: Schenk A. Monotone Suchbarkeit in Mehrdimensionalen Verteilten Datenstrukturen.
Universität Paderborn; 2017.
apa: Schenk, A. (2017). Monotone Suchbarkeit in mehrdimensionalen verteilten
Datenstrukturen. Universität Paderborn.
bibtex: '@book{Schenk_2017, title={Monotone Suchbarkeit in mehrdimensionalen verteilten
Datenstrukturen}, publisher={Universität Paderborn}, author={Schenk, Andreas},
year={2017} }'
chicago: Schenk, Andreas. Monotone Suchbarkeit in Mehrdimensionalen Verteilten
Datenstrukturen. Universität Paderborn, 2017.
ieee: A. Schenk, Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen.
Universität Paderborn, 2017.
mla: Schenk, Andreas. Monotone Suchbarkeit in Mehrdimensionalen Verteilten Datenstrukturen.
Universität Paderborn, 2017.
short: A. Schenk, Monotone Suchbarkeit in Mehrdimensionalen Verteilten Datenstrukturen,
Universität Paderborn, 2017.
date_created: 2020-08-18T08:41:42Z
date_updated: 2022-01-06T06:53:25Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '18029'
author:
- first_name: Björn
full_name: Beckendorf, Björn
last_name: Beckendorf
citation:
ama: Beckendorf B. Visualisierung Zu Algorithmen Verteilter Netzwerksysteme.
Universität Paderborn; 2017.
apa: Beckendorf, B. (2017). Visualisierung zu Algorithmen verteilter Netzwerksysteme.
Universität Paderborn.
bibtex: '@book{Beckendorf_2017, title={Visualisierung zu Algorithmen verteilter
Netzwerksysteme}, publisher={Universität Paderborn}, author={Beckendorf, Björn},
year={2017} }'
chicago: Beckendorf, Björn. Visualisierung Zu Algorithmen Verteilter Netzwerksysteme.
Universität Paderborn, 2017.
ieee: B. Beckendorf, Visualisierung zu Algorithmen verteilter Netzwerksysteme.
Universität Paderborn, 2017.
mla: Beckendorf, Björn. Visualisierung Zu Algorithmen Verteilter Netzwerksysteme.
Universität Paderborn, 2017.
short: B. Beckendorf, Visualisierung Zu Algorithmen Verteilter Netzwerksysteme,
Universität Paderborn, 2017.
date_created: 2020-08-18T08:42:36Z
date_updated: 2022-01-06T06:53:25Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Visualisierung zu Algorithmen verteilter Netzwerksysteme
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '2269'
author:
- first_name: Ana
full_name: Mauleon, Ana
last_name: Mauleon
- first_name: Nils
full_name: Roehl, Nils
last_name: Roehl
- first_name: Vincent
full_name: Vannetelbosch, Vincent
last_name: Vannetelbosch
citation:
ama: Mauleon A, Roehl N, Vannetelbosch V. Constitutions and groups. Games and
Economic Behavior. 2017;107:135-152. doi:10.1016/j.geb.2017.10.022
apa: Mauleon, A., Roehl, N., & Vannetelbosch, V. (2017). Constitutions and groups.
Games and Economic Behavior, 107, 135–152. https://doi.org/10.1016/j.geb.2017.10.022
bibtex: '@article{Mauleon_Roehl_Vannetelbosch_2017, title={Constitutions and groups},
volume={107}, DOI={10.1016/j.geb.2017.10.022},
journal={Games and Economic Behavior}, publisher={Elsevier}, author={Mauleon,
Ana and Roehl, Nils and Vannetelbosch, Vincent}, year={2017}, pages={135–152}
}'
chicago: 'Mauleon, Ana, Nils Roehl, and Vincent Vannetelbosch. “Constitutions and
Groups.” Games and Economic Behavior 107 (2017): 135–52. https://doi.org/10.1016/j.geb.2017.10.022.'
ieee: A. Mauleon, N. Roehl, and V. Vannetelbosch, “Constitutions and groups,” Games
and Economic Behavior, vol. 107, pp. 135–152, 2017.
mla: Mauleon, Ana, et al. “Constitutions and Groups.” Games and Economic Behavior,
vol. 107, Elsevier, 2017, pp. 135–52, doi:10.1016/j.geb.2017.10.022.
short: A. Mauleon, N. Roehl, V. Vannetelbosch, Games and Economic Behavior 107 (2017)
135–152.
date_created: 2018-04-09T09:25:05Z
date_updated: 2022-01-06T06:55:38Z
ddc:
- '040'
department:
- _id: '204'
- _id: '205'
doi: 10.1016/j.geb.2017.10.022
file:
- access_level: closed
content_type: application/pdf
creator: stela
date_created: 2018-10-31T08:21:31Z
date_updated: 2018-10-31T08:21:31Z
file_id: '5122'
file_name: Constitutions and groups.pdf
file_size: 577360
relation: main_file
success: 1
file_date_updated: 2018-10-31T08:21:31Z
has_accepted_license: '1'
intvolume: ' 107'
language:
- iso: eng
page: 135-152
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
publication: Games and Economic Behavior
publication_identifier:
issn:
- 0899-8256
publication_status: published
publisher: Elsevier
status: public
title: Constitutions and groups
type: journal_article
user_id: '65453'
volume: 107
year: '2017'
...
---
_id: '2272'
author:
- first_name: Vanessa
full_name: Golke, Vanessa
last_name: Golke
citation:
ama: Golke V. Signaling und Screening - Abbau von Informationsasymmetrie.
Universität Paderborn; 2017.
apa: Golke, V. (2017). Signaling und Screening - Abbau von Informationsasymmetrie.
Universität Paderborn.
bibtex: '@book{Golke_2017, title={Signaling und Screening - Abbau von Informationsasymmetrie},
publisher={Universität Paderborn}, author={Golke, Vanessa}, year={2017} }'
chicago: Golke, Vanessa. Signaling und Screening - Abbau von Informationsasymmetrie.
Universität Paderborn, 2017.
ieee: V. Golke, Signaling und Screening - Abbau von Informationsasymmetrie.
Universität Paderborn, 2017.
mla: Golke, Vanessa. Signaling und Screening - Abbau von Informationsasymmetrie.
Universität Paderborn, 2017.
short: V. Golke, Signaling und Screening - Abbau von Informationsasymmetrie, Universität
Paderborn, 2017.
date_created: 2018-04-10T09:59:38Z
date_updated: 2022-01-06T06:55:39Z
department:
- _id: '19'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '8'
name: SFB 901 - Subproject A4
publisher: Universität Paderborn
status: public
title: Signaling und Screening - Abbau von Informationsasymmetrie
type: bachelorsthesis
user_id: '477'
year: '2017'
...