---
_id: '51'
author:
- first_name: Nikolai
full_name: Winkelhake, Nikolai
last_name: Winkelhake
citation:
ama: Winkelhake N. Tying und Bundling in digitalen Märkten - eine wettbewerbspolitische
Analyse. Universität Paderborn; 2017.
apa: Winkelhake, N. (2017). Tying und Bundling in digitalen Märkten - eine wettbewerbspolitische
Analyse. Universität Paderborn.
bibtex: '@book{Winkelhake_2017, title={Tying und Bundling in digitalen Märkten -
eine wettbewerbspolitische Analyse}, publisher={Universität Paderborn}, author={Winkelhake,
Nikolai}, year={2017} }'
chicago: Winkelhake, Nikolai. Tying und Bundling in digitalen Märkten - eine
wettbewerbspolitische Analyse. Universität Paderborn, 2017.
ieee: N. Winkelhake, Tying und Bundling in digitalen Märkten - eine wettbewerbspolitische
Analyse. Universität Paderborn, 2017.
mla: Winkelhake, Nikolai. Tying und Bundling in digitalen Märkten - eine wettbewerbspolitische
Analyse. Universität Paderborn, 2017.
short: N. Winkelhake, Tying und Bundling in digitalen Märkten - eine wettbewerbspolitische
Analyse, Universität Paderborn, 2017.
date_created: 2017-10-17T12:41:01Z
date_updated: 2022-01-06T07:01:37Z
department:
- _id: '280'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Burkhard
full_name: Hehenkamp, Burkhard
id: '37339'
last_name: Hehenkamp
title: Tying und Bundling in digitalen Märkten - eine wettbewerbspolitische Analyse
type: mastersthesis
user_id: '42447'
year: '2017'
...
---
_id: '52'
author:
- first_name: Thomas
full_name: John, Thomas
id: '3952'
last_name: John
- first_name: Daniel
full_name: Szopinski, Daniel
id: '36372'
last_name: Szopinski
citation:
ama: 'John T, Szopinski D. Towards Explaining the Popularity of the Business Model
Canvas: A Dual-coding Approach. In: 1st Business Model Conference. ; 2017.'
apa: 'John, T., & Szopinski, D. (2017). Towards Explaining the Popularity of
the Business Model Canvas: A Dual-coding Approach. In 1st Business Model Conference.
Venice, Italy.'
bibtex: '@inproceedings{John_Szopinski_2017, title={Towards Explaining the Popularity
of the Business Model Canvas: A Dual-coding Approach}, booktitle={1st Business
Model Conference}, author={John, Thomas and Szopinski, Daniel}, year={2017} }'
chicago: 'John, Thomas, and Daniel Szopinski. “Towards Explaining the Popularity
of the Business Model Canvas: A Dual-Coding Approach.” In 1st Business Model
Conference, 2017.'
ieee: 'T. John and D. Szopinski, “Towards Explaining the Popularity of the Business
Model Canvas: A Dual-coding Approach,” in 1st Business Model Conference,
Venice, Italy, 2017.'
mla: 'John, Thomas, and Daniel Szopinski. “Towards Explaining the Popularity of
the Business Model Canvas: A Dual-Coding Approach.” 1st Business Model Conference,
2017.'
short: 'T. John, D. Szopinski, in: 1st Business Model Conference, 2017.'
conference:
location: Venice, Italy
name: 1st Business Model Conference
date_created: 2017-10-17T12:41:01Z
date_updated: 2022-01-06T07:01:43Z
ddc:
- '040'
department:
- _id: '276'
file:
- access_level: closed
content_type: application/pdf
creator: dsz
date_created: 2018-11-12T13:23:53Z
date_updated: 2018-11-12T13:23:53Z
file_id: '5504'
file_name: BuMoCo2017_Memorizing.pdf
file_size: 675134
relation: main_file
success: 1
file_date_updated: 2018-11-12T13:23:53Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '17'
name: SFB 901 - Subprojekt C5
- _id: '4'
name: SFB 901 - Project Area C
publication: 1st Business Model Conference
status: public
title: 'Towards Explaining the Popularity of the Business Model Canvas: A Dual-coding
Approach'
type: conference_abstract
user_id: '477'
year: '2017'
...
---
_id: '5204'
author:
- first_name: Johannes
full_name: Späth, Johannes
last_name: Späth
- first_name: Karim
full_name: Ali, Karim
last_name: Ali
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
citation:
ama: 'Späth J, Ali K, Bodden E. IDEal: Efficient and Precise Alias-aware Dataflow
Analysis. In: 2017 International Conference on Object-Oriented Programming,
Languages and Applications (OOPSLA/SPLASH). ACM Press; 2017.'
apa: 'Späth, J., Ali, K., & Bodden, E. (2017). IDEal: Efficient and Precise
Alias-aware Dataflow Analysis. In 2017 International Conference on Object-Oriented
Programming, Languages and Applications (OOPSLA/SPLASH). ACM Press.'
bibtex: '@inproceedings{Späth_Ali_Bodden_2017, title={IDEal: Efficient and Precise
Alias-aware Dataflow Analysis}, booktitle={2017 International Conference on Object-Oriented
Programming, Languages and Applications (OOPSLA/SPLASH)}, publisher={ACM Press},
author={Späth, Johannes and Ali, Karim and Bodden, Eric}, year={2017} }'
chicago: 'Späth, Johannes, Karim Ali, and Eric Bodden. “IDEal: Efficient and Precise
Alias-Aware Dataflow Analysis.” In 2017 International Conference on Object-Oriented
Programming, Languages and Applications (OOPSLA/SPLASH). ACM Press, 2017.'
ieee: 'J. Späth, K. Ali, and E. Bodden, “IDEal: Efficient and Precise Alias-aware
Dataflow Analysis,” in 2017 International Conference on Object-Oriented Programming,
Languages and Applications (OOPSLA/SPLASH), 2017.'
mla: 'Späth, Johannes, et al. “IDEal: Efficient and Precise Alias-Aware Dataflow
Analysis.” 2017 International Conference on Object-Oriented Programming, Languages
and Applications (OOPSLA/SPLASH), ACM Press, 2017.'
short: 'J. Späth, K. Ali, E. Bodden, in: 2017 International Conference on Object-Oriented
Programming, Languages and Applications (OOPSLA/SPLASH), ACM Press, 2017.'
date_created: 2018-10-31T12:46:50Z
date_updated: 2022-01-06T07:01:44Z
ddc:
- '000'
department:
- _id: '76'
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:28:13Z
date_updated: 2018-11-02T14:28:13Z
file_id: '5273'
file_name: sab17ideal.pdf
file_size: 1021251
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:28:13Z
has_accepted_license: '1'
keyword:
- ATTRACT
- ITSECWEBSITE
- CROSSING
language:
- iso: eng
main_file_link:
- url: ' http://bodden.de/pubs/sab17ideal.pdf'
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '12'
name: SFB 901 - Subproject B4
publication: 2017 International Conference on Object-Oriented Programming, Languages
and Applications (OOPSLA/SPLASH)
publisher: ACM Press
status: public
title: 'IDEal: Efficient and Precise Alias-aware Dataflow Analysis'
type: conference
user_id: '477'
year: '2017'
...
---
_id: '5209'
author:
- first_name: Andreas
full_name: Fischer, Andreas
last_name: Fischer
- first_name: Benny
full_name: Fuhry, Benny
last_name: Fuhry
- first_name: Florian
full_name: Kerschbaum, Florian
last_name: Kerschbaum
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
citation:
ama: Fischer A, Fuhry B, Kerschbaum F, Bodden E. Computation on Encrypted Data using
Data Flow Authentication. CoRR. 2017;abs/1710.00390.
apa: Fischer, A., Fuhry, B., Kerschbaum, F., & Bodden, E. (2017). Computation
on Encrypted Data using Data Flow Authentication. CoRR, abs/1710.00390.
bibtex: '@article{Fischer_Fuhry_Kerschbaum_Bodden_2017, title={Computation on Encrypted
Data using Data Flow Authentication}, volume={abs/1710.00390}, journal={CoRR},
author={Fischer, Andreas and Fuhry, Benny and Kerschbaum, Florian and Bodden,
Eric}, year={2017} }'
chicago: Fischer, Andreas, Benny Fuhry, Florian Kerschbaum, and Eric Bodden. “Computation
on Encrypted Data Using Data Flow Authentication.” CoRR abs/1710.00390
(2017).
ieee: A. Fischer, B. Fuhry, F. Kerschbaum, and E. Bodden, “Computation on Encrypted
Data using Data Flow Authentication,” CoRR, vol. abs/1710.00390, 2017.
mla: Fischer, Andreas, et al. “Computation on Encrypted Data Using Data Flow Authentication.”
CoRR, vol. abs/1710.00390, 2017.
short: A. Fischer, B. Fuhry, F. Kerschbaum, E. Bodden, CoRR abs/1710.00390 (2017).
date_created: 2018-10-31T13:12:32Z
date_updated: 2022-01-06T07:01:46Z
ddc:
- '000'
department:
- _id: '76'
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T16:03:01Z
date_updated: 2018-11-02T16:03:01Z
file_id: '5321'
file_name: 1710.00390.pdf
file_size: 2339380
relation: main_file
success: 1
file_date_updated: 2018-11-02T16:03:01Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: https://arxiv.org/pdf/1710.00390.pdf
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '12'
name: SFB 901 - Subproject B4
publication: CoRR
status: public
title: Computation on Encrypted Data using Data Flow Authentication
type: journal_article
user_id: '477'
volume: abs/1710.00390
year: '2017'
...
---
_id: '53'
abstract:
- lang: eng
text: "Amongst the growing body of literature on the drivers of online ratings,
the influence of\r\ncustomers’ local offline environment on their ratings has
largely been neglected. This\r\nstudy examines the relationship between ratings
made outside of a customer’s home area\r\nand the magnitude of online ratings.
We employ a data-driven identification of a\r\ncustomer’s geographic home area
and use variation in this variable to identify the\r\nconsequences for the magnitude
of ratings. In line with our theory, we find that customers\r\nwho rate while
traveling give, on average, higher ratings than locals. However, this\r\nrelationship
is moderated by the posting time of a review relative to consumption, as\r\ntravelers
post more negative ratings during or shortly after consumption. These\r\nrelationships
are most pronounced for customers who travel and rate less frequently. Our\r\nresults
come with substantial implications for a business’s average rating and for\r\ncustomer
decision making. "
author:
- first_name: Jürgen
full_name: Neumann, Jürgen
id: '32456'
last_name: Neumann
- first_name: Dominik
full_name: Gutt, Dominik
id: '14368'
last_name: Gutt
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
citation:
ama: 'Neumann J, Gutt D, Kundisch D. The Traveling Reviewer Problem – Exploring
the Relationship Between Offline Locations and Online Rating Behavior. In: Proceedings
of the 38th International Conference on Information Systems (ICIS). ; 2017.'
apa: Neumann, J., Gutt, D., & Kundisch, D. (2017). The Traveling Reviewer Problem
– Exploring the Relationship Between Offline Locations and Online Rating Behavior.
In Proceedings of the 38th International Conference on Information Systems
(ICIS). Seoul, South Korea.
bibtex: '@inproceedings{Neumann_Gutt_Kundisch_2017, title={The Traveling Reviewer
Problem – Exploring the Relationship Between Offline Locations and Online Rating
Behavior}, booktitle={Proceedings of the 38th International Conference on Information
Systems (ICIS)}, author={Neumann, Jürgen and Gutt, Dominik and Kundisch, Dennis},
year={2017} }'
chicago: Neumann, Jürgen, Dominik Gutt, and Dennis Kundisch. “The Traveling Reviewer
Problem – Exploring the Relationship Between Offline Locations and Online Rating
Behavior.” In Proceedings of the 38th International Conference on Information
Systems (ICIS), 2017.
ieee: J. Neumann, D. Gutt, and D. Kundisch, “The Traveling Reviewer Problem – Exploring
the Relationship Between Offline Locations and Online Rating Behavior,” in Proceedings
of the 38th International Conference on Information Systems (ICIS), Seoul,
South Korea, 2017.
mla: Neumann, Jürgen, et al. “The Traveling Reviewer Problem – Exploring the Relationship
Between Offline Locations and Online Rating Behavior.” Proceedings of the 38th
International Conference on Information Systems (ICIS), 2017.
short: 'J. Neumann, D. Gutt, D. Kundisch, in: Proceedings of the 38th International
Conference on Information Systems (ICIS), 2017.'
conference:
end_date: 2017-12-13
location: Seoul, South Korea
name: 38th International Conference on Information Systems (ICIS)
start_date: 2017-12-10
date_created: 2017-10-17T12:41:01Z
date_updated: 2022-01-06T07:01:49Z
ddc:
- '330'
department:
- _id: '276'
file:
- access_level: closed
content_type: application/pdf
creator: d0mi
date_created: 2018-11-12T10:30:59Z
date_updated: 2018-11-12T10:30:59Z
file_id: '5486'
file_name: viewcontent.pdf
file_size: 532659
relation: main_file
success: 1
file_date_updated: 2018-11-12T10:30:59Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '8'
name: SFB 901 - Subprojekt A4
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 38th International Conference on Information Systems
(ICIS)
status: public
title: The Traveling Reviewer Problem – Exploring the Relationship Between Offline
Locations and Online Rating Behavior
type: conference
user_id: '16205'
year: '2017'
...
---
_id: '54'
author:
- first_name: Jürgen
full_name: Neumann, Jürgen
id: '32456'
last_name: Neumann
- first_name: Dominik
full_name: Gutt, Dominik
id: '14368'
last_name: Gutt
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
citation:
ama: 'Neumann J, Gutt D, Kundisch D. The Traveling Reviewer Problem – Exploring
the Relationship between Offline Locations and Online Rating Behavior. In: INFORMS
Annual Meeting. ; 2017.'
apa: Neumann, J., Gutt, D., & Kundisch, D. (2017). The Traveling Reviewer Problem
– Exploring the Relationship between Offline Locations and Online Rating Behavior.
In INFORMS Annual Meeting. Houston, USA.
bibtex: '@inproceedings{Neumann_Gutt_Kundisch_2017, title={The Traveling Reviewer
Problem – Exploring the Relationship between Offline Locations and Online Rating
Behavior}, booktitle={INFORMS Annual Meeting}, author={Neumann, Jürgen and Gutt,
Dominik and Kundisch, Dennis}, year={2017} }'
chicago: Neumann, Jürgen, Dominik Gutt, and Dennis Kundisch. “The Traveling Reviewer
Problem – Exploring the Relationship between Offline Locations and Online Rating
Behavior.” In INFORMS Annual Meeting, 2017.
ieee: J. Neumann, D. Gutt, and D. Kundisch, “The Traveling Reviewer Problem – Exploring
the Relationship between Offline Locations and Online Rating Behavior,” in INFORMS
Annual Meeting, Houston, USA, 2017.
mla: Neumann, Jürgen, et al. “The Traveling Reviewer Problem – Exploring the Relationship
between Offline Locations and Online Rating Behavior.” INFORMS Annual Meeting,
2017.
short: 'J. Neumann, D. Gutt, D. Kundisch, in: INFORMS Annual Meeting, 2017.'
conference:
location: Houston, USA
name: INFORMS Annual Meeting
date_created: 2017-10-17T12:41:01Z
date_updated: 2022-01-06T07:01:51Z
ddc:
- '330'
department:
- _id: '276'
file:
- access_level: closed
content_type: application/pdf
creator: d0mi
date_created: 2018-11-12T10:38:39Z
date_updated: 2018-11-12T10:38:39Z
file_id: '5493'
file_name: WP_TRP.pdf
file_size: 694342
relation: main_file
success: 1
file_date_updated: 2018-11-12T10:38:39Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '8'
name: SFB 901 - Subprojekt A4
- _id: '2'
name: SFB 901 - Project Area A
publication: INFORMS Annual Meeting
status: public
title: The Traveling Reviewer Problem – Exploring the Relationship between Offline
Locations and Online Rating Behavior
type: conference_abstract
user_id: '477'
year: '2017'
...
---
_id: '55'
abstract:
- lang: eng
text: We introduce the mobile server problem, inspired by current trends to move
computational tasks from cloud structures to multiple devices close to the end
user. An example for this are embedded systems in autonomous cars that communicate
in order to coordinate their actions. Our model is a variant of the classical
Page Migration Problem. Moreformally, we consider a mobile server holding a data
page.The server can move in the Euclidean space (of arbitrary dimension). In every
round, requests for data items from the page pop up at arbitrary points in the
space. The requests are served, each at a cost of the distance from the requesting
point and the server, and the mobile server may move, at a cost D times the distance
traveled for some constant D . We assume a maximum distance m the server is allowed
to move per round. We show that no online algorithm can achieve a competitive
ratio independent of the length of the input sequence in this setting. Hence we
augment the maximum movement distance of the online algorithms to ( 1 + δ) times
the maximum distance of the offline solution. We provide a deterministic algorithm
which is simple to describe and works for multiple variants of our problem. The
algorithm achieves almost tight competitive ratios independent of the length of
the input sequence.
author:
- first_name: Björn
full_name: Feldkord, Björn
id: '22704'
last_name: Feldkord
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Feldkord B, Meyer auf der Heide F. The Mobile Server Problem. In: Proceedings
of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA).
; 2017:313-319. doi:10.1145/3087556.3087575'
apa: Feldkord, B., & Meyer auf der Heide, F. (2017). The Mobile Server Problem.
In Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures
(SPAA) (pp. 313–319). https://doi.org/10.1145/3087556.3087575
bibtex: '@inproceedings{Feldkord_Meyer auf der Heide_2017, title={The Mobile Server
Problem}, DOI={10.1145/3087556.3087575},
booktitle={Proceedings of the 29th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA)}, author={Feldkord, Björn and Meyer auf der Heide, Friedhelm},
year={2017}, pages={313–319} }'
chicago: Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server
Problem.” In Proceedings of the 29th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA), 313–19, 2017. https://doi.org/10.1145/3087556.3087575.
ieee: B. Feldkord and F. Meyer auf der Heide, “The Mobile Server Problem,” in Proceedings
of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA),
2017, pp. 313–319.
mla: Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server Problem.”
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures
(SPAA), 2017, pp. 313–19, doi:10.1145/3087556.3087575.
short: 'B. Feldkord, F. Meyer auf der Heide, in: Proceedings of the 29th ACM Symposium
on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 313–319.'
date_created: 2017-10-17T12:41:02Z
date_updated: 2022-01-06T07:01:56Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1145/3087556.3087575
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:55:10Z
date_updated: 2018-11-02T14:55:10Z
file_id: '5288'
file_name: p313-feldkord.pdf
file_size: 691691
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:55:10Z
has_accepted_license: '1'
language:
- iso: eng
page: 313-319
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 29th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA)
status: public
title: The Mobile Server Problem
type: conference
user_id: '477'
year: '2017'
...
---
_id: '56'
author:
- first_name: Thomas
full_name: John, Thomas
id: '3952'
last_name: John
citation:
ama: 'John T. Supporting Business Model Idea Generation Through Machine-generated
Ideas: A Design Theory. In: 1st Business Model Conference. ; 2017.'
apa: 'John, T. (2017). Supporting Business Model Idea Generation Through Machine-generated
Ideas: A Design Theory. In 1st Business Model Conference. Venice, Italy.'
bibtex: '@inproceedings{John_2017, title={Supporting Business Model Idea Generation
Through Machine-generated Ideas: A Design Theory}, booktitle={1st Business Model
Conference}, author={John, Thomas}, year={2017} }'
chicago: 'John, Thomas. “Supporting Business Model Idea Generation Through Machine-Generated
Ideas: A Design Theory.” In 1st Business Model Conference, 2017.'
ieee: 'T. John, “Supporting Business Model Idea Generation Through Machine-generated
Ideas: A Design Theory,” in 1st Business Model Conference, Venice, Italy,
2017.'
mla: 'John, Thomas. “Supporting Business Model Idea Generation Through Machine-Generated
Ideas: A Design Theory.” 1st Business Model Conference, 2017.'
short: 'T. John, in: 1st Business Model Conference, 2017.'
conference:
location: Venice, Italy
name: 1st Business Model Conference
date_created: 2017-10-17T12:41:02Z
date_updated: 2022-01-06T07:02:06Z
ddc:
- '040'
department:
- _id: '276'
file:
- access_level: closed
content_type: application/pdf
creator: abursig
date_created: 2018-12-03T15:37:06Z
date_updated: 2018-12-03T15:37:06Z
file_id: '5992'
file_name: BuMoCo2017_Ideagenerator.pdf
file_size: 347981
relation: main_file
success: 1
file_date_updated: 2018-12-03T15:37:06Z
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: 1st Business Model Conference
status: public
title: 'Supporting Business Model Idea Generation Through Machine-generated Ideas:
A Design Theory'
type: conference_abstract
user_id: '477'
year: '2017'
...
---
_id: '65'
abstract:
- lang: eng
text: Heterogeneous compute nodes in form of CPUs with attached GPU and FPGA accelerators
have strongly gained interested in the last years. Applications differ in their
execution characteristics and can therefore benefit from such heterogeneous resources
in terms of performance or energy consumption. While performance optimization
has been the only goal for a long time, nowadays research is more and more focusing
on techniques to minimize energy consumption due to rising electricity costs.This
paper presents reMinMin, a novel static list scheduling approach for optimizing
the total energy consumption for a set of tasks executed on a heterogeneous compute
node. reMinMin bases on a new energy model that differentiates between static
and dynamic energy components and covers effects of accelerator tasks on the host
CPU. The required energy values are retrieved by measurements on the real computing
system. In order to evaluate reMinMin, we compare it with two reference implementations
on three task sets with different degrees of heterogeneity. In our experiments,
MinMin is consistently better than a scheduler optimizing for dynamic energy only,
which requires up to 19.43% more energy, and very close to optimal schedules.
author:
- 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
citation:
ama: 'Lösch A, Platzner M. reMinMin: A Novel Static Energy-Centric List Scheduling
Approach Based on Real Measurements. In: Proceedings of the 28th Annual IEEE
International Conference on Application-Specific Systems, Architectures and Processors
(ASAP). ; 2017. doi:10.1109/ASAP.2017.7995272'
apa: 'Lösch, A., & Platzner, M. (2017). reMinMin: A Novel Static Energy-Centric
List Scheduling Approach Based on Real Measurements. In Proceedings of the
28th Annual IEEE International Conference on Application-specific Systems, Architectures
and Processors (ASAP). https://doi.org/10.1109/ASAP.2017.7995272'
bibtex: '@inproceedings{Lösch_Platzner_2017, title={reMinMin: A Novel Static Energy-Centric
List Scheduling Approach Based on Real Measurements}, DOI={10.1109/ASAP.2017.7995272},
booktitle={Proceedings of the 28th Annual IEEE International Conference on Application-specific
Systems, Architectures and Processors (ASAP)}, author={Lösch, Achim and Platzner,
Marco}, year={2017} }'
chicago: 'Lösch, Achim, and Marco Platzner. “ReMinMin: A Novel Static Energy-Centric
List Scheduling Approach Based on Real Measurements.” In Proceedings of the
28th Annual IEEE International Conference on Application-Specific Systems, Architectures
and Processors (ASAP), 2017. https://doi.org/10.1109/ASAP.2017.7995272.'
ieee: 'A. Lösch and M. Platzner, “reMinMin: A Novel Static Energy-Centric List Scheduling
Approach Based on Real Measurements,” in Proceedings of the 28th Annual IEEE
International Conference on Application-specific Systems, Architectures and Processors
(ASAP), 2017.'
mla: 'Lösch, Achim, and Marco Platzner. “ReMinMin: A Novel Static Energy-Centric
List Scheduling Approach Based on Real Measurements.” Proceedings of the 28th
Annual IEEE International Conference on Application-Specific Systems, Architectures
and Processors (ASAP), 2017, doi:10.1109/ASAP.2017.7995272.'
short: 'A. Lösch, M. Platzner, in: Proceedings of the 28th Annual IEEE International
Conference on Application-Specific Systems, Architectures and Processors (ASAP),
2017.'
date_created: 2017-10-17T12:41:04Z
date_updated: 2022-01-06T07:03:08Z
ddc:
- '040'
department:
- _id: '78'
doi: 10.1109/ASAP.2017.7995272
file:
- access_level: closed
content_type: application/pdf
creator: aloesch
date_created: 2018-11-14T09:37:55Z
date_updated: 2018-11-14T09:37:55Z
file_id: '5550'
file_name: loesch_asap2017.pdf
file_size: 467545
relation: main_file
success: 1
file_date_updated: 2018-11-14T09:37:55Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '14'
name: SFB 901 - Subprojekt C2
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 28th Annual IEEE International Conference on Application-specific
Systems, Architectures and Processors (ASAP)
status: public
title: 'reMinMin: A Novel Static Energy-Centric List Scheduling Approach Based on
Real Measurements'
type: conference
user_id: '477'
year: '2017'
...
---
_id: '66'
abstract:
- lang: eng
text: In budget games, players compete over resources with finite budgets. For every
resource, a player has a specific demand and as a strategy, he chooses a subset
of resources. If the total demand on a resource does not exceed its budget, the
utility of each player who chose that resource equals his demand. Otherwise, the
budget is shared proportionally. In the general case, pure Nash equilibria (NE)
do not exist for such games. In this paper, we consider the natural classes of
singleton and matroid budget games with additional constraints and show that for
each, pure NE can be guaranteed. In addition, we introduce a lexicographical potential
function to prove that every matroid budget game has an approximate pure NE which
depends on the largest ratio between the different demands of each individual
player.
author:
- first_name: Maximilian
full_name: Drees, Maximilian
last_name: Drees
- first_name: Matthias
full_name: Feldotto, Matthias
id: '14052'
last_name: Feldotto
orcid: 0000-0003-1348-6516
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: 'Drees M, Feldotto M, Riechers S, Skopalik A. Pure Nash Equilibria in Restricted
Budget Games. In: Proceedings of the 23rd International Computing and Combinatorics
Conference (COCOON). LNCS. ; 2017:175--187. doi:10.1007/978-3-319-62389-4_15'
apa: Drees, M., Feldotto, M., Riechers, S., & Skopalik, A. (2017). Pure Nash
Equilibria in Restricted Budget Games. In Proceedings of the 23rd International
Computing and Combinatorics Conference (COCOON) (pp. 175--187). https://doi.org/10.1007/978-3-319-62389-4_15
bibtex: '@inproceedings{Drees_Feldotto_Riechers_Skopalik_2017, series={LNCS}, title={Pure
Nash Equilibria in Restricted Budget Games}, DOI={10.1007/978-3-319-62389-4_15},
booktitle={Proceedings of the 23rd International Computing and Combinatorics Conference
(COCOON)}, author={Drees, Maximilian and Feldotto, Matthias and Riechers, Sören
and Skopalik, Alexander}, year={2017}, pages={175--187}, collection={LNCS} }'
chicago: Drees, Maximilian, Matthias Feldotto, Sören Riechers, and Alexander Skopalik.
“Pure Nash Equilibria in Restricted Budget Games.” In Proceedings of the 23rd
International Computing and Combinatorics Conference (COCOON), 175--187. LNCS,
2017. https://doi.org/10.1007/978-3-319-62389-4_15.
ieee: M. Drees, M. Feldotto, S. Riechers, and A. Skopalik, “Pure Nash Equilibria
in Restricted Budget Games,” in Proceedings of the 23rd International Computing
and Combinatorics Conference (COCOON), 2017, pp. 175--187.
mla: Drees, Maximilian, et al. “Pure Nash Equilibria in Restricted Budget Games.”
Proceedings of the 23rd International Computing and Combinatorics Conference
(COCOON), 2017, pp. 175--187, doi:10.1007/978-3-319-62389-4_15.
short: 'M. Drees, M. Feldotto, S. Riechers, A. Skopalik, in: Proceedings of the
23rd International Computing and Combinatorics Conference (COCOON), 2017, pp.
175--187.'
date_created: 2017-10-17T12:41:04Z
date_updated: 2022-01-06T07:03:13Z
ddc:
- '000'
department:
- _id: '541'
- _id: '63'
doi: 10.1007/978-3-319-62389-4_15
file:
- access_level: closed
content_type: application/pdf
creator: feldi
date_created: 2018-10-31T16:58:42Z
date_updated: 2018-10-31T16:58:42Z
file_id: '5228'
file_name: Drees2017_Chapter_PureNashEquilibriaInRestricted.pdf
file_size: 346390
relation: main_file
success: 1
file_date_updated: 2018-10-31T16:58:42Z
has_accepted_license: '1'
language:
- iso: eng
page: 175--187
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '16'
name: SFB 901 - Subproject C4
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 23rd International Computing and Combinatorics Conference
(COCOON)
series_title: LNCS
status: public
title: Pure Nash Equilibria in Restricted Budget Games
type: conference
user_id: '14052'
year: '2017'
...
---
_id: '67'
author:
- first_name: Mirko
full_name: Jürgens, Mirko
last_name: Jürgens
citation:
ama: Jürgens M. Provably Secure Key-Derivation-Functions for Certain Types of
Applications. Universität Paderborn; 2017.
apa: Jürgens, M. (2017). Provably Secure Key-Derivation-Functions for Certain
Types of Applications. Universität Paderborn.
bibtex: '@book{Jürgens_2017, title={Provably Secure Key-Derivation-Functions for
Certain Types of Applications}, publisher={Universität Paderborn}, author={Jürgens,
Mirko}, year={2017} }'
chicago: Jürgens, Mirko. Provably Secure Key-Derivation-Functions for Certain
Types of Applications. Universität Paderborn, 2017.
ieee: M. Jürgens, Provably Secure Key-Derivation-Functions for Certain Types
of Applications. Universität Paderborn, 2017.
mla: Jürgens, Mirko. Provably Secure Key-Derivation-Functions for Certain Types
of Applications. Universität Paderborn, 2017.
short: M. Jürgens, Provably Secure Key-Derivation-Functions for Certain Types of
Applications, Universität Paderborn, 2017.
date_created: 2017-10-17T12:41:04Z
date_updated: 2022-01-06T07:03:15Z
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: Provably Secure Key-Derivation-Functions for Certain Types of Applications
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '68'
abstract:
- lang: eng
text: Proof-carrying hardware (PCH) is a principle for achieving safety for dynamically
reconfigurable hardware systems. The producer of a hardware module spends huge
effort when creating a proof for a safety policy. The proof is then transferred
as a certificate together with the configuration bitstream to the consumer of
the hardware module, who can quickly verify the given proof. Previous work utilized
SAT solvers and resolution traces to set up a PCH technology and corresponding
tool flows. In this article, we present a novel technology for PCH based on inductive
invariants. For sequential circuits, our approach is fundamentally stronger than
the previous SAT-based one since we avoid the limitations of bounded unrolling.
We contrast our technology to existing ones and show that it fits into previously
proposed tool flows. We conduct experiments with four categories of benchmark
circuits and report consumer and producer runtime and peak memory consumption,
as well as the size of the certificates and the distribution of the workload between
producer and consumer. Experiments clearly show that our new induction-based technology
is superior for sequential circuits, whereas the previous SAT-based technology
is the better choice for combinational circuits.
author:
- first_name: Tobias
full_name: Isenberg, Tobias
last_name: Isenberg
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
- first_name: Tobias
full_name: Wiersema, Tobias
id: '3118'
last_name: Wiersema
citation:
ama: Isenberg T, Platzner M, Wehrheim H, Wiersema T. Proof-Carrying Hardware via
Inductive Invariants. ACM Transactions on Design Automation of Electronic Systems.
2017;(4):61:1--61:23. doi:10.1145/3054743
apa: Isenberg, T., Platzner, M., Wehrheim, H., & Wiersema, T. (2017). Proof-Carrying
Hardware via Inductive Invariants. ACM Transactions on Design Automation of
Electronic Systems, (4), 61:1--61:23. https://doi.org/10.1145/3054743
bibtex: '@article{Isenberg_Platzner_Wehrheim_Wiersema_2017, title={Proof-Carrying
Hardware via Inductive Invariants}, DOI={10.1145/3054743},
number={4}, journal={ACM Transactions on Design Automation of Electronic Systems},
publisher={ACM}, author={Isenberg, Tobias and Platzner, Marco and Wehrheim, Heike
and Wiersema, Tobias}, year={2017}, pages={61:1--61:23} }'
chicago: 'Isenberg, Tobias, Marco Platzner, Heike Wehrheim, and Tobias Wiersema.
“Proof-Carrying Hardware via Inductive Invariants.” ACM Transactions on Design
Automation of Electronic Systems, no. 4 (2017): 61:1--61:23. https://doi.org/10.1145/3054743.'
ieee: T. Isenberg, M. Platzner, H. Wehrheim, and T. Wiersema, “Proof-Carrying Hardware
via Inductive Invariants,” ACM Transactions on Design Automation of Electronic
Systems, no. 4, pp. 61:1--61:23, 2017.
mla: Isenberg, Tobias, et al. “Proof-Carrying Hardware via Inductive Invariants.”
ACM Transactions on Design Automation of Electronic Systems, no. 4, ACM,
2017, pp. 61:1--61:23, doi:10.1145/3054743.
short: T. Isenberg, M. Platzner, H. Wehrheim, T. Wiersema, ACM Transactions on Design
Automation of Electronic Systems (2017) 61:1--61:23.
date_created: 2017-10-17T12:41:04Z
date_updated: 2022-01-06T07:03:20Z
ddc:
- '000'
department:
- _id: '77'
- _id: '78'
doi: 10.1145/3054743
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T16:08:17Z
date_updated: 2018-11-02T16:08:17Z
file_id: '5324'
file_name: a61-isenberg.pdf
file_size: 806356
relation: main_file
success: 1
file_date_updated: 2018-11-02T16:08:17Z
has_accepted_license: '1'
issue: '4'
language:
- iso: eng
page: 61:1--61:23
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: ACM Transactions on Design Automation of Electronic Systems
publisher: ACM
status: public
title: Proof-Carrying Hardware via Inductive Invariants
type: journal_article
user_id: '3118'
year: '2017'
...
---
_id: '685'
author:
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
citation:
ama: Jakobs M-C. On-The-Fly Safety Checking - Customizing Program Certification
and Program Restructuring. Universität Paderborn; 2017. doi:10.17619/UNIPB/1-104
apa: Jakobs, M.-C. (2017). On-The-Fly Safety Checking - Customizing Program Certification
and Program Restructuring. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-104
bibtex: '@book{Jakobs_2017, title={On-The-Fly Safety Checking - Customizing Program
Certification and Program Restructuring}, DOI={10.17619/UNIPB/1-104},
publisher={Universität Paderborn}, author={Jakobs, Marie-Christine}, year={2017}
}'
chicago: Jakobs, Marie-Christine. On-The-Fly Safety Checking - Customizing Program
Certification and Program Restructuring. Universität Paderborn, 2017. https://doi.org/10.17619/UNIPB/1-104.
ieee: M.-C. Jakobs, On-The-Fly Safety Checking - Customizing Program Certification
and Program Restructuring. Universität Paderborn, 2017.
mla: Jakobs, Marie-Christine. On-The-Fly Safety Checking - Customizing Program
Certification and Program Restructuring. Universität Paderborn, 2017, doi:10.17619/UNIPB/1-104.
short: M.-C. Jakobs, On-The-Fly Safety Checking - Customizing Program Certification
and Program Restructuring, Universität Paderborn, 2017.
date_created: 2017-11-13T08:13:29Z
date_updated: 2022-01-06T07:03:22Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.17619/UNIPB/1-104
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-14T12:26:52Z
date_updated: 2018-03-14T12:26:52Z
file_id: '1211'
file_name: 685-Dissertation-Jakobs.pdf
file_size: 11828624
relation: main_file
success: 1
file_date_updated: 2018-03-14T12:26:52Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _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: On-The-Fly Safety Checking - Customizing Program Certification and Program
Restructuring
type: dissertation
user_id: '477'
year: '2017'
...
---
_id: '69'
abstract:
- lang: eng
text: 'Today, software is traded worldwide on global markets, with apps being downloaded
to smartphones within minutes or seconds. This poses, more than ever, the challenge
of ensuring safety of software in the face of (1) unknown or untrusted software
providers together with (2) resource-limited software consumers. The concept of
Proof-Carrying Code (PCC), years ago suggested by Necula, provides one framework
for securing the execution of untrusted code. PCC techniques attach safety proofs,
constructed by software producers, to code. Based on the assumption that checking
proofs is usually much simpler than constructing proofs, software consumers should
thus be able to quickly check the safety of software. However, PCC techniques
often suffer from the size of certificates (i.e., the attached proofs), making
PCC techniques inefficient in practice.In this article, we introduce a new framework
for the safe execution of untrusted code called Programs from Proofs (PfP). The
basic assumption underlying the PfP technique is the fact that the structure of
programs significantly influences the complexity of checking a specific safety
property. Instead of attaching proofs to program code, the PfP technique transforms
the program into an efficiently checkable form, thus guaranteeing quick safety
checks for software consumers. For this transformation, the technique also uses
a producer-side automatic proof of safety. More specifically, safety proving for
the software producer proceeds via the construction of an abstract reachability
graph (ARG) unfolding the control-flow automaton (CFA) up to the degree necessary
for simple checking. To this end, we combine different sorts of software analysis:
expensive analyses incrementally determining the degree of unfolding, and cheap
analyses responsible for safety checking. Out of the abstract reachability graph
we generate the new program. In its CFA structure, it is isomorphic to the graph
and hence another, this time consumer-side, cheap analysis can quickly determine
its safety.Like PCC, Programs from Proofs is a general framework instantiable
with different sorts of (expensive and cheap) analysis. Here, we present the general
framework and exemplify it by some concrete examples. We have implemented different
instantiations on top of the configurable program analysis tool CPAchecker and
report on experiments, in particular on comparisons with PCC techniques.'
author:
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Jakobs M-C, Wehrheim H. Programs from Proofs: A Framework for the Safe Execution
of Untrusted Software. ACM Transactions on Programming Languages and Systems.
2017;(2):7:1-7:56. doi:10.1145/3014427'
apa: 'Jakobs, M.-C., & Wehrheim, H. (2017). Programs from Proofs: A Framework
for the Safe Execution of Untrusted Software. ACM Transactions on Programming
Languages and Systems, (2), 7:1-7:56. https://doi.org/10.1145/3014427'
bibtex: '@article{Jakobs_Wehrheim_2017, title={Programs from Proofs: A Framework
for the Safe Execution of Untrusted Software}, DOI={10.1145/3014427},
number={2}, journal={ACM Transactions on Programming Languages and Systems}, publisher={ACM},
author={Jakobs, Marie-Christine and Wehrheim, Heike}, year={2017}, pages={7:1-7:56}
}'
chicago: 'Jakobs, Marie-Christine, and Heike Wehrheim. “Programs from Proofs: A
Framework for the Safe Execution of Untrusted Software.” ACM Transactions on
Programming Languages and Systems, no. 2 (2017): 7:1-7:56. https://doi.org/10.1145/3014427.'
ieee: 'M.-C. Jakobs and H. Wehrheim, “Programs from Proofs: A Framework for the
Safe Execution of Untrusted Software,” ACM Transactions on Programming Languages
and Systems, no. 2, pp. 7:1-7:56, 2017.'
mla: 'Jakobs, Marie-Christine, and Heike Wehrheim. “Programs from Proofs: A Framework
for the Safe Execution of Untrusted Software.” ACM Transactions on Programming
Languages and Systems, no. 2, ACM, 2017, pp. 7:1-7:56, doi:10.1145/3014427.'
short: M.-C. Jakobs, H. Wehrheim, ACM Transactions on Programming Languages and
Systems (2017) 7:1-7:56.
date_created: 2017-10-17T12:41:04Z
date_updated: 2022-01-06T07:03:23Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1145/3014427
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T13:15:09Z
date_updated: 2018-03-21T13:15:09Z
file_id: '1575'
file_name: 69-a7-jakobs.pdf
file_size: 1215139
relation: main_file
success: 1
file_date_updated: 2018-03-21T13:15:09Z
has_accepted_license: '1'
issue: '2'
language:
- iso: eng
page: 7:1-7:56
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: ACM Transactions on Programming Languages and Systems
publisher: ACM
status: public
title: 'Programs from Proofs: A Framework for the Safe Execution of Untrusted Software'
type: journal_article
user_id: '477'
year: '2017'
...
---
_id: '696'
author:
- first_name: Lennart
full_name: Wachowiak, Lennart
last_name: Wachowiak
citation:
ama: Wachowiak L. Das Mobile Server Problem in Netzwerken. Universität Paderborn;
2017.
apa: Wachowiak, L. (2017). Das Mobile Server Problem in Netzwerken. Universität
Paderborn.
bibtex: '@book{Wachowiak_2017, title={Das Mobile Server Problem in Netzwerken},
publisher={Universität Paderborn}, author={Wachowiak, Lennart}, year={2017} }'
chicago: Wachowiak, Lennart. Das Mobile Server Problem in Netzwerken. Universität
Paderborn, 2017.
ieee: L. Wachowiak, Das Mobile Server Problem in Netzwerken. Universität
Paderborn, 2017.
mla: Wachowiak, Lennart. Das Mobile Server Problem in Netzwerken. Universität
Paderborn, 2017.
short: L. Wachowiak, Das Mobile Server Problem in Netzwerken, Universität Paderborn,
2017.
date_created: 2017-11-14T06:58:39Z
date_updated: 2022-01-06T07:03:24Z
language:
- iso: ger
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
title: Das Mobile Server Problem in Netzwerken
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '697'
author:
- first_name: Michel
full_name: Burkhardt, Michel
last_name: Burkhardt
citation:
ama: Burkhardt M. Untersuchungen zum Cone-Hashing. Universität Paderborn;
2017.
apa: Burkhardt, M. (2017). Untersuchungen zum Cone-Hashing. Universität Paderborn.
bibtex: '@book{Burkhardt_2017, title={Untersuchungen zum Cone-Hashing}, publisher={Universität
Paderborn}, author={Burkhardt, Michel}, year={2017} }'
chicago: Burkhardt, Michel. Untersuchungen zum Cone-Hashing. Universität
Paderborn, 2017.
ieee: M. Burkhardt, Untersuchungen zum Cone-Hashing. Universität Paderborn,
2017.
mla: Burkhardt, Michel. Untersuchungen zum Cone-Hashing. Universität Paderborn,
2017.
short: M. Burkhardt, Untersuchungen zum Cone-Hashing, Universität Paderborn, 2017.
date_created: 2017-11-14T08:01:41Z
date_updated: 2022-01-06T07:03:24Z
language:
- iso: ger
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
title: Untersuchungen zum Cone-Hashing
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '104'
author:
- first_name: Denis
full_name: Diemert, Denis
last_name: Diemert
citation:
ama: Diemert D. EAX - An Authenticated Encryption Mode for Block Ciphers.
Universität Paderborn; 2017.
apa: Diemert, D. (2017). EAX - An Authenticated Encryption Mode for Block Ciphers.
Universität Paderborn.
bibtex: '@book{Diemert_2017, title={EAX - An Authenticated Encryption Mode for Block
Ciphers}, publisher={Universität Paderborn}, author={Diemert, Denis}, year={2017}
}'
chicago: Diemert, Denis. EAX - An Authenticated Encryption Mode for Block Ciphers.
Universität Paderborn, 2017.
ieee: D. Diemert, EAX - An Authenticated Encryption Mode for Block Ciphers.
Universität Paderborn, 2017.
mla: Diemert, Denis. EAX - An Authenticated Encryption Mode for Block Ciphers.
Universität Paderborn, 2017.
short: D. Diemert, EAX - An Authenticated Encryption Mode for Block Ciphers, Universität
Paderborn, 2017.
date_created: 2017-10-17T12:41:11Z
date_updated: 2022-01-06T06:50:38Z
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: EAX - An Authenticated Encryption Mode for Block Ciphers
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '1048'
author:
- first_name: Andreas
full_name: Schenk, Andreas
last_name: Schenk
citation:
ama: Schenk A. Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen.
Universität Paderborn; 2017.
apa: Schenk, A. (2017). Monotone Suchbarkeit in mehrdimensionalen verteilten
Datenstrukturen. Universität Paderborn.
bibtex: '@book{Schenk_2017, title={Monotone Suchbarkeit in mehrdimensionalen verteilten
Datenstrukturen}, publisher={Universität Paderborn}, author={Schenk, Andreas},
year={2017} }'
chicago: Schenk, Andreas. Monotone Suchbarkeit in mehrdimensionalen verteilten
Datenstrukturen. Universität Paderborn, 2017.
ieee: A. Schenk, Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen.
Universität Paderborn, 2017.
mla: Schenk, Andreas. Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen.
Universität Paderborn, 2017.
short: A. Schenk, Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen,
Universität Paderborn, 2017.
date_created: 2017-12-13T10:14:30Z
date_updated: 2022-01-06T06:50:41Z
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publisher: Universität Paderborn
status: public
title: Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '1049'
author:
- first_name: Björn
full_name: Beckendorfer, Björn
last_name: Beckendorfer
citation:
ama: Beckendorfer B. Visualisierung zu Algorithmen verteilter Netzwerksysteme.
Universität Paderborn; 2017.
apa: Beckendorfer, B. (2017). Visualisierung zu Algorithmen verteilter Netzwerksysteme.
Universität Paderborn.
bibtex: '@book{Beckendorfer_2017, title={Visualisierung zu Algorithmen verteilter
Netzwerksysteme}, publisher={Universität Paderborn}, author={Beckendorfer, Björn},
year={2017} }'
chicago: Beckendorfer, Björn. Visualisierung zu Algorithmen verteilter Netzwerksysteme.
Universität Paderborn, 2017.
ieee: B. Beckendorfer, Visualisierung zu Algorithmen verteilter Netzwerksysteme.
Universität Paderborn, 2017.
mla: Beckendorfer, Björn. Visualisierung zu Algorithmen verteilter Netzwerksysteme.
Universität Paderborn, 2017.
short: B. Beckendorfer, Visualisierung zu Algorithmen verteilter Netzwerksysteme,
Universität Paderborn, 2017.
date_created: 2017-12-13T10:17:43Z
date_updated: 2022-01-06T06:50:42Z
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publisher: Universität Paderborn
status: public
title: Visualisierung zu Algorithmen verteilter Netzwerksysteme
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '105'
abstract:
- lang: eng
text: We initiate the study of network monitoring algorithms in a class of hybrid
networks in which the nodes are connected by an external network and an internal
network (as a short form for externally and internally controlled network). While
the external network lies outside of the control of the nodes (or in our case,
the monitoring protocol running in them) and might be exposed to continuous changes,
the internal network is fully under the control of the nodes. As an example, consider
a group of users with mobile devices having access to the cell phone infrastructure.
While the network formed by the WiFi connections of the devices is an external
network (as its structure is not necessarily under the control of the monitoring
protocol), the connections between the devices via the cell phone infrastructure
represent an internal network (as it can be controlled by the monitoring protocol).
Our goal is to continuously monitor properties of the external network with the
help of the internal network. We present scalable distributed algorithms that
efficiently monitor the number of edges, the average node degree, the clustering
coefficient, the bipartiteness, and the weight of a minimum spanning tree. Their
performance bounds demonstrate that monitoring the external network state with
the help of an internal network can be done much more efficiently than just using
the external network, as is usually done in the literature.
author:
- first_name: Robert
full_name: Gmyr, Robert
last_name: Gmyr
- first_name: Kristian
full_name: Hinnenthal, Kristian
id: '32229'
last_name: Hinnenthal
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
citation:
ama: 'Gmyr R, Hinnenthal K, Scheideler C, Sohler C. Distributed Monitoring of Network
Properties: The Power of Hybrid Networks. In: Proceedings of the 44th International
Colloquium on Automata, Languages, and Programming (ICALP). Leibniz International
Proceedings in Informatics (LIPIcs). ; 2017:137:1--137:15. doi:10.4230/LIPIcs.ICALP.2017.137'
apa: 'Gmyr, R., Hinnenthal, K., Scheideler, C., & Sohler, C. (2017). Distributed
Monitoring of Network Properties: The Power of Hybrid Networks. In Proceedings
of the 44th International Colloquium on Automata, Languages, and Programming (ICALP)
(pp. 137:1--137:15). https://doi.org/10.4230/LIPIcs.ICALP.2017.137'
bibtex: '@inproceedings{Gmyr_Hinnenthal_Scheideler_Sohler_2017, series={Leibniz
International Proceedings in Informatics (LIPIcs)}, title={Distributed Monitoring
of Network Properties: The Power of Hybrid Networks}, DOI={10.4230/LIPIcs.ICALP.2017.137},
booktitle={Proceedings of the 44th International Colloquium on Automata, Languages,
and Programming (ICALP)}, author={Gmyr, Robert and Hinnenthal, Kristian and Scheideler,
Christian and Sohler, Christian}, year={2017}, pages={137:1--137:15}, collection={Leibniz
International Proceedings in Informatics (LIPIcs)} }'
chicago: 'Gmyr, Robert, Kristian Hinnenthal, Christian Scheideler, and Christian
Sohler. “Distributed Monitoring of Network Properties: The Power of Hybrid Networks.”
In Proceedings of the 44th International Colloquium on Automata, Languages,
and Programming (ICALP), 137:1--137:15. Leibniz International Proceedings
in Informatics (LIPIcs), 2017. https://doi.org/10.4230/LIPIcs.ICALP.2017.137.'
ieee: 'R. Gmyr, K. Hinnenthal, C. Scheideler, and C. Sohler, “Distributed Monitoring
of Network Properties: The Power of Hybrid Networks,” in Proceedings of the
44th International Colloquium on Automata, Languages, and Programming (ICALP),
2017, pp. 137:1--137:15.'
mla: 'Gmyr, Robert, et al. “Distributed Monitoring of Network Properties: The Power
of Hybrid Networks.” Proceedings of the 44th International Colloquium on Automata,
Languages, and Programming (ICALP), 2017, pp. 137:1--137:15, doi:10.4230/LIPIcs.ICALP.2017.137.'
short: 'R. Gmyr, K. Hinnenthal, C. Scheideler, C. Sohler, in: Proceedings of the
44th International Colloquium on Automata, Languages, and Programming (ICALP),
2017, pp. 137:1--137:15.'
date_created: 2017-10-17T12:41:12Z
date_updated: 2022-01-06T06:50:42Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.4230/LIPIcs.ICALP.2017.137
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-13T09:23:11Z
date_updated: 2018-03-13T09:23:11Z
file_id: '1207'
file_name: 105-ICALP17-GHSS.pdf
file_size: 504161
relation: main_file
success: 1
file_date_updated: 2018-03-13T09:23:11Z
has_accepted_license: '1'
language:
- iso: eng
page: 137:1--137:15
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Proceedings of the 44th International Colloquium on Automata, Languages,
and Programming (ICALP)
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: 'Distributed Monitoring of Network Properties: The Power of Hybrid Networks'
type: conference
user_id: '20792'
year: '2017'
...