---
_id: '34167'
author:
- first_name: Heinrich
full_name: Riebler, Heinrich
id: '8961'
last_name: Riebler
citation:
ama: Riebler H. Efficient Parallel Branch-and-Bound Search on FPGAs Using Work
Stealing and Instance-Specific Designs.; 2019. doi:10.17619/UNIPB/1-830
apa: Riebler, H. (2019). Efficient parallel branch-and-bound search on FPGAs
using work stealing and instance-specific designs. https://doi.org/10.17619/UNIPB/1-830
bibtex: '@book{Riebler_2019, title={Efficient parallel branch-and-bound search on
FPGAs using work stealing and instance-specific designs}, DOI={10.17619/UNIPB/1-830},
author={Riebler, Heinrich}, year={2019} }'
chicago: Riebler, Heinrich. Efficient Parallel Branch-and-Bound Search on FPGAs
Using Work Stealing and Instance-Specific Designs, 2019. https://doi.org/10.17619/UNIPB/1-830.
ieee: H. Riebler, Efficient parallel branch-and-bound search on FPGAs using work
stealing and instance-specific designs. 2019.
mla: Riebler, Heinrich. Efficient Parallel Branch-and-Bound Search on FPGAs Using
Work Stealing and Instance-Specific Designs. 2019, doi:10.17619/UNIPB/1-830.
short: H. Riebler, Efficient Parallel Branch-and-Bound Search on FPGAs Using Work
Stealing and Instance-Specific Designs, 2019.
date_created: 2022-11-30T14:36:04Z
date_updated: 2022-11-30T14:44:15Z
department:
- _id: '27'
doi: 10.17619/UNIPB/1-830
language:
- iso: eng
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '14'
name: 'SFB 901 - C2: SFB 901 - Subproject C2'
status: public
supervisor:
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
title: Efficient parallel branch-and-bound search on FPGAs using work stealing and
instance-specific designs
type: dissertation
user_id: '15504'
year: '2019'
...
---
_id: '13904'
abstract:
- lang: eng
text: In this paper, we introduce updatable anonymous credential systems (UACS)
and use them to construct a new privacy-preserving incentive system. In a UACS,
a user holding a credential certifying some attributes can interact with the corresponding
issuer to update his attributes. During this, the issuer knows which update function
is run, but does not learn the user's previous attributes. Hence the update process
preserves anonymity of the user. One example for a class of update functions are
additive updates of integer attributes, where the issuer increments an unknown
integer attribute value v by some known value k. This kind of update is motivated
by an application of UACS to incentive systems. Users in an incentive system can
anonymously accumulate points, e.g. in a shop at checkout, and spend them later,
e.g. for a discount.
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Jan
full_name: Bobolz, Jan
id: '27207'
last_name: Bobolz
- first_name: Denis Pascal
full_name: Diemert, Denis Pascal
id: '44071'
last_name: Diemert
- first_name: Fabian
full_name: Eidens, Fabian
id: '25078'
last_name: Eidens
citation:
ama: 'Blömer J, Bobolz J, Diemert DP, Eidens F. Updatable Anonymous Credentials
and Applications to Incentive Systems. In: Proceedings of the 2019 ACM SIGSAC
Conference on Computer and Communications Security - CCS ’19. Proceedings
of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS
’19. ; 2019. doi:10.1145/3319535.3354223'
apa: Blömer, J., Bobolz, J., Diemert, D. P., & Eidens, F. (2019). Updatable
Anonymous Credentials and Applications to Incentive Systems. Proceedings of
the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19.
26th ACM Conference on Computer and Communications Security, London. https://doi.org/10.1145/3319535.3354223
bibtex: '@inproceedings{Blömer_Bobolz_Diemert_Eidens_2019, series={Proceedings of
the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19},
title={Updatable Anonymous Credentials and Applications to Incentive Systems},
DOI={10.1145/3319535.3354223},
booktitle={Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications
Security - CCS ’19}, author={Blömer, Johannes and Bobolz, Jan and Diemert, Denis
Pascal and Eidens, Fabian}, year={2019}, collection={Proceedings of the 2019 ACM
SIGSAC Conference on Computer and Communications Security - CCS ’19} }'
chicago: Blömer, Johannes, Jan Bobolz, Denis Pascal Diemert, and Fabian Eidens.
“Updatable Anonymous Credentials and Applications to Incentive Systems.” In Proceedings
of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS
’19. Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications
Security - CCS ’19, 2019. https://doi.org/10.1145/3319535.3354223.
ieee: 'J. Blömer, J. Bobolz, D. P. Diemert, and F. Eidens, “Updatable Anonymous
Credentials and Applications to Incentive Systems,” presented at the 26th ACM
Conference on Computer and Communications Security, London, 2019, doi: 10.1145/3319535.3354223.'
mla: Blömer, Johannes, et al. “Updatable Anonymous Credentials and Applications
to Incentive Systems.” Proceedings of the 2019 ACM SIGSAC Conference on Computer
and Communications Security - CCS ’19, 2019, doi:10.1145/3319535.3354223.
short: 'J. Blömer, J. Bobolz, D.P. Diemert, F. Eidens, in: Proceedings of the 2019
ACM SIGSAC Conference on Computer and Communications Security - CCS ’19, 2019.'
conference:
end_date: 2019-11-15
location: London
name: 26th ACM Conference on Computer and Communications Security
start_date: 2019-11-11
date_created: 2019-10-18T08:09:44Z
date_updated: 2023-01-10T10:25:27Z
ddc:
- '006'
department:
- _id: '7'
- _id: '64'
doi: 10.1145/3319535.3354223
file:
- access_level: closed
content_type: application/pdf
creator: jbobolz
date_created: 2019-10-18T08:07:49Z
date_updated: 2019-10-18T08:07:49Z
file_id: '13907'
file_name: full_eprinted_v2.pdf
file_size: 838949
relation: main_file
file_date_updated: 2019-10-18T08:07:49Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2019/169.pdf
oa: '1'
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications
Security - CCS '19
series_title: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications
Security - CCS '19
status: public
title: Updatable Anonymous Credentials and Applications to Incentive Systems
type: conference
user_id: '25078'
year: '2019'
...
---
_id: '45231'
author:
- first_name: N.
full_name: N., N.
last_name: N.
citation:
ama: N. N. Conception of a Digital Sales Bonus System Based on Blockchain Technology.;
2019.
apa: N., N. (2019). Conception of a digital Sales Bonus System based on Blockchain
Technology.
bibtex: '@book{N._2019, title={Conception of a digital Sales Bonus System based
on Blockchain Technology}, author={N., N.}, year={2019} }'
chicago: N., N. Conception of a Digital Sales Bonus System Based on Blockchain
Technology, 2019.
ieee: N. N., Conception of a digital Sales Bonus System based on Blockchain Technology.
2019.
mla: N., N. Conception of a Digital Sales Bonus System Based on Blockchain Technology.
2019.
short: N. N., Conception of a Digital Sales Bonus System Based on Blockchain Technology,
2019.
date_created: 2023-05-23T13:00:40Z
date_updated: 2023-05-23T13:00:49Z
department:
- _id: '66'
language:
- iso: eng
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '17'
name: 'SFB 901 - C5: SFB 901 - Subproject C5'
status: public
supervisor:
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
- first_name: Sebastian
full_name: Gottschalk, Sebastian
id: '47208'
last_name: Gottschalk
title: Conception of a digital Sales Bonus System based on Blockchain Technology
type: bachelorsthesis
user_id: '47208'
year: '2019'
...
---
_id: '2480'
abstract:
- lang: eng
text: Understanding the behavior of the components of service function chains (SFCs)
in different load situations is important for efficient and automatic management
and orches- tration of services. For this purpose and for practical research in
network function virtualization in general, there is a great need for benchmarks
and experimental data. In this paper, we describe our experiments for characterizing
the relationship between resource demands of virtual network functions (VNFs)
and the expected performance of the SFC, considering the individual performance
of the VNFs as well as the interdependencies among VNFs within the SFC. We have
designed our experiments focusing on video streaming, an important application
in this context. We present examples of models for predicting the interdependence
between resource demands and performance characteristics of SFCs using support
vector regression and polynomial regression models. We also show practical evidence
from our experiments that VNFs need to be benchmarked in their final chain setup,
rather than individually, to capture important interdependencies that affect their
performance. The data gathered from our experiments is publicly available.
author:
- first_name: Sevil
full_name: Dräxler, Sevil
id: '31764'
last_name: Dräxler
- first_name: Manuel
full_name: Peuster, Manuel
id: '13271'
last_name: Peuster
- first_name: Marvin
full_name: Illian, Marvin
last_name: Illian
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Dräxler S, Peuster M, Illian M, Karl H. Generating Resource and Performance
Models for Service Function Chains: The Video Streaming Case. In: 4th IEEE
International Conference on Network Softwarization (NetSoft 2018). IEEE; 2018:318--322.
doi:10.1109/NETSOFT.2018.8460029'
apa: 'Dräxler, S., Peuster, M., Illian, M., & Karl, H. (2018). Generating Resource
and Performance Models for Service Function Chains: The Video Streaming Case.
In 4th IEEE International Conference on Network Softwarization (NetSoft 2018)
(pp. 318--322). Montreal: IEEE. https://doi.org/10.1109/NETSOFT.2018.8460029'
bibtex: '@inproceedings{Dräxler_Peuster_Illian_Karl_2018, title={Generating Resource
and Performance Models for Service Function Chains: The Video Streaming Case},
DOI={10.1109/NETSOFT.2018.8460029},
booktitle={4th IEEE International Conference on Network Softwarization (NetSoft
2018)}, publisher={IEEE}, author={Dräxler, Sevil and Peuster, Manuel and Illian,
Marvin and Karl, Holger}, year={2018}, pages={318--322} }'
chicago: 'Dräxler, Sevil, Manuel Peuster, Marvin Illian, and Holger Karl. “Generating
Resource and Performance Models for Service Function Chains: The Video Streaming
Case.” In 4th IEEE International Conference on Network Softwarization (NetSoft
2018), 318--322. IEEE, 2018. https://doi.org/10.1109/NETSOFT.2018.8460029.'
ieee: 'S. Dräxler, M. Peuster, M. Illian, and H. Karl, “Generating Resource and
Performance Models for Service Function Chains: The Video Streaming Case,” in
4th IEEE International Conference on Network Softwarization (NetSoft 2018),
Montreal, 2018, pp. 318--322.'
mla: 'Dräxler, Sevil, et al. “Generating Resource and Performance Models for Service
Function Chains: The Video Streaming Case.” 4th IEEE International Conference
on Network Softwarization (NetSoft 2018), IEEE, 2018, pp. 318--322, doi:10.1109/NETSOFT.2018.8460029.'
short: 'S. Dräxler, M. Peuster, M. Illian, H. Karl, in: 4th IEEE International Conference
on Network Softwarization (NetSoft 2018), IEEE, 2018, pp. 318--322.'
conference:
end_date: 2018-07-29
location: Montreal
name: 4th IEEE International Conference on Network Softwarization (NetSoft 2018)
start_date: 2018-07-25
date_created: 2018-04-24T12:11:36Z
date_updated: 2022-01-06T06:56:37Z
ddc:
- '004'
department:
- _id: '75'
doi: 10.1109/NETSOFT.2018.8460029
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-12-12T15:18:12Z
date_updated: 2018-12-12T15:18:12Z
file_id: '6195'
file_name: 08460029.pdf
file_size: 2211450
relation: main_file
success: 1
- access_level: open_access
content_type: application/pdf
creator: sevilmeh
date_created: 2019-01-24T10:17:00Z
date_updated: 2019-01-24T10:17:00Z
file_id: '6968'
file_name: NetSoft18_RIS.pdf
file_size: 3445650
relation: main_file
file_date_updated: 2019-01-24T10:17:00Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 318--322
project:
- _id: '23'
grant_number: '762057'
name: 5G Programmable Infrastructure Converging disaggregated neTwork and compUte
Resources
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publication: 4th IEEE International Conference on Network Softwarization (NetSoft
2018)
publisher: IEEE
status: public
title: 'Generating Resource and Performance Models for Service Function Chains: The
Video Streaming Case'
type: conference
user_id: '31764'
year: '2018'
...
---
_id: '2481'
abstract:
- lang: eng
text: Network function virtualization requires scaling and placement, deciding the
number and the location of function instances. Current approaches are limited
in flexibility and practical applicability. Specifically, we study dynamic, single-step,
joint scaling and placement of network services with bidirectional flows traversing
Physical or Virtual Network Functions (VNFs) and returning to their sources. We
develop models to support stateful components and legacy network functions with
fixed locations in these network services as well as the possibility of reusing
VNFs across network services. We formalize the problem of jointly scaling and
placing such network services as a mixed- integer linear program (MILP). We show
that this problem is NP-complete and also present a heuristic algorithm to find
good solutions in short time. In an extensive evaluation with realistic scenarios,
we investigate the capabilities of the two approaches.
author:
- first_name: Sevil
full_name: Dräxler, Sevil
id: '31764'
last_name: Dräxler
- first_name: Stefan Balthasar
full_name: Schneider, Stefan Balthasar
id: '35343'
last_name: Schneider
orcid: 0000-0001-8210-4011
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Dräxler S, Schneider SB, Karl H. Scaling and Placing Bidirectional Services
with Stateful Virtual and Physical Network Functions. In: 4th IEEE International
Conference on Network Softwarization (NetSoft 2018). IEEE; 2018:123--131.'
apa: 'Dräxler, S., Schneider, S. B., & Karl, H. (2018). Scaling and Placing
Bidirectional Services with Stateful Virtual and Physical Network Functions. In
4th IEEE International Conference on Network Softwarization (NetSoft 2018)
(pp. 123--131). Montreal: IEEE.'
bibtex: '@inproceedings{Dräxler_Schneider_Karl_2018, title={ Scaling and Placing
Bidirectional Services with Stateful Virtual and Physical Network Functions},
booktitle={4th IEEE International Conference on Network Softwarization (NetSoft
2018)}, publisher={IEEE}, author={Dräxler, Sevil and Schneider, Stefan Balthasar
and Karl, Holger}, year={2018}, pages={123--131} }'
chicago: Dräxler, Sevil, Stefan Balthasar Schneider, and Holger Karl. “ Scaling
and Placing Bidirectional Services with Stateful Virtual and Physical Network
Functions.” In 4th IEEE International Conference on Network Softwarization
(NetSoft 2018), 123--131. IEEE, 2018.
ieee: S. Dräxler, S. B. Schneider, and H. Karl, “ Scaling and Placing Bidirectional
Services with Stateful Virtual and Physical Network Functions,” in 4th IEEE
International Conference on Network Softwarization (NetSoft 2018), Montreal,
2018, pp. 123--131.
mla: Dräxler, Sevil, et al. “ Scaling and Placing Bidirectional Services with Stateful
Virtual and Physical Network Functions.” 4th IEEE International Conference
on Network Softwarization (NetSoft 2018), IEEE, 2018, pp. 123--131.
short: 'S. Dräxler, S.B. Schneider, H. Karl, in: 4th IEEE International Conference
on Network Softwarization (NetSoft 2018), IEEE, 2018, pp. 123--131.'
conference:
location: Montreal
name: 4th IEEE International Conference on Network Softwarization (NetSoft 2018)
date_created: 2018-04-24T12:14:00Z
date_updated: 2022-01-06T06:56:38Z
ddc:
- '040'
department:
- _id: '75'
file:
- access_level: open_access
content_type: application/pdf
creator: sevilmeh
date_created: 2018-06-25T07:40:57Z
date_updated: 2018-06-25T07:40:57Z
file_id: '3319'
file_name: RIS.pdf
file_size: 1471937
relation: main_file
file_date_updated: 2018-06-25T07:40:57Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 123--131
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: 4th IEEE International Conference on Network Softwarization (NetSoft
2018)
publication_status: published
publisher: IEEE
status: public
title: ' Scaling and Placing Bidirectional Services with Stateful Virtual and Physical
Network Functions'
type: conference
urn: '24814'
user_id: '477'
year: '2018'
...
---
_id: '2483'
abstract:
- lang: eng
text: Understanding the behavior of distributed cloud service components in different
load situations is important for efficient and automatic management and orchestration
of these services. For this purpose and for practical research in distributed
cloud computing in general, there is need for benchmarks and experimental data.
In this paper, we describe our experiments for characterizing the relationship
between resource demands of application components and the expected performance
of applica- tions. We present initial results for predicting the interdependence
between resource demands and performance characteristics using support vector
regression and polynomial regression models. The data gathered from our experiments
is publicly available.
author:
- first_name: Sevil
full_name: Dräxler, Sevil
id: '31764'
last_name: Dräxler
- first_name: Manuel
full_name: Peuster, Manuel
id: '13271'
last_name: Peuster
- first_name: Marvin
full_name: Illian, Marvin
last_name: Illian
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: Dräxler S, Peuster M, Illian M, Karl H. Towards Predicting Resource Demands
and Performance of Distributed Cloud Services. Wien, Darmstadt; 2018.
apa: Dräxler, S., Peuster, M., Illian, M., & Karl, H. (2018). Towards Predicting
Resource Demands and Performance of Distributed Cloud Services. Wien, Darmstadt.
bibtex: '@book{Dräxler_Peuster_Illian_Karl_2018, place={Wien, Darmstadt}, series={KuVS-Fachgespräch
Fog Computing 2018}, title={Towards Predicting Resource Demands and Performance
of Distributed Cloud Services}, author={Dräxler, Sevil and Peuster, Manuel and
Illian, Marvin and Karl, Holger}, year={2018}, collection={KuVS-Fachgespräch Fog
Computing 2018} }'
chicago: Dräxler, Sevil, Manuel Peuster, Marvin Illian, and Holger Karl. Towards
Predicting Resource Demands and Performance of Distributed Cloud Services.
KuVS-Fachgespräch Fog Computing 2018. Wien, Darmstadt, 2018.
ieee: S. Dräxler, M. Peuster, M. Illian, and H. Karl, Towards Predicting Resource
Demands and Performance of Distributed Cloud Services. Wien, Darmstadt, 2018.
mla: Dräxler, Sevil, et al. Towards Predicting Resource Demands and Performance
of Distributed Cloud Services. 2018.
short: S. Dräxler, M. Peuster, M. Illian, H. Karl, Towards Predicting Resource Demands
and Performance of Distributed Cloud Services, Wien, Darmstadt, 2018.
date_created: 2018-04-24T12:22:40Z
date_updated: 2022-01-06T06:56:38Z
ddc:
- '000'
department:
- _id: '75'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.infosys.tuwien.ac.at/docs/proceedings.pdf#page=14
oa: '1'
place: Wien, Darmstadt
project:
- _id: '23'
grant_number: '762057'
name: 5G Programmable Infrastructure Converging disaggregated neTwork and compUte
Resources
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publication_status: published
related_material:
link:
- relation: confirmation
url: http://repositum.tuwien.ac.at/obvutwoa/content/titleinfo/2514843
series_title: KuVS-Fachgespräch Fog Computing 2018
status: public
title: Towards Predicting Resource Demands and Performance of Distributed Cloud Services
type: report
user_id: '31764'
year: '2018'
...
---
_id: '2484'
abstract:
- lang: eng
text: We study the classic bin packing problem in a fully-dynamic setting, where
new items can arrive and old items may depart. We want algorithms with low asymptotic
competitive ratio while repacking items sparingly between updates. Formally, each
item i has a movement cost c_i >= 0, and we want to use alpha * OPT bins and incur
a movement cost gamma * c_i, either in the worst case, or in an amortized sense,
for alpha, gamma as small as possible. We call gamma the recourse of the algorithm.
This is motivated by cloud storage applications, where fully-dynamic bin packing
models the problem of data backup to minimize the number of disks used, as well
as communication incurred in moving file backups between disks. Since the set
of files changes over time, we could recompute a solution periodically from scratch,
but this would give a high number of disk rewrites, incurring a high energy cost
and possible wear and tear of the disks. In this work, we present optimal tradeoffs
between number of bins used and number of items repacked, as well as natural extensions
of the latter measure.
author:
- first_name: Björn
full_name: Feldkord, Björn
id: '22704'
last_name: Feldkord
- first_name: Matthias
full_name: Feldotto, Matthias
id: '14052'
last_name: Feldotto
orcid: 0000-0003-1348-6516
- first_name: Anupam
full_name: Gupta, Anupam
last_name: Gupta
- first_name: Guru
full_name: Guruganesh, Guru
last_name: Guruganesh
- first_name: 'Amit '
full_name: 'Kumar, Amit '
last_name: Kumar
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
- first_name: David
full_name: Wajc, David
last_name: Wajc
citation:
ama: 'Feldkord B, Feldotto M, Gupta A, et al. Fully-Dynamic Bin Packing with Little
Repacking. In: Chatzigiannakis I, Kaklamanis C, Marx D, Sannella D, eds. 45th
International Colloquium on Automata, Languages, and Programming (ICALP 2018).
Vol 107. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl,
Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik; 2018:51:1-51:24. doi:10.4230/LIPIcs.ICALP.2018.51'
apa: 'Feldkord, B., Feldotto, M., Gupta, A., Guruganesh, G., Kumar, A., Riechers,
S., & Wajc, D. (2018). Fully-Dynamic Bin Packing with Little Repacking. In
I. Chatzigiannakis, C. Kaklamanis, D. Marx, & D. Sannella (Eds.), 45th
International Colloquium on Automata, Languages, and Programming (ICALP 2018)
(Vol. 107, pp. 51:1-51:24). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum
fuer Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2018.51'
bibtex: '@inproceedings{Feldkord_Feldotto_Gupta_Guruganesh_Kumar_Riechers_Wajc_2018,
place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics
(LIPIcs)}, title={Fully-Dynamic Bin Packing with Little Repacking}, volume={107},
DOI={10.4230/LIPIcs.ICALP.2018.51},
booktitle={45th International Colloquium on Automata, Languages, and Programming
(ICALP 2018)}, publisher={Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
author={Feldkord, Björn and Feldotto, Matthias and Gupta, Anupam and Guruganesh,
Guru and Kumar, Amit and Riechers, Sören and Wajc, David}, editor={Chatzigiannakis,
Ioannis and Kaklamanis, Christos and Marx, Dániel and Sannella, DonaldEditors},
year={2018}, pages={51:1-51:24}, collection={Leibniz International Proceedings
in Informatics (LIPIcs)} }'
chicago: 'Feldkord, Björn, Matthias Feldotto, Anupam Gupta, Guru Guruganesh, Amit Kumar,
Sören Riechers, and David Wajc. “Fully-Dynamic Bin Packing with Little Repacking.”
In 45th International Colloquium on Automata, Languages, and Programming (ICALP
2018), edited by Ioannis Chatzigiannakis, Christos Kaklamanis, Dániel Marx,
and Donald Sannella, 107:51:1-51:24. Leibniz International Proceedings in Informatics
(LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik,
2018. https://doi.org/10.4230/LIPIcs.ICALP.2018.51.'
ieee: B. Feldkord et al., “Fully-Dynamic Bin Packing with Little Repacking,”
in 45th International Colloquium on Automata, Languages, and Programming (ICALP
2018), Prag, 2018, vol. 107, pp. 51:1-51:24.
mla: Feldkord, Björn, et al. “Fully-Dynamic Bin Packing with Little Repacking.”
45th International Colloquium on Automata, Languages, and Programming (ICALP
2018), edited by Ioannis Chatzigiannakis et al., vol. 107, Schloss Dagstuhl--Leibniz-Zentrum
fuer Informatik, 2018, pp. 51:1-51:24, doi:10.4230/LIPIcs.ICALP.2018.51.
short: 'B. Feldkord, M. Feldotto, A. Gupta, G. Guruganesh, A. Kumar, S. Riechers,
D. Wajc, in: I. Chatzigiannakis, C. Kaklamanis, D. Marx, D. Sannella (Eds.), 45th
International Colloquium on Automata, Languages, and Programming (ICALP 2018),
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2018, pp.
51:1-51:24.'
conference:
end_date: 2018-07-13
location: Prag
name: 45th International Colloquium on Automata, Languages, and Programming (ICALP
2018)
start_date: 2018-07-10
date_created: 2018-04-24T15:21:56Z
date_updated: 2022-01-06T06:56:39Z
ddc:
- '000'
department:
- _id: '541'
- _id: '63'
doi: 10.4230/LIPIcs.ICALP.2018.51
editor:
- first_name: Ioannis
full_name: Chatzigiannakis, Ioannis
last_name: Chatzigiannakis
- first_name: Christos
full_name: Kaklamanis, Christos
last_name: Kaklamanis
- first_name: Dániel
full_name: Marx, Dániel
last_name: Marx
- first_name: Donald
full_name: Sannella, Donald
last_name: Sannella
external_id:
arxiv:
- '1711.01231'
file:
- access_level: closed
content_type: application/pdf
creator: feldi
date_created: 2018-10-31T16:58:18Z
date_updated: 2018-10-31T16:58:18Z
file_id: '5227'
file_name: LIPIcs-ICALP-2018-51.pdf
file_size: 723824
relation: main_file
success: 1
file_date_updated: 2018-10-31T16:58:18Z
has_accepted_license: '1'
intvolume: ' 107'
language:
- iso: eng
page: 51:1-51:24
place: Dagstuhl, Germany
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '7'
name: SFB 901 - Subproject A3
- _id: '16'
name: SFB 901 - Subproject C4
publication: 45th International Colloquium on Automata, Languages, and Programming
(ICALP 2018)
publication_identifier:
isbn:
- 978-3-95977-076-7
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: Fully-Dynamic Bin Packing with Little Repacking
type: conference
user_id: '14052'
volume: 107
year: '2018'
...
---
_id: '2490'
author:
- first_name: Daniel
full_name: Szopinski, Daniel
id: '36372'
last_name: Szopinski
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
citation:
ama: 'Szopinski D, Kundisch D. Business model idea generation: An exploratory study
on changing perspectives. In: 2nd Business Model Conference. ; 2018.'
apa: 'Szopinski, D., & Kundisch, D. (2018). Business model idea generation:
An exploratory study on changing perspectives. In 2nd Business Model Conference.
Florence, Italy.'
bibtex: '@inproceedings{Szopinski_Kundisch_2018, title={Business model idea generation:
An exploratory study on changing perspectives}, booktitle={2nd Business Model
Conference}, author={Szopinski, Daniel and Kundisch, Dennis}, year={2018} }'
chicago: 'Szopinski, Daniel, and Dennis Kundisch. “Business Model Idea Generation:
An Exploratory Study on Changing Perspectives.” In 2nd Business Model Conference,
2018.'
ieee: 'D. Szopinski and D. Kundisch, “Business model idea generation: An exploratory
study on changing perspectives,” in 2nd Business Model Conference, Florence,
Italy, 2018.'
mla: 'Szopinski, Daniel, and Dennis Kundisch. “Business Model Idea Generation: An
Exploratory Study on Changing Perspectives.” 2nd Business Model Conference,
2018.'
short: 'D. Szopinski, D. Kundisch, in: 2nd Business Model Conference, 2018.'
conference:
end_date: 2018-06-07
location: Florence, Italy
name: 2nd Business Model Conference
start_date: 2018-06-06
date_created: 2018-04-25T13:03:08Z
date_updated: 2022-01-06T06:56:40Z
ddc:
- '040'
department:
- _id: '276'
file:
- access_level: closed
content_type: application/pdf
creator: dsz
date_created: 2018-11-12T13:24:21Z
date_updated: 2018-11-12T13:24:21Z
file_id: '5505'
file_name: BuMoCo2018_Standardization.pdf
file_size: 589100
relation: main_file
success: 1
file_date_updated: 2018-11-12T13:24:21Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '17'
name: SFB 901 - Subproject C5
publication: 2nd Business Model Conference
status: public
title: 'Business model idea generation: An exploratory study on changing perspectives'
type: conference_abstract
user_id: '477'
year: '2018'
...
---
_id: '2491'
author:
- first_name: Daniel
full_name: Szopinski, Daniel
id: '36372'
last_name: Szopinski
citation:
ama: 'Szopinski D. How to teach business model innovation to 300+ students: An experience
report. In: 2nd Business Model Conference. ; 2018.'
apa: 'Szopinski, D. (2018). How to teach business model innovation to 300+ students:
An experience report. In 2nd Business Model Conference. Florence, Italy.'
bibtex: '@inproceedings{Szopinski_2018, title={How to teach business model innovation
to 300+ students: An experience report}, booktitle={2nd Business Model Conference},
author={Szopinski, Daniel}, year={2018} }'
chicago: 'Szopinski, Daniel. “How to Teach Business Model Innovation to 300+ Students:
An Experience Report.” In 2nd Business Model Conference, 2018.'
ieee: 'D. Szopinski, “How to teach business model innovation to 300+ students: An
experience report,” in 2nd Business Model Conference, Florence, Italy,
2018.'
mla: 'Szopinski, Daniel. “How to Teach Business Model Innovation to 300+ Students:
An Experience Report.” 2nd Business Model Conference, 2018.'
short: 'D. Szopinski, in: 2nd Business Model Conference, 2018.'
conference:
end_date: 2018-06-07
location: Florence, Italy
name: 2nd Business Model Conference
start_date: 2018-06-06
date_created: 2018-04-25T13:22:19Z
date_updated: 2022-01-06T06:56:41Z
ddc:
- '040'
department:
- _id: '276'
file:
- access_level: closed
content_type: application/pdf
creator: dsz
date_created: 2018-11-12T13:24:39Z
date_updated: 2018-11-12T13:24:39Z
file_id: '5506'
file_name: BuMoCo2018_Teaching.pdf
file_size: 966252
relation: main_file
success: 1
file_date_updated: 2018-11-12T13:24:39Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '17'
name: SFB 901 - Subproject C5
publication: 2nd Business Model Conference
status: public
title: 'How to teach business model innovation to 300+ students: An experience report'
type: conference_abstract
user_id: '477'
year: '2018'
...
---
_id: '2559'
author:
- first_name: Lukas Sebastian
full_name: Arendt, Lukas Sebastian
last_name: Arendt
citation:
ama: 'Arendt LS. Datengetriebene Geschäftsmodelle: Ein Literaturüberblick.
Universität Paderborn; 2018.'
apa: 'Arendt, L. S. (2018). Datengetriebene Geschäftsmodelle: Ein Literaturüberblick.
Universität Paderborn.'
bibtex: '@book{Arendt_2018, place={Universität Paderborn}, title={Datengetriebene
Geschäftsmodelle: Ein Literaturüberblick}, author={Arendt, Lukas Sebastian}, year={2018}
}'
chicago: 'Arendt, Lukas Sebastian. Datengetriebene Geschäftsmodelle: Ein Literaturüberblick.
Universität Paderborn, 2018.'
ieee: 'L. S. Arendt, Datengetriebene Geschäftsmodelle: Ein Literaturüberblick.
Universität Paderborn, 2018.'
mla: 'Arendt, Lukas Sebastian. Datengetriebene Geschäftsmodelle: Ein Literaturüberblick.
2018.'
short: 'L.S. Arendt, Datengetriebene Geschäftsmodelle: Ein Literaturüberblick, Universität
Paderborn, 2018.'
date_created: 2018-04-27T08:56:59Z
date_updated: 2022-01-06T06:57:07Z
language:
- iso: ger
place: Universität Paderborn
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '17'
name: SFB 901 - Subproject C5
status: public
supervisor:
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
title: 'Datengetriebene Geschäftsmodelle: Ein Literaturüberblick'
type: bachelorsthesis
user_id: '16205'
year: '2018'
...
---
_id: '2848'
author:
- first_name: Shouwei
full_name: Li, Shouwei
last_name: Li
- 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: Li S, Markarian C, Meyer auf der Heide F. Towards Flexible Demands in Online
Leasing Problems. . Algorithmica. 2018;80(5):1556–1574. doi:10.1007/s00453-018-0420-y
apa: Li, S., Markarian, C., & Meyer auf der Heide, F. (2018). Towards Flexible
Demands in Online Leasing Problems. . Algorithmica, 80(5), 1556–1574.
https://doi.org/10.1007/s00453-018-0420-y
bibtex: '@article{Li_Markarian_Meyer auf der Heide_2018, title={Towards Flexible
Demands in Online Leasing Problems. }, volume={80}, DOI={10.1007/s00453-018-0420-y},
number={5}, journal={Algorithmica}, publisher={Springer}, author={Li, Shouwei
and Markarian, Christine and Meyer auf der Heide, Friedhelm}, year={2018}, pages={1556–1574}
}'
chicago: 'Li, Shouwei, Christine Markarian, and Friedhelm Meyer auf der Heide. “Towards
Flexible Demands in Online Leasing Problems. .” Algorithmica 80, no. 5
(2018): 1556–1574. https://doi.org/10.1007/s00453-018-0420-y.'
ieee: S. Li, C. Markarian, and F. Meyer auf der Heide, “Towards Flexible Demands
in Online Leasing Problems. ,” Algorithmica, vol. 80, no. 5, pp. 1556–1574,
2018.
mla: Li, Shouwei, et al. “Towards Flexible Demands in Online Leasing Problems. .”
Algorithmica, vol. 80, no. 5, Springer, 2018, pp. 1556–1574, doi:10.1007/s00453-018-0420-y.
short: S. Li, C. Markarian, F. Meyer auf der Heide, Algorithmica 80 (2018) 1556–1574.
date_created: 2018-05-24T08:32:38Z
date_updated: 2022-01-06T06:58:06Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/s00453-018-0420-y
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:18:16Z
date_updated: 2018-11-02T15:18:16Z
file_id: '5298'
file_name: TowardsFlexibleDemandsInOnline.pdf
file_size: 600583
relation: main_file
success: 1
file_date_updated: 2018-11-02T15:18:16Z
has_accepted_license: '1'
intvolume: ' 80'
issue: '5'
language:
- iso: eng
page: 1556–1574
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publication: Algorithmica
publisher: Springer
status: public
title: 'Towards Flexible Demands in Online Leasing Problems. '
type: journal_article
user_id: '477'
volume: 80
year: '2018'
...
---
_id: '2862'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Fabian
full_name: Eidens, Fabian
id: '25078'
last_name: Eidens
- first_name: Jakob
full_name: Juhnke, Jakob
id: '48090'
last_name: Juhnke
citation:
ama: 'Blömer J, Eidens F, Juhnke J. Practical, Anonymous, and Publicly Linkable
Universally-Composable Reputation Systems. In: Topics in Cryptology - {CT-RSA}
2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings.
Cham: Springer International Publishing; 2018:470-490. doi:10.1007/978-3-319-76953-0_25'
apa: 'Blömer, J., Eidens, F., & Juhnke, J. (2018). Practical, Anonymous, and
Publicly Linkable Universally-Composable Reputation Systems. In Topics in Cryptology
- {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings
(pp. 470–490). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-76953-0_25'
bibtex: '@inproceedings{Blömer_Eidens_Juhnke_2018, place={Cham}, title={Practical,
Anonymous, and Publicly Linkable Universally-Composable Reputation Systems}, DOI={10.1007/978-3-319-76953-0_25},
booktitle={Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at
the {RSA} Conference 2018, Proceedings}, publisher={Springer International Publishing},
author={Blömer, Johannes and Eidens, Fabian and Juhnke, Jakob}, year={2018}, pages={470–490}
}'
chicago: 'Blömer, Johannes, Fabian Eidens, and Jakob Juhnke. “Practical, Anonymous,
and Publicly Linkable Universally-Composable Reputation Systems.” In Topics
in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference
2018, Proceedings, 470–90. Cham: Springer International Publishing, 2018.
https://doi.org/10.1007/978-3-319-76953-0_25.'
ieee: J. Blömer, F. Eidens, and J. Juhnke, “Practical, Anonymous, and Publicly Linkable
Universally-Composable Reputation Systems,” in Topics in Cryptology - {CT-RSA}
2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings,
San Francisco, CA, USA, 2018, pp. 470–490.
mla: Blömer, Johannes, et al. “Practical, Anonymous, and Publicly Linkable Universally-Composable
Reputation Systems.” Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’
Track at the {RSA} Conference 2018, Proceedings, Springer International Publishing,
2018, pp. 470–90, doi:10.1007/978-3-319-76953-0_25.
short: 'J. Blömer, F. Eidens, J. Juhnke, in: Topics in Cryptology - {CT-RSA} 2018
- The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings, Springer
International Publishing, Cham, 2018, pp. 470–490.'
conference:
end_date: 2018-04-20
location: San Francisco, CA, USA
name: Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers' Track at the {RSA}
Conference 2018
start_date: 2018-04-16
date_created: 2018-05-24T11:14:02Z
date_updated: 2022-01-06T06:58:12Z
ddc:
- '004'
department:
- _id: '7'
- _id: '64'
doi: 10.1007/978-3-319-76953-0_25
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T13:45:40Z
date_updated: 2018-11-02T13:45:40Z
file_id: '5253'
file_name: PracticalAnonymousAndPubliclyL.pdf
file_size: 3371773
relation: main_file
success: 1
file_date_updated: 2018-11-02T13:45:40Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2018/029
oa: '1'
page: 470-490
place: Cham
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication: Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers' Track at the
{RSA} Conference 2018, Proceedings
publication_identifier:
isbn:
- '9783319769523'
- '9783319769530'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation
Systems
type: conference
user_id: '477'
year: '2018'
...
---
_id: '2472'
author:
- first_name: Sébastien
full_name: Auroux, Sébastien
last_name: Auroux
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Auroux S, Karl H. Distributed Placement of Virtualized Control Applications
in Mobile Backhaul Networks. In: Proc. of IEEE Wireless Communications and Networking
Conference (WCNC); 2018. doi:
10.1109/WCNC.2018.8377335'
apa: Auroux, S., & Karl, H. (2018). Distributed Placement of Virtualized Control
Applications in Mobile Backhaul Networks. Proc. of IEEE Wireless Communications
and Networking Conference (WCNC). https://doi.org/
10.1109/WCNC.2018.8377335
bibtex: '@inproceedings{Auroux_Karl_2018, title={Distributed Placement of Virtualized
Control Applications in Mobile Backhaul Networks}, DOI={ 10.1109/WCNC.2018.8377335}, publisher={Proc. of
IEEE Wireless Communications and Networking Conference (WCNC)}, author={Auroux,
Sébastien and Karl, Holger}, year={2018} }'
chicago: Auroux, Sébastien, and Holger Karl. “Distributed Placement of Virtualized
Control Applications in Mobile Backhaul Networks.” Proc. of IEEE Wireless Communications
and Networking Conference (WCNC), 2018. https://doi.org/
10.1109/WCNC.2018.8377335.
ieee: S. Auroux and H. Karl, “Distributed Placement of Virtualized Control Applications
in Mobile Backhaul Networks,” 2018.
mla: Auroux, Sébastien, and Holger Karl. Distributed Placement of Virtualized
Control Applications in Mobile Backhaul Networks. Proc. of IEEE Wireless Communications
and Networking Conference (WCNC), 2018, doi:
10.1109/WCNC.2018.8377335.
short: 'S. Auroux, H. Karl, in: Proc. of IEEE Wireless Communications and Networking
Conference (WCNC), 2018.'
date_created: 2018-04-24T08:04:28Z
date_updated: 2022-01-06T06:56:33Z
ddc:
- '000'
department:
- _id: '75'
doi: ' 10.1109/WCNC.2018.8377335'
file:
- access_level: closed
content_type: application/pdf
creator: tabu
date_created: 2018-04-24T08:04:02Z
date_updated: 2018-04-24T08:04:02Z
file_id: '2473'
file_name: p2262-auroux.pdf
file_size: 371352
relation: main_file
success: 1
file_date_updated: 2018-04-24T08:04:02Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publisher: Proc. of IEEE Wireless Communications and Networking Conference (WCNC)
status: public
title: Distributed Placement of Virtualized Control Applications in Mobile Backhaul
Networks
type: conference
user_id: '126'
year: '2018'
...
---
_id: '2681'
author:
- first_name: Thomas
full_name: Görzen, Thomas
id: '47700'
last_name: Görzen
- first_name: Florian
full_name: Laux, Florian
last_name: Laux
citation:
ama: 'Görzen T, Laux F. Extracting the Wisdom from the Crowd: A Comparison of Approaches
to Aggregating Collective Intelligence. In: Tagungsband Multikonferenz Wirtschaftsinformatik
2018 (MKWI). Lüneburg; 2018.'
apa: 'Görzen, T., & Laux, F. (2018). Extracting the Wisdom from the Crowd: A
Comparison of Approaches to Aggregating Collective Intelligence. In Tagungsband
Multikonferenz Wirtschaftsinformatik 2018 (MKWI). Lüneburg.'
bibtex: '@inproceedings{Görzen_Laux_2018, place={Lüneburg}, title={Extracting the
Wisdom from the Crowd: A Comparison of Approaches to Aggregating Collective Intelligence},
booktitle={Tagungsband Multikonferenz Wirtschaftsinformatik 2018 (MKWI)}, author={Görzen,
Thomas and Laux, Florian}, year={2018} }'
chicago: 'Görzen, Thomas, and Florian Laux. “Extracting the Wisdom from the Crowd:
A Comparison of Approaches to Aggregating Collective Intelligence.” In Tagungsband
Multikonferenz Wirtschaftsinformatik 2018 (MKWI). Lüneburg, 2018.'
ieee: 'T. Görzen and F. Laux, “Extracting the Wisdom from the Crowd: A Comparison
of Approaches to Aggregating Collective Intelligence,” in Tagungsband Multikonferenz
Wirtschaftsinformatik 2018 (MKWI), Lüneburg, 2018.'
mla: 'Görzen, Thomas, and Florian Laux. “Extracting the Wisdom from the Crowd: A
Comparison of Approaches to Aggregating Collective Intelligence.” Tagungsband
Multikonferenz Wirtschaftsinformatik 2018 (MKWI), 2018.'
short: 'T. Görzen, F. Laux, in: Tagungsband Multikonferenz Wirtschaftsinformatik
2018 (MKWI), Lüneburg, 2018.'
conference:
location: Lüneburg
name: Multikonferenz Wirtschaftsinformatik 2018 (MKWI)
date_created: 2018-05-07T14:48:07Z
date_updated: 2022-01-06T06:57:28Z
ddc:
- '040'
department:
- _id: '276'
file:
- access_level: closed
content_type: application/pdf
creator: abursig
date_created: 2018-12-03T15:20:56Z
date_updated: 2018-12-03T15:20:56Z
file_id: '5989'
file_name: MKWI_113.pdf
file_size: 278279
relation: main_file
success: 1
file_date_updated: 2018-12-03T15:20:56Z
has_accepted_license: '1'
language:
- iso: eng
place: Lüneburg
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '17'
name: SFB 901 - Subproject C5
publication: Tagungsband Multikonferenz Wirtschaftsinformatik 2018 (MKWI)
publication_status: published
status: public
title: 'Extracting the Wisdom from the Crowd: A Comparison of Approaches to Aggregating
Collective Intelligence'
type: conference
user_id: '477'
year: '2018'
...
---
_id: '2685'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Kathlén
full_name: Kohn, Kathlén
last_name: Kohn
citation:
ama: Blömer J, Kohn K. Voronoi Cells of Lattices with Respect to Arbitrary Norms.
SIAM Journal on Applied Algebra and Geometry. 2018;2(2):314-338. doi:10.1137/17M1132045
apa: Blömer, J., & Kohn, K. (2018). Voronoi Cells of Lattices with Respect to
Arbitrary Norms. SIAM Journal on Applied Algebra and Geometry., 2(2),
314–338. https://doi.org/10.1137/17M1132045
bibtex: '@article{Blömer_Kohn_2018, title={Voronoi Cells of Lattices with Respect
to Arbitrary Norms}, volume={2}, DOI={10.1137/17M1132045},
number={2}, journal={SIAM Journal on Applied Algebra and Geometry.}, author={Blömer,
Johannes and Kohn, Kathlén}, year={2018}, pages={314–338} }'
chicago: 'Blömer, Johannes, and Kathlén Kohn. “Voronoi Cells of Lattices with Respect
to Arbitrary Norms.” SIAM Journal on Applied Algebra and Geometry. 2, no.
2 (2018): 314–38. https://doi.org/10.1137/17M1132045.'
ieee: J. Blömer and K. Kohn, “Voronoi Cells of Lattices with Respect to Arbitrary
Norms,” SIAM Journal on Applied Algebra and Geometry., vol. 2, no. 2, pp.
314–338, 2018.
mla: Blömer, Johannes, and Kathlén Kohn. “Voronoi Cells of Lattices with Respect
to Arbitrary Norms.” SIAM Journal on Applied Algebra and Geometry., vol.
2, no. 2, 2018, pp. 314–38, doi:10.1137/17M1132045.
short: J. Blömer, K. Kohn, SIAM Journal on Applied Algebra and Geometry. 2 (2018)
314–338.
date_created: 2018-05-08T09:18:54Z
date_updated: 2022-01-06T06:57:29Z
ddc:
- '000'
department:
- _id: '7'
- _id: '64'
doi: 10.1137/17M1132045
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:22:55Z
date_updated: 2018-11-02T15:22:55Z
file_id: '5300'
file_name: 17m1132045.pdf
file_size: 1131048
relation: main_file
success: 1
file_date_updated: 2018-11-02T15:22:55Z
has_accepted_license: '1'
intvolume: ' 2'
issue: '2'
language:
- iso: eng
page: 314-338
project:
- _id: '13'
name: SFB 901 - Subproject C1
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
publication: SIAM Journal on Applied Algebra and Geometry.
publication_identifier:
eissn:
- 2470-6566
publication_status: epub_ahead
status: public
title: Voronoi Cells of Lattices with Respect to Arbitrary Norms
type: journal_article
user_id: '477'
volume: 2
year: '2018'
...
---
_id: '3265'
abstract:
- lang: eng
text: "We present CLARC (Cryptographic Library for Anonymous Reputation and Credentials),
an anonymous credentials system (ACS) combined with an anonymous reputation system.\r\n\r\nUsing
CLARC, users can receive attribute-based credentials from issuers. They can efficiently
prove that their credentials satisfy complex (access) policies in a privacy-preserving
way. This implements anonymous access control with complex policies.\r\n\r\nFurthermore,
CLARC is the first ACS that is combined with an anonymous reputation system where
users can anonymously rate services. A user who gets access to a service via a
credential, also anonymously receives a review token to rate the service. If a
user creates more than a single rating, this can be detected by anyone, preventing
users from spamming ratings to sway public opinion.\r\n\r\nTo evaluate feasibility
of our construction, we present an open-source prototype implementation."
author:
- first_name: Kai
full_name: Bemmann, Kai
last_name: Bemmann
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Jan
full_name: Bobolz, Jan
id: '27207'
last_name: Bobolz
- first_name: Henrik
full_name: Bröcher, Henrik
id: '41047'
last_name: Bröcher
- first_name: Denis Pascal
full_name: Diemert, Denis Pascal
id: '44071'
last_name: Diemert
- first_name: Fabian
full_name: Eidens, Fabian
id: '25078'
last_name: Eidens
- first_name: Lukas
full_name: Eilers, Lukas
last_name: Eilers
- first_name: Jan Frederik
full_name: Haltermann, Jan Frederik
id: '44413'
last_name: Haltermann
- first_name: Jakob
full_name: Juhnke, Jakob
id: '48090'
last_name: Juhnke
- first_name: Burhan
full_name: Otour, Burhan
last_name: Otour
- first_name: Laurens Alexander
full_name: Porzenheim, Laurens Alexander
id: '47434'
last_name: Porzenheim
- first_name: Simon
full_name: Pukrop, Simon
last_name: Pukrop
- first_name: Erik
full_name: Schilling, Erik
last_name: Schilling
- first_name: Michael
full_name: Schlichtig, Michael
id: '32312'
last_name: Schlichtig
- first_name: Marcel
full_name: Stienemeier, Marcel
last_name: Stienemeier
citation:
ama: 'Bemmann K, Blömer J, Bobolz J, et al. Fully-Featured Anonymous Credentials
with Reputation System. In: Proceedings of the 13th International Conference
on Availability, Reliability and Security - ARES ’18. New York, NY, USA: ACM.
doi:10.1145/3230833.3234517'
apa: 'Bemmann, K., Blömer, J., Bobolz, J., Bröcher, H., Diemert, D. P., Eidens,
F., … Stienemeier, M. (n.d.). Fully-Featured Anonymous Credentials with Reputation
System. In Proceedings of the 13th International Conference on Availability,
Reliability and Security - ARES ’18. New York, NY, USA: ACM. https://doi.org/10.1145/3230833.3234517'
bibtex: '@inproceedings{Bemmann_Blömer_Bobolz_Bröcher_Diemert_Eidens_Eilers_Haltermann_Juhnke_Otour_et
al., place={New York, NY, USA}, title={Fully-Featured Anonymous Credentials with
Reputation System}, DOI={10.1145/3230833.3234517},
booktitle={Proceedings of the 13th International Conference on Availability, Reliability
and Security - ARES ’18}, publisher={ACM}, author={Bemmann, Kai and Blömer, Johannes
and Bobolz, Jan and Bröcher, Henrik and Diemert, Denis Pascal and Eidens, Fabian
and Eilers, Lukas and Haltermann, Jan Frederik and Juhnke, Jakob and Otour, Burhan
and et al.} }'
chicago: 'Bemmann, Kai, Johannes Blömer, Jan Bobolz, Henrik Bröcher, Denis Pascal
Diemert, Fabian Eidens, Lukas Eilers, et al. “Fully-Featured Anonymous Credentials
with Reputation System.” In Proceedings of the 13th International Conference
on Availability, Reliability and Security - ARES ’18. New York, NY, USA: ACM,
n.d. https://doi.org/10.1145/3230833.3234517.'
ieee: K. Bemmann et al., “Fully-Featured Anonymous Credentials with Reputation
System,” in Proceedings of the 13th International Conference on Availability,
Reliability and Security - ARES ’18, Hamburg, Germany.
mla: Bemmann, Kai, et al. “Fully-Featured Anonymous Credentials with Reputation
System.” Proceedings of the 13th International Conference on Availability,
Reliability and Security - ARES ’18, ACM, doi:10.1145/3230833.3234517.
short: 'K. Bemmann, J. Blömer, J. Bobolz, H. Bröcher, D.P. Diemert, F. Eidens, L.
Eilers, J.F. Haltermann, J. Juhnke, B. Otour, L.A. Porzenheim, S. Pukrop, E. Schilling,
M. Schlichtig, M. Stienemeier, in: Proceedings of the 13th International Conference
on Availability, Reliability and Security - ARES ’18, ACM, New York, NY, USA,
n.d.'
conference:
end_date: 2018-08-30
location: Hamburg, Germany
name: ARES 2018 - SECPID
start_date: 2018-08-27
date_created: 2018-06-14T11:19:29Z
date_updated: 2022-01-06T06:59:07Z
ddc:
- '000'
department:
- _id: '64'
doi: 10.1145/3230833.3234517
file:
- access_level: closed
content_type: application/pdf
creator: feidens
date_created: 2018-11-08T10:17:39Z
date_updated: 2018-11-08T10:17:39Z
file_id: '5428'
file_name: react_acs.pdf
file_size: 920843
relation: main_file
file_date_updated: 2018-11-08T10:17:39Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2018/835
oa: '1'
place: New York, NY, USA
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
- _id: '44'
name: KogniHome - die mitdenkende Wohnung
publication: Proceedings of the 13th International Conference on Availability, Reliability
and Security - ARES '18
publication_identifier:
isbn:
- 978-1-4503-6448-5
publication_status: accepted
publisher: ACM
quality_controlled: '1'
related_material:
link:
- relation: software
url: https://github.com/upbcuk
status: public
title: Fully-Featured Anonymous Credentials with Reputation System
type: conference
user_id: '25078'
year: '2018'
...
---
_id: '3345'
abstract:
- lang: eng
text: "Dynamically steering flows through virtualized net- work function instances
is a key enabler for elastic, on-demand deployments of virtualized network functions.
This becomes par- ticular challenging when stateful functions are involved, necessi-
tating state management. The problem with existing solutions is that they typically
embrace state migration and flow rerouting jointly, imposing a huge set of requirements
on the on-boarded VNFs, e.g., solution-specific state management interfaces.\r\nIn
this paper, we introduce the seamless handover proto- col (SHarP). It provides
an easy-to-use, loss-less, and order- preserving flow rerouting mechanism that
is not fixed to a single state management approach. This allows VNF vendors to
implement or use the state management solution of their choice. SHarP supports
these solutions with additional information when flows are migrated. Further,
we show how SHarP significantly reduces the buffer usage at a central (SDN) controller,
which is a typical bottleneck in existing solutions. Our experiments show that
SHarP uses a constant amount of controller buffer, irrespective of the time taken
to migrate the VNF state."
author:
- first_name: Manuel
full_name: Peuster, Manuel
id: '13271'
last_name: Peuster
- first_name: Hannes
full_name: Küttner, Hannes
last_name: Küttner
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Peuster M, Küttner H, Karl H. Let the state follow its flows: An SDN-based
flow handover protocol to support state migration. In: 4th IEEE International
Conference on Network Softwarization (NetSoft 2018). Montreal. doi:10.1109/NETSOFT.2018.8460007'
apa: 'Peuster, M., Küttner, H., & Karl, H. (n.d.). Let the state follow its
flows: An SDN-based flow handover protocol to support state migration. In 4th
IEEE International Conference on Network Softwarization (NetSoft 2018). Montreal.
https://doi.org/10.1109/NETSOFT.2018.8460007'
bibtex: '@inproceedings{Peuster_Küttner_Karl, place={Montreal}, title={ Let the
state follow its flows: An SDN-based flow handover protocol to support state migration},
DOI={10.1109/NETSOFT.2018.8460007},
booktitle={4th IEEE International Conference on Network Softwarization (NetSoft
2018)}, author={Peuster, Manuel and Küttner, Hannes and Karl, Holger} }'
chicago: 'Peuster, Manuel, Hannes Küttner, and Holger Karl. “ Let the State Follow
Its Flows: An SDN-Based Flow Handover Protocol to Support State Migration.” In
4th IEEE International Conference on Network Softwarization (NetSoft 2018).
Montreal, n.d. https://doi.org/10.1109/NETSOFT.2018.8460007.'
ieee: 'M. Peuster, H. Küttner, and H. Karl, “ Let the state follow its flows: An
SDN-based flow handover protocol to support state migration,” in 4th IEEE International
Conference on Network Softwarization (NetSoft 2018), Montreal.'
mla: 'Peuster, Manuel, et al. “ Let the State Follow Its Flows: An SDN-Based Flow
Handover Protocol to Support State Migration.” 4th IEEE International Conference
on Network Softwarization (NetSoft 2018), doi:10.1109/NETSOFT.2018.8460007.'
short: 'M. Peuster, H. Küttner, H. Karl, in: 4th IEEE International Conference on
Network Softwarization (NetSoft 2018), Montreal, n.d.'
conference:
end_date: 2018-06-29
location: Montreal
name: 4th IEEE International Conference on Network Softwarization (NetSoft 2018)
start_date: 2018-06-25
date_created: 2018-06-25T12:21:49Z
date_updated: 2022-01-06T06:59:11Z
ddc:
- '000'
department:
- _id: '75'
doi: 10.1109/NETSOFT.2018.8460007
file:
- access_level: open_access
content_type: application/pdf
creator: peuster
date_created: 2018-07-05T11:11:37Z
date_updated: 2018-07-05T11:12:29Z
file_id: '3428'
file_name: main_ris.pdf
file_size: 901561
relation: main_file
file_date_updated: 2018-07-05T11:12:29Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: https://ieeexplore.ieee.org/document/8460007/
oa: '1'
place: Montreal
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: 4th IEEE International Conference on Network Softwarization (NetSoft
2018)
publication_status: accepted
status: public
title: ' Let the state follow its flows: An SDN-based flow handover protocol to support
state migration'
type: conference
urn: '33458'
user_id: '13271'
year: '2018'
...
---
_id: '3346'
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: 'Johannes '
full_name: 'Kampmeyer, Johannes '
last_name: Kampmeyer
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Peuster M, Kampmeyer J, Karl H. Containernet 2.0: A Rapid Prototyping Platform
for Hybrid Service Function Chains. In: 4th IEEE International Conference on
Network Softwarization (NetSoft 2018). Montreal. doi:10.1109/NETSOFT.2018.8459905'
apa: 'Peuster, M., Kampmeyer, J., & Karl, H. (n.d.). Containernet 2.0: A Rapid
Prototyping Platform for Hybrid Service Function Chains. In 4th IEEE International
Conference on Network Softwarization (NetSoft 2018). Montreal. https://doi.org/10.1109/NETSOFT.2018.8459905'
bibtex: '@inproceedings{Peuster_Kampmeyer_Karl, place={Montreal}, title={Containernet
2.0: A Rapid Prototyping Platform for Hybrid Service Function Chains}, DOI={10.1109/NETSOFT.2018.8459905},
booktitle={4th IEEE International Conference on Network Softwarization (NetSoft
2018)}, author={Peuster, Manuel and Kampmeyer, Johannes and Karl, Holger} }'
chicago: 'Peuster, Manuel, Johannes Kampmeyer, and Holger Karl. “Containernet 2.0:
A Rapid Prototyping Platform for Hybrid Service Function Chains.” In 4th IEEE
International Conference on Network Softwarization (NetSoft 2018). Montreal,
n.d. https://doi.org/10.1109/NETSOFT.2018.8459905.'
ieee: 'M. Peuster, J. Kampmeyer, and H. Karl, “Containernet 2.0: A Rapid Prototyping
Platform for Hybrid Service Function Chains,” in 4th IEEE International Conference
on Network Softwarization (NetSoft 2018), Montreal.'
mla: 'Peuster, Manuel, et al. “Containernet 2.0: A Rapid Prototyping Platform for
Hybrid Service Function Chains.” 4th IEEE International Conference on Network
Softwarization (NetSoft 2018), doi:10.1109/NETSOFT.2018.8459905.'
short: 'M. Peuster, J. Kampmeyer, H. Karl, in: 4th IEEE International Conference
on Network Softwarization (NetSoft 2018), Montreal, n.d.'
conference:
end_date: 2018-06-29
location: Montreal
name: 4th IEEE International Conference on Network Softwarization (NetSoft 2018)
start_date: 2018-06-25
date_created: 2018-06-25T12:24:19Z
date_updated: 2022-01-06T06:59:11Z
ddc:
- '000'
department:
- _id: '75'
doi: 10.1109/NETSOFT.2018.8459905
file:
- access_level: open_access
content_type: application/pdf
creator: peuster
date_created: 2018-07-05T11:12:55Z
date_updated: 2018-07-05T11:12:55Z
file_id: '3429'
file_name: main_ris.pdf
file_size: 449513
relation: main_file
file_date_updated: 2018-07-05T11:12:55Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: https://ieeexplore.ieee.org/document/8459905/
oa: '1'
place: Montreal
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: 4th IEEE International Conference on Network Softwarization (NetSoft
2018)
publication_status: accepted
status: public
title: 'Containernet 2.0: A Rapid Prototyping Platform for Hybrid Service Function
Chains'
type: conference
urn: '33467'
user_id: '13271'
year: '2018'
...
---
_id: '3347'
abstract:
- lang: eng
text: "Management and orchestration~(MANO) systems are the key components of future
large-scale NFV environments. They will manage resources of hundreds or even thousands
of NFV infrastructure installations, so called points of presence~(PoP). Such
scenarios need to be automatically tested during the development phase of a MANO
system. This task becomes very challenging because large-scale NFV testbeds are
hard to maintain, too expensive, or simply not available.\r\n\r\nIn this paper,
we present a multi-PoP NFV infrastructure emulation platform that enables automated,
large-scale testing of MANO stacks. We show that our platform can easily emulate
hundreds of PoPs on a single physical machine and reduces the setup time of a
test PoP by a factor of 232x compared to a DevStack-based test PoP installation.
Further, we present a case study in which we test ETSI's Open Source MANO~(OSM)
against our proposed system to gain insights about OSM's behaviour in large-scale
NFV deployments."
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: Gerado
full_name: Garcia de Blas, Gerado
last_name: Garcia de Blas
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Peuster M, Marchetti M, Garcia de Blas G, Karl H. Emulation-based Smoke Testing
of NFV Orchestrators in Large Multi-PoP Environments. In: European Conference
on Networks and Communications (EuCNC). Ljubljana. doi:10.1109/EuCNC.2018.8442701'
apa: Peuster, M., Marchetti, M., Garcia de Blas, G., & Karl, H. (n.d.). Emulation-based
Smoke Testing of NFV Orchestrators in Large Multi-PoP Environments. In European
Conference on Networks and Communications (EuCNC). Ljubljana. https://doi.org/10.1109/EuCNC.2018.8442701
bibtex: '@inproceedings{Peuster_Marchetti_Garcia de Blas_Karl, place={Ljubljana},
title={Emulation-based Smoke Testing of NFV Orchestrators in Large Multi-PoP Environments},
DOI={10.1109/EuCNC.2018.8442701},
booktitle={European Conference on Networks and Communications (EuCNC)}, author={Peuster,
Manuel and Marchetti, Michael and Garcia de Blas, Gerado and Karl, Holger} }'
chicago: Peuster, Manuel, Michael Marchetti, Gerado Garcia de Blas, and Holger Karl.
“Emulation-Based Smoke Testing of NFV Orchestrators in Large Multi-PoP Environments.”
In European Conference on Networks and Communications (EuCNC). Ljubljana,
n.d. https://doi.org/10.1109/EuCNC.2018.8442701.
ieee: M. Peuster, M. Marchetti, G. Garcia de Blas, and H. Karl, “Emulation-based
Smoke Testing of NFV Orchestrators in Large Multi-PoP Environments,” in European
Conference on Networks and Communications (EuCNC), Ljubljana.
mla: Peuster, Manuel, et al. “Emulation-Based Smoke Testing of NFV Orchestrators
in Large Multi-PoP Environments.” European Conference on Networks and Communications
(EuCNC), doi:10.1109/EuCNC.2018.8442701.
short: 'M. Peuster, M. Marchetti, G. Garcia de Blas, H. Karl, in: European Conference
on Networks and Communications (EuCNC), Ljubljana, n.d.'
conference:
location: Ljubljana
name: European Conference on Networks and Communications (EuCNC)
date_created: 2018-06-25T12:27:59Z
date_updated: 2022-01-06T06:59:12Z
ddc:
- '000'
department:
- _id: '75'
doi: 10.1109/EuCNC.2018.8442701
file:
- access_level: open_access
content_type: application/pdf
creator: peuster
date_created: 2018-07-05T11:13:29Z
date_updated: 2018-07-05T11:13:29Z
file_id: '3430'
file_name: main_ris.pdf
file_size: 713495
relation: main_file
file_date_updated: 2018-07-05T11:13:29Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: https://ieeexplore.ieee.org/document/8442701/
oa: '1'
place: Ljubljana
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: European Conference on Networks and Communications (EuCNC)
publication_status: accepted
status: public
title: Emulation-based Smoke Testing of NFV Orchestrators in Large Multi-PoP Environments
type: conference
urn: '33477'
user_id: '13271'
year: '2018'
...
---
_id: '3362'
abstract:
- lang: eng
text: Profiling applications on a heterogeneous compute node is challenging since
the way to retrieve data from the resources and interpret them varies between
resource types and manufacturers. This holds especially true for measuring the
energy consumption. In this paper we present Ampehre, a novel open source measurement
framework that allows developers to gather comparable measurements from heterogeneous
compute nodes, e.g., nodes comprising CPU, GPU, and FPGA. We explain the architecture
of Ampehre and detail the measurement process on the example of energy measurements
on CPU and GPU. To characterize the probing effect, we quantitatively analyze
the trade-off between the accuracy of measurements and the CPU load imposed by
Ampehre. Based on this analysis, we are able to specify reasonable combinations
of sampling periods for the different resource types of a compute node.
author:
- first_name: Achim
full_name: Lösch, Achim
id: '43646'
last_name: Lösch
- first_name: Alex
full_name: Wiens, Alex
last_name: Wiens
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Lösch A, Wiens A, Platzner M. Ampehre: An Open Source Measurement Framework
for Heterogeneous Compute Nodes. In: Proceedings of the International Conference
on Architecture of Computing Systems (ARCS). Vol 10793. Lecture Notes in Computer
Science. Cham: Springer International Publishing; 2018:73-84. doi:10.1007/978-3-319-77610-1_6'
apa: 'Lösch, A., Wiens, A., & Platzner, M. (2018). Ampehre: An Open Source Measurement
Framework for Heterogeneous Compute Nodes. In Proceedings of the International
Conference on Architecture of Computing Systems (ARCS) (Vol. 10793, pp. 73–84).
Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-77610-1_6'
bibtex: '@inproceedings{Lösch_Wiens_Platzner_2018, place={Cham}, series={Lecture
Notes in Computer Science}, title={Ampehre: An Open Source Measurement Framework
for Heterogeneous Compute Nodes}, volume={10793}, DOI={10.1007/978-3-319-77610-1_6},
booktitle={Proceedings of the International Conference on Architecture of Computing
Systems (ARCS)}, publisher={Springer International Publishing}, author={Lösch,
Achim and Wiens, Alex and Platzner, Marco}, year={2018}, pages={73–84}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Lösch, Achim, Alex Wiens, and Marco Platzner. “Ampehre: An Open Source
Measurement Framework for Heterogeneous Compute Nodes.” In Proceedings of the
International Conference on Architecture of Computing Systems (ARCS), 10793:73–84.
Lecture Notes in Computer Science. Cham: Springer International Publishing, 2018.
https://doi.org/10.1007/978-3-319-77610-1_6.'
ieee: 'A. Lösch, A. Wiens, and M. Platzner, “Ampehre: An Open Source Measurement
Framework for Heterogeneous Compute Nodes,” in Proceedings of the International
Conference on Architecture of Computing Systems (ARCS), 2018, vol. 10793,
pp. 73–84.'
mla: 'Lösch, Achim, et al. “Ampehre: An Open Source Measurement Framework for Heterogeneous
Compute Nodes.” Proceedings of the International Conference on Architecture
of Computing Systems (ARCS), vol. 10793, Springer International Publishing,
2018, pp. 73–84, doi:10.1007/978-3-319-77610-1_6.'
short: 'A. Lösch, A. Wiens, M. Platzner, in: Proceedings of the International Conference
on Architecture of Computing Systems (ARCS), Springer International Publishing,
Cham, 2018, pp. 73–84.'
date_created: 2018-06-26T13:47:52Z
date_updated: 2022-01-06T06:59:13Z
ddc:
- '040'
department:
- _id: '78'
doi: 10.1007/978-3-319-77610-1_6
file:
- access_level: closed
content_type: application/pdf
creator: aloesch
date_created: 2018-06-26T13:58:28Z
date_updated: 2018-06-26T13:58:28Z
file_id: '3363'
file_name: loesch2017_arcs.pdf
file_size: 1114026
relation: main_file
success: 1
file_date_updated: 2018-06-26T13:58:28Z
has_accepted_license: '1'
intvolume: ' 10793'
page: 73-84
place: Cham
project:
- _id: '14'
name: SFB 901 - Subproject C2
- _id: '4'
name: SFB 901 - Project Area C
- _id: '1'
name: SFB 901
publication: Proceedings of the International Conference on Architecture of Computing
Systems (ARCS)
publication_identifier:
isbn:
- '9783319776095'
- '9783319776101'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
series_title: Lecture Notes in Computer Science
status: public
title: 'Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes'
type: conference
user_id: '477'
volume: 10793
year: '2018'
...