---
_id: '699'
author:
- first_name: Jannik
full_name: Sundermeier, Jannik
id: '38705'
last_name: Sundermeier
citation:
ama: Sundermeier J. Routing in Hybrid Communication Networks with Holes - Considering
Bounding Boxes as Hole Abstractions. Universität Paderborn; 2017.
apa: Sundermeier, J. (2017). Routing in Hybrid Communication Networks with Holes
- Considering Bounding Boxes as Hole Abstractions. Universität Paderborn.
bibtex: '@book{Sundermeier_2017, title={Routing in Hybrid Communication Networks
with Holes - Considering Bounding Boxes as Hole Abstractions}, publisher={Universität
Paderborn}, author={Sundermeier, Jannik}, year={2017} }'
chicago: Sundermeier, Jannik. Routing in Hybrid Communication Networks with Holes
- Considering Bounding Boxes as Hole Abstractions. Universität Paderborn,
2017.
ieee: J. Sundermeier, Routing in Hybrid Communication Networks with Holes - Considering
Bounding Boxes as Hole Abstractions. Universität Paderborn, 2017.
mla: Sundermeier, Jannik. Routing in Hybrid Communication Networks with Holes
- Considering Bounding Boxes as Hole Abstractions. Universität Paderborn,
2017.
short: J. Sundermeier, Routing in Hybrid Communication Networks with Holes - Considering
Bounding Boxes as Hole Abstractions, Universität Paderborn, 2017.
date_created: 2017-11-14T08:03:45Z
date_updated: 2022-01-06T07:03:25Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Routing in Hybrid Communication Networks with Holes - Considering Bounding
Boxes as Hole Abstractions
type: mastersthesis
user_id: '38705'
year: '2017'
...
---
_id: '70'
author:
- first_name: Björn
full_name: Feldkord, Björn
id: '22704'
last_name: Feldkord
- first_name: Christine
full_name: Markarian, Christine
id: '37612'
last_name: Markarian
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Feldkord B, Markarian C, Meyer auf der Heide F. Price Fluctuations in Online
Leasing. In: Proceedings of the 11th Annual International Conference on Combinatorial
Optimization and Applications (COCOA). ; 2017:17-31. doi:10.1007/978-3-319-71147-8_2'
apa: Feldkord, B., Markarian, C., & Meyer auf der Heide, F. (2017). Price Fluctuations
in Online Leasing. In Proceedings of the 11th Annual International Conference
on Combinatorial Optimization and Applications (COCOA) (pp. 17–31). https://doi.org/10.1007/978-3-319-71147-8_2
bibtex: '@inproceedings{Feldkord_Markarian_Meyer auf der Heide_2017, title={Price
Fluctuations in Online Leasing}, DOI={10.1007/978-3-319-71147-8_2},
booktitle={Proceedings of the 11th Annual International Conference on Combinatorial
Optimization and Applications (COCOA)}, author={Feldkord, Björn and Markarian,
Christine and Meyer auf der Heide, Friedhelm}, year={2017}, pages={17–31} }'
chicago: Feldkord, Björn, Christine Markarian, and Friedhelm Meyer auf der Heide.
“Price Fluctuations in Online Leasing.” In Proceedings of the 11th Annual International
Conference on Combinatorial Optimization and Applications (COCOA), 17–31,
2017. https://doi.org/10.1007/978-3-319-71147-8_2.
ieee: B. Feldkord, C. Markarian, and F. Meyer auf der Heide, “Price Fluctuations
in Online Leasing,” in Proceedings of the 11th Annual International Conference
on Combinatorial Optimization and Applications (COCOA), 2017, pp. 17–31.
mla: Feldkord, Björn, et al. “Price Fluctuations in Online Leasing.” Proceedings
of the 11th Annual International Conference on Combinatorial Optimization and
Applications (COCOA), 2017, pp. 17–31, doi:10.1007/978-3-319-71147-8_2.
short: 'B. Feldkord, C. Markarian, F. Meyer auf der Heide, in: Proceedings of the
11th Annual International Conference on Combinatorial Optimization and Applications
(COCOA), 2017, pp. 17–31.'
date_created: 2017-10-17T12:41:05Z
date_updated: 2022-01-06T07:03:26Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/978-3-319-71147-8_2
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:06:13Z
date_updated: 2018-11-02T15:06:13Z
file_id: '5293'
file_name: PriceFluctuationInOnlineLeasin.pdf
file_size: 287315
relation: main_file
success: 1
file_date_updated: 2018-11-02T15:06:13Z
has_accepted_license: '1'
language:
- iso: eng
page: 17 - 31
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 11th Annual International Conference on Combinatorial
Optimization and Applications (COCOA)
status: public
title: Price Fluctuations in Online Leasing
type: conference
user_id: '477'
year: '2017'
...
---
_id: '700'
author:
- first_name: Till
full_name: Knollmann, Till
last_name: Knollmann
citation:
ama: Knollmann T. A Self-Stabilizing Protocol for Graphs of Diameter Two.
Universität Paderborn; 2017.
apa: Knollmann, T. (2017). A Self-Stabilizing Protocol for Graphs of Diameter
Two. Universität Paderborn.
bibtex: '@book{Knollmann_2017, title={A Self-Stabilizing Protocol for Graphs of
Diameter Two}, publisher={Universität Paderborn}, author={Knollmann, Till}, year={2017}
}'
chicago: Knollmann, Till. A Self-Stabilizing Protocol for Graphs of Diameter
Two. Universität Paderborn, 2017.
ieee: T. Knollmann, A Self-Stabilizing Protocol for Graphs of Diameter Two.
Universität Paderborn, 2017.
mla: Knollmann, Till. A Self-Stabilizing Protocol for Graphs of Diameter Two.
Universität Paderborn, 2017.
short: T. Knollmann, A Self-Stabilizing Protocol for Graphs of Diameter Two, Universität
Paderborn, 2017.
date_created: 2017-11-14T08:04:35Z
date_updated: 2022-01-06T07:03:26Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: A Self-Stabilizing Protocol for Graphs of Diameter Two
type: mastersthesis
user_id: '477'
year: '2017'
...
---
_id: '701'
author:
- first_name: Thorsten
full_name: Götte, Thorsten
id: '34727'
last_name: Götte
citation:
ama: Götte T. Self-Stabilizing Spanners for Tree Metrics. Universität Paderborn;
2017.
apa: Götte, T. (2017). Self-Stabilizing Spanners for Tree Metrics. Universität
Paderborn.
bibtex: '@book{Götte_2017, title={Self-Stabilizing Spanners for Tree Metrics}, publisher={Universität
Paderborn}, author={Götte, Thorsten}, year={2017} }'
chicago: Götte, Thorsten. Self-Stabilizing Spanners for Tree Metrics. Universität
Paderborn, 2017.
ieee: T. Götte, Self-Stabilizing Spanners for Tree Metrics. Universität Paderborn,
2017.
mla: Götte, Thorsten. Self-Stabilizing Spanners for Tree Metrics. Universität
Paderborn, 2017.
short: T. Götte, Self-Stabilizing Spanners for Tree Metrics, Universität Paderborn,
2017.
date_created: 2017-11-14T09:32:39Z
date_updated: 2022-01-06T07:03:26Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Self-Stabilizing Spanners for Tree Metrics
type: mastersthesis
user_id: '477'
year: '2017'
...
---
_id: '7011'
author:
- first_name: André
full_name: Hottung, André
last_name: Hottung
- first_name: Shunji
full_name: Tanaka, Shunji
last_name: Tanaka
- first_name: Kevin
full_name: Tierney, Kevin
last_name: Tierney
citation:
ama: Hottung A, Tanaka S, Tierney K. Deep Learning Assisted Heuristic Tree Search
for the Container Pre-marshalling Problem. CoRR abs/170909972. 2017.
apa: Hottung, A., Tanaka, S., & Tierney, K. (2017). Deep Learning Assisted Heuristic
Tree Search for the Container Pre-marshalling Problem. CoRR Abs/1709.09972.
bibtex: '@article{Hottung_Tanaka_Tierney_2017, title={Deep Learning Assisted Heuristic
Tree Search for the Container Pre-marshalling Problem}, journal={CoRR abs/1709.09972},
author={Hottung, André and Tanaka, Shunji and Tierney, Kevin}, year={2017} }'
chicago: Hottung, André, Shunji Tanaka, and Kevin Tierney. “Deep Learning Assisted
Heuristic Tree Search for the Container Pre-Marshalling Problem.” CoRR Abs/1709.09972,
2017.
ieee: A. Hottung, S. Tanaka, and K. Tierney, “Deep Learning Assisted Heuristic Tree
Search for the Container Pre-marshalling Problem,” CoRR abs/1709.09972,
2017.
mla: Hottung, André, et al. “Deep Learning Assisted Heuristic Tree Search for the
Container Pre-Marshalling Problem.” CoRR Abs/1709.09972, 2017.
short: A. Hottung, S. Tanaka, K. Tierney, CoRR Abs/1709.09972 (2017).
date_created: 2019-01-28T08:25:16Z
date_updated: 2022-01-06T07:03:26Z
department:
- _id: '66'
language:
- iso: eng
publication: CoRR abs/1709.09972
status: public
title: Deep Learning Assisted Heuristic Tree Search for the Container Pre-marshalling
Problem
type: journal_article
user_id: '52534'
year: '2017'
...
---
_id: '7012'
author:
- first_name: Masud
full_name: Fazal-Baqaie, Masud
last_name: Fazal-Baqaie
- first_name: Baris
full_name: Güldali, Baris
last_name: Güldali
- first_name: Simon
full_name: Oberthür, Simon
id: '383'
last_name: Oberthür
citation:
ama: Fazal-Baqaie M, Güldali B, Oberthür S. Towards DevOps in Multi-provider Projects.
CSE@SE 2017. 2017:18-21.
apa: Fazal-Baqaie, M., Güldali, B., & Oberthür, S. (2017). Towards DevOps in
Multi-provider Projects. CSE@SE 2017, 18–21.
bibtex: '@article{Fazal-Baqaie_Güldali_Oberthür_2017, title={Towards DevOps in Multi-provider
Projects}, journal={CSE@SE 2017}, author={Fazal-Baqaie, Masud and Güldali, Baris
and Oberthür, Simon}, year={2017}, pages={18–21} }'
chicago: Fazal-Baqaie, Masud, Baris Güldali, and Simon Oberthür. “Towards DevOps
in Multi-Provider Projects.” CSE@SE 2017, 2017, 18–21.
ieee: M. Fazal-Baqaie, B. Güldali, and S. Oberthür, “Towards DevOps in Multi-provider
Projects,” CSE@SE 2017, pp. 18–21, 2017.
mla: Fazal-Baqaie, Masud, et al. “Towards DevOps in Multi-Provider Projects.” CSE@SE
2017, 2017, pp. 18–21.
short: M. Fazal-Baqaie, B. Güldali, S. Oberthür, CSE@SE 2017 (2017) 18–21.
date_created: 2019-01-28T08:28:26Z
date_updated: 2022-01-06T07:03:26Z
department:
- _id: '66'
language:
- iso: eng
page: 18-21
publication: CSE@SE 2017
status: public
title: Towards DevOps in Multi-provider Projects
type: journal_article
user_id: '52534'
year: '2017'
...
---
_id: '703'
author:
- first_name: Pavel
full_name: Podlipyan, Pavel
last_name: Podlipyan
citation:
ama: Podlipyan P. Local Algorithms for the Continuous Gathering Problem.
Universität Paderborn; 2017. doi:10.17619/UNIPB/1-230
apa: Podlipyan, P. (2017). Local Algorithms for the Continuous Gathering Problem.
Universität Paderborn. https://doi.org/10.17619/UNIPB/1-230
bibtex: '@book{Podlipyan_2017, title={Local Algorithms for the Continuous Gathering
Problem}, DOI={10.17619/UNIPB/1-230},
publisher={Universität Paderborn}, author={Podlipyan, Pavel}, year={2017} }'
chicago: Podlipyan, Pavel. Local Algorithms for the Continuous Gathering Problem.
Universität Paderborn, 2017. https://doi.org/10.17619/UNIPB/1-230.
ieee: P. Podlipyan, Local Algorithms for the Continuous Gathering Problem.
Universität Paderborn, 2017.
mla: Podlipyan, Pavel. Local Algorithms for the Continuous Gathering Problem.
Universität Paderborn, 2017, doi:10.17619/UNIPB/1-230.
short: P. Podlipyan, Local Algorithms for the Continuous Gathering Problem, Universität
Paderborn, 2017.
date_created: 2017-11-14T14:13:21Z
date_updated: 2022-01-06T07:03:26Z
department:
- _id: '63'
doi: 10.17619/UNIPB/1-230
language:
- iso: eng
publisher: Universität Paderborn
related_material:
link:
- relation: confirmation
url: https://doi.org/10.17619/UNIPB/1-230
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Local Algorithms for the Continuous Gathering Problem
type: dissertation
user_id: '15415'
year: '2017'
...
---
_id: '704'
author:
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
citation:
ama: Riechers S. Scheduling with Scarce Resources. Universität Paderborn;
2017. doi:10.17619/UNIPB/1-231
apa: Riechers, S. (2017). Scheduling with Scarce Resources. Universität Paderborn.
https://doi.org/10.17619/UNIPB/1-231
bibtex: '@book{Riechers_2017, title={Scheduling with Scarce Resources}, DOI={10.17619/UNIPB/1-231}, publisher={Universität
Paderborn}, author={Riechers, Sören}, year={2017} }'
chicago: Riechers, Sören. Scheduling with Scarce Resources. Universität Paderborn,
2017. https://doi.org/10.17619/UNIPB/1-231.
ieee: S. Riechers, Scheduling with Scarce Resources. Universität Paderborn,
2017.
mla: Riechers, Sören. Scheduling with Scarce Resources. Universität Paderborn,
2017, doi:10.17619/UNIPB/1-231.
short: S. Riechers, Scheduling with Scarce Resources, Universität Paderborn, 2017.
date_created: 2017-11-15T07:51:07Z
date_updated: 2022-01-06T07:03:27Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.17619/UNIPB/1-231
file:
- access_level: closed
content_type: application/pdf
creator: feldi
date_created: 2018-11-14T15:18:37Z
date_updated: 2018-11-14T15:18:37Z
file_id: '5673'
file_name: thesisStable.pdf
file_size: 1491627
relation: main_file
success: 1
file_date_updated: 2018-11-14T15:18:37Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '4'
name: SFB 901 - Project Area C
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 with Scarce Resources
type: dissertation
user_id: '14052'
year: '2017'
...
---
_id: '706'
author:
- first_name: Alexander
full_name: Mäcker, Alexander
id: '13536'
last_name: Mäcker
- first_name: Manuel
full_name: Malatyali, Manuel
last_name: Malatyali
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
citation:
ama: Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Cost-efficient Scheduling
on Machines from the Cloud. Journal of Combinatorial Optimization. 2017;36(4):1168-1194.
doi:10.1007/s10878-017-0198-x
apa: Mäcker, A., Malatyali, M., Meyer auf der Heide, F., & Riechers, S. (2017).
Cost-efficient Scheduling on Machines from the Cloud. Journal of Combinatorial
Optimization, 36(4), 1168–1194. https://doi.org/10.1007/s10878-017-0198-x
bibtex: '@article{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2017, title={Cost-efficient
Scheduling on Machines from the Cloud}, volume={36}, DOI={10.1007/s10878-017-0198-x},
number={4}, journal={Journal of Combinatorial Optimization}, publisher={Springer},
author={Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm
and Riechers, Sören}, year={2017}, pages={1168–1194} }'
chicago: 'Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and
Sören Riechers. “Cost-Efficient Scheduling on Machines from the Cloud.” Journal
of Combinatorial Optimization 36, no. 4 (2017): 1168–94. https://doi.org/10.1007/s10878-017-0198-x.'
ieee: A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Cost-efficient
Scheduling on Machines from the Cloud,” Journal of Combinatorial Optimization,
vol. 36, no. 4, pp. 1168–1194, 2017.
mla: Mäcker, Alexander, et al. “Cost-Efficient Scheduling on Machines from the Cloud.”
Journal of Combinatorial Optimization, vol. 36, no. 4, Springer, 2017,
pp. 1168–94, doi:10.1007/s10878-017-0198-x.
short: A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, Journal of
Combinatorial Optimization 36 (2017) 1168–1194.
date_created: 2017-11-15T10:21:34Z
date_updated: 2022-01-06T07:03:27Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/s10878-017-0198-x
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-14T12:21:34Z
date_updated: 2018-03-14T12:21:34Z
file_id: '1210'
file_name: 706-chp_3A10.1007_2F978-3-319-48749-6_42.pdf
file_size: 608614
relation: main_file
success: 1
file_date_updated: 2018-03-14T12:21:34Z
has_accepted_license: '1'
intvolume: ' 36'
issue: '4'
language:
- iso: eng
page: 1168-1194
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '4'
name: SFB 901 - Project Area C
publication: Journal of Combinatorial Optimization
publisher: Springer
status: public
title: Cost-efficient Scheduling on Machines from the Cloud
type: journal_article
user_id: '15415'
volume: 36
year: '2017'
...
---
_id: '707'
author:
- first_name: Sven
full_name: Walther, Sven
last_name: Walther
citation:
ama: Walther S. Knowledge-Based Verification of Service Compositions. Universität
Paderborn; 2017. doi:10.17619/UNIPB/1-307
apa: Walther, S. (2017). Knowledge-based Verification of Service Compositions.
Universität Paderborn. https://doi.org/10.17619/UNIPB/1-307
bibtex: '@book{Walther_2017, title={Knowledge-based Verification of Service Compositions},
DOI={10.17619/UNIPB/1-307},
publisher={Universität Paderborn}, author={Walther, Sven}, year={2017} }'
chicago: Walther, Sven. Knowledge-Based Verification of Service Compositions.
Universität Paderborn, 2017. https://doi.org/10.17619/UNIPB/1-307.
ieee: S. Walther, Knowledge-based Verification of Service Compositions. Universität
Paderborn, 2017.
mla: Walther, Sven. Knowledge-Based Verification of Service Compositions.
Universität Paderborn, 2017, doi:10.17619/UNIPB/1-307.
short: S. Walther, Knowledge-Based Verification of Service Compositions, Universität
Paderborn, 2017.
date_created: 2017-11-20T07:59:31Z
date_updated: 2022-01-06T07:03:27Z
department:
- _id: '77'
doi: 10.17619/UNIPB/1-307
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subproject B3
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
title: Knowledge-based Verification of Service Compositions
type: dissertation
user_id: '477'
year: '2017'
...
---
_id: '708'
author:
- first_name: Arne
full_name: Schwabe, Arne
last_name: Schwabe
- first_name: Elisa
full_name: Rojas, Elisa
last_name: Rojas
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Schwabe A, Rojas E, Karl H. Minimizing downtimes: Using dynamic reconfiguration
and state management in SDN. In: 2017 {IEEE} Conference on Network Softwarization,
NetSoft 2017, Bologna, Italy, July 3-7, 2017. ; 2017:1--5. doi:10.1109/NETSOFT.2017.8004209'
apa: 'Schwabe, A., Rojas, E., & Karl, H. (2017). Minimizing downtimes: Using
dynamic reconfiguration and state management in SDN. In 2017 {IEEE} Conference
on Network Softwarization, NetSoft 2017, Bologna, Italy, July 3-7, 2017 (pp.
1--5). Bologna. https://doi.org/10.1109/NETSOFT.2017.8004209'
bibtex: '@inproceedings{Schwabe_Rojas_Karl_2017, title={Minimizing downtimes: Using
dynamic reconfiguration and state management in SDN}, DOI={10.1109/NETSOFT.2017.8004209},
booktitle={2017 {IEEE} Conference on Network Softwarization, NetSoft 2017, Bologna,
Italy, July 3-7, 2017}, author={Schwabe, Arne and Rojas, Elisa and Karl, Holger},
year={2017}, pages={1--5} }'
chicago: 'Schwabe, Arne, Elisa Rojas, and Holger Karl. “Minimizing Downtimes: Using
Dynamic Reconfiguration and State Management in SDN.” In 2017 {IEEE} Conference
on Network Softwarization, NetSoft 2017, Bologna, Italy, July 3-7, 2017, 1--5,
2017. https://doi.org/10.1109/NETSOFT.2017.8004209.'
ieee: 'A. Schwabe, E. Rojas, and H. Karl, “Minimizing downtimes: Using dynamic reconfiguration
and state management in SDN,” in 2017 {IEEE} Conference on Network Softwarization,
NetSoft 2017, Bologna, Italy, July 3-7, 2017, Bologna, 2017, pp. 1--5.'
mla: 'Schwabe, Arne, et al. “Minimizing Downtimes: Using Dynamic Reconfiguration
and State Management in SDN.” 2017 {IEEE} Conference on Network Softwarization,
NetSoft 2017, Bologna, Italy, July 3-7, 2017, 2017, pp. 1--5, doi:10.1109/NETSOFT.2017.8004209.'
short: 'A. Schwabe, E. Rojas, H. Karl, in: 2017 {IEEE} Conference on Network Softwarization,
NetSoft 2017, Bologna, Italy, July 3-7, 2017, 2017, pp. 1--5.'
conference:
location: Bologna
date_created: 2017-11-20T08:29:25Z
date_updated: 2022-01-06T07:03:27Z
department:
- _id: '75'
doi: 10.1109/NETSOFT.2017.8004209
page: 1--5
publication: 2017 {IEEE} Conference on Network Softwarization, NetSoft 2017, Bologna,
Italy, July 3-7, 2017
quality_controlled: '1'
status: public
title: 'Minimizing downtimes: Using dynamic reconfiguration and state management in
SDN'
type: conference
user_id: '15572'
year: '2017'
...
---
_id: '71'
abstract:
- lang: eng
text: Today, software verification tools have reached the maturity to be used for
large scale programs. Different tools perform differently well on varying code.
A software developer is hence faced with the problem of choosing a tool appropriate
for her program at hand. A ranking of tools on programs could facilitate the choice.
Such rankings can, however, so far only be obtained by running all considered
tools on the program.In this paper, we present a machine learning approach to
predicting rankings of tools on programs. The method builds upon so-called label
ranking algorithms, which we complement with appropriate kernels providing a similarity
measure for programs. Our kernels employ a graph representation for software source
code that mixes elements of control flow and program dependence graphs with abstract
syntax trees. Using data sets from the software verification competition SV-COMP,
we demonstrate our rank prediction technique to generalize well and achieve a
rather high predictive accuracy (rank correlation > 0.6).
author:
- first_name: Mike
full_name: Czech, Mike
last_name: Czech
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Czech M, Hüllermeier E, Jakobs M-C, Wehrheim H. Predicting Rankings of Software
Verification Tools. In: Proceedings of the 3rd International Workshop on Software
Analytics. SWAN’17. ; 2017:23-26. doi:10.1145/3121257.3121262'
apa: Czech, M., Hüllermeier, E., Jakobs, M.-C., & Wehrheim, H. (2017). Predicting
Rankings of Software Verification Tools. In Proceedings of the 3rd International
Workshop on Software Analytics (pp. 23–26). https://doi.org/10.1145/3121257.3121262
bibtex: '@inproceedings{Czech_Hüllermeier_Jakobs_Wehrheim_2017, series={SWAN’17},
title={Predicting Rankings of Software Verification Tools}, DOI={10.1145/3121257.3121262},
booktitle={Proceedings of the 3rd International Workshop on Software Analytics},
author={Czech, Mike and Hüllermeier, Eyke and Jakobs, Marie-Christine and Wehrheim,
Heike}, year={2017}, pages={23–26}, collection={SWAN’17} }'
chicago: Czech, Mike, Eyke Hüllermeier, Marie-Christine Jakobs, and Heike Wehrheim.
“Predicting Rankings of Software Verification Tools.” In Proceedings of the
3rd International Workshop on Software Analytics, 23–26. SWAN’17, 2017. https://doi.org/10.1145/3121257.3121262.
ieee: M. Czech, E. Hüllermeier, M.-C. Jakobs, and H. Wehrheim, “Predicting Rankings
of Software Verification Tools,” in Proceedings of the 3rd International Workshop
on Software Analytics, 2017, pp. 23–26.
mla: Czech, Mike, et al. “Predicting Rankings of Software Verification Tools.” Proceedings
of the 3rd International Workshop on Software Analytics, 2017, pp. 23–26,
doi:10.1145/3121257.3121262.
short: 'M. Czech, E. Hüllermeier, M.-C. Jakobs, H. Wehrheim, in: Proceedings of
the 3rd International Workshop on Software Analytics, 2017, pp. 23–26.'
date_created: 2017-10-17T12:41:05Z
date_updated: 2022-01-06T07:03:28Z
ddc:
- '000'
department:
- _id: '355'
- _id: '77'
doi: 10.1145/3121257.3121262
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:24:29Z
date_updated: 2018-11-02T14:24:29Z
file_id: '5271'
file_name: fsews17swan-swanmain1.pdf
file_size: 822383
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:24:29Z
has_accepted_license: '1'
language:
- iso: eng
page: 23-26
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '10'
name: SFB 901 - Subproject B2
- _id: '3'
name: SFB 901 - Project Area B
- _id: '11'
name: SFB 901 - Subproject B3
publication: Proceedings of the 3rd International Workshop on Software Analytics
series_title: SWAN'17
status: public
title: Predicting Rankings of Software Verification Tools
type: conference
user_id: '15504'
year: '2017'
...
---
_id: '717'
abstract:
- lang: eng
text: In conventional large-scale networks, creation and management of network services
are costly and complex tasks that often consume a lot of resources, including
time and manpower. Network softwarization and network function virtualization
have been introduced to tackle these problems, aiming at decreasing costs and
complexity of implementing new services, maintaining the implemented services,
and managing available resources in service provisioning platforms and underlying
infrastructures. To experience the full potential of these approaches, innovative
development support tools and service provisioning environments are needed. To
answer these needs, we introduce the architecture of the open-source SONATA system,
a service programming, orchestration, and management framework. We present a development
toolchain for virtualized network services, fully integrated with a service platform
and orchestration system. We introduce the modular and flexible architecture of
our system and discuss its main components and features, such as function- and
service-specific managers that allow fine-grained service management, slicing
support to facilitate multi-tenancy, recursiveness for improved scalability, and
full-featured DevOps support.
author:
- first_name: Sevil
full_name: Dräxler, Sevil
id: '31764'
last_name: Dräxler
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
- first_name: Manuel
full_name: Peuster, Manuel
id: '13271'
last_name: Peuster
- first_name: Hadi
full_name: Razzaghi Kouchaksaraei, Hadi
id: '60845'
last_name: Razzaghi Kouchaksaraei
- first_name: Michael
full_name: Bredel, Michael
last_name: Bredel
- first_name: Johannes
full_name: Lessmann, Johannes
last_name: Lessmann
- first_name: Thomas
full_name: Soenen, Thomas
last_name: Soenen
- first_name: Wouter
full_name: Tavernier, Wouter
last_name: Tavernier
- first_name: Sharon
full_name: Mendel-Brin, Sharon
last_name: Mendel-Brin
- first_name: George
full_name: Xilouris, George
last_name: Xilouris
citation:
ama: 'Dräxler S, Karl H, Peuster M, et al. SONATA: Service programming and orchestration
for virtualized software networks. In: 2017 IEEE International Conference on
Communications Workshops (ICC Workshops). IEEE; 2017. doi:10.1109/iccw.2017.7962785'
apa: 'Dräxler, S., Karl, H., Peuster, M., Razzaghi Kouchaksaraei, H., Bredel, M.,
Lessmann, J., … Xilouris, G. (2017). SONATA: Service programming and orchestration
for virtualized software networks. In 2017 IEEE International Conference on
Communications Workshops (ICC Workshops). Paris, France: IEEE. https://doi.org/10.1109/iccw.2017.7962785'
bibtex: '@inproceedings{Dräxler_Karl_Peuster_Razzaghi Kouchaksaraei_Bredel_Lessmann_Soenen_Tavernier_Mendel-Brin_Xilouris_2017,
title={SONATA: Service programming and orchestration for virtualized software
networks}, DOI={10.1109/iccw.2017.7962785},
booktitle={2017 IEEE International Conference on Communications Workshops (ICC
Workshops)}, publisher={IEEE}, author={Dräxler, Sevil and Karl, Holger and Peuster,
Manuel and Razzaghi Kouchaksaraei, Hadi and Bredel, Michael and Lessmann, Johannes
and Soenen, Thomas and Tavernier, Wouter and Mendel-Brin, Sharon and Xilouris,
George}, year={2017} }'
chicago: 'Dräxler, Sevil, Holger Karl, Manuel Peuster, Hadi Razzaghi Kouchaksaraei,
Michael Bredel, Johannes Lessmann, Thomas Soenen, Wouter Tavernier, Sharon Mendel-Brin,
and George Xilouris. “SONATA: Service Programming and Orchestration for Virtualized
Software Networks.” In 2017 IEEE International Conference on Communications
Workshops (ICC Workshops). IEEE, 2017. https://doi.org/10.1109/iccw.2017.7962785.'
ieee: 'S. Dräxler et al., “SONATA: Service programming and orchestration
for virtualized software networks,” in 2017 IEEE International Conference on
Communications Workshops (ICC Workshops), Paris, France, 2017.'
mla: 'Dräxler, Sevil, et al. “SONATA: Service Programming and Orchestration for
Virtualized Software Networks.” 2017 IEEE International Conference on Communications
Workshops (ICC Workshops), IEEE, 2017, doi:10.1109/iccw.2017.7962785.'
short: 'S. Dräxler, H. Karl, M. Peuster, H. Razzaghi Kouchaksaraei, M. Bredel, J.
Lessmann, T. Soenen, W. Tavernier, S. Mendel-Brin, G. Xilouris, in: 2017 IEEE
International Conference on Communications Workshops (ICC Workshops), IEEE, 2017.'
conference:
end_date: 2017-05-25
location: Paris, France
name: 2017 IEEE International Conference on Communications Workshops (ICC Workshops)
start_date: 2017-05-21
date_created: 2017-11-22T09:42:59Z
date_updated: 2022-01-06T07:03:28Z
ddc:
- '000'
department:
- _id: '75'
doi: 10.1109/iccw.2017.7962785
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:22:10Z
date_updated: 2018-11-02T14:22:10Z
file_id: '5270'
file_name: 07962785.pdf
file_size: 821211
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:22:10Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/pdf/1605.05850.pdf
oa: '1'
project:
- _id: '25'
call_identifier: 5G PPP Phase 1
grant_number: '671517'
name: 'SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized
Networks'
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publication: 2017 IEEE International Conference on Communications Workshops (ICC Workshops)
publication_identifier:
isbn:
- '9781509015252'
publication_status: published
publisher: IEEE
status: public
title: 'SONATA: Service programming and orchestration for virtualized software networks'
type: conference
user_id: '31764'
year: '2017'
...
---
_id: '72'
abstract:
- lang: eng
text: 'Software verification competitions, such as the annual SV-COMP, evaluate
software verification tools with respect to their effectivity and efficiency.
Typically, the outcome of a competition is a (possibly category-specific) ranking
of the tools. For many applications, such as building portfolio solvers, it would
be desirable to have an idea of the (relative) performance of verification tools
on a given verification task beforehand, i.e., prior to actually running all tools
on the task.In this paper, we present a machine learning approach to predicting
rankings of tools on verification tasks. The method builds upon so-called label
ranking algorithms, which we complement with appropriate kernels providing a similarity
measure for verification tasks. Our kernels employ a graph representation for
software source code that mixes elements of control flow and program dependence
graphs with abstract syntax trees. Using data sets from SV-COMP, we demonstrate
our rank prediction technique to generalize well and achieve a rather high predictive
accuracy. In particular, our method outperforms a recently proposed feature-based
approach of Demyanova et al. (when applied to rank predictions). '
author:
- first_name: Mike
full_name: Czech, Mike
last_name: Czech
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: Czech M, Hüllermeier E, Jakobs M-C, Wehrheim H. Predicting Rankings of Software
Verification Competitions.; 2017.
apa: Czech, M., Hüllermeier, E., Jakobs, M.-C., & Wehrheim, H. (2017). Predicting
Rankings of Software Verification Competitions.
bibtex: '@book{Czech_Hüllermeier_Jakobs_Wehrheim_2017, title={Predicting Rankings
of Software Verification Competitions}, author={Czech, Mike and Hüllermeier, Eyke
and Jakobs, Marie-Christine and Wehrheim, Heike}, year={2017} }'
chicago: Czech, Mike, Eyke Hüllermeier, Marie-Christine Jakobs, and Heike Wehrheim.
Predicting Rankings of Software Verification Competitions, 2017.
ieee: M. Czech, E. Hüllermeier, M.-C. Jakobs, and H. Wehrheim, Predicting Rankings
of Software Verification Competitions. 2017.
mla: Czech, Mike, et al. Predicting Rankings of Software Verification Competitions.
2017.
short: M. Czech, E. Hüllermeier, M.-C. Jakobs, H. Wehrheim, Predicting Rankings
of Software Verification Competitions, 2017.
date_created: 2017-10-17T12:41:05Z
date_updated: 2022-01-06T07:03:29Z
ddc:
- '000'
department:
- _id: '77'
- _id: '355'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-11-21T10:50:11Z
date_updated: 2018-11-21T10:50:11Z
file_id: '5782'
file_name: "Predicting Rankings of So\x81ware Verification Competitions.pdf"
file_size: 869984
relation: main_file
success: 1
file_date_updated: 2018-11-21T10:50:11Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
status: public
title: Predicting Rankings of Software Verification Competitions
type: report
user_id: '15504'
year: '2017'
...
---
_id: '723'
abstract:
- lang: eng
text: "Developing a virtualized network service does not only involve the\r\n implementation
and configuration of the network functions it is\r\n composed of but also its
integration and test with management\r\n solutions that will control the service
in its production\r\n environment. These integration tasks require testbeds that
offer the\r\n needed network function virtualization infrastructure~(NFVI), like
OpenStack, introducing a\r\n lot of management and maintenance overheads. Such
testbed setups\r\n become even more complicated when the multi\r\n point-of-presence~(PoP)
case, with multiple infrastructure\r\n installations, is considered.\r\n\r\n
\ In this demo, we showcase an emulation platform that executes\r\n containerized
network services in user-defined multi-PoP\r\n topologies. The platform does
not only allow network service developers to\r\n locally test their services
but also to connect real-world\r\n management and orchestration solutions to
the emulated PoPs. During our\r\n interactive demonstration we focus on the integration
between\r\n the emulated infrastructure and state-of-the-art orchestration\r\n
\ solutions like SONATA or OSM."
author:
- first_name: Manuel
full_name: Peuster, Manuel
id: '13271'
last_name: Peuster
- first_name: Sevil
full_name: Dräxler, Sevil
id: '31764'
last_name: Dräxler
- first_name: Hadi
full_name: Razzaghi Kouchaksaraei, Hadi
id: '60845'
last_name: Razzaghi Kouchaksaraei
- first_name: Steven
full_name: van Rossem, Steven
last_name: van Rossem
- first_name: Wouter
full_name: Tavernier, Wouter
last_name: Tavernier
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Peuster M, Dräxler S, Razzaghi Kouchaksaraei H, van Rossem S, Tavernier W,
Karl H. A flexible multi-pop infrastructure emulator for carrier-grade MANO systems.
In: IEEE Conference on Network Softwarization, NetSoft 2017, Bologna, Italy,
July 3-7, 2017. ; 2017:1--3. doi:10.1109/NETSOFT.2017.8004250'
apa: Peuster, M., Dräxler, S., Razzaghi Kouchaksaraei, H., van Rossem, S., Tavernier,
W., & Karl, H. (2017). A flexible multi-pop infrastructure emulator for carrier-grade
MANO systems. In IEEE Conference on Network Softwarization, NetSoft 2017, Bologna,
Italy, July 3-7, 2017 (pp. 1--3). Bologna. https://doi.org/10.1109/NETSOFT.2017.8004250
bibtex: '@inproceedings{Peuster_Dräxler_Razzaghi Kouchaksaraei_van Rossem_Tavernier_Karl_2017,
title={A flexible multi-pop infrastructure emulator for carrier-grade MANO systems},
DOI={10.1109/NETSOFT.2017.8004250},
booktitle={IEEE Conference on Network Softwarization, NetSoft 2017, Bologna, Italy,
July 3-7, 2017}, author={Peuster, Manuel and Dräxler, Sevil and Razzaghi Kouchaksaraei,
Hadi and van Rossem, Steven and Tavernier, Wouter and Karl, Holger}, year={2017},
pages={1--3} }'
chicago: Peuster, Manuel, Sevil Dräxler, Hadi Razzaghi Kouchaksaraei, Steven van
Rossem, Wouter Tavernier, and Holger Karl. “A Flexible Multi-Pop Infrastructure
Emulator for Carrier-Grade MANO Systems.” In IEEE Conference on Network Softwarization,
NetSoft 2017, Bologna, Italy, July 3-7, 2017, 1--3, 2017. https://doi.org/10.1109/NETSOFT.2017.8004250.
ieee: M. Peuster, S. Dräxler, H. Razzaghi Kouchaksaraei, S. van Rossem, W. Tavernier,
and H. Karl, “A flexible multi-pop infrastructure emulator for carrier-grade MANO
systems,” in IEEE Conference on Network Softwarization, NetSoft 2017, Bologna,
Italy, July 3-7, 2017, Bologna, 2017, pp. 1--3.
mla: Peuster, Manuel, et al. “A Flexible Multi-Pop Infrastructure Emulator for Carrier-Grade
MANO Systems.” IEEE Conference on Network Softwarization, NetSoft 2017, Bologna,
Italy, July 3-7, 2017, 2017, pp. 1--3, doi:10.1109/NETSOFT.2017.8004250.
short: 'M. Peuster, S. Dräxler, H. Razzaghi Kouchaksaraei, S. van Rossem, W. Tavernier,
H. Karl, in: IEEE Conference on Network Softwarization, NetSoft 2017, Bologna,
Italy, July 3-7, 2017, 2017, pp. 1--3.'
conference:
location: Bologna
name: IEEE Conference on Network Softwarization
date_created: 2017-11-27T10:22:25Z
date_updated: 2022-01-06T07:03:30Z
ddc:
- '000'
department:
- _id: '75'
doi: 10.1109/NETSOFT.2017.8004250
file:
- access_level: open_access
content_type: application/pdf
creator: peuster
date_created: 2018-07-05T11:14:37Z
date_updated: 2018-07-05T11:14:37Z
file_id: '3432'
file_name: main_ris.pdf
file_size: 963155
relation: main_file
file_date_updated: 2018-07-05T11:14:37Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 1--3
project:
- _id: '25'
call_identifier: 5G PPP Phase 1
grant_number: '671517'
name: 'SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized
Networks'
publication: IEEE Conference on Network Softwarization, NetSoft 2017, Bologna, Italy,
July 3-7, 2017
publication_status: published
status: public
title: A flexible multi-pop infrastructure emulator for carrier-grade MANO systems
type: conference
urn: '7236'
user_id: '13271'
year: '2017'
...
---
_id: '74'
author:
- first_name: Christoph
full_name: Knorr, Christoph
last_name: Knorr
citation:
ama: Knorr C. OpenCL-basierte Videoverarbeitung auf heterogenen Rechenknoten.
Universität Paderborn; 2017.
apa: Knorr, C. (2017). OpenCL-basierte Videoverarbeitung auf heterogenen Rechenknoten.
Universität Paderborn.
bibtex: '@book{Knorr_2017, title={OpenCL-basierte Videoverarbeitung auf heterogenen
Rechenknoten}, publisher={Universität Paderborn}, author={Knorr, Christoph}, year={2017}
}'
chicago: Knorr, Christoph. OpenCL-basierte Videoverarbeitung auf heterogenen
Rechenknoten. Universität Paderborn, 2017.
ieee: C. Knorr, OpenCL-basierte Videoverarbeitung auf heterogenen Rechenknoten.
Universität Paderborn, 2017.
mla: Knorr, Christoph. OpenCL-basierte Videoverarbeitung auf heterogenen Rechenknoten.
Universität Paderborn, 2017.
short: C. Knorr, OpenCL-basierte Videoverarbeitung auf heterogenen Rechenknoten,
Universität Paderborn, 2017.
date_created: 2017-10-17T12:41:05Z
date_updated: 2022-01-06T07:03:36Z
department:
- _id: '78'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '14'
name: SFB 901 - Subprojekt C2
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Achim
full_name: Lösch, Achim
id: '43646'
last_name: Lösch
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
title: OpenCL-basierte Videoverarbeitung auf heterogenen Rechenknoten
type: mastersthesis
user_id: '477'
year: '2017'
...
---
_id: '87'
abstract:
- lang: eng
text: Management of complex network services requires flexible and efficient service
provisioning as well as optimized handling of continuous changes in the workload
of the service.To adapt to changes in the demand, service components need to be
replicated (scaling) and allocated to physical resources (placement) dynamically.
In this paper, we propose a fullyautomated approach to the joint optimization
problem of scaling and placement, enabling quick reaction to changes. We formalize
the problem, analyze its complexity, and develop two algorithms to solve it. Extensive
empirical results show the applicability andeffectiveness of the proposed approach.
author:
- first_name: Sevil
full_name: Dräxler, Sevil
id: '31764'
last_name: Dräxler
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
- first_name: Zoltan Adam
full_name: Mann, Zoltan Adam
last_name: Mann
citation:
ama: 'Dräxler S, Karl H, Mann ZA. Joint Optimization of Scaling and Placement of
Virtual Network Services. In: Proceedings of the 17th IEEE/ACM International
Symposium on Cluster, Cloud and Grid Computing (CCGrid 2017). ; 2017. doi:10.1109/CCGRID.2017.25'
apa: Dräxler, S., Karl, H., & Mann, Z. A. (2017). Joint Optimization of Scaling
and Placement of Virtual Network Services. In Proceedings of the 17th IEEE/ACM
International Symposium on Cluster, Cloud and Grid Computing (CCGrid 2017).
https://doi.org/10.1109/CCGRID.2017.25
bibtex: '@inproceedings{Dräxler_Karl_Mann_2017, title={Joint Optimization of Scaling
and Placement of Virtual Network Services}, DOI={10.1109/CCGRID.2017.25},
booktitle={Proceedings of the 17th IEEE/ACM International Symposium on Cluster,
Cloud and Grid Computing (CCGrid 2017)}, author={Dräxler, Sevil and Karl, Holger
and Mann, Zoltan Adam}, year={2017} }'
chicago: Dräxler, Sevil, Holger Karl, and Zoltan Adam Mann. “Joint Optimization
of Scaling and Placement of Virtual Network Services.” In Proceedings of the
17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid
2017), 2017. https://doi.org/10.1109/CCGRID.2017.25.
ieee: S. Dräxler, H. Karl, and Z. A. Mann, “Joint Optimization of Scaling and Placement
of Virtual Network Services,” in Proceedings of the 17th IEEE/ACM International
Symposium on Cluster, Cloud and Grid Computing (CCGrid 2017), 2017.
mla: Dräxler, Sevil, et al. “Joint Optimization of Scaling and Placement of Virtual
Network Services.” Proceedings of the 17th IEEE/ACM International Symposium
on Cluster, Cloud and Grid Computing (CCGrid 2017), 2017, doi:10.1109/CCGRID.2017.25.
short: 'S. Dräxler, H. Karl, Z.A. Mann, in: Proceedings of the 17th IEEE/ACM International
Symposium on Cluster, Cloud and Grid Computing (CCGrid 2017), 2017.'
date_created: 2017-10-17T12:41:08Z
date_updated: 2022-01-06T07:03:59Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1109/CCGRID.2017.25
file:
- access_level: open_access
content_type: application/pdf
creator: sevilmeh
date_created: 2018-06-25T08:07:43Z
date_updated: 2018-06-25T08:07:43Z
file_id: '3324'
file_name: RIS.pdf
file_size: 2229109
relation: main_file
file_date_updated: 2018-06-25T08:07:43Z
has_accepted_license: '1'
oa: '1'
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '4'
name: SFB 901 - Project Area C
- _id: '25'
call_identifier: 5G PPP Phase 1
grant_number: '671517'
name: 'SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized
Networks'
publication: Proceedings of the 17th IEEE/ACM International Symposium on Cluster,
Cloud and Grid Computing (CCGrid 2017)
status: public
title: Joint Optimization of Scaling and Placement of Virtual Network Services
type: conference
urn: '873'
user_id: '31764'
year: '2017'
...
---
_id: '88'
author:
- first_name: Advait
full_name: Ganesh Athreya, Advait
last_name: Ganesh Athreya
citation:
ama: Ganesh Athreya A. Instantiating a Predicate Encryption Scheme via Pair Encodings.
Universität Paderborn; 2017.
apa: Ganesh Athreya, A. (2017). Instantiating a Predicate Encryption Scheme via
Pair Encodings. Universität Paderborn.
bibtex: '@book{Ganesh Athreya_2017, title={Instantiating a Predicate Encryption
Scheme via Pair Encodings}, publisher={Universität Paderborn}, author={Ganesh
Athreya, Advait}, year={2017} }'
chicago: Ganesh Athreya, Advait. Instantiating a Predicate Encryption Scheme
via Pair Encodings. Universität Paderborn, 2017.
ieee: A. Ganesh Athreya, Instantiating a Predicate Encryption Scheme via Pair
Encodings. Universität Paderborn, 2017.
mla: Ganesh Athreya, Advait. Instantiating a Predicate Encryption Scheme via
Pair Encodings. Universität Paderborn, 2017.
short: A. Ganesh Athreya, Instantiating a Predicate Encryption Scheme via Pair Encodings,
Universität Paderborn, 2017.
date_created: 2017-10-17T12:41:08Z
date_updated: 2022-01-06T07:04:02Z
department:
- _id: '64'
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Instantiating a Predicate Encryption Scheme via Pair Encodings
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '8843'
alternative_title:
- User Conference on Advanced Automated Testing (UCAAT 2017)
author:
- first_name: Ivan
full_name: Jovanovikj, Ivan
id: '39187'
last_name: Jovanovikj
orcid: https://orcid.org/0000-0002-1838-794X
citation:
ama: 'Jovanovikj I. Presentation: Framework for Constructing Context-Specific
Migration Methods for Test Cases. Berlin; 2017.'
apa: 'Jovanovikj, I. (2017). Presentation: Framework for Constructing Context-Specific
Migration Methods for Test Cases. Berlin.'
bibtex: '@book{Jovanovikj_2017, place={Berlin}, title={Presentation: Framework for
Constructing Context-Specific Migration Methods for Test Cases}, author={Jovanovikj,
Ivan}, year={2017} }'
chicago: 'Jovanovikj, Ivan. Presentation: Framework for Constructing Context-Specific
Migration Methods for Test Cases. Berlin, 2017.'
ieee: 'I. Jovanovikj, Presentation: Framework for Constructing Context-Specific
Migration Methods for Test Cases. Berlin, 2017.'
mla: 'Jovanovikj, Ivan. Presentation: Framework for Constructing Context-Specific
Migration Methods for Test Cases. 2017.'
short: 'I. Jovanovikj, Presentation: Framework for Constructing Context-Specific
Migration Methods for Test Cases, Berlin, 2017.'
date_created: 2019-04-08T07:39:45Z
date_updated: 2022-01-06T07:04:03Z
department:
- _id: '66'
language:
- iso: eng
place: Berlin
status: public
title: 'Presentation: Framework for Constructing Context-Specific Migration Methods
for Test Cases'
type: misc
user_id: '39187'
year: '2017'
...
---
_id: '9607'
author:
- first_name: Saqib
full_name: Kakvi, Saqib
id: '66268'
last_name: Kakvi
- first_name: Eike
full_name: Kiltz, Eike
last_name: Kiltz
citation:
ama: Kakvi S, Kiltz E. Optimal Security Proofs for Full Domain Hash, Revisited.
Journal of Cryptology. 2017:276-306. doi:10.1007/s00145-017-9257-9
apa: Kakvi, S., & Kiltz, E. (2017). Optimal Security Proofs for Full Domain
Hash, Revisited. Journal of Cryptology, 276–306. https://doi.org/10.1007/s00145-017-9257-9
bibtex: '@article{Kakvi_Kiltz_2017, title={Optimal Security Proofs for Full Domain
Hash, Revisited}, DOI={10.1007/s00145-017-9257-9},
journal={Journal of Cryptology}, author={Kakvi, Saqib and Kiltz, Eike}, year={2017},
pages={276–306} }'
chicago: Kakvi, Saqib, and Eike Kiltz. “Optimal Security Proofs for Full Domain
Hash, Revisited.” Journal of Cryptology, 2017, 276–306. https://doi.org/10.1007/s00145-017-9257-9.
ieee: S. Kakvi and E. Kiltz, “Optimal Security Proofs for Full Domain Hash, Revisited,”
Journal of Cryptology, pp. 276–306, 2017.
mla: Kakvi, Saqib, and Eike Kiltz. “Optimal Security Proofs for Full Domain Hash,
Revisited.” Journal of Cryptology, 2017, pp. 276–306, doi:10.1007/s00145-017-9257-9.
short: S. Kakvi, E. Kiltz, Journal of Cryptology (2017) 276–306.
date_created: 2019-05-03T12:44:03Z
date_updated: 2022-01-06T07:04:16Z
department:
- _id: '558'
doi: 10.1007/s00145-017-9257-9
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/article/10.1007%2Fs00145-017-9257-9
page: 276-306
publication: Journal of Cryptology
publication_identifier:
issn:
- 0933-2790
- 1432-1378
publication_status: published
status: public
title: Optimal Security Proofs for Full Domain Hash, Revisited
type: journal_article
user_id: '66268'
year: '2017'
...