---
_id: '29046'
author:
- first_name: Robert
full_name: Feldhans, Robert
last_name: Feldhans
- first_name: Adrian
full_name: Wilke, Adrian
last_name: Wilke
- first_name: Stefan
full_name: Heindorf, Stefan
last_name: Heindorf
- first_name: Mohammad Hossein
full_name: Shaker, Mohammad Hossein
last_name: Shaker
- first_name: Barbara
full_name: Hammer, Barbara
last_name: Hammer
- first_name: Axel-Cyrille
full_name: Ngonga Ngomo, Axel-Cyrille
last_name: Ngonga Ngomo
- first_name: Eyke
full_name: Hüllermeier, Eyke
last_name: Hüllermeier
citation:
ama: 'Feldhans R, Wilke A, Heindorf S, et al. Drift Detection in Text Data with
Document Embeddings. In: Intelligent Data Engineering and Automated Learning
– IDEAL 2021. ; 2021. doi:10.1007/978-3-030-91608-4_11'
apa: Feldhans, R., Wilke, A., Heindorf, S., Shaker, M. H., Hammer, B., Ngonga Ngomo,
A.-C., & Hüllermeier, E. (2021). Drift Detection in Text Data with Document
Embeddings. In Intelligent Data Engineering and Automated Learning – IDEAL
2021. https://doi.org/10.1007/978-3-030-91608-4_11
bibtex: '@inbook{Feldhans_Wilke_Heindorf_Shaker_Hammer_Ngonga Ngomo_Hüllermeier_2021,
place={Cham}, title={Drift Detection in Text Data with Document Embeddings}, DOI={10.1007/978-3-030-91608-4_11},
booktitle={Intelligent Data Engineering and Automated Learning – IDEAL 2021},
author={Feldhans, Robert and Wilke, Adrian and Heindorf, Stefan and Shaker, Mohammad
Hossein and Hammer, Barbara and Ngonga Ngomo, Axel-Cyrille and Hüllermeier, Eyke},
year={2021} }'
chicago: Feldhans, Robert, Adrian Wilke, Stefan Heindorf, Mohammad Hossein Shaker,
Barbara Hammer, Axel-Cyrille Ngonga Ngomo, and Eyke Hüllermeier. “Drift Detection
in Text Data with Document Embeddings.” In Intelligent Data Engineering and
Automated Learning – IDEAL 2021. Cham, 2021. https://doi.org/10.1007/978-3-030-91608-4_11.
ieee: R. Feldhans et al., “Drift Detection in Text Data with Document Embeddings,”
in Intelligent Data Engineering and Automated Learning – IDEAL 2021, Cham,
2021.
mla: Feldhans, Robert, et al. “Drift Detection in Text Data with Document Embeddings.”
Intelligent Data Engineering and Automated Learning – IDEAL 2021, 2021,
doi:10.1007/978-3-030-91608-4_11.
short: 'R. Feldhans, A. Wilke, S. Heindorf, M.H. Shaker, B. Hammer, A.-C. Ngonga
Ngomo, E. Hüllermeier, in: Intelligent Data Engineering and Automated Learning
– IDEAL 2021, Cham, 2021.'
date_created: 2021-12-17T10:33:12Z
date_updated: 2022-01-06T06:58:44Z
department:
- _id: '574'
doi: 10.1007/978-3-030-91608-4_11
language:
- iso: eng
place: Cham
publication: Intelligent Data Engineering and Automated Learning – IDEAL 2021
publication_identifier:
isbn:
- '9783030916077'
- '9783030916084'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Drift Detection in Text Data with Document Embeddings
type: book_chapter
user_id: '9101'
year: '2021'
...
---
_id: '21378'
author:
- first_name: Rita
full_name: Hartel, Rita
id: '14961'
last_name: Hartel
- first_name: Alexander
full_name: Dunst, Alexander
last_name: Dunst
citation:
ama: 'Hartel R, Dunst A. An OCR Pipeline and Semantic Text Analysis for Comics.
In: MANPU 2020: The 4th International Workshop on CoMics ANalysis, Processing
and Understanding@Pattern Recognition. ICPR International Workshops and Challenges.
Cham; 2021. doi:10.1007/978-3-030-68780-9_19'
apa: 'Hartel, R., & Dunst, A. (2021). An OCR Pipeline and Semantic Text Analysis
for Comics. In MANPU 2020: The 4th International Workshop on coMics ANalysis,
Processing and Understanding@Pattern Recognition. ICPR International Workshops
and Challenges. Cham. https://doi.org/10.1007/978-3-030-68780-9_19'
bibtex: '@inproceedings{Hartel_Dunst_2021, place={Cham}, title={An OCR Pipeline
and Semantic Text Analysis for Comics}, DOI={10.1007/978-3-030-68780-9_19},
booktitle={MANPU 2020: The 4th International Workshop on coMics ANalysis, Processing
and Understanding@Pattern Recognition. ICPR International Workshops and Challenges},
author={Hartel, Rita and Dunst, Alexander}, year={2021} }'
chicago: 'Hartel, Rita, and Alexander Dunst. “An OCR Pipeline and Semantic Text
Analysis for Comics.” In MANPU 2020: The 4th International Workshop on CoMics
ANalysis, Processing and Understanding@Pattern Recognition. ICPR International
Workshops and Challenges. Cham, 2021. https://doi.org/10.1007/978-3-030-68780-9_19.'
ieee: 'R. Hartel and A. Dunst, “An OCR Pipeline and Semantic Text Analysis for Comics,”
in MANPU 2020: The 4th International Workshop on coMics ANalysis, Processing
and Understanding@Pattern Recognition. ICPR International Workshops and Challenges,
2021.'
mla: 'Hartel, Rita, and Alexander Dunst. “An OCR Pipeline and Semantic Text Analysis
for Comics.” MANPU 2020: The 4th International Workshop on CoMics ANalysis,
Processing and Understanding@Pattern Recognition. ICPR International Workshops
and Challenges, 2021, doi:10.1007/978-3-030-68780-9_19.'
short: 'R. Hartel, A. Dunst, in: MANPU 2020: The 4th International Workshop on CoMics
ANalysis, Processing and Understanding@Pattern Recognition. ICPR International
Workshops and Challenges, Cham, 2021.'
date_created: 2021-03-04T12:35:22Z
date_updated: 2022-01-06T06:54:57Z
department:
- _id: '69'
doi: 10.1007/978-3-030-68780-9_19
language:
- iso: eng
place: Cham
publication: 'MANPU 2020: The 4th International Workshop on coMics ANalysis, Processing
and Understanding@Pattern Recognition. ICPR International Workshops and Challenges'
publication_identifier:
isbn:
- '9783030687793'
- '9783030687809'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: An OCR Pipeline and Semantic Text Analysis for Comics
type: conference
user_id: '14961'
year: '2021'
...
---
_id: '22057'
abstract:
- lang: eng
text: "We construct more efficient cryptosystems with provable\r\nsecurity against
adaptive attacks, based on simple and natural hardness\r\nassumptions in the standard
model. Concretely, we describe:\r\n– An adaptively-secure variant of the efficient,
selectively-secure LWE-\r\nbased identity-based encryption (IBE) scheme of Agrawal,
Boneh,\r\nand Boyen (EUROCRYPT 2010). In comparison to the previously\r\nmost
efficient such scheme by Yamada (CRYPTO 2017) we achieve\r\nsmaller lattice parameters
and shorter public keys of size O(log λ),\r\nwhere λ is the security parameter.\r\n–
Adaptively-secure variants of two efficient selectively-secure pairing-\r\nbased
IBEs of Boneh and Boyen (EUROCRYPT 2004). One is based\r\non the DBDH assumption,
has the same ciphertext size as the cor-\r\nresponding BB04 scheme, and achieves
full adaptive security with\r\npublic parameters of size only O(log λ). The other
is based on a q-\r\ntype assumption and has public key size O(λ), but a ciphertext
is\r\nonly a single group element and the security reduction is quadrat-\r\nically
tighter than the corresponding scheme by Jager and Kurek\r\n(ASIACRYPT 2018).\r\n–
A very efficient adaptively-secure verifiable random function where\r\nproofs,
public keys, and secret keys have size O(log λ).\r\nAs a technical contribution
we introduce blockwise partitioning, which\r\nleverages the assumption that a
cryptographic hash function is weak\r\nnear-collision resistant to prove full
adaptive security of cryptosystems."
author:
- first_name: Tibor
full_name: Jager, Tibor
last_name: Jager
- first_name: Rafael
full_name: Kurek, Rafael
last_name: Kurek
- first_name: David
full_name: Niehues, David
id: '36113'
last_name: Niehues
citation:
ama: 'Jager T, Kurek R, Niehues D. Efficient Adaptively-Secure IB-KEMs and VRFs
via Near-Collision Resistance. In: Public-Key Cryptography – PKC 2021.
Cham; 2021. doi:10.1007/978-3-030-75245-3_22'
apa: Jager, T., Kurek, R., & Niehues, D. (2021). Efficient Adaptively-Secure
IB-KEMs and VRFs via Near-Collision Resistance. In Public-Key Cryptography
– PKC 2021. Cham. https://doi.org/10.1007/978-3-030-75245-3_22
bibtex: '@inbook{Jager_Kurek_Niehues_2021, place={Cham}, title={Efficient Adaptively-Secure
IB-KEMs and VRFs via Near-Collision Resistance}, DOI={10.1007/978-3-030-75245-3_22},
booktitle={Public-Key Cryptography – PKC 2021}, author={Jager, Tibor and Kurek,
Rafael and Niehues, David}, year={2021} }'
chicago: Jager, Tibor, Rafael Kurek, and David Niehues. “Efficient Adaptively-Secure
IB-KEMs and VRFs via Near-Collision Resistance.” In Public-Key Cryptography
– PKC 2021. Cham, 2021. https://doi.org/10.1007/978-3-030-75245-3_22.
ieee: T. Jager, R. Kurek, and D. Niehues, “Efficient Adaptively-Secure IB-KEMs and
VRFs via Near-Collision Resistance,” in Public-Key Cryptography – PKC 2021,
Cham, 2021.
mla: Jager, Tibor, et al. “Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision
Resistance.” Public-Key Cryptography – PKC 2021, 2021, doi:10.1007/978-3-030-75245-3_22.
short: 'T. Jager, R. Kurek, D. Niehues, in: Public-Key Cryptography – PKC 2021,
Cham, 2021.'
date_created: 2021-05-10T15:56:24Z
date_updated: 2022-01-06T06:55:23Z
ddc:
- '000'
department:
- _id: '558'
doi: 10.1007/978-3-030-75245-3_22
file:
- access_level: closed
content_type: application/pdf
creator: davnie
date_created: 2021-05-10T16:02:02Z
date_updated: 2021-05-10T16:02:02Z
file_id: '22058'
file_name: Jager et al. - 2021 - Efficient Adaptively-Secure IB-KEMs and VRFs via
N.pdf
file_size: 701068
relation: main_file
file_date_updated: 2021-05-10T16:02:02Z
has_accepted_license: '1'
language:
- iso: eng
place: Cham
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication: Public-Key Cryptography – PKC 2021
publication_identifier:
isbn:
- '9783030752446'
- '9783030752453'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance
type: book_chapter
user_id: '36113'
year: '2021'
...
---
_id: '22059'
abstract:
- lang: eng
text: "Verifiable random functions (VRFs), introduced by Micali,\r\nRabin and Vadhan
(FOCS’99), are the public-key equivalent of pseudo-\r\nrandom functions. A public
verification key and proofs accompanying the\r\noutput enable all parties to verify
the correctness of the output. How-\r\never, all known standard model VRFs have
a reduction loss that is much\r\nworse than what one would expect from known optimal
constructions of\r\nclosely related primitives like unique signatures. We show
that:\r\n1. Every security proof for a VRF that relies on a non-interactive\r\nassumption
has to lose a factor of Q, where Q is the number of adver-\r\nsarial queries.
To that end, we extend the meta-reduction technique\r\nof Bader et al. (EUROCRYPT’16)
to also cover VRFs.\r\n2. This raises the question: Is this bound optimal? We
answer this ques-\r\ntion in the affirmative by presenting the first VRF with
a reduction\r\nfrom the non-interactive qDBDHI assumption to the security of VRF\r\nthat
achieves this optimal loss.\r\nWe thus paint a complete picture of the achievability
of tight verifiable\r\nrandom functions: We show that a security loss of Q is
unavoidable and\r\npresent the first construction that achieves this bound."
author:
- first_name: David
full_name: Niehues, David
id: '36113'
last_name: Niehues
citation:
ama: 'Niehues D. Verifiable Random Functions with Optimal Tightness. In: Public-Key
Cryptography – PKC 2021. Cham; 2021. doi:10.1007/978-3-030-75248-4_3'
apa: Niehues, D. (2021). Verifiable Random Functions with Optimal Tightness. In
Public-Key Cryptography – PKC 2021. Cham. https://doi.org/10.1007/978-3-030-75248-4_3
bibtex: '@inbook{Niehues_2021, place={Cham}, title={Verifiable Random Functions
with Optimal Tightness}, DOI={10.1007/978-3-030-75248-4_3},
booktitle={Public-Key Cryptography – PKC 2021}, author={Niehues, David}, year={2021}
}'
chicago: Niehues, David. “Verifiable Random Functions with Optimal Tightness.” In
Public-Key Cryptography – PKC 2021. Cham, 2021. https://doi.org/10.1007/978-3-030-75248-4_3.
ieee: D. Niehues, “Verifiable Random Functions with Optimal Tightness,” in Public-Key
Cryptography – PKC 2021, Cham, 2021.
mla: Niehues, David. “Verifiable Random Functions with Optimal Tightness.” Public-Key
Cryptography – PKC 2021, 2021, doi:10.1007/978-3-030-75248-4_3.
short: 'D. Niehues, in: Public-Key Cryptography – PKC 2021, Cham, 2021.'
date_created: 2021-05-10T16:07:50Z
date_updated: 2022-01-06T06:55:24Z
ddc:
- '000'
department:
- _id: '558'
doi: 10.1007/978-3-030-75248-4_3
file:
- access_level: closed
content_type: application/pdf
creator: davnie
date_created: 2021-05-10T16:09:17Z
date_updated: 2021-05-10T16:09:17Z
file_id: '22060'
file_name: Niehues - 2021 - Verifiable Random Functions with Optimal Tightness.pdf
file_size: 697361
relation: main_file
file_date_updated: 2021-05-10T16:09:17Z
has_accepted_license: '1'
language:
- iso: eng
place: Cham
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication: Public-Key Cryptography – PKC 2021
publication_identifier:
isbn:
- '9783030752477'
- '9783030752484'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Verifiable Random Functions with Optimal Tightness
type: book_chapter
user_id: '36113'
year: '2021'
...
---
_id: '27381'
abstract:
- lang: eng
text: Graph neural networks (GNNs) have been successfully applied in many structured
data domains, with applications ranging from molecular property prediction to
the analysis of social networks. Motivated by the broad applicability of GNNs,
we propose the family of so-called RankGNNs, a combination of neural Learning
to Rank (LtR) methods and GNNs. RankGNNs are trained with a set of pair-wise preferences
between graphs, suggesting that one of them is preferred over the other. One practical
application of this problem is drug screening, where an expert wants to find the
most promising molecules in a large collection of drug candidates. We empirically
demonstrate that our proposed pair-wise RankGNN approach either significantly
outperforms or at least matches the ranking performance of the naive point-wise
baseline approach, in which the LtR problem is solved via GNN-based graph regression.
author:
- first_name: Clemens
full_name: Damke, Clemens
id: '48192'
last_name: Damke
orcid: 0000-0002-0455-0048
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
citation:
ama: 'Damke C, Hüllermeier E. Ranking Structured Objects with Graph Neural Networks.
In: Soares C, Torgo L, eds. Proceedings of The 24th International Conference
on Discovery Science (DS 2021). Vol 12986. Lecture Notes in Computer Science.
Springer; 2021:166-180. doi:10.1007/978-3-030-88942-5'
apa: Damke, C., & Hüllermeier, E. (2021). Ranking Structured Objects with Graph
Neural Networks. In C. Soares & L. Torgo (Eds.), Proceedings of The 24th
International Conference on Discovery Science (DS 2021) (Vol. 12986, pp. 166–180).
Springer. https://doi.org/10.1007/978-3-030-88942-5
bibtex: '@inproceedings{Damke_Hüllermeier_2021, series={Lecture Notes in Computer
Science}, title={Ranking Structured Objects with Graph Neural Networks}, volume={12986},
DOI={10.1007/978-3-030-88942-5},
booktitle={Proceedings of The 24th International Conference on Discovery Science
(DS 2021)}, publisher={Springer}, author={Damke, Clemens and Hüllermeier, Eyke},
editor={Soares, Carlos and Torgo, Luis}, year={2021}, pages={166–180}, collection={Lecture
Notes in Computer Science} }'
chicago: Damke, Clemens, and Eyke Hüllermeier. “Ranking Structured Objects with
Graph Neural Networks.” In Proceedings of The 24th International Conference
on Discovery Science (DS 2021), edited by Carlos Soares and Luis Torgo, 12986:166–80.
Lecture Notes in Computer Science. Springer, 2021. https://doi.org/10.1007/978-3-030-88942-5.
ieee: 'C. Damke and E. Hüllermeier, “Ranking Structured Objects with Graph Neural
Networks,” in Proceedings of The 24th International Conference on Discovery
Science (DS 2021), Halifax, Canada, 2021, vol. 12986, pp. 166–180, doi: 10.1007/978-3-030-88942-5.'
mla: Damke, Clemens, and Eyke Hüllermeier. “Ranking Structured Objects with Graph
Neural Networks.” Proceedings of The 24th International Conference on Discovery
Science (DS 2021), edited by Carlos Soares and Luis Torgo, vol. 12986, Springer,
2021, pp. 166–80, doi:10.1007/978-3-030-88942-5.
short: 'C. Damke, E. Hüllermeier, in: C. Soares, L. Torgo (Eds.), Proceedings of
The 24th International Conference on Discovery Science (DS 2021), Springer, 2021,
pp. 166–180.'
conference:
end_date: 2021-10-13
location: Halifax, Canada
name: 24th International Conference on Discovery Science
start_date: 2021-10-11
date_created: 2021-11-11T14:15:18Z
date_updated: 2022-04-11T22:08:12Z
department:
- _id: '355'
doi: 10.1007/978-3-030-88942-5
editor:
- first_name: Carlos
full_name: Soares, Carlos
last_name: Soares
- first_name: Luis
full_name: Torgo, Luis
last_name: Torgo
external_id:
arxiv:
- '2104.08869'
intvolume: ' 12986'
keyword:
- Graph-structured data
- Graph neural networks
- Preference learning
- Learning to rank
language:
- iso: eng
page: 166-180
publication: Proceedings of The 24th International Conference on Discovery Science
(DS 2021)
publication_identifier:
isbn:
- '9783030889418'
- '9783030889425'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer
quality_controlled: '1'
series_title: Lecture Notes in Computer Science
status: public
title: Ranking Structured Objects with Graph Neural Networks
type: conference
user_id: '48192'
volume: 12986
year: '2021'
...
---
_id: '26888'
author:
- first_name: Thorsten
full_name: Götte, Thorsten
id: '34727'
last_name: Götte
- first_name: Christina
full_name: Kolb, Christina
id: '43647'
last_name: Kolb
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Julian
full_name: Werthmann, Julian
id: '50024'
last_name: Werthmann
citation:
ama: 'Götte T, Kolb C, Scheideler C, Werthmann J. Beep-And-Sleep: Message and Energy
Efficient Set Cover. In: Algorithms for Sensor Systems (ALGOSENSORS ’21).
; 2021. doi:10.1007/978-3-030-89240-1_7'
apa: 'Götte, T., Kolb, C., Scheideler, C., & Werthmann, J. (2021). Beep-And-Sleep:
Message and Energy Efficient Set Cover. In Algorithms for Sensor Systems (ALGOSENSORS
’21). ALGOSENSORS 2021, Lisbon, Portgual. https://doi.org/10.1007/978-3-030-89240-1_7'
bibtex: '@inbook{Götte_Kolb_Scheideler_Werthmann_2021, place={Cham}, title={Beep-And-Sleep:
Message and Energy Efficient Set Cover}, DOI={10.1007/978-3-030-89240-1_7},
booktitle={Algorithms for Sensor Systems (ALGOSENSORS ’21)}, author={Götte, Thorsten
and Kolb, Christina and Scheideler, Christian and Werthmann, Julian}, year={2021}
}'
chicago: 'Götte, Thorsten, Christina Kolb, Christian Scheideler, and Julian Werthmann.
“Beep-And-Sleep: Message and Energy Efficient Set Cover.” In Algorithms for
Sensor Systems (ALGOSENSORS ’21). Cham, 2021. https://doi.org/10.1007/978-3-030-89240-1_7.'
ieee: 'T. Götte, C. Kolb, C. Scheideler, and J. Werthmann, “Beep-And-Sleep: Message
and Energy Efficient Set Cover,” in Algorithms for Sensor Systems (ALGOSENSORS
’21), Cham, 2021.'
mla: 'Götte, Thorsten, et al. “Beep-And-Sleep: Message and Energy Efficient Set
Cover.” Algorithms for Sensor Systems (ALGOSENSORS ’21), 2021, doi:10.1007/978-3-030-89240-1_7.'
short: 'T. Götte, C. Kolb, C. Scheideler, J. Werthmann, in: Algorithms for Sensor
Systems (ALGOSENSORS ’21), Cham, 2021.'
conference:
location: Lisbon, Portgual
name: ALGOSENSORS 2021
date_created: 2021-10-26T12:06:04Z
date_updated: 2022-11-18T10:01:36Z
doi: 10.1007/978-3-030-89240-1_7
language:
- iso: eng
place: Cham
project:
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '1'
name: 'SFB 901: SFB 901'
publication: Algorithms for Sensor Systems (ALGOSENSORS '21)
publication_identifier:
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: 'Beep-And-Sleep: Message and Energy Efficient Set Cover'
type: book_chapter
user_id: '477'
year: '2021'
...
---
_id: '29566'
author:
- first_name: Jan
full_name: Bobolz, Jan
id: '27207'
last_name: Bobolz
- first_name: Fabian
full_name: Eidens, Fabian
id: '25078'
last_name: Eidens
- first_name: Stephan
full_name: Krenn, Stephan
last_name: Krenn
- first_name: Sebastian
full_name: Ramacher, Sebastian
last_name: Ramacher
- first_name: Kai
full_name: Samelin, Kai
last_name: Samelin
citation:
ama: 'Bobolz J, Eidens F, Krenn S, Ramacher S, Samelin K. Issuer-Hiding Attribute-Based
Credentials. In: Cryptology and Network Security. Springer International
Publishing; 2021. doi:10.1007/978-3-030-92548-2_9'
apa: Bobolz, J., Eidens, F., Krenn, S., Ramacher, S., & Samelin, K. (2021).
Issuer-Hiding Attribute-Based Credentials. Cryptology and Network Security.
https://doi.org/10.1007/978-3-030-92548-2_9
bibtex: '@inproceedings{Bobolz_Eidens_Krenn_Ramacher_Samelin_2021, place={Cham},
title={Issuer-Hiding Attribute-Based Credentials}, DOI={10.1007/978-3-030-92548-2_9},
booktitle={Cryptology and Network Security}, publisher={Springer International
Publishing}, author={Bobolz, Jan and Eidens, Fabian and Krenn, Stephan and Ramacher,
Sebastian and Samelin, Kai}, year={2021} }'
chicago: 'Bobolz, Jan, Fabian Eidens, Stephan Krenn, Sebastian Ramacher, and Kai
Samelin. “Issuer-Hiding Attribute-Based Credentials.” In Cryptology and Network
Security. Cham: Springer International Publishing, 2021. https://doi.org/10.1007/978-3-030-92548-2_9.'
ieee: 'J. Bobolz, F. Eidens, S. Krenn, S. Ramacher, and K. Samelin, “Issuer-Hiding
Attribute-Based Credentials,” 2021, doi: 10.1007/978-3-030-92548-2_9.'
mla: Bobolz, Jan, et al. “Issuer-Hiding Attribute-Based Credentials.” Cryptology
and Network Security, Springer International Publishing, 2021, doi:10.1007/978-3-030-92548-2_9.
short: 'J. Bobolz, F. Eidens, S. Krenn, S. Ramacher, K. Samelin, in: Cryptology
and Network Security, Springer International Publishing, Cham, 2021.'
date_created: 2022-01-27T13:00:21Z
date_updated: 2022-01-27T13:02:23Z
department:
- _id: '7'
- _id: '64'
doi: 10.1007/978-3-030-92548-2_9
language:
- iso: eng
place: Cham
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '13'
name: 'SFB 901 - C1: SFB 901 - Subproject C1'
publication: Cryptology and Network Security
publication_identifier:
isbn:
- '9783030925475'
- '9783030925482'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: Issuer-Hiding Attribute-Based Credentials
type: conference
user_id: '27207'
year: '2021'
...
---
_id: '32868'
author:
- first_name: Per Rådberg
full_name: Nagbøl, Per Rådberg
last_name: Nagbøl
- first_name: Oliver
full_name: Müller, Oliver
last_name: Müller
- first_name: Oliver
full_name: Krancher, Oliver
last_name: Krancher
citation:
ama: 'Nagbøl PR, Müller O, Krancher O. Designing a Risk Assessment Tool for Artificial
Intelligence Systems. In: The Next Wave of Sociotechnical Design. Springer
International Publishing; 2021. doi:10.1007/978-3-030-82405-1_32'
apa: Nagbøl, P. R., Müller, O., & Krancher, O. (2021). Designing a Risk Assessment
Tool for Artificial Intelligence Systems. In The Next Wave of Sociotechnical
Design. Springer International Publishing. https://doi.org/10.1007/978-3-030-82405-1_32
bibtex: '@inbook{Nagbøl_Müller_Krancher_2021, place={Cham}, title={Designing a Risk
Assessment Tool for Artificial Intelligence Systems}, DOI={10.1007/978-3-030-82405-1_32},
booktitle={The Next Wave of Sociotechnical Design}, publisher={Springer International
Publishing}, author={Nagbøl, Per Rådberg and Müller, Oliver and Krancher, Oliver},
year={2021} }'
chicago: 'Nagbøl, Per Rådberg, Oliver Müller, and Oliver Krancher. “Designing a
Risk Assessment Tool for Artificial Intelligence Systems.” In The Next Wave
of Sociotechnical Design. Cham: Springer International Publishing, 2021. https://doi.org/10.1007/978-3-030-82405-1_32.'
ieee: 'P. R. Nagbøl, O. Müller, and O. Krancher, “Designing a Risk Assessment Tool
for Artificial Intelligence Systems,” in The Next Wave of Sociotechnical Design,
Cham: Springer International Publishing, 2021.'
mla: Nagbøl, Per Rådberg, et al. “Designing a Risk Assessment Tool for Artificial
Intelligence Systems.” The Next Wave of Sociotechnical Design, Springer
International Publishing, 2021, doi:10.1007/978-3-030-82405-1_32.
short: 'P.R. Nagbøl, O. Müller, O. Krancher, in: The Next Wave of Sociotechnical
Design, Springer International Publishing, Cham, 2021.'
date_created: 2022-08-17T07:14:41Z
date_updated: 2022-08-17T07:16:00Z
department:
- _id: '196'
doi: 10.1007/978-3-030-82405-1_32
language:
- iso: eng
place: Cham
publication: The Next Wave of Sociotechnical Design
publication_identifier:
isbn:
- '9783030824044'
- '9783030824051'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: Designing a Risk Assessment Tool for Artificial Intelligence Systems
type: book_chapter
user_id: '72849'
year: '2021'
...
---
_id: '29292'
author:
- first_name: Robert
full_name: Feldhans, Robert
last_name: Feldhans
- first_name: Adrian
full_name: Wilke, Adrian
id: '9101'
last_name: Wilke
orcid: 0000-0002-6575-807X
- first_name: Stefan
full_name: Heindorf, Stefan
id: '11871'
last_name: Heindorf
orcid: 0000-0002-4525-6865
- first_name: Mohammad Hossein
full_name: Shaker, Mohammad Hossein
last_name: Shaker
- first_name: Barbara
full_name: Hammer, Barbara
last_name: Hammer
- first_name: Axel-Cyrille
full_name: Ngonga Ngomo, Axel-Cyrille
id: '65716'
last_name: Ngonga Ngomo
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
citation:
ama: 'Feldhans R, Wilke A, Heindorf S, et al. Drift Detection in Text Data with
Document Embeddings. In: Intelligent Data Engineering and Automated Learning
– IDEAL 2021. Springer International Publishing; 2021. doi:10.1007/978-3-030-91608-4_11'
apa: Feldhans, R., Wilke, A., Heindorf, S., Shaker, M. H., Hammer, B., Ngonga Ngomo,
A.-C., & Hüllermeier, E. (2021). Drift Detection in Text Data with Document
Embeddings. In Intelligent Data Engineering and Automated Learning – IDEAL
2021. Springer International Publishing. https://doi.org/10.1007/978-3-030-91608-4_11
bibtex: '@inbook{Feldhans_Wilke_Heindorf_Shaker_Hammer_Ngonga Ngomo_Hüllermeier_2021,
place={Cham}, title={Drift Detection in Text Data with Document Embeddings}, DOI={10.1007/978-3-030-91608-4_11},
booktitle={Intelligent Data Engineering and Automated Learning – IDEAL 2021},
publisher={Springer International Publishing}, author={Feldhans, Robert and Wilke,
Adrian and Heindorf, Stefan and Shaker, Mohammad Hossein and Hammer, Barbara and
Ngonga Ngomo, Axel-Cyrille and Hüllermeier, Eyke}, year={2021} }'
chicago: 'Feldhans, Robert, Adrian Wilke, Stefan Heindorf, Mohammad Hossein Shaker,
Barbara Hammer, Axel-Cyrille Ngonga Ngomo, and Eyke Hüllermeier. “Drift Detection
in Text Data with Document Embeddings.” In Intelligent Data Engineering and
Automated Learning – IDEAL 2021. Cham: Springer International Publishing,
2021. https://doi.org/10.1007/978-3-030-91608-4_11.'
ieee: 'R. Feldhans et al., “Drift Detection in Text Data with Document Embeddings,”
in Intelligent Data Engineering and Automated Learning – IDEAL 2021, Cham:
Springer International Publishing, 2021.'
mla: Feldhans, Robert, et al. “Drift Detection in Text Data with Document Embeddings.”
Intelligent Data Engineering and Automated Learning – IDEAL 2021, Springer
International Publishing, 2021, doi:10.1007/978-3-030-91608-4_11.
short: 'R. Feldhans, A. Wilke, S. Heindorf, M.H. Shaker, B. Hammer, A.-C. Ngonga
Ngomo, E. Hüllermeier, in: Intelligent Data Engineering and Automated Learning
– IDEAL 2021, Springer International Publishing, Cham, 2021.'
date_created: 2022-01-12T10:27:23Z
date_updated: 2022-10-15T19:54:20Z
department:
- _id: '574'
doi: 10.1007/978-3-030-91608-4_11
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://papers.dice-research.org/2021/IDEAL2021_DriftDetectionEmbeddings/Drift-Detection-in-Text-Data-with-Document-Embeddings-public.pdf
oa: '1'
place: Cham
publication: Intelligent Data Engineering and Automated Learning – IDEAL 2021
publication_identifier:
isbn:
- '9783030916077'
- '9783030916084'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
related_material:
link:
- relation: confirmation
url: https://link.springer.com/chapter/10.1007/978-3-030-91608-4_11
status: public
title: Drift Detection in Text Data with Document Embeddings
type: book_chapter
user_id: '11871'
year: '2021'
...
---
_id: '45846'
author:
- first_name: Juha
full_name: Kontinen, Juha
last_name: Kontinen
- first_name: Arne
full_name: Meier, Arne
last_name: Meier
- first_name: Yasir
full_name: Mahmood, Yasir
last_name: Mahmood
citation:
ama: 'Kontinen J, Meier A, Mahmood Y. A Parameterized View on the Complexity of
Dependence Logic. In: Logical Foundations of Computer Science. Springer
International Publishing; 2021. doi:10.1007/978-3-030-93100-1_9'
apa: Kontinen, J., Meier, A., & Mahmood, Y. (2021). A Parameterized View on
the Complexity of Dependence Logic. Logical Foundations of Computer Science.
https://doi.org/10.1007/978-3-030-93100-1_9
bibtex: '@inproceedings{Kontinen_Meier_Mahmood_2021, place={Cham}, title={A Parameterized
View on the Complexity of Dependence Logic}, DOI={10.1007/978-3-030-93100-1_9},
booktitle={Logical Foundations of Computer Science}, publisher={Springer International
Publishing}, author={Kontinen, Juha and Meier, Arne and Mahmood, Yasir}, year={2021}
}'
chicago: 'Kontinen, Juha, Arne Meier, and Yasir Mahmood. “A Parameterized View on
the Complexity of Dependence Logic.” In Logical Foundations of Computer Science.
Cham: Springer International Publishing, 2021. https://doi.org/10.1007/978-3-030-93100-1_9.'
ieee: 'J. Kontinen, A. Meier, and Y. Mahmood, “A Parameterized View on the Complexity
of Dependence Logic,” 2021, doi: 10.1007/978-3-030-93100-1_9.'
mla: Kontinen, Juha, et al. “A Parameterized View on the Complexity of Dependence
Logic.” Logical Foundations of Computer Science, Springer International
Publishing, 2021, doi:10.1007/978-3-030-93100-1_9.
short: 'J. Kontinen, A. Meier, Y. Mahmood, in: Logical Foundations of Computer Science,
Springer International Publishing, Cham, 2021.'
date_created: 2023-07-03T11:36:33Z
date_updated: 2023-07-03T11:44:42Z
doi: 10.1007/978-3-030-93100-1_9
language:
- iso: eng
place: Cham
publication: Logical Foundations of Computer Science
publication_identifier:
isbn:
- '9783030930998'
- '9783030931001'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: A Parameterized View on the Complexity of Dependence Logic
type: conference
user_id: '99353'
year: '2021'
...
---
_id: '21587'
abstract:
- lang: eng
text: Solving partial differential equations on unstructured grids is a cornerstone
of engineering and scientific computing. Nowadays, heterogeneous parallel platforms
with CPUs, GPUs, and FPGAs enable energy-efficient and computationally demanding
simulations. We developed the HighPerMeshes C++-embedded Domain-Specific Language
(DSL) for bridging the abstraction gap between the mathematical and algorithmic
formulation of mesh-based algorithms for PDE problems on the one hand and an increasing
number of heterogeneous platforms with their different parallel programming and
runtime models on the other hand. Thus, the HighPerMeshes DSL aims at higher productivity
in the code development process for multiple target platforms. We introduce the
concepts as well as the basic structure of the HighPerMeshes DSL, and demonstrate
its usage with three examples, a Poisson and monodomain problem, respectively,
solved by the continuous finite element method, and the discontinuous Galerkin
method for Maxwell’s equation. The mapping of the abstract algorithmic description
onto parallel hardware, including distributed memory compute clusters, is presented.
Finally, the achievable performance and scalability are demonstrated for a typical
example problem on a multi-core CPU cluster.
author:
- first_name: Samer
full_name: Alhaddad, Samer
id: '42456'
last_name: Alhaddad
- first_name: Jens
full_name: Förstner, Jens
id: '158'
last_name: Förstner
orcid: 0000-0001-7059-9862
- first_name: Stefan
full_name: Groth, Stefan
last_name: Groth
- first_name: Daniel
full_name: Grünewald, Daniel
last_name: Grünewald
- first_name: Yevgen
full_name: Grynko, Yevgen
id: '26059'
last_name: Grynko
- first_name: Frank
full_name: Hannig, Frank
last_name: Hannig
- first_name: Tobias
full_name: Kenter, Tobias
id: '3145'
last_name: Kenter
- first_name: Franz-Josef
full_name: Pfreundt, Franz-Josef
last_name: Pfreundt
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
- first_name: Merlind
full_name: Schotte, Merlind
last_name: Schotte
- first_name: Thomas
full_name: Steinke, Thomas
last_name: Steinke
- first_name: Jürgen
full_name: Teich, Jürgen
last_name: Teich
- first_name: Martin
full_name: Weiser, Martin
last_name: Weiser
- first_name: Florian
full_name: Wende, Florian
last_name: Wende
citation:
ama: 'Alhaddad S, Förstner J, Groth S, et al. HighPerMeshes – A Domain-Specific
Language for Numerical Algorithms on Unstructured Grids. In: Euro-Par 2020:
Parallel Processing Workshops. ; 2021. doi:10.1007/978-3-030-71593-9_15'
apa: 'Alhaddad, S., Förstner, J., Groth, S., Grünewald, D., Grynko, Y., Hannig,
F., Kenter, T., Pfreundt, F.-J., Plessl, C., Schotte, M., Steinke, T., Teich,
J., Weiser, M., & Wende, F. (2021). HighPerMeshes – A Domain-Specific Language
for Numerical Algorithms on Unstructured Grids. In Euro-Par 2020: Parallel
Processing Workshops. https://doi.org/10.1007/978-3-030-71593-9_15'
bibtex: '@inbook{Alhaddad_Förstner_Groth_Grünewald_Grynko_Hannig_Kenter_Pfreundt_Plessl_Schotte_et
al._2021, place={Cham}, title={HighPerMeshes – A Domain-Specific Language for
Numerical Algorithms on Unstructured Grids}, DOI={10.1007/978-3-030-71593-9_15},
booktitle={Euro-Par 2020: Parallel Processing Workshops}, author={Alhaddad, Samer
and Förstner, Jens and Groth, Stefan and Grünewald, Daniel and Grynko, Yevgen
and Hannig, Frank and Kenter, Tobias and Pfreundt, Franz-Josef and Plessl, Christian
and Schotte, Merlind and et al.}, year={2021} }'
chicago: 'Alhaddad, Samer, Jens Förstner, Stefan Groth, Daniel Grünewald, Yevgen
Grynko, Frank Hannig, Tobias Kenter, et al. “HighPerMeshes – A Domain-Specific
Language for Numerical Algorithms on Unstructured Grids.” In Euro-Par 2020:
Parallel Processing Workshops. Cham, 2021. https://doi.org/10.1007/978-3-030-71593-9_15.'
ieee: 'S. Alhaddad et al., “HighPerMeshes – A Domain-Specific Language for
Numerical Algorithms on Unstructured Grids,” in Euro-Par 2020: Parallel Processing
Workshops, Cham, 2021.'
mla: 'Alhaddad, Samer, et al. “HighPerMeshes – A Domain-Specific Language for Numerical
Algorithms on Unstructured Grids.” Euro-Par 2020: Parallel Processing Workshops,
2021, doi:10.1007/978-3-030-71593-9_15.'
short: 'S. Alhaddad, J. Förstner, S. Groth, D. Grünewald, Y. Grynko, F. Hannig,
T. Kenter, F.-J. Pfreundt, C. Plessl, M. Schotte, T. Steinke, J. Teich, M. Weiser,
F. Wende, in: Euro-Par 2020: Parallel Processing Workshops, Cham, 2021.'
date_created: 2021-03-31T19:39:42Z
date_updated: 2023-09-26T11:40:25Z
ddc:
- '004'
department:
- _id: '61'
- _id: '230'
- _id: '429'
- _id: '27'
- _id: '518'
doi: 10.1007/978-3-030-71593-9_15
file:
- access_level: closed
content_type: application/pdf
creator: fossie
date_created: 2021-03-31T19:42:52Z
date_updated: 2021-03-31T19:42:52Z
file_id: '21588'
file_name: 2021-03 Alhaddad2021_Chapter_HighPerMeshesADomain-SpecificL.pdf
file_size: 564398
relation: main_file
success: 1
file_date_updated: 2021-03-31T19:42:52Z
has_accepted_license: '1'
keyword:
- tet_topic_hpc
language:
- iso: eng
place: Cham
project:
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: 'Euro-Par 2020: Parallel Processing Workshops'
publication_identifier:
isbn:
- '9783030715922'
- '9783030715939'
issn:
- 0302-9743
- 1611-3349
publication_status: published
quality_controlled: '1'
status: public
title: HighPerMeshes – A Domain-Specific Language for Numerical Algorithms on Unstructured
Grids
type: book_chapter
user_id: '15278'
year: '2021'
...
---
_id: '29936'
author:
- first_name: Arjun
full_name: Ramaswami, Arjun
id: '49171'
last_name: Ramaswami
orcid: https://orcid.org/0000-0002-0909-1178
- first_name: Tobias
full_name: Kenter, Tobias
id: '3145'
last_name: Kenter
- first_name: Thomas
full_name: Kühne, Thomas
id: '49079'
last_name: Kühne
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
citation:
ama: 'Ramaswami A, Kenter T, Kühne T, Plessl C. Evaluating the Design Space for
Offloading 3D FFT Calculations to an FPGA for High-Performance Computing. In:
Applied Reconfigurable Computing. Architectures, Tools, and Applications.
Springer International Publishing; 2021. doi:10.1007/978-3-030-79025-7_21'
apa: Ramaswami, A., Kenter, T., Kühne, T., & Plessl, C. (2021). Evaluating the
Design Space for Offloading 3D FFT Calculations to an FPGA for High-Performance
Computing. In Applied Reconfigurable Computing. Architectures, Tools, and Applications.
Int. Conf. on Applied Reconfigurable Computing. Architectures, Tools, and Applications.
Springer International Publishing. https://doi.org/10.1007/978-3-030-79025-7_21
bibtex: '@inbook{Ramaswami_Kenter_Kühne_Plessl_2021, place={Cham}, title={Evaluating
the Design Space for Offloading 3D FFT Calculations to an FPGA for High-Performance
Computing}, DOI={10.1007/978-3-030-79025-7_21},
booktitle={Applied Reconfigurable Computing. Architectures, Tools, and Applications},
publisher={Springer International Publishing}, author={Ramaswami, Arjun and Kenter,
Tobias and Kühne, Thomas and Plessl, Christian}, year={2021} }'
chicago: 'Ramaswami, Arjun, Tobias Kenter, Thomas Kühne, and Christian Plessl. “Evaluating
the Design Space for Offloading 3D FFT Calculations to an FPGA for High-Performance
Computing.” In Applied Reconfigurable Computing. Architectures, Tools, and
Applications. Cham: Springer International Publishing, 2021. https://doi.org/10.1007/978-3-030-79025-7_21.'
ieee: 'A. Ramaswami, T. Kenter, T. Kühne, and C. Plessl, “Evaluating the Design
Space for Offloading 3D FFT Calculations to an FPGA for High-Performance Computing,”
in Applied Reconfigurable Computing. Architectures, Tools, and Applications,
Cham: Springer International Publishing, 2021.'
mla: Ramaswami, Arjun, et al. “Evaluating the Design Space for Offloading 3D FFT
Calculations to an FPGA for High-Performance Computing.” Applied Reconfigurable
Computing. Architectures, Tools, and Applications, Springer International
Publishing, 2021, doi:10.1007/978-3-030-79025-7_21.
short: 'A. Ramaswami, T. Kenter, T. Kühne, C. Plessl, in: Applied Reconfigurable
Computing. Architectures, Tools, and Applications, Springer International Publishing,
Cham, 2021.'
conference:
name: Int. Conf. on Applied Reconfigurable Computing. Architectures, Tools, and
Applications
date_created: 2022-02-21T14:22:01Z
date_updated: 2023-09-26T11:40:45Z
department:
- _id: '27'
- _id: '518'
- _id: '304'
doi: 10.1007/978-3-030-79025-7_21
language:
- iso: eng
place: Cham
publication: Applied Reconfigurable Computing. Architectures, Tools, and Applications
publication_identifier:
isbn:
- '9783030790240'
- '9783030790257'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
quality_controlled: '1'
status: public
title: Evaluating the Design Space for Offloading 3D FFT Calculations to an FPGA for
High-Performance Computing
type: book_chapter
user_id: '15278'
year: '2021'
...
---
_id: '45823'
author:
- first_name: Juha
full_name: Kontinen, Juha
last_name: Kontinen
- first_name: Arne
full_name: Meier, Arne
last_name: Meier
- first_name: Yasir
full_name: Mahmood, Yasir
last_name: Mahmood
citation:
ama: 'Kontinen J, Meier A, Mahmood Y. A Parameterized View on the Complexity of
Dependence Logic. In: Logical Foundations of Computer Science. Springer
International Publishing; 2021. doi:10.1007/978-3-030-93100-1_9'
apa: Kontinen, J., Meier, A., & Mahmood, Y. (2021). A Parameterized View on
the Complexity of Dependence Logic. In Logical Foundations of Computer Science.
Springer International Publishing. https://doi.org/10.1007/978-3-030-93100-1_9
bibtex: '@inbook{Kontinen_Meier_Mahmood_2021, place={Cham}, title={A Parameterized
View on the Complexity of Dependence Logic}, DOI={10.1007/978-3-030-93100-1_9},
booktitle={Logical Foundations of Computer Science}, publisher={Springer International
Publishing}, author={Kontinen, Juha and Meier, Arne and Mahmood, Yasir}, year={2021}
}'
chicago: 'Kontinen, Juha, Arne Meier, and Yasir Mahmood. “A Parameterized View on
the Complexity of Dependence Logic.” In Logical Foundations of Computer Science.
Cham: Springer International Publishing, 2021. https://doi.org/10.1007/978-3-030-93100-1_9.'
ieee: 'J. Kontinen, A. Meier, and Y. Mahmood, “A Parameterized View on the Complexity
of Dependence Logic,” in Logical Foundations of Computer Science, Cham:
Springer International Publishing, 2021.'
mla: Kontinen, Juha, et al. “A Parameterized View on the Complexity of Dependence
Logic.” Logical Foundations of Computer Science, Springer International
Publishing, 2021, doi:10.1007/978-3-030-93100-1_9.
short: 'J. Kontinen, A. Meier, Y. Mahmood, in: Logical Foundations of Computer Science,
Springer International Publishing, Cham, 2021.'
date_created: 2023-06-30T11:58:04Z
date_updated: 2024-03-01T11:45:56Z
doi: 10.1007/978-3-030-93100-1_9
place: Cham
publication: Logical Foundations of Computer Science
publication_identifier:
isbn:
- '9783030930998'
- '9783030931001'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: A Parameterized View on the Complexity of Dependence Logic
type: book_chapter
user_id: '99353'
year: '2021'
...
---
_id: '19521'
author:
- first_name: Karlson
full_name: Pfannschmidt, Karlson
last_name: Pfannschmidt
- first_name: Eyke
full_name: Hüllermeier, Eyke
last_name: Hüllermeier
citation:
ama: 'Pfannschmidt K, Hüllermeier E. Learning Choice Functions via Pareto-Embeddings.
In: Lecture Notes in Computer Science. Cham; 2020. doi:10.1007/978-3-030-58285-2_30'
apa: Pfannschmidt, K., & Hüllermeier, E. (2020). Learning Choice Functions via
Pareto-Embeddings. In Lecture Notes in Computer Science. Cham. https://doi.org/10.1007/978-3-030-58285-2_30
bibtex: '@inbook{Pfannschmidt_Hüllermeier_2020, place={Cham}, title={Learning Choice
Functions via Pareto-Embeddings}, DOI={10.1007/978-3-030-58285-2_30},
booktitle={Lecture Notes in Computer Science}, author={Pfannschmidt, Karlson and
Hüllermeier, Eyke}, year={2020} }'
chicago: Pfannschmidt, Karlson, and Eyke Hüllermeier. “Learning Choice Functions
via Pareto-Embeddings.” In Lecture Notes in Computer Science. Cham, 2020.
https://doi.org/10.1007/978-3-030-58285-2_30.
ieee: K. Pfannschmidt and E. Hüllermeier, “Learning Choice Functions via Pareto-Embeddings,”
in Lecture Notes in Computer Science, Cham, 2020.
mla: Pfannschmidt, Karlson, and Eyke Hüllermeier. “Learning Choice Functions via
Pareto-Embeddings.” Lecture Notes in Computer Science, 2020, doi:10.1007/978-3-030-58285-2_30.
short: 'K. Pfannschmidt, E. Hüllermeier, in: Lecture Notes in Computer Science,
Cham, 2020.'
date_created: 2020-09-17T10:52:41Z
date_updated: 2022-01-06T06:54:06Z
department:
- _id: '7'
- _id: '355'
doi: 10.1007/978-3-030-58285-2_30
language:
- iso: eng
place: Cham
project:
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783030582845'
- '9783030582852'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Learning Choice Functions via Pareto-Embeddings
type: book_chapter
user_id: '13472'
year: '2020'
...
---
_id: '19561'
author:
- first_name: Meinolf
full_name: Sellmann, Meinolf
last_name: Sellmann
- first_name: Kevin
full_name: Tierney, Kevin
last_name: Tierney
citation:
ama: 'Sellmann M, Tierney K. Hyper-parameterized Dialectic Search for Non-linear
Box-Constrained Optimization with Heterogenous Variable Types. In: Lecture
Notes in Computer Science. Cham; 2020. doi:10.1007/978-3-030-53552-0_12'
apa: Sellmann, M., & Tierney, K. (2020). Hyper-parameterized Dialectic Search
for Non-linear Box-Constrained Optimization with Heterogenous Variable Types.
In Lecture Notes in Computer Science. Cham. https://doi.org/10.1007/978-3-030-53552-0_12
bibtex: '@inbook{Sellmann_Tierney_2020, place={Cham}, title={Hyper-parameterized
Dialectic Search for Non-linear Box-Constrained Optimization with Heterogenous
Variable Types}, DOI={10.1007/978-3-030-53552-0_12},
booktitle={Lecture Notes in Computer Science}, author={Sellmann, Meinolf and Tierney,
Kevin}, year={2020} }'
chicago: Sellmann, Meinolf, and Kevin Tierney. “Hyper-Parameterized Dialectic Search
for Non-Linear Box-Constrained Optimization with Heterogenous Variable Types.”
In Lecture Notes in Computer Science. Cham, 2020. https://doi.org/10.1007/978-3-030-53552-0_12.
ieee: M. Sellmann and K. Tierney, “Hyper-parameterized Dialectic Search for Non-linear
Box-Constrained Optimization with Heterogenous Variable Types,” in Lecture
Notes in Computer Science, Cham, 2020.
mla: Sellmann, Meinolf, and Kevin Tierney. “Hyper-Parameterized Dialectic Search
for Non-Linear Box-Constrained Optimization with Heterogenous Variable Types.”
Lecture Notes in Computer Science, 2020, doi:10.1007/978-3-030-53552-0_12.
short: 'M. Sellmann, K. Tierney, in: Lecture Notes in Computer Science, Cham, 2020.'
date_created: 2020-09-18T07:54:06Z
date_updated: 2022-01-06T06:54:07Z
doi: 10.1007/978-3-030-53552-0_12
keyword:
- pc2-ressources
language:
- iso: eng
place: Cham
project:
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783030535513'
- '9783030535520'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Hyper-parameterized Dialectic Search for Non-linear Box-Constrained Optimization
with Heterogenous Variable Types
type: book_chapter
user_id: '61189'
year: '2020'
...
---
_id: '21396'
abstract:
- lang: eng
text: "Verifiable random functions (VRFs) are essentially digital signatures with
additional properties, namely verifiable uniqueness and pseudorandomness, which
make VRFs a useful tool, e.g., to prevent enumeration in DNSSEC Authenticated
Denial of Existence and the CONIKS key management system, or in the random committee
selection of the Algorand blockchain.\r\n\r\nMost standard-model VRFs rely on
admissible hash functions (AHFs) to achieve security against adaptive attacks
in the standard model. Known AHF constructions are based on error-correcting codes,
which yield asymptotically efficient constructions. However, previous works do
not clarify how the code should be instantiated concretely in the real world.
The rate and the minimal distance of the selected code have significant impact
on the efficiency of the resulting cryptosystem, therefore it is unclear if and
how the aforementioned constructions can be used in practice.\r\n\r\nFirst, we
explain inherent limitations of code-based AHFs. Concretely, we assume that even
if we were given codes that achieve the well-known Gilbert-Varshamov or McEliece-Rodemich-Rumsey-Welch
bounds, existing AHF-based constructions of verifiable random functions (VRFs)
can only be instantiated quite inefficiently. Then we introduce and construct
computational AHFs (cAHFs). While classical AHFs are information-theoretic, and
therefore work even in presence of computationally unbounded adversaries, cAHFs
provide only security against computationally bounded adversaries. However, we
show that cAHFs can be instantiated significantly more efficiently. Finally, we
use our cAHF to construct the currently most efficient verifiable random function
with full adaptive security in the standard model."
author:
- first_name: Tibor
full_name: Jager, Tibor
last_name: Jager
- first_name: David
full_name: Niehues, David
id: '36113'
last_name: Niehues
citation:
ama: 'Jager T, Niehues D. On the Real-World Instantiability of Admissible Hash Functions
and Efficient Verifiable Random Functions. In: Lecture Notes in Computer Science.
Cham; 2020. doi:10.1007/978-3-030-38471-5_13'
apa: Jager, T., & Niehues, D. (2020). On the Real-World Instantiability of Admissible
Hash Functions and Efficient Verifiable Random Functions. In Lecture Notes
in Computer Science. Cham. https://doi.org/10.1007/978-3-030-38471-5_13
bibtex: '@inbook{Jager_Niehues_2020, place={Cham}, title={On the Real-World Instantiability
of Admissible Hash Functions and Efficient Verifiable Random Functions}, DOI={10.1007/978-3-030-38471-5_13},
booktitle={Lecture Notes in Computer Science}, author={Jager, Tibor and Niehues,
David}, year={2020} }'
chicago: Jager, Tibor, and David Niehues. “On the Real-World Instantiability of
Admissible Hash Functions and Efficient Verifiable Random Functions.” In Lecture
Notes in Computer Science. Cham, 2020. https://doi.org/10.1007/978-3-030-38471-5_13.
ieee: T. Jager and D. Niehues, “On the Real-World Instantiability of Admissible
Hash Functions and Efficient Verifiable Random Functions,” in Lecture Notes
in Computer Science, Cham, 2020.
mla: Jager, Tibor, and David Niehues. “On the Real-World Instantiability of Admissible
Hash Functions and Efficient Verifiable Random Functions.” Lecture Notes in
Computer Science, 2020, doi:10.1007/978-3-030-38471-5_13.
short: 'T. Jager, D. Niehues, in: Lecture Notes in Computer Science, Cham, 2020.'
conference:
end_date: 2019-08-16
location: Waterloo, Canada
name: Selected Areas in Cryptography
start_date: 2019-08-12
date_created: 2021-03-08T16:50:31Z
date_updated: 2022-01-06T06:54:58Z
ddc:
- '000'
department:
- _id: '558'
doi: 10.1007/978-3-030-38471-5_13
file:
- access_level: closed
content_type: application/pdf
creator: davnie
date_created: 2021-03-08T17:02:37Z
date_updated: 2021-03-08T17:02:37Z
file_id: '21399'
file_name: Jager und Niehues - 2020 - On the Real-World Instantiability of Admissible
Ha.pdf
file_size: 706743
relation: main_file
file_date_updated: 2021-03-08T17:02:37Z
has_accepted_license: '1'
keyword:
- Admissible hash functions
- Verifiable random functions
- Error-correcting codes
- Provable security
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/content/pdf/10.1007%252F978-3-030-38471-5_13.pdf
place: Cham
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783030384708'
- '9783030384715'
issn:
- 0302-9743
- 1611-3349
publication_status: published
quality_controlled: '1'
related_material:
link:
- relation: later_version
url: https://eprint.iacr.org/2019/1335.pdf
status: public
title: On the Real-World Instantiability of Admissible Hash Functions and Efficient
Verifiable Random Functions
type: book_chapter
user_id: '36113'
year: '2020'
...
---
_id: '17337'
author:
- first_name: Bahar
full_name: Jazayeri, Bahar
last_name: Jazayeri
- first_name: Simon
full_name: Schwichtenberg, Simon
last_name: Schwichtenberg
- first_name: Jochen
full_name: Küster, Jochen
last_name: Küster
- first_name: Olaf
full_name: Zimmermann, Olaf
last_name: Zimmermann
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'Jazayeri B, Schwichtenberg S, Küster J, Zimmermann O, Engels G. Modeling and
Analyzing Architectural Diversity of Open Platforms. In: Advanced Information
Systems Engineering. Cham; 2020. doi:10.1007/978-3-030-49435-3_3'
apa: Jazayeri, B., Schwichtenberg, S., Küster, J., Zimmermann, O., & Engels,
G. (2020). Modeling and Analyzing Architectural Diversity of Open Platforms. In
Advanced Information Systems Engineering. Cham. https://doi.org/10.1007/978-3-030-49435-3_3
bibtex: '@inbook{Jazayeri_Schwichtenberg_Küster_Zimmermann_Engels_2020, place={Cham},
title={Modeling and Analyzing Architectural Diversity of Open Platforms}, DOI={10.1007/978-3-030-49435-3_3},
booktitle={Advanced Information Systems Engineering}, author={Jazayeri, Bahar
and Schwichtenberg, Simon and Küster, Jochen and Zimmermann, Olaf and Engels,
Gregor}, year={2020} }'
chicago: Jazayeri, Bahar, Simon Schwichtenberg, Jochen Küster, Olaf Zimmermann,
and Gregor Engels. “Modeling and Analyzing Architectural Diversity of Open Platforms.”
In Advanced Information Systems Engineering. Cham, 2020. https://doi.org/10.1007/978-3-030-49435-3_3.
ieee: B. Jazayeri, S. Schwichtenberg, J. Küster, O. Zimmermann, and G. Engels, “Modeling
and Analyzing Architectural Diversity of Open Platforms,” in Advanced Information
Systems Engineering, Cham, 2020.
mla: Jazayeri, Bahar, et al. “Modeling and Analyzing Architectural Diversity of
Open Platforms.” Advanced Information Systems Engineering, 2020, doi:10.1007/978-3-030-49435-3_3.
short: 'B. Jazayeri, S. Schwichtenberg, J. Küster, O. Zimmermann, G. Engels, in:
Advanced Information Systems Engineering, Cham, 2020.'
date_created: 2020-06-26T10:31:49Z
date_updated: 2022-01-06T06:53:08Z
department:
- _id: '66'
doi: 10.1007/978-3-030-49435-3_3
language:
- iso: eng
place: Cham
publication: Advanced Information Systems Engineering
publication_identifier:
isbn:
- '9783030494346'
- '9783030494353'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Modeling and Analyzing Architectural Diversity of Open Platforms
type: book_chapter
user_id: '57458'
year: '2020'
...
---
_id: '20891'
abstract:
- lang: eng
text: "Today, software systems are rarely developed monolithically, but may be composed
of numerous individually developed features. Their modularization facilitates
independent development and verification. While feature-based strategies to verify
features in isolation have existed for years, they cannot address interactions
between features. The problem with feature interactions is that they are typically
unknown and may involve any subset of the features. Contrary, a family-based verification
strategy captures feature interactions, but does not scale well when features
evolve frequently. To the best of our knowledge, there currently exists no approach
with focus on evolving features that combines both strategies and aims at eliminating
their respective drawbacks. To fill this gap, we introduce Fefalution, a feature-family-based
verification approach based on abstract contracts to verify evolving features
and their interactions. Fefalution builds partial proofs for each evolving feature
and then reuses the resulting partial proofs in verifying feature interactions,
yielding a full verification of the complete software system. Moreover, to investigate
whether a combination of both strategies is fruitful, we present the first empirical
study for the verification of evolving features implemented by means of feature-oriented
programming and by comparing Fefalution with another five family-based approaches
varying in a set of optimizations. Our results indicate that partial proofs based
on abstract contracts exhibit huge reuse potential, but also come with a substantial
overhead for smaller evolution scenarios.\r\n"
author:
- first_name: Alexander
full_name: Knüppel, Alexander
last_name: Knüppel
- first_name: Stefan
full_name: Krüger, Stefan
last_name: Krüger
- first_name: Thomas
full_name: Thüm, Thomas
last_name: Thüm
- first_name: Richard
full_name: Bubel, Richard
last_name: Bubel
- first_name: Sebastian
full_name: Krieter, Sebastian
last_name: Krieter
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
- first_name: Ina
full_name: Schaefer, Ina
last_name: Schaefer
citation:
ama: 'Knüppel A, Krüger S, Thüm T, et al. Using Abstract Contracts for Verifying
Evolving Features and Their Interactions. In: Lecture Notes in Computer Science.
; 2020. doi:10.1007/978-3-030-64354-6_5'
apa: Knüppel, A., Krüger, S., Thüm, T., Bubel, R., Krieter, S., Bodden, E., &
Schaefer, I. (2020). Using Abstract Contracts for Verifying Evolving Features
and Their Interactions. In Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-030-64354-6_5
bibtex: '@inbook{Knüppel_Krüger_Thüm_Bubel_Krieter_Bodden_Schaefer_2020, place={Cham},
title={Using Abstract Contracts for Verifying Evolving Features and Their Interactions},
DOI={10.1007/978-3-030-64354-6_5},
booktitle={Lecture Notes in Computer Science}, author={Knüppel, Alexander and
Krüger, Stefan and Thüm, Thomas and Bubel, Richard and Krieter, Sebastian and
Bodden, Eric and Schaefer, Ina}, year={2020} }'
chicago: Knüppel, Alexander, Stefan Krüger, Thomas Thüm, Richard Bubel, Sebastian
Krieter, Eric Bodden, and Ina Schaefer. “Using Abstract Contracts for Verifying
Evolving Features and Their Interactions.” In Lecture Notes in Computer Science.
Cham, 2020. https://doi.org/10.1007/978-3-030-64354-6_5.
ieee: A. Knüppel et al., “Using Abstract Contracts for Verifying Evolving
Features and Their Interactions,” in Lecture Notes in Computer Science,
Cham, 2020.
mla: Knüppel, Alexander, et al. “Using Abstract Contracts for Verifying Evolving
Features and Their Interactions.” Lecture Notes in Computer Science, 2020,
doi:10.1007/978-3-030-64354-6_5.
short: 'A. Knüppel, S. Krüger, T. Thüm, R. Bubel, S. Krieter, E. Bodden, I. Schaefer,
in: Lecture Notes in Computer Science, Cham, 2020.'
date_created: 2021-01-11T09:15:41Z
date_updated: 2022-01-06T06:54:41Z
department:
- _id: '76'
doi: 10.1007/978-3-030-64354-6_5
language:
- iso: eng
place: Cham
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783030643539'
- '9783030643546'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Using Abstract Contracts for Verifying Evolving Features and Their Interactions
type: book_chapter
user_id: '5786'
year: '2020'
...
---
_id: '18014'
author:
- first_name: Adil
full_name: El Mesaoudi-Paul, Adil
last_name: El Mesaoudi-Paul
- first_name: Dimitri
full_name: Weiß, Dimitri
last_name: Weiß
- first_name: Viktor
full_name: Bengs, Viktor
id: '76599'
last_name: Bengs
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
- first_name: Kevin
full_name: Tierney, Kevin
last_name: Tierney
citation:
ama: 'El Mesaoudi-Paul A, Weiß D, Bengs V, Hüllermeier E, Tierney K. Pool-Based
Realtime Algorithm Configuration: A Preselection Bandit Approach. In: Learning
and Intelligent Optimization. LION 2020. Vol 12096. Lecture Notes in Computer
Science. Cham: Springer; 2020:216-232. doi:10.1007/978-3-030-53552-0_22'
apa: 'El Mesaoudi-Paul, A., Weiß, D., Bengs, V., Hüllermeier, E., & Tierney,
K. (2020). Pool-Based Realtime Algorithm Configuration: A Preselection Bandit
Approach. In Learning and Intelligent Optimization. LION 2020. (Vol. 12096,
pp. 216–232). Cham: Springer. https://doi.org/10.1007/978-3-030-53552-0_22'
bibtex: '@inbook{El Mesaoudi-Paul_Weiß_Bengs_Hüllermeier_Tierney_2020, place={Cham},
series={Lecture Notes in Computer Science}, title={Pool-Based Realtime Algorithm
Configuration: A Preselection Bandit Approach}, volume={12096}, DOI={10.1007/978-3-030-53552-0_22},
booktitle={Learning and Intelligent Optimization. LION 2020.}, publisher={Springer},
author={El Mesaoudi-Paul, Adil and Weiß, Dimitri and Bengs, Viktor and Hüllermeier,
Eyke and Tierney, Kevin}, year={2020}, pages={216–232}, collection={Lecture Notes
in Computer Science} }'
chicago: 'El Mesaoudi-Paul, Adil, Dimitri Weiß, Viktor Bengs, Eyke Hüllermeier,
and Kevin Tierney. “Pool-Based Realtime Algorithm Configuration: A Preselection
Bandit Approach.” In Learning and Intelligent Optimization. LION 2020.,
12096:216–32. Lecture Notes in Computer Science. Cham: Springer, 2020. https://doi.org/10.1007/978-3-030-53552-0_22.'
ieee: 'A. El Mesaoudi-Paul, D. Weiß, V. Bengs, E. Hüllermeier, and K. Tierney, “Pool-Based
Realtime Algorithm Configuration: A Preselection Bandit Approach,” in Learning
and Intelligent Optimization. LION 2020., vol. 12096, Cham: Springer, 2020,
pp. 216–232.'
mla: 'El Mesaoudi-Paul, Adil, et al. “Pool-Based Realtime Algorithm Configuration:
A Preselection Bandit Approach.” Learning and Intelligent Optimization. LION
2020., vol. 12096, Springer, 2020, pp. 216–32, doi:10.1007/978-3-030-53552-0_22.'
short: 'A. El Mesaoudi-Paul, D. Weiß, V. Bengs, E. Hüllermeier, K. Tierney, in:
Learning and Intelligent Optimization. LION 2020., Springer, Cham, 2020, pp. 216–232.'
date_created: 2020-08-17T11:44:37Z
date_updated: 2022-01-06T06:53:25Z
department:
- _id: '34'
- _id: '7'
- _id: '355'
doi: 10.1007/978-3-030-53552-0_22
intvolume: ' 12096'
language:
- iso: eng
page: 216 - 232
place: Cham
project:
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: Learning and Intelligent Optimization. LION 2020.
publication_identifier:
isbn:
- '9783030535513'
- '9783030535520'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: 'Pool-Based Realtime Algorithm Configuration: A Preselection Bandit Approach'
type: book_chapter
user_id: '76599'
volume: 12096
year: '2020'
...
---
_id: '23377'
author:
- first_name: Goran
full_name: Piskachev, Goran
last_name: Piskachev
- first_name: Tobias
full_name: Petrasch, Tobias
last_name: Petrasch
- first_name: Johannes
full_name: Späth, Johannes
last_name: Späth
- first_name: Eric
full_name: Bodden, Eric
last_name: Bodden
citation:
ama: 'Piskachev G, Petrasch T, Späth J, Bodden E. AuthCheck: Program-State Analysis
for Access-Control Vulnerabilities. In: Lecture Notes in Computer Science.
; 2020. doi:10.1007/978-3-030-54997-8_34'
apa: 'Piskachev, G., Petrasch, T., Späth, J., & Bodden, E. (2020). AuthCheck:
Program-State Analysis for Access-Control Vulnerabilities. In Lecture Notes
in Computer Science. https://doi.org/10.1007/978-3-030-54997-8_34'
bibtex: '@inbook{Piskachev_Petrasch_Späth_Bodden_2020, place={Cham}, title={AuthCheck:
Program-State Analysis for Access-Control Vulnerabilities}, DOI={10.1007/978-3-030-54997-8_34},
booktitle={Lecture Notes in Computer Science}, author={Piskachev, Goran and Petrasch,
Tobias and Späth, Johannes and Bodden, Eric}, year={2020} }'
chicago: 'Piskachev, Goran, Tobias Petrasch, Johannes Späth, and Eric Bodden. “AuthCheck:
Program-State Analysis for Access-Control Vulnerabilities.” In Lecture Notes
in Computer Science. Cham, 2020. https://doi.org/10.1007/978-3-030-54997-8_34.'
ieee: 'G. Piskachev, T. Petrasch, J. Späth, and E. Bodden, “AuthCheck: Program-State
Analysis for Access-Control Vulnerabilities,” in Lecture Notes in Computer
Science, Cham, 2020.'
mla: 'Piskachev, Goran, et al. “AuthCheck: Program-State Analysis for Access-Control
Vulnerabilities.” Lecture Notes in Computer Science, 2020, doi:10.1007/978-3-030-54997-8_34.'
short: 'G. Piskachev, T. Petrasch, J. Späth, E. Bodden, in: Lecture Notes in Computer
Science, Cham, 2020.'
date_created: 2021-08-09T12:05:09Z
date_updated: 2022-01-06T06:55:50Z
department:
- _id: '241'
- _id: '662'
- _id: '76'
doi: 10.1007/978-3-030-54997-8_34
language:
- iso: eng
place: Cham
publication: Lecture Notes in Computer Science
publication_identifier:
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: 'AuthCheck: Program-State Analysis for Access-Control Vulnerabilities'
type: book_chapter
user_id: '5786'
year: '2020'
...
---
_id: '17084'
author:
- first_name: Nils
full_name: Weidmann, Nils
id: '53103'
last_name: Weidmann
- first_name: Anthony
full_name: Anjorin, Anthony
last_name: Anjorin
citation:
ama: 'Weidmann N, Anjorin A. Schema Compliant Consistency Management via Triple
Graph Grammars and Integer Linear Programming. In: Wehrheim H, Cabot J, eds. Proceedings
of the 23rd International Conference on Fundamental Approaches to Software Engineering,
FASE 2020. Cham: Springer; 2020. doi:10.1007/978-3-030-45234-6_16'
apa: 'Weidmann, N., & Anjorin, A. (2020). Schema Compliant Consistency Management
via Triple Graph Grammars and Integer Linear Programming. In H. Wehrheim &
J. Cabot (Eds.), Proceedings of the 23rd International Conference on Fundamental
Approaches to Software Engineering, FASE 2020. Cham: Springer. https://doi.org/10.1007/978-3-030-45234-6_16'
bibtex: '@inproceedings{Weidmann_Anjorin_2020, place={Cham}, title={Schema Compliant
Consistency Management via Triple Graph Grammars and Integer Linear Programming},
DOI={10.1007/978-3-030-45234-6_16},
booktitle={Proceedings of the 23rd International Conference on Fundamental Approaches
to Software Engineering, FASE 2020}, publisher={Springer}, author={Weidmann, Nils
and Anjorin, Anthony}, editor={Wehrheim, Heike and Cabot, JordiEditors}, year={2020}
}'
chicago: 'Weidmann, Nils, and Anthony Anjorin. “Schema Compliant Consistency Management
via Triple Graph Grammars and Integer Linear Programming.” In Proceedings of
the 23rd International Conference on Fundamental Approaches to Software Engineering,
FASE 2020, edited by Heike Wehrheim and Jordi Cabot. Cham: Springer, 2020.
https://doi.org/10.1007/978-3-030-45234-6_16.'
ieee: N. Weidmann and A. Anjorin, “Schema Compliant Consistency Management via Triple
Graph Grammars and Integer Linear Programming,” in Proceedings of the 23rd
International Conference on Fundamental Approaches to Software Engineering, FASE
2020, Dublin, Ireland, 2020.
mla: Weidmann, Nils, and Anthony Anjorin. “Schema Compliant Consistency Management
via Triple Graph Grammars and Integer Linear Programming.” Proceedings of the
23rd International Conference on Fundamental Approaches to Software Engineering,
FASE 2020, edited by Heike Wehrheim and Jordi Cabot, Springer, 2020, doi:10.1007/978-3-030-45234-6_16.
short: 'N. Weidmann, A. Anjorin, in: H. Wehrheim, J. Cabot (Eds.), Proceedings of
the 23rd International Conference on Fundamental Approaches to Software Engineering,
FASE 2020, Springer, Cham, 2020.'
conference:
end_date: 2020-04-30
location: Dublin, Ireland
name: Fundamental Approaches to Software Engineering - 23rd International Conference,
FASE 2020
start_date: 2020-04-25
date_created: 2020-06-06T09:50:42Z
date_updated: 2022-01-06T06:53:04Z
department:
- _id: '28'
- _id: '66'
- _id: '534'
doi: 10.1007/978-3-030-45234-6_16
editor:
- first_name: Heike
full_name: Wehrheim, Heike
last_name: Wehrheim
- first_name: Jordi
full_name: Cabot, Jordi
last_name: Cabot
language:
- iso: eng
place: Cham
publication: Proceedings of the 23rd International Conference on Fundamental Approaches
to Software Engineering, FASE 2020
publication_identifier:
isbn:
- '9783030452339'
- '9783030452346'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer
status: public
title: Schema Compliant Consistency Management via Triple Graph Grammars and Integer
Linear Programming
type: conference
user_id: '53103'
year: '2020'
...
---
_id: '17085'
author:
- first_name: Bahar
full_name: Schwichtenberg, Bahar
id: '36399'
last_name: Schwichtenberg
- first_name: Simon
full_name: Schwichtenberg, Simon
id: '13235'
last_name: Schwichtenberg
- first_name: Jochen
full_name: Küster, Jochen
last_name: Küster
- first_name: Olaf
full_name: Zimmermann, Olaf
last_name: Zimmermann
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'Schwichtenberg B, Schwichtenberg S, Küster J, Zimmermann O, Engels G. Modeling
and Analyzing Architectural Diversity of Open Platforms. In: Advanced Information
Systems Engineering. Cham; 2020. doi:10.1007/978-3-030-49435-3_3'
apa: Schwichtenberg, B., Schwichtenberg, S., Küster, J., Zimmermann, O., & Engels,
G. (2020). Modeling and Analyzing Architectural Diversity of Open Platforms. In
Advanced Information Systems Engineering. Cham. https://doi.org/10.1007/978-3-030-49435-3_3
bibtex: '@inproceedings{Schwichtenberg_Schwichtenberg_Küster_Zimmermann_Engels_2020,
place={Cham}, title={Modeling and Analyzing Architectural Diversity of Open Platforms},
DOI={10.1007/978-3-030-49435-3_3},
booktitle={Advanced Information Systems Engineering}, author={Schwichtenberg,
Bahar and Schwichtenberg, Simon and Küster, Jochen and Zimmermann, Olaf and Engels,
Gregor}, year={2020} }'
chicago: Schwichtenberg, Bahar, Simon Schwichtenberg, Jochen Küster, Olaf Zimmermann,
and Gregor Engels. “Modeling and Analyzing Architectural Diversity of Open Platforms.”
In Advanced Information Systems Engineering. Cham, 2020. https://doi.org/10.1007/978-3-030-49435-3_3.
ieee: B. Schwichtenberg, S. Schwichtenberg, J. Küster, O. Zimmermann, and G. Engels,
“Modeling and Analyzing Architectural Diversity of Open Platforms,” in Advanced
Information Systems Engineering, 2020.
mla: Schwichtenberg, Bahar, et al. “Modeling and Analyzing Architectural Diversity
of Open Platforms.” Advanced Information Systems Engineering, 2020, doi:10.1007/978-3-030-49435-3_3.
short: 'B. Schwichtenberg, S. Schwichtenberg, J. Küster, O. Zimmermann, G. Engels,
in: Advanced Information Systems Engineering, Cham, 2020.'
date_created: 2020-06-07T08:53:10Z
date_updated: 2022-01-06T06:53:04Z
doi: 10.1007/978-3-030-49435-3_3
language:
- iso: eng
place: Cham
publication: Advanced Information Systems Engineering
publication_identifier:
isbn:
- '9783030494346'
- '9783030494353'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Modeling and Analyzing Architectural Diversity of Open Platforms
type: conference
user_id: '36399'
year: '2020'
...
---
_id: '28997'
abstract:
- lang: eng
text: "Modern cryptographic protocols, such as TLS 1.3 and QUIC, can send cryptographically
protected data in “zero round-trip times (0-RTT)”, that is, without the need for
a prior interactive handshake. Such protocols meet the demand for communication
with minimal latency, but those currently deployed in practice achieve only rather
weak security properties, as they may not achieve forward security for the first
transmitted payload message and require additional countermeasures against replay
attacks.Recently, 0-RTT protocols with full forward security and replay resilience
have been proposed in the academic literature. These are based on puncturable
encryption, which uses rather heavy building blocks, such as cryptographic pairings.
Some constructions were claimed to have practical efficiency, but it is unclear
how they compare concretely to protocols deployed in practice, and we currently
do not have any benchmark results that new protocols can be compared with.We provide
the first concrete performance analysis of a modern 0-RTT protocol with full forward
security, by integrating the Bloom Filter Encryption scheme of Derler et al. (EUROCRYPT
2018) in the Chromium QUIC implementation and comparing it to Google’s original
QUIC protocol. We find that for reasonable deployment parameters, the server CPU
load increases approximately by a factor of eight and the memory consumption on
the server increases significantly, but stays below 400 MB even for medium-scale
deployments that handle up to 50K connections per day. The difference of
the size of handshake messages is small enough that transmission time on the network
is identical, and therefore not significant.We conclude that while current 0-RTT
protocols with full forward security come with significant computational overhead,
their use in practice is feasible, and may be used in applications where the increased
CPU and memory load can be tolerated in exchange for full forward security and
replay resilience on the cryptographic protocol level. Our results serve as a
first benchmark that can be used to assess the efficiency of 0-RTT protocols potentially
developed in the future.\r\n"
author:
- first_name: Fynn
full_name: Dallmeier, Fynn
last_name: Dallmeier
- first_name: Jan P.
full_name: Drees, Jan P.
last_name: Drees
- first_name: Kai
full_name: Gellert, Kai
last_name: Gellert
- first_name: Tobias
full_name: Handirk, Tobias
last_name: Handirk
- first_name: Tibor
full_name: Jager, Tibor
last_name: Jager
- first_name: Jonas
full_name: Klauke, Jonas
id: '40915'
last_name: Klauke
orcid: 0000-0001-9160-9636
- first_name: Simon
full_name: Nachtigall, Simon
last_name: Nachtigall
- first_name: Timo
full_name: Renzelmann, Timo
last_name: Renzelmann
- first_name: Rudi
full_name: Wolf, Rudi
last_name: Wolf
citation:
ama: 'Dallmeier F, Drees JP, Gellert K, et al. Forward-Secure 0-RTT Goes Live: Implementation
and Performance Analysis in QUIC. In: Cryptology and Network Security.
Springer-Verlag; 2020:211-231. doi:10.1007/978-3-030-65411-5_11'
apa: 'Dallmeier, F., Drees, J. P., Gellert, K., Handirk, T., Jager, T., Klauke,
J., Nachtigall, S., Renzelmann, T., & Wolf, R. (2020). Forward-Secure 0-RTT
Goes Live: Implementation and Performance Analysis in QUIC. Cryptology and
Network Security, 211–231. https://doi.org/10.1007/978-3-030-65411-5_11'
bibtex: '@inproceedings{Dallmeier_Drees_Gellert_Handirk_Jager_Klauke_Nachtigall_Renzelmann_Wolf_2020,
place={Cham}, title={Forward-Secure 0-RTT Goes Live: Implementation and Performance
Analysis in QUIC}, DOI={10.1007/978-3-030-65411-5_11},
booktitle={Cryptology and Network Security}, publisher={Springer-Verlag}, author={Dallmeier,
Fynn and Drees, Jan P. and Gellert, Kai and Handirk, Tobias and Jager, Tibor and
Klauke, Jonas and Nachtigall, Simon and Renzelmann, Timo and Wolf, Rudi}, year={2020},
pages={211–231} }'
chicago: 'Dallmeier, Fynn, Jan P. Drees, Kai Gellert, Tobias Handirk, Tibor Jager,
Jonas Klauke, Simon Nachtigall, Timo Renzelmann, and Rudi Wolf. “Forward-Secure
0-RTT Goes Live: Implementation and Performance Analysis in QUIC.” In Cryptology
and Network Security, 211–31. Cham: Springer-Verlag, 2020. https://doi.org/10.1007/978-3-030-65411-5_11.'
ieee: 'F. Dallmeier et al., “Forward-Secure 0-RTT Goes Live: Implementation
and Performance Analysis in QUIC,” in Cryptology and Network Security,
Vienna, 2020, pp. 211–231, doi: 10.1007/978-3-030-65411-5_11.'
mla: 'Dallmeier, Fynn, et al. “Forward-Secure 0-RTT Goes Live: Implementation and
Performance Analysis in QUIC.” Cryptology and Network Security, Springer-Verlag,
2020, pp. 211–31, doi:10.1007/978-3-030-65411-5_11.'
short: 'F. Dallmeier, J.P. Drees, K. Gellert, T. Handirk, T. Jager, J. Klauke, S.
Nachtigall, T. Renzelmann, R. Wolf, in: Cryptology and Network Security, Springer-Verlag,
Cham, 2020, pp. 211–231.'
conference:
end_date: 2020-12-16
location: Vienna
name: CANS 2020
start_date: 2020-12-14
date_created: 2021-12-15T17:43:11Z
date_updated: 2022-03-11T10:59:41Z
doi: 10.1007/978-3-030-65411-5_11
extern: '1'
language:
- iso: eng
page: 211-231
place: Cham
publication: Cryptology and Network Security
publication_identifier:
isbn:
- '9783030654108'
- '9783030654115'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer-Verlag
status: public
title: 'Forward-Secure 0-RTT Goes Live: Implementation and Performance Analysis in
QUIC'
type: conference
user_id: '40915'
year: '2020'
...
---
_id: '20706'
author:
- first_name: Philipp
full_name: zur Heiden, Philipp
last_name: zur Heiden
citation:
ama: 'zur Heiden P. Considering Context in Design Science Research: A Systematic
Literature Review. In: Designing for Digital Transformation. Co-Creating Services
with Citizens and Industry. ; 2020. doi:10.1007/978-3-030-64823-7_21'
apa: 'zur Heiden, P. (2020). Considering Context in Design Science Research: A Systematic
Literature Review. Designing for Digital Transformation. Co-Creating Services
with Citizens and Industry. https://doi.org/10.1007/978-3-030-64823-7_21'
bibtex: '@inproceedings{zur Heiden_2020, place={Cham}, title={Considering Context
in Design Science Research: A Systematic Literature Review}, DOI={10.1007/978-3-030-64823-7_21},
booktitle={Designing for Digital Transformation. Co-Creating Services with Citizens
and Industry}, author={zur Heiden, Philipp}, year={2020} }'
chicago: 'Heiden, Philipp zur. “Considering Context in Design Science Research:
A Systematic Literature Review.” In Designing for Digital Transformation. Co-Creating
Services with Citizens and Industry. Cham, 2020. https://doi.org/10.1007/978-3-030-64823-7_21.'
ieee: 'P. zur Heiden, “Considering Context in Design Science Research: A Systematic
Literature Review,” 2020, doi: 10.1007/978-3-030-64823-7_21.'
mla: 'zur Heiden, Philipp. “Considering Context in Design Science Research: A Systematic
Literature Review.” Designing for Digital Transformation. Co-Creating Services
with Citizens and Industry, 2020, doi:10.1007/978-3-030-64823-7_21.'
short: 'P. zur Heiden, in: Designing for Digital Transformation. Co-Creating Services
with Citizens and Industry, Cham, 2020.'
date_created: 2020-12-11T14:01:48Z
date_updated: 2022-04-04T09:59:49Z
doi: 10.1007/978-3-030-64823-7_21
language:
- iso: eng
place: Cham
publication: Designing for Digital Transformation. Co-Creating Services with Citizens
and Industry
publication_identifier:
isbn:
- '9783030648220'
- '9783030648237'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: 'Considering Context in Design Science Research: A Systematic Literature Review'
type: conference
user_id: '64394'
year: '2020'
...
---
_id: '45848'
author:
- first_name: Yasir
full_name: Mahmood, Yasir
last_name: Mahmood
- first_name: Arne
full_name: Meier, Arne
last_name: Meier
citation:
ama: 'Mahmood Y, Meier A. Parameterised Complexity of Model Checking and Satisfiability
in Propositional Dependence Logic. In: Lecture Notes in Computer Science.
Springer International Publishing; 2020. doi:10.1007/978-3-030-39951-1_10'
apa: Mahmood, Y., & Meier, A. (2020). Parameterised Complexity of Model Checking
and Satisfiability in Propositional Dependence Logic. Lecture Notes in Computer
Science. https://doi.org/10.1007/978-3-030-39951-1_10
bibtex: '@inproceedings{Mahmood_Meier_2020, place={Cham}, title={Parameterised Complexity
of Model Checking and Satisfiability in Propositional Dependence Logic}, DOI={10.1007/978-3-030-39951-1_10},
booktitle={Lecture Notes in Computer Science}, publisher={Springer International
Publishing}, author={Mahmood, Yasir and Meier, Arne}, year={2020} }'
chicago: 'Mahmood, Yasir, and Arne Meier. “Parameterised Complexity of Model Checking
and Satisfiability in Propositional Dependence Logic.” In Lecture Notes in
Computer Science. Cham: Springer International Publishing, 2020. https://doi.org/10.1007/978-3-030-39951-1_10.'
ieee: 'Y. Mahmood and A. Meier, “Parameterised Complexity of Model Checking and
Satisfiability in Propositional Dependence Logic,” 2020, doi: 10.1007/978-3-030-39951-1_10.'
mla: Mahmood, Yasir, and Arne Meier. “Parameterised Complexity of Model Checking
and Satisfiability in Propositional Dependence Logic.” Lecture Notes in Computer
Science, Springer International Publishing, 2020, doi:10.1007/978-3-030-39951-1_10.
short: 'Y. Mahmood, A. Meier, in: Lecture Notes in Computer Science, Springer International
Publishing, Cham, 2020.'
date_created: 2023-07-03T11:41:58Z
date_updated: 2023-07-03T11:43:37Z
doi: 10.1007/978-3-030-39951-1_10
language:
- iso: eng
place: Cham
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783030399504'
- '9783030399511'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: Parameterised Complexity of Model Checking and Satisfiability in Propositional
Dependence Logic
type: conference
user_id: '99353'
year: '2020'
...
---
_id: '47261'
author:
- first_name: Julie M.
full_name: Haney, Julie M.
last_name: Haney
- first_name: Susanne M.
full_name: Furman, Susanne M.
last_name: Furman
- first_name: Yasemin
full_name: Acar, Yasemin
id: '94636'
last_name: Acar
citation:
ama: 'Haney JM, Furman SM, Acar Y. Smart Home Security and Privacy Mitigations:
Consumer Perceptions, Practices, and Challenges. In: HCI for Cybersecurity,
Privacy and Trust. Springer International Publishing; 2020. doi:10.1007/978-3-030-50309-3_26'
apa: 'Haney, J. M., Furman, S. M., & Acar, Y. (2020). Smart Home Security and
Privacy Mitigations: Consumer Perceptions, Practices, and Challenges. In HCI
for Cybersecurity, Privacy and Trust. Springer International Publishing. https://doi.org/10.1007/978-3-030-50309-3_26'
bibtex: '@inbook{Haney_Furman_Acar_2020, place={Cham}, title={Smart Home Security
and Privacy Mitigations: Consumer Perceptions, Practices, and Challenges}, DOI={10.1007/978-3-030-50309-3_26},
booktitle={HCI for Cybersecurity, Privacy and Trust}, publisher={Springer International
Publishing}, author={Haney, Julie M. and Furman, Susanne M. and Acar, Yasemin},
year={2020} }'
chicago: 'Haney, Julie M., Susanne M. Furman, and Yasemin Acar. “Smart Home Security
and Privacy Mitigations: Consumer Perceptions, Practices, and Challenges.” In
HCI for Cybersecurity, Privacy and Trust. Cham: Springer International
Publishing, 2020. https://doi.org/10.1007/978-3-030-50309-3_26.'
ieee: 'J. M. Haney, S. M. Furman, and Y. Acar, “Smart Home Security and Privacy
Mitigations: Consumer Perceptions, Practices, and Challenges,” in HCI for Cybersecurity,
Privacy and Trust, Cham: Springer International Publishing, 2020.'
mla: 'Haney, Julie M., et al. “Smart Home Security and Privacy Mitigations: Consumer
Perceptions, Practices, and Challenges.” HCI for Cybersecurity, Privacy and
Trust, Springer International Publishing, 2020, doi:10.1007/978-3-030-50309-3_26.'
short: 'J.M. Haney, S.M. Furman, Y. Acar, in: HCI for Cybersecurity, Privacy and
Trust, Springer International Publishing, Cham, 2020.'
date_created: 2023-09-22T12:59:53Z
date_updated: 2023-11-22T09:57:52Z
department:
- _id: '34'
- _id: '740'
doi: 10.1007/978-3-030-50309-3_26
extern: '1'
language:
- iso: eng
place: Cham
publication: HCI for Cybersecurity, Privacy and Trust
publication_identifier:
isbn:
- '9783030503086'
- '9783030503093'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: 'Smart Home Security and Privacy Mitigations: Consumer Perceptions, Practices,
and Challenges'
type: book_chapter
user_id: '15458'
year: '2020'
...
---
_id: '11952'
author:
- first_name: Björn
full_name: Senft, Björn
id: '9109'
last_name: Senft
- first_name: Florian
full_name: Rittmeier, Florian
id: '5281'
last_name: Rittmeier
- first_name: Holger Gerhard
full_name: Fischer, Holger Gerhard
id: '30457'
last_name: Fischer
- first_name: Simon
full_name: Oberthür, Simon
id: '383'
last_name: Oberthür
citation:
ama: 'Senft B, Rittmeier F, Fischer HG, Oberthür S. A Value-Centered Approach for
Unique and Novel Software Applications. In: Design, User Experience, and Usability.
Practice and Case Studies. Cham; 2019. doi:10.1007/978-3-030-23535-2_27'
apa: Senft, B., Rittmeier, F., Fischer, H. G., & Oberthür, S. (2019). A Value-Centered
Approach for Unique and Novel Software Applications. In Design, User Experience,
and Usability. Practice and Case Studies. Cham. https://doi.org/10.1007/978-3-030-23535-2_27
bibtex: '@inbook{Senft_Rittmeier_Fischer_Oberthür_2019, place={Cham}, title={A Value-Centered
Approach for Unique and Novel Software Applications}, DOI={10.1007/978-3-030-23535-2_27},
booktitle={Design, User Experience, and Usability. Practice and Case Studies},
author={Senft, Björn and Rittmeier, Florian and Fischer, Holger Gerhard and Oberthür,
Simon}, year={2019} }'
chicago: Senft, Björn, Florian Rittmeier, Holger Gerhard Fischer, and Simon Oberthür.
“A Value-Centered Approach for Unique and Novel Software Applications.” In Design,
User Experience, and Usability. Practice and Case Studies. Cham, 2019. https://doi.org/10.1007/978-3-030-23535-2_27.
ieee: B. Senft, F. Rittmeier, H. G. Fischer, and S. Oberthür, “A Value-Centered
Approach for Unique and Novel Software Applications,” in Design, User Experience,
and Usability. Practice and Case Studies, Cham, 2019.
mla: Senft, Björn, et al. “A Value-Centered Approach for Unique and Novel Software
Applications.” Design, User Experience, and Usability. Practice and Case Studies,
2019, doi:10.1007/978-3-030-23535-2_27.
short: 'B. Senft, F. Rittmeier, H.G. Fischer, S. Oberthür, in: Design, User Experience,
and Usability. Practice and Case Studies, Cham, 2019.'
conference:
end_date: 2019-07-31
location: Orlando, FL, USA
name: 21st International Conference on Human-Computer Interaction
start_date: 2019-07-26
date_created: 2019-07-14T07:57:53Z
date_updated: 2022-01-06T06:51:13Z
department:
- _id: '66'
doi: 10.1007/978-3-030-23535-2_27
language:
- iso: eng
place: Cham
publication: Design, User Experience, and Usability. Practice and Case Studies
publication_identifier:
isbn:
- '9783030235345'
- '9783030235352'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: A Value-Centered Approach for Unique and Novel Software Applications
type: book_chapter
user_id: '9109'
year: '2019'
...
---
_id: '14890'
author:
- first_name: Stefan
full_name: Kuhlemann, Stefan
id: '38910'
last_name: Kuhlemann
- first_name: Meinolf
full_name: Sellmann, Meinolf
last_name: Sellmann
- first_name: Kevin
full_name: Tierney, Kevin
last_name: Tierney
citation:
ama: 'Kuhlemann S, Sellmann M, Tierney K. Exploiting Counterfactuals for Scalable
Stochastic Optimization. In: Lecture Notes in Computer Science. Cham; 2019.
doi:10.1007/978-3-030-30048-7_40'
apa: Kuhlemann, S., Sellmann, M., & Tierney, K. (2019). Exploiting Counterfactuals
for Scalable Stochastic Optimization. In Lecture Notes in Computer Science.
Cham. https://doi.org/10.1007/978-3-030-30048-7_40
bibtex: '@inbook{Kuhlemann_Sellmann_Tierney_2019, place={Cham}, title={Exploiting
Counterfactuals for Scalable Stochastic Optimization}, DOI={10.1007/978-3-030-30048-7_40},
booktitle={Lecture Notes in Computer Science}, author={Kuhlemann, Stefan and Sellmann,
Meinolf and Tierney, Kevin}, year={2019} }'
chicago: Kuhlemann, Stefan, Meinolf Sellmann, and Kevin Tierney. “Exploiting Counterfactuals
for Scalable Stochastic Optimization.” In Lecture Notes in Computer Science.
Cham, 2019. https://doi.org/10.1007/978-3-030-30048-7_40.
ieee: S. Kuhlemann, M. Sellmann, and K. Tierney, “Exploiting Counterfactuals for
Scalable Stochastic Optimization,” in Lecture Notes in Computer Science,
Cham, 2019.
mla: Kuhlemann, Stefan, et al. “Exploiting Counterfactuals for Scalable Stochastic
Optimization.” Lecture Notes in Computer Science, 2019, doi:10.1007/978-3-030-30048-7_40.
short: 'S. Kuhlemann, M. Sellmann, K. Tierney, in: Lecture Notes in Computer Science,
Cham, 2019.'
date_created: 2019-11-12T07:45:53Z
date_updated: 2022-01-06T06:52:09Z
department:
- _id: '277'
doi: 10.1007/978-3-030-30048-7_40
language:
- iso: eng
place: Cham
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783030300470'
- '9783030300487'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Exploiting Counterfactuals for Scalable Stochastic Optimization
type: book_chapter
user_id: '38910'
year: '2019'
...
---
_id: '15004'
author:
- first_name: Mohsen
full_name: Ahmadi Fahandar, Mohsen
id: '59547'
last_name: Ahmadi Fahandar
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
citation:
ama: 'Ahmadi Fahandar M, Hüllermeier E. Feature Selection for Analogy-Based Learning
to Rank. In: Discovery Science. Cham; 2019. doi:10.1007/978-3-030-33778-0_22'
apa: Ahmadi Fahandar, M., & Hüllermeier, E. (2019). Feature Selection for Analogy-Based
Learning to Rank. In Discovery Science. Cham. https://doi.org/10.1007/978-3-030-33778-0_22
bibtex: '@inbook{Ahmadi Fahandar_Hüllermeier_2019, place={Cham}, title={Feature
Selection for Analogy-Based Learning to Rank}, DOI={10.1007/978-3-030-33778-0_22},
booktitle={Discovery Science}, author={Ahmadi Fahandar, Mohsen and Hüllermeier,
Eyke}, year={2019} }'
chicago: Ahmadi Fahandar, Mohsen, and Eyke Hüllermeier. “Feature Selection for Analogy-Based
Learning to Rank.” In Discovery Science. Cham, 2019. https://doi.org/10.1007/978-3-030-33778-0_22.
ieee: M. Ahmadi Fahandar and E. Hüllermeier, “Feature Selection for Analogy-Based
Learning to Rank,” in Discovery Science, Cham, 2019.
mla: Ahmadi Fahandar, Mohsen, and Eyke Hüllermeier. “Feature Selection for Analogy-Based
Learning to Rank.” Discovery Science, 2019, doi:10.1007/978-3-030-33778-0_22.
short: 'M. Ahmadi Fahandar, E. Hüllermeier, in: Discovery Science, Cham, 2019.'
date_created: 2019-11-15T10:24:45Z
date_updated: 2022-01-06T06:52:14Z
department:
- _id: '34'
- _id: '355'
doi: 10.1007/978-3-030-33778-0_22
language:
- iso: eng
place: Cham
publication: Discovery Science
publication_identifier:
isbn:
- '9783030337773'
- '9783030337780'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Feature Selection for Analogy-Based Learning to Rank
type: book_chapter
user_id: '315'
year: '2019'
...
---
_id: '15005'
author:
- first_name: Mohsen
full_name: Ahmadi Fahandar, Mohsen
id: '59547'
last_name: Ahmadi Fahandar
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
citation:
ama: 'Ahmadi Fahandar M, Hüllermeier E. Analogy-Based Preference Learning with Kernels.
In: KI 2019: Advances in Artificial Intelligence. Cham; 2019. doi:10.1007/978-3-030-30179-8_3'
apa: 'Ahmadi Fahandar, M., & Hüllermeier, E. (2019). Analogy-Based Preference
Learning with Kernels. In KI 2019: Advances in Artificial Intelligence.
Cham. https://doi.org/10.1007/978-3-030-30179-8_3'
bibtex: '@inbook{Ahmadi Fahandar_Hüllermeier_2019, place={Cham}, title={Analogy-Based
Preference Learning with Kernels}, DOI={10.1007/978-3-030-30179-8_3},
booktitle={KI 2019: Advances in Artificial Intelligence}, author={Ahmadi Fahandar,
Mohsen and Hüllermeier, Eyke}, year={2019} }'
chicago: 'Ahmadi Fahandar, Mohsen, and Eyke Hüllermeier. “Analogy-Based Preference
Learning with Kernels.” In KI 2019: Advances in Artificial Intelligence.
Cham, 2019. https://doi.org/10.1007/978-3-030-30179-8_3.'
ieee: 'M. Ahmadi Fahandar and E. Hüllermeier, “Analogy-Based Preference Learning
with Kernels,” in KI 2019: Advances in Artificial Intelligence, Cham, 2019.'
mla: 'Ahmadi Fahandar, Mohsen, and Eyke Hüllermeier. “Analogy-Based Preference Learning
with Kernels.” KI 2019: Advances in Artificial Intelligence, 2019, doi:10.1007/978-3-030-30179-8_3.'
short: 'M. Ahmadi Fahandar, E. Hüllermeier, in: KI 2019: Advances in Artificial
Intelligence, Cham, 2019.'
date_created: 2019-11-15T10:30:10Z
date_updated: 2022-01-06T06:52:14Z
department:
- _id: '34'
- _id: '355'
doi: 10.1007/978-3-030-30179-8_3
language:
- iso: eng
place: Cham
publication: 'KI 2019: Advances in Artificial Intelligence'
publication_identifier:
isbn:
- '9783030301781'
- '9783030301798'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Analogy-Based Preference Learning with Kernels
type: book_chapter
user_id: '315'
year: '2019'
...
---
_id: '15006'
author:
- first_name: Vu-Linh
full_name: Nguyen, Vu-Linh
last_name: Nguyen
- first_name: Sébastien
full_name: Destercke, Sébastien
last_name: Destercke
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
citation:
ama: 'Nguyen V-L, Destercke S, Hüllermeier E. Epistemic Uncertainty Sampling. In:
Discovery Science. Cham; 2019. doi:10.1007/978-3-030-33778-0_7'
apa: Nguyen, V.-L., Destercke, S., & Hüllermeier, E. (2019). Epistemic Uncertainty
Sampling. In Discovery Science. Cham. https://doi.org/10.1007/978-3-030-33778-0_7
bibtex: '@inbook{Nguyen_Destercke_Hüllermeier_2019, place={Cham}, title={Epistemic
Uncertainty Sampling}, DOI={10.1007/978-3-030-33778-0_7},
booktitle={Discovery Science}, author={Nguyen, Vu-Linh and Destercke, Sébastien
and Hüllermeier, Eyke}, year={2019} }'
chicago: Nguyen, Vu-Linh, Sébastien Destercke, and Eyke Hüllermeier. “Epistemic
Uncertainty Sampling.” In Discovery Science. Cham, 2019. https://doi.org/10.1007/978-3-030-33778-0_7.
ieee: V.-L. Nguyen, S. Destercke, and E. Hüllermeier, “Epistemic Uncertainty Sampling,”
in Discovery Science, Cham, 2019.
mla: Nguyen, Vu-Linh, et al. “Epistemic Uncertainty Sampling.” Discovery Science,
2019, doi:10.1007/978-3-030-33778-0_7.
short: 'V.-L. Nguyen, S. Destercke, E. Hüllermeier, in: Discovery Science, Cham,
2019.'
date_created: 2019-11-15T10:35:08Z
date_updated: 2022-01-06T06:52:14Z
department:
- _id: '34'
- _id: '355'
doi: 10.1007/978-3-030-33778-0_7
language:
- iso: eng
place: Cham
publication: Discovery Science
publication_identifier:
isbn:
- '9783030337773'
- '9783030337780'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Epistemic Uncertainty Sampling
type: book_chapter
user_id: '49109'
year: '2019'
...
---
_id: '15080'
author:
- first_name: Rita
full_name: Hartel, Rita
id: '14961'
last_name: Hartel
- first_name: Alexander
full_name: Dunst, Alexander
last_name: Dunst
citation:
ama: 'Hartel R, Dunst A. How Good Is Good Enough? Establishing Quality Thresholds
for the Automatic Text Analysis of Retro-Digitized Comics. In: International
Conference on Multimedia Modeling, MMM. Springer; 2019:662-671. doi:10.1007/978-3-030-05716-9_59'
apa: 'Hartel, R., & Dunst, A. (2019). How Good Is Good Enough? Establishing
Quality Thresholds for the Automatic Text Analysis of Retro-Digitized Comics.
In International Conference on Multimedia Modeling, MMM (pp. 662–671).
Thessaloniki, Greece: Springer. https://doi.org/10.1007/978-3-030-05716-9_59'
bibtex: '@inproceedings{Hartel_Dunst_2019, title={How Good Is Good Enough? Establishing
Quality Thresholds for the Automatic Text Analysis of Retro-Digitized Comics},
DOI={10.1007/978-3-030-05716-9_59},
booktitle={International Conference on Multimedia Modeling, MMM}, publisher={Springer},
author={Hartel, Rita and Dunst, Alexander}, year={2019}, pages={662–671} }'
chicago: Hartel, Rita, and Alexander Dunst. “How Good Is Good Enough? Establishing
Quality Thresholds for the Automatic Text Analysis of Retro-Digitized Comics.”
In International Conference on Multimedia Modeling, MMM, 662–71. Springer,
2019. https://doi.org/10.1007/978-3-030-05716-9_59.
ieee: R. Hartel and A. Dunst, “How Good Is Good Enough? Establishing Quality Thresholds
for the Automatic Text Analysis of Retro-Digitized Comics,” in International
Conference on Multimedia Modeling, MMM, Thessaloniki, Greece, 2019, pp. 662–671.
mla: Hartel, Rita, and Alexander Dunst. “How Good Is Good Enough? Establishing Quality
Thresholds for the Automatic Text Analysis of Retro-Digitized Comics.” International
Conference on Multimedia Modeling, MMM, Springer, 2019, pp. 662–71, doi:10.1007/978-3-030-05716-9_59.
short: 'R. Hartel, A. Dunst, in: International Conference on Multimedia Modeling,
MMM, Springer, 2019, pp. 662–671.'
conference:
location: Thessaloniki, Greece
date_created: 2019-11-21T14:42:25Z
date_updated: 2022-01-06T06:52:15Z
department:
- _id: '69'
doi: 10.1007/978-3-030-05716-9_59
language:
- iso: eng
page: 662-671
publication: International Conference on Multimedia Modeling, MMM
publication_identifier:
isbn:
- '9783030057152'
- '9783030057169'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer
status: public
title: How Good Is Good Enough? Establishing Quality Thresholds for the Automatic
Text Analysis of Retro-Digitized Comics
type: conference
user_id: '14961'
year: '2019'
...
---
_id: '13872'
author:
- first_name: Dirk
full_name: Beyer, Dirk
last_name: Beyer
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
citation:
ama: 'Beyer D, Jakobs M-C. CoVeriTest: Cooperative Verifier-Based Testing. In: Fundamental
Approaches to Software Engineering. Cham; 2019. doi:10.1007/978-3-030-16722-6_23'
apa: 'Beyer, D., & Jakobs, M.-C. (2019). CoVeriTest: Cooperative Verifier-Based
Testing. In Fundamental Approaches to Software Engineering. Cham. https://doi.org/10.1007/978-3-030-16722-6_23'
bibtex: '@inbook{Beyer_Jakobs_2019, place={Cham}, title={CoVeriTest: Cooperative
Verifier-Based Testing}, DOI={10.1007/978-3-030-16722-6_23},
booktitle={Fundamental Approaches to Software Engineering}, author={Beyer, Dirk
and Jakobs, Marie-Christine}, year={2019} }'
chicago: 'Beyer, Dirk, and Marie-Christine Jakobs. “CoVeriTest: Cooperative Verifier-Based
Testing.” In Fundamental Approaches to Software Engineering. Cham, 2019.
https://doi.org/10.1007/978-3-030-16722-6_23.'
ieee: 'D. Beyer and M.-C. Jakobs, “CoVeriTest: Cooperative Verifier-Based Testing,”
in Fundamental Approaches to Software Engineering, Cham, 2019.'
mla: 'Beyer, Dirk, and Marie-Christine Jakobs. “CoVeriTest: Cooperative Verifier-Based
Testing.” Fundamental Approaches to Software Engineering, 2019, doi:10.1007/978-3-030-16722-6_23.'
short: 'D. Beyer, M.-C. Jakobs, in: Fundamental Approaches to Software Engineering,
Cham, 2019.'
date_created: 2019-10-16T06:39:51Z
date_updated: 2022-01-06T06:51:45Z
department:
- _id: '77'
doi: 10.1007/978-3-030-16722-6_23
language:
- iso: eng
place: Cham
project:
- _id: '85'
name: Kooperative Softwareverifikation
publication: Fundamental Approaches to Software Engineering
publication_identifier:
isbn:
- '9783030167219'
- '9783030167226'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: 'CoVeriTest: Cooperative Verifier-Based Testing'
type: book_chapter
user_id: '44413'
year: '2019'
...
---
_id: '45818'
author:
- first_name: Yasir
full_name: Mahmood, Yasir
last_name: Mahmood
- first_name: Arne
full_name: Meier, Arne
last_name: Meier
- first_name: Johannes
full_name: Schmidt, Johannes
last_name: Schmidt
citation:
ama: 'Mahmood Y, Meier A, Schmidt J. Parameterised Complexity of Abduction in Schaefer’s
Framework. In: Logical Foundations of Computer Science. Springer International
Publishing; 2019. doi:10.1007/978-3-030-36755-8_13'
apa: Mahmood, Y., Meier, A., & Schmidt, J. (2019). Parameterised Complexity
of Abduction in Schaefer’s Framework. Logical Foundations of Computer Science.
https://doi.org/10.1007/978-3-030-36755-8_13
bibtex: '@inproceedings{Mahmood_Meier_Schmidt_2019, place={Cham}, title={Parameterised
Complexity of Abduction in Schaefer’s Framework}, DOI={10.1007/978-3-030-36755-8_13},
booktitle={Logical Foundations of Computer Science}, publisher={Springer International
Publishing}, author={Mahmood, Yasir and Meier, Arne and Schmidt, Johannes}, year={2019}
}'
chicago: 'Mahmood, Yasir, Arne Meier, and Johannes Schmidt. “Parameterised Complexity
of Abduction in Schaefer’s Framework.” In Logical Foundations of Computer Science.
Cham: Springer International Publishing, 2019. https://doi.org/10.1007/978-3-030-36755-8_13.'
ieee: 'Y. Mahmood, A. Meier, and J. Schmidt, “Parameterised Complexity of Abduction
in Schaefer’s Framework,” 2019, doi: 10.1007/978-3-030-36755-8_13.'
mla: Mahmood, Yasir, et al. “Parameterised Complexity of Abduction in Schaefer’s
Framework.” Logical Foundations of Computer Science, Springer International
Publishing, 2019, doi:10.1007/978-3-030-36755-8_13.
short: 'Y. Mahmood, A. Meier, J. Schmidt, in: Logical Foundations of Computer Science,
Springer International Publishing, Cham, 2019.'
date_created: 2023-06-30T11:51:03Z
date_updated: 2023-07-03T11:44:22Z
doi: 10.1007/978-3-030-36755-8_13
language:
- iso: eng
place: Cham
publication: Logical Foundations of Computer Science
publication_identifier:
isbn:
- '9783030367541'
- '9783030367558'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: Parameterised Complexity of Abduction in Schaefer’s Framework
type: conference
user_id: '99353'
year: '2019'
...
---
_id: '2862'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Fabian
full_name: Eidens, Fabian
id: '25078'
last_name: Eidens
- first_name: Jakob
full_name: Juhnke, Jakob
id: '48090'
last_name: Juhnke
citation:
ama: 'Blömer J, Eidens F, Juhnke J. Practical, Anonymous, and Publicly Linkable
Universally-Composable Reputation Systems. In: Topics in Cryptology - {CT-RSA}
2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings.
Cham: Springer International Publishing; 2018:470-490. doi:10.1007/978-3-319-76953-0_25'
apa: 'Blömer, J., Eidens, F., & Juhnke, J. (2018). Practical, Anonymous, and
Publicly Linkable Universally-Composable Reputation Systems. In Topics in Cryptology
- {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings
(pp. 470–490). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-76953-0_25'
bibtex: '@inproceedings{Blömer_Eidens_Juhnke_2018, place={Cham}, title={Practical,
Anonymous, and Publicly Linkable Universally-Composable Reputation Systems}, DOI={10.1007/978-3-319-76953-0_25},
booktitle={Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at
the {RSA} Conference 2018, Proceedings}, publisher={Springer International Publishing},
author={Blömer, Johannes and Eidens, Fabian and Juhnke, Jakob}, year={2018}, pages={470–490}
}'
chicago: 'Blömer, Johannes, Fabian Eidens, and Jakob Juhnke. “Practical, Anonymous,
and Publicly Linkable Universally-Composable Reputation Systems.” In Topics
in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference
2018, Proceedings, 470–90. Cham: Springer International Publishing, 2018.
https://doi.org/10.1007/978-3-319-76953-0_25.'
ieee: J. Blömer, F. Eidens, and J. Juhnke, “Practical, Anonymous, and Publicly Linkable
Universally-Composable Reputation Systems,” in Topics in Cryptology - {CT-RSA}
2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings,
San Francisco, CA, USA, 2018, pp. 470–490.
mla: Blömer, Johannes, et al. “Practical, Anonymous, and Publicly Linkable Universally-Composable
Reputation Systems.” Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’
Track at the {RSA} Conference 2018, Proceedings, Springer International Publishing,
2018, pp. 470–90, doi:10.1007/978-3-319-76953-0_25.
short: 'J. Blömer, F. Eidens, J. Juhnke, in: Topics in Cryptology - {CT-RSA} 2018
- The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings, Springer
International Publishing, Cham, 2018, pp. 470–490.'
conference:
end_date: 2018-04-20
location: San Francisco, CA, USA
name: Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers' Track at the {RSA}
Conference 2018
start_date: 2018-04-16
date_created: 2018-05-24T11:14:02Z
date_updated: 2022-01-06T06:58:12Z
ddc:
- '004'
department:
- _id: '7'
- _id: '64'
doi: 10.1007/978-3-319-76953-0_25
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T13:45:40Z
date_updated: 2018-11-02T13:45:40Z
file_id: '5253'
file_name: PracticalAnonymousAndPubliclyL.pdf
file_size: 3371773
relation: main_file
success: 1
file_date_updated: 2018-11-02T13:45:40Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2018/029
oa: '1'
page: 470-490
place: Cham
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication: Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers' Track at the
{RSA} Conference 2018, Proceedings
publication_identifier:
isbn:
- '9783319769523'
- '9783319769530'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation
Systems
type: conference
user_id: '477'
year: '2018'
...
---
_id: '24396'
abstract:
- lang: eng
text: 'We study the Online Prize-collecting Node-weighted Steiner Forest problem
(OPC-NWSF) in which we are given an undirected graph \(G=(V, E)\) with \(|V| =
n\) and node-weight function \(w: V \rightarrow \mathcal {R}^+\). A sequence of
k pairs of nodes of G, each associated with a penalty, arrives online. OPC-NWSF
asks to construct a subgraph H such that each pair \(\{s, t\}\) is either connected
(there is a path between s and t in H) or its associated penalty is paid. The
goal is to minimize the weight of H and the total penalties paid. The current
best result for OPC-NWSF is a randomized \(\mathcal {O}(\log ^4 n)\)-competitive
algorithm due to Hajiaghayi et al. (ICALP 2014). We improve this by proposing
a randomized \(\mathcal {O}(\log n \log k)\)-competitive algorithm for OPC-NWSF,
which is optimal up to constant factor since OPC-NWSF has a randomized lower bound
of \(\varOmega (\log ^2 n)\) due to Korman [11]. Moreover, our result also implies
an improvement for two special cases of OPC-NWSF, the Online Prize-collecting
Node-weighted Steiner Tree problem (OPC-NWST) and the Online Node-weighted Steiner
Forest problem (ONWSF). In OPC-NWST, there is a distinguished node which is one
of the nodes in each pair. In ONWSF, all penalties are set to infinity. The currently
best known results for OPC-NWST and ONWSF are a randomized \(\mathcal {O}(\log
^3 n)\)-competitive algorithm due to Hajiaghayi et al. (ICALP 2014) and a randomized
\(\mathcal {O}(\log n \log ^2 k)\)-competitive algorithm due to Hajiaghayi et
al. (FOCS 2013), respectively.'
author:
- first_name: Christine
full_name: Markarian, Christine
last_name: Markarian
citation:
ama: 'Markarian C. An Optimal Algorithm for Online Prize-Collecting Node-Weighted
Steiner Forest. In: International Workshop on Combinatorial Algorithms (IWOCA).
; 2018. doi:10.1007/978-3-319-94667-2_18'
apa: Markarian, C. (2018). An Optimal Algorithm for Online Prize-Collecting Node-Weighted
Steiner Forest. International Workshop on Combinatorial Algorithms (IWOCA).
https://doi.org/10.1007/978-3-319-94667-2_18
bibtex: '@inproceedings{Markarian_2018, place={Cham}, title={An Optimal Algorithm
for Online Prize-Collecting Node-Weighted Steiner Forest}, DOI={10.1007/978-3-319-94667-2_18},
booktitle={International Workshop on Combinatorial Algorithms (IWOCA)}, author={Markarian,
Christine}, year={2018} }'
chicago: Markarian, Christine. “An Optimal Algorithm for Online Prize-Collecting
Node-Weighted Steiner Forest.” In International Workshop on Combinatorial Algorithms
(IWOCA). Cham, 2018. https://doi.org/10.1007/978-3-319-94667-2_18.
ieee: 'C. Markarian, “An Optimal Algorithm for Online Prize-Collecting Node-Weighted
Steiner Forest,” 2018, doi: 10.1007/978-3-319-94667-2_18.'
mla: Markarian, Christine. “An Optimal Algorithm for Online Prize-Collecting Node-Weighted
Steiner Forest.” International Workshop on Combinatorial Algorithms (IWOCA),
2018, doi:10.1007/978-3-319-94667-2_18.
short: 'C. Markarian, in: International Workshop on Combinatorial Algorithms (IWOCA),
Cham, 2018.'
date_created: 2021-09-14T12:23:29Z
date_updated: 2022-01-06T06:56:19Z
department:
- _id: '63'
doi: 10.1007/978-3-319-94667-2_18
language:
- iso: eng
place: Cham
publication: International Workshop on Combinatorial Algorithms (IWOCA)
publication_identifier:
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest
type: conference
user_id: '15415'
year: '2018'
...
---
_id: '3362'
abstract:
- lang: eng
text: Profiling applications on a heterogeneous compute node is challenging since
the way to retrieve data from the resources and interpret them varies between
resource types and manufacturers. This holds especially true for measuring the
energy consumption. In this paper we present Ampehre, a novel open source measurement
framework that allows developers to gather comparable measurements from heterogeneous
compute nodes, e.g., nodes comprising CPU, GPU, and FPGA. We explain the architecture
of Ampehre and detail the measurement process on the example of energy measurements
on CPU and GPU. To characterize the probing effect, we quantitatively analyze
the trade-off between the accuracy of measurements and the CPU load imposed by
Ampehre. Based on this analysis, we are able to specify reasonable combinations
of sampling periods for the different resource types of a compute node.
author:
- first_name: Achim
full_name: Lösch, Achim
id: '43646'
last_name: Lösch
- first_name: Alex
full_name: Wiens, Alex
last_name: Wiens
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Lösch A, Wiens A, Platzner M. Ampehre: An Open Source Measurement Framework
for Heterogeneous Compute Nodes. In: Proceedings of the International Conference
on Architecture of Computing Systems (ARCS). Vol 10793. Lecture Notes in Computer
Science. Cham: Springer International Publishing; 2018:73-84. doi:10.1007/978-3-319-77610-1_6'
apa: 'Lösch, A., Wiens, A., & Platzner, M. (2018). Ampehre: An Open Source Measurement
Framework for Heterogeneous Compute Nodes. In Proceedings of the International
Conference on Architecture of Computing Systems (ARCS) (Vol. 10793, pp. 73–84).
Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-77610-1_6'
bibtex: '@inproceedings{Lösch_Wiens_Platzner_2018, place={Cham}, series={Lecture
Notes in Computer Science}, title={Ampehre: An Open Source Measurement Framework
for Heterogeneous Compute Nodes}, volume={10793}, DOI={10.1007/978-3-319-77610-1_6},
booktitle={Proceedings of the International Conference on Architecture of Computing
Systems (ARCS)}, publisher={Springer International Publishing}, author={Lösch,
Achim and Wiens, Alex and Platzner, Marco}, year={2018}, pages={73–84}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Lösch, Achim, Alex Wiens, and Marco Platzner. “Ampehre: An Open Source
Measurement Framework for Heterogeneous Compute Nodes.” In Proceedings of the
International Conference on Architecture of Computing Systems (ARCS), 10793:73–84.
Lecture Notes in Computer Science. Cham: Springer International Publishing, 2018.
https://doi.org/10.1007/978-3-319-77610-1_6.'
ieee: 'A. Lösch, A. Wiens, and M. Platzner, “Ampehre: An Open Source Measurement
Framework for Heterogeneous Compute Nodes,” in Proceedings of the International
Conference on Architecture of Computing Systems (ARCS), 2018, vol. 10793,
pp. 73–84.'
mla: 'Lösch, Achim, et al. “Ampehre: An Open Source Measurement Framework for Heterogeneous
Compute Nodes.” Proceedings of the International Conference on Architecture
of Computing Systems (ARCS), vol. 10793, Springer International Publishing,
2018, pp. 73–84, doi:10.1007/978-3-319-77610-1_6.'
short: 'A. Lösch, A. Wiens, M. Platzner, in: Proceedings of the International Conference
on Architecture of Computing Systems (ARCS), Springer International Publishing,
Cham, 2018, pp. 73–84.'
date_created: 2018-06-26T13:47:52Z
date_updated: 2022-01-06T06:59:13Z
ddc:
- '040'
department:
- _id: '78'
doi: 10.1007/978-3-319-77610-1_6
file:
- access_level: closed
content_type: application/pdf
creator: aloesch
date_created: 2018-06-26T13:58:28Z
date_updated: 2018-06-26T13:58:28Z
file_id: '3363'
file_name: loesch2017_arcs.pdf
file_size: 1114026
relation: main_file
success: 1
file_date_updated: 2018-06-26T13:58:28Z
has_accepted_license: '1'
intvolume: ' 10793'
page: 73-84
place: Cham
project:
- _id: '14'
name: SFB 901 - Subproject C2
- _id: '4'
name: SFB 901 - Project Area C
- _id: '1'
name: SFB 901
publication: Proceedings of the International Conference on Architecture of Computing
Systems (ARCS)
publication_identifier:
isbn:
- '9783319776095'
- '9783319776101'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
series_title: Lecture Notes in Computer Science
status: public
title: 'Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes'
type: conference
user_id: '477'
volume: 10793
year: '2018'
...
---
_id: '3373'
abstract:
- lang: eng
text: Modern Boolean satisfiability solvers can emit proofs of unsatisfiability.
There is substantial interest in being able to verify such proofs and also in
using them for further computations. In this paper, we present an FPGA accelerator
for checking resolution proofs, a popular proof format. Our accelerator exploits
parallelism at the low level by implementing the basic resolution step in hardware,
and at the high level by instantiating a number of parallel modules for proof
checking. Since proof checking involves highly irregular memory accesses, we employ
Hybrid Memory Cube technology for accelerator memory. The results show that while
the accelerator is scalable and achieves speedups for all benchmark proofs, performance
improvements are currently limited by the overhead of transitioning the proof
into the accelerator memory.
author:
- first_name: Tim
full_name: Hansmeier, Tim
id: '49992'
last_name: Hansmeier
orcid: 0000-0003-1377-3339
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
- first_name: David
full_name: Andrews, David
last_name: Andrews
citation:
ama: 'Hansmeier T, Platzner M, Andrews D. An FPGA/HMC-Based Accelerator for Resolution
Proof Checking. In: ARC 2018: Applied Reconfigurable Computing. Architectures,
Tools, and Applications. Vol 10824. Lecture Notes in Computer Science. Springer
International Publishing; 2018:153-165. doi:10.1007/978-3-319-78890-6_13'
apa: 'Hansmeier, T., Platzner, M., & Andrews, D. (2018). An FPGA/HMC-Based Accelerator
for Resolution Proof Checking. In ARC 2018: Applied Reconfigurable Computing.
Architectures, Tools, and Applications (Vol. 10824, pp. 153–165). Santorini,
Greece: Springer International Publishing. https://doi.org/10.1007/978-3-319-78890-6_13'
bibtex: '@inproceedings{Hansmeier_Platzner_Andrews_2018, series={Lecture Notes in
Computer Science}, title={An FPGA/HMC-Based Accelerator for Resolution Proof Checking},
volume={10824}, DOI={10.1007/978-3-319-78890-6_13},
booktitle={ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and
Applications}, publisher={Springer International Publishing}, author={Hansmeier,
Tim and Platzner, Marco and Andrews, David}, year={2018}, pages={153–165}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Hansmeier, Tim, Marco Platzner, and David Andrews. “An FPGA/HMC-Based
Accelerator for Resolution Proof Checking.” In ARC 2018: Applied Reconfigurable
Computing. Architectures, Tools, and Applications, 10824:153–65. Lecture Notes
in Computer Science. Springer International Publishing, 2018. https://doi.org/10.1007/978-3-319-78890-6_13.'
ieee: 'T. Hansmeier, M. Platzner, and D. Andrews, “An FPGA/HMC-Based Accelerator
for Resolution Proof Checking,” in ARC 2018: Applied Reconfigurable Computing.
Architectures, Tools, and Applications, Santorini, Greece, 2018, vol. 10824,
pp. 153–165.'
mla: 'Hansmeier, Tim, et al. “An FPGA/HMC-Based Accelerator for Resolution Proof
Checking.” ARC 2018: Applied Reconfigurable Computing. Architectures, Tools,
and Applications, vol. 10824, Springer International Publishing, 2018, pp.
153–65, doi:10.1007/978-3-319-78890-6_13.'
short: 'T. Hansmeier, M. Platzner, D. Andrews, in: ARC 2018: Applied Reconfigurable
Computing. Architectures, Tools, and Applications, Springer International Publishing,
2018, pp. 153–165.'
conference:
end_date: 2018-05-04
location: Santorini, Greece
name: 'ARC: International Symposium on Applied Reconfigurable Computing'
start_date: 2018-05-02
date_created: 2018-06-27T09:30:24Z
date_updated: 2022-01-06T06:59:13Z
ddc:
- '000'
department:
- _id: '78'
doi: 10.1007/978-3-319-78890-6_13
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T13:55:07Z
date_updated: 2018-11-02T13:55:07Z
file_id: '5257'
file_name: AnFPGAHMC-BasedAcceleratorForR.pdf
file_size: 612367
relation: main_file
success: 1
file_date_updated: 2018-11-02T13:55:07Z
has_accepted_license: '1'
intvolume: ' 10824'
language:
- iso: eng
page: 153-165
project:
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
publication: 'ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and
Applications'
publication_identifier:
isbn:
- '9783319788890'
- '9783319788906'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
series_title: Lecture Notes in Computer Science
status: public
title: An FPGA/HMC-Based Accelerator for Resolution Proof Checking
type: conference
user_id: '3118'
volume: 10824
year: '2018'
...
---
_id: '3536'
author:
- first_name: Gerhard
full_name: Schellhorn, Gerhard
last_name: Schellhorn
- first_name: Monika
full_name: Wedel, Monika
last_name: Wedel
- first_name: Oleg
full_name: Travkin, Oleg
last_name: Travkin
- first_name: Jürgen
full_name: König, Jürgen
id: '22358'
last_name: König
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Schellhorn G, Wedel M, Travkin O, König J, Wehrheim H. FastLane Is Opaque
– a Case Study in Mechanized Proofs of Opacity. In: Software Engineering and
Formal Methods. Cham: Springer International Publishing; 2018:105-120. doi:10.1007/978-3-319-92970-5_7'
apa: 'Schellhorn, G., Wedel, M., Travkin, O., König, J., & Wehrheim, H. (2018).
FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity. In Software
Engineering and Formal Methods (pp. 105–120). Cham: Springer International
Publishing. https://doi.org/10.1007/978-3-319-92970-5_7'
bibtex: '@inbook{Schellhorn_Wedel_Travkin_König_Wehrheim_2018, place={Cham}, title={FastLane
Is Opaque – a Case Study in Mechanized Proofs of Opacity}, DOI={10.1007/978-3-319-92970-5_7},
booktitle={Software Engineering and Formal Methods}, publisher={Springer International
Publishing}, author={Schellhorn, Gerhard and Wedel, Monika and Travkin, Oleg and
König, Jürgen and Wehrheim, Heike}, year={2018}, pages={105–120} }'
chicago: 'Schellhorn, Gerhard, Monika Wedel, Oleg Travkin, Jürgen König, and Heike
Wehrheim. “FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity.”
In Software Engineering and Formal Methods, 105–20. Cham: Springer International
Publishing, 2018. https://doi.org/10.1007/978-3-319-92970-5_7.'
ieee: 'G. Schellhorn, M. Wedel, O. Travkin, J. König, and H. Wehrheim, “FastLane
Is Opaque – a Case Study in Mechanized Proofs of Opacity,” in Software Engineering
and Formal Methods, Cham: Springer International Publishing, 2018, pp. 105–120.'
mla: Schellhorn, Gerhard, et al. “FastLane Is Opaque – a Case Study in Mechanized
Proofs of Opacity.” Software Engineering and Formal Methods, Springer International
Publishing, 2018, pp. 105–20, doi:10.1007/978-3-319-92970-5_7.
short: 'G. Schellhorn, M. Wedel, O. Travkin, J. König, H. Wehrheim, in: Software
Engineering and Formal Methods, Springer International Publishing, Cham, 2018,
pp. 105–120.'
date_created: 2018-07-11T06:19:58Z
date_updated: 2022-01-06T06:59:22Z
department:
- _id: '77'
doi: 10.1007/978-3-319-92970-5_7
page: 105-120
place: Cham
project:
- _id: '78'
name: Validation of Software Transactional Memory
publication: Software Engineering and Formal Methods
publication_identifier:
isbn:
- '9783319929699'
- '9783319929705'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity
type: book_chapter
user_id: '29719'
year: '2018'
...
---
_id: '5774'
abstract:
- lang: eng
text: Information flow analysis investigates the flow of data in applications, checking
in particular for flows from private sources to public sinks. Flow- and path-sensitive
analyses are, however, often too costly to be performed every time a security-critical
application is run. In this paper, we propose a variant of proof carrying code
for information flow security. To this end, we develop information flow (IF) certificates
which get attached to programs as well as a method for IF certificate validation.
We prove soundness of our technique, i.e., show it to be tamper-free. The technique
is implemented within the program analysis tool CPAchecker. Our experiments confirm
that the use of certificates pays off for costly analysis runs.
author:
- first_name: Manuel
full_name: Töws, Manuel
id: '11315'
last_name: Töws
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Töws M, Wehrheim H. Information Flow Certificates. In: Theoretical Aspects
of Computing – ICTAC 2018. Cham: Springer International Publishing; 2018:435-454.
doi:10.1007/978-3-030-02508-3_23'
apa: 'Töws, M., & Wehrheim, H. (2018). Information Flow Certificates. In Theoretical
Aspects of Computing – ICTAC 2018 (pp. 435–454). Cham: Springer International
Publishing. https://doi.org/10.1007/978-3-030-02508-3_23'
bibtex: '@inproceedings{Töws_Wehrheim_2018, place={Cham}, title={Information Flow
Certificates}, DOI={10.1007/978-3-030-02508-3_23},
booktitle={Theoretical Aspects of Computing – ICTAC 2018}, publisher={Springer
International Publishing}, author={Töws, Manuel and Wehrheim, Heike}, year={2018},
pages={435–454} }'
chicago: 'Töws, Manuel, and Heike Wehrheim. “Information Flow Certificates.” In
Theoretical Aspects of Computing – ICTAC 2018, 435–54. Cham: Springer International
Publishing, 2018. https://doi.org/10.1007/978-3-030-02508-3_23.'
ieee: M. Töws and H. Wehrheim, “Information Flow Certificates,” in Theoretical
Aspects of Computing – ICTAC 2018, 2018, pp. 435–454.
mla: Töws, Manuel, and Heike Wehrheim. “Information Flow Certificates.” Theoretical
Aspects of Computing – ICTAC 2018, Springer International Publishing, 2018,
pp. 435–54, doi:10.1007/978-3-030-02508-3_23.
short: 'M. Töws, H. Wehrheim, in: Theoretical Aspects of Computing – ICTAC 2018,
Springer International Publishing, Cham, 2018, pp. 435–454.'
date_created: 2018-11-21T09:51:37Z
date_updated: 2022-01-06T07:02:40Z
ddc:
- '000'
department:
- _id: '77'
doi: 10.1007/978-3-030-02508-3_23
file:
- access_level: closed
content_type: application/pdf
creator: mtoews
date_created: 2018-11-26T15:11:32Z
date_updated: 2018-11-26T15:11:32Z
file_id: '5837'
file_name: Töws-Wehrheim2018_Chapter_InformationFlowCertificates.pdf
file_size: 518016
relation: main_file
success: 1
file_date_updated: 2018-11-26T15:11:32Z
has_accepted_license: '1'
language:
- iso: eng
page: 435-454
place: Cham
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '12'
name: SFB 901 - Subproject B4
publication: Theoretical Aspects of Computing – ICTAC 2018
publication_identifier:
isbn:
- '9783030025076'
- '9783030025083'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: Information Flow Certificates
type: conference
user_id: '477'
year: '2018'
...
---
_id: '6253'
author:
- first_name: Björn
full_name: Senft, Björn
id: '9109'
last_name: Senft
- first_name: Holger Gerhard
full_name: Fischer, Holger Gerhard
id: '30457'
last_name: Fischer
- first_name: Simon
full_name: Oberthür, Simon
id: '383'
last_name: Oberthür
- first_name: Nitish
full_name: Patkar, Nitish
last_name: Patkar
citation:
ama: 'Senft B, Fischer HG, Oberthür S, Patkar N. Assist Users to Straightaway Suggest
and Describe Experienced Problems. In: Design, User Experience, and Usability:
Theory and Practice. Vol 10918. Lecture Notes in Computer Science. Cham: Springer
International Publishing; 2018:758-770. doi:10.1007/978-3-319-91797-9_52'
apa: 'Senft, B., Fischer, H. G., Oberthür, S., & Patkar, N. (2018). Assist Users
to Straightaway Suggest and Describe Experienced Problems. In Design, User
Experience, and Usability: Theory and Practice (Vol. 10918, pp. 758–770).
Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-91797-9_52'
bibtex: '@inbook{Senft_Fischer_Oberthür_Patkar_2018, place={Cham}, series={Lecture
Notes in Computer Science}, title={Assist Users to Straightaway Suggest and Describe
Experienced Problems}, volume={10918}, DOI={10.1007/978-3-319-91797-9_52},
booktitle={Design, User Experience, and Usability: Theory and Practice}, publisher={Springer
International Publishing}, author={Senft, Björn and Fischer, Holger Gerhard and
Oberthür, Simon and Patkar, Nitish}, year={2018}, pages={758–770}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Senft, Björn, Holger Gerhard Fischer, Simon Oberthür, and Nitish Patkar.
“Assist Users to Straightaway Suggest and Describe Experienced Problems.” In Design,
User Experience, and Usability: Theory and Practice, 10918:758–70. Lecture
Notes in Computer Science. Cham: Springer International Publishing, 2018. https://doi.org/10.1007/978-3-319-91797-9_52.'
ieee: 'B. Senft, H. G. Fischer, S. Oberthür, and N. Patkar, “Assist Users to Straightaway
Suggest and Describe Experienced Problems,” in Design, User Experience, and
Usability: Theory and Practice, vol. 10918, Cham: Springer International Publishing,
2018, pp. 758–770.'
mla: 'Senft, Björn, et al. “Assist Users to Straightaway Suggest and Describe Experienced
Problems.” Design, User Experience, and Usability: Theory and Practice,
vol. 10918, Springer International Publishing, 2018, pp. 758–70, doi:10.1007/978-3-319-91797-9_52.'
short: 'B. Senft, H.G. Fischer, S. Oberthür, N. Patkar, in: Design, User Experience,
and Usability: Theory and Practice, Springer International Publishing, Cham, 2018,
pp. 758–770.'
conference:
end_date: 2018-07-20
location: Las Vegas, USA
name: International Conference of Design, User Experience, and Usability (DUXU)
as part of HCI International 2018
start_date: 2018-07-15
date_created: 2018-12-18T10:37:41Z
date_updated: 2022-01-06T07:02:58Z
department:
- _id: '66'
- _id: '534'
- _id: '221'
doi: 10.1007/978-3-319-91797-9_52
intvolume: ' 10918'
language:
- iso: eng
page: 758-770
place: Cham
publication: 'Design, User Experience, and Usability: Theory and Practice'
publication_identifier:
isbn:
- '9783319917962'
- '9783319917979'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
series_title: Lecture Notes in Computer Science
status: public
title: Assist Users to Straightaway Suggest and Describe Experienced Problems
type: book_chapter
user_id: '30457'
volume: 10918
year: '2018'
...
---
_id: '6254'
author:
- first_name: Holger Gerhard
full_name: Fischer, Holger Gerhard
id: '30457'
last_name: Fischer
- first_name: Björn
full_name: Senft, Björn
id: '9109'
last_name: Senft
- first_name: Florian
full_name: Rittmeier, Florian
id: '5281'
last_name: Rittmeier
- first_name: Stefan
full_name: Sauer, Stefan
id: '447'
last_name: Sauer
citation:
ama: 'Fischer HG, Senft B, Rittmeier F, Sauer S. A Canvas Method to Foster Interdisciplinary
Discussions on Digital Assistance Systems. In: Marcus A, Wang W, eds. Design,
User Experience, and Usability: Theory and Practice. Proceedings of the 20th International
Conference on Human-Computer Interaktion (HCI International 2018). Vol 10918.
Lecture Notes in Computer Science. Cham: Springer International Publishing; 2018:711-724.
doi:10.1007/978-3-319-91797-9_49'
apa: 'Fischer, H. G., Senft, B., Rittmeier, F., & Sauer, S. (2018). A Canvas
Method to Foster Interdisciplinary Discussions on Digital Assistance Systems.
In A. Marcus & W. Wang (Eds.), Design, User Experience, and Usability:
Theory and Practice. Proceedings of the 20th International Conference on Human-Computer
Interaktion (HCI International 2018) (Vol. 10918, pp. 711–724). Cham: Springer
International Publishing. https://doi.org/10.1007/978-3-319-91797-9_49'
bibtex: '@inbook{Fischer_Senft_Rittmeier_Sauer_2018, place={Cham}, series={Lecture
Notes in Computer Science}, title={A Canvas Method to Foster Interdisciplinary
Discussions on Digital Assistance Systems}, volume={10918}, DOI={10.1007/978-3-319-91797-9_49},
booktitle={Design, User Experience, and Usability: Theory and Practice. Proceedings
of the 20th International Conference on Human-Computer Interaktion (HCI International
2018)}, publisher={Springer International Publishing}, author={Fischer, Holger
Gerhard and Senft, Björn and Rittmeier, Florian and Sauer, Stefan}, editor={Marcus,
Aaron and Wang, WentaoEditors}, year={2018}, pages={711–724}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Fischer, Holger Gerhard, Björn Senft, Florian Rittmeier, and Stefan Sauer.
“A Canvas Method to Foster Interdisciplinary Discussions on Digital Assistance
Systems.” In Design, User Experience, and Usability: Theory and Practice. Proceedings
of the 20th International Conference on Human-Computer Interaktion (HCI International
2018), edited by Aaron Marcus and Wentao Wang, 10918:711–24. Lecture Notes
in Computer Science. Cham: Springer International Publishing, 2018. https://doi.org/10.1007/978-3-319-91797-9_49.'
ieee: 'H. G. Fischer, B. Senft, F. Rittmeier, and S. Sauer, “A Canvas Method to
Foster Interdisciplinary Discussions on Digital Assistance Systems,” in Design,
User Experience, and Usability: Theory and Practice. Proceedings of the 20th International
Conference on Human-Computer Interaktion (HCI International 2018), vol. 10918,
A. Marcus and W. Wang, Eds. Cham: Springer International Publishing, 2018, pp.
711–724.'
mla: 'Fischer, Holger Gerhard, et al. “A Canvas Method to Foster Interdisciplinary
Discussions on Digital Assistance Systems.” Design, User Experience, and Usability:
Theory and Practice. Proceedings of the 20th International Conference on Human-Computer
Interaktion (HCI International 2018), edited by Aaron Marcus and Wentao Wang,
vol. 10918, Springer International Publishing, 2018, pp. 711–24, doi:10.1007/978-3-319-91797-9_49.'
short: 'H.G. Fischer, B. Senft, F. Rittmeier, S. Sauer, in: A. Marcus, W. Wang (Eds.),
Design, User Experience, and Usability: Theory and Practice. Proceedings of the
20th International Conference on Human-Computer Interaktion (HCI International
2018), Springer International Publishing, Cham, 2018, pp. 711–724.'
conference:
end_date: 2018-07-20
location: Las Vegas, USA
name: International Conference of Design, User Experience, and Usability (DUXU)
as part of HCI International 2018
start_date: 2018-07-15
date_created: 2018-12-18T10:42:39Z
date_updated: 2022-01-06T07:02:58Z
department:
- _id: '66'
- _id: '534'
- _id: '221'
doi: 10.1007/978-3-319-91797-9_49
editor:
- first_name: Aaron
full_name: Marcus, Aaron
last_name: Marcus
- first_name: Wentao
full_name: Wang, Wentao
last_name: Wang
intvolume: ' 10918'
language:
- iso: eng
page: 711-724
place: Cham
publication: 'Design, User Experience, and Usability: Theory and Practice. Proceedings
of the 20th International Conference on Human-Computer Interaktion (HCI International
2018)'
publication_identifier:
isbn:
- '9783319917962'
- '9783319917979'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
series_title: Lecture Notes in Computer Science
status: public
title: A Canvas Method to Foster Interdisciplinary Discussions on Digital Assistance
Systems
type: book_chapter
user_id: '30457'
volume: 10918
year: '2018'
...
---
_id: '6423'
author:
- first_name: Dirk
full_name: Schäfer, Dirk
last_name: Schäfer
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
citation:
ama: 'Schäfer D, Hüllermeier E. Preference-Based Reinforcement Learning Using Dyad
Ranking. In: Discovery Science. Cham: Springer International Publishing;
2018:161-175. doi:10.1007/978-3-030-01771-2_11'
apa: 'Schäfer, D., & Hüllermeier, E. (2018). Preference-Based Reinforcement
Learning Using Dyad Ranking. In Discovery Science (pp. 161–175). Cham:
Springer International Publishing. https://doi.org/10.1007/978-3-030-01771-2_11'
bibtex: '@inbook{Schäfer_Hüllermeier_2018, place={Cham}, title={Preference-Based
Reinforcement Learning Using Dyad Ranking}, DOI={10.1007/978-3-030-01771-2_11},
booktitle={Discovery Science}, publisher={Springer International Publishing},
author={Schäfer, Dirk and Hüllermeier, Eyke}, year={2018}, pages={161–175} }'
chicago: 'Schäfer, Dirk, and Eyke Hüllermeier. “Preference-Based Reinforcement Learning
Using Dyad Ranking.” In Discovery Science, 161–75. Cham: Springer International
Publishing, 2018. https://doi.org/10.1007/978-3-030-01771-2_11.'
ieee: 'D. Schäfer and E. Hüllermeier, “Preference-Based Reinforcement Learning Using
Dyad Ranking,” in Discovery Science, Cham: Springer International Publishing,
2018, pp. 161–175.'
mla: Schäfer, Dirk, and Eyke Hüllermeier. “Preference-Based Reinforcement Learning
Using Dyad Ranking.” Discovery Science, Springer International Publishing,
2018, pp. 161–75, doi:10.1007/978-3-030-01771-2_11.
short: 'D. Schäfer, E. Hüllermeier, in: Discovery Science, Springer International
Publishing, Cham, 2018, pp. 161–175.'
date_created: 2018-12-20T15:52:03Z
date_updated: 2022-01-06T07:03:04Z
ddc:
- '000'
department:
- _id: '355'
doi: 10.1007/978-3-030-01771-2_11
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2019-01-11T11:03:50Z
date_updated: 2019-01-11T11:03:50Z
file_id: '6623'
file_name: Schäfer-Hüllermeier2018_Chapter_Preference-BasedReinforcementL.pdf
file_size: 458972
relation: main_file
success: 1
file_date_updated: 2019-01-11T11:03:50Z
has_accepted_license: '1'
language:
- iso: eng
page: 161-175
place: Cham
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '10'
name: SFB 901 - Subproject B2
publication: Discovery Science
publication_identifier:
isbn:
- '9783030017705'
- '9783030017712'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: Preference-Based Reinforcement Learning Using Dyad Ranking
type: book_chapter
user_id: '49109'
year: '2018'
...
---
_id: '16392'
author:
- first_name: Björn
full_name: Feldkord, Björn
id: '22704'
last_name: Feldkord
- 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
citation:
ama: 'Feldkord B, Malatyali M, Meyer auf der Heide F. A Dynamic Distributed Data
Structure for Top-k and k-Select Queries. In: Progress in Pattern Recognition,
Image Analysis, Computer Vision, and Applications. Cham; 2018. doi:10.1007/978-3-319-98355-4_18'
apa: Feldkord, B., Malatyali, M., & Meyer auf der Heide, F. (2018). A Dynamic
Distributed Data Structure for Top-k and k-Select Queries. In Progress in Pattern
Recognition, Image Analysis, Computer Vision, and Applications. Cham. https://doi.org/10.1007/978-3-319-98355-4_18
bibtex: '@inbook{Feldkord_Malatyali_Meyer auf der Heide_2018, place={Cham}, title={A
Dynamic Distributed Data Structure for Top-k and k-Select Queries}, DOI={10.1007/978-3-319-98355-4_18},
booktitle={Progress in Pattern Recognition, Image Analysis, Computer Vision, and
Applications}, author={Feldkord, Björn and Malatyali, Manuel and Meyer auf der
Heide, Friedhelm}, year={2018} }'
chicago: Feldkord, Björn, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “A
Dynamic Distributed Data Structure for Top-k and k-Select Queries.” In Progress
in Pattern Recognition, Image Analysis, Computer Vision, and Applications.
Cham, 2018. https://doi.org/10.1007/978-3-319-98355-4_18.
ieee: B. Feldkord, M. Malatyali, and F. Meyer auf der Heide, “A Dynamic Distributed
Data Structure for Top-k and k-Select Queries,” in Progress in Pattern Recognition,
Image Analysis, Computer Vision, and Applications, Cham, 2018.
mla: Feldkord, Björn, et al. “A Dynamic Distributed Data Structure for Top-k and
k-Select Queries.” Progress in Pattern Recognition, Image Analysis, Computer
Vision, and Applications, 2018, doi:10.1007/978-3-319-98355-4_18.
short: 'B. Feldkord, M. Malatyali, F. Meyer auf der Heide, in: Progress in Pattern
Recognition, Image Analysis, Computer Vision, and Applications, Cham, 2018.'
date_created: 2020-04-03T07:04:59Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-319-98355-4_18
language:
- iso: eng
place: Cham
publication: Progress in Pattern Recognition, Image Analysis, Computer Vision, and
Applications
publication_identifier:
isbn:
- '9783319125671'
- '9783319125688'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: A Dynamic Distributed Data Structure for Top-k and k-Select Queries
type: book_chapter
user_id: '15415'
year: '2018'
...
---
_id: '24398'
abstract:
- lang: eng
text: 'Through this study, we introduce the idea of applying scheduling techniques
to allocate spatial resources that are shared among multiple robots moving in
a static environment and having temporal constraints on the arrival time to destinations.
To illustrate this idea, we present an exemplified algorithm that plans and assigns
a motion path to each robot. The considered problem is particularly challenging
because: (i) the robots share the same environment and thus the planner must take
into account overlapping paths which cannot happen at the same time; (ii) there
are time deadlines thus the planner must deal with temporal constraints; (iii)
new requests arrive without a priori knowledge thus the planner must be able to
add new paths online and adjust old plans; (iv) the robot motion is subject to
noise thus the planner must be reactive to adapt to online changes. We showcase
the functioning of the proposed algorithm through a set of agent-based simulations.'
author:
- first_name: Yara
full_name: Khaluf, Yara
last_name: Khaluf
- first_name: Christine
full_name: Markarian, Christine
last_name: Markarian
- first_name: Pieter
full_name: Simoens, Pieter
last_name: Simoens
- first_name: Andreagiovanni
full_name: Reina, Andreagiovanni
last_name: Reina
citation:
ama: 'Khaluf Y, Markarian C, Simoens P, Reina A. Scheduling Access to Shared Space
in Multi-robot Systems. In: International Conference on Practical Applications
of Agents and Multi-Agent Systems (PAAMS 2017). ; 2017. doi:10.1007/978-3-319-59930-4_12'
apa: Khaluf, Y., Markarian, C., Simoens, P., & Reina, A. (2017). Scheduling
Access to Shared Space in Multi-robot Systems. International Conference on
Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017). https://doi.org/10.1007/978-3-319-59930-4_12
bibtex: '@inproceedings{Khaluf_Markarian_Simoens_Reina_2017, place={Cham}, title={Scheduling
Access to Shared Space in Multi-robot Systems}, DOI={10.1007/978-3-319-59930-4_12},
booktitle={International Conference on Practical Applications of Agents and Multi-Agent
Systems (PAAMS 2017)}, author={Khaluf, Yara and Markarian, Christine and Simoens,
Pieter and Reina, Andreagiovanni}, year={2017} }'
chicago: Khaluf, Yara, Christine Markarian, Pieter Simoens, and Andreagiovanni Reina.
“Scheduling Access to Shared Space in Multi-Robot Systems.” In International
Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS
2017). Cham, 2017. https://doi.org/10.1007/978-3-319-59930-4_12.
ieee: 'Y. Khaluf, C. Markarian, P. Simoens, and A. Reina, “Scheduling Access to
Shared Space in Multi-robot Systems,” 2017, doi: 10.1007/978-3-319-59930-4_12.'
mla: Khaluf, Yara, et al. “Scheduling Access to Shared Space in Multi-Robot Systems.”
International Conference on Practical Applications of Agents and Multi-Agent
Systems (PAAMS 2017), 2017, doi:10.1007/978-3-319-59930-4_12.
short: 'Y. Khaluf, C. Markarian, P. Simoens, A. Reina, in: International Conference
on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017), Cham,
2017.'
date_created: 2021-09-14T12:41:58Z
date_updated: 2022-01-06T06:56:19Z
department:
- _id: '63'
doi: 10.1007/978-3-319-59930-4_12
language:
- iso: eng
place: Cham
publication: International Conference on Practical Applications of Agents and Multi-Agent
Systems (PAAMS 2017)
publication_identifier:
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Scheduling Access to Shared Space in Multi-robot Systems
type: conference
user_id: '15415'
year: '2017'
...
---
_id: '2967'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Gennadij
full_name: Liske, Gennadij
last_name: Liske
citation:
ama: 'Blömer J, Liske G. Subtleties in Security Definitions for Predicate Encryption
with Public Index. In: Proceedings of the International Conference of Mathematical
Aspects of Computer and Information Sciences (MACIS). Vol 10693. Lecture Notes
in Computer Science. Cham: Springer International Publishing; 2017:438-453. doi:10.1007/978-3-319-72453-9_35'
apa: 'Blömer, J., & Liske, G. (2017). Subtleties in Security Definitions for
Predicate Encryption with Public Index. In Proceedings of the International
Conference of Mathematical Aspects of Computer and Information Sciences (MACIS)
(Vol. 10693, pp. 438–453). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-72453-9_35'
bibtex: '@inproceedings{Blömer_Liske_2017, place={Cham}, series={Lecture Notes in
Computer Science}, title={Subtleties in Security Definitions for Predicate Encryption
with Public Index}, volume={10693}, DOI={10.1007/978-3-319-72453-9_35},
booktitle={Proceedings of the International Conference of Mathematical Aspects
of Computer and Information Sciences (MACIS)}, publisher={Springer International
Publishing}, author={Blömer, Johannes and Liske, Gennadij}, year={2017}, pages={438–453},
collection={Lecture Notes in Computer Science} }'
chicago: 'Blömer, Johannes, and Gennadij Liske. “Subtleties in Security Definitions
for Predicate Encryption with Public Index.” In Proceedings of the International
Conference of Mathematical Aspects of Computer and Information Sciences (MACIS),
10693:438–53. Lecture Notes in Computer Science. Cham: Springer International
Publishing, 2017. https://doi.org/10.1007/978-3-319-72453-9_35.'
ieee: J. Blömer and G. Liske, “Subtleties in Security Definitions for Predicate
Encryption with Public Index,” in Proceedings of the International Conference
of Mathematical Aspects of Computer and Information Sciences (MACIS), 2017,
vol. 10693, pp. 438–453.
mla: Blömer, Johannes, and Gennadij Liske. “Subtleties in Security Definitions for
Predicate Encryption with Public Index.” Proceedings of the International Conference
of Mathematical Aspects of Computer and Information Sciences (MACIS), vol.
10693, Springer International Publishing, 2017, pp. 438–53, doi:10.1007/978-3-319-72453-9_35.
short: 'J. Blömer, G. Liske, in: Proceedings of the International Conference of
Mathematical Aspects of Computer and Information Sciences (MACIS), Springer International
Publishing, Cham, 2017, pp. 438–453.'
date_created: 2018-06-04T12:17:48Z
date_updated: 2022-01-06T06:58:49Z
ddc:
- '000'
department:
- _id: '64'
doi: 10.1007/978-3-319-72453-9_35
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:52:10Z
date_updated: 2018-11-02T14:52:10Z
file_id: '5286'
file_name: SubtletiesInSecurityDefinition.pdf
file_size: 463904
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:52:10Z
has_accepted_license: '1'
intvolume: ' 10693'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2017/453.pdf
oa: '1'
page: 438-453
place: Cham
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication: Proceedings of the International Conference of Mathematical Aspects of
Computer and Information Sciences (MACIS)
publication_identifier:
isbn:
- '9783319724522'
- '9783319724539'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
series_title: Lecture Notes in Computer Science
status: public
title: Subtleties in Security Definitions for Predicate Encryption with Public Index
type: conference
user_id: '477'
volume: 10693
year: '2017'
...
---
_id: '23396'
author:
- first_name: Christopher
full_name: Gerking, Christopher
last_name: Gerking
- first_name: David
full_name: Schubert, David
last_name: Schubert
- first_name: Ingo
full_name: Budde, Ingo
last_name: Budde
citation:
ama: 'Gerking C, Schubert D, Budde I. Reducing the Verbosity of Imperative Model
Refinements by Using General-Purpose Language Facilities. In: Theory and Practice
of Model Transformation. Cham; 2017. doi:10.1007/978-3-319-61473-1_2'
apa: Gerking, C., Schubert, D., & Budde, I. (2017). Reducing the Verbosity of
Imperative Model Refinements by Using General-Purpose Language Facilities. In
Theory and Practice of Model Transformation. Cham. https://doi.org/10.1007/978-3-319-61473-1_2
bibtex: '@inbook{Gerking_Schubert_Budde_2017, place={Cham}, title={Reducing the
Verbosity of Imperative Model Refinements by Using General-Purpose Language Facilities},
DOI={10.1007/978-3-319-61473-1_2},
booktitle={Theory and Practice of Model Transformation}, author={Gerking, Christopher
and Schubert, David and Budde, Ingo}, year={2017} }'
chicago: Gerking, Christopher, David Schubert, and Ingo Budde. “Reducing the Verbosity
of Imperative Model Refinements by Using General-Purpose Language Facilities.”
In Theory and Practice of Model Transformation. Cham, 2017. https://doi.org/10.1007/978-3-319-61473-1_2.
ieee: C. Gerking, D. Schubert, and I. Budde, “Reducing the Verbosity of Imperative
Model Refinements by Using General-Purpose Language Facilities,” in Theory
and Practice of Model Transformation, Cham, 2017.
mla: Gerking, Christopher, et al. “Reducing the Verbosity of Imperative Model Refinements
by Using General-Purpose Language Facilities.” Theory and Practice of Model
Transformation, 2017, doi:10.1007/978-3-319-61473-1_2.
short: 'C. Gerking, D. Schubert, I. Budde, in: Theory and Practice of Model Transformation,
Cham, 2017.'
date_created: 2021-08-13T20:33:08Z
date_updated: 2022-01-06T06:55:52Z
doi: 10.1007/978-3-319-61473-1_2
language:
- iso: eng
place: Cham
publication: Theory and Practice of Model Transformation
publication_identifier:
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Reducing the Verbosity of Imperative Model Refinements by Using General-Purpose
Language Facilities
type: book_chapter
user_id: '13693'
year: '2017'
...
---
_id: '2344'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Peter
full_name: Günther, Peter
last_name: Günther
- first_name: Volker
full_name: Krummel, Volker
last_name: Krummel
- first_name: Nils
full_name: Löken, Nils
id: '13703'
last_name: Löken
citation:
ama: 'Blömer J, Günther P, Krummel V, Löken N. Attribute-Based Encryption as a Service
for Access Control in Large-Scale Organizations. In: Foundations and Practice
of Security. Cham: Springer International Publishing; 2017:3-17. doi:10.1007/978-3-319-75650-9_1'
apa: 'Blömer, J., Günther, P., Krummel, V., & Löken, N. (2017). Attribute-Based
Encryption as a Service for Access Control in Large-Scale Organizations. In Foundations
and Practice of Security (pp. 3–17). Cham: Springer International Publishing.
https://doi.org/10.1007/978-3-319-75650-9_1'
bibtex: '@inproceedings{Blömer_Günther_Krummel_Löken_2017, place={Cham}, title={Attribute-Based
Encryption as a Service for Access Control in Large-Scale Organizations}, DOI={10.1007/978-3-319-75650-9_1},
booktitle={Foundations and Practice of Security}, publisher={Springer International
Publishing}, author={Blömer, Johannes and Günther, Peter and Krummel, Volker and
Löken, Nils}, year={2017}, pages={3–17} }'
chicago: 'Blömer, Johannes, Peter Günther, Volker Krummel, and Nils Löken. “Attribute-Based
Encryption as a Service for Access Control in Large-Scale Organizations.” In Foundations
and Practice of Security, 3–17. Cham: Springer International Publishing, 2017.
https://doi.org/10.1007/978-3-319-75650-9_1.'
ieee: J. Blömer, P. Günther, V. Krummel, and N. Löken, “Attribute-Based Encryption
as a Service for Access Control in Large-Scale Organizations,” in Foundations
and Practice of Security, 2017, pp. 3–17.
mla: Blömer, Johannes, et al. “Attribute-Based Encryption as a Service for Access
Control in Large-Scale Organizations.” Foundations and Practice of Security,
Springer International Publishing, 2017, pp. 3–17, doi:10.1007/978-3-319-75650-9_1.
short: 'J. Blömer, P. Günther, V. Krummel, N. Löken, in: Foundations and Practice
of Security, Springer International Publishing, Cham, 2017, pp. 3–17.'
date_created: 2018-04-13T11:40:48Z
date_updated: 2022-01-06T06:55:55Z
ddc:
- '000'
department:
- _id: '64'
doi: 10.1007/978-3-319-75650-9_1
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:04:13Z
date_updated: 2018-11-02T15:04:13Z
file_id: '5292'
file_name: Attribute-BasedEncryptionAsASe.pdf
file_size: 634736
relation: main_file
success: 1
- access_level: open_access
content_type: application/pdf
creator: nilo
date_created: 2018-11-08T09:53:34Z
date_updated: 2018-11-08T09:53:34Z
file_id: '5425'
file_name: abe_aas.pdf
file_size: 522516
relation: main_file
file_date_updated: 2018-11-08T09:53:34Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 3-17
place: Cham
project:
- _id: '13'
name: SFB 901 - Subproject C1
- _id: '4'
name: SFB 901 - Project Area C
- _id: '1'
name: SFB 901
- _id: '43'
name: Securing the Financial Cloud
publication: Foundations and Practice of Security
publication_identifier:
isbn:
- '9783319756493'
- '9783319756509'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations
type: conference
user_id: '13703'
year: '2017'
...
---
_id: '2381'
abstract:
- lang: eng
text: Metric facility location and K-means are well-known problems of combinatorial
optimization. Both admit a fairly simple heuristic called single-swap, which adds,
drops or swaps open facilities until it reaches a local optimum. For both problems,
it is known that this algorithm produces a solution that is at most a constant
factor worse than the respective global optimum. In this paper, we show that single-swap
applied to the weighted metric uncapacitated facility location and weighted discrete
K-means problem is tightly PLS-complete and hence has exponential worst-case running
time.
author:
- first_name: Sascha
full_name: Brauer, Sascha
id: '13291'
last_name: Brauer
citation:
ama: 'Brauer S. Complexity of Single-Swap Heuristics for Metric Facility Location
and Related Problems. In: Fotakis D, Pagourtzis A, Paschos VT, eds. Lecture
Notes in Computer Science. Vol 10236. Cham: Springer International Publishing;
2017:116-127. doi:10.1007/978-3-319-57586-5_11'
apa: 'Brauer, S. (2017). Complexity of Single-Swap Heuristics for Metric Facility
Location and Related Problems. In D. Fotakis, A. Pagourtzis, & V. T. Paschos
(Eds.), Lecture Notes in Computer Science (Vol. 10236, pp. 116–127). Cham:
Springer International Publishing. https://doi.org/10.1007/978-3-319-57586-5_11'
bibtex: '@inbook{Brauer_2017, place={Cham}, title={Complexity of Single-Swap Heuristics
for Metric Facility Location and Related Problems}, volume={10236}, DOI={10.1007/978-3-319-57586-5_11},
booktitle={Lecture Notes in Computer Science}, publisher={Springer International
Publishing}, author={Brauer, Sascha}, editor={Fotakis, Dimitris and Pagourtzis,
Aris and Paschos, Vangelis Th.Editors}, year={2017}, pages={116–127} }'
chicago: 'Brauer, Sascha. “Complexity of Single-Swap Heuristics for Metric Facility
Location and Related Problems.” In Lecture Notes in Computer Science, edited
by Dimitris Fotakis, Aris Pagourtzis, and Vangelis Th. Paschos, 10236:116–27.
Cham: Springer International Publishing, 2017. https://doi.org/10.1007/978-3-319-57586-5_11.'
ieee: 'S. Brauer, “Complexity of Single-Swap Heuristics for Metric Facility Location
and Related Problems,” in Lecture Notes in Computer Science, vol. 10236,
D. Fotakis, A. Pagourtzis, and V. T. Paschos, Eds. Cham: Springer International
Publishing, 2017, pp. 116–127.'
mla: Brauer, Sascha. “Complexity of Single-Swap Heuristics for Metric Facility Location
and Related Problems.” Lecture Notes in Computer Science, edited by Dimitris
Fotakis et al., vol. 10236, Springer International Publishing, 2017, pp. 116–27,
doi:10.1007/978-3-319-57586-5_11.
short: 'S. Brauer, in: D. Fotakis, A. Pagourtzis, V.T. Paschos (Eds.), Lecture Notes
in Computer Science, Springer International Publishing, Cham, 2017, pp. 116–127.'
conference:
end_date: 2017-05-26
location: Athens, Greece
name: 10th International Conference on Algorithms and Complexity
start_date: 2017-05-24
date_created: 2018-04-17T12:20:53Z
date_updated: 2022-01-06T06:56:00Z
department:
- _id: '64'
doi: 10.1007/978-3-319-57586-5_11
editor:
- first_name: Dimitris
full_name: Fotakis, Dimitris
last_name: Fotakis
- first_name: Aris
full_name: Pagourtzis, Aris
last_name: Pagourtzis
- first_name: Vangelis Th.
full_name: Paschos, Vangelis Th.
last_name: Paschos
intvolume: ' 10236'
language:
- iso: eng
page: 116-127
place: Cham
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783319575858'
- '9783319575865'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: Complexity of Single-Swap Heuristics for Metric Facility Location and Related
Problems
type: book_chapter
user_id: '13291'
volume: 10236
year: '2017'
...
---
_id: '5769'
abstract:
- lang: eng
text: "Information Flow Analysis (IFA) aims at detecting illegal flows of information
between program entities. “Legality” is therein specified in terms of various
security policies. For the analysis, this opens up two possibilities: building
generic, policy independent and building specific, policy dependent IFAs. While
the former needs to track all dependencies between program entities, the latter
allows for a reduced and thus more efficient analysis.\r\n\r\nIn this paper, we
start out by formally defining a policy independent information flow analysis.
Next, we show how to specialize this IFA via policy specific variable tracking,
and prove soundness of the specialization. We furthermore investigate refinement
relationships between policies, allowing an IFA for one policy to be employed
for its refinements. As policy refinement depends on concrete program entities,
we additionally propose a precomputation of policy refinement conditions, enabling
an efficient refinement check for concrete programs."
author:
- first_name: Manuel
full_name: Töws, Manuel
id: '11315'
last_name: Töws
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Töws M, Wehrheim H. Policy Dependent and Independent Information Flow Analyses.
In: Formal Methods and Software Engineering - 19th International Conference
on Formal Engineering Methods (ICFEM 2017). Springer International Publishing;
2017:362-378. doi:10.1007/978-3-319-68690-5_22'
apa: Töws, M., & Wehrheim, H. (2017). Policy Dependent and Independent Information
Flow Analyses. In Formal Methods and Software Engineering - 19th International
Conference on Formal Engineering Methods (ICFEM 2017) (pp. 362–378). Springer
International Publishing. https://doi.org/10.1007/978-3-319-68690-5_22
bibtex: '@inproceedings{Töws_Wehrheim_2017, title={Policy Dependent and Independent
Information Flow Analyses}, DOI={10.1007/978-3-319-68690-5_22},
booktitle={Formal Methods and Software Engineering - 19th International Conference
on Formal Engineering Methods (ICFEM 2017)}, publisher={Springer International
Publishing}, author={Töws, Manuel and Wehrheim, Heike}, year={2017}, pages={362–378}
}'
chicago: Töws, Manuel, and Heike Wehrheim. “Policy Dependent and Independent Information
Flow Analyses.” In Formal Methods and Software Engineering - 19th International
Conference on Formal Engineering Methods (ICFEM 2017), 362–78. Springer International
Publishing, 2017. https://doi.org/10.1007/978-3-319-68690-5_22.
ieee: M. Töws and H. Wehrheim, “Policy Dependent and Independent Information Flow
Analyses,” in Formal Methods and Software Engineering - 19th International
Conference on Formal Engineering Methods (ICFEM 2017), 2017, pp. 362–378.
mla: Töws, Manuel, and Heike Wehrheim. “Policy Dependent and Independent Information
Flow Analyses.” Formal Methods and Software Engineering - 19th International
Conference on Formal Engineering Methods (ICFEM 2017), Springer International
Publishing, 2017, pp. 362–78, doi:10.1007/978-3-319-68690-5_22.
short: 'M. Töws, H. Wehrheim, in: Formal Methods and Software Engineering - 19th
International Conference on Formal Engineering Methods (ICFEM 2017), Springer
International Publishing, 2017, pp. 362–378.'
date_created: 2018-11-21T09:38:43Z
date_updated: 2022-01-06T07:02:39Z
ddc:
- '000'
department:
- _id: '77'
doi: 10.1007/978-3-319-68690-5_22
file:
- access_level: closed
content_type: application/pdf
creator: mtoews
date_created: 2018-11-26T15:07:42Z
date_updated: 2018-11-26T15:07:42Z
file_id: '5836'
file_name: Töws-Wehrheim2017_Chapter_PolicyDependentAndIndependentI.pdf
file_size: 424031
relation: main_file
success: 1
file_date_updated: 2018-11-26T15:07:42Z
has_accepted_license: '1'
language:
- iso: eng
page: 362-378
project:
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '3'
name: SFB 901 - Project Area B
- _id: '1'
name: SFB 901
publication: Formal Methods and Software Engineering - 19th International Conference on
Formal Engineering Methods (ICFEM 2017)
publication_identifier:
isbn:
- '9783319686899'
- '9783319686905'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: Policy Dependent and Independent Information Flow Analyses
type: conference
user_id: '477'
year: '2017'
...
---
_id: '6255'
author:
- first_name: Holger Gerhard
full_name: Fischer, Holger Gerhard
id: '30457'
last_name: Fischer
- first_name: Michael
full_name: Engler, Michael
last_name: Engler
- first_name: Stefan
full_name: Sauer, Stefan
id: '447'
last_name: Sauer
citation:
ama: 'Fischer HG, Engler M, Sauer S. A Human-Centered Perspective on Software Quality:
Acceptance Criteria for Work 4.0. In: Design, User Experience, and Usability:
Theory, Methodology, and Management. Vol 10288. Lecture Notes in Computer
Science. Cham: Springer International Publishing; 2017:570-583. doi:10.1007/978-3-319-58634-2_42'
apa: 'Fischer, H. G., Engler, M., & Sauer, S. (2017). A Human-Centered Perspective
on Software Quality: Acceptance Criteria for Work 4.0. In Design, User Experience,
and Usability: Theory, Methodology, and Management (Vol. 10288, pp. 570–583).
Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-58634-2_42'
bibtex: '@inbook{Fischer_Engler_Sauer_2017, place={Cham}, series={Lecture Notes
in Computer Science}, title={A Human-Centered Perspective on Software Quality:
Acceptance Criteria for Work 4.0}, volume={10288}, DOI={10.1007/978-3-319-58634-2_42},
booktitle={Design, User Experience, and Usability: Theory, Methodology, and Management},
publisher={Springer International Publishing}, author={Fischer, Holger Gerhard
and Engler, Michael and Sauer, Stefan}, year={2017}, pages={570–583}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Fischer, Holger Gerhard, Michael Engler, and Stefan Sauer. “A Human-Centered
Perspective on Software Quality: Acceptance Criteria for Work 4.0.” In Design,
User Experience, and Usability: Theory, Methodology, and Management, 10288:570–83.
Lecture Notes in Computer Science. Cham: Springer International Publishing, 2017.
https://doi.org/10.1007/978-3-319-58634-2_42.'
ieee: 'H. G. Fischer, M. Engler, and S. Sauer, “A Human-Centered Perspective on
Software Quality: Acceptance Criteria for Work 4.0,” in Design, User Experience,
and Usability: Theory, Methodology, and Management, vol. 10288, Cham: Springer
International Publishing, 2017, pp. 570–583.'
mla: 'Fischer, Holger Gerhard, et al. “A Human-Centered Perspective on Software
Quality: Acceptance Criteria for Work 4.0.” Design, User Experience, and Usability:
Theory, Methodology, and Management, vol. 10288, Springer International Publishing,
2017, pp. 570–83, doi:10.1007/978-3-319-58634-2_42.'
short: 'H.G. Fischer, M. Engler, S. Sauer, in: Design, User Experience, and Usability:
Theory, Methodology, and Management, Springer International Publishing, Cham,
2017, pp. 570–583.'
conference:
end_date: 2017-07-14
location: Vancouver, Canada
name: International Conference of Design, User Experience, and Usability (DUXU)
as part of HCI International 2017
start_date: 2017-07-09
date_created: 2018-12-18T10:44:24Z
date_updated: 2022-01-06T07:02:58Z
department:
- _id: '66'
- _id: '534'
- _id: '221'
doi: 10.1007/978-3-319-58634-2_42
intvolume: ' 10288'
language:
- iso: eng
page: 570-583
place: Cham
publication: 'Design, User Experience, and Usability: Theory, Methodology, and Management'
publication_identifier:
isbn:
- '9783319586335'
- '9783319586342'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
series_title: Lecture Notes in Computer Science
status: public
title: 'A Human-Centered Perspective on Software Quality: Acceptance Criteria for
Work 4.0'
type: book_chapter
user_id: '30457'
volume: 10288
year: '2017'
...
---
_id: '16461'
author:
- first_name: Pascal
full_name: Bemmann, Pascal
last_name: Bemmann
- first_name: Felix
full_name: Biermeier, Felix
last_name: Biermeier
- first_name: Jan
full_name: Bürmann, Jan
last_name: Bürmann
- first_name: Arne
full_name: Kemper, Arne
last_name: Kemper
- first_name: Till
full_name: Knollmann, Till
id: '39241'
last_name: Knollmann
orcid: 0000-0003-2014-4696
- first_name: Steffen
full_name: Knorr, Steffen
last_name: Knorr
- first_name: Nils
full_name: Kothe, Nils
last_name: Kothe
- first_name: Alexander
full_name: Mäcker, Alexander
id: '13536'
last_name: Mäcker
- first_name: Manuel
full_name: Malatyali, Manuel
id: '41265'
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
- first_name: Johannes Sebastian
full_name: Schaefer, Johannes Sebastian
id: '30291'
last_name: Schaefer
- first_name: Jannik
full_name: Sundermeier, Jannik
id: '38705'
last_name: Sundermeier
citation:
ama: 'Bemmann P, Biermeier F, Bürmann J, et al. Monitoring of Domain-Related Problems
in Distributed Data Streams. In: Structural Information and Communication Complexity.
; 2017. doi:10.1007/978-3-319-72050-0_13'
apa: Bemmann, P., Biermeier, F., Bürmann, J., Kemper, A., Knollmann, T., Knorr,
S., Kothe, N., Mäcker, A., Malatyali, M., Meyer auf der Heide, F., Riechers, S.,
Schaefer, J. S., & Sundermeier, J. (2017). Monitoring of Domain-Related Problems
in Distributed Data Streams. In Structural Information and Communication Complexity.
https://doi.org/10.1007/978-3-319-72050-0_13
bibtex: '@inbook{Bemmann_Biermeier_Bürmann_Kemper_Knollmann_Knorr_Kothe_Mäcker_Malatyali_Meyer
auf der Heide_et al._2017, place={Cham}, title={Monitoring of Domain-Related Problems
in Distributed Data Streams}, DOI={10.1007/978-3-319-72050-0_13},
booktitle={Structural Information and Communication Complexity}, author={Bemmann,
Pascal and Biermeier, Felix and Bürmann, Jan and Kemper, Arne and Knollmann, Till
and Knorr, Steffen and Kothe, Nils and Mäcker, Alexander and Malatyali, Manuel
and Meyer auf der Heide, Friedhelm and et al.}, year={2017} }'
chicago: Bemmann, Pascal, Felix Biermeier, Jan Bürmann, Arne Kemper, Till Knollmann,
Steffen Knorr, Nils Kothe, et al. “Monitoring of Domain-Related Problems in Distributed
Data Streams.” In Structural Information and Communication Complexity.
Cham, 2017. https://doi.org/10.1007/978-3-319-72050-0_13.
ieee: P. Bemmann et al., “Monitoring of Domain-Related Problems in Distributed
Data Streams,” in Structural Information and Communication Complexity,
Cham, 2017.
mla: Bemmann, Pascal, et al. “Monitoring of Domain-Related Problems in Distributed
Data Streams.” Structural Information and Communication Complexity, 2017,
doi:10.1007/978-3-319-72050-0_13.
short: 'P. Bemmann, F. Biermeier, J. Bürmann, A. Kemper, T. Knollmann, S. Knorr,
N. Kothe, A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, J.S. Schaefer,
J. Sundermeier, in: Structural Information and Communication Complexity, Cham,
2017.'
date_created: 2020-04-08T07:20:20Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-319-72050-0_13
external_id:
arxiv:
- 'arXiv:1706.03568 '
language:
- iso: eng
place: Cham
publication: Structural Information and Communication Complexity
publication_identifier:
isbn:
- '9783319720494'
- '9783319720500'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Monitoring of Domain-Related Problems in Distributed Data Streams
type: book_chapter
user_id: '15415'
year: '2017'
...
---
_id: '14857'
author:
- first_name: Michaela
full_name: Beckschäfer, Michaela
id: '32439'
last_name: Beckschäfer
- first_name: Simon
full_name: Malberg, Simon
last_name: Malberg
- first_name: Kevin
full_name: Tierney, Kevin
last_name: Tierney
- first_name: Christoph
full_name: Weskamp, Christoph
last_name: Weskamp
citation:
ama: 'Beckschäfer M, Malberg S, Tierney K, Weskamp C. Simulating Storage Policies
for an Automated Grid-Based Warehouse System. In: Lecture Notes in Computer
Science. Cham; 2017. doi:10.1007/978-3-319-68496-3_31'
apa: Beckschäfer, M., Malberg, S., Tierney, K., & Weskamp, C. (2017). Simulating
Storage Policies for an Automated Grid-Based Warehouse System. In Lecture Notes
in Computer Science. Cham. https://doi.org/10.1007/978-3-319-68496-3_31
bibtex: '@inbook{Beckschäfer_Malberg_Tierney_Weskamp_2017, place={Cham}, title={Simulating
Storage Policies for an Automated Grid-Based Warehouse System}, DOI={10.1007/978-3-319-68496-3_31},
booktitle={Lecture Notes in Computer Science}, author={Beckschäfer, Michaela and
Malberg, Simon and Tierney, Kevin and Weskamp, Christoph}, year={2017} }'
chicago: Beckschäfer, Michaela, Simon Malberg, Kevin Tierney, and Christoph Weskamp.
“Simulating Storage Policies for an Automated Grid-Based Warehouse System.” In
Lecture Notes in Computer Science. Cham, 2017. https://doi.org/10.1007/978-3-319-68496-3_31.
ieee: M. Beckschäfer, S. Malberg, K. Tierney, and C. Weskamp, “Simulating Storage
Policies for an Automated Grid-Based Warehouse System,” in Lecture Notes in
Computer Science, Cham, 2017.
mla: Beckschäfer, Michaela, et al. “Simulating Storage Policies for an Automated
Grid-Based Warehouse System.” Lecture Notes in Computer Science, 2017,
doi:10.1007/978-3-319-68496-3_31.
short: 'M. Beckschäfer, S. Malberg, K. Tierney, C. Weskamp, in: Lecture Notes in
Computer Science, Cham, 2017.'
date_created: 2019-11-08T08:15:11Z
date_updated: 2022-01-06T06:52:08Z
department:
- _id: '277'
doi: 10.1007/978-3-319-68496-3_31
language:
- iso: eng
place: Cham
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783319684956'
- '9783319684963'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Simulating Storage Policies for an Automated Grid-Based Warehouse System
type: book_chapter
user_id: '1112'
year: '2017'
...
---
_id: '20000'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Gabriele
full_name: Valentini, Gabriele
last_name: Valentini
- first_name: Marco
full_name: Dorigo, Marco
last_name: Dorigo
citation:
ama: 'Hamann H, Valentini G, Dorigo M. Population Coding: A New Design Paradigm
for Embodied Distributed Systems. In: 10th Int. Conf. on Swarm Intelligence,
ANTS 2016. Cham; 2016. doi:10.1007/978-3-319-44427-7_15'
apa: 'Hamann, H., Valentini, G., & Dorigo, M. (2016). Population Coding: A New
Design Paradigm for Embodied Distributed Systems. In 10th Int. Conf. on Swarm
Intelligence, ANTS 2016. Cham. https://doi.org/10.1007/978-3-319-44427-7_15'
bibtex: '@inproceedings{Hamann_Valentini_Dorigo_2016, place={Cham}, title={Population
Coding: A New Design Paradigm for Embodied Distributed Systems}, DOI={10.1007/978-3-319-44427-7_15},
booktitle={10th Int. Conf. on Swarm Intelligence, ANTS 2016}, author={Hamann,
Heiko and Valentini, Gabriele and Dorigo, Marco}, year={2016} }'
chicago: 'Hamann, Heiko, Gabriele Valentini, and Marco Dorigo. “Population Coding:
A New Design Paradigm for Embodied Distributed Systems.” In 10th Int. Conf.
on Swarm Intelligence, ANTS 2016. Cham, 2016. https://doi.org/10.1007/978-3-319-44427-7_15.'
ieee: 'H. Hamann, G. Valentini, and M. Dorigo, “Population Coding: A New Design
Paradigm for Embodied Distributed Systems,” in 10th Int. Conf. on Swarm Intelligence,
ANTS 2016, 2016.'
mla: 'Hamann, Heiko, et al. “Population Coding: A New Design Paradigm for Embodied
Distributed Systems.” 10th Int. Conf. on Swarm Intelligence, ANTS 2016,
2016, doi:10.1007/978-3-319-44427-7_15.'
short: 'H. Hamann, G. Valentini, M. Dorigo, in: 10th Int. Conf. on Swarm Intelligence,
ANTS 2016, Cham, 2016.'
date_created: 2020-10-15T09:55:35Z
date_updated: 2022-01-06T06:54:18Z
department:
- _id: '63'
- _id: '238'
doi: 10.1007/978-3-319-44427-7_15
language:
- iso: eng
place: Cham
publication: 10th Int. Conf. on Swarm Intelligence, ANTS 2016
publication_identifier:
isbn:
- '9783319444260'
- '9783319444277'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: 'Population Coding: A New Design Paradigm for Embodied Distributed Systems'
type: conference
user_id: '15415'
year: '2016'
...
---
_id: '20004'
author:
- first_name: Gabriele
full_name: Valentini, Gabriele
last_name: Valentini
- first_name: Davide
full_name: Brambilla, Davide
last_name: Brambilla
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Marco
full_name: Dorigo, Marco
last_name: Dorigo
citation:
ama: 'Valentini G, Brambilla D, Hamann H, Dorigo M. Collective Perception of Environmental
Features in a Robot Swarm. In: 10th Int. Conf. on Swarm Intelligence, ANTS
2016. ; 2016. doi:10.1007/978-3-319-44427-7_6'
apa: Valentini, G., Brambilla, D., Hamann, H., & Dorigo, M. (2016). Collective
Perception of Environmental Features in a Robot Swarm. In 10th Int. Conf. on
Swarm Intelligence, ANTS 2016. https://doi.org/10.1007/978-3-319-44427-7_6
bibtex: '@inproceedings{Valentini_Brambilla_Hamann_Dorigo_2016, title={Collective
Perception of Environmental Features in a Robot Swarm}, DOI={10.1007/978-3-319-44427-7_6},
booktitle={10th Int. Conf. on Swarm Intelligence, ANTS 2016}, author={Valentini,
Gabriele and Brambilla, Davide and Hamann, Heiko and Dorigo, Marco}, year={2016}
}'
chicago: Valentini, Gabriele, Davide Brambilla, Heiko Hamann, and Marco Dorigo.
“Collective Perception of Environmental Features in a Robot Swarm.” In 10th
Int. Conf. on Swarm Intelligence, ANTS 2016, 2016. https://doi.org/10.1007/978-3-319-44427-7_6.
ieee: G. Valentini, D. Brambilla, H. Hamann, and M. Dorigo, “Collective Perception
of Environmental Features in a Robot Swarm,” in 10th Int. Conf. on Swarm Intelligence,
ANTS 2016, 2016.
mla: Valentini, Gabriele, et al. “Collective Perception of Environmental Features
in a Robot Swarm.” 10th Int. Conf. on Swarm Intelligence, ANTS 2016, 2016,
doi:10.1007/978-3-319-44427-7_6.
short: 'G. Valentini, D. Brambilla, H. Hamann, M. Dorigo, in: 10th Int. Conf. on
Swarm Intelligence, ANTS 2016, 2016.'
date_created: 2020-10-15T10:22:20Z
date_updated: 2022-01-06T06:54:18Z
department:
- _id: '63'
- _id: '238'
doi: 10.1007/978-3-319-44427-7_6
language:
- iso: eng
publication: 10th Int. Conf. on Swarm Intelligence, ANTS 2016
publication_identifier:
isbn:
- '9783319444260'
- '9783319444277'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Collective Perception of Environmental Features in a Robot Swarm
type: conference
user_id: '15415'
year: '2016'
...
---
_id: '2948'
author:
- first_name: Peter
full_name: Günther, Peter
last_name: Günther
- first_name: Volker
full_name: Krummel, Volker
last_name: Krummel
citation:
ama: 'Günther P, Krummel V. Implementing Cryptographic Pairings on Accumulator Based
Smart Card Architectures. In: Mathematical Aspects of Computer and Information
Sciences. Cham: Springer International Publishing; 2016:151-165. doi:10.1007/978-3-319-32859-1_13'
apa: 'Günther, P., & Krummel, V. (2016). Implementing Cryptographic Pairings
on Accumulator Based Smart Card Architectures. In Mathematical Aspects of Computer
and Information Sciences (pp. 151–165). Cham: Springer International Publishing.
https://doi.org/10.1007/978-3-319-32859-1_13'
bibtex: '@inbook{Günther_Krummel_2016, place={Cham}, title={Implementing Cryptographic
Pairings on Accumulator Based Smart Card Architectures}, DOI={10.1007/978-3-319-32859-1_13},
booktitle={Mathematical Aspects of Computer and Information Sciences}, publisher={Springer
International Publishing}, author={Günther, Peter and Krummel, Volker}, year={2016},
pages={151–165} }'
chicago: 'Günther, Peter, and Volker Krummel. “Implementing Cryptographic Pairings
on Accumulator Based Smart Card Architectures.” In Mathematical Aspects of
Computer and Information Sciences, 151–65. Cham: Springer International Publishing,
2016. https://doi.org/10.1007/978-3-319-32859-1_13.'
ieee: 'P. Günther and V. Krummel, “Implementing Cryptographic Pairings on Accumulator
Based Smart Card Architectures,” in Mathematical Aspects of Computer and Information
Sciences, Cham: Springer International Publishing, 2016, pp. 151–165.'
mla: Günther, Peter, and Volker Krummel. “Implementing Cryptographic Pairings on
Accumulator Based Smart Card Architectures.” Mathematical Aspects of Computer
and Information Sciences, Springer International Publishing, 2016, pp. 151–65,
doi:10.1007/978-3-319-32859-1_13.
short: 'P. Günther, V. Krummel, in: Mathematical Aspects of Computer and Information
Sciences, Springer International Publishing, Cham, 2016, pp. 151–165.'
date_created: 2018-05-29T11:26:56Z
date_updated: 2022-01-06T06:58:48Z
department:
- _id: '64'
doi: 10.1007/978-3-319-32859-1_13
page: 151-165
place: Cham
project:
- _id: '43'
name: Securing the Financial Cloud
publication: Mathematical Aspects of Computer and Information Sciences
publication_identifier:
isbn:
- '9783319328584'
- '9783319328591'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: Implementing Cryptographic Pairings on Accumulator Based Smart Card Architectures
type: book_chapter
user_id: '25078'
year: '2016'
...
---
_id: '2968'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Christiane
full_name: Lammersen, Christiane
last_name: Lammersen
- first_name: Melanie
full_name: Schmidt, Melanie
last_name: Schmidt
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
citation:
ama: 'Blömer J, Lammersen C, Schmidt M, Sohler C. Theoretical Analysis of the k-Means
Algorithm – A Survey. In: Algorithm Engineering. Cham: Springer International
Publishing; 2016:81-116. doi:10.1007/978-3-319-49487-6_3'
apa: 'Blömer, J., Lammersen, C., Schmidt, M., & Sohler, C. (2016). Theoretical
Analysis of the k-Means Algorithm – A Survey. In Algorithm Engineering
(pp. 81–116). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-49487-6_3'
bibtex: '@inbook{Blömer_Lammersen_Schmidt_Sohler_2016, place={Cham}, title={Theoretical
Analysis of the k-Means Algorithm – A Survey}, DOI={10.1007/978-3-319-49487-6_3},
booktitle={Algorithm Engineering}, publisher={Springer International Publishing},
author={Blömer, Johannes and Lammersen, Christiane and Schmidt, Melanie and Sohler,
Christian}, year={2016}, pages={81–116} }'
chicago: 'Blömer, Johannes, Christiane Lammersen, Melanie Schmidt, and Christian
Sohler. “Theoretical Analysis of the K-Means Algorithm – A Survey.” In Algorithm
Engineering, 81–116. Cham: Springer International Publishing, 2016. https://doi.org/10.1007/978-3-319-49487-6_3.'
ieee: 'J. Blömer, C. Lammersen, M. Schmidt, and C. Sohler, “Theoretical Analysis
of the k-Means Algorithm – A Survey,” in Algorithm Engineering, Cham: Springer
International Publishing, 2016, pp. 81–116.'
mla: Blömer, Johannes, et al. “Theoretical Analysis of the K-Means Algorithm – A
Survey.” Algorithm Engineering, Springer International Publishing, 2016,
pp. 81–116, doi:10.1007/978-3-319-49487-6_3.
short: 'J. Blömer, C. Lammersen, M. Schmidt, C. Sohler, in: Algorithm Engineering,
Springer International Publishing, Cham, 2016, pp. 81–116.'
date_created: 2018-06-04T12:22:40Z
date_updated: 2022-01-06T06:58:49Z
department:
- _id: '64'
doi: 10.1007/978-3-319-49487-6_3
page: 81-116
place: Cham
publication: Algorithm Engineering
publication_identifier:
isbn:
- '9783319494869'
- '9783319494876'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: Theoretical Analysis of the k-Means Algorithm – A Survey
type: book_chapter
user_id: '25078'
year: '2016'
...
---
_id: '2970'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Kathrin
full_name: Bujna, Kathrin
last_name: Bujna
citation:
ama: 'Blömer J, Bujna K. Adaptive Seeding for Gaussian Mixture Models. In: Advances
in Knowledge Discovery and Data Mining. Cham: Springer International Publishing;
2016:296-308. doi:10.1007/978-3-319-31750-2_24'
apa: 'Blömer, J., & Bujna, K. (2016). Adaptive Seeding for Gaussian Mixture
Models. In Advances in Knowledge Discovery and Data Mining (pp. 296–308).
Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-31750-2_24'
bibtex: '@inbook{Blömer_Bujna_2016, place={Cham}, title={Adaptive Seeding for Gaussian
Mixture Models}, DOI={10.1007/978-3-319-31750-2_24},
booktitle={Advances in Knowledge Discovery and Data Mining}, publisher={Springer
International Publishing}, author={Blömer, Johannes and Bujna, Kathrin}, year={2016},
pages={296–308} }'
chicago: 'Blömer, Johannes, and Kathrin Bujna. “Adaptive Seeding for Gaussian Mixture
Models.” In Advances in Knowledge Discovery and Data Mining, 296–308. Cham:
Springer International Publishing, 2016. https://doi.org/10.1007/978-3-319-31750-2_24.'
ieee: 'J. Blömer and K. Bujna, “Adaptive Seeding for Gaussian Mixture Models,” in
Advances in Knowledge Discovery and Data Mining, Cham: Springer International
Publishing, 2016, pp. 296–308.'
mla: Blömer, Johannes, and Kathrin Bujna. “Adaptive Seeding for Gaussian Mixture
Models.” Advances in Knowledge Discovery and Data Mining, Springer International
Publishing, 2016, pp. 296–308, doi:10.1007/978-3-319-31750-2_24.
short: 'J. Blömer, K. Bujna, in: Advances in Knowledge Discovery and Data Mining,
Springer International Publishing, Cham, 2016, pp. 296–308.'
date_created: 2018-06-04T12:27:21Z
date_updated: 2022-01-06T06:58:49Z
department:
- _id: '64'
doi: 10.1007/978-3-319-31750-2_24
page: 296-308
place: Cham
publication: Advances in Knowledge Discovery and Data Mining
publication_identifier:
isbn:
- '9783319317496'
- '9783319317502'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: Adaptive Seeding for Gaussian Mixture Models
type: book_chapter
user_id: '25078'
year: '2016'
...
---
_id: '5825'
abstract:
- lang: eng
text: Integrating apps on mobile devices into applications running on other devices
is usually difficult. For instance, using a messenger on a smartphone to share
a text written on a desktop computer often ends up in a cumbersome solution to
transfer the text, because many applications are not designed for such scenarios.
In this paper, we present an approach enabling the integration of apps running
on Android devices into applications running on other devices and even other platforms.
This is achieved by specifying adapters for Android apps, which map their services
to a platform-independent service interface. For this purpose, we have developed
a domain-specific language to ease the specification of such mappings. Our approach
is applicable without the need to modify the existing Android apps providing the
service. We analyzed its feasibility by implementing our approach and by specifying
mappings for several popular Android apps, e.g., phone book, camera, and file
explorer.
author:
- first_name: Dennis
full_name: Wolters, Dennis
id: '11308'
last_name: Wolters
- first_name: Jonas
full_name: Kirchhoff, Jonas
id: '39928'
last_name: Kirchhoff
- first_name: Christian
full_name: Gerth, Christian
last_name: Gerth
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'Wolters D, Kirchhoff J, Gerth C, Engels G. Cross-Device Integration of Android
Apps. In: Sheng QZ, Stroulia E, Tata S, Bhiri S, eds. Service-Oriented Computing.
Cham: Springer International Publishing; 2016:171-185. doi:10.1007/978-3-319-46295-0_11'
apa: 'Wolters, D., Kirchhoff, J., Gerth, C., & Engels, G. (2016). Cross-Device
Integration of Android Apps. In Q. Z. Sheng, E. Stroulia, S. Tata, & S. Bhiri
(Eds.), Service-Oriented Computing (pp. 171–185). Cham: Springer International
Publishing. https://doi.org/10.1007/978-3-319-46295-0_11'
bibtex: '@inproceedings{Wolters_Kirchhoff_Gerth_Engels_2016, place={Cham}, title={Cross-Device
Integration of Android Apps}, DOI={10.1007/978-3-319-46295-0_11},
booktitle={Service-Oriented Computing}, publisher={Springer International Publishing},
author={Wolters, Dennis and Kirchhoff, Jonas and Gerth, Christian and Engels,
Gregor}, editor={Sheng, Quan Z. and Stroulia, Eleni and Tata, Samir and Bhiri,
Sami Editors}, year={2016}, pages={171–185} }'
chicago: 'Wolters, Dennis, Jonas Kirchhoff, Christian Gerth, and Gregor Engels.
“Cross-Device Integration of Android Apps.” In Service-Oriented Computing,
edited by Quan Z. Sheng, Eleni Stroulia, Samir Tata, and Sami Bhiri, 171–85.
Cham: Springer International Publishing, 2016. https://doi.org/10.1007/978-3-319-46295-0_11.'
ieee: D. Wolters, J. Kirchhoff, C. Gerth, and G. Engels, “Cross-Device Integration
of Android Apps,” in Service-Oriented Computing, 2016, pp. 171–185.
mla: Wolters, Dennis, et al. “Cross-Device Integration of Android Apps.” Service-Oriented
Computing, edited by Quan Z. Sheng et al., Springer International Publishing,
2016, pp. 171–85, doi:10.1007/978-3-319-46295-0_11.
short: 'D. Wolters, J. Kirchhoff, C. Gerth, G. Engels, in: Q.Z. Sheng, E. Stroulia,
S. Tata, S. Bhiri (Eds.), Service-Oriented Computing, Springer International Publishing,
Cham, 2016, pp. 171–185.'
date_created: 2018-11-26T10:21:38Z
date_updated: 2022-01-06T07:02:43Z
department:
- _id: '66'
doi: 10.1007/978-3-319-46295-0_11
editor:
- first_name: 'Quan Z. '
full_name: 'Sheng, Quan Z. '
last_name: Sheng
- first_name: 'Eleni '
full_name: 'Stroulia, Eleni '
last_name: Stroulia
- first_name: 'Samir '
full_name: 'Tata, Samir '
last_name: Tata
- first_name: 'Sami '
full_name: 'Bhiri, Sami '
last_name: Bhiri
keyword:
- Cross-Device
- Integration
- Android
- Adapter
- DSL
language:
- iso: eng
page: 171-185
place: Cham
publication: Service-Oriented Computing
publication_identifier:
isbn:
- '9783319462943'
- '9783319462950'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: Cross-Device Integration of Android Apps
type: conference
user_id: '39928'
year: '2016'
...
---
_id: '6257'
author:
- first_name: Holger Gerhard
full_name: Fischer, Holger Gerhard
id: '30457'
last_name: Fischer
- first_name: Björn
full_name: Senft, Björn
id: '9109'
last_name: Senft
citation:
ama: 'Fischer HG, Senft B. Human-Centered Software Engineering as a Chance to Ensure
Software Quality Within the Digitization of Human Workflows. In: Bogdan C, ed.
Human-Centered and Error-Resilient Systems Development. Vol 9856. Lecture
Notes in Computer Science. Cham: Springer International Publishing; 2016:30-41.
doi:10.1007/978-3-319-44902-9_3'
apa: 'Fischer, H. G., & Senft, B. (2016). Human-Centered Software Engineering
as a Chance to Ensure Software Quality Within the Digitization of Human Workflows.
In C. Bogdan (Ed.), Human-Centered and Error-Resilient Systems Development
(Vol. 9856, pp. 30–41). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-44902-9_3'
bibtex: '@inbook{Fischer_Senft_2016, place={Cham}, series={Lecture Notes in Computer
Science}, title={Human-Centered Software Engineering as a Chance to Ensure Software
Quality Within the Digitization of Human Workflows}, volume={9856}, DOI={10.1007/978-3-319-44902-9_3},
booktitle={Human-Centered and Error-Resilient Systems Development}, publisher={Springer
International Publishing}, author={Fischer, Holger Gerhard and Senft, Björn},
editor={Bogdan, ChristianEditor}, year={2016}, pages={30–41}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Fischer, Holger Gerhard, and Björn Senft. “Human-Centered Software Engineering
as a Chance to Ensure Software Quality Within the Digitization of Human Workflows.”
In Human-Centered and Error-Resilient Systems Development, edited by Christian
Bogdan, 9856:30–41. Lecture Notes in Computer Science. Cham: Springer International
Publishing, 2016. https://doi.org/10.1007/978-3-319-44902-9_3.'
ieee: 'H. G. Fischer and B. Senft, “Human-Centered Software Engineering as a Chance
to Ensure Software Quality Within the Digitization of Human Workflows,” in Human-Centered
and Error-Resilient Systems Development, vol. 9856, C. Bogdan, Ed. Cham: Springer
International Publishing, 2016, pp. 30–41.'
mla: Fischer, Holger Gerhard, and Björn Senft. “Human-Centered Software Engineering
as a Chance to Ensure Software Quality Within the Digitization of Human Workflows.”
Human-Centered and Error-Resilient Systems Development, edited by Christian
Bogdan, vol. 9856, Springer International Publishing, 2016, pp. 30–41, doi:10.1007/978-3-319-44902-9_3.
short: 'H.G. Fischer, B. Senft, in: C. Bogdan (Ed.), Human-Centered and Error-Resilient
Systems Development, Springer International Publishing, Cham, 2016, pp. 30–41.'
conference:
end_date: 2016-08-31
location: Stockholm, Sweden
name: International Conference on Human-Centred Software Engineering
start_date: 2016-08-29
date_created: 2018-12-18T10:51:10Z
date_updated: 2022-01-06T07:02:58Z
department:
- _id: '66'
- _id: '534'
- _id: '221'
doi: 10.1007/978-3-319-44902-9_3
editor:
- first_name: Christian
full_name: Bogdan, Christian
last_name: Bogdan
intvolume: ' 9856'
language:
- iso: eng
page: 30-41
place: Cham
publication: Human-Centered and Error-Resilient Systems Development
publication_identifier:
isbn:
- '9783319449012'
- '9783319449029'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
series_title: Lecture Notes in Computer Science
status: public
title: Human-Centered Software Engineering as a Chance to Ensure Software Quality
Within the Digitization of Human Workflows
type: book_chapter
user_id: '30457'
volume: 9856
year: '2016'
...
---
_id: '2978'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Kathrin
full_name: Bujna, Kathrin
last_name: Bujna
citation:
ama: 'Blömer J, Bujna K. Adaptive Seeding for Gaussian Mixture Models. In: Advances
in Knowledge Discovery and Data Mining. Springer International Publishing;
2016:296-308. doi:10.1007/978-3-319-31750-2_24'
apa: Blömer, J., & Bujna, K. (2016). Adaptive Seeding for Gaussian Mixture Models.
In Advances in Knowledge Discovery and Data Mining (pp. 296–308). Springer
International Publishing. https://doi.org/10.1007/978-3-319-31750-2_24
bibtex: '@inbook{Blömer_Bujna_2016, place={Cham}, title={Adaptive Seeding for Gaussian
Mixture Models}, DOI={10.1007/978-3-319-31750-2_24},
booktitle={Advances in Knowledge Discovery and Data Mining}, publisher={Springer
International Publishing}, author={Blömer, Johannes and Bujna, Kathrin}, year={2016},
pages={296–308} }'
chicago: 'Blömer, Johannes, and Kathrin Bujna. “Adaptive Seeding for Gaussian Mixture
Models.” In Advances in Knowledge Discovery and Data Mining, 296–308. Cham:
Springer International Publishing, 2016. https://doi.org/10.1007/978-3-319-31750-2_24.'
ieee: 'J. Blömer and K. Bujna, “Adaptive Seeding for Gaussian Mixture Models,” in
Advances in Knowledge Discovery and Data Mining, Cham: Springer International
Publishing, 2016, pp. 296–308.'
mla: Blömer, Johannes, and Kathrin Bujna. “Adaptive Seeding for Gaussian Mixture
Models.” Advances in Knowledge Discovery and Data Mining, Springer International
Publishing, 2016, pp. 296–308, doi:10.1007/978-3-319-31750-2_24.
short: 'J. Blömer, K. Bujna, in: Advances in Knowledge Discovery and Data Mining,
Springer International Publishing, Cham, 2016, pp. 296–308.'
date_created: 2018-06-05T07:31:39Z
date_updated: 2023-01-10T13:49:50Z
department:
- _id: '64'
doi: 10.1007/978-3-319-31750-2_24
page: 296-308
place: Cham
publication: Advances in Knowledge Discovery and Data Mining
publication_identifier:
isbn:
- '9783319317496'
- '9783319317502'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: Adaptive Seeding for Gaussian Mixture Models
type: book_chapter
user_id: '25078'
year: '2016'
...
---
_id: '2921'
author:
- first_name: Olivier
full_name: Blazy, Olivier
last_name: Blazy
- first_name: Saqib
full_name: Kakvi, Saqib
id: '66268'
last_name: Kakvi
- first_name: Eike
full_name: Kiltz, Eike
last_name: Kiltz
- first_name: Jiaxin
full_name: Pan, Jiaxin
last_name: Pan
citation:
ama: 'Blazy O, Kakvi S, Kiltz E, Pan J. Tightly-Secure Signatures from Chameleon
Hash Functions. In: Lecture Notes in Computer Science. Berlin, Heidelberg:
Springer Berlin Heidelberg; 2015:256-279. doi:10.1007/978-3-662-46447-2_12'
apa: 'Blazy, O., Kakvi, S., Kiltz, E., & Pan, J. (2015). Tightly-Secure Signatures
from Chameleon Hash Functions. In Lecture Notes in Computer Science (pp.
256–279). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-662-46447-2_12'
bibtex: '@inbook{Blazy_Kakvi_Kiltz_Pan_2015, place={Berlin, Heidelberg}, title={Tightly-Secure
Signatures from Chameleon Hash Functions}, DOI={10.1007/978-3-662-46447-2_12},
booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg},
author={Blazy, Olivier and Kakvi, Saqib and Kiltz, Eike and Pan, Jiaxin}, year={2015},
pages={256–279} }'
chicago: 'Blazy, Olivier, Saqib Kakvi, Eike Kiltz, and Jiaxin Pan. “Tightly-Secure
Signatures from Chameleon Hash Functions.” In Lecture Notes in Computer Science,
256–79. Berlin, Heidelberg: Springer Berlin Heidelberg, 2015. https://doi.org/10.1007/978-3-662-46447-2_12.'
ieee: 'O. Blazy, S. Kakvi, E. Kiltz, and J. Pan, “Tightly-Secure Signatures from
Chameleon Hash Functions,” in Lecture Notes in Computer Science, Berlin,
Heidelberg: Springer Berlin Heidelberg, 2015, pp. 256–279.'
mla: Blazy, Olivier, et al. “Tightly-Secure Signatures from Chameleon Hash Functions.”
Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2015, pp.
256–79, doi:10.1007/978-3-662-46447-2_12.
short: 'O. Blazy, S. Kakvi, E. Kiltz, J. Pan, in: Lecture Notes in Computer Science,
Springer Berlin Heidelberg, Berlin, Heidelberg, 2015, pp. 256–279.'
date_created: 2018-05-25T12:46:08Z
date_updated: 2022-01-06T06:58:47Z
department:
- _id: '558'
doi: 10.1007/978-3-662-46447-2_12
extern: '1'
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2014/1021.pdf
oa: '1'
page: 256-279
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783662464465'
- '9783662464472'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Tightly-Secure Signatures from Chameleon Hash Functions
type: book_chapter
user_id: '66268'
year: '2015'
...
---
_id: '15897'
author:
- first_name: Christian
full_name: Altmeier, Christian
last_name: Altmeier
- first_name: Christian
full_name: Mainka, Christian
last_name: Mainka
- first_name: Juraj
full_name: Somorovsky, Juraj
id: '83504'
last_name: Somorovsky
orcid: 0000-0002-3593-7720
- first_name: Jörg
full_name: Schwenk, Jörg
last_name: Schwenk
citation:
ama: 'Altmeier C, Mainka C, Somorovsky J, Schwenk J. AdIDoS – Adaptive and Intelligent
Fully-Automatic Detection of Denial-of-Service Weaknesses in Web Services. In:
Data Privacy Management, and Security Assurance - 10th International Workshop,
{DPM} 2015, and 4th International Workshop, {QASA} 2015. Lecture Notes in
Computer Science 9481. Cham; 2015. doi:10.1007/978-3-319-29883-2_5'
apa: Altmeier, C., Mainka, C., Somorovsky, J., & Schwenk, J. (2015). AdIDoS
– Adaptive and Intelligent Fully-Automatic Detection of Denial-of-Service Weaknesses
in Web Services. In Data Privacy Management, and Security Assurance - 10th
International Workshop, {DPM} 2015, and 4th International Workshop, {QASA} 2015.
Cham. https://doi.org/10.1007/978-3-319-29883-2_5
bibtex: '@inbook{Altmeier_Mainka_Somorovsky_Schwenk_2015, place={Cham}, series={Lecture
Notes in Computer Science 9481}, title={AdIDoS – Adaptive and Intelligent Fully-Automatic
Detection of Denial-of-Service Weaknesses in Web Services}, DOI={10.1007/978-3-319-29883-2_5},
booktitle={Data Privacy Management, and Security Assurance - 10th International
Workshop, {DPM} 2015, and 4th International Workshop, {QASA} 2015}, author={Altmeier,
Christian and Mainka, Christian and Somorovsky, Juraj and Schwenk, Jörg}, year={2015},
collection={Lecture Notes in Computer Science 9481} }'
chicago: Altmeier, Christian, Christian Mainka, Juraj Somorovsky, and Jörg Schwenk.
“AdIDoS – Adaptive and Intelligent Fully-Automatic Detection of Denial-of-Service
Weaknesses in Web Services.” In Data Privacy Management, and Security Assurance
- 10th International Workshop, {DPM} 2015, and 4th International Workshop, {QASA}
2015. Lecture Notes in Computer Science 9481. Cham, 2015. https://doi.org/10.1007/978-3-319-29883-2_5.
ieee: C. Altmeier, C. Mainka, J. Somorovsky, and J. Schwenk, “AdIDoS – Adaptive
and Intelligent Fully-Automatic Detection of Denial-of-Service Weaknesses in Web
Services,” in Data Privacy Management, and Security Assurance - 10th International
Workshop, {DPM} 2015, and 4th International Workshop, {QASA} 2015, Cham, 2015.
mla: Altmeier, Christian, et al. “AdIDoS – Adaptive and Intelligent Fully-Automatic
Detection of Denial-of-Service Weaknesses in Web Services.” Data Privacy Management,
and Security Assurance - 10th International Workshop, {DPM} 2015, and 4th International
Workshop, {QASA} 2015, 2015, doi:10.1007/978-3-319-29883-2_5.
short: 'C. Altmeier, C. Mainka, J. Somorovsky, J. Schwenk, in: Data Privacy Management,
and Security Assurance - 10th International Workshop, {DPM} 2015, and 4th International
Workshop, {QASA} 2015, Cham, 2015.'
conference:
location: Vienna
date_created: 2020-02-15T09:40:09Z
date_updated: 2022-01-06T06:52:39Z
doi: 10.1007/978-3-319-29883-2_5
language:
- iso: eng
place: Cham
publication: Data Privacy Management, and Security Assurance - 10th International
Workshop, {DPM} 2015, and 4th International Workshop, {QASA} 2015
publication_identifier:
isbn:
- '9783319298825'
- '9783319298832'
issn:
- 0302-9743
- 1611-3349
publication_status: published
series_title: Lecture Notes in Computer Science 9481
status: public
title: AdIDoS – Adaptive and Intelligent Fully-Automatic Detection of Denial-of-Service
Weaknesses in Web Services
type: book_chapter
user_id: '83504'
year: '2015'
...
---
_id: '15899'
author:
- first_name: Tibor
full_name: Jager, Tibor
last_name: Jager
- first_name: Jörg
full_name: Schwenk, Jörg
last_name: Schwenk
- first_name: Juraj
full_name: Somorovsky, Juraj
id: '83504'
last_name: Somorovsky
orcid: 0000-0002-3593-7720
citation:
ama: 'Jager T, Schwenk J, Somorovsky J. Practical Invalid Curve Attacks on TLS-ECDH.
In: Computer Security -- ESORICS 2015. Cham; 2015. doi:10.1007/978-3-319-24174-6_21'
apa: Jager, T., Schwenk, J., & Somorovsky, J. (2015). Practical Invalid Curve
Attacks on TLS-ECDH. In Computer Security -- ESORICS 2015. Cham. https://doi.org/10.1007/978-3-319-24174-6_21
bibtex: '@inbook{Jager_Schwenk_Somorovsky_2015, place={Cham}, title={Practical Invalid
Curve Attacks on TLS-ECDH}, DOI={10.1007/978-3-319-24174-6_21},
booktitle={Computer Security -- ESORICS 2015}, author={Jager, Tibor and Schwenk,
Jörg and Somorovsky, Juraj}, year={2015} }'
chicago: Jager, Tibor, Jörg Schwenk, and Juraj Somorovsky. “Practical Invalid Curve
Attacks on TLS-ECDH.” In Computer Security -- ESORICS 2015. Cham, 2015.
https://doi.org/10.1007/978-3-319-24174-6_21.
ieee: T. Jager, J. Schwenk, and J. Somorovsky, “Practical Invalid Curve Attacks
on TLS-ECDH,” in Computer Security -- ESORICS 2015, Cham, 2015.
mla: Jager, Tibor, et al. “Practical Invalid Curve Attacks on TLS-ECDH.” Computer
Security -- ESORICS 2015, 2015, doi:10.1007/978-3-319-24174-6_21.
short: 'T. Jager, J. Schwenk, J. Somorovsky, in: Computer Security -- ESORICS 2015,
Cham, 2015.'
date_created: 2020-02-15T09:41:17Z
date_updated: 2022-01-06T06:52:39Z
doi: 10.1007/978-3-319-24174-6_21
extern: '1'
language:
- iso: eng
main_file_link:
- url: https://www.nds.ruhr-uni-bochum.de/research/publications/ESORICS15/
place: Cham
publication: Computer Security -- ESORICS 2015
publication_identifier:
isbn:
- '9783319241739'
- '9783319241746'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Practical Invalid Curve Attacks on TLS-ECDH
type: book_chapter
user_id: '83504'
year: '2015'
...
---
_id: '15088'
author:
- first_name: Stefan
full_name: Böttcher, Stefan
id: '624'
last_name: Böttcher
- first_name: Rita
full_name: Hartel, Rita
id: '14961'
last_name: Hartel
- first_name: Thomas
full_name: Jacobs, Thomas
last_name: Jacobs
- first_name: Markus
full_name: Jeromin, Markus
last_name: Jeromin
citation:
ama: 'Böttcher S, Hartel R, Jacobs T, Jeromin M. ECST – Extended Context-Free Straight-Line
Tree Grammars. In: Data Science - 30th British International Conference on
Databases, BICOD 2015. Springer; 2015:186-198. doi:10.1007/978-3-319-20424-6_18'
apa: Böttcher, S., Hartel, R., Jacobs, T., & Jeromin, M. (2015). ECST – Extended
Context-Free Straight-Line Tree Grammars. In Data Science - 30th British International
Conference on Databases, BICOD 2015 (pp. 186–198). Springer. https://doi.org/10.1007/978-3-319-20424-6_18
bibtex: '@inproceedings{Böttcher_Hartel_Jacobs_Jeromin_2015, title={ECST – Extended
Context-Free Straight-Line Tree Grammars}, DOI={10.1007/978-3-319-20424-6_18},
booktitle={Data Science - 30th British International Conference on Databases,
BICOD 2015}, publisher={Springer}, author={Böttcher, Stefan and Hartel, Rita and
Jacobs, Thomas and Jeromin, Markus}, year={2015}, pages={186–198} }'
chicago: Böttcher, Stefan, Rita Hartel, Thomas Jacobs, and Markus Jeromin. “ECST
– Extended Context-Free Straight-Line Tree Grammars.” In Data Science - 30th
British International Conference on Databases, BICOD 2015, 186–98. Springer,
2015. https://doi.org/10.1007/978-3-319-20424-6_18.
ieee: S. Böttcher, R. Hartel, T. Jacobs, and M. Jeromin, “ECST – Extended Context-Free
Straight-Line Tree Grammars,” in Data Science - 30th British International
Conference on Databases, BICOD 2015, 2015, pp. 186–198.
mla: Böttcher, Stefan, et al. “ECST – Extended Context-Free Straight-Line Tree Grammars.”
Data Science - 30th British International Conference on Databases, BICOD 2015,
Springer, 2015, pp. 186–98, doi:10.1007/978-3-319-20424-6_18.
short: 'S. Böttcher, R. Hartel, T. Jacobs, M. Jeromin, in: Data Science - 30th British
International Conference on Databases, BICOD 2015, Springer, 2015, pp. 186–198.'
date_created: 2019-11-21T15:08:13Z
date_updated: 2022-01-06T06:52:15Z
department:
- _id: '69'
doi: 10.1007/978-3-319-20424-6_18
language:
- iso: eng
page: 186-198
publication: Data Science - 30th British International Conference on Databases, BICOD
2015
publication_identifier:
isbn:
- '9783319204239'
- '9783319204246'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer
status: public
title: ECST – Extended Context-Free Straight-Line Tree Grammars
type: conference
user_id: '14961'
year: '2015'
...
---
_id: '25338'
author:
- first_name: Michaela
full_name: Geierhos, Michaela
last_name: Geierhos
- first_name: Frederik S.
full_name: Bäumer, Frederik S.
last_name: Bäumer
- first_name: Sabine
full_name: Schulze, Sabine
last_name: Schulze
- first_name: Caterina
full_name: Klotz, Caterina
last_name: Klotz
citation:
ama: 'Geierhos M, Bäumer FS, Schulze S, Klotz C. Understanding the Patient 2.0.
In: Modeling and Using Context. ; 2015. doi:10.1007/978-3-319-25591-0_12'
apa: Geierhos, M., Bäumer, F. S., Schulze, S., & Klotz, C. (2015). Understanding
the Patient 2.0. In Modeling and Using Context. https://doi.org/10.1007/978-3-319-25591-0_12
bibtex: '@inbook{Geierhos_Bäumer_Schulze_Klotz_2015, place={Cham}, title={Understanding
the Patient 2.0}, DOI={10.1007/978-3-319-25591-0_12},
booktitle={Modeling and Using Context}, author={Geierhos, Michaela and Bäumer,
Frederik S. and Schulze, Sabine and Klotz, Caterina}, year={2015} }'
chicago: Geierhos, Michaela, Frederik S. Bäumer, Sabine Schulze, and Caterina Klotz.
“Understanding the Patient 2.0.” In Modeling and Using Context. Cham, 2015.
https://doi.org/10.1007/978-3-319-25591-0_12.
ieee: M. Geierhos, F. S. Bäumer, S. Schulze, and C. Klotz, “Understanding the Patient
2.0,” in Modeling and Using Context, Cham, 2015.
mla: Geierhos, Michaela, et al. “Understanding the Patient 2.0.” Modeling and
Using Context, 2015, doi:10.1007/978-3-319-25591-0_12.
short: 'M. Geierhos, F.S. Bäumer, S. Schulze, C. Klotz, in: Modeling and Using Context,
Cham, 2015.'
date_created: 2021-10-04T19:02:33Z
date_updated: 2022-01-25T18:21:15Z
doi: 10.1007/978-3-319-25591-0_12
place: Cham
publication: Modeling and Using Context
publication_identifier:
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Understanding the Patient 2.0
type: book_chapter
user_id: '71124'
year: '2015'
...
---
_id: '25337'
author:
- first_name: Michaela
full_name: Geierhos, Michaela
last_name: Geierhos
- first_name: Frederik S.
full_name: Bäumer, Frederik S.
last_name: Bäumer
- first_name: Sabine
full_name: Schulze, Sabine
last_name: Schulze
- first_name: Caterina
full_name: Klotz, Caterina
last_name: Klotz
citation:
ama: 'Geierhos M, Bäumer FS, Schulze S, Klotz C. Understanding the Patient 2.0.
In: Modeling and Using Context. ; 2015. doi:10.1007/978-3-319-25591-0_12'
apa: Geierhos, M., Bäumer, F. S., Schulze, S., & Klotz, C. (2015). Understanding
the Patient 2.0. In Modeling and Using Context. https://doi.org/10.1007/978-3-319-25591-0_12
bibtex: '@inbook{Geierhos_Bäumer_Schulze_Klotz_2015, place={Cham}, title={Understanding
the Patient 2.0}, DOI={10.1007/978-3-319-25591-0_12},
booktitle={Modeling and Using Context}, author={Geierhos, Michaela and Bäumer,
Frederik S. and Schulze, Sabine and Klotz, Caterina}, year={2015} }'
chicago: Geierhos, Michaela, Frederik S. Bäumer, Sabine Schulze, and Caterina Klotz.
“Understanding the Patient 2.0.” In Modeling and Using Context. Cham, 2015.
https://doi.org/10.1007/978-3-319-25591-0_12.
ieee: M. Geierhos, F. S. Bäumer, S. Schulze, and C. Klotz, “Understanding the Patient
2.0,” in Modeling and Using Context, Cham, 2015.
mla: Geierhos, Michaela, et al. “Understanding the Patient 2.0.” Modeling and
Using Context, 2015, doi:10.1007/978-3-319-25591-0_12.
short: 'M. Geierhos, F.S. Bäumer, S. Schulze, C. Klotz, in: Modeling and Using Context,
Cham, 2015.'
date_created: 2021-10-04T18:59:54Z
date_updated: 2022-01-25T18:21:13Z
doi: 10.1007/978-3-319-25591-0_12
place: Cham
publication: Modeling and Using Context
publication_identifier:
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Understanding the Patient 2.0
type: book_chapter
user_id: '71124'
year: '2015'
...
---
_id: '20008'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Gabriele
full_name: Valentini, Gabriele
last_name: Valentini
citation:
ama: 'Hamann H, Valentini G. Swarm in a Fly Bottle: Feedback-Based Analysis of Self-organizing
Temporary Lock-ins. In: Ninth Int. Conf. on Swarm Intelligence (ANTS 2014).
Cham; 2014. doi:10.1007/978-3-319-09952-1_15'
apa: 'Hamann, H., & Valentini, G. (2014). Swarm in a Fly Bottle: Feedback-Based
Analysis of Self-organizing Temporary Lock-ins. In Ninth Int. Conf. on Swarm
Intelligence (ANTS 2014). Cham. https://doi.org/10.1007/978-3-319-09952-1_15'
bibtex: '@inproceedings{Hamann_Valentini_2014, place={Cham}, title={Swarm in a Fly
Bottle: Feedback-Based Analysis of Self-organizing Temporary Lock-ins}, DOI={10.1007/978-3-319-09952-1_15},
booktitle={Ninth Int. Conf. on Swarm Intelligence (ANTS 2014)}, author={Hamann,
Heiko and Valentini, Gabriele}, year={2014} }'
chicago: 'Hamann, Heiko, and Gabriele Valentini. “Swarm in a Fly Bottle: Feedback-Based
Analysis of Self-Organizing Temporary Lock-Ins.” In Ninth Int. Conf. on Swarm
Intelligence (ANTS 2014). Cham, 2014. https://doi.org/10.1007/978-3-319-09952-1_15.'
ieee: 'H. Hamann and G. Valentini, “Swarm in a Fly Bottle: Feedback-Based Analysis
of Self-organizing Temporary Lock-ins,” in Ninth Int. Conf. on Swarm Intelligence
(ANTS 2014), 2014.'
mla: 'Hamann, Heiko, and Gabriele Valentini. “Swarm in a Fly Bottle: Feedback-Based
Analysis of Self-Organizing Temporary Lock-Ins.” Ninth Int. Conf. on Swarm
Intelligence (ANTS 2014), 2014, doi:10.1007/978-3-319-09952-1_15.'
short: 'H. Hamann, G. Valentini, in: Ninth Int. Conf. on Swarm Intelligence (ANTS
2014), Cham, 2014.'
date_created: 2020-10-15T14:13:51Z
date_updated: 2022-01-06T06:54:18Z
department:
- _id: '63'
- _id: '238'
doi: 10.1007/978-3-319-09952-1_15
language:
- iso: eng
place: Cham
publication: Ninth Int. Conf. on Swarm Intelligence (ANTS 2014)
publication_identifier:
isbn:
- '9783319099514'
- '9783319099521'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: 'Swarm in a Fly Bottle: Feedback-Based Analysis of Self-organizing Temporary
Lock-ins'
type: conference
user_id: '15415'
year: '2014'
...
---
_id: '20982'
abstract:
- lang: eng
text: "Real-time software-intensive embedded systems complexity, as in the automotive
domain, requires rigorous Requirements Engineering (RE) approaches. Scenario-based
RE formalisms like Modal Sequence Diagrams (MSDs) enable an intuitive specication
and the simulative validation of functional requirements. However, the dependencies
between events occurring in different MSD scenarios are implicit so that it is
difficult to find causes of requirements defects, if any. The automotive architecture
description language EAST-ADL addresses this problem by relying on event chains,
which make dependencies between events explicit. However, EAST-ADL event chains
have a low abstraction level, and their relationship to functional requirements
has seldom been investigated. Based on the EAST-ADL functional architecture, we
propose to use its central notion of event to conciliate both approaches. We conceived
an automatic transformation from the high abstraction level requirements specified
in MSDs to the low abstraction level event chains.\r\n"
author:
- first_name: Thorsten
full_name: Koch, Thorsten
id: '13616'
last_name: Koch
- first_name: Jörg
full_name: Holtmann, Jörg
id: '3875'
last_name: Holtmann
orcid: 0000-0001-6141-4571
- first_name: Julien
full_name: DeAntoni, Julien
last_name: DeAntoni
citation:
ama: 'Koch T, Holtmann J, DeAntoni J. Generating EAST-ADL Event Chains from Scenario-Based
Requirements Specifications. In: Software Architecture. Cham; 2014. doi:10.1007/978-3-319-09970-5_14'
apa: Koch, T., Holtmann, J., & DeAntoni, J. (2014). Generating EAST-ADL Event
Chains from Scenario-Based Requirements Specifications. In Software Architecture.
Cham. https://doi.org/10.1007/978-3-319-09970-5_14
bibtex: '@inbook{Koch_Holtmann_DeAntoni_2014, place={Cham}, title={Generating EAST-ADL
Event Chains from Scenario-Based Requirements Specifications}, DOI={10.1007/978-3-319-09970-5_14},
booktitle={Software Architecture}, author={Koch, Thorsten and Holtmann, Jörg and
DeAntoni, Julien}, year={2014} }'
chicago: Koch, Thorsten, Jörg Holtmann, and Julien DeAntoni. “Generating EAST-ADL
Event Chains from Scenario-Based Requirements Specifications.” In Software
Architecture. Cham, 2014. https://doi.org/10.1007/978-3-319-09970-5_14.
ieee: T. Koch, J. Holtmann, and J. DeAntoni, “Generating EAST-ADL Event Chains from
Scenario-Based Requirements Specifications,” in Software Architecture,
Cham, 2014.
mla: Koch, Thorsten, et al. “Generating EAST-ADL Event Chains from Scenario-Based
Requirements Specifications.” Software Architecture, 2014, doi:10.1007/978-3-319-09970-5_14.
short: 'T. Koch, J. Holtmann, J. DeAntoni, in: Software Architecture, Cham, 2014.'
date_created: 2021-01-13T13:34:35Z
date_updated: 2022-01-06T06:54:42Z
department:
- _id: '241'
- _id: '662'
doi: 10.1007/978-3-319-09970-5_14
language:
- iso: eng
place: Cham
publication: Software Architecture
publication_identifier:
isbn:
- '9783319099699'
- '9783319099705'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Generating EAST-ADL Event Chains from Scenario-Based Requirements Specifications
type: book_chapter
user_id: '13616'
year: '2014'
...
---
_id: '6741'
author:
- first_name: Dennis
full_name: Bokermann, Dennis
id: '11308'
last_name: Bokermann
- first_name: Christian
full_name: Gerth, Christian
last_name: Gerth
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'Bokermann D, Gerth C, Engels G. Use Your Best Device! Enabling Device Changes
at Runtime. In: 12th International Conference on Business Process Management
(BPM 2014). Vol 8659. Lecture Notes in Computer Science. Springer International
Publishing; 2014:357-365. doi:10.1007/978-3-319-10172-9_23'
apa: Bokermann, D., Gerth, C., & Engels, G. (2014). Use Your Best Device! Enabling
Device Changes at Runtime. In 12th International Conference on Business Process
Management (BPM 2014) (Vol. 8659, pp. 357–365). Springer International Publishing.
https://doi.org/10.1007/978-3-319-10172-9_23
bibtex: '@inproceedings{Bokermann_Gerth_Engels_2014, series={Lecture Notes in Computer
Science}, title={Use Your Best Device! Enabling Device Changes at Runtime}, volume={8659},
DOI={10.1007/978-3-319-10172-9_23},
booktitle={12th International Conference on Business Process Management (BPM 2014)},
publisher={Springer International Publishing}, author={Bokermann, Dennis and Gerth,
Christian and Engels, Gregor}, year={2014}, pages={357–365}, collection={Lecture
Notes in Computer Science} }'
chicago: Bokermann, Dennis, Christian Gerth, and Gregor Engels. “Use Your Best Device!
Enabling Device Changes at Runtime.” In 12th International Conference on Business
Process Management (BPM 2014), 8659:357–65. Lecture Notes in Computer Science.
Springer International Publishing, 2014. https://doi.org/10.1007/978-3-319-10172-9_23.
ieee: D. Bokermann, C. Gerth, and G. Engels, “Use Your Best Device! Enabling Device
Changes at Runtime,” in 12th International Conference on Business Process Management
(BPM 2014), 2014, vol. 8659, pp. 357–365.
mla: Bokermann, Dennis, et al. “Use Your Best Device! Enabling Device Changes at
Runtime.” 12th International Conference on Business Process Management (BPM
2014), vol. 8659, Springer International Publishing, 2014, pp. 357–65, doi:10.1007/978-3-319-10172-9_23.
short: 'D. Bokermann, C. Gerth, G. Engels, in: 12th International Conference on
Business Process Management (BPM 2014), Springer International Publishing, 2014,
pp. 357–365.'
date_created: 2019-01-15T14:49:31Z
date_updated: 2022-01-06T07:03:17Z
department:
- _id: '66'
doi: 10.1007/978-3-319-10172-9_23
intvolume: ' 8659'
language:
- iso: eng
page: 357-365
publication: 12th International Conference on Business Process Management (BPM 2014)
publication_identifier:
isbn:
- '9783319101712'
- '9783319101729'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
series_title: Lecture Notes in Computer Science
status: public
title: Use Your Best Device! Enabling Device Changes at Runtime
type: conference
user_id: '11308'
volume: 8659
year: '2014'
...
---
_id: '16870'
citation:
ama: 'Flocchini P, Gao J, Kranakis E, Meyer auf der Heide F, eds. Algorithms
for Sensor Systems - 9th International Symposium on Algorithms and Experiments
for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS}
2013. Vol 8243. Berlin, Heidelberg: Springer; 2014. doi:10.1007/978-3-642-45346-5'
apa: 'Flocchini, P., Gao, J., Kranakis, E., & Meyer auf der Heide, F. (Eds.).
(2014). Algorithms for Sensor Systems - 9th International Symposium on Algorithms
and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics,
{ALGOSENSORS} 2013 (Vol. 8243). Berlin, Heidelberg: Springer. https://doi.org/10.1007/978-3-642-45346-5'
bibtex: '@book{Flocchini_Gao_Kranakis_Meyer auf der Heide_2014, place={Berlin, Heidelberg},
series={Lecture Notes in Computer Science}, title={Algorithms for Sensor Systems
- 9th International Symposium on Algorithms and Experiments for Sensor Systems,
Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013}, volume={8243},
DOI={10.1007/978-3-642-45346-5},
publisher={Springer}, year={2014}, collection={Lecture Notes in Computer Science}
}'
chicago: 'Flocchini, Paola, Jie Gao, Evangelos Kranakis, and Friedhelm Meyer auf
der Heide, eds. Algorithms for Sensor Systems - 9th International Symposium
on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed
Robotics, {ALGOSENSORS} 2013. Vol. 8243. Lecture Notes in Computer Science.
Berlin, Heidelberg: Springer, 2014. https://doi.org/10.1007/978-3-642-45346-5.'
ieee: 'P. Flocchini, J. Gao, E. Kranakis, and F. Meyer auf der Heide, Eds., Algorithms
for Sensor Systems - 9th International Symposium on Algorithms and Experiments
for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS}
2013, vol. 8243. Berlin, Heidelberg: Springer, 2014.'
mla: Flocchini, Paola, et al., editors. Algorithms for Sensor Systems - 9th International
Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks
and Distributed Robotics, {ALGOSENSORS} 2013. Vol. 8243, Springer, 2014, doi:10.1007/978-3-642-45346-5.
short: P. Flocchini, J. Gao, E. Kranakis, F. Meyer auf der Heide, eds., Algorithms
for Sensor Systems - 9th International Symposium on Algorithms and Experiments
for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS}
2013, Springer, Berlin, Heidelberg, 2014.
date_created: 2020-04-27T10:31:57Z
date_updated: 2022-01-06T06:52:58Z
department:
- _id: '63'
doi: 10.1007/978-3-642-45346-5
editor:
- first_name: Paola
full_name: Flocchini, Paola
last_name: Flocchini
- first_name: Jie
full_name: Gao, Jie
last_name: Gao
- first_name: Evangelos
full_name: Kranakis, Evangelos
last_name: Kranakis
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
intvolume: ' 8243'
language:
- iso: eng
place: Berlin, Heidelberg
publication_identifier:
isbn:
- '9783642453458'
- '9783642453465'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Algorithms for Sensor Systems - 9th International Symposium on Algorithms and
Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS}
2013
type: book_editor
user_id: '15415'
volume: 8243
year: '2014'
...
---
_id: '15092'
author:
- first_name: Stefan
full_name: Böttcher, Stefan
id: '624'
last_name: Böttcher
- first_name: Rita
full_name: Hartel, Rita
id: '14961'
last_name: Hartel
- first_name: Jonathan
full_name: Rabe, Jonathan
last_name: Rabe
citation:
ama: 'Böttcher S, Hartel R, Rabe J. Efficient XML Keyword Search Based on DAG-Compression.
In: Database and Expert Systems Applications - 25th International Conference,
DEXA 2014. Cham: Springer; 2014:122-137. doi:10.1007/978-3-319-10073-9_11'
apa: 'Böttcher, S., Hartel, R., & Rabe, J. (2014). Efficient XML Keyword Search
Based on DAG-Compression. In Database and Expert Systems Applications - 25th
International Conference, DEXA 2014 (pp. 122–137). Cham: Springer. https://doi.org/10.1007/978-3-319-10073-9_11'
bibtex: '@inproceedings{Böttcher_Hartel_Rabe_2014, place={Cham}, title={Efficient
XML Keyword Search Based on DAG-Compression}, DOI={10.1007/978-3-319-10073-9_11},
booktitle={Database and Expert Systems Applications - 25th International Conference,
DEXA 2014}, publisher={Springer}, author={Böttcher, Stefan and Hartel, Rita and
Rabe, Jonathan}, year={2014}, pages={122–137} }'
chicago: 'Böttcher, Stefan, Rita Hartel, and Jonathan Rabe. “Efficient XML Keyword
Search Based on DAG-Compression.” In Database and Expert Systems Applications
- 25th International Conference, DEXA 2014, 122–37. Cham: Springer, 2014.
https://doi.org/10.1007/978-3-319-10073-9_11.'
ieee: S. Böttcher, R. Hartel, and J. Rabe, “Efficient XML Keyword Search Based on
DAG-Compression,” in Database and Expert Systems Applications - 25th International
Conference, DEXA 2014, 2014, pp. 122–137.
mla: Böttcher, Stefan, et al. “Efficient XML Keyword Search Based on DAG-Compression.”
Database and Expert Systems Applications - 25th International Conference, DEXA
2014, Springer, 2014, pp. 122–37, doi:10.1007/978-3-319-10073-9_11.
short: 'S. Böttcher, R. Hartel, J. Rabe, in: Database and Expert Systems Applications
- 25th International Conference, DEXA 2014, Springer, Cham, 2014, pp. 122–137.'
date_created: 2019-11-21T15:19:02Z
date_updated: 2022-01-06T06:52:15Z
department:
- _id: '69'
doi: 10.1007/978-3-319-10073-9_11
language:
- iso: eng
page: 122-137
place: Cham
publication: Database and Expert Systems Applications - 25th International Conference,
DEXA 2014
publication_identifier:
isbn:
- '9783319100722'
- '9783319100739'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer
status: public
title: Efficient XML Keyword Search Based on DAG-Compression
type: conference
user_id: '14961'
year: '2014'
...
---
_id: '16394'
author:
- first_name: Tamás
full_name: Lukovszki, Tamás
last_name: Lukovszki
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Lukovszki T, Meyer auf der Heide F. Fast Collisionless Pattern Formation by
Anonymous, Position-Aware Robots. In: Lecture Notes in Computer Science.
Cham; 2014. doi:10.1007/978-3-319-14472-6_17'
apa: Lukovszki, T., & Meyer auf der Heide, F. (2014). Fast Collisionless Pattern
Formation by Anonymous, Position-Aware Robots. In Lecture Notes in Computer
Science. Cham. https://doi.org/10.1007/978-3-319-14472-6_17
bibtex: '@inbook{Lukovszki_Meyer auf der Heide_2014, place={Cham}, title={Fast Collisionless
Pattern Formation by Anonymous, Position-Aware Robots}, DOI={10.1007/978-3-319-14472-6_17},
booktitle={Lecture Notes in Computer Science}, author={Lukovszki, Tamás and Meyer
auf der Heide, Friedhelm}, year={2014} }'
chicago: Lukovszki, Tamás, and Friedhelm Meyer auf der Heide. “Fast Collisionless
Pattern Formation by Anonymous, Position-Aware Robots.” In Lecture Notes in
Computer Science. Cham, 2014. https://doi.org/10.1007/978-3-319-14472-6_17.
ieee: T. Lukovszki and F. Meyer auf der Heide, “Fast Collisionless Pattern Formation
by Anonymous, Position-Aware Robots,” in Lecture Notes in Computer Science,
Cham, 2014.
mla: Lukovszki, Tamás, and Friedhelm Meyer auf der Heide. “Fast Collisionless Pattern
Formation by Anonymous, Position-Aware Robots.” Lecture Notes in Computer Science,
2014, doi:10.1007/978-3-319-14472-6_17.
short: 'T. Lukovszki, F. Meyer auf der Heide, in: Lecture Notes in Computer Science,
Cham, 2014.'
date_created: 2020-04-03T07:58:53Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-319-14472-6_17
language:
- iso: eng
place: Cham
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783319144719'
- '9783319144726'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Fast Collisionless Pattern Formation by Anonymous, Position-Aware Robots
type: book_chapter
user_id: '15415'
year: '2014'
...
---
_id: '16395'
author:
- first_name: Sebastian
full_name: Abshoff, Sebastian
last_name: Abshoff
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Abshoff S, Meyer auf der Heide F. Continuous Aggregation in Dynamic Ad-Hoc
Networks. In: Structural Information and Communication Complexity. Cham;
2014. doi:10.1007/978-3-319-09620-9_16'
apa: Abshoff, S., & Meyer auf der Heide, F. (2014). Continuous Aggregation in
Dynamic Ad-Hoc Networks. In Structural Information and Communication Complexity.
Cham. https://doi.org/10.1007/978-3-319-09620-9_16
bibtex: '@inbook{Abshoff_Meyer auf der Heide_2014, place={Cham}, title={Continuous
Aggregation in Dynamic Ad-Hoc Networks}, DOI={10.1007/978-3-319-09620-9_16},
booktitle={Structural Information and Communication Complexity}, author={Abshoff,
Sebastian and Meyer auf der Heide, Friedhelm}, year={2014} }'
chicago: Abshoff, Sebastian, and Friedhelm Meyer auf der Heide. “Continuous Aggregation
in Dynamic Ad-Hoc Networks.” In Structural Information and Communication Complexity.
Cham, 2014. https://doi.org/10.1007/978-3-319-09620-9_16.
ieee: S. Abshoff and F. Meyer auf der Heide, “Continuous Aggregation in Dynamic
Ad-Hoc Networks,” in Structural Information and Communication Complexity,
Cham, 2014.
mla: Abshoff, Sebastian, and Friedhelm Meyer auf der Heide. “Continuous Aggregation
in Dynamic Ad-Hoc Networks.” Structural Information and Communication Complexity,
2014, doi:10.1007/978-3-319-09620-9_16.
short: 'S. Abshoff, F. Meyer auf der Heide, in: Structural Information and Communication
Complexity, Cham, 2014.'
date_created: 2020-04-03T09:00:16Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-319-09620-9_16
language:
- iso: eng
place: Cham
publication: Structural Information and Communication Complexity
publication_identifier:
isbn:
- '9783319096193'
- '9783319096209'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Continuous Aggregation in Dynamic Ad-Hoc Networks
type: book_chapter
user_id: '15415'
year: '2014'
...
---
_id: '47839'
author:
- first_name: Marcel
full_name: Fourné, Marcel
id: '99291'
last_name: Fourné
- first_name: Kevin
full_name: Stegemann, Kevin
last_name: Stegemann
- first_name: Dominique
full_name: Petersen, Dominique
last_name: Petersen
- first_name: Norbert
full_name: Pohlmann, Norbert
last_name: Pohlmann
citation:
ama: 'Fourné M, Stegemann K, Petersen D, Pohlmann N. Aggregation of Network Protocol
Data Near Its Source. In: Information and Communication Technology. Springer
Berlin Heidelberg; 2014. doi:10.1007/978-3-642-55032-4_49'
apa: Fourné, M., Stegemann, K., Petersen, D., & Pohlmann, N. (2014). Aggregation
of Network Protocol Data Near Its Source. In Information and Communication
Technology. Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-55032-4_49
bibtex: '@inbook{Fourné_Stegemann_Petersen_Pohlmann_2014, place={Berlin, Heidelberg},
title={Aggregation of Network Protocol Data Near Its Source}, DOI={10.1007/978-3-642-55032-4_49},
booktitle={Information and Communication Technology}, publisher={Springer Berlin
Heidelberg}, author={Fourné, Marcel and Stegemann, Kevin and Petersen, Dominique
and Pohlmann, Norbert}, year={2014} }'
chicago: 'Fourné, Marcel, Kevin Stegemann, Dominique Petersen, and Norbert Pohlmann.
“Aggregation of Network Protocol Data Near Its Source.” In Information and
Communication Technology. Berlin, Heidelberg: Springer Berlin Heidelberg,
2014. https://doi.org/10.1007/978-3-642-55032-4_49.'
ieee: 'M. Fourné, K. Stegemann, D. Petersen, and N. Pohlmann, “Aggregation of Network
Protocol Data Near Its Source,” in Information and Communication Technology,
Berlin, Heidelberg: Springer Berlin Heidelberg, 2014.'
mla: Fourné, Marcel, et al. “Aggregation of Network Protocol Data Near Its Source.”
Information and Communication Technology, Springer Berlin Heidelberg, 2014,
doi:10.1007/978-3-642-55032-4_49.
short: 'M. Fourné, K. Stegemann, D. Petersen, N. Pohlmann, in: Information and Communication
Technology, Springer Berlin Heidelberg, Berlin, Heidelberg, 2014.'
date_created: 2023-10-06T16:08:23Z
date_updated: 2023-10-06T16:22:35Z
doi: 10.1007/978-3-642-55032-4_49
extern: '1'
language:
- iso: eng
place: Berlin, Heidelberg
publication: Information and Communication Technology
publication_identifier:
isbn:
- '9783642550317'
- '9783642550324'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Aggregation of Network Protocol Data Near Its Source
type: book_chapter
user_id: '99291'
year: '2014'
...
---
_id: '2979'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Peter
full_name: Günther, Peter
last_name: Günther
- first_name: Gennadij
full_name: Liske, Gennadij
last_name: Liske
citation:
ama: 'Blömer J, Günther P, Liske G. Improved Side Channel Attacks on Pairing Based
Cryptography. In: Constructive Side-Channel Analysis and Secure Design.
Berlin, Heidelberg: Springer Berlin Heidelberg; 2013:154-168. doi:10.1007/978-3-642-40026-1_10'
apa: 'Blömer, J., Günther, P., & Liske, G. (2013). Improved Side Channel Attacks
on Pairing Based Cryptography. In Constructive Side-Channel Analysis and Secure
Design (pp. 154–168). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-40026-1_10'
bibtex: '@inbook{Blömer_Günther_Liske_2013, place={Berlin, Heidelberg}, title={Improved
Side Channel Attacks on Pairing Based Cryptography}, DOI={10.1007/978-3-642-40026-1_10},
booktitle={Constructive Side-Channel Analysis and Secure Design}, publisher={Springer
Berlin Heidelberg}, author={Blömer, Johannes and Günther, Peter and Liske, Gennadij},
year={2013}, pages={154–168} }'
chicago: 'Blömer, Johannes, Peter Günther, and Gennadij Liske. “Improved Side Channel
Attacks on Pairing Based Cryptography.” In Constructive Side-Channel Analysis
and Secure Design, 154–68. Berlin, Heidelberg: Springer Berlin Heidelberg,
2013. https://doi.org/10.1007/978-3-642-40026-1_10.'
ieee: 'J. Blömer, P. Günther, and G. Liske, “Improved Side Channel Attacks on Pairing
Based Cryptography,” in Constructive Side-Channel Analysis and Secure Design,
Berlin, Heidelberg: Springer Berlin Heidelberg, 2013, pp. 154–168.'
mla: Blömer, Johannes, et al. “Improved Side Channel Attacks on Pairing Based Cryptography.”
Constructive Side-Channel Analysis and Secure Design, Springer Berlin Heidelberg,
2013, pp. 154–68, doi:10.1007/978-3-642-40026-1_10.
short: 'J. Blömer, P. Günther, G. Liske, in: Constructive Side-Channel Analysis
and Secure Design, Springer Berlin Heidelberg, Berlin, Heidelberg, 2013, pp. 154–168.'
date_created: 2018-06-05T07:33:22Z
date_updated: 2022-01-06T06:58:49Z
department:
- _id: '64'
doi: 10.1007/978-3-642-40026-1_10
page: 154-168
place: Berlin, Heidelberg
publication: Constructive Side-Channel Analysis and Secure Design
publication_identifier:
isbn:
- '9783642400254'
- '9783642400261'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Improved Side Channel Attacks on Pairing Based Cryptography
type: book_chapter
user_id: '25078'
year: '2013'
...
---
_id: '6276'
author:
- first_name: Florian
full_name: Klompmaker, Florian
last_name: Klompmaker
- first_name: Volker
full_name: Paelke, Volker
last_name: Paelke
- first_name: Holger Gerhard
full_name: Fischer, Holger Gerhard
id: '30457'
last_name: Fischer
citation:
ama: 'Klompmaker F, Paelke V, Fischer HG. A Taxonomy-Based Approach towards NUI
Interaction Design. In: Distributed, Ambient, and Pervasive Interactions.
Vol 8028. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin
Heidelberg; 2013:32-41. doi:10.1007/978-3-642-39351-8_4'
apa: 'Klompmaker, F., Paelke, V., & Fischer, H. G. (2013). A Taxonomy-Based
Approach towards NUI Interaction Design. In Distributed, Ambient, and Pervasive
Interactions (Vol. 8028, pp. 32–41). Berlin, Heidelberg: Springer Berlin Heidelberg.
https://doi.org/10.1007/978-3-642-39351-8_4'
bibtex: '@inbook{Klompmaker_Paelke_Fischer_2013, place={Berlin, Heidelberg}, series={Lecture
Notes in Computer Science}, title={A Taxonomy-Based Approach towards NUI Interaction
Design}, volume={8028}, DOI={10.1007/978-3-642-39351-8_4},
booktitle={Distributed, Ambient, and Pervasive Interactions}, publisher={Springer
Berlin Heidelberg}, author={Klompmaker, Florian and Paelke, Volker and Fischer,
Holger Gerhard}, year={2013}, pages={32–41}, collection={Lecture Notes in Computer
Science} }'
chicago: 'Klompmaker, Florian, Volker Paelke, and Holger Gerhard Fischer. “A Taxonomy-Based
Approach towards NUI Interaction Design.” In Distributed, Ambient, and Pervasive
Interactions, 8028:32–41. Lecture Notes in Computer Science. Berlin, Heidelberg:
Springer Berlin Heidelberg, 2013. https://doi.org/10.1007/978-3-642-39351-8_4.'
ieee: 'F. Klompmaker, V. Paelke, and H. G. Fischer, “A Taxonomy-Based Approach towards
NUI Interaction Design,” in Distributed, Ambient, and Pervasive Interactions,
vol. 8028, Berlin, Heidelberg: Springer Berlin Heidelberg, 2013, pp. 32–41.'
mla: Klompmaker, Florian, et al. “A Taxonomy-Based Approach towards NUI Interaction
Design.” Distributed, Ambient, and Pervasive Interactions, vol. 8028, Springer
Berlin Heidelberg, 2013, pp. 32–41, doi:10.1007/978-3-642-39351-8_4.
short: 'F. Klompmaker, V. Paelke, H.G. Fischer, in: Distributed, Ambient, and Pervasive
Interactions, Springer Berlin Heidelberg, Berlin, Heidelberg, 2013, pp. 32–41.'
conference:
end_date: 2013-07-26
location: Las Vegas, USA
name: International Conference on Distributed, Ambient, and Pervasive Interactions
(DAPI) as part of HCI International 2013
start_date: 2013-07-21
date_created: 2018-12-18T12:42:33Z
date_updated: 2022-01-06T07:02:59Z
department:
- _id: '66'
- _id: '534'
- _id: '221'
doi: 10.1007/978-3-642-39351-8_4
intvolume: ' 8028'
language:
- iso: eng
page: 32-41
place: Berlin, Heidelberg
publication: Distributed, Ambient, and Pervasive Interactions
publication_identifier:
isbn:
- '9783642393501'
- '9783642393518'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
series_title: Lecture Notes in Computer Science
status: public
title: A Taxonomy-Based Approach towards NUI Interaction Design
type: book_chapter
user_id: '30457'
volume: 8028
year: '2013'
...
---
_id: '6279'
author:
- first_name: Holger Gerhard
full_name: Fischer, Holger Gerhard
id: '30457'
last_name: Fischer
- first_name: Benjamin
full_name: Strenge, Benjamin
last_name: Strenge
- first_name: Karsten
full_name: Nebe, Karsten
last_name: Nebe
citation:
ama: 'Fischer HG, Strenge B, Nebe K. Towards a Holistic Tool for the Selection and
Validation of Usability Method Sets Supporting Human-Centered Design. In: Design,
User Experience, and Usability. Design Philosophy, Methods, and Tools. Vol
8012. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg;
2013:252-261. doi:10.1007/978-3-642-39229-0_28'
apa: 'Fischer, H. G., Strenge, B., & Nebe, K. (2013). Towards a Holistic Tool
for the Selection and Validation of Usability Method Sets Supporting Human-Centered
Design. In Design, User Experience, and Usability. Design Philosophy, Methods,
and Tools (Vol. 8012, pp. 252–261). Berlin, Heidelberg: Springer Berlin Heidelberg.
https://doi.org/10.1007/978-3-642-39229-0_28'
bibtex: '@inbook{Fischer_Strenge_Nebe_2013, place={Berlin, Heidelberg}, series={Lecture
Notes in Computer Science}, title={Towards a Holistic Tool for the Selection and
Validation of Usability Method Sets Supporting Human-Centered Design}, volume={8012},
DOI={10.1007/978-3-642-39229-0_28},
booktitle={Design, User Experience, and Usability. Design Philosophy, Methods,
and Tools}, publisher={Springer Berlin Heidelberg}, author={Fischer, Holger Gerhard
and Strenge, Benjamin and Nebe, Karsten}, year={2013}, pages={252–261}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Fischer, Holger Gerhard, Benjamin Strenge, and Karsten Nebe. “Towards
a Holistic Tool for the Selection and Validation of Usability Method Sets Supporting
Human-Centered Design.” In Design, User Experience, and Usability. Design Philosophy,
Methods, and Tools, 8012:252–61. Lecture Notes in Computer Science. Berlin,
Heidelberg: Springer Berlin Heidelberg, 2013. https://doi.org/10.1007/978-3-642-39229-0_28.'
ieee: 'H. G. Fischer, B. Strenge, and K. Nebe, “Towards a Holistic Tool for the
Selection and Validation of Usability Method Sets Supporting Human-Centered Design,”
in Design, User Experience, and Usability. Design Philosophy, Methods, and
Tools, vol. 8012, Berlin, Heidelberg: Springer Berlin Heidelberg, 2013, pp.
252–261.'
mla: Fischer, Holger Gerhard, et al. “Towards a Holistic Tool for the Selection
and Validation of Usability Method Sets Supporting Human-Centered Design.” Design,
User Experience, and Usability. Design Philosophy, Methods, and Tools, vol.
8012, Springer Berlin Heidelberg, 2013, pp. 252–61, doi:10.1007/978-3-642-39229-0_28.
short: 'H.G. Fischer, B. Strenge, K. Nebe, in: Design, User Experience, and Usability.
Design Philosophy, Methods, and Tools, Springer Berlin Heidelberg, Berlin, Heidelberg,
2013, pp. 252–261.'
conference:
end_date: 2013-07-26
location: Las Vegas, USA
name: International Conference of Design, User Experience, and Usability (DUXU)
as part of HCI International 2013
start_date: 2013-07-21
date_created: 2018-12-18T12:44:48Z
date_updated: 2022-01-06T07:02:59Z
department:
- _id: '66'
- _id: '534'
- _id: '221'
doi: 10.1007/978-3-642-39229-0_28
intvolume: ' 8012'
language:
- iso: eng
page: 252-261
place: Berlin, Heidelberg
publication: Design, User Experience, and Usability. Design Philosophy, Methods, and
Tools
publication_identifier:
isbn:
- '9783642392283'
- '9783642392290'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
series_title: Lecture Notes in Computer Science
status: public
title: Towards a Holistic Tool for the Selection and Validation of Usability Method
Sets Supporting Human-Centered Design
type: book_chapter
user_id: '30457'
volume: 8012
year: '2013'
...
---
_id: '6732'
author:
- first_name: Thomas
full_name: Place, Thomas
last_name: Place
- first_name: Lorijn
full_name: van Rooijen, Lorijn
id: '58843'
last_name: van Rooijen
- first_name: Marc
full_name: Zeitoun, Marc
last_name: Zeitoun
citation:
ama: 'Place T, van Rooijen L, Zeitoun M. Separating Regular Languages by Piecewise
Testable and Unambiguous Languages. In: Mathematical Foundations of Computer
Science 2013 - 38th International Symposium, (MFCS) 2013, Klosterneuburg, Austria,
August 26-30, 2013. Berlin, Heidelberg: Springer Berlin Heidelberg; 2013:729-740.
doi:10.1007/978-3-642-40313-2_64'
apa: 'Place, T., van Rooijen, L., & Zeitoun, M. (2013). Separating Regular Languages
by Piecewise Testable and Unambiguous Languages. In Mathematical Foundations
of Computer Science 2013 - 38th International Symposium, (MFCS) 2013, Klosterneuburg,
Austria, August 26-30, 2013 (pp. 729–740). Berlin, Heidelberg: Springer Berlin
Heidelberg. https://doi.org/10.1007/978-3-642-40313-2_64'
bibtex: '@inproceedings{Place_van Rooijen_Zeitoun_2013, place={Berlin, Heidelberg},
title={Separating Regular Languages by Piecewise Testable and Unambiguous Languages},
DOI={10.1007/978-3-642-40313-2_64},
booktitle={Mathematical Foundations of Computer Science 2013 - 38th International
Symposium, (MFCS) 2013, Klosterneuburg, Austria, August 26-30, 2013}, publisher={Springer
Berlin Heidelberg}, author={Place, Thomas and van Rooijen, Lorijn and Zeitoun,
Marc}, year={2013}, pages={729–740} }'
chicago: 'Place, Thomas, Lorijn van Rooijen, and Marc Zeitoun. “Separating Regular
Languages by Piecewise Testable and Unambiguous Languages.” In Mathematical
Foundations of Computer Science 2013 - 38th International Symposium, (MFCS) 2013,
Klosterneuburg, Austria, August 26-30, 2013, 729–40. Berlin, Heidelberg: Springer
Berlin Heidelberg, 2013. https://doi.org/10.1007/978-3-642-40313-2_64.'
ieee: T. Place, L. van Rooijen, and M. Zeitoun, “Separating Regular Languages by
Piecewise Testable and Unambiguous Languages,” in Mathematical Foundations
of Computer Science 2013 - 38th International Symposium, (MFCS) 2013, Klosterneuburg,
Austria, August 26-30, 2013, 2013, pp. 729–740.
mla: Place, Thomas, et al. “Separating Regular Languages by Piecewise Testable and
Unambiguous Languages.” Mathematical Foundations of Computer Science 2013 -
38th International Symposium, (MFCS) 2013, Klosterneuburg, Austria, August 26-30,
2013, Springer Berlin Heidelberg, 2013, pp. 729–40, doi:10.1007/978-3-642-40313-2_64.
short: 'T. Place, L. van Rooijen, M. Zeitoun, in: Mathematical Foundations of Computer
Science 2013 - 38th International Symposium, (MFCS) 2013, Klosterneuburg, Austria,
August 26-30, 2013, Springer Berlin Heidelberg, Berlin, Heidelberg, 2013, pp.
729–740.'
date_created: 2019-01-15T10:23:36Z
date_updated: 2022-01-06T07:03:17Z
department:
- _id: '66'
doi: 10.1007/978-3-642-40313-2_64
extern: '1'
language:
- iso: eng
page: 729-740
place: Berlin, Heidelberg
publication: Mathematical Foundations of Computer Science 2013 - 38th International
Symposium, (MFCS) 2013, Klosterneuburg, Austria, August 26-30, 2013
publication_identifier:
isbn:
- '9783642403125'
- '9783642403132'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Separating Regular Languages by Piecewise Testable and Unambiguous Languages
type: conference
user_id: '58843'
year: '2013'
...
---
_id: '15093'
author:
- first_name: Stefan
full_name: Böttcher, Stefan
id: '624'
last_name: Böttcher
- first_name: Rita
full_name: Hartel, Rita
id: '14961'
last_name: Hartel
- first_name: Thomas
full_name: Jacobs, Thomas
last_name: Jacobs
citation:
ama: 'Böttcher S, Hartel R, Jacobs T. Fast Multi-update Operations on Compressed
XML Data. In: Big Data - 29th British National Conference on Databases, BNCOD
2013,. Berlin, Heidelberg: Springer; 2013:149-164. doi:10.1007/978-3-642-39467-6_15'
apa: 'Böttcher, S., Hartel, R., & Jacobs, T. (2013). Fast Multi-update Operations
on Compressed XML Data. In Big Data - 29th British National Conference on Databases,
BNCOD 2013, (pp. 149–164). Berlin, Heidelberg: Springer. https://doi.org/10.1007/978-3-642-39467-6_15'
bibtex: '@inproceedings{Böttcher_Hartel_Jacobs_2013, place={Berlin, Heidelberg},
title={Fast Multi-update Operations on Compressed XML Data}, DOI={10.1007/978-3-642-39467-6_15},
booktitle={Big Data - 29th British National Conference on Databases, BNCOD 2013,},
publisher={Springer}, author={Böttcher, Stefan and Hartel, Rita and Jacobs, Thomas},
year={2013}, pages={149–164} }'
chicago: 'Böttcher, Stefan, Rita Hartel, and Thomas Jacobs. “Fast Multi-Update Operations
on Compressed XML Data.” In Big Data - 29th British National Conference on
Databases, BNCOD 2013, 149–64. Berlin, Heidelberg: Springer, 2013. https://doi.org/10.1007/978-3-642-39467-6_15.'
ieee: S. Böttcher, R. Hartel, and T. Jacobs, “Fast Multi-update Operations on Compressed
XML Data,” in Big Data - 29th British National Conference on Databases, BNCOD
2013, 2013, pp. 149–164.
mla: Böttcher, Stefan, et al. “Fast Multi-Update Operations on Compressed XML Data.”
Big Data - 29th British National Conference on Databases, BNCOD 2013, Springer,
2013, pp. 149–64, doi:10.1007/978-3-642-39467-6_15.
short: 'S. Böttcher, R. Hartel, T. Jacobs, in: Big Data - 29th British National
Conference on Databases, BNCOD 2013, Springer, Berlin, Heidelberg, 2013, pp. 149–164.'
date_created: 2019-11-21T15:19:46Z
date_updated: 2022-01-06T06:52:15Z
department:
- _id: '69'
doi: 10.1007/978-3-642-39467-6_15
language:
- iso: eng
page: 149-164
place: Berlin, Heidelberg
publication: Big Data - 29th British National Conference on Databases, BNCOD 2013,
publication_identifier:
isbn:
- '9783642394669'
- '9783642394676'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer
status: public
title: Fast Multi-update Operations on Compressed XML Data
type: conference
user_id: '14961'
year: '2013'
...
---
_id: '16406'
abstract:
- lang: eng
text: "In order to evaluate the efficiency of algorithms for real-time 3D rendering,
different properties like rendering time, occluded triangles, or image quality,
need to be investigated. Since these properties depend on the position of the
camera, usually some camera path is chosen, along which the measurements are performed.
As those measurements cover only a small part of the scene, this approach hardly
allows drawing conclusions regarding the algorithm's properties at arbitrary positions
in the scene. The presented method allows the systematic and position-independent
evaluation of rendering algorithms. It uses an adaptive sampling approach to approximate
the distribution of a property (like rendering time) for all positions in the
scene. This approximation can be visualized to produce an intuitive impression
of the algorithm's behavior or be statistically analyzed for objectively rating
and comparing algorithms. We demonstrate our method by evaluating performance
aspects of a known occlusion culling algorithm.\r\n"
author:
- first_name: Claudius
full_name: Jähn, Claudius
last_name: Jähn
- first_name: Benjamin
full_name: Eikel, Benjamin
last_name: Eikel
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Ralf
full_name: Petring, Ralf
last_name: Petring
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Jähn C, Eikel B, Fischer M, Petring R, Meyer auf der Heide F. Evaluation of
Rendering Algorithms Using Position-Dependent Scene Properties. In: Advances
in Visual Computing. Berlin, Heidelberg; 2013. doi:10.1007/978-3-642-41914-0_12'
apa: Jähn, C., Eikel, B., Fischer, M., Petring, R., & Meyer auf der Heide, F.
(2013). Evaluation of Rendering Algorithms Using Position-Dependent Scene Properties.
In Advances in Visual Computing. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41914-0_12
bibtex: '@inbook{Jähn_Eikel_Fischer_Petring_Meyer auf der Heide_2013, place={Berlin,
Heidelberg}, title={Evaluation of Rendering Algorithms Using Position-Dependent
Scene Properties}, DOI={10.1007/978-3-642-41914-0_12},
booktitle={Advances in Visual Computing}, author={Jähn, Claudius and Eikel, Benjamin
and Fischer, Matthias and Petring, Ralf and Meyer auf der Heide, Friedhelm}, year={2013}
}'
chicago: Jähn, Claudius, Benjamin Eikel, Matthias Fischer, Ralf Petring, and Friedhelm
Meyer auf der Heide. “Evaluation of Rendering Algorithms Using Position-Dependent
Scene Properties.” In Advances in Visual Computing. Berlin, Heidelberg,
2013. https://doi.org/10.1007/978-3-642-41914-0_12.
ieee: C. Jähn, B. Eikel, M. Fischer, R. Petring, and F. Meyer auf der Heide, “Evaluation
of Rendering Algorithms Using Position-Dependent Scene Properties,” in Advances
in Visual Computing, Berlin, Heidelberg, 2013.
mla: Jähn, Claudius, et al. “Evaluation of Rendering Algorithms Using Position-Dependent
Scene Properties.” Advances in Visual Computing, 2013, doi:10.1007/978-3-642-41914-0_12.
short: 'C. Jähn, B. Eikel, M. Fischer, R. Petring, F. Meyer auf der Heide, in: Advances
in Visual Computing, Berlin, Heidelberg, 2013.'
date_created: 2020-04-06T07:21:55Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-642-41914-0_12
language:
- iso: eng
place: Berlin, Heidelberg
publication: Advances in Visual Computing
publication_identifier:
isbn:
- '9783642419133'
- '9783642419140'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Evaluation of Rendering Algorithms Using Position-Dependent Scene Properties
type: book_chapter
user_id: '15415'
year: '2013'
...
---
_id: '16407'
abstract:
- lang: eng
text: "Many virtual 3D scenes, especially those that are large, are not structured
evenly. For such heterogeneous data, there is no single algorithm that is able
to render every scene type at each position fast and with the same high image
quality. For a small set of scenes, this situation can be improved if different
rendering algorithms are manually assigned to particular parts of the scene by
an experienced user. We introduce the Multi-Algorithm-Rendering method. It automatically
deploys different rendering algorithms simultaneously for a broad range of scene
types. The method divides the scene into subregions and measures the behavior
of different algorithms for each region in a preprocessing step. During runtime,
this data is utilized to compute an estimate for the quality and running time
of the available rendering algorithms from the observer's point of view. By solving
an optimizing problem, the image quality can be optimized by an assignment of
algorithms to regions while keeping the frame rate almost constant.\r\n"
author:
- first_name: Ralf
full_name: Petring, Ralf
last_name: Petring
- first_name: Benjamin
full_name: Eikel, Benjamin
last_name: Eikel
- first_name: Claudius
full_name: Jähn, Claudius
last_name: Jähn
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Petring R, Eikel B, Jähn C, Fischer M, Meyer auf der Heide F. Real-Time 3D
Rendering of Heterogeneous Scenes. In: Advances in Visual Computing. Berlin,
Heidelberg; 2013. doi:10.1007/978-3-642-41914-0_44'
apa: Petring, R., Eikel, B., Jähn, C., Fischer, M., & Meyer auf der Heide, F.
(2013). Real-Time 3D Rendering of Heterogeneous Scenes. In Advances in Visual
Computing. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41914-0_44
bibtex: '@inbook{Petring_Eikel_Jähn_Fischer_Meyer auf der Heide_2013, place={Berlin,
Heidelberg}, title={Real-Time 3D Rendering of Heterogeneous Scenes}, DOI={10.1007/978-3-642-41914-0_44},
booktitle={Advances in Visual Computing}, author={Petring, Ralf and Eikel, Benjamin
and Jähn, Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm},
year={2013} }'
chicago: Petring, Ralf, Benjamin Eikel, Claudius Jähn, Matthias Fischer, and Friedhelm
Meyer auf der Heide. “Real-Time 3D Rendering of Heterogeneous Scenes.” In Advances
in Visual Computing. Berlin, Heidelberg, 2013. https://doi.org/10.1007/978-3-642-41914-0_44.
ieee: R. Petring, B. Eikel, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Real-Time
3D Rendering of Heterogeneous Scenes,” in Advances in Visual Computing,
Berlin, Heidelberg, 2013.
mla: Petring, Ralf, et al. “Real-Time 3D Rendering of Heterogeneous Scenes.” Advances
in Visual Computing, 2013, doi:10.1007/978-3-642-41914-0_44.
short: 'R. Petring, B. Eikel, C. Jähn, M. Fischer, F. Meyer auf der Heide, in: Advances
in Visual Computing, Berlin, Heidelberg, 2013.'
date_created: 2020-04-06T07:38:52Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-642-41914-0_44
language:
- iso: eng
place: Berlin, Heidelberg
publication: Advances in Visual Computing
publication_identifier:
isbn:
- '9783642419133'
- '9783642419140'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Real-Time 3D Rendering of Heterogeneous Scenes
type: book_chapter
user_id: '15415'
year: '2013'
...
---
_id: '20179'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Andreas
full_name: Engelbrecht, Andreas
last_name: Engelbrecht
- first_name: Mauro
full_name: Birattari, Mauro
last_name: Birattari
- first_name: Marco
full_name: Dorigo, Marco
last_name: Dorigo
- first_name: Christian
full_name: Blum, Christian
last_name: Blum
- first_name: Thomas
full_name: Stuetzle, Thomas
last_name: Stuetzle
- first_name: Anders Lyhne
full_name: Christensen, Anders Lyhne
last_name: Christensen
- first_name: Roderich
full_name: Gross, Roderich
last_name: Gross
citation:
ama: 'Hamann H, Engelbrecht A, Birattari M, et al. Towards Swarm Calculus: Universal
Properties of Swarm Performance and Collective Decisions. In: Swarm Intelligence:
8th International Conference, ANTS 2012. Vol 7461. Berlin, Heidelberg: Springer;
2012:168-179. doi:10.1007/978-3-642-32650-9_15'
apa: 'Hamann, H., Engelbrecht, A., Birattari, M., Dorigo, M., Blum, C., Stuetzle,
T., … Gross, R. (2012). Towards Swarm Calculus: Universal Properties of Swarm
Performance and Collective Decisions. In Swarm Intelligence: 8th International
Conference, ANTS 2012 (Vol. 7461, pp. 168–179). Berlin, Heidelberg: Springer.
https://doi.org/10.1007/978-3-642-32650-9_15'
bibtex: '@inproceedings{Hamann_Engelbrecht_Birattari_Dorigo_Blum_Stuetzle_Christensen_Gross_2012,
place={Berlin, Heidelberg}, title={Towards Swarm Calculus: Universal Properties
of Swarm Performance and Collective Decisions}, volume={7461}, DOI={10.1007/978-3-642-32650-9_15},
booktitle={Swarm Intelligence: 8th International Conference, ANTS 2012}, publisher={Springer},
author={Hamann, Heiko and Engelbrecht, Andreas and Birattari, Mauro and Dorigo,
Marco and Blum, Christian and Stuetzle, Thomas and Christensen, Anders Lyhne and
Gross, Roderich}, year={2012}, pages={168–179} }'
chicago: 'Hamann, Heiko, Andreas Engelbrecht, Mauro Birattari, Marco Dorigo, Christian
Blum, Thomas Stuetzle, Anders Lyhne Christensen, and Roderich Gross. “Towards
Swarm Calculus: Universal Properties of Swarm Performance and Collective Decisions.”
In Swarm Intelligence: 8th International Conference, ANTS 2012, 7461:168–79.
Berlin, Heidelberg: Springer, 2012. https://doi.org/10.1007/978-3-642-32650-9_15.'
ieee: 'H. Hamann et al., “Towards Swarm Calculus: Universal Properties of
Swarm Performance and Collective Decisions,” in Swarm Intelligence: 8th International
Conference, ANTS 2012, 2012, vol. 7461, pp. 168–179.'
mla: 'Hamann, Heiko, et al. “Towards Swarm Calculus: Universal Properties of Swarm
Performance and Collective Decisions.” Swarm Intelligence: 8th International
Conference, ANTS 2012, vol. 7461, Springer, 2012, pp. 168–79, doi:10.1007/978-3-642-32650-9_15.'
short: 'H. Hamann, A. Engelbrecht, M. Birattari, M. Dorigo, C. Blum, T. Stuetzle,
A.L. Christensen, R. Gross, in: Swarm Intelligence: 8th International Conference,
ANTS 2012, Springer, Berlin, Heidelberg, 2012, pp. 168–179.'
date_created: 2020-10-22T10:00:11Z
date_updated: 2022-01-06T06:54:21Z
department:
- _id: '63'
- _id: '238'
doi: 10.1007/978-3-642-32650-9_15
intvolume: ' 7461'
language:
- iso: eng
page: 168-179
place: Berlin, Heidelberg
publication: 'Swarm Intelligence: 8th International Conference, ANTS 2012'
publication_identifier:
isbn:
- '9783642326493'
- '9783642326509'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer
status: public
title: 'Towards Swarm Calculus: Universal Properties of Swarm Performance and Collective
Decisions'
type: conference
user_id: '15415'
volume: 7461
year: '2012'
...
---
_id: '2918'
author:
- first_name: Saqib
full_name: Kakvi, Saqib
id: '66268'
last_name: Kakvi
- first_name: Eike
full_name: Kiltz, Eike
last_name: Kiltz
- first_name: Alexander
full_name: May, Alexander
last_name: May
citation:
ama: 'Kakvi S, Kiltz E, May A. Certifying RSA. In: Advances in Cryptology – ASIACRYPT
2012. Berlin, Heidelberg: Springer Berlin Heidelberg; 2012:404-414. doi:10.1007/978-3-642-34961-4_25'
apa: 'Kakvi, S., Kiltz, E., & May, A. (2012). Certifying RSA. In Advances
in Cryptology – ASIACRYPT 2012 (pp. 404–414). Berlin, Heidelberg: Springer
Berlin Heidelberg. https://doi.org/10.1007/978-3-642-34961-4_25'
bibtex: '@inbook{Kakvi_Kiltz_May_2012, place={Berlin, Heidelberg}, title={Certifying
RSA}, DOI={10.1007/978-3-642-34961-4_25},
booktitle={Advances in Cryptology – ASIACRYPT 2012}, publisher={Springer Berlin
Heidelberg}, author={Kakvi, Saqib and Kiltz, Eike and May, Alexander}, year={2012},
pages={404–414} }'
chicago: 'Kakvi, Saqib, Eike Kiltz, and Alexander May. “Certifying RSA.” In Advances
in Cryptology – ASIACRYPT 2012, 404–14. Berlin, Heidelberg: Springer Berlin
Heidelberg, 2012. https://doi.org/10.1007/978-3-642-34961-4_25.'
ieee: 'S. Kakvi, E. Kiltz, and A. May, “Certifying RSA,” in Advances in Cryptology
– ASIACRYPT 2012, Berlin, Heidelberg: Springer Berlin Heidelberg, 2012, pp.
404–414.'
mla: Kakvi, Saqib, et al. “Certifying RSA.” Advances in Cryptology – ASIACRYPT
2012, Springer Berlin Heidelberg, 2012, pp. 404–14, doi:10.1007/978-3-642-34961-4_25.
short: 'S. Kakvi, E. Kiltz, A. May, in: Advances in Cryptology – ASIACRYPT 2012,
Springer Berlin Heidelberg, Berlin, Heidelberg, 2012, pp. 404–414.'
date_created: 2018-05-25T12:34:06Z
date_updated: 2022-01-06T06:58:47Z
department:
- _id: '558'
doi: 10.1007/978-3-642-34961-4_25
extern: '1'
page: 404-414
place: Berlin, Heidelberg
publication: Advances in Cryptology – ASIACRYPT 2012
publication_identifier:
isbn:
- '9783642349607'
- '9783642349614'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Certifying RSA
type: book_chapter
user_id: '25078'
year: '2012'
...
---
_id: '2919'
author:
- first_name: Saqib
full_name: Kakvi, Saqib
id: '66268'
last_name: Kakvi
- first_name: Eike
full_name: Kiltz, Eike
last_name: Kiltz
citation:
ama: 'Kakvi S, Kiltz E. Optimal Security Proofs for Full Domain Hash, Revisited.
In: Advances in Cryptology – EUROCRYPT 2012. Berlin, Heidelberg: Springer
Berlin Heidelberg; 2012:537-553. doi:10.1007/978-3-642-29011-4_32'
apa: 'Kakvi, S., & Kiltz, E. (2012). Optimal Security Proofs for Full Domain
Hash, Revisited. In Advances in Cryptology – EUROCRYPT 2012 (pp. 537–553).
Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-29011-4_32'
bibtex: '@inbook{Kakvi_Kiltz_2012, place={Berlin, Heidelberg}, title={Optimal Security
Proofs for Full Domain Hash, Revisited}, DOI={10.1007/978-3-642-29011-4_32},
booktitle={Advances in Cryptology – EUROCRYPT 2012}, publisher={Springer Berlin
Heidelberg}, author={Kakvi, Saqib and Kiltz, Eike}, year={2012}, pages={537–553}
}'
chicago: 'Kakvi, Saqib, and Eike Kiltz. “Optimal Security Proofs for Full Domain
Hash, Revisited.” In Advances in Cryptology – EUROCRYPT 2012, 537–53. Berlin,
Heidelberg: Springer Berlin Heidelberg, 2012. https://doi.org/10.1007/978-3-642-29011-4_32.'
ieee: 'S. Kakvi and E. Kiltz, “Optimal Security Proofs for Full Domain Hash, Revisited,”
in Advances in Cryptology – EUROCRYPT 2012, Berlin, Heidelberg: Springer
Berlin Heidelberg, 2012, pp. 537–553.'
mla: Kakvi, Saqib, and Eike Kiltz. “Optimal Security Proofs for Full Domain Hash,
Revisited.” Advances in Cryptology – EUROCRYPT 2012, Springer Berlin Heidelberg,
2012, pp. 537–53, doi:10.1007/978-3-642-29011-4_32.
short: 'S. Kakvi, E. Kiltz, in: Advances in Cryptology – EUROCRYPT 2012, Springer
Berlin Heidelberg, Berlin, Heidelberg, 2012, pp. 537–553.'
date_created: 2018-05-25T12:36:44Z
date_updated: 2022-01-06T06:58:47Z
department:
- _id: '558'
doi: 10.1007/978-3-642-29011-4_32
extern: '1'
main_file_link:
- url: https://doi.org/10.1007/s00145-017-9257-9
page: 537-553
place: Berlin, Heidelberg
publication: Advances in Cryptology – EUROCRYPT 2012
publication_identifier:
isbn:
- '9783642290107'
- '9783642290114'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Optimal Security Proofs for Full Domain Hash, Revisited
type: book_chapter
user_id: '66268'
year: '2012'
...
---
_id: '16445'
author:
- first_name: Barbara
full_name: Kempkes, Barbara
last_name: Kempkes
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Kempkes B, Meyer auf der Heide F. Continuous Local Strategies for Robotic
Formation Problems. In: Experimental Algorithms. Berlin, Heidelberg; 2012.
doi:10.1007/978-3-642-30850-5_2'
apa: Kempkes, B., & Meyer auf der Heide, F. (2012). Continuous Local Strategies
for Robotic Formation Problems. In Experimental Algorithms. Berlin, Heidelberg.
https://doi.org/10.1007/978-3-642-30850-5_2
bibtex: '@inbook{Kempkes_Meyer auf der Heide_2012, place={Berlin, Heidelberg}, title={Continuous
Local Strategies for Robotic Formation Problems}, DOI={10.1007/978-3-642-30850-5_2},
booktitle={Experimental Algorithms}, author={Kempkes, Barbara and Meyer auf der
Heide, Friedhelm}, year={2012} }'
chicago: Kempkes, Barbara, and Friedhelm Meyer auf der Heide. “Continuous Local
Strategies for Robotic Formation Problems.” In Experimental Algorithms.
Berlin, Heidelberg, 2012. https://doi.org/10.1007/978-3-642-30850-5_2.
ieee: B. Kempkes and F. Meyer auf der Heide, “Continuous Local Strategies for Robotic
Formation Problems,” in Experimental Algorithms, Berlin, Heidelberg, 2012.
mla: Kempkes, Barbara, and Friedhelm Meyer auf der Heide. “Continuous Local Strategies
for Robotic Formation Problems.” Experimental Algorithms, 2012, doi:10.1007/978-3-642-30850-5_2.
short: 'B. Kempkes, F. Meyer auf der Heide, in: Experimental Algorithms, Berlin,
Heidelberg, 2012.'
date_created: 2020-04-07T06:41:18Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-642-30850-5_2
language:
- iso: eng
place: Berlin, Heidelberg
publication: Experimental Algorithms
publication_identifier:
isbn:
- '9783642308499'
- '9783642308505'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Continuous Local Strategies for Robotic Formation Problems
type: book_chapter
user_id: '15415'
year: '2012'
...
---
_id: '16448'
author:
- first_name: Barbara
full_name: Kempkes, Barbara
last_name: Kempkes
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Kempkes B, Meyer auf der Heide F. Local, Self-organizing Strategies for Robotic
Formation Problems. In: Algorithms for Sensor Systems. Berlin, Heidelberg;
2012. doi:10.1007/978-3-642-28209-6_2'
apa: Kempkes, B., & Meyer auf der Heide, F. (2012). Local, Self-organizing Strategies
for Robotic Formation Problems. In Algorithms for Sensor Systems. Berlin,
Heidelberg. https://doi.org/10.1007/978-3-642-28209-6_2
bibtex: '@inbook{Kempkes_Meyer auf der Heide_2012, place={Berlin, Heidelberg}, title={Local,
Self-organizing Strategies for Robotic Formation Problems}, DOI={10.1007/978-3-642-28209-6_2},
booktitle={Algorithms for Sensor Systems}, author={Kempkes, Barbara and Meyer
auf der Heide, Friedhelm}, year={2012} }'
chicago: Kempkes, Barbara, and Friedhelm Meyer auf der Heide. “Local, Self-Organizing
Strategies for Robotic Formation Problems.” In Algorithms for Sensor Systems.
Berlin, Heidelberg, 2012. https://doi.org/10.1007/978-3-642-28209-6_2.
ieee: B. Kempkes and F. Meyer auf der Heide, “Local, Self-organizing Strategies
for Robotic Formation Problems,” in Algorithms for Sensor Systems, Berlin,
Heidelberg, 2012.
mla: Kempkes, Barbara, and Friedhelm Meyer auf der Heide. “Local, Self-Organizing
Strategies for Robotic Formation Problems.” Algorithms for Sensor Systems,
2012, doi:10.1007/978-3-642-28209-6_2.
short: 'B. Kempkes, F. Meyer auf der Heide, in: Algorithms for Sensor Systems, Berlin,
Heidelberg, 2012.'
date_created: 2020-04-07T06:51:14Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-642-28209-6_2
language:
- iso: eng
place: Berlin, Heidelberg
publication: Algorithms for Sensor Systems
publication_identifier:
isbn:
- '9783642282089'
- '9783642282096'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Local, Self-organizing Strategies for Robotic Formation Problems
type: book_chapter
user_id: '15415'
year: '2012'
...
---
_id: '16516'
author:
- first_name: Robert
full_name: Baier, Robert
last_name: Baier
- first_name: Mirko Hessel-von
full_name: Molo, Mirko Hessel-von
last_name: Molo
citation:
ama: 'Baier R, Molo MH. Newton’s Method and Secant Method for Set-Valued Mappings.
In: Large-Scale Scientific Computing. Berlin, Heidelberg; 2012. doi:10.1007/978-3-642-29843-1_9'
apa: Baier, R., & Molo, M. H. (2012). Newton’s Method and Secant Method for
Set-Valued Mappings. In Large-Scale Scientific Computing. Berlin, Heidelberg.
https://doi.org/10.1007/978-3-642-29843-1_9
bibtex: '@inbook{Baier_Molo_2012, place={Berlin, Heidelberg}, title={Newton’s Method
and Secant Method for Set-Valued Mappings}, DOI={10.1007/978-3-642-29843-1_9},
booktitle={Large-Scale Scientific Computing}, author={Baier, Robert and Molo,
Mirko Hessel-von}, year={2012} }'
chicago: Baier, Robert, and Mirko Hessel-von Molo. “Newton’s Method and Secant Method
for Set-Valued Mappings.” In Large-Scale Scientific Computing. Berlin,
Heidelberg, 2012. https://doi.org/10.1007/978-3-642-29843-1_9.
ieee: R. Baier and M. H. Molo, “Newton’s Method and Secant Method for Set-Valued
Mappings,” in Large-Scale Scientific Computing, Berlin, Heidelberg, 2012.
mla: Baier, Robert, and Mirko Hessel-von Molo. “Newton’s Method and Secant Method
for Set-Valued Mappings.” Large-Scale Scientific Computing, 2012, doi:10.1007/978-3-642-29843-1_9.
short: 'R. Baier, M.H. Molo, in: Large-Scale Scientific Computing, Berlin, Heidelberg,
2012.'
date_created: 2020-04-15T07:59:49Z
date_updated: 2022-01-06T06:52:52Z
department:
- _id: '101'
doi: 10.1007/978-3-642-29843-1_9
place: Berlin, Heidelberg
publication: Large-Scale Scientific Computing
publication_identifier:
isbn:
- '9783642298424'
- '9783642298431'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Newton’s Method and Secant Method for Set-Valued Mappings
type: book_chapter
user_id: '15701'
year: '2012'
...
---
_id: '15891'
author:
- first_name: Tibor
full_name: Jager, Tibor
last_name: Jager
- first_name: Sebastian
full_name: Schinzel, Sebastian
last_name: Schinzel
- first_name: Juraj
full_name: Somorovsky, Juraj
id: '83504'
last_name: Somorovsky
orcid: 0000-0002-3593-7720
citation:
ama: 'Jager T, Schinzel S, Somorovsky J. Bleichenbacher’s Attack Strikes again:
Breaking PKCS#1 v1.5 in XML Encryption. In: Computer Security – ESORICS 2012.
Berlin, Heidelberg; 2012. doi:10.1007/978-3-642-33167-1_43'
apa: 'Jager, T., Schinzel, S., & Somorovsky, J. (2012). Bleichenbacher’s Attack
Strikes again: Breaking PKCS#1 v1.5 in XML Encryption. In Computer Security
– ESORICS 2012. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33167-1_43'
bibtex: '@inbook{Jager_Schinzel_Somorovsky_2012, place={Berlin, Heidelberg}, title={Bleichenbacher’s
Attack Strikes again: Breaking PKCS#1 v1.5 in XML Encryption}, DOI={10.1007/978-3-642-33167-1_43},
booktitle={Computer Security – ESORICS 2012}, author={Jager, Tibor and Schinzel,
Sebastian and Somorovsky, Juraj}, year={2012} }'
chicago: 'Jager, Tibor, Sebastian Schinzel, and Juraj Somorovsky. “Bleichenbacher’s
Attack Strikes Again: Breaking PKCS#1 v1.5 in XML Encryption.” In Computer
Security – ESORICS 2012. Berlin, Heidelberg, 2012. https://doi.org/10.1007/978-3-642-33167-1_43.'
ieee: 'T. Jager, S. Schinzel, and J. Somorovsky, “Bleichenbacher’s Attack Strikes
again: Breaking PKCS#1 v1.5 in XML Encryption,” in Computer Security – ESORICS
2012, Berlin, Heidelberg, 2012.'
mla: 'Jager, Tibor, et al. “Bleichenbacher’s Attack Strikes Again: Breaking PKCS#1
v1.5 in XML Encryption.” Computer Security – ESORICS 2012, 2012, doi:10.1007/978-3-642-33167-1_43.'
short: 'T. Jager, S. Schinzel, J. Somorovsky, in: Computer Security – ESORICS 2012,
Berlin, Heidelberg, 2012.'
date_created: 2020-02-15T09:31:47Z
date_updated: 2022-01-06T06:52:39Z
doi: 10.1007/978-3-642-33167-1_43
language:
- iso: eng
place: Berlin, Heidelberg
publication: Computer Security – ESORICS 2012
publication_identifier:
isbn:
- '9783642331664'
- '9783642331671'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: 'Bleichenbacher’s Attack Strikes again: Breaking PKCS#1 v1.5 in XML Encryption'
type: book_chapter
user_id: '83504'
year: '2012'
...
---
_id: '16408'
abstract:
- lang: eng
text: "We present a parallel rendering system for heterogeneous PC clusters to visualize
massive models. One single, powerful visualization node is supported by a group
of backend nodes with weak graphics performance. While the visualization node
renders the visible objects, the backend nodes asynchronously perform visibility
tests and supply the front end with visible scene objects. The visualization node
stores only currently visible objects in its memory, while the scene is distributed
among the backend nodes’ memory without redundancy. To efficiently compute the
occlusion tests in spite of that each backend node stores only a fraction of the
original geometry, we complete the scene by adding highly simplified versions
of the objects stored on other nodes. We test our system with 15 backend nodes.
It is able to render a ≈ 350,M polygons (≈ 8.5,GiB) large aircraft model with
20, to 30,fps and thus allows a walk-through in real-time.\r\n"
author:
- first_name: Tim
full_name: Suess, Tim
last_name: Suess
- first_name: Clemens
full_name: Koch, Clemens
last_name: Koch
- first_name: Claudius
full_name: Jähn, Claudius
last_name: Jähn
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Suess T, Koch C, Jähn C, Fischer M, Meyer auf der Heide F. Asynchronous Occlusion
Culling on Heterogeneous PC Clusters for Distributed 3D Scenes. In: Advances
in Visual Computing. Vol 7431. Lecture Notes in Computer Science. ; 2012:502-512.
doi:10.1007/978-3-642-33179-4_48'
apa: Suess, T., Koch, C., Jähn, C., Fischer, M., & Meyer auf der Heide, F. (2012).
Asynchronous Occlusion Culling on Heterogeneous PC Clusters for Distributed 3D
Scenes. Advances in Visual Computing, 7431, 502–512. https://doi.org/10.1007/978-3-642-33179-4_48
bibtex: '@inproceedings{Suess_Koch_Jähn_Fischer_Meyer auf der Heide_2012, place={Berlin,
Heidelberg}, series={Lecture Notes in Computer Science}, title={Asynchronous Occlusion
Culling on Heterogeneous PC Clusters for Distributed 3D Scenes}, volume={7431},
DOI={10.1007/978-3-642-33179-4_48},
booktitle={Advances in Visual Computing}, author={Suess, Tim and Koch, Clemens
and Jähn, Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm},
year={2012}, pages={502–512}, collection={Lecture Notes in Computer Science} }'
chicago: Suess, Tim, Clemens Koch, Claudius Jähn, Matthias Fischer, and Friedhelm
Meyer auf der Heide. “Asynchronous Occlusion Culling on Heterogeneous PC Clusters
for Distributed 3D Scenes.” In Advances in Visual Computing, 7431:502–12.
Lecture Notes in Computer Science. Berlin, Heidelberg, 2012. https://doi.org/10.1007/978-3-642-33179-4_48.
ieee: 'T. Suess, C. Koch, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Asynchronous
Occlusion Culling on Heterogeneous PC Clusters for Distributed 3D Scenes,” in
Advances in Visual Computing, 2012, vol. 7431, pp. 502–512, doi: 10.1007/978-3-642-33179-4_48.'
mla: Suess, Tim, et al. “Asynchronous Occlusion Culling on Heterogeneous PC Clusters
for Distributed 3D Scenes.” Advances in Visual Computing, vol. 7431, 2012,
pp. 502–12, doi:10.1007/978-3-642-33179-4_48.
short: 'T. Suess, C. Koch, C. Jähn, M. Fischer, F. Meyer auf der Heide, in: Advances
in Visual Computing, Berlin, Heidelberg, 2012, pp. 502–512.'
date_created: 2020-04-06T07:40:57Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-642-33179-4_48
intvolume: ' 7431'
language:
- iso: eng
page: 502-512
place: Berlin, Heidelberg
publication: Advances in Visual Computing
publication_identifier:
isbn:
- '9783642331787'
- '9783642331794'
issn:
- 0302-9743
- 1611-3349
publication_status: published
series_title: Lecture Notes in Computer Science
status: public
title: Asynchronous Occlusion Culling on Heterogeneous PC Clusters for Distributed
3D Scenes
type: conference
user_id: '15415'
volume: 7431
year: '2012'
...
---
_id: '20183'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Thomas
full_name: Schmickl, Thomas
last_name: Schmickl
- first_name: Karl
full_name: Crailsheim, Karl
last_name: Crailsheim
citation:
ama: 'Hamann H, Schmickl T, Crailsheim K. Evolving for Creativity: Maximizing Complexity
in a Self-organized Multi-particle System. In: 10th European Conference on
Artificial Life (ECAL’09). Vol 5777. ; 2011:442--449. doi:10.1007/978-3-642-21283-3_55'
apa: 'Hamann, H., Schmickl, T., & Crailsheim, K. (2011). Evolving for Creativity:
Maximizing Complexity in a Self-organized Multi-particle System. In 10th European
Conference on Artificial Life (ECAL’09) (Vol. 5777, pp. 442--449). https://doi.org/10.1007/978-3-642-21283-3_55'
bibtex: '@inproceedings{Hamann_Schmickl_Crailsheim_2011, title={Evolving for Creativity:
Maximizing Complexity in a Self-organized Multi-particle System}, volume={5777},
DOI={10.1007/978-3-642-21283-3_55},
booktitle={10th European Conference on Artificial Life (ECAL’09)}, author={Hamann,
Heiko and Schmickl, Thomas and Crailsheim, Karl}, year={2011}, pages={442--449}
}'
chicago: 'Hamann, Heiko, Thomas Schmickl, and Karl Crailsheim. “Evolving for Creativity:
Maximizing Complexity in a Self-Organized Multi-Particle System.” In 10th European
Conference on Artificial Life (ECAL’09), 5777:442--449, 2011. https://doi.org/10.1007/978-3-642-21283-3_55.'
ieee: 'H. Hamann, T. Schmickl, and K. Crailsheim, “Evolving for Creativity: Maximizing
Complexity in a Self-organized Multi-particle System,” in 10th European Conference
on Artificial Life (ECAL’09), 2011, vol. 5777, pp. 442--449.'
mla: 'Hamann, Heiko, et al. “Evolving for Creativity: Maximizing Complexity in a
Self-Organized Multi-Particle System.” 10th European Conference on Artificial
Life (ECAL’09), vol. 5777, 2011, pp. 442--449, doi:10.1007/978-3-642-21283-3_55.'
short: 'H. Hamann, T. Schmickl, K. Crailsheim, in: 10th European Conference on Artificial
Life (ECAL’09), 2011, pp. 442--449.'
date_created: 2020-10-22T12:27:11Z
date_updated: 2022-01-06T06:54:21Z
department:
- _id: '63'
- _id: '238'
doi: 10.1007/978-3-642-21283-3_55
intvolume: ' 5777'
language:
- iso: eng
page: 442--449
publication: 10th European Conference on Artificial Life (ECAL'09)
publication_identifier:
isbn:
- '9783642212826'
- '9783642212833'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: 'Evolving for Creativity: Maximizing Complexity in a Self-organized Multi-particle
System'
type: conference
user_id: '15415'
volume: 5777
year: '2011'
...
---
_id: '3332'
author:
- first_name: Theodor
full_name: Lettmann, Theodor
id: '315'
last_name: Lettmann
orcid: 0000-0001-5859-2457
- first_name: Michael
full_name: Baumann, Michael
last_name: Baumann
- first_name: Markus
full_name: Eberling, Markus
last_name: Eberling
- first_name: Thomas
full_name: Kemmerich, Thomas
last_name: Kemmerich
citation:
ama: Lettmann T, Baumann M, Eberling M, Kemmerich T. Modeling Agents and Agent Systems.
Transactions on Computational Collective Intelligence V. 2011:157-181.
doi:10.1007/978-3-642-24016-4_9
apa: Lettmann, T., Baumann, M., Eberling, M., & Kemmerich, T. (2011). Modeling
Agents and Agent Systems. Transactions on Computational Collective Intelligence
V, 157–181. https://doi.org/10.1007/978-3-642-24016-4_9
bibtex: '@article{Lettmann_Baumann_Eberling_Kemmerich_2011, title={Modeling Agents
and Agent Systems}, DOI={10.1007/978-3-642-24016-4_9},
journal={Transactions on Computational Collective Intelligence V}, publisher={Springer
Berlin Heidelberg}, author={Lettmann, Theodor and Baumann, Michael and Eberling,
Markus and Kemmerich, Thomas}, year={2011}, pages={157–181} }'
chicago: Lettmann, Theodor, Michael Baumann, Markus Eberling, and Thomas Kemmerich.
“Modeling Agents and Agent Systems.” Transactions on Computational Collective
Intelligence V, 2011, 157–81. https://doi.org/10.1007/978-3-642-24016-4_9.
ieee: T. Lettmann, M. Baumann, M. Eberling, and T. Kemmerich, “Modeling Agents and
Agent Systems,” Transactions on Computational Collective Intelligence V,
pp. 157–181, 2011.
mla: Lettmann, Theodor, et al. “Modeling Agents and Agent Systems.” Transactions
on Computational Collective Intelligence V, Springer Berlin Heidelberg, 2011,
pp. 157–81, doi:10.1007/978-3-642-24016-4_9.
short: T. Lettmann, M. Baumann, M. Eberling, T. Kemmerich, Transactions on Computational
Collective Intelligence V (2011) 157–181.
date_created: 2018-06-25T09:22:18Z
date_updated: 2022-01-06T06:59:10Z
doi: 10.1007/978-3-642-24016-4_9
language:
- iso: eng
page: 157-181
publication: Transactions on Computational Collective Intelligence V
publication_identifier:
isbn:
- '9783642240157'
- '9783642240164'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Modeling Agents and Agent Systems
type: journal_article
user_id: '315'
year: '2011'
...
---
_id: '20709'
author:
- first_name: Andreas
full_name: Cord-Landwehr, Andreas
last_name: Cord-Landwehr
- first_name: Bastian
full_name: Degener, Bastian
last_name: Degener
- first_name: Matthias
full_name: Fischer, Matthias
last_name: Fischer
- first_name: Martina
full_name: Hüllmann, Martina
last_name: Hüllmann
- first_name: Barbara
full_name: Kempkes, Barbara
last_name: Kempkes
- first_name: Alexander
full_name: Klaas, Alexander
last_name: Klaas
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Sven
full_name: Kurras, Sven
last_name: Kurras
- first_name: Marcus
full_name: Märtens, Marcus
last_name: Märtens
- first_name: Friedhelm Meyer
full_name: auf der Heide, Friedhelm Meyer
last_name: auf der Heide
- first_name: Christoph
full_name: Raupach, Christoph
last_name: Raupach
- first_name: Kamil
full_name: Swierkot, Kamil
last_name: Swierkot
- first_name: Daniel
full_name: Warner, Daniel
id: '3902'
last_name: Warner
- first_name: Christoph
full_name: Weddemann, Christoph
last_name: Weddemann
- first_name: Daniel
full_name: Wonisch, Daniel
last_name: Wonisch
citation:
ama: 'Cord-Landwehr A, Degener B, Fischer M, et al. Collisionless Gathering of Robots
with an Extent. In: SOFSEM 2011: Theory and Practice of Computer Science.
Berlin, Heidelberg; 2011. doi:10.1007/978-3-642-18381-2_15'
apa: 'Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas,
A., … Wonisch, D. (2011). Collisionless Gathering of Robots with an Extent. In
SOFSEM 2011: Theory and Practice of Computer Science. Berlin, Heidelberg.
https://doi.org/10.1007/978-3-642-18381-2_15'
bibtex: '@inbook{Cord-Landwehr_Degener_Fischer_Hüllmann_Kempkes_Klaas_Kling_Kurras_Märtens_auf
der Heide_et al._2011, place={Berlin, Heidelberg}, title={Collisionless Gathering
of Robots with an Extent}, DOI={10.1007/978-3-642-18381-2_15},
booktitle={SOFSEM 2011: Theory and Practice of Computer Science}, author={Cord-Landwehr,
Andreas and Degener, Bastian and Fischer, Matthias and Hüllmann, Martina and Kempkes,
Barbara and Klaas, Alexander and Kling, Peter and Kurras, Sven and Märtens, Marcus
and auf der Heide, Friedhelm Meyer and et al.}, year={2011} }'
chicago: 'Cord-Landwehr, Andreas, Bastian Degener, Matthias Fischer, Martina Hüllmann,
Barbara Kempkes, Alexander Klaas, Peter Kling, et al. “Collisionless Gathering
of Robots with an Extent.” In SOFSEM 2011: Theory and Practice of Computer
Science. Berlin, Heidelberg, 2011. https://doi.org/10.1007/978-3-642-18381-2_15.'
ieee: 'A. Cord-Landwehr et al., “Collisionless Gathering of Robots with an
Extent,” in SOFSEM 2011: Theory and Practice of Computer Science, Berlin,
Heidelberg, 2011.'
mla: 'Cord-Landwehr, Andreas, et al. “Collisionless Gathering of Robots with an
Extent.” SOFSEM 2011: Theory and Practice of Computer Science, 2011, doi:10.1007/978-3-642-18381-2_15.'
short: 'A. Cord-Landwehr, B. Degener, M. Fischer, M. Hüllmann, B. Kempkes, A. Klaas,
P. Kling, S. Kurras, M. Märtens, F.M. auf der Heide, C. Raupach, K. Swierkot,
D. Warner, C. Weddemann, D. Wonisch, in: SOFSEM 2011: Theory and Practice of Computer
Science, Berlin, Heidelberg, 2011.'
date_created: 2020-12-12T11:15:30Z
date_updated: 2022-01-06T06:54:33Z
department:
- _id: '63'
doi: 10.1007/978-3-642-18381-2_15
language:
- iso: eng
place: Berlin, Heidelberg
publication: 'SOFSEM 2011: Theory and Practice of Computer Science'
publication_identifier:
isbn:
- '9783642183805'
- '9783642183812'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Collisionless Gathering of Robots with an Extent
type: book_chapter
user_id: '3902'
year: '2011'
...
---
_id: '20710'
author:
- first_name: Andreas
full_name: Cord-Landwehr, Andreas
last_name: Cord-Landwehr
- first_name: Bastian
full_name: Degener, Bastian
last_name: Degener
- first_name: Matthias
full_name: Fischer, Matthias
last_name: Fischer
- first_name: Martina
full_name: Hüllmann, Martina
last_name: Hüllmann
- first_name: Barbara
full_name: Kempkes, Barbara
last_name: Kempkes
- first_name: Alexander
full_name: Klaas, Alexander
last_name: Klaas
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Sven
full_name: Kurras, Sven
last_name: Kurras
- first_name: Marcus
full_name: Märtens, Marcus
last_name: Märtens
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
last_name: Meyer auf der Heide
- first_name: Christoph
full_name: Raupach, Christoph
last_name: Raupach
- first_name: Kamil
full_name: Swierkot, Kamil
last_name: Swierkot
- first_name: Daniel
full_name: Warner, Daniel
id: '3902'
last_name: Warner
- first_name: Christoph
full_name: Weddemann, Christoph
last_name: Weddemann
- first_name: Daniel
full_name: Wonisch, Daniel
last_name: Wonisch
citation:
ama: 'Cord-Landwehr A, Degener B, Fischer M, et al. A New Approach for Analyzing
Convergence Algorithms for Mobile Robots. In: Automata, Languages and Programming.
Berlin, Heidelberg; 2011. doi:10.1007/978-3-642-22012-8_52'
apa: Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas,
A., … Wonisch, D. (2011). A New Approach for Analyzing Convergence Algorithms
for Mobile Robots. In Automata, Languages and Programming. Berlin, Heidelberg.
https://doi.org/10.1007/978-3-642-22012-8_52
bibtex: '@inbook{Cord-Landwehr_Degener_Fischer_Hüllmann_Kempkes_Klaas_Kling_Kurras_Märtens_Meyer
auf der Heide_et al._2011, place={Berlin, Heidelberg}, title={A New Approach for
Analyzing Convergence Algorithms for Mobile Robots}, DOI={10.1007/978-3-642-22012-8_52},
booktitle={Automata, Languages and Programming}, author={Cord-Landwehr, Andreas
and Degener, Bastian and Fischer, Matthias and Hüllmann, Martina and Kempkes,
Barbara and Klaas, Alexander and Kling, Peter and Kurras, Sven and Märtens, Marcus
and Meyer auf der Heide, Friedhelm and et al.}, year={2011} }'
chicago: Cord-Landwehr, Andreas, Bastian Degener, Matthias Fischer, Martina Hüllmann,
Barbara Kempkes, Alexander Klaas, Peter Kling, et al. “A New Approach for Analyzing
Convergence Algorithms for Mobile Robots.” In Automata, Languages and Programming.
Berlin, Heidelberg, 2011. https://doi.org/10.1007/978-3-642-22012-8_52.
ieee: A. Cord-Landwehr et al., “A New Approach for Analyzing Convergence
Algorithms for Mobile Robots,” in Automata, Languages and Programming,
Berlin, Heidelberg, 2011.
mla: Cord-Landwehr, Andreas, et al. “A New Approach for Analyzing Convergence Algorithms
for Mobile Robots.” Automata, Languages and Programming, 2011, doi:10.1007/978-3-642-22012-8_52.
short: 'A. Cord-Landwehr, B. Degener, M. Fischer, M. Hüllmann, B. Kempkes, A. Klaas,
P. Kling, S. Kurras, M. Märtens, F. Meyer auf der Heide, C. Raupach, K. Swierkot,
D. Warner, C. Weddemann, D. Wonisch, in: Automata, Languages and Programming,
Berlin, Heidelberg, 2011.'
date_created: 2020-12-12T12:22:41Z
date_updated: 2022-01-06T06:54:33Z
department:
- _id: '63'
doi: 10.1007/978-3-642-22012-8_52
language:
- iso: eng
place: Berlin, Heidelberg
publication: Automata, Languages and Programming
publication_identifier:
isbn:
- '9783642220111'
- '9783642220128'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: A New Approach for Analyzing Convergence Algorithms for Mobile Robots
type: book_chapter
user_id: '3902'
year: '2011'
...
---
_id: '6293'
author:
- first_name: Karsten
full_name: Nebe, Karsten
last_name: Nebe
- first_name: Florian
full_name: Klompmaker, Florian
last_name: Klompmaker
- first_name: Helge
full_name: Jung, Helge
last_name: Jung
- first_name: Holger Gerhard
full_name: Fischer, Holger Gerhard
id: '30457'
last_name: Fischer
citation:
ama: 'Nebe K, Klompmaker F, Jung H, Fischer HG. Exploiting New Interaction Techniques
for Disaster Control Management Using Multitouch-, Tangible- and Pen-Based-Interaction.
In: Jacko JA, ed. Human-Computer Interaction. Interaction Techniques and Environments.
Vol 6762. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin
Heidelberg; 2011:100-109. doi:10.1007/978-3-642-21605-3_11'
apa: 'Nebe, K., Klompmaker, F., Jung, H., & Fischer, H. G. (2011). Exploiting
New Interaction Techniques for Disaster Control Management Using Multitouch-,
Tangible- and Pen-Based-Interaction. In J. A. Jacko (Ed.), Human-Computer Interaction.
Interaction Techniques and Environments. (Vol. 6762, pp. 100–109). Berlin,
Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-21605-3_11'
bibtex: '@inbook{Nebe_Klompmaker_Jung_Fischer_2011, place={Berlin, Heidelberg},
series={Lecture Notes in Computer Science}, title={Exploiting New Interaction
Techniques for Disaster Control Management Using Multitouch-, Tangible- and Pen-Based-Interaction},
volume={6762}, DOI={10.1007/978-3-642-21605-3_11},
booktitle={Human-Computer Interaction. Interaction Techniques and Environments.},
publisher={Springer Berlin Heidelberg}, author={Nebe, Karsten and Klompmaker,
Florian and Jung, Helge and Fischer, Holger Gerhard}, editor={Jacko, Julie AnneEditor},
year={2011}, pages={100–109}, collection={Lecture Notes in Computer Science} }'
chicago: 'Nebe, Karsten, Florian Klompmaker, Helge Jung, and Holger Gerhard Fischer.
“Exploiting New Interaction Techniques for Disaster Control Management Using Multitouch-,
Tangible- and Pen-Based-Interaction.” In Human-Computer Interaction. Interaction
Techniques and Environments., edited by Julie Anne Jacko, 6762:100–109. Lecture
Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011.
https://doi.org/10.1007/978-3-642-21605-3_11.'
ieee: 'K. Nebe, F. Klompmaker, H. Jung, and H. G. Fischer, “Exploiting New Interaction
Techniques for Disaster Control Management Using Multitouch-, Tangible- and Pen-Based-Interaction,”
in Human-Computer Interaction. Interaction Techniques and Environments.,
vol. 6762, J. A. Jacko, Ed. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011,
pp. 100–109.'
mla: Nebe, Karsten, et al. “Exploiting New Interaction Techniques for Disaster Control
Management Using Multitouch-, Tangible- and Pen-Based-Interaction.” Human-Computer
Interaction. Interaction Techniques and Environments., edited by Julie Anne
Jacko, vol. 6762, Springer Berlin Heidelberg, 2011, pp. 100–09, doi:10.1007/978-3-642-21605-3_11.
short: 'K. Nebe, F. Klompmaker, H. Jung, H.G. Fischer, in: J.A. Jacko (Ed.), Human-Computer
Interaction. Interaction Techniques and Environments., Springer Berlin Heidelberg,
Berlin, Heidelberg, 2011, pp. 100–109.'
conference:
end_date: 2011-07-14
location: Orlando, USA
name: International Conference on Interaction Techniques and Environments as part
of HCI International 2011
start_date: 2011-07-09
date_created: 2018-12-18T12:55:26Z
date_updated: 2022-01-06T07:03:00Z
department:
- _id: '66'
- _id: '534'
- _id: '221'
doi: 10.1007/978-3-642-21605-3_11
editor:
- first_name: Julie Anne
full_name: Jacko, Julie Anne
last_name: Jacko
intvolume: ' 6762'
language:
- iso: eng
page: 100-109
place: Berlin, Heidelberg
publication: Human-Computer Interaction. Interaction Techniques and Environments.
publication_identifier:
isbn:
- '9783642216046'
- '9783642216053'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
series_title: Lecture Notes in Computer Science
status: public
title: Exploiting New Interaction Techniques for Disaster Control Management Using
Multitouch-, Tangible- and Pen-Based-Interaction
type: book_chapter
user_id: '30457'
volume: 6762
year: '2011'
...
---
_id: '6300'
author:
- first_name: Holger Gerhard
full_name: Fischer, Holger Gerhard
id: '30457'
last_name: Fischer
- first_name: Karsten
full_name: Nebe, Karsten
last_name: Nebe
- first_name: Florian
full_name: Klompmaker, Florian
last_name: Klompmaker
citation:
ama: 'Fischer HG, Nebe K, Klompmaker F. A Holistic Model for Integrating Usability
Engineering and Software Engineering Enriched with Marketing Activities. In: Kurosu
M, ed. Human Centered Design. Vol 6776. Lecture Notes in Computer Science.
Berlin, Heidelberg: Springer Berlin Heidelberg; 2011:28-37. doi:10.1007/978-3-642-21753-1_4'
apa: 'Fischer, H. G., Nebe, K., & Klompmaker, F. (2011). A Holistic Model for
Integrating Usability Engineering and Software Engineering Enriched with Marketing
Activities. In M. Kurosu (Ed.), Human Centered Design (Vol. 6776, pp. 28–37).
Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-21753-1_4'
bibtex: '@inbook{Fischer_Nebe_Klompmaker_2011, place={Berlin, Heidelberg}, series={Lecture
Notes in Computer Science}, title={A Holistic Model for Integrating Usability
Engineering and Software Engineering Enriched with Marketing Activities}, volume={6776},
DOI={10.1007/978-3-642-21753-1_4},
booktitle={Human Centered Design}, publisher={Springer Berlin Heidelberg}, author={Fischer,
Holger Gerhard and Nebe, Karsten and Klompmaker, Florian}, editor={Kurosu, MasaakiEditor},
year={2011}, pages={28–37}, collection={Lecture Notes in Computer Science} }'
chicago: 'Fischer, Holger Gerhard, Karsten Nebe, and Florian Klompmaker. “A Holistic
Model for Integrating Usability Engineering and Software Engineering Enriched
with Marketing Activities.” In Human Centered Design, edited by Masaaki
Kurosu, 6776:28–37. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer
Berlin Heidelberg, 2011. https://doi.org/10.1007/978-3-642-21753-1_4.'
ieee: 'H. G. Fischer, K. Nebe, and F. Klompmaker, “A Holistic Model for Integrating
Usability Engineering and Software Engineering Enriched with Marketing Activities,”
in Human Centered Design, vol. 6776, M. Kurosu, Ed. Berlin, Heidelberg:
Springer Berlin Heidelberg, 2011, pp. 28–37.'
mla: Fischer, Holger Gerhard, et al. “A Holistic Model for Integrating Usability
Engineering and Software Engineering Enriched with Marketing Activities.” Human
Centered Design, edited by Masaaki Kurosu, vol. 6776, Springer Berlin Heidelberg,
2011, pp. 28–37, doi:10.1007/978-3-642-21753-1_4.
short: 'H.G. Fischer, K. Nebe, F. Klompmaker, in: M. Kurosu (Ed.), Human Centered
Design, Springer Berlin Heidelberg, Berlin, Heidelberg, 2011, pp. 28–37.'
conference:
end_date: 2011-07-14
location: Orlando, USA
name: International Conference on Human Centered Design (HCD) as part of HCI International
2011
start_date: 2011-07-09
date_created: 2018-12-18T13:04:39Z
date_updated: 2022-01-06T07:03:00Z
department:
- _id: '66'
- _id: '534'
- _id: '221'
doi: 10.1007/978-3-642-21753-1_4
editor:
- first_name: Masaaki
full_name: Kurosu, Masaaki
last_name: Kurosu
intvolume: ' 6776'
language:
- iso: eng
page: 28-37
place: Berlin, Heidelberg
publication: Human Centered Design
publication_identifier:
isbn:
- '9783642217524'
- '9783642217531'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
series_title: Lecture Notes in Computer Science
status: public
title: A Holistic Model for Integrating Usability Engineering and Software Engineering
Enriched with Marketing Activities
type: book_chapter
user_id: '30457'
volume: 6776
year: '2011'
...
---
_id: '16410'
abstract:
- lang: eng
text: 'Gathering n mobile robots in one single point in the Euclidean plane is a
widely studied problem from the area of robot formation problems. Classically,
the robots are assumed to have no physical extent, and they are able to share
a position with other robots. We drop these assumptions and investigate a similar
problem for robots with (a spherical) extent: the goal is to gather the robots
as close together as possible. More exactly, we want the robots to form a sphere
with minimum radius around a predefined point. We propose an algorithm for this
problem which synchronously moves the robots towards the center of the sphere
unless they block each other. In this case, if possible, the robots spin around
the center of the sphere. We analyze this algorithm experimentally in the plane.
If R is the distance of the farthest robot to the center of the sphere, the simulations
indicate a runtime which is linear in n and R. Additionally, we prove a theoretic
upper bound for the runtime of O(nR) for a discrete version of the problem. Simulations
also suggest a runtime of O(n + R) for the discrete version.'
author:
- first_name: Andreas
full_name: Cord-Landwehr, Andreas
last_name: Cord-Landwehr
- first_name: Bastian
full_name: Degener, Bastian
last_name: Degener
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Martina
full_name: Hüllmann, Martina
last_name: Hüllmann
- first_name: Barbara
full_name: Kempkes, Barbara
last_name: Kempkes
- first_name: Alexander
full_name: Klaas, Alexander
last_name: Klaas
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Sven
full_name: Kurras, Sven
last_name: Kurras
- first_name: Marcus
full_name: Märtens, Marcus
last_name: Märtens
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Christoph
full_name: Raupach, Christoph
last_name: Raupach
- first_name: Kamil
full_name: Swierkot, Kamil
last_name: Swierkot
- first_name: Daniel
full_name: Warner, Daniel
last_name: Warner
- first_name: Christoph
full_name: Weddemann, Christoph
last_name: Weddemann
- first_name: Daniel
full_name: Wonisch, Daniel
last_name: Wonisch
citation:
ama: 'Cord-Landwehr A, Degener B, Fischer M, et al. Collisionless Gathering of Robots
with an Extent. In: 37th International Conference on Current Trends in Theory
and Practice of Computer Science (SOFSEM 2011). Springer; 2011:178-189. doi:10.1007/978-3-642-18381-2_15'
apa: Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas,
A., … Wonisch, D. (2011). Collisionless Gathering of Robots with an Extent. In
37th International Conference on Current Trends in Theory and Practice of Computer
Science (SOFSEM 2011) (pp. 178–189). Springer. https://doi.org/10.1007/978-3-642-18381-2_15
bibtex: '@inproceedings{Cord-Landwehr_Degener_Fischer_Hüllmann_Kempkes_Klaas_Kling_Kurras_Märtens_Meyer
auf der Heide_et al._2011, title={Collisionless Gathering of Robots with an Extent},
DOI={10.1007/978-3-642-18381-2_15},
number={6543}, booktitle={37th International Conference on Current Trends in Theory
and Practice of Computer Science (SOFSEM 2011)}, publisher={Springer}, author={Cord-Landwehr,
Andreas and Degener, Bastian and Fischer, Matthias and Hüllmann, Martina and Kempkes,
Barbara and Klaas, Alexander and Kling, Peter and Kurras, Sven and Märtens, Marcus
and Meyer auf der Heide, Friedhelm and et al.}, year={2011}, pages={178–189} }'
chicago: Cord-Landwehr, Andreas, Bastian Degener, Matthias Fischer, Martina Hüllmann,
Barbara Kempkes, Alexander Klaas, Peter Kling, et al. “Collisionless Gathering
of Robots with an Extent.” In 37th International Conference on Current Trends
in Theory and Practice of Computer Science (SOFSEM 2011), 178–89. Springer,
2011. https://doi.org/10.1007/978-3-642-18381-2_15.
ieee: A. Cord-Landwehr et al., “Collisionless Gathering of Robots with an
Extent,” in 37th International Conference on Current Trends in Theory and Practice
of Computer Science (SOFSEM 2011), 2011, no. 6543, pp. 178–189.
mla: Cord-Landwehr, Andreas, et al. “Collisionless Gathering of Robots with an Extent.”
37th International Conference on Current Trends in Theory and Practice of Computer
Science (SOFSEM 2011), no. 6543, Springer, 2011, pp. 178–89, doi:10.1007/978-3-642-18381-2_15.
short: 'A. Cord-Landwehr, B. Degener, M. Fischer, M. Hüllmann, B. Kempkes, A. Klaas,
P. Kling, S. Kurras, M. Märtens, F. Meyer auf der Heide, C. Raupach, K. Swierkot,
D. Warner, C. Weddemann, D. Wonisch, in: 37th International Conference on Current
Trends in Theory and Practice of Computer Science (SOFSEM 2011), Springer, 2011,
pp. 178–189.'
date_created: 2020-04-06T07:52:42Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-642-18381-2_15
issue: '6543'
language:
- iso: eng
page: 178-189
publication: 37th International Conference on Current Trends in Theory and Practice
of Computer Science (SOFSEM 2011)
publication_identifier:
isbn:
- '9783642183805'
- '9783642183812'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer
status: public
title: Collisionless Gathering of Robots with an Extent
type: conference
user_id: '15415'
year: '2011'
...
---
_id: '16459'
author:
- first_name: Philipp
full_name: Brandes, Philipp
last_name: Brandes
- first_name: Bastian
full_name: Degener, Bastian
last_name: Degener
- first_name: Barbara
full_name: Kempkes, Barbara
last_name: Kempkes
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Brandes P, Degener B, Kempkes B, Meyer auf der Heide F. Energy-Efficient Strategies
for Building Short Chains of Mobile Robots Locally. In: Structural Information
and Communication Complexity. Berlin, Heidelberg; 2011. doi:10.1007/978-3-642-22212-2_13'
apa: Brandes, P., Degener, B., Kempkes, B., & Meyer auf der Heide, F. (2011).
Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally.
In Structural Information and Communication Complexity. Berlin, Heidelberg.
https://doi.org/10.1007/978-3-642-22212-2_13
bibtex: '@inbook{Brandes_Degener_Kempkes_Meyer auf der Heide_2011, place={Berlin,
Heidelberg}, title={Energy-Efficient Strategies for Building Short Chains of Mobile
Robots Locally}, DOI={10.1007/978-3-642-22212-2_13},
booktitle={Structural Information and Communication Complexity}, author={Brandes,
Philipp and Degener, Bastian and Kempkes, Barbara and Meyer auf der Heide, Friedhelm},
year={2011} }'
chicago: Brandes, Philipp, Bastian Degener, Barbara Kempkes, and Friedhelm Meyer
auf der Heide. “Energy-Efficient Strategies for Building Short Chains of Mobile
Robots Locally.” In Structural Information and Communication Complexity.
Berlin, Heidelberg, 2011. https://doi.org/10.1007/978-3-642-22212-2_13.
ieee: P. Brandes, B. Degener, B. Kempkes, and F. Meyer auf der Heide, “Energy-Efficient
Strategies for Building Short Chains of Mobile Robots Locally,” in Structural
Information and Communication Complexity, Berlin, Heidelberg, 2011.
mla: Brandes, Philipp, et al. “Energy-Efficient Strategies for Building Short Chains
of Mobile Robots Locally.” Structural Information and Communication Complexity,
2011, doi:10.1007/978-3-642-22212-2_13.
short: 'P. Brandes, B. Degener, B. Kempkes, F. Meyer auf der Heide, in: Structural
Information and Communication Complexity, Berlin, Heidelberg, 2011.'
date_created: 2020-04-08T06:52:53Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-642-22212-2_13
language:
- iso: eng
place: Berlin, Heidelberg
publication: Structural Information and Communication Complexity
publication_identifier:
isbn:
- '9783642222115'
- '9783642222122'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally
type: book_chapter
user_id: '15415'
year: '2011'
...
---
_id: '15097'
author:
- first_name: Markus
full_name: Benter, Markus
last_name: Benter
- first_name: Stefan
full_name: Böttcher, Stefan
id: '624'
last_name: Böttcher
- first_name: Rita
full_name: Hartel, Rita
id: '14961'
last_name: Hartel
citation:
ama: 'Benter M, Böttcher S, Hartel R. Mixing Bottom-Up and Top-Down XPath Query
Evaluation. In: East European Conference on Advances in Databases and Information
Systems. Springer; 2011:27-41. doi:10.1007/978-3-642-23737-9_3'
apa: Benter, M., Böttcher, S., & Hartel, R. (2011). Mixing Bottom-Up and Top-Down
XPath Query Evaluation. In East European Conference on Advances in Databases
and Information Systems (pp. 27–41). Springer. https://doi.org/10.1007/978-3-642-23737-9_3
bibtex: '@inproceedings{Benter_Böttcher_Hartel_2011, title={Mixing Bottom-Up and
Top-Down XPath Query Evaluation}, DOI={10.1007/978-3-642-23737-9_3},
booktitle={East European Conference on Advances in Databases and Information Systems},
publisher={Springer}, author={Benter, Markus and Böttcher, Stefan and Hartel,
Rita}, year={2011}, pages={27–41} }'
chicago: Benter, Markus, Stefan Böttcher, and Rita Hartel. “Mixing Bottom-Up and
Top-Down XPath Query Evaluation.” In East European Conference on Advances in
Databases and Information Systems, 27–41. Springer, 2011. https://doi.org/10.1007/978-3-642-23737-9_3.
ieee: M. Benter, S. Böttcher, and R. Hartel, “Mixing Bottom-Up and Top-Down XPath
Query Evaluation,” in East European Conference on Advances in Databases and
Information Systems, 2011, pp. 27–41.
mla: Benter, Markus, et al. “Mixing Bottom-Up and Top-Down XPath Query Evaluation.”
East European Conference on Advances in Databases and Information Systems,
Springer, 2011, pp. 27–41, doi:10.1007/978-3-642-23737-9_3.
short: 'M. Benter, S. Böttcher, R. Hartel, in: East European Conference on Advances
in Databases and Information Systems, Springer, 2011, pp. 27–41.'
date_created: 2019-11-21T15:27:31Z
date_updated: 2022-01-06T06:52:15Z
department:
- _id: '69'
doi: 10.1007/978-3-642-23737-9_3
language:
- iso: eng
page: 27-41
publication: East European Conference on Advances in Databases and Information Systems
publication_identifier:
isbn:
- '9783642237362'
- '9783642237379'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer
status: public
title: Mixing Bottom-Up and Top-Down XPath Query Evaluation
type: conference
user_id: '14961'
year: '2011'
...
---
_id: '15099'
author:
- first_name: Alexander
full_name: Bätz, Alexander
last_name: Bätz
- first_name: Stefan
full_name: Böttcher, Stefan
id: '624'
last_name: Böttcher
- first_name: Rita
full_name: Hartel, Rita
id: '14961'
last_name: Hartel
citation:
ama: 'Bätz A, Böttcher S, Hartel R. Updates on Grammar-Compressed XML Data. In:
Advances in Databases - 28th British National Conference on Databases, BNCOD
28, Revised Selected Papers. Springer; 2011:154-166. doi:10.1007/978-3-642-24577-0_17'
apa: Bätz, A., Böttcher, S., & Hartel, R. (2011). Updates on Grammar-Compressed
XML Data. In Advances in Databases - 28th British National Conference on Databases,
BNCOD 28, Revised Selected Papers (pp. 154–166). Springer. https://doi.org/10.1007/978-3-642-24577-0_17
bibtex: '@inproceedings{Bätz_Böttcher_Hartel_2011, title={Updates on Grammar-Compressed
XML Data}, DOI={10.1007/978-3-642-24577-0_17},
booktitle={Advances in Databases - 28th British National Conference on Databases,
BNCOD 28, Revised Selected Papers}, publisher={Springer}, author={Bätz, Alexander
and Böttcher, Stefan and Hartel, Rita}, year={2011}, pages={154–166} }'
chicago: Bätz, Alexander, Stefan Böttcher, and Rita Hartel. “Updates on Grammar-Compressed
XML Data.” In Advances in Databases - 28th British National Conference on Databases,
BNCOD 28, Revised Selected Papers, 154–66. Springer, 2011. https://doi.org/10.1007/978-3-642-24577-0_17.
ieee: A. Bätz, S. Böttcher, and R. Hartel, “Updates on Grammar-Compressed XML Data,”
in Advances in Databases - 28th British National Conference on Databases, BNCOD
28, Revised Selected Papers, 2011, pp. 154–166.
mla: Bätz, Alexander, et al. “Updates on Grammar-Compressed XML Data.” Advances
in Databases - 28th British National Conference on Databases, BNCOD 28, Revised
Selected Papers, Springer, 2011, pp. 154–66, doi:10.1007/978-3-642-24577-0_17.
short: 'A. Bätz, S. Böttcher, R. Hartel, in: Advances in Databases - 28th British
National Conference on Databases, BNCOD 28, Revised Selected Papers, Springer,
2011, pp. 154–166.'
date_created: 2019-11-21T15:30:41Z
date_updated: 2022-01-06T06:52:15Z
department:
- _id: '69'
doi: 10.1007/978-3-642-24577-0_17
language:
- iso: eng
page: 154-166
publication: Advances in Databases - 28th British National Conference on Databases,
BNCOD 28, Revised Selected Papers
publication_identifier:
isbn:
- '9783642245763'
- '9783642245770'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer
status: public
title: Updates on Grammar-Compressed XML Data
type: conference
user_id: '14961'
year: '2011'
...