---
_id: '3160'
author:
- first_name: Simon
full_name: Doherty, Simon
last_name: Doherty
- first_name: Brijesh
full_name: Dongol, Brijesh
last_name: Dongol
- first_name: John
full_name: Derrick, John
last_name: Derrick
- first_name: Gerhard
full_name: Schellhorn, Gerhard
last_name: Schellhorn
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Doherty S, Dongol B, Derrick J, Schellhorn G, Wehrheim H. Proving Opacity
of a Pessimistic {STM}. In: Fatourou P, Jim{\’{e}}nez E, Pedone F, eds. 20th
International Conference on Principles of Distributed Systems, {OPODIS} 2016,
December 13-16, 2016, Madrid, Spain. LIPIcs. ; 2016:35:1--35:17. doi:10.4230/LIPIcs.OPODIS.2016.35'
apa: Doherty, S., Dongol, B., Derrick, J., Schellhorn, G., & Wehrheim, H. (2016).
Proving Opacity of a Pessimistic {STM}. In P. Fatourou, E. Jim{\’{e}}nez, &
F. Pedone (Eds.), 20th International Conference on Principles of Distributed
Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain (pp. 35:1--35:17).
https://doi.org/10.4230/LIPIcs.OPODIS.2016.35
bibtex: '@inproceedings{Doherty_Dongol_Derrick_Schellhorn_Wehrheim_2016, series={LIPIcs},
title={Proving Opacity of a Pessimistic {STM}}, DOI={10.4230/LIPIcs.OPODIS.2016.35},
booktitle={20th International Conference on Principles of Distributed Systems,
{OPODIS} 2016, December 13-16, 2016, Madrid, Spain}, author={Doherty, Simon and
Dongol, Brijesh and Derrick, John and Schellhorn, Gerhard and Wehrheim, Heike},
editor={Fatourou, Panagiota and Jim{\’{e}}nez, Ernesto and Pedone, FernandoEditors},
year={2016}, pages={35:1--35:17}, collection={LIPIcs} }'
chicago: Doherty, Simon, Brijesh Dongol, John Derrick, Gerhard Schellhorn, and Heike
Wehrheim. “Proving Opacity of a Pessimistic {STM}.” In 20th International Conference
on Principles of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid,
Spain, edited by Panagiota Fatourou, Ernesto Jim{\’{e}}nez, and Fernando Pedone,
35:1--35:17. LIPIcs, 2016. https://doi.org/10.4230/LIPIcs.OPODIS.2016.35.
ieee: S. Doherty, B. Dongol, J. Derrick, G. Schellhorn, and H. Wehrheim, “Proving
Opacity of a Pessimistic {STM},” in 20th International Conference on Principles
of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain,
2016, pp. 35:1--35:17.
mla: Doherty, Simon, et al. “Proving Opacity of a Pessimistic {STM}.” 20th International
Conference on Principles of Distributed Systems, {OPODIS} 2016, December 13-16,
2016, Madrid, Spain, edited by Panagiota Fatourou et al., 2016, pp. 35:1--35:17,
doi:10.4230/LIPIcs.OPODIS.2016.35.
short: 'S. Doherty, B. Dongol, J. Derrick, G. Schellhorn, H. Wehrheim, in: P. Fatourou,
E. Jim{\’{e}}nez, F. Pedone (Eds.), 20th International Conference on Principles
of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain, 2016,
pp. 35:1--35:17.'
date_created: 2018-06-13T07:44:15Z
date_updated: 2022-01-06T06:59:01Z
department:
- _id: '77'
doi: 10.4230/LIPIcs.OPODIS.2016.35
editor:
- first_name: Panagiota
full_name: Fatourou, Panagiota
last_name: Fatourou
- first_name: Ernesto
full_name: Jim{\'{e}}nez, Ernesto
last_name: Jim{\'{e}}nez
- first_name: Fernando
full_name: Pedone, Fernando
last_name: Pedone
page: 35:1--35:17
project:
- _id: '78'
name: Validation of Software Transactional Memory
publication: 20th International Conference on Principles of Distributed Systems, {OPODIS}
2016, December 13-16, 2016, Madrid, Spain
series_title: LIPIcs
status: public
title: Proving Opacity of a Pessimistic {STM}
type: conference
user_id: '29719'
year: '2016'
...
---
_id: '3161'
author:
- first_name: Tobias
full_name: Isenberg, Tobias
last_name: Isenberg
- first_name: Marie{-}Christine
full_name: Jakobs, Marie{-}Christine
last_name: Jakobs
- first_name: Felix
full_name: Pauck, Felix
last_name: Pauck
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: Isenberg T, Jakobs M-}Christine, Pauck F, Wehrheim H. Deriving approximation
tolerance constraints from verification runs. CoRR. 2016.
apa: Isenberg, T., Jakobs, M.-}Christine, Pauck, F., & Wehrheim, H. (2016).
Deriving approximation tolerance constraints from verification runs. CoRR.
bibtex: '@article{Isenberg_Jakobs_Pauck_Wehrheim_2016, title={Deriving approximation
tolerance constraints from verification runs}, journal={CoRR}, author={Isenberg,
Tobias and Jakobs, Marie{-}Christine and Pauck, Felix and Wehrheim, Heike}, year={2016}
}'
chicago: Isenberg, Tobias, Marie{-}Christine Jakobs, Felix Pauck, and Heike Wehrheim.
“Deriving Approximation Tolerance Constraints from Verification Runs.” CoRR,
2016.
ieee: T. Isenberg, M.-}Christine Jakobs, F. Pauck, and H. Wehrheim, “Deriving approximation
tolerance constraints from verification runs,” CoRR, 2016.
mla: Isenberg, Tobias, et al. “Deriving Approximation Tolerance Constraints from
Verification Runs.” CoRR, 2016.
short: T. Isenberg, M.-}Christine Jakobs, F. Pauck, H. Wehrheim, CoRR (2016).
date_created: 2018-06-13T07:45:27Z
date_updated: 2022-01-06T06:59:01Z
department:
- _id: '77'
publication: CoRR
status: public
title: Deriving approximation tolerance constraints from verification runs
type: journal_article
user_id: '29719'
year: '2016'
...
---
_id: '210'
author:
- first_name: Lennart
full_name: Leder, Lennart
last_name: Leder
citation:
ama: Leder L. Congestion Games with Mixed Objectives. Universität Paderborn;
2016.
apa: Leder, L. (2016). Congestion Games with Mixed Objectives. Universität
Paderborn.
bibtex: '@book{Leder_2016, title={Congestion Games with Mixed Objectives}, publisher={Universität
Paderborn}, author={Leder, Lennart}, year={2016} }'
chicago: Leder, Lennart. Congestion Games with Mixed Objectives. Universität
Paderborn, 2016.
ieee: L. Leder, Congestion Games with Mixed Objectives. Universität Paderborn,
2016.
mla: Leder, Lennart. Congestion Games with Mixed Objectives. Universität
Paderborn, 2016.
short: L. Leder, Congestion Games with Mixed Objectives, Universität Paderborn,
2016.
date_created: 2017-10-17T12:41:33Z
date_updated: 2022-01-06T06:54:42Z
department:
- _id: '63'
- _id: '541'
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: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
title: Congestion Games with Mixed Objectives
type: mastersthesis
user_id: '14052'
year: '2016'
...
---
_id: '213'
author:
- first_name: Laurens
full_name: Porzenheim, Laurens
last_name: Porzenheim
citation:
ama: Porzenheim L. Comparison of Different Definitions of Chosen-Ciphertext Security
in Encryption Schemes. Universität Paderborn; 2016.
apa: Porzenheim, L. (2016). Comparison of different Definitions of Chosen-Ciphertext
Security in Encryption schemes. Universität Paderborn.
bibtex: '@book{Porzenheim_2016, title={Comparison of different Definitions of Chosen-Ciphertext
Security in Encryption schemes}, publisher={Universität Paderborn}, author={Porzenheim,
Laurens}, year={2016} }'
chicago: Porzenheim, Laurens. Comparison of Different Definitions of Chosen-Ciphertext
Security in Encryption Schemes. Universität Paderborn, 2016.
ieee: L. Porzenheim, Comparison of different Definitions of Chosen-Ciphertext
Security in Encryption schemes. Universität Paderborn, 2016.
mla: Porzenheim, Laurens. Comparison of Different Definitions of Chosen-Ciphertext
Security in Encryption Schemes. Universität Paderborn, 2016.
short: L. Porzenheim, Comparison of Different Definitions of Chosen-Ciphertext Security
in Encryption Schemes, Universität Paderborn, 2016.
date_created: 2017-10-17T12:41:33Z
date_updated: 2022-01-06T06:54:53Z
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: Comparison of different Definitions of Chosen-Ciphertext Security in Encryption
schemes
type: bachelorsthesis
user_id: '477'
year: '2016'
...
---
_id: '214'
author:
- first_name: Kai Sören
full_name: Bemmann, Kai Sören
last_name: Bemmann
citation:
ama: Bemmann KS. Commitment Schemes - Definitions, Variants, and Security.
Universität Paderborn; 2016.
apa: Bemmann, K. S. (2016). Commitment Schemes - Definitions, Variants, and Security.
Universität Paderborn.
bibtex: '@book{Bemmann_2016, title={Commitment Schemes - Definitions, Variants,
and Security}, publisher={Universität Paderborn}, author={Bemmann, Kai Sören},
year={2016} }'
chicago: Bemmann, Kai Sören. Commitment Schemes - Definitions, Variants, and
Security. Universität Paderborn, 2016.
ieee: K. S. Bemmann, Commitment Schemes - Definitions, Variants, and Security.
Universität Paderborn, 2016.
mla: Bemmann, Kai Sören. Commitment Schemes - Definitions, Variants, and Security.
Universität Paderborn, 2016.
short: K.S. Bemmann, Commitment Schemes - Definitions, Variants, and Security, Universität
Paderborn, 2016.
date_created: 2017-10-17T12:41:33Z
date_updated: 2022-01-06T06:54:58Z
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: Commitment Schemes - Definitions, Variants, and Security
type: bachelorsthesis
user_id: '477'
year: '2016'
...
---
_id: '215'
abstract:
- lang: eng
text: 'We present three robust overlay networks: First, we present a network that
organizes the nodes into an expander and is resistant to even massive adversarial
churn. Second, we develop a network based on the hypercube that maintains connectivity
under adversarial DoS-attacks. For the DoS-attacks we use the notion of a Omega(log
log n)-late adversary which only has access to topological information that is
at least Omega(log log n) rounds old. Finally, we develop a network that combines
both churn- and DoS-resistance. The networks gain their robustness through constant
network reconfiguration, i.e., the topology of the networks changes constantly.
Our reconguration algorithms are based on node sampling primitives for expanders
and hypercubes that allow each node to sample a logarithmic number of nodes uniformly
at random in O(log log n) communication rounds. These primitives are specific
to overlay networks and their optimal runtime represents an exponential improvement
over known techniques. Our results have a wide range of applications, for example
in the area of scalable and robust peer-to-peer systems.'
author:
- first_name: Maximilian
full_name: Drees, Maximilian
last_name: Drees
- first_name: Robert
full_name: Gmyr, Robert
last_name: Gmyr
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Drees M, Gmyr R, Scheideler C. Churn- and DoS-resistant Overlay Networks Based
on Network Reconfiguration. In: Proceedings of the 28th ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA). ; 2016:417--427. doi:10.1145/2935764.2935783'
apa: Drees, M., Gmyr, R., & Scheideler, C. (2016). Churn- and DoS-resistant
Overlay Networks Based on Network Reconfiguration. In Proceedings of the 28th
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 417--427).
https://doi.org/10.1145/2935764.2935783
bibtex: '@inproceedings{Drees_Gmyr_Scheideler_2016, title={Churn- and DoS-resistant
Overlay Networks Based on Network Reconfiguration}, DOI={10.1145/2935764.2935783},
booktitle={Proceedings of the 28th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA)}, author={Drees, Maximilian and Gmyr, Robert and Scheideler,
Christian}, year={2016}, pages={417--427} }'
chicago: Drees, Maximilian, Robert Gmyr, and Christian Scheideler. “Churn- and DoS-Resistant
Overlay Networks Based on Network Reconfiguration.” In Proceedings of the 28th
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 417--427,
2016. https://doi.org/10.1145/2935764.2935783.
ieee: M. Drees, R. Gmyr, and C. Scheideler, “Churn- and DoS-resistant Overlay Networks
Based on Network Reconfiguration,” in Proceedings of the 28th ACM Symposium
on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 417--427.
mla: Drees, Maximilian, et al. “Churn- and DoS-Resistant Overlay Networks Based
on Network Reconfiguration.” Proceedings of the 28th ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA), 2016, pp. 417--427, doi:10.1145/2935764.2935783.
short: 'M. Drees, R. Gmyr, C. Scheideler, in: Proceedings of the 28th ACM Symposium
on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 417--427.'
date_created: 2017-10-17T12:41:33Z
date_updated: 2022-01-06T06:55:02Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
doi: 10.1145/2935764.2935783
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T10:41:40Z
date_updated: 2018-03-21T10:41:40Z
file_id: '1518'
file_name: 215-SPAA16-Drees_Gmyr_Scheideler.pdf
file_size: 352996
relation: main_file
success: 1
file_date_updated: 2018-03-21T10:41:40Z
has_accepted_license: '1'
language:
- iso: eng
page: 417--427
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA)
status: public
title: Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration
type: conference
user_id: '14955'
year: '2016'
...
---
_id: '175'
abstract:
- lang: eng
text: Today, service compositions often need to be assembled or changed on-the-fly,
which leaves only little time for quality assurance. Moreover, quality assurance
is complicated by service providers only giving information on their services
in terms of domain specific concepts with only limited semantic meaning.In this
paper, we propose a method for constructing service compositions based on pre-verified
templates. Templates, given as workflow descriptions, are typed over a (domain-independent)
template ontology defining concepts and predicates. Their meaning is defined by
an abstract semantics, leaving the specific meaning of ontology concepts open,
however, only up to given ontology rules. Templates are proven correct using a
Hoare-style proof calculus, extended by a specific rule for service calls. Construction
of service compositions amounts to instantiation of templates with domain-specific
services. Correctness of an instantiation can then simply be checked by verifying
that the domain ontology (a) adheres to the rules of the template ontology, and
(b) fulfills the constraints of the employed template.
author:
- first_name: Sven
full_name: Walther, Sven
last_name: Walther
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: Walther S, Wehrheim H. On-The-Fly Construction of Provably Correct Service
Compositions - Templates and Proofs. Science of Computer Programming. 2016:2--23.
doi:10.1016/j.scico.2016.04.002
apa: Walther, S., & Wehrheim, H. (2016). On-The-Fly Construction of Provably
Correct Service Compositions - Templates and Proofs. Science of Computer Programming,
2--23. https://doi.org/10.1016/j.scico.2016.04.002
bibtex: '@article{Walther_Wehrheim_2016, title={On-The-Fly Construction of Provably
Correct Service Compositions - Templates and Proofs}, DOI={10.1016/j.scico.2016.04.002},
journal={Science of Computer Programming}, publisher={Elsevier}, author={Walther,
Sven and Wehrheim, Heike}, year={2016}, pages={2--23} }'
chicago: Walther, Sven, and Heike Wehrheim. “On-The-Fly Construction of Provably
Correct Service Compositions - Templates and Proofs.” Science of Computer Programming,
2016, 2--23. https://doi.org/10.1016/j.scico.2016.04.002.
ieee: S. Walther and H. Wehrheim, “On-The-Fly Construction of Provably Correct Service
Compositions - Templates and Proofs,” Science of Computer Programming,
pp. 2--23, 2016.
mla: Walther, Sven, and Heike Wehrheim. “On-The-Fly Construction of Provably Correct
Service Compositions - Templates and Proofs.” Science of Computer Programming,
Elsevier, 2016, pp. 2--23, doi:10.1016/j.scico.2016.04.002.
short: S. Walther, H. Wehrheim, Science of Computer Programming (2016) 2--23.
date_created: 2017-10-17T12:41:26Z
date_updated: 2022-01-06T06:53:13Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1016/j.scico.2016.04.002
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:38:40Z
date_updated: 2018-03-21T12:38:40Z
file_id: '1536'
file_name: 175-1-s2.0-S0167642316300028-main.pdf
file_size: 630739
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:38:40Z
has_accepted_license: '1'
language:
- iso: eng
page: 2--23
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publication: Science of Computer Programming
publisher: Elsevier
status: public
title: On-The-Fly Construction of Provably Correct Service Compositions - Templates
and Proofs
type: journal_article
user_id: '477'
year: '2016'
...
---
_id: '17655'
author:
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
- first_name: M.M.
full_name: de Weerdt, M.M.
last_name: de Weerdt
- first_name: C.M.
full_name: Jonker, C.M.
last_name: Jonker
citation:
ama: 'Polevoy G, de Weerdt MM, Jonker CM. The Game of Reciprocation Habits. In:
Proceedings of the 2016 European Conference on Artificial Intelligence.
Vol Volume 285: ECAI 2016. Frontiers in Artificial Intelligence and Applications.
; 2016:417-425. doi:10.3233/978-1-61499-672-9-417'
apa: 'Polevoy, G., de Weerdt, M. M., & Jonker, C. M. (2016). The Game of Reciprocation
Habits. In Proceedings of the 2016 European Conference on Artificial Intelligence
(Vol. Volume 285: ECAI 2016, pp. 417–425). https://doi.org/10.3233/978-1-61499-672-9-417'
bibtex: '@inproceedings{Polevoy_de Weerdt_Jonker_2016, series={Frontiers in Artificial
Intelligence and Applications}, title={The Game of Reciprocation Habits}, volume={Volume
285: ECAI 2016}, DOI={10.3233/978-1-61499-672-9-417},
booktitle={Proceedings of the 2016 European Conference on Artificial Intelligence},
author={Polevoy, Gleb and de Weerdt, M.M. and Jonker, C.M.}, year={2016}, pages={417–425},
collection={Frontiers in Artificial Intelligence and Applications} }'
chicago: 'Polevoy, Gleb, M.M. de Weerdt, and C.M. Jonker. “The Game of Reciprocation
Habits.” In Proceedings of the 2016 European Conference on Artificial Intelligence,
Volume 285: ECAI 2016:417–25. Frontiers in Artificial Intelligence and Applications,
2016. https://doi.org/10.3233/978-1-61499-672-9-417.'
ieee: 'G. Polevoy, M. M. de Weerdt, and C. M. Jonker, “The Game of Reciprocation
Habits,” in Proceedings of the 2016 European Conference on Artificial Intelligence,
2016, vol. Volume 285: ECAI 2016, pp. 417–425.'
mla: 'Polevoy, Gleb, et al. “The Game of Reciprocation Habits.” Proceedings of
the 2016 European Conference on Artificial Intelligence, vol. Volume 285:
ECAI 2016, 2016, pp. 417–25, doi:10.3233/978-1-61499-672-9-417.'
short: 'G. Polevoy, M.M. de Weerdt, C.M. Jonker, in: Proceedings of the 2016 European
Conference on Artificial Intelligence, 2016, pp. 417–425.'
date_created: 2020-08-06T15:20:30Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '541'
doi: 10.3233/978-1-61499-672-9-417
extern: '1'
keyword:
- agents
- action
- repeated reciprocation
- fixed
- floating
- network
- Nash equilibrium
- social welfare
- price of anarchy
- price of stability
- convex combination
language:
- iso: eng
page: 417-425
publication: Proceedings of the 2016 European Conference on Artificial Intelligence
series_title: Frontiers in Artificial Intelligence and Applications
status: public
title: The Game of Reciprocation Habits
type: conference
user_id: '83983'
volume: 'Volume 285: ECAI 2016'
year: '2016'
...
---
_id: '17656'
author:
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
- first_name: Mathijs
full_name: de Weerdt, Mathijs
last_name: de Weerdt
- first_name: Catholijn
full_name: Jonker, Catholijn
last_name: Jonker
citation:
ama: 'Polevoy G, de Weerdt M, Jonker C. The Convergence of Reciprocation. In: Proceedings
of the 2016 International Conference on Autonomous Agents and Multiagent Systems.
AAMAS ’16. Richland, SC: International Foundation for Autonomous Agents and Multiagent
Systems; 2016:1431-1432.'
apa: 'Polevoy, G., de Weerdt, M., & Jonker, C. (2016). The Convergence of Reciprocation.
In Proceedings of the 2016 International Conference on Autonomous Agents and
Multiagent Systems (pp. 1431–1432). Richland, SC: International Foundation
for Autonomous Agents and Multiagent Systems.'
bibtex: '@inproceedings{Polevoy_de Weerdt_Jonker_2016, place={Richland, SC}, series={AAMAS
’16}, title={The Convergence of Reciprocation}, booktitle={Proceedings of the
2016 International Conference on Autonomous Agents and Multiagent Systems}, publisher={International
Foundation for Autonomous Agents and Multiagent Systems}, author={Polevoy, Gleb
and de Weerdt, Mathijs and Jonker, Catholijn}, year={2016}, pages={1431–1432},
collection={AAMAS ’16} }'
chicago: 'Polevoy, Gleb, Mathijs de Weerdt, and Catholijn Jonker. “The Convergence
of Reciprocation.” In Proceedings of the 2016 International Conference on Autonomous
Agents and Multiagent Systems, 1431–32. AAMAS ’16. Richland, SC: International
Foundation for Autonomous Agents and Multiagent Systems, 2016.'
ieee: G. Polevoy, M. de Weerdt, and C. Jonker, “The Convergence of Reciprocation,”
in Proceedings of the 2016 International Conference on Autonomous Agents and
Multiagent Systems, 2016, pp. 1431–1432.
mla: Polevoy, Gleb, et al. “The Convergence of Reciprocation.” Proceedings of
the 2016 International Conference on Autonomous Agents and Multiagent Systems,
International Foundation for Autonomous Agents and Multiagent Systems, 2016, pp.
1431–32.
short: 'G. Polevoy, M. de Weerdt, C. Jonker, in: Proceedings of the 2016 International
Conference on Autonomous Agents and Multiagent Systems, International Foundation
for Autonomous Agents and Multiagent Systems, Richland, SC, 2016, pp. 1431–1432.'
date_created: 2020-08-06T15:20:45Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '541'
extern: '1'
keyword:
- agent's influence
- behavior
- convergence
- perron-frobenius
- reciprocal interaction
- repeated reciprocation
language:
- iso: eng
page: 1431-1432
place: Richland, SC
publication: Proceedings of the 2016 International Conference on Autonomous Agents
and Multiagent Systems
publication_identifier:
isbn:
- 978-1-4503-4239-1
publisher: International Foundation for Autonomous Agents and Multiagent Systems
series_title: AAMAS '16
status: public
title: The Convergence of Reciprocation
type: conference
user_id: '83983'
year: '2016'
...
---
_id: '177'
abstract:
- lang: eng
text: 'Efficiently parallelizable parameterized problems have been classified as
being either in the class FPP (fixed-parameter parallelizable) or the class PNC
(parameterized analog of NC), which contains FPP as a subclass. In this paper,
we propose a more restrictive class of parallelizable parameterized problems called
fixed-parameter parallel-tractable (FPPT). For a problem to be in FPPT, it should
possess an efficient parallel algorithm not only from a theoretical standpoint
but in practice as well. The primary distinction between FPPT and FPP is the parallel
processor utilization, which is bounded by a polynomial function in the case of
FPPT. We initiate the study of FPPT with the well-known k-vertex cover problem.
In particular, we present a parallel algorithm that outperforms the best known
parallel algorithm for this problem: using O(m) instead of O(n2) parallel processors,
the running time improves from 4logn+O(kk) to O(k⋅log3n), where m is the number
of edges, n is the number of vertices of the input graph, and k is an upper bound
of the size of the sought vertex cover. We also note that a few P-complete problems
fall into FPPT including the monotone circuit value problem (MCV) when the underlying
graphs are bounded by a constant Euler genus.'
author:
- first_name: Faisal N.
full_name: Abu-Khzam, Faisal N.
last_name: Abu-Khzam
- 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
- first_name: Pavel
full_name: Podlipyan, Pavel
last_name: Podlipyan
citation:
ama: 'Abu-Khzam FN, Li S, Markarian C, Meyer auf der Heide F, Podlipyan P. On the
Parameterized Parallel Complexity and the Vertex Cover Problem. In: Proceedings
of the 10th International Conference on Combinatorial Optimization and Applications
(COCOA). LNCS. ; 2016:477-488. doi:10.1007/978-3-319-48749-6_35'
apa: Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., & Podlipyan,
P. (2016). On the Parameterized Parallel Complexity and the Vertex Cover Problem.
In Proceedings of the 10th International Conference on Combinatorial Optimization
and Applications (COCOA) (pp. 477–488). https://doi.org/10.1007/978-3-319-48749-6_35
bibtex: '@inproceedings{Abu-Khzam_Li_Markarian_Meyer auf der Heide_Podlipyan_2016,
series={LNCS}, title={On the Parameterized Parallel Complexity and the Vertex
Cover Problem}, DOI={10.1007/978-3-319-48749-6_35},
booktitle={Proceedings of the 10th International Conference on Combinatorial Optimization
and Applications (COCOA)}, author={Abu-Khzam, Faisal N. and Li, Shouwei and Markarian,
Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2016},
pages={477–488}, collection={LNCS} }'
chicago: Abu-Khzam, Faisal N., Shouwei Li, Christine Markarian, Friedhelm Meyer
auf der Heide, and Pavel Podlipyan. “On the Parameterized Parallel Complexity
and the Vertex Cover Problem.” In Proceedings of the 10th International Conference
on Combinatorial Optimization and Applications (COCOA), 477–88. LNCS, 2016.
https://doi.org/10.1007/978-3-319-48749-6_35.
ieee: F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan,
“On the Parameterized Parallel Complexity and the Vertex Cover Problem,” in Proceedings
of the 10th International Conference on Combinatorial Optimization and Applications
(COCOA), 2016, pp. 477–488.
mla: Abu-Khzam, Faisal N., et al. “On the Parameterized Parallel Complexity and
the Vertex Cover Problem.” Proceedings of the 10th International Conference
on Combinatorial Optimization and Applications (COCOA), 2016, pp. 477–88,
doi:10.1007/978-3-319-48749-6_35.
short: 'F.N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan,
in: Proceedings of the 10th International Conference on Combinatorial Optimization
and Applications (COCOA), 2016, pp. 477–488.'
date_created: 2017-10-17T12:41:26Z
date_updated: 2022-01-06T06:53:17Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/978-3-319-48749-6_35
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:15:18Z
date_updated: 2018-11-02T14:15:18Z
file_id: '5266'
file_name: OnTheParameterizedParallelComp.pdf
file_size: 293345
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:15:18Z
has_accepted_license: '1'
language:
- iso: eng
page: 477-488
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 10th International Conference on Combinatorial Optimization
and Applications (COCOA)
series_title: LNCS
status: public
title: On the Parameterized Parallel Complexity and the Vertex Cover Problem
type: conference
user_id: '477'
year: '2016'
...
---
_id: '187'
citation:
ama: Meyer auf der Heide F, ed. Introduction to the Special Issue on SPAA 2014.;
2016. doi:10.1145/2936716
apa: Meyer auf der Heide, F. (Ed.). (2016). Introduction to the Special Issue
on SPAA 2014. Transactions on Parallel Computing (TOPC). https://doi.org/10.1145/2936716
bibtex: '@book{Meyer auf der Heide_2016, title={Introduction to the Special Issue
on SPAA 2014}, DOI={10.1145/2936716},
number={1}, journal={Transactions on Parallel Computing (TOPC)}, year={2016} }'
chicago: Meyer auf der Heide, Friedhelm, ed. Introduction to the Special Issue
on SPAA 2014. Transactions on Parallel Computing (TOPC), 2016. https://doi.org/10.1145/2936716.
ieee: F. Meyer auf der Heide, Ed., Introduction to the Special Issue on SPAA
2014, no. 1. 2016.
mla: Meyer auf der Heide, Friedhelm, editor. “Introduction to the Special Issue
on SPAA 2014.” Transactions on Parallel Computing (TOPC), no. 1, 2016,
doi:10.1145/2936716.
short: F. Meyer auf der Heide, ed., Introduction to the Special Issue on SPAA 2014,
2016.
date_created: 2017-10-17T12:41:28Z
date_updated: 2022-01-06T06:53:51Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1145/2936716
editor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:31:42Z
date_updated: 2018-03-21T12:31:42Z
file_id: '1531'
file_name: 187-a1-heide.pdf
file_size: 34053
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:31:42Z
has_accepted_license: '1'
issue: '1'
page: '1'
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Transactions on Parallel Computing (TOPC)
status: public
title: Introduction to the Special Issue on SPAA 2014
type: journal_editor
user_id: '15504'
year: '2016'
...
---
_id: '19'
abstract:
- lang: eng
text: "Version Control Systems (VCS) are a valuable tool for software development\r\nand
document management. Both client/server and distributed (Peer-to-Peer)\r\nmodels
exist, with the latter (e.g., Git and Mercurial) becoming\r\nincreasingly popular.
Their distributed nature introduces complications,\r\nespecially concerning security:
it is hard to control the dissemination of\r\ncontents stored in distributed VCS
as they rely on replication of complete\r\nrepositories to any involved user.\r\n\r\nWe
overcome this issue by designing and implementing a concept for\r\ncryptography-enforced
access control which is transparent to the user. Use\r\nof field-tested schemes
(end-to-end encryption, digital signatures) allows\r\nfor strong security, while
adoption of convergent encryption and\r\ncontent-defined chunking retains storage
efficiency. The concept is\r\nseamlessly integrated into Mercurial---respecting
its distributed storage\r\nconcept---to ensure practical usability and compatibility
to existing\r\ndeployments."
author:
- first_name: Michael
full_name: Lass, Michael
id: '24135'
last_name: Lass
orcid: 0000-0002-5708-7632
- first_name: Dominik
full_name: Leibenger, Dominik
last_name: Leibenger
- first_name: Christoph
full_name: Sorge, Christoph
last_name: Sorge
citation:
ama: 'Lass M, Leibenger D, Sorge C. Confidentiality and Authenticity for Distributed
Version Control Systems - A Mercurial Extension. In: Proc. 41st Conference
on Local Computer Networks (LCN). IEEE; 2016. doi:10.1109/lcn.2016.11'
apa: Lass, M., Leibenger, D., & Sorge, C. (2016). Confidentiality and Authenticity
for Distributed Version Control Systems - A Mercurial Extension. In Proc. 41st
Conference on Local Computer Networks (LCN). IEEE. https://doi.org/10.1109/lcn.2016.11
bibtex: '@inproceedings{Lass_Leibenger_Sorge_2016, title={Confidentiality and Authenticity
for Distributed Version Control Systems - A Mercurial Extension}, DOI={10.1109/lcn.2016.11},
booktitle={Proc. 41st Conference on Local Computer Networks (LCN)}, publisher={IEEE},
author={Lass, Michael and Leibenger, Dominik and Sorge, Christoph}, year={2016}
}'
chicago: Lass, Michael, Dominik Leibenger, and Christoph Sorge. “Confidentiality
and Authenticity for Distributed Version Control Systems - A Mercurial Extension.”
In Proc. 41st Conference on Local Computer Networks (LCN). IEEE, 2016.
https://doi.org/10.1109/lcn.2016.11.
ieee: M. Lass, D. Leibenger, and C. Sorge, “Confidentiality and Authenticity for
Distributed Version Control Systems - A Mercurial Extension,” in Proc. 41st
Conference on Local Computer Networks (LCN), 2016.
mla: Lass, Michael, et al. “Confidentiality and Authenticity for Distributed Version
Control Systems - A Mercurial Extension.” Proc. 41st Conference on Local Computer
Networks (LCN), IEEE, 2016, doi:10.1109/lcn.2016.11.
short: 'M. Lass, D. Leibenger, C. Sorge, in: Proc. 41st Conference on Local Computer
Networks (LCN), IEEE, 2016.'
date_created: 2017-07-25T14:36:16Z
date_updated: 2022-01-06T06:53:56Z
department:
- _id: '27'
- _id: '518'
doi: 10.1109/lcn.2016.11
keyword:
- access control
- distributed version control systems
- mercurial
- peer-to-peer
- convergent encryption
- confidentiality
- authenticity
language:
- iso: eng
publication: Proc. 41st Conference on Local Computer Networks (LCN)
publication_identifier:
isbn:
- 978-1-5090-2054-6
publication_status: published
publisher: IEEE
status: public
title: Confidentiality and Authenticity for Distributed Version Control Systems -
A Mercurial Extension
type: conference
user_id: '24135'
year: '2016'
...
---
_id: '190'
abstract:
- lang: eng
text: Today, software components are provided by global markets in the form of services.
In order to optimally satisfy service requesters and service providers, adequate
techniques for automatic service matching are needed. However, a requester’s requirements
may be vague and the information available about a provided service may be incomplete.
As a consequence, fuzziness is induced into the matching procedure. The contribution
of this paper is the development of a systematic matching procedure that leverages
concepts and techniques from fuzzy logic and possibility theory based on our formal
distinction between different sources and types of fuzziness in the context of
service matching. In contrast to existing methods, our approach is able to deal
with imprecision and incompleteness in service specifications and to inform users
about the extent of induced fuzziness in order to improve the user’s decision-making.
We demonstrate our approach on the example of specifications for service reputation
based on ratings given by previous users. Our evaluation based on real service
ratings shows the utility and applicability of our approach.
author:
- first_name: Marie Christin
full_name: Platenius, Marie Christin
last_name: Platenius
- first_name: Ammar
full_name: Shaker, Ammar
last_name: Shaker
- first_name: Matthias
full_name: Becker, Matthias
last_name: Becker
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
- first_name: Wilhelm
full_name: Schäfer, Wilhelm
last_name: Schäfer
citation:
ama: Platenius MC, Shaker A, Becker M, Hüllermeier E, Schäfer W. Imprecise Matching
of Requirements Specifications for Software Services using Fuzzy Logic. IEEE
Transactions on Software Engineering (TSE), presented at ICSE 2017. 2016;(8):739-759.
doi:10.1109/TSE.2016.2632115
apa: Platenius, M. C., Shaker, A., Becker, M., Hüllermeier, E., & Schäfer, W.
(2016). Imprecise Matching of Requirements Specifications for Software Services
using Fuzzy Logic. IEEE Transactions on Software Engineering (TSE), Presented
at ICSE 2017, (8), 739–759. https://doi.org/10.1109/TSE.2016.2632115
bibtex: '@article{Platenius_Shaker_Becker_Hüllermeier_Schäfer_2016, title={Imprecise
Matching of Requirements Specifications for Software Services using Fuzzy Logic},
DOI={10.1109/TSE.2016.2632115},
number={8}, journal={IEEE Transactions on Software Engineering (TSE), presented
at ICSE 2017}, publisher={IEEE}, author={Platenius, Marie Christin and Shaker,
Ammar and Becker, Matthias and Hüllermeier, Eyke and Schäfer, Wilhelm}, year={2016},
pages={739–759} }'
chicago: 'Platenius, Marie Christin, Ammar Shaker, Matthias Becker, Eyke Hüllermeier,
and Wilhelm Schäfer. “Imprecise Matching of Requirements Specifications for Software
Services Using Fuzzy Logic.” IEEE Transactions on Software Engineering (TSE),
Presented at ICSE 2017, no. 8 (2016): 739–59. https://doi.org/10.1109/TSE.2016.2632115.'
ieee: M. C. Platenius, A. Shaker, M. Becker, E. Hüllermeier, and W. Schäfer, “Imprecise
Matching of Requirements Specifications for Software Services using Fuzzy Logic,”
IEEE Transactions on Software Engineering (TSE), presented at ICSE 2017,
no. 8, pp. 739–759, 2016.
mla: Platenius, Marie Christin, et al. “Imprecise Matching of Requirements Specifications
for Software Services Using Fuzzy Logic.” IEEE Transactions on Software Engineering
(TSE), Presented at ICSE 2017, no. 8, IEEE, 2016, pp. 739–59, doi:10.1109/TSE.2016.2632115.
short: M.C. Platenius, A. Shaker, M. Becker, E. Hüllermeier, W. Schäfer, IEEE Transactions
on Software Engineering (TSE), Presented at ICSE 2017 (2016) 739–759.
date_created: 2017-10-17T12:41:29Z
date_updated: 2022-01-06T06:53:57Z
ddc:
- '040'
department:
- _id: '355'
doi: 10.1109/TSE.2016.2632115
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:30:31Z
date_updated: 2018-03-21T12:30:31Z
file_id: '1529'
file_name: 190-07755807.pdf
file_size: 5225413
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:30:31Z
has_accepted_license: '1'
issue: '8'
language:
- iso: eng
page: 739-759
project:
- _id: '1'
name: SFB 901
- _id: '9'
name: SFB 901 - Subprojekt B1
- _id: '10'
name: SFB 901 - Subprojekt B2
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publication: IEEE Transactions on Software Engineering (TSE), presented at ICSE 2017
publisher: IEEE
status: public
title: Imprecise Matching of Requirements Specifications for Software Services using
Fuzzy Logic
type: journal_article
user_id: '15504'
year: '2016'
...
---
_id: '2367'
abstract:
- lang: eng
text: One of the most popular fuzzy clustering techniques is the fuzzy K-means algorithm
(also known as fuzzy-c-means or FCM algorithm). In contrast to the K-means and
K-median problem, the underlying fuzzy K-means problem has not been studied from
a theoretical point of view. In particular, there are no algorithms with approximation
guarantees similar to the famous K-means++ algorithm known for the fuzzy K-means
problem. This work initiates the study of the fuzzy K-means problem from an algorithmic
and complexity theoretic perspective. We show that optimal solutions for the fuzzy
K-means problem cannot, in general, be expressed by radicals over the input points.
Surprisingly, this already holds for simple inputs in one-dimensional space. Hence,
one cannot expect to compute optimal solutions exactly. We give the first (1+eps)-approximation
algorithms for the fuzzy K-means problem. First, we present a deterministic approximation
algorithm whose runtime is polynomial in N and linear in the dimension D of the
input set, given that K is constant, i.e. a polynomial time approximation scheme
(PTAS) for fixed K. We achieve this result by showing that for each soft clustering
there exists a hard clustering with similar properties. Second, by using techniques
known from coreset constructions for the K-means problem, we develop a deterministic
approximation algorithm that runs in time almost linear in N but exponential in
the dimension D. We complement these results with a randomized algorithm which
imposes some natural restrictions on the sought solution and whose runtime is
comparable to some of the most efficient approximation algorithms for K-means,
i.e. linear in the number of points and the dimension, but exponential in the
number of clusters.
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Sascha
full_name: Brauer, Sascha
id: '13291'
last_name: Brauer
- first_name: Kathrin
full_name: Bujna, Kathrin
last_name: Bujna
citation:
ama: 'Blömer J, Brauer S, Bujna K. A Theoretical Analysis of the Fuzzy K-Means Problem.
In: 2016 IEEE 16th International Conference on Data Mining (ICDM). IEEE;
2016:805-810. doi:10.1109/icdm.2016.0094'
apa: 'Blömer, J., Brauer, S., & Bujna, K. (2016). A Theoretical Analysis of
the Fuzzy K-Means Problem. In 2016 IEEE 16th International Conference on Data
Mining (ICDM) (pp. 805–810). Barcelona, Spain: IEEE. https://doi.org/10.1109/icdm.2016.0094'
bibtex: '@inproceedings{Blömer_Brauer_Bujna_2016, title={A Theoretical Analysis
of the Fuzzy K-Means Problem}, DOI={10.1109/icdm.2016.0094},
booktitle={2016 IEEE 16th International Conference on Data Mining (ICDM)}, publisher={IEEE},
author={Blömer, Johannes and Brauer, Sascha and Bujna, Kathrin}, year={2016},
pages={805–810} }'
chicago: Blömer, Johannes, Sascha Brauer, and Kathrin Bujna. “A Theoretical Analysis
of the Fuzzy K-Means Problem.” In 2016 IEEE 16th International Conference on
Data Mining (ICDM), 805–10. IEEE, 2016. https://doi.org/10.1109/icdm.2016.0094.
ieee: J. Blömer, S. Brauer, and K. Bujna, “A Theoretical Analysis of the Fuzzy K-Means
Problem,” in 2016 IEEE 16th International Conference on Data Mining (ICDM),
Barcelona, Spain, 2016, pp. 805–810.
mla: Blömer, Johannes, et al. “A Theoretical Analysis of the Fuzzy K-Means Problem.”
2016 IEEE 16th International Conference on Data Mining (ICDM), IEEE, 2016,
pp. 805–10, doi:10.1109/icdm.2016.0094.
short: 'J. Blömer, S. Brauer, K. Bujna, in: 2016 IEEE 16th International Conference
on Data Mining (ICDM), IEEE, 2016, pp. 805–810.'
conference:
end_date: 2016-12-15
location: Barcelona, Spain
name: IEEE 16th International Conference on Data Mining (ICDM)
start_date: 2016-12-12
date_created: 2018-04-17T11:46:07Z
date_updated: 2022-01-06T06:55:58Z
department:
- _id: '64'
doi: 10.1109/icdm.2016.0094
keyword:
- unsolvability by radicals
- clustering
- fuzzy k-means
- probabilistic method
- approximation algorithms
- randomized algorithms
language:
- iso: eng
page: 805-810
publication: 2016 IEEE 16th International Conference on Data Mining (ICDM)
publication_identifier:
isbn:
- '9781509054732'
publication_status: published
publisher: IEEE
status: public
title: A Theoretical Analysis of the Fuzzy K-Means Problem
type: conference
user_id: '25078'
year: '2016'
...
---
_id: '20556'
author:
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
- first_name: Ka
full_name: I Pun, Ka
last_name: I Pun
- first_name: Martin
full_name: Steffen, Martin
last_name: Steffen
- first_name: Volker
full_name: Stolz, Volker
last_name: Stolz
- first_name: Anna-Katharina
full_name: Wickert, Anna-Katharina
last_name: Wickert
citation:
ama: 'Bodden E, I Pun K, Steffen M, Stolz V, Wickert A-K. Information Flow Analysis
for Go. In: Leveraging Applications of Formal Methods, Verification and Validation:
Foundational Techniques - 7th International Symposium, ISoLA 2016, Imperial, Corfu,
Greece, October 10-14, 2016, Proceedings, Part {I}. ; 2016:431-445. doi:10.1007/978-3-319-47166-2_30'
apa: 'Bodden, E., I Pun, K., Steffen, M., Stolz, V., & Wickert, A.-K. (2016).
Information Flow Analysis for Go. Leveraging Applications of Formal Methods,
Verification and Validation: Foundational Techniques - 7th International Symposium,
ISoLA 2016, Imperial, Corfu, Greece, October 10-14, 2016, Proceedings, Part {I},
431–445. https://doi.org/10.1007/978-3-319-47166-2_30'
bibtex: '@inproceedings{Bodden_I Pun_Steffen_Stolz_Wickert_2016, title={Information
Flow Analysis for Go}, DOI={10.1007/978-3-319-47166-2_30},
booktitle={Leveraging Applications of Formal Methods, Verification and Validation:
Foundational Techniques - 7th International Symposium, ISoLA 2016, Imperial, Corfu,
Greece, October 10-14, 2016, Proceedings, Part {I}}, author={Bodden, Eric and
I Pun, Ka and Steffen, Martin and Stolz, Volker and Wickert, Anna-Katharina},
year={2016}, pages={431–445} }'
chicago: 'Bodden, Eric, Ka I Pun, Martin Steffen, Volker Stolz, and Anna-Katharina
Wickert. “Information Flow Analysis for Go.” In Leveraging Applications of
Formal Methods, Verification and Validation: Foundational Techniques - 7th International
Symposium, ISoLA 2016, Imperial, Corfu, Greece, October 10-14, 2016, Proceedings,
Part {I}, 431–45, 2016. https://doi.org/10.1007/978-3-319-47166-2_30.'
ieee: 'E. Bodden, K. I Pun, M. Steffen, V. Stolz, and A.-K. Wickert, “Information
Flow Analysis for Go,” in Leveraging Applications of Formal Methods, Verification
and Validation: Foundational Techniques - 7th International Symposium, ISoLA 2016,
Imperial, Corfu, Greece, October 10-14, 2016, Proceedings, Part {I}, 2016,
pp. 431–445, doi: 10.1007/978-3-319-47166-2_30.'
mla: 'Bodden, Eric, et al. “Information Flow Analysis for Go.” Leveraging Applications
of Formal Methods, Verification and Validation: Foundational Techniques - 7th
International Symposium, ISoLA 2016, Imperial, Corfu, Greece, October 10-14, 2016,
Proceedings, Part {I}, 2016, pp. 431–45, doi:10.1007/978-3-319-47166-2_30.'
short: 'E. Bodden, K. I Pun, M. Steffen, V. Stolz, A.-K. Wickert, in: Leveraging
Applications of Formal Methods, Verification and Validation: Foundational Techniques
- 7th International Symposium, ISoLA 2016, Imperial, Corfu, Greece, October 10-14,
2016, Proceedings, Part {I}, 2016, pp. 431–445.'
date_created: 2020-11-30T11:02:52Z
date_updated: 2022-01-06T06:54:30Z
department:
- _id: '76'
doi: 10.1007/978-3-319-47166-2_30
language:
- iso: eng
page: 431-445
publication: 'Leveraging Applications of Formal Methods, Verification and Validation:
Foundational Techniques - 7th International Symposium, ISoLA 2016, Imperial, Corfu,
Greece, October 10-14, 2016, Proceedings, Part {I}'
status: public
title: Information Flow Analysis for Go
type: conference
user_id: '5786'
year: '2016'
...
---
_id: '207'
abstract:
- lang: eng
text: We consider a scheduling problem where machines need to be rented from the
cloud in order to process jobs. There are two types of machines available which
can be rented for machine-type dependent prices and for arbitrary durations. However,
a machine-type dependent setup time is required before a machine is available
for processing. Jobs arrive online over time, have machine-type dependent sizes
and have individual deadlines. The objective is to rent machines and schedule
jobs so as to meet all deadlines while minimizing the rental cost. Since we observe
the slack of jobs to have a fundamental influence on the competitiveness, we study
the model when instances are parameterized by their (minimum) slack. An instance
is called to have a slack of $\beta$ if, for all jobs, the difference between
the job's release time and the latest point in time at which it needs to be started
is at least $\beta$. While for $\beta series = {LNCS}
author:
- first_name: Alexander
full_name: Mäcker, Alexander
id: '13536'
last_name: Mäcker
- first_name: Manuel
full_name: Malatyali, Manuel
last_name: Malatyali
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
citation:
ama: 'Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Cost-efficient Scheduling
on Machines from the Cloud. In: Proceedings of the 10th Annual International
Conference on Combinatorial Optimization and Applications (COCOA). ; 2016:578--592.
doi:10.1007/978-3-319-48749-6_42'
apa: Mäcker, A., Malatyali, M., Meyer auf der Heide, F., & Riechers, S. (2016).
Cost-efficient Scheduling on Machines from the Cloud. In Proceedings of the
10th Annual International Conference on Combinatorial Optimization and Applications
(COCOA) (pp. 578--592). https://doi.org/10.1007/978-3-319-48749-6_42
bibtex: '@inproceedings{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2016, title={Cost-efficient
Scheduling on Machines from the Cloud}, DOI={10.1007/978-3-319-48749-6_42},
booktitle={Proceedings of the 10th Annual International Conference on Combinatorial
Optimization and Applications (COCOA)}, author={Mäcker, Alexander and Malatyali,
Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2016}, pages={578--592}
}'
chicago: Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and
Sören Riechers. “Cost-Efficient Scheduling on Machines from the Cloud.” In Proceedings
of the 10th Annual International Conference on Combinatorial Optimization and
Applications (COCOA), 578--592, 2016. https://doi.org/10.1007/978-3-319-48749-6_42.
ieee: A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Cost-efficient
Scheduling on Machines from the Cloud,” in Proceedings of the 10th Annual International
Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp.
578--592.
mla: Mäcker, Alexander, et al. “Cost-Efficient Scheduling on Machines from the Cloud.”
Proceedings of the 10th Annual International Conference on Combinatorial Optimization
and Applications (COCOA), 2016, pp. 578--592, doi:10.1007/978-3-319-48749-6_42.
short: 'A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, in: Proceedings
of the 10th Annual International Conference on Combinatorial Optimization and
Applications (COCOA), 2016, pp. 578--592.'
date_created: 2017-10-17T12:41:32Z
date_updated: 2022-01-06T06:54:33Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/978-3-319-48749-6_42
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:18:51Z
date_updated: 2018-11-02T14:18:51Z
file_id: '5268'
file_name: Cost-EfficientSchedulingOnMach.pdf
file_size: 608614
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:18:51Z
has_accepted_license: '1'
language:
- iso: eng
page: 578--592
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 10th Annual International Conference on Combinatorial
Optimization and Applications (COCOA)
status: public
title: Cost-efficient Scheduling on Machines from the Cloud
type: conference
user_id: '477'
year: '2016'
...
---
_id: '20716'
author:
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
- first_name: Michael
full_name: Eichberg, Michael
last_name: Eichberg
- first_name: Ka
full_name: I Pun, Ka
last_name: I Pun
- first_name: Martin
full_name: Steffen, Martin
last_name: Steffen
- first_name: Volker
full_name: Stolz, Volker
last_name: Stolz
- first_name: Anna-Katharina
full_name: Wickert, Anna-Katharina
last_name: Wickert
citation:
ama: 'Bodden E, Eichberg M, I Pun K, Steffen M, Stolz V, Wickert A-K. Don’t let
data Go astray---A Context-Sensitive Taint Analysis for Concurrent Programs in
Go. In: Nordic Workshop on Programming Theory (NWPT’16). ; 2016.'
apa: Bodden, E., Eichberg, M., I Pun, K., Steffen, M., Stolz, V., & Wickert,
A.-K. (2016). Don’t let data Go astray---A Context-Sensitive Taint Analysis for
Concurrent Programs in Go. Nordic Workshop on Programming Theory (NWPT’16).
bibtex: '@inproceedings{Bodden_Eichberg_I Pun_Steffen_Stolz_Wickert_2016, title={Don’t
let data Go astray---A Context-Sensitive Taint Analysis for Concurrent Programs
in Go}, booktitle={Nordic Workshop on Programming Theory (NWPT’16)}, author={Bodden,
Eric and Eichberg, Michael and I Pun, Ka and Steffen, Martin and Stolz, Volker
and Wickert, Anna-Katharina}, year={2016} }'
chicago: Bodden, Eric, Michael Eichberg, Ka I Pun, Martin Steffen, Volker Stolz,
and Anna-Katharina Wickert. “Don’t Let Data Go Astray---A Context-Sensitive Taint
Analysis for Concurrent Programs in Go.” In Nordic Workshop on Programming
Theory (NWPT’16), 2016.
ieee: E. Bodden, M. Eichberg, K. I Pun, M. Steffen, V. Stolz, and A.-K. Wickert,
“Don’t let data Go astray---A Context-Sensitive Taint Analysis for Concurrent
Programs in Go,” 2016.
mla: Bodden, Eric, et al. “Don’t Let Data Go Astray---A Context-Sensitive Taint
Analysis for Concurrent Programs in Go.” Nordic Workshop on Programming Theory
(NWPT’16), 2016.
short: 'E. Bodden, M. Eichberg, K. I Pun, M. Steffen, V. Stolz, A.-K. Wickert, in:
Nordic Workshop on Programming Theory (NWPT’16), 2016.'
date_created: 2020-12-14T11:56:15Z
date_updated: 2022-01-06T06:54:34Z
department:
- _id: '76'
language:
- iso: eng
main_file_link:
- url: http://bodden.de/pubs/bep16gotaint.pdf
publication: Nordic Workshop on Programming Theory (NWPT'16)
status: public
title: Don't let data Go astray---A Context-Sensitive Taint Analysis for Concurrent
Programs in Go
type: conference
user_id: '5786'
year: '2016'
...
---
_id: '20717'
author:
- first_name: Lisa
full_name: Nguyen Quang Do, Lisa
last_name: Nguyen Quang Do
- first_name: Karim
full_name: Ali, Karim
last_name: Ali
- first_name: Benjamin
full_name: Livshits, Benjamin
last_name: Livshits
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
- first_name: Justin
full_name: Smith, Justin
last_name: Smith
- first_name: Emerson
full_name: Murphy-Hill, Emerson
last_name: Murphy-Hill
citation:
ama: Nguyen Quang Do L, Ali K, Livshits B, Bodden E, Smith J, Murphy-Hill E. Just-in-Time
Static Analysis.; 2016. doi:http://dx.doi.org/10.7939/DVN/10859
apa: Nguyen Quang Do, L., Ali, K., Livshits, B., Bodden, E., Smith, J., & Murphy-Hill,
E. (2016). Just-in-Time Static Analysis. http://dx.doi.org/10.7939/DVN/10859
bibtex: '@book{Nguyen Quang Do_Ali_Livshits_Bodden_Smith_Murphy-Hill_2016, title={Just-in-Time
Static Analysis}, DOI={http://dx.doi.org/10.7939/DVN/10859},
author={Nguyen Quang Do, Lisa and Ali, Karim and Livshits, Benjamin and Bodden,
Eric and Smith, Justin and Murphy-Hill, Emerson}, year={2016} }'
chicago: Nguyen Quang Do, Lisa, Karim Ali, Benjamin Livshits, Eric Bodden, Justin
Smith, and Emerson Murphy-Hill. Just-in-Time Static Analysis, 2016. http://dx.doi.org/10.7939/DVN/10859.
ieee: L. Nguyen Quang Do, K. Ali, B. Livshits, E. Bodden, J. Smith, and E. Murphy-Hill,
Just-in-Time Static Analysis. 2016.
mla: Nguyen Quang Do, Lisa, et al. Just-in-Time Static Analysis. 2016, doi:http://dx.doi.org/10.7939/DVN/10859.
short: L. Nguyen Quang Do, K. Ali, B. Livshits, E. Bodden, J. Smith, E. Murphy-Hill,
Just-in-Time Static Analysis, 2016.
date_created: 2020-12-14T11:57:09Z
date_updated: 2022-01-06T06:54:34Z
department:
- _id: '76'
doi: http://dx.doi.org/10.7939/DVN/10859
keyword:
- ATTRACT
- ITSECWEBSITE
language:
- iso: eng
main_file_link:
- url: http://bodden.de/pubs/dal16jit-tr.pdf
status: public
title: Just-in-Time Static Analysis
type: report
user_id: '5786'
year: '2016'
...
---
_id: '20718'
author:
- first_name: Siegfried
full_name: Rasthofer, Siegfried
last_name: Rasthofer
- first_name: Steven
full_name: Arzt, Steven
last_name: Arzt
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
- first_name: Marc
full_name: Miltenberger, Marc
last_name: Miltenberger
citation:
ama: Rasthofer S, Arzt S, Bodden E, Miltenberger M. Harvester - Vollautomatische
Extraktion von Laufzeitwerten aus obfuskierten Android-Applikationen. Datenschutz
und Datensicherheit. Published online 2016:718-722. doi:https://www.springerprofessional.de/en/datenschutz-und-datensicherheit-dud-11-2016/10866536
apa: Rasthofer, S., Arzt, S., Bodden, E., & Miltenberger, M. (2016). Harvester
- Vollautomatische Extraktion von Laufzeitwerten aus obfuskierten Android-Applikationen.
Datenschutz Und Datensicherheit, 718–722. https://www.springerprofessional.de/en/datenschutz-und-datensicherheit-dud-11-2016/10866536
bibtex: '@article{Rasthofer_Arzt_Bodden_Miltenberger_2016, title={Harvester - Vollautomatische
Extraktion von Laufzeitwerten aus obfuskierten Android-Applikationen}, DOI={https://www.springerprofessional.de/en/datenschutz-und-datensicherheit-dud-11-2016/10866536},
journal={Datenschutz und Datensicherheit}, author={Rasthofer, Siegfried and Arzt,
Steven and Bodden, Eric and Miltenberger, Marc}, year={2016}, pages={718–722}
}'
chicago: Rasthofer, Siegfried, Steven Arzt, Eric Bodden, and Marc Miltenberger.
“Harvester - Vollautomatische Extraktion von Laufzeitwerten Aus Obfuskierten Android-Applikationen.”
Datenschutz Und Datensicherheit, 2016, 718–22. https://www.springerprofessional.de/en/datenschutz-und-datensicherheit-dud-11-2016/10866536.
ieee: 'S. Rasthofer, S. Arzt, E. Bodden, and M. Miltenberger, “Harvester - Vollautomatische
Extraktion von Laufzeitwerten aus obfuskierten Android-Applikationen,” Datenschutz
und Datensicherheit, pp. 718–722, 2016, doi: https://www.springerprofessional.de/en/datenschutz-und-datensicherheit-dud-11-2016/10866536.'
mla: Rasthofer, Siegfried, et al. “Harvester - Vollautomatische Extraktion von Laufzeitwerten
Aus Obfuskierten Android-Applikationen.” Datenschutz Und Datensicherheit,
2016, pp. 718–22, doi:https://www.springerprofessional.de/en/datenschutz-und-datensicherheit-dud-11-2016/10866536.
short: S. Rasthofer, S. Arzt, E. Bodden, M. Miltenberger, Datenschutz Und Datensicherheit
(2016) 718–722.
date_created: 2020-12-14T11:57:48Z
date_updated: 2022-01-06T06:54:34Z
department:
- _id: '76'
doi: https://www.springerprofessional.de/en/datenschutz-und-datensicherheit-dud-11-2016/10866536
keyword:
- ATTRACT
- ITSECWEBSITE
language:
- iso: eng
main_file_link:
- url: http://bodden.de/pubs/rabm16harvester.pdf
page: 718-722
publication: Datenschutz und Datensicherheit
status: public
title: Harvester - Vollautomatische Extraktion von Laufzeitwerten aus obfuskierten
Android-Applikationen
type: journal_article
user_id: '5786'
year: '2016'
...
---
_id: '20719'
author:
- first_name: Philipp
full_name: Holzinger, Philipp
last_name: Holzinger
- first_name: Stefan
full_name: Triller, Stefan
last_name: Triller
- first_name: Alexandre
full_name: Bartel, Alexandre
last_name: Bartel
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
citation:
ama: 'Holzinger P, Triller S, Bartel A, Bodden E. An In-Depth Study of More Than
Ten Years of Java Exploitation. In: Proceedings of the 2016 ACM SIGSAC Conference
on Computer and Communications Security. CCS ’16. ; 2016:779-790. doi:http://doi.acm.org/10.1145/2976749.2978361'
apa: Holzinger, P., Triller, S., Bartel, A., & Bodden, E. (2016). An In-Depth
Study of More Than Ten Years of Java Exploitation. Proceedings of the 2016
ACM SIGSAC Conference on Computer and Communications Security, 779–790. http://doi.acm.org/10.1145/2976749.2978361
bibtex: '@inproceedings{Holzinger_Triller_Bartel_Bodden_2016, series={CCS ’16},
title={An In-Depth Study of More Than Ten Years of Java Exploitation}, DOI={http://doi.acm.org/10.1145/2976749.2978361},
booktitle={Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications
Security}, author={Holzinger, Philipp and Triller, Stefan and Bartel, Alexandre
and Bodden, Eric}, year={2016}, pages={779–790}, collection={CCS ’16} }'
chicago: Holzinger, Philipp, Stefan Triller, Alexandre Bartel, and Eric Bodden.
“An In-Depth Study of More Than Ten Years of Java Exploitation.” In Proceedings
of the 2016 ACM SIGSAC Conference on Computer and Communications Security,
779–90. CCS ’16, 2016. http://doi.acm.org/10.1145/2976749.2978361.
ieee: 'P. Holzinger, S. Triller, A. Bartel, and E. Bodden, “An In-Depth Study of
More Than Ten Years of Java Exploitation,” in Proceedings of the 2016 ACM SIGSAC
Conference on Computer and Communications Security, 2016, pp. 779–790, doi:
http://doi.acm.org/10.1145/2976749.2978361.'
mla: Holzinger, Philipp, et al. “An In-Depth Study of More Than Ten Years of Java
Exploitation.” Proceedings of the 2016 ACM SIGSAC Conference on Computer and
Communications Security, 2016, pp. 779–90, doi:http://doi.acm.org/10.1145/2976749.2978361.
short: 'P. Holzinger, S. Triller, A. Bartel, E. Bodden, in: Proceedings of the 2016
ACM SIGSAC Conference on Computer and Communications Security, 2016, pp. 779–790.'
date_created: 2020-12-14T11:58:33Z
date_updated: 2022-01-06T06:54:34Z
department:
- _id: '76'
doi: http://doi.acm.org/10.1145/2976749.2978361
keyword:
- ATTRACT
- access control
- exploits
- java security
- security analysis
- ITSECWEBSITE
language:
- iso: eng
page: 779-790
publication: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications
Security
publication_identifier:
isbn:
- 978-1-4503-4139-4
series_title: CCS '16
status: public
title: An In-Depth Study of More Than Ten Years of Java Exploitation
type: conference
user_id: '5786'
year: '2016'
...