---
_id: '10011'
author:
- first_name: Martin
full_name: Fränzle, Martin
last_name: Fränzle
- first_name: Deepak
full_name: Kapur, Deepak
last_name: Kapur
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
- first_name: Naijun
full_name: Zhan, Naijun
last_name: Zhan
citation:
ama: Fränzle M, Kapur D, Wehrheim H, Zhan N. Editorial. Formal Asp Comput.
2019;31(1):1. doi:10.1007/s00165-018-00477-6
apa: Fränzle, M., Kapur, D., Wehrheim, H., & Zhan, N. (2019). Editorial. Formal
Asp. Comput., 31(1), 1. https://doi.org/10.1007/s00165-018-00477-6
bibtex: '@article{Fränzle_Kapur_Wehrheim_Zhan_2019, title={Editorial}, volume={31},
DOI={10.1007/s00165-018-00477-6},
number={1}, journal={Formal Asp. Comput.}, author={Fränzle, Martin and Kapur,
Deepak and Wehrheim, Heike and Zhan, Naijun}, year={2019}, pages={1} }'
chicago: 'Fränzle, Martin, Deepak Kapur, Heike Wehrheim, and Naijun Zhan. “Editorial.”
Formal Asp. Comput. 31, no. 1 (2019): 1. https://doi.org/10.1007/s00165-018-00477-6.'
ieee: M. Fränzle, D. Kapur, H. Wehrheim, and N. Zhan, “Editorial,” Formal Asp.
Comput., vol. 31, no. 1, p. 1, 2019.
mla: Fränzle, Martin, et al. “Editorial.” Formal Asp. Comput., vol. 31, no.
1, 2019, p. 1, doi:10.1007/s00165-018-00477-6.
short: M. Fränzle, D. Kapur, H. Wehrheim, N. Zhan, Formal Asp. Comput. 31 (2019)
1.
date_created: 2019-05-28T06:32:57Z
date_updated: 2022-01-06T06:50:22Z
department:
- _id: '77'
doi: 10.1007/s00165-018-00477-6
intvolume: ' 31'
issue: '1'
language:
- iso: eng
page: '1'
publication: Formal Asp. Comput.
status: public
title: Editorial
type: journal_article
user_id: '29719'
volume: 31
year: '2019'
...
---
_id: '10091'
author:
- first_name: Jürgen
full_name: König, Jürgen
id: '22358'
last_name: König
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'König J, Wehrheim H. Data Independence for Software Transactional Memory.
In: M. Badger J, Yvonne Rozier K, eds. {NASA} Formal Methods - 11th International
Symposium, {NFM} 2019, Houston, TX, USA, May 7-9, 2019, Proceedings. Vol 11460.
Lecture Notes in Computer Science. Springer; 2019:263-279. doi:10.1007/978-3-030-20652-9\_18'
apa: König, J., & Wehrheim, H. (2019). Data Independence for Software Transactional
Memory. In J. M. Badger & K. Yvonne Rozier (Eds.), {NASA} Formal Methods
- 11th International Symposium, {NFM} 2019, Houston, TX, USA, May 7-9, 2019, Proceedings
(Vol. 11460, pp. 263–279). Springer. https://doi.org/10.1007/978-3-030-20652-9\_18
bibtex: '@inproceedings{König_Wehrheim_2019, series={Lecture Notes in Computer Science},
title={Data Independence for Software Transactional Memory}, volume={11460}, DOI={10.1007/978-3-030-20652-9\_18},
booktitle={{NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston,
TX, USA, May 7-9, 2019, Proceedings}, publisher={Springer}, author={König, Jürgen
and Wehrheim, Heike}, editor={M. Badger, Julia and Yvonne Rozier, KristinEditors},
year={2019}, pages={263–279}, collection={Lecture Notes in Computer Science} }'
chicago: König, Jürgen, and Heike Wehrheim. “Data Independence for Software Transactional
Memory.” In {NASA} Formal Methods - 11th International Symposium, {NFM} 2019,
Houston, TX, USA, May 7-9, 2019, Proceedings, edited by Julia M. Badger and
Kristin Yvonne Rozier, 11460:263–79. Lecture Notes in Computer Science. Springer,
2019. https://doi.org/10.1007/978-3-030-20652-9\_18.
ieee: J. König and H. Wehrheim, “Data Independence for Software Transactional Memory,”
in {NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston,
TX, USA, May 7-9, 2019, Proceedings, 2019, vol. 11460, pp. 263–279.
mla: König, Jürgen, and Heike Wehrheim. “Data Independence for Software Transactional
Memory.” {NASA} Formal Methods - 11th International Symposium, {NFM} 2019,
Houston, TX, USA, May 7-9, 2019, Proceedings, edited by Julia M. Badger and
Kristin Yvonne Rozier, vol. 11460, Springer, 2019, pp. 263–79, doi:10.1007/978-3-030-20652-9\_18.
short: 'J. König, H. Wehrheim, in: J. M. Badger, K. Yvonne Rozier (Eds.), {NASA}
Formal Methods - 11th International Symposium, {NFM} 2019, Houston, TX, USA, May
7-9, 2019, Proceedings, Springer, 2019, pp. 263–279.'
date_created: 2019-06-03T07:51:26Z
date_updated: 2022-01-06T06:50:28Z
department:
- _id: '77'
doi: 10.1007/978-3-030-20652-9\_18
editor:
- first_name: Julia
full_name: M. Badger, Julia
last_name: M. Badger
- first_name: Kristin
full_name: Yvonne Rozier, Kristin
last_name: Yvonne Rozier
intvolume: ' 11460'
language:
- iso: eng
page: 263-279
project:
- _id: '78'
name: Validation of Software Transactional Memory
publication: '{NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston,
TX, USA, May 7-9, 2019, Proceedings'
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Data Independence for Software Transactional Memory
type: conference
user_id: '22358'
volume: 11460
year: '2019'
...
---
_id: '10092'
author:
- first_name: Simon
full_name: Doherty, Simon
last_name: Doherty
- first_name: Brijesh
full_name: Dongol, Brijesh
last_name: Dongol
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
- first_name: John
full_name: Derrick, John
last_name: Derrick
citation:
ama: 'Doherty S, Dongol B, Wehrheim H, Derrick J. Verifying C11 programs operationally.
In: K. Hollingsworth J, Keidar I, eds. Proceedings of the 24th {ACM} {SIGPLAN}
Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington,
DC, USA, February 16-20, 2019. {ACM}; 2019:355-365. doi:10.1145/3293883.3295702'
apa: Doherty, S., Dongol, B., Wehrheim, H., & Derrick, J. (2019). Verifying
C11 programs operationally. In J. K. Hollingsworth & I. Keidar (Eds.), Proceedings
of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming,
PPoPP 2019, Washington, DC, USA, February 16-20, 2019 (pp. 355–365). {ACM}.
https://doi.org/10.1145/3293883.3295702
bibtex: '@inproceedings{Doherty_Dongol_Wehrheim_Derrick_2019, title={Verifying C11
programs operationally}, DOI={10.1145/3293883.3295702},
booktitle={Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles and
Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20,
2019}, publisher={{ACM}}, author={Doherty, Simon and Dongol, Brijesh and Wehrheim,
Heike and Derrick, John}, editor={K. Hollingsworth, Jeffrey and Keidar, IditEditors},
year={2019}, pages={355–365} }'
chicago: Doherty, Simon, Brijesh Dongol, Heike Wehrheim, and John Derrick. “Verifying
C11 Programs Operationally.” In Proceedings of the 24th {ACM} {SIGPLAN} Symposium
on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC,
USA, February 16-20, 2019, edited by Jeffrey K. Hollingsworth and Idit Keidar,
355–65. {ACM}, 2019. https://doi.org/10.1145/3293883.3295702.
ieee: S. Doherty, B. Dongol, H. Wehrheim, and J. Derrick, “Verifying C11 programs
operationally,” in Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles
and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February
16-20, 2019, 2019, pp. 355–365.
mla: Doherty, Simon, et al. “Verifying C11 Programs Operationally.” Proceedings
of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming,
PPoPP 2019, Washington, DC, USA, February 16-20, 2019, edited by Jeffrey K.
Hollingsworth and Idit Keidar, {ACM}, 2019, pp. 355–65, doi:10.1145/3293883.3295702.
short: 'S. Doherty, B. Dongol, H. Wehrheim, J. Derrick, in: J. K. Hollingsworth,
I. Keidar (Eds.), Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles
and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February
16-20, 2019, {ACM}, 2019, pp. 355–365.'
date_created: 2019-06-03T07:59:36Z
date_updated: 2022-01-06T06:50:28Z
department:
- _id: '77'
doi: 10.1145/3293883.3295702
editor:
- first_name: Jeffrey
full_name: K. Hollingsworth, Jeffrey
last_name: K. Hollingsworth
- first_name: Idit
full_name: Keidar, Idit
last_name: Keidar
language:
- iso: eng
page: 355-365
project:
- _id: '78'
name: Validation of Software Transactional Memory
publication: Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice
of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20, 2019
publisher: '{ACM}'
status: public
title: Verifying C11 programs operationally
type: conference
user_id: '29719'
year: '2019'
...
---
_id: '10093'
author:
- first_name: Dirk
full_name: Beyer, Dirk
last_name: Beyer
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
- first_name: Thomas
full_name: Lemberger, Thomas
last_name: Lemberger
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Beyer D, Jakobs M-C, Lemberger T, Wehrheim H. Combining Verifiers in Conditional
Model Checking via Reducers. In: Becker S, Bogicevic I, Herzwurm G, Wagner S,
eds. Software Engineering and Software Management (SE/SWM 2019), Stuttgart,
Germany, February 18-22, 2019. Vol P-292. LNI. GI; 2019:151--152. doi:10.18420/se2019-46'
apa: Beyer, D., Jakobs, M.-C., Lemberger, T., & Wehrheim, H. (2019). Combining
Verifiers in Conditional Model Checking via Reducers. In S. Becker, I. Bogicevic,
G. Herzwurm, & S. Wagner (Eds.), Software Engineering and Software Management
(SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019 (Vol. P-292, pp. 151--152).
GI. https://doi.org/10.18420/se2019-46
bibtex: '@inproceedings{Beyer_Jakobs_Lemberger_Wehrheim_2019, series={LNI}, title={Combining
Verifiers in Conditional Model Checking via Reducers}, volume={P-292}, DOI={10.18420/se2019-46}, booktitle={Software
Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February
18-22, 2019}, publisher={GI}, author={Beyer, Dirk and Jakobs, Marie-Christine
and Lemberger, Thomas and Wehrheim, Heike}, editor={Becker, Steffen and Bogicevic,
Ivan and Herzwurm, Georg and Wagner, StefanEditors}, year={2019}, pages={151--152},
collection={LNI} }'
chicago: Beyer, Dirk, Marie-Christine Jakobs, Thomas Lemberger, and Heike Wehrheim.
“Combining Verifiers in Conditional Model Checking via Reducers.” In Software
Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February
18-22, 2019, edited by Steffen Becker, Ivan Bogicevic, Georg Herzwurm, and
Stefan Wagner, P-292:151--152. LNI. GI, 2019. https://doi.org/10.18420/se2019-46.
ieee: D. Beyer, M.-C. Jakobs, T. Lemberger, and H. Wehrheim, “Combining Verifiers
in Conditional Model Checking via Reducers,” in Software Engineering and Software
Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019, 2019,
vol. P-292, pp. 151--152.
mla: Beyer, Dirk, et al. “Combining Verifiers in Conditional Model Checking via
Reducers.” Software Engineering and Software Management (SE/SWM 2019), Stuttgart,
Germany, February 18-22, 2019, edited by Steffen Becker et al., vol. P-292,
GI, 2019, pp. 151--152, doi:10.18420/se2019-46.
short: 'D. Beyer, M.-C. Jakobs, T. Lemberger, H. Wehrheim, in: S. Becker, I. Bogicevic,
G. Herzwurm, S. Wagner (Eds.), Software Engineering and Software Management (SE/SWM
2019), Stuttgart, Germany, February 18-22, 2019, GI, 2019, pp. 151--152.'
date_created: 2019-06-03T08:08:39Z
date_updated: 2022-01-06T06:50:28Z
ddc:
- '004'
department:
- _id: '77'
doi: 10.18420/se2019-46
editor:
- first_name: Steffen
full_name: Becker, Steffen
last_name: Becker
- first_name: Ivan
full_name: Bogicevic, Ivan
last_name: Bogicevic
- first_name: Georg
full_name: Herzwurm, Georg
last_name: Herzwurm
- first_name: Stefan
full_name: Wagner, Stefan
last_name: Wagner
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2019-08-26T09:31:55Z
date_updated: 2019-08-26T09:31:55Z
file_id: '12956'
file_name: 46.pdf
file_size: 472426
relation: main_file
success: 1
file_date_updated: 2019-08-26T09:31:55Z
has_accepted_license: '1'
language:
- iso: eng
page: 151--152
project:
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
publication: Software Engineering and Software Management (SE/SWM 2019), Stuttgart,
Germany, February 18-22, 2019
publisher: GI
series_title: LNI
status: public
title: Combining Verifiers in Conditional Model Checking via Reducers
type: conference
user_id: '477'
volume: P-292
year: '2019'
...
---
_id: '10094'
author:
- first_name: Arnab
full_name: Sharma, Arnab
id: '67200'
last_name: Sharma
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Sharma A, Wehrheim H. Testing Balancedness of ML Algorithms. In: Becker S,
Bogicevic I, Herzwurm G, Wagner S, eds. Software Engineering and Software Management,
{SE/SWM} 2019, Stuttgart, Germany, February 18-22, 2019. Vol {P-292}. {LNI}.
{GI}; 2019:157-158. doi:10.18420/se2019-48'
apa: Sharma, A., & Wehrheim, H. (2019). Testing Balancedness of ML Algorithms.
In S. Becker, I. Bogicevic, G. Herzwurm, & S. Wagner (Eds.), Software Engineering
and Software Management, {SE/SWM} 2019, Stuttgart, Germany, February 18-22, 2019
(Vol. {P-292}, pp. 157–158). {GI}. https://doi.org/10.18420/se2019-48
bibtex: '@inproceedings{Sharma_Wehrheim_2019, series={{LNI}}, title={Testing Balancedness
of ML Algorithms}, volume={{P-292}}, DOI={10.18420/se2019-48},
booktitle={Software Engineering and Software Management, {SE/SWM} 2019, Stuttgart,
Germany, February 18-22, 2019}, publisher={{GI}}, author={Sharma, Arnab and Wehrheim,
Heike}, editor={Becker, Steffen and Bogicevic, Ivan and Herzwurm, Georg and Wagner,
StefanEditors}, year={2019}, pages={157–158}, collection={{LNI}} }'
chicago: Sharma, Arnab, and Heike Wehrheim. “Testing Balancedness of ML Algorithms.”
In Software Engineering and Software Management, {SE/SWM} 2019, Stuttgart,
Germany, February 18-22, 2019, edited by Steffen Becker, Ivan Bogicevic, Georg
Herzwurm, and Stefan Wagner, {P-292}:157–58. {LNI}. {GI}, 2019. https://doi.org/10.18420/se2019-48.
ieee: A. Sharma and H. Wehrheim, “Testing Balancedness of ML Algorithms,” in Software
Engineering and Software Management, {SE/SWM} 2019, Stuttgart, Germany, February
18-22, 2019, 2019, vol. {P-292}, pp. 157–158.
mla: Sharma, Arnab, and Heike Wehrheim. “Testing Balancedness of ML Algorithms.”
Software Engineering and Software Management, {SE/SWM} 2019, Stuttgart, Germany,
February 18-22, 2019, edited by Steffen Becker et al., vol. {P-292}, {GI},
2019, pp. 157–58, doi:10.18420/se2019-48.
short: 'A. Sharma, H. Wehrheim, in: S. Becker, I. Bogicevic, G. Herzwurm, S. Wagner
(Eds.), Software Engineering and Software Management, {SE/SWM} 2019, Stuttgart,
Germany, February 18-22, 2019, {GI}, 2019, pp. 157–158.'
date_created: 2019-06-03T08:10:55Z
date_updated: 2022-01-06T06:50:28Z
department:
- _id: '77'
doi: 10.18420/se2019-48
editor:
- first_name: Steffen
full_name: Becker, Steffen
last_name: Becker
- first_name: Ivan
full_name: Bogicevic, Ivan
last_name: Bogicevic
- first_name: Georg
full_name: Herzwurm, Georg
last_name: Herzwurm
- first_name: Stefan
full_name: Wagner, Stefan
last_name: Wagner
language:
- iso: eng
page: 157-158
publication: Software Engineering and Software Management, {SE/SWM} 2019, Stuttgart,
Germany, February 18-22, 2019
publisher: '{GI}'
series_title: '{LNI}'
status: public
title: Testing Balancedness of ML Algorithms
type: conference
user_id: '29719'
volume: '{P-292}'
year: '2019'
...
---
_id: '10095'
author:
- first_name: Cedric
full_name: Richter, Cedric
id: '50003'
last_name: Richter
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Richter C, Wehrheim H. PeSCo: Predicting Sequential Combinations of Verifiers
- (Competition Contribution). In: Beyer D, Huisman M, Kordon F, Steffen B, eds.
Tools and Algorithms for the Construction and Analysis of Systems - 25 Years
of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic,
April 6-11, 2019, Proceedings, Part {III}. Vol 11429. Lecture Notes in Computer
Science. Springer; 2019:229-233. doi:10.1007/978-3-030-17502-3_19'
apa: 'Richter, C., & Wehrheim, H. (2019). PeSCo: Predicting Sequential Combinations
of Verifiers - (Competition Contribution). In D. Beyer, M. Huisman, F. Kordon,
& B. Steffen (Eds.), Tools and Algorithms for the Construction and Analysis
of Systems - 25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague,
Czech Republic, April 6-11, 2019, Proceedings, Part {III} (Vol. 11429, pp.
229–233). Springer. https://doi.org/10.1007/978-3-030-17502-3_19'
bibtex: '@inproceedings{Richter_Wehrheim_2019, series={Lecture Notes in Computer
Science}, title={PeSCo: Predicting Sequential Combinations of Verifiers - (Competition
Contribution)}, volume={11429}, DOI={10.1007/978-3-030-17502-3_19},
booktitle={Tools and Algorithms for the Construction and Analysis of Systems -
25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic,
April 6-11, 2019, Proceedings, Part {III}}, publisher={Springer}, author={Richter,
Cedric and Wehrheim, Heike}, editor={Beyer, Dirk and Huisman, Marieke and Kordon,
Fabrice and Steffen, BernhardEditors}, year={2019}, pages={229–233}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Richter, Cedric, and Heike Wehrheim. “PeSCo: Predicting Sequential Combinations
of Verifiers - (Competition Contribution).” In Tools and Algorithms for the
Construction and Analysis of Systems - 25 Years of {TACAS:} TOOLympics, Held as
Part of {ETAPS} 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part
{III}, edited by Dirk Beyer, Marieke Huisman, Fabrice Kordon, and Bernhard
Steffen, 11429:229–33. Lecture Notes in Computer Science. Springer, 2019. https://doi.org/10.1007/978-3-030-17502-3_19.'
ieee: 'C. Richter and H. Wehrheim, “PeSCo: Predicting Sequential Combinations of
Verifiers - (Competition Contribution),” in Tools and Algorithms for the Construction
and Analysis of Systems - 25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS}
2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part {III}, 2019,
vol. 11429, pp. 229–233.'
mla: 'Richter, Cedric, and Heike Wehrheim. “PeSCo: Predicting Sequential Combinations
of Verifiers - (Competition Contribution).” Tools and Algorithms for the Construction
and Analysis of Systems - 25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS}
2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part {III}, edited
by Dirk Beyer et al., vol. 11429, Springer, 2019, pp. 229–33, doi:10.1007/978-3-030-17502-3_19.'
short: 'C. Richter, H. Wehrheim, in: D. Beyer, M. Huisman, F. Kordon, B. Steffen
(Eds.), Tools and Algorithms for the Construction and Analysis of Systems - 25
Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic,
April 6-11, 2019, Proceedings, Part {III}, Springer, 2019, pp. 229–233.'
date_created: 2019-06-03T08:12:55Z
date_updated: 2022-01-06T06:50:29Z
ddc:
- '004'
department:
- _id: '77'
doi: 10.1007/978-3-030-17502-3_19
editor:
- first_name: Dirk
full_name: Beyer, Dirk
last_name: Beyer
- first_name: Marieke
full_name: Huisman, Marieke
last_name: Huisman
- first_name: Fabrice
full_name: Kordon, Fabrice
last_name: Kordon
- first_name: Bernhard
full_name: Steffen, Bernhard
last_name: Steffen
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2019-08-26T11:01:00Z
date_updated: 2019-08-26T11:01:00Z
file_id: '12961'
file_name: PeSCo.pdf
file_size: 254772
relation: main_file
success: 1
file_date_updated: 2019-08-26T11:01:00Z
has_accepted_license: '1'
intvolume: ' 11429'
language:
- iso: eng
page: 229-233
project:
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
publication: Tools and Algorithms for the Construction and Analysis of Systems - 25
Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic,
April 6-11, 2019, Proceedings, Part {III}
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: 'PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution)'
type: conference
user_id: '29719'
volume: 11429
year: '2019'
...
---
_id: '10105'
author:
- first_name: Jan
full_name: Haltermann, Jan
last_name: Haltermann
citation:
ama: Haltermann J. Analyzing Data Usage in Array Programs. Universität Paderborn;
2019.
apa: Haltermann, J. (2019). Analyzing Data Usage in Array Programs. Universität
Paderborn.
bibtex: '@book{Haltermann_2019, title={Analyzing Data Usage in Array Programs},
publisher={Universität Paderborn}, author={Haltermann, Jan}, year={2019} }'
chicago: Haltermann, Jan. Analyzing Data Usage in Array Programs. Universität
Paderborn, 2019.
ieee: J. Haltermann, Analyzing Data Usage in Array Programs. Universität
Paderborn, 2019.
mla: Haltermann, Jan. Analyzing Data Usage in Array Programs. Universität
Paderborn, 2019.
short: J. Haltermann, Analyzing Data Usage in Array Programs, Universität Paderborn,
2019.
date_created: 2019-06-04T10:54:08Z
date_updated: 2022-01-06T06:50:29Z
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: Analyzing Data Usage in Array Programs
type: mastersthesis
user_id: '477'
year: '2019'
...
---
_id: '10232'
abstract:
- lang: eng
text: Existing tools for automated machine learning, such as Auto-WEKA, TPOT, auto-sklearn,
and more recently ML-Plan, have shown impressive results for the tasks of single-label
classification and regression. Yet, there is only little work on other types of
machine learning problems so far. In particular, there is almost no work on automating
the engineering of machine learning solutions for multi-label classification (MLC).
We show how the scope of ML-Plan, an AutoML-tool for multi-class classification,
can be extended towards MLC using MEKA, which is a multi-label extension of the
well-known Java library WEKA. The resulting approach recursively refines MEKA's
multi-label classifiers, nesting other multi-label classifiers for meta algorithms
and single-label classifiers provided by WEKA as base learners. In our evaluation,
we find that the proposed approach yields strong results and performs significantly
better than a set of baselines we compare with.
author:
- first_name: Marcel Dominik
full_name: Wever, Marcel Dominik
id: '33176'
last_name: Wever
orcid: ' https://orcid.org/0000-0001-9782-6818'
- first_name: Felix
full_name: Mohr, Felix
last_name: Mohr
- first_name: Alexander
full_name: Tornede, Alexander
id: '38209'
last_name: Tornede
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
citation:
ama: 'Wever MD, Mohr F, Tornede A, Hüllermeier E. Automating Multi-Label Classification
Extending ML-Plan. In: ; 2019.'
apa: Wever, M. D., Mohr, F., Tornede, A., & Hüllermeier, E. (2019). Automating
Multi-Label Classification Extending ML-Plan. Presented at the 6th ICML Workshop
on Automated Machine Learning (AutoML 2019), Long Beach, CA, USA.
bibtex: '@inproceedings{Wever_Mohr_Tornede_Hüllermeier_2019, title={Automating Multi-Label
Classification Extending ML-Plan}, author={Wever, Marcel Dominik and Mohr, Felix
and Tornede, Alexander and Hüllermeier, Eyke}, year={2019} }'
chicago: Wever, Marcel Dominik, Felix Mohr, Alexander Tornede, and Eyke Hüllermeier.
“Automating Multi-Label Classification Extending ML-Plan,” 2019.
ieee: M. D. Wever, F. Mohr, A. Tornede, and E. Hüllermeier, “Automating Multi-Label
Classification Extending ML-Plan,” presented at the 6th ICML Workshop on Automated
Machine Learning (AutoML 2019), Long Beach, CA, USA, 2019.
mla: Wever, Marcel Dominik, et al. Automating Multi-Label Classification Extending
ML-Plan. 2019.
short: 'M.D. Wever, F. Mohr, A. Tornede, E. Hüllermeier, in: 2019.'
conference:
end_date: 2019-06-15
location: Long Beach, CA, USA
name: 6th ICML Workshop on Automated Machine Learning (AutoML 2019)
start_date: 2019-06-09
date_created: 2019-06-11T21:33:06Z
date_updated: 2022-01-06T06:50:33Z
ddc:
- '006'
department:
- _id: '355'
file:
- access_level: open_access
content_type: application/pdf
creator: wever
date_created: 2019-09-10T08:19:01Z
date_updated: 2019-09-10T08:20:44Z
file_id: '13177'
file_name: Automating_MultiLabel_Classification_Extending_ML-Plan.pdf
file_size: 388191
relation: main_file
file_date_updated: 2019-09-10T08:20:44Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '10'
name: SFB 901 - Subproject B2
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
status: public
title: Automating Multi-Label Classification Extending ML-Plan
type: conference
user_id: '33176'
year: '2019'
...
---
_id: '10271'
author:
- first_name: N.
full_name: N., N.
last_name: N.
citation:
ama: N. N. Implementation and Evaluation of Authenticated Data Structures Using
Intel SGX Enclaves. Universität Paderborn; 2019.
apa: N., N. (2019). Implementation and Evaluation of Authenticated Data Structures
Using Intel SGX Enclaves. Universität Paderborn.
bibtex: '@book{N._2019, title={Implementation and Evaluation of Authenticated Data
Structures Using Intel SGX Enclaves}, publisher={Universität Paderborn}, author={N.,
N.}, year={2019} }'
chicago: N., N. Implementation and Evaluation of Authenticated Data Structures
Using Intel SGX Enclaves. Universität Paderborn, 2019.
ieee: N. N., Implementation and Evaluation of Authenticated Data Structures Using
Intel SGX Enclaves. Universität Paderborn, 2019.
mla: N., N. Implementation and Evaluation of Authenticated Data Structures Using
Intel SGX Enclaves. Universität Paderborn, 2019.
short: N. N., Implementation and Evaluation of Authenticated Data Structures Using
Intel SGX Enclaves, Universität Paderborn, 2019.
date_created: 2019-06-19T11:31:38Z
date_updated: 2022-01-06T06:50:33Z
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: Implementation and Evaluation of Authenticated Data Structures Using Intel
SGX Enclaves
type: mastersthesis
user_id: '477'
year: '2019'
...
---
_id: '10281'
abstract:
- lang: eng
text: 'Competing firms tend to select similar locations for their stores. This phenomenon,
called the principle of minimum differentiation, was captured by Hotelling with
a landmark model of spatial competition but is still the object of an ongoing
scientific debate. Although consistently observed in practice, many more realistic
variants of Hotelling''s model fail to support minimum differentiation or do not
have pure equilibria at all. In particular, it was recently proven for a generalized
model which incorporates negative network externalities and which contains Hotelling''s
model and classical selfish load balancing as special cases, that the unique equilibria
do not adhere to minimum differentiation. Furthermore, it was shown that for a
significant parameter range pure equilibria do not exist. We derive a sharp contrast
to these previous results by investigating Hotelling''s model with negative network
externalities from an entirely new angle: approximate pure subgame perfect equilibria.
This approach allows us to prove analytically and via agent-based simulations
that approximate equilibria having good approximation guarantees and that adhere
to minimum differentiation exist for the full parameter range of the model. Moreover,
we show that the obtained approximate equilibria have high social welfare.'
author:
- first_name: Matthias
full_name: Feldotto, Matthias
id: '14052'
last_name: Feldotto
orcid: 0000-0003-1348-6516
- first_name: 'Pascal '
full_name: 'Lenzner, Pascal '
last_name: Lenzner
- first_name: Louise
full_name: Molitor, Louise
last_name: Molitor
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: 'Feldotto M, Lenzner P, Molitor L, Skopalik A. From Hotelling to Load Balancing:
Approximation and the Principle of Minimum Differentiation. In: Proceedings
of the 18th International Conference on Autonomous Agents and MultiAgent Systems.
International Foundation for Autonomous Agents and Multiagent Systems; 2019:1949--1951.'
apa: 'Feldotto, M., Lenzner, P., Molitor, L., & Skopalik, A. (2019). From Hotelling
to Load Balancing: Approximation and the Principle of Minimum Differentiation.
In Proceedings of the 18th International Conference on Autonomous Agents and
MultiAgent Systems (pp. 1949--1951). Montreal QC, Canada: International Foundation
for Autonomous Agents and Multiagent Systems.'
bibtex: '@inproceedings{Feldotto_Lenzner_Molitor_Skopalik_2019, title={ From Hotelling
to Load Balancing: Approximation and the Principle of Minimum Differentiation},
booktitle={Proceedings of the 18th International Conference on Autonomous Agents
and MultiAgent Systems}, publisher={International Foundation for Autonomous Agents
and Multiagent Systems}, author={Feldotto, Matthias and Lenzner, Pascal and Molitor,
Louise and Skopalik, Alexander}, year={2019}, pages={1949--1951} }'
chicago: 'Feldotto, Matthias, Pascal Lenzner, Louise Molitor, and Alexander Skopalik.
“ From Hotelling to Load Balancing: Approximation and the Principle of Minimum
Differentiation.” In Proceedings of the 18th International Conference on Autonomous
Agents and MultiAgent Systems, 1949--1951. International Foundation for Autonomous
Agents and Multiagent Systems, 2019.'
ieee: 'M. Feldotto, P. Lenzner, L. Molitor, and A. Skopalik, “ From Hotelling to
Load Balancing: Approximation and the Principle of Minimum Differentiation,” in
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent
Systems, Montreal QC, Canada, 2019, pp. 1949--1951.'
mla: 'Feldotto, Matthias, et al. “ From Hotelling to Load Balancing: Approximation
and the Principle of Minimum Differentiation.” Proceedings of the 18th International
Conference on Autonomous Agents and MultiAgent Systems, International Foundation
for Autonomous Agents and Multiagent Systems, 2019, pp. 1949--1951.'
short: 'M. Feldotto, P. Lenzner, L. Molitor, A. Skopalik, in: Proceedings of the
18th International Conference on Autonomous Agents and MultiAgent Systems, International
Foundation for Autonomous Agents and Multiagent Systems, 2019, pp. 1949--1951.'
conference:
location: Montreal QC, Canada
name: 18th International Conference on Autonomous Agents and MultiAgent Systems
date_created: 2019-06-20T14:46:08Z
date_updated: 2022-01-06T06:50:33Z
ddc:
- '004'
department:
- _id: '541'
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2019-08-26T11:10:02Z
date_updated: 2019-08-26T11:10:02Z
file_id: '12962'
file_name: 1903.04265.pdf
file_size: 698599
relation: main_file
success: 1
file_date_updated: 2019-08-26T11:10:02Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: https://dl.acm.org/citation.cfm?id=3331973
page: 1949--1951
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 18th International Conference on Autonomous Agents
and MultiAgent Systems
publication_status: published
publisher: International Foundation for Autonomous Agents and Multiagent Systems
status: public
title: ' From Hotelling to Load Balancing: Approximation and the Principle of Minimum
Differentiation'
type: conference
user_id: '477'
year: '2019'
...
---
_id: '10284'
abstract:
- lang: eng
text: We study text reuse related to Wikipedia at scale by compiling the first corpus
of text reuse cases within Wikipedia as well as without (i.e., reuse of Wikipedia
text in a sample of the Common Crawl). To discover reuse beyond verbatim copy
and paste, we employ state-of-the-art text reuse detection technology, scaling
it for the first time to process the entire Wikipedia as part of a distributed
retrieval pipeline. We further report on a pilot analysis of the 100 million reuse
cases inside, and the 1.6 million reuse cases outside Wikipedia that we discovered.
Text reuse inside Wikipedia gives rise to new tasks such as article template induction,
fixing quality flaws, or complementing Wikipedia's ontology. Text reuse outside
Wikipedia yields a tangible metric for the emerging field of quantifying Wikipedia's
influence on the web. To foster future research into these tasks, and for reproducibility's
sake, the Wikipedia text reuse corpus and the retrieval pipeline are made freely
available.
author:
- first_name: Milad
full_name: Alshomary, Milad
id: '73059'
last_name: Alshomary
- first_name: Michael
full_name: Völske, Michael
last_name: Völske
- first_name: Tristan
full_name: Licht, Tristan
last_name: Licht
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
- first_name: Benno
full_name: Stein, Benno
last_name: Stein
- first_name: Matthias
full_name: Hagen, Matthias
last_name: Hagen
- first_name: Martin
full_name: Potthast, Martin
last_name: Potthast
citation:
ama: 'Alshomary M, Völske M, Licht T, et al. Wikipedia Text Reuse: Within and Without.
In: Azzopardi L, Stein B, Fuhr N, Mayr P, Hauff C, Hiemstra D, eds. Advances
in Information Retrieval. Cham: Springer International Publishing; 2019:747-754.'
apa: 'Alshomary, M., Völske, M., Licht, T., Wachsmuth, H., Stein, B., Hagen, M.,
& Potthast, M. (2019). Wikipedia Text Reuse: Within and Without. In L. Azzopardi,
B. Stein, N. Fuhr, P. Mayr, C. Hauff, & D. Hiemstra (Eds.), Advances in
Information Retrieval (pp. 747–754). Cham: Springer International Publishing.'
bibtex: '@inproceedings{Alshomary_Völske_Licht_Wachsmuth_Stein_Hagen_Potthast_2019,
place={Cham}, title={Wikipedia Text Reuse: Within and Without}, booktitle={Advances
in Information Retrieval}, publisher={Springer International Publishing}, author={Alshomary,
Milad and Völske, Michael and Licht, Tristan and Wachsmuth, Henning and Stein,
Benno and Hagen, Matthias and Potthast, Martin}, editor={Azzopardi, Leif and Stein,
Benno and Fuhr, Norbert and Mayr, Philipp and Hauff, Claudia and Hiemstra, DjoerdEditors},
year={2019}, pages={747–754} }'
chicago: 'Alshomary, Milad, Michael Völske, Tristan Licht, Henning Wachsmuth, Benno
Stein, Matthias Hagen, and Martin Potthast. “Wikipedia Text Reuse: Within and
Without.” In Advances in Information Retrieval, edited by Leif Azzopardi,
Benno Stein, Norbert Fuhr, Philipp Mayr, Claudia Hauff, and Djoerd Hiemstra, 747–54.
Cham: Springer International Publishing, 2019.'
ieee: 'M. Alshomary et al., “Wikipedia Text Reuse: Within and Without,” in
Advances in Information Retrieval, 2019, pp. 747–754.'
mla: 'Alshomary, Milad, et al. “Wikipedia Text Reuse: Within and Without.” Advances
in Information Retrieval, edited by Leif Azzopardi et al., Springer International
Publishing, 2019, pp. 747–54.'
short: 'M. Alshomary, M. Völske, T. Licht, H. Wachsmuth, B. Stein, M. Hagen, M.
Potthast, in: L. Azzopardi, B. Stein, N. Fuhr, P. Mayr, C. Hauff, D. Hiemstra
(Eds.), Advances in Information Retrieval, Springer International Publishing,
Cham, 2019, pp. 747–754.'
date_created: 2019-06-21T08:59:32Z
date_updated: 2022-01-06T06:50:34Z
department:
- _id: '600'
editor:
- first_name: Leif
full_name: Azzopardi, Leif
last_name: Azzopardi
- first_name: Benno
full_name: Stein, Benno
last_name: Stein
- first_name: Norbert
full_name: Fuhr, Norbert
last_name: Fuhr
- first_name: Philipp
full_name: Mayr, Philipp
last_name: Mayr
- first_name: Claudia
full_name: Hauff, Claudia
last_name: Hauff
- first_name: Djoerd
full_name: Hiemstra, Djoerd
last_name: Hiemstra
language:
- iso: eng
main_file_link:
- url: https://webis.de/downloads/publications/papers/stein_2019c.pdf
page: 747-754
place: Cham
publication: Advances in Information Retrieval
publication_identifier:
isbn:
- 978-3-030-15712-8
publisher: Springer International Publishing
status: public
title: 'Wikipedia Text Reuse: Within and Without'
type: conference
user_id: '82920'
year: '2019'
...
---
_id: '10306'
author:
- first_name: Laurens Alexander
full_name: Porzenheim, Laurens Alexander
id: '47434'
last_name: Porzenheim
citation:
ama: Porzenheim LA. Post-Quantum Secure Group Signatures.; 2019.
apa: Porzenheim, L. A. (2019). Post-Quantum Secure Group Signatures.
bibtex: '@book{Porzenheim_2019, title={Post-Quantum Secure Group Signatures}, author={Porzenheim,
Laurens Alexander}, year={2019} }'
chicago: Porzenheim, Laurens Alexander. Post-Quantum Secure Group Signatures,
2019.
ieee: L. A. Porzenheim, Post-Quantum Secure Group Signatures. 2019.
mla: Porzenheim, Laurens Alexander. Post-Quantum Secure Group Signatures.
2019.
short: L.A. Porzenheim, Post-Quantum Secure Group Signatures, 2019.
date_created: 2019-06-26T09:12:47Z
date_updated: 2022-01-06T06:50:36Z
ddc:
- '000'
department:
- _id: '64'
file:
- access_level: open_access
content_type: application/pdf
creator: laurensp
date_created: 2019-06-26T09:08:23Z
date_updated: 2019-06-26T09:19:15Z
file_id: '10307'
file_name: thesis_final.pdf
file_size: 899233
relation: main_file
file_date_updated: 2019-06-26T09:19:15Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Post-Quantum Secure Group Signatures
type: mastersthesis
user_id: '47434'
year: '2019'
...
---
_id: '10325'
author:
- first_name: Manuel
full_name: Peuster, Manuel
id: '13271'
last_name: Peuster
- first_name: Michael
full_name: Marchetti, Michael
last_name: Marchetti
- first_name: Gerardo
full_name: García de Blas, Gerardo
last_name: García de Blas
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: Peuster M, Marchetti M, García de Blas G, Karl H. Automated testing of NFV
orchestrators against carrier-grade multi-PoP scenarios using emulation-based
smoke testing. EURASIP Journal on Wireless Communications and Networking.
2019. doi:10.1186/s13638-019-1493-2
apa: Peuster, M., Marchetti, M., García de Blas, G., & Karl, H. (2019). Automated
testing of NFV orchestrators against carrier-grade multi-PoP scenarios using emulation-based
smoke testing. EURASIP Journal on Wireless Communications and Networking.
https://doi.org/10.1186/s13638-019-1493-2
bibtex: '@article{Peuster_Marchetti_García de Blas_Karl_2019, title={Automated testing
of NFV orchestrators against carrier-grade multi-PoP scenarios using emulation-based
smoke testing}, DOI={10.1186/s13638-019-1493-2},
journal={EURASIP Journal on Wireless Communications and Networking}, publisher={Springer},
author={Peuster, Manuel and Marchetti, Michael and García de Blas, Gerardo and
Karl, Holger}, year={2019} }'
chicago: Peuster, Manuel, Michael Marchetti, Gerardo García de Blas, and Holger
Karl. “Automated Testing of NFV Orchestrators against Carrier-Grade Multi-PoP
Scenarios Using Emulation-Based Smoke Testing.” EURASIP Journal on Wireless
Communications and Networking, 2019. https://doi.org/10.1186/s13638-019-1493-2.
ieee: M. Peuster, M. Marchetti, G. García de Blas, and H. Karl, “Automated testing
of NFV orchestrators against carrier-grade multi-PoP scenarios using emulation-based
smoke testing,” EURASIP Journal on Wireless Communications and Networking,
2019.
mla: Peuster, Manuel, et al. “Automated Testing of NFV Orchestrators against Carrier-Grade
Multi-PoP Scenarios Using Emulation-Based Smoke Testing.” EURASIP Journal on
Wireless Communications and Networking, Springer, 2019, doi:10.1186/s13638-019-1493-2.
short: M. Peuster, M. Marchetti, G. García de Blas, H. Karl, EURASIP Journal on
Wireless Communications and Networking (2019).
date_created: 2019-06-27T06:42:38Z
date_updated: 2022-01-06T06:50:37Z
ddc:
- '004'
department:
- _id: '75'
doi: 10.1186/s13638-019-1493-2
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2019-08-26T11:13:00Z
date_updated: 2019-08-26T11:13:00Z
file_id: '12963'
file_name: s13638-019-1493-2.pdf
file_size: 1750901
relation: main_file
success: 1
file_date_updated: 2019-08-26T11:13:00Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://jwcn-eurasipjournals.springeropen.com/articles/10.1186/s13638-019-1493-2
oa: '1'
project:
- _id: '28'
grant_number: '761493'
name: 5G Development and validation platform for global industry-specific network
services and Apps
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publication: EURASIP Journal on Wireless Communications and Networking
publication_identifier:
issn:
- 1687-1499
publication_status: published
publisher: Springer
status: public
title: Automated testing of NFV orchestrators against carrier-grade multi-PoP scenarios
using emulation-based smoke testing
type: journal_article
user_id: '477'
year: '2019'
...
---
_id: '10344'
author:
- first_name: Simon
full_name: Pukrop, Simon
last_name: Pukrop
citation:
ama: Pukrop S. Scheduling Algorithms for Multi-Operation Jobs with Setups on
a Single Machine. Universität Paderborn; 2019.
apa: Pukrop, S. (2019). Scheduling Algorithms for Multi-Operation Jobs with Setups
on a Single Machine. Universität Paderborn.
bibtex: '@book{Pukrop_2019, title={Scheduling Algorithms for Multi-Operation Jobs
with Setups on a Single Machine}, publisher={Universität Paderborn}, author={Pukrop,
Simon}, year={2019} }'
chicago: Pukrop, Simon. Scheduling Algorithms for Multi-Operation Jobs with Setups
on a Single Machine. Universität Paderborn, 2019.
ieee: S. Pukrop, Scheduling Algorithms for Multi-Operation Jobs with Setups on
a Single Machine. Universität Paderborn, 2019.
mla: Pukrop, Simon. Scheduling Algorithms for Multi-Operation Jobs with Setups
on a Single Machine. Universität Paderborn, 2019.
short: S. Pukrop, Scheduling Algorithms for Multi-Operation Jobs with Setups on
a Single Machine, Universität Paderborn, 2019.
date_created: 2019-07-04T07:21:19Z
date_updated: 2022-01-06T06:50:37Z
department:
- _id: '63'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
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: Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine
type: mastersthesis
user_id: '477'
year: '2019'
...
---
_id: '13554'
abstract:
- lang: eng
text: We propose a novel personal reputation system for cross-platform reputation.
We observe that, in certain usage scenarios, e.g. crowd work, the rater anonymity
property typically imposed on reputation systems is not necessary. Instead, we
propose a relaxed notion of rater anonymity that is more applicable in the crowd
work scenario. This allows us to construct a secure personal reputation system
from simple cryptographic primitives.
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Nils
full_name: Löken, Nils
id: '13703'
last_name: Löken
citation:
ama: 'Blömer J, Löken N. Personal Cross-Platform Reputation. In: Security and
Trust Management, STM 2019. Vol 11738. LNCS. ; 2019. doi:10.1007/978-3-030-31511-5_9'
apa: Blömer, J., & Löken, N. (2019). Personal Cross-Platform Reputation. In
Security and Trust Management, STM 2019 (Vol. 11738). https://doi.org/10.1007/978-3-030-31511-5_9
bibtex: '@inproceedings{Blömer_Löken_2019, series={LNCS}, title={Personal Cross-Platform
Reputation}, volume={11738}, DOI={10.1007/978-3-030-31511-5_9},
booktitle={Security and Trust Management, STM 2019}, author={Blömer, Johannes
and Löken, Nils}, year={2019}, collection={LNCS} }'
chicago: Blömer, Johannes, and Nils Löken. “Personal Cross-Platform Reputation.”
In Security and Trust Management, STM 2019, Vol. 11738. LNCS, 2019. https://doi.org/10.1007/978-3-030-31511-5_9.
ieee: J. Blömer and N. Löken, “Personal Cross-Platform Reputation,” in Security
and Trust Management, STM 2019, 2019, vol. 11738.
mla: Blömer, Johannes, and Nils Löken. “Personal Cross-Platform Reputation.” Security
and Trust Management, STM 2019, vol. 11738, 2019, doi:10.1007/978-3-030-31511-5_9.
short: 'J. Blömer, N. Löken, in: Security and Trust Management, STM 2019, 2019.'
conference:
name: Security and Trust Management, STM 2019
date_created: 2019-10-01T07:50:03Z
date_updated: 2022-01-06T06:51:38Z
ddc:
- '000'
department:
- _id: '568'
- _id: '64'
doi: 10.1007/978-3-030-31511-5_9
file:
- access_level: open_access
content_type: application/pdf
creator: nilo
date_created: 2019-10-01T07:45:17Z
date_updated: 2019-10-01T07:45:17Z
description: This is an author's version of the paper presented at STM 2019.
file_id: '13555'
file_name: informal.pdf
file_size: 507736
relation: main_file
title: Personal cross-platform reputation, author's version
file_date_updated: 2019-10-01T07:45:17Z
has_accepted_license: '1'
intvolume: ' 11738'
language:
- iso: eng
oa: '1'
publication: Security and Trust Management, STM 2019
series_title: LNCS
status: public
title: Personal Cross-Platform Reputation
type: conference
user_id: '13703'
volume: 11738
year: '2019'
...
---
_id: '13557'
abstract:
- lang: eng
text: We present a searchable encryption scheme for dynamic document collections
in a multi-user scenario. Our scheme features fine-grained access control to search
results, as well as access control to operations such as adding documents to the
document collection, or changing individual documents. The scheme features verifiability
of search results. Our scheme also satisfies the forward privacy notion crucial
for the security of dynamic searchable encryption schemes.
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Nils
full_name: Löken, Nils
id: '13703'
last_name: Löken
citation:
ama: 'Blömer J, Löken N. Dynamic Searchable Encryption with Access Control. In:
12th International Symposium on Foundations and Practice of Security, FPS 2019.
Vol 12056. LNCS. Springer; 2019.'
apa: Blömer, J., & Löken, N. (2019). Dynamic Searchable Encryption with Access
Control. In 12th International Symposium on Foundations and Practice of Security,
FPS 2019 (Vol. 12056). Springer.
bibtex: '@inproceedings{Blömer_Löken_2019, series={LNCS}, title={Dynamic Searchable
Encryption with Access Control}, volume={12056}, booktitle={12th International
Symposium on Foundations and Practice of Security, FPS 2019}, publisher={Springer},
author={Blömer, Johannes and Löken, Nils}, year={2019}, collection={LNCS} }'
chicago: Blömer, Johannes, and Nils Löken. “Dynamic Searchable Encryption with Access
Control.” In 12th International Symposium on Foundations and Practice of Security,
FPS 2019, Vol. 12056. LNCS. Springer, 2019.
ieee: J. Blömer and N. Löken, “Dynamic Searchable Encryption with Access Control,”
in 12th International Symposium on Foundations and Practice of Security, FPS
2019, 2019, vol. 12056.
mla: Blömer, Johannes, and Nils Löken. “Dynamic Searchable Encryption with Access
Control.” 12th International Symposium on Foundations and Practice of Security,
FPS 2019, vol. 12056, Springer, 2019.
short: 'J. Blömer, N. Löken, in: 12th International Symposium on Foundations and
Practice of Security, FPS 2019, Springer, 2019.'
date_created: 2019-10-01T08:05:31Z
date_updated: 2022-01-06T06:51:38Z
department:
- _id: '64'
- _id: '568'
intvolume: ' 12056'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://eprint.iacr.org/2019/1038
oa: '1'
publication: 12th International Symposium on Foundations and Practice of Security,
FPS 2019
publisher: Springer
series_title: LNCS
status: public
title: Dynamic Searchable Encryption with Access Control
type: conference
user_id: '13703'
volume: 12056
year: '2019'
...
---
_id: '13592'
author:
- first_name: Matthias
full_name: Pilot, Matthias
last_name: Pilot
citation:
ama: Pilot M. Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography
in Java. Universität Paderborn; 2019.
apa: Pilot, M. (2019). Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography
in Java. Universität Paderborn.
bibtex: '@book{Pilot_2019, title={Efficient Finite-Field Arithmetic for Elliptic
Curve Cryptography in Java}, publisher={Universität Paderborn}, author={Pilot,
Matthias}, year={2019} }'
chicago: Pilot, Matthias. Efficient Finite-Field Arithmetic for Elliptic Curve
Cryptography in Java. Universität Paderborn, 2019.
ieee: M. Pilot, Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography
in Java. Universität Paderborn, 2019.
mla: Pilot, Matthias. Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography
in Java. Universität Paderborn, 2019.
short: M. Pilot, Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography
in Java, Universität Paderborn, 2019.
date_created: 2019-10-03T12:30:24Z
date_updated: 2022-01-06T06:51:40Z
department:
- _id: '7'
- _id: '64'
extern: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography in Java
type: bachelorsthesis
user_id: '477'
year: '2019'
...
---
_id: '13648'
author:
- first_name: Swante
full_name: Scholz, Swante
last_name: Scholz
citation:
ama: Scholz S. Implementation and Comparison of Elliptic Curve Algorithms in
Java. Universität Paderborn; 2019.
apa: Scholz, S. (2019). Implementation and Comparison of Elliptic Curve Algorithms
in Java. Universität Paderborn.
bibtex: '@book{Scholz_2019, title={Implementation and Comparison of Elliptic Curve
Algorithms in Java}, publisher={Universität Paderborn}, author={Scholz, Swante},
year={2019} }'
chicago: Scholz, Swante. Implementation and Comparison of Elliptic Curve Algorithms
in Java. Universität Paderborn, 2019.
ieee: S. Scholz, Implementation and Comparison of Elliptic Curve Algorithms in
Java. Universität Paderborn, 2019.
mla: Scholz, Swante. Implementation and Comparison of Elliptic Curve Algorithms
in Java. Universität Paderborn, 2019.
short: S. Scholz, Implementation and Comparison of Elliptic Curve Algorithms in
Java, Universität Paderborn, 2019.
date_created: 2019-10-07T09:56:58Z
date_updated: 2022-01-06T06:51:41Z
ddc:
- '000'
department:
- _id: '7'
- _id: '64'
extern: '1'
file:
- access_level: open_access
content_type: application/pdf
creator: jbobolz
date_created: 2020-04-27T10:32:00Z
date_updated: 2020-04-27T10:33:59Z
file_id: '16871'
file_name: sscholz-MA-thesis-final.pdf
file_size: 1714805
relation: main_file
file_date_updated: 2020-04-27T10:33:59Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Implementation and Comparison of Elliptic Curve Algorithms in Java
type: mastersthesis
user_id: '477'
year: '2019'
...
---
_id: '13652'
author:
- first_name: Kristian
full_name: Hinnenthal, Kristian
id: '32229'
last_name: Hinnenthal
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Martijn
full_name: Struijs, Martijn
last_name: Struijs
citation:
ama: 'Hinnenthal K, Scheideler C, Struijs M. Fast Distributed Algorithms for LP-Type
Problems of Low Dimension. In: 33rd International Symposium on Distributed
Computing (DISC 2019). ; 2019. doi:10.4230/LIPICS.DISC.2019.23'
apa: Hinnenthal, K., Scheideler, C., & Struijs, M. (2019). Fast Distributed
Algorithms for LP-Type Problems of Low Dimension. In 33rd International Symposium
on Distributed Computing (DISC 2019). https://doi.org/10.4230/LIPICS.DISC.2019.23
bibtex: '@inproceedings{Hinnenthal_Scheideler_Struijs_2019, title={Fast Distributed
Algorithms for LP-Type Problems of Low Dimension}, DOI={10.4230/LIPICS.DISC.2019.23},
booktitle={33rd International Symposium on Distributed Computing (DISC 2019)},
author={Hinnenthal, Kristian and Scheideler, Christian and Struijs, Martijn},
year={2019} }'
chicago: Hinnenthal, Kristian, Christian Scheideler, and Martijn Struijs. “Fast
Distributed Algorithms for LP-Type Problems of Low Dimension.” In 33rd International
Symposium on Distributed Computing (DISC 2019), 2019. https://doi.org/10.4230/LIPICS.DISC.2019.23.
ieee: K. Hinnenthal, C. Scheideler, and M. Struijs, “Fast Distributed Algorithms
for LP-Type Problems of Low Dimension,” in 33rd International Symposium on
Distributed Computing (DISC 2019), 2019.
mla: Hinnenthal, Kristian, et al. “Fast Distributed Algorithms for LP-Type Problems
of Low Dimension.” 33rd International Symposium on Distributed Computing (DISC
2019), 2019, doi:10.4230/LIPICS.DISC.2019.23.
short: 'K. Hinnenthal, C. Scheideler, M. Struijs, in: 33rd International Symposium
on Distributed Computing (DISC 2019), 2019.'
date_created: 2019-10-08T11:53:38Z
date_updated: 2022-01-06T06:51:41Z
department:
- _id: '79'
doi: 10.4230/LIPICS.DISC.2019.23
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: 33rd International Symposium on Distributed Computing (DISC 2019)
status: public
title: Fast Distributed Algorithms for LP-Type Problems of Low Dimension
type: conference
user_id: '32229'
year: '2019'
...
---
_id: '13679'
author:
- first_name: Sascha
full_name: Brauer, Sascha
id: '13291'
last_name: Brauer
citation:
ama: Brauer S. Classification and Approximation of Geometric Location Problems.
Paderborn; 2019. doi:10.17619/UNIPB/1-816
apa: Brauer, S. (2019). Classification and Approximation of Geometric Location
Problems. Paderborn. https://doi.org/10.17619/UNIPB/1-816
bibtex: '@book{Brauer_2019, place={Paderborn}, title={Classification and Approximation
of Geometric Location Problems}, DOI={10.17619/UNIPB/1-816},
author={Brauer, Sascha}, year={2019} }'
chicago: Brauer, Sascha. Classification and Approximation of Geometric Location
Problems. Paderborn, 2019. https://doi.org/10.17619/UNIPB/1-816.
ieee: S. Brauer, Classification and Approximation of Geometric Location Problems.
Paderborn, 2019.
mla: Brauer, Sascha. Classification and Approximation of Geometric Location Problems.
2019, doi:10.17619/UNIPB/1-816.
short: S. Brauer, Classification and Approximation of Geometric Location Problems,
Paderborn, 2019.
date_created: 2019-10-09T10:00:53Z
date_updated: 2022-01-06T06:51:41Z
department:
- _id: '64'
doi: 10.17619/UNIPB/1-816
language:
- iso: eng
place: Paderborn
project:
- _id: '45'
name: Soft-Clustering - Von Heuristiken zu Approximationsalgorithmen
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Classification and Approximation of Geometric Location Problems
type: dissertation
user_id: '13291'
year: '2019'
...