---
_id: '5862'
author:
- first_name: Tibor
full_name: Jager, Tibor
id: '64669'
last_name: Jager
- first_name: Rafael
full_name: Kurek, Rafael
id: '64752'
last_name: Kurek
- first_name: Jiaxin
full_name: Pan, Jiaxin
last_name: Pan
citation:
ama: 'Jager T, Kurek R, Pan J. Simple and More Efficient PRFs with Tight Security
from LWE and Matrix-DDH. In: Advances in Cryptology - ASIACRYPT 2018 - 24th
International Conference on the Theory and Application of Cryptology and Information
Security, Brisbane, QLD, Australia, December 2-6, 2018, Proceedings, Part III.
; 2018:490-518. doi:10.1007/978-3-030-03332-3_18'
apa: Jager, T., Kurek, R., & Pan, J. (2018). Simple and More Efficient PRFs
with Tight Security from LWE and Matrix-DDH. In Advances in Cryptology - ASIACRYPT
2018 - 24th International Conference on the Theory and Application of Cryptology
and Information Security, Brisbane, QLD, Australia, December 2-6, 2018, Proceedings,
Part III (pp. 490–518). https://doi.org/10.1007/978-3-030-03332-3_18
bibtex: '@inproceedings{Jager_Kurek_Pan_2018, title={Simple and More Efficient PRFs
with Tight Security from LWE and Matrix-DDH}, DOI={10.1007/978-3-030-03332-3_18},
booktitle={Advances in Cryptology - ASIACRYPT 2018 - 24th International Conference
on the Theory and Application of Cryptology and Information Security, Brisbane,
QLD, Australia, December 2-6, 2018, Proceedings, Part III}, author={Jager, Tibor
and Kurek, Rafael and Pan, Jiaxin}, year={2018}, pages={490–518} }'
chicago: Jager, Tibor, Rafael Kurek, and Jiaxin Pan. “Simple and More Efficient
PRFs with Tight Security from LWE and Matrix-DDH.” In Advances in Cryptology
- ASIACRYPT 2018 - 24th International Conference on the Theory and Application
of Cryptology and Information Security, Brisbane, QLD, Australia, December 2-6,
2018, Proceedings, Part III, 490–518, 2018. https://doi.org/10.1007/978-3-030-03332-3_18.
ieee: T. Jager, R. Kurek, and J. Pan, “Simple and More Efficient PRFs with Tight
Security from LWE and Matrix-DDH,” in Advances in Cryptology - ASIACRYPT 2018
- 24th International Conference on the Theory and Application of Cryptology and
Information Security, Brisbane, QLD, Australia, December 2-6, 2018, Proceedings,
Part III, 2018, pp. 490–518.
mla: Jager, Tibor, et al. “Simple and More Efficient PRFs with Tight Security from
LWE and Matrix-DDH.” Advances in Cryptology - ASIACRYPT 2018 - 24th International
Conference on the Theory and Application of Cryptology and Information Security,
Brisbane, QLD, Australia, December 2-6, 2018, Proceedings, Part III, 2018,
pp. 490–518, doi:10.1007/978-3-030-03332-3_18.
short: 'T. Jager, R. Kurek, J. Pan, in: Advances in Cryptology - ASIACRYPT 2018
- 24th International Conference on the Theory and Application of Cryptology and
Information Security, Brisbane, QLD, Australia, December 2-6, 2018, Proceedings,
Part III, 2018, pp. 490–518.'
date_created: 2018-11-27T09:42:49Z
date_updated: 2022-01-06T07:02:44Z
department:
- _id: '558'
doi: 10.1007/978-3-030-03332-3_18
language:
- iso: eng
page: 490-518
publication: Advances in Cryptology - ASIACRYPT 2018 - 24th International Conference
on the Theory and Application of Cryptology and Information Security, Brisbane,
QLD, Australia, December 2-6, 2018, Proceedings, Part III
status: public
title: Simple and More Efficient PRFs with Tight Security from LWE and Matrix-DDH
type: conference
user_id: '38235'
year: '2018'
...
---
_id: '5936'
author:
- first_name: Manuel
full_name: Scheibl, Manuel
last_name: Scheibl
citation:
ama: Scheibl M. Learning about Learning Curves from Dataset Properties. Universität
Paderborn; 2018.
apa: Scheibl, M. (2018). Learning about learning curves from dataset properties.
Universität Paderborn.
bibtex: '@book{Scheibl_2018, title={Learning about learning curves from dataset
properties}, publisher={Universität Paderborn}, author={Scheibl, Manuel}, year={2018}
}'
chicago: Scheibl, Manuel. Learning about Learning Curves from Dataset Properties.
Universität Paderborn, 2018.
ieee: M. Scheibl, Learning about learning curves from dataset properties.
Universität Paderborn, 2018.
mla: Scheibl, Manuel. Learning about Learning Curves from Dataset Properties.
Universität Paderborn, 2018.
short: M. Scheibl, Learning about Learning Curves from Dataset Properties, Universität
Paderborn, 2018.
date_created: 2018-11-28T10:29:53Z
date_updated: 2022-01-06T07:02:47Z
department:
- _id: '355'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '10'
name: SFB 901 - Subproject B2
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
title: Learning about learning curves from dataset properties
type: bachelorsthesis
user_id: '477'
year: '2018'
...
---
_id: '5984'
alternative_title:
- Special Issue of SIROCCO 2015
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Scheideler C. Preface. Theor Comput Sci. 2018;751:1. doi:10.1016/j.tcs.2018.11.004
apa: Scheideler, C. (2018). Preface. Theor. Comput. Sci., 751, 1.
https://doi.org/10.1016/j.tcs.2018.11.004
bibtex: '@article{Scheideler_2018, title={Preface}, volume={751}, DOI={10.1016/j.tcs.2018.11.004},
journal={Theor. Comput. Sci.}, author={Scheideler, Christian}, year={2018}, pages={1}
}'
chicago: 'Scheideler, Christian. “Preface.” Theor. Comput. Sci. 751 (2018):
1. https://doi.org/10.1016/j.tcs.2018.11.004.'
ieee: C. Scheideler, “Preface,” Theor. Comput. Sci., vol. 751, p. 1, 2018.
mla: Scheideler, Christian. “Preface.” Theor. Comput. Sci., vol. 751, 2018,
p. 1, doi:10.1016/j.tcs.2018.11.004.
short: C. Scheideler, Theor. Comput. Sci. 751 (2018) 1.
date_created: 2018-11-30T08:08:23Z
date_updated: 2022-01-06T07:02:49Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1016/j.tcs.2018.11.004
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2019-01-11T10:20:16Z
date_updated: 2019-01-11T10:20:16Z
file_id: '6620'
file_name: Preface.pdf
file_size: 112676
relation: main_file
success: 1
file_date_updated: 2019-01-11T10:20:16Z
has_accepted_license: '1'
intvolume: ' 751'
language:
- iso: eng
page: '1'
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Theor. Comput. Sci.
status: public
title: Preface
type: journal_article
user_id: '15504'
volume: 751
year: '2018'
...
---
_id: '5985'
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Scheideler C. Relays: Towards a Link Layer for Robust and Secure Fog Computing.
In: Proceedings of the 2018 Workshop on Theory and Practice for Integrated
Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom,
July 27, 2018. ; 2018:1-2. doi:10.1145/3229774.3229781'
apa: 'Scheideler, C. (2018). Relays: Towards a Link Layer for Robust and Secure
Fog Computing. In Proceedings of the 2018 Workshop on Theory and Practice for
Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United
Kingdom, July 27, 2018 (pp. 1–2). https://doi.org/10.1145/3229774.3229781'
bibtex: '@inproceedings{Scheideler_2018, title={Relays: Towards a Link Layer for
Robust and Secure Fog Computing}, DOI={10.1145/3229774.3229781},
booktitle={Proceedings of the 2018 Workshop on Theory and Practice for Integrated
Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom,
July 27, 2018}, author={Scheideler, Christian}, year={2018}, pages={1–2} }'
chicago: 'Scheideler, Christian. “Relays: Towards a Link Layer for Robust and Secure
Fog Computing.” In Proceedings of the 2018 Workshop on Theory and Practice
for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham,
United Kingdom, July 27, 2018, 1–2, 2018. https://doi.org/10.1145/3229774.3229781.'
ieee: 'C. Scheideler, “Relays: Towards a Link Layer for Robust and Secure Fog Computing,”
in Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud,
Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July
27, 2018, 2018, pp. 1–2.'
mla: 'Scheideler, Christian. “Relays: Towards a Link Layer for Robust and Secure
Fog Computing.” Proceedings of the 2018 Workshop on Theory and Practice for
Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United
Kingdom, July 27, 2018, 2018, pp. 1–2, doi:10.1145/3229774.3229781.'
short: 'C. Scheideler, in: Proceedings of the 2018 Workshop on Theory and Practice
for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham,
United Kingdom, July 27, 2018, 2018, pp. 1–2.'
date_created: 2018-11-30T08:11:27Z
date_updated: 2022-01-06T07:02:49Z
ddc:
- '004'
department:
- _id: '79'
doi: 10.1145/3229774.3229781
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-12-12T15:12:02Z
date_updated: 2018-12-12T15:12:02Z
file_id: '6194'
file_name: p1-scheideler.pdf
file_size: 1420210
relation: main_file
file_date_updated: 2018-12-12T15:12:02Z
has_accepted_license: '1'
language:
- iso: eng
page: 1-2
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 2018 Workshop on Theory and Practice for Integrated
Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom,
July 27, 2018
status: public
title: 'Relays: Towards a Link Layer for Robust and Secure Fog Computing'
type: conference
user_id: '477'
year: '2018'
...
---
_id: '5986'
author:
- first_name: Robert
full_name: Gmyr, Robert
last_name: Gmyr
- first_name: Kristian
full_name: Hinnenthal, Kristian
id: '32229'
last_name: Hinnenthal
- first_name: Irina
full_name: Kostitsyna, Irina
last_name: Kostitsyna
- first_name: Fabian
full_name: Kuhn, Fabian
last_name: Kuhn
- first_name: Dorian
full_name: Rudolph, Dorian
last_name: Rudolph
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Gmyr R, Hinnenthal K, Kostitsyna I, Kuhn F, Rudolph D, Scheideler C. Shape
Recognition by a Finite Automaton Robot. In: 43rd International Symposium on
Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool,
UK. ; 2018:52:1-52:15. doi:10.4230/LIPIcs.MFCS.2018.52'
apa: Gmyr, R., Hinnenthal, K., Kostitsyna, I., Kuhn, F., Rudolph, D., & Scheideler,
C. (2018). Shape Recognition by a Finite Automaton Robot. In 43rd International
Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31,
2018, Liverpool, UK (pp. 52:1-52:15). https://doi.org/10.4230/LIPIcs.MFCS.2018.52
bibtex: '@inproceedings{Gmyr_Hinnenthal_Kostitsyna_Kuhn_Rudolph_Scheideler_2018,
title={Shape Recognition by a Finite Automaton Robot}, DOI={10.4230/LIPIcs.MFCS.2018.52},
booktitle={43rd International Symposium on Mathematical Foundations of Computer
Science, MFCS 2018, August 27-31, 2018, Liverpool, UK}, author={Gmyr, Robert and
Hinnenthal, Kristian and Kostitsyna, Irina and Kuhn, Fabian and Rudolph, Dorian
and Scheideler, Christian}, year={2018}, pages={52:1-52:15} }'
chicago: Gmyr, Robert, Kristian Hinnenthal, Irina Kostitsyna, Fabian Kuhn, Dorian
Rudolph, and Christian Scheideler. “Shape Recognition by a Finite Automaton Robot.”
In 43rd International Symposium on Mathematical Foundations of Computer Science,
MFCS 2018, August 27-31, 2018, Liverpool, UK, 52:1-52:15, 2018. https://doi.org/10.4230/LIPIcs.MFCS.2018.52.
ieee: R. Gmyr, K. Hinnenthal, I. Kostitsyna, F. Kuhn, D. Rudolph, and C. Scheideler,
“Shape Recognition by a Finite Automaton Robot,” in 43rd International Symposium
on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018,
Liverpool, UK, 2018, pp. 52:1-52:15.
mla: Gmyr, Robert, et al. “Shape Recognition by a Finite Automaton Robot.” 43rd
International Symposium on Mathematical Foundations of Computer Science, MFCS
2018, August 27-31, 2018, Liverpool, UK, 2018, pp. 52:1-52:15, doi:10.4230/LIPIcs.MFCS.2018.52.
short: 'R. Gmyr, K. Hinnenthal, I. Kostitsyna, F. Kuhn, D. Rudolph, C. Scheideler,
in: 43rd International Symposium on Mathematical Foundations of Computer Science,
MFCS 2018, August 27-31, 2018, Liverpool, UK, 2018, pp. 52:1-52:15.'
date_created: 2018-11-30T08:13:58Z
date_updated: 2022-01-06T07:02:49Z
department:
- _id: '79'
doi: 10.4230/LIPIcs.MFCS.2018.52
language:
- iso: eng
page: 52:1-52:15
publication: 43rd International Symposium on Mathematical Foundations of Computer
Science, MFCS 2018, August 27-31, 2018, Liverpool, UK
status: public
title: Shape Recognition by a Finite Automaton Robot
type: conference
user_id: '15504'
year: '2018'
...
---
_id: '6016'
author:
- first_name: Manuel
full_name: Peuster, Manuel
id: '13271'
last_name: Peuster
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Peuster M, Karl H. Understand your chains and keep your deadlines: Introducing
time-constrained profiling for NFV. In: IEEE/IFIP 14th International Conference
on Network and Service Management (CNSM). Rome: IEEE/IFIP.'
apa: 'Peuster, M., & Karl, H. (n.d.). Understand your chains and keep your deadlines:
Introducing time-constrained profiling for NFV. In IEEE/IFIP 14th International
Conference on Network and Service Management (CNSM). Rome: IEEE/IFIP.'
bibtex: '@inproceedings{Peuster_Karl, place={Rome}, title={Understand your chains
and keep your deadlines: Introducing time-constrained profiling for NFV}, booktitle={IEEE/IFIP
14th International Conference on Network and Service Management (CNSM)}, publisher={IEEE/IFIP},
author={Peuster, Manuel and Karl, Holger} }'
chicago: 'Peuster, Manuel, and Holger Karl. “Understand Your Chains and Keep Your
Deadlines: Introducing Time-Constrained Profiling for NFV.” In IEEE/IFIP 14th
International Conference on Network and Service Management (CNSM). Rome: IEEE/IFIP,
n.d.'
ieee: 'M. Peuster and H. Karl, “Understand your chains and keep your deadlines:
Introducing time-constrained profiling for NFV,” in IEEE/IFIP 14th International
Conference on Network and Service Management (CNSM), Rome.'
mla: 'Peuster, Manuel, and Holger Karl. “Understand Your Chains and Keep Your Deadlines:
Introducing Time-Constrained Profiling for NFV.” IEEE/IFIP 14th International
Conference on Network and Service Management (CNSM), IEEE/IFIP.'
short: 'M. Peuster, H. Karl, in: IEEE/IFIP 14th International Conference on Network
and Service Management (CNSM), IEEE/IFIP, Rome, n.d.'
conference:
end_date: 2018-11-09
location: Rome
name: IEEE/IFIP 14th International Conference on Network and Service Management
(CNSM)
start_date: 2018-11-05
date_created: 2018-12-06T12:06:14Z
date_updated: 2022-01-06T07:02:50Z
ddc:
- '000'
department:
- _id: '75'
file:
- access_level: open_access
content_type: application/pdf
creator: peuster
date_created: 2018-12-06T12:05:37Z
date_updated: 2018-12-06T12:05:37Z
file_id: '6017'
file_name: main_copy_for_ris.pdf
file_size: 961004
relation: main_file
file_date_updated: 2018-12-06T12:05:37Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: https://ieeexplore.ieee.org/abstract/document/8584974
oa: '1'
place: Rome
project:
- _id: '28'
grant_number: '761493'
name: 5G Development and validation platform for global industry-specific network
services and Apps
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '15'
name: SFB 901 - Subproject C3
publication: IEEE/IFIP 14th International Conference on Network and Service Management
(CNSM)
publication_status: accepted
publisher: IEEE/IFIP
status: public
title: 'Understand your chains and keep your deadlines: Introducing time-constrained
profiling for NFV'
type: conference
user_id: '13271'
year: '2018'
...
---
_id: '6236'
author:
- first_name: Enes
full_name: Yigitbas, Enes
id: '8447'
last_name: Yigitbas
orcid: 0000-0002-5967-833X
- first_name: Anthony
full_name: Anjorin, Anthony
last_name: Anjorin
- first_name: Ivan
full_name: Jovanovikj, Ivan
id: '39187'
last_name: Jovanovikj
orcid: https://orcid.org/0000-0002-1838-794X
- first_name: Thomas
full_name: Kern, Thomas
last_name: Kern
- first_name: Stefan
full_name: Sauer, Stefan
id: '447'
last_name: Sauer
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'Yigitbas E, Anjorin A, Jovanovikj I, Kern T, Sauer S, Engels G. Usability
Evaluation of Model-Driven Cross-Device Web User Interfaces. In: Proceedings
of the 7th International Working Conference on Human-Centered Software Engineering
(HCSE’18). Springer, LNCS ; 2018:231-247.'
apa: Yigitbas, E., Anjorin, A., Jovanovikj, I., Kern, T., Sauer, S., & Engels,
G. (2018). Usability Evaluation of Model-Driven Cross-Device Web User Interfaces.
In Proceedings of the 7th International Working Conference on Human-Centered
Software Engineering (HCSE’18) (pp. 231–247). Springer, LNCS .
bibtex: '@inproceedings{Yigitbas_Anjorin_Jovanovikj_Kern_Sauer_Engels_2018, title={Usability
Evaluation of Model-Driven Cross-Device Web User Interfaces}, booktitle={Proceedings
of the 7th International Working Conference on Human-Centered Software Engineering
(HCSE’18)}, publisher={Springer, LNCS }, author={Yigitbas, Enes and Anjorin, Anthony
and Jovanovikj, Ivan and Kern, Thomas and Sauer, Stefan and Engels, Gregor}, year={2018},
pages={231–247} }'
chicago: Yigitbas, Enes, Anthony Anjorin, Ivan Jovanovikj, Thomas Kern, Stefan Sauer,
and Gregor Engels. “Usability Evaluation of Model-Driven Cross-Device Web User
Interfaces.” In Proceedings of the 7th International Working Conference on
Human-Centered Software Engineering (HCSE’18), 231–47. Springer, LNCS , 2018.
ieee: E. Yigitbas, A. Anjorin, I. Jovanovikj, T. Kern, S. Sauer, and G. Engels,
“Usability Evaluation of Model-Driven Cross-Device Web User Interfaces,” in Proceedings
of the 7th International Working Conference on Human-Centered Software Engineering
(HCSE’18), 2018, pp. 231–247.
mla: Yigitbas, Enes, et al. “Usability Evaluation of Model-Driven Cross-Device Web
User Interfaces.” Proceedings of the 7th International Working Conference on
Human-Centered Software Engineering (HCSE’18), Springer, LNCS , 2018, pp.
231–47.
short: 'E. Yigitbas, A. Anjorin, I. Jovanovikj, T. Kern, S. Sauer, G. Engels, in:
Proceedings of the 7th International Working Conference on Human-Centered Software
Engineering (HCSE’18), Springer, LNCS , 2018, pp. 231–247.'
date_created: 2018-12-17T10:38:07Z
date_updated: 2022-01-06T07:02:58Z
department:
- _id: '66'
- _id: '534'
language:
- iso: eng
page: 231-247
publication: Proceedings of the 7th International Working Conference on Human-Centered
Software Engineering (HCSE'18)
publisher: 'Springer, LNCS '
status: public
title: Usability Evaluation of Model-Driven Cross-Device Web User Interfaces
type: conference
user_id: '8447'
year: '2018'
...
---
_id: '6252'
author:
- first_name: Björn
full_name: Senft, Björn
id: '9109'
last_name: Senft
- first_name: Simon
full_name: Oberthür, Simon
id: '383'
last_name: Oberthür
- first_name: Holger Gerhard
full_name: Fischer, Holger Gerhard
id: '30457'
last_name: Fischer
citation:
ama: 'Senft B, Oberthür S, Fischer HG. Forschendes Lernen in der Informatik - In
praxisnaher Projektgruppe einen Softwareentwicklungsprozess erforschen. In: Schriften
zur allgemeinen Hochschuldidaktik - Band 3. Tagungsband Forschendes Lernen - The
wider view. ; 2018.'
apa: Senft, B., Oberthür, S., & Fischer, H. G. (2018). Forschendes Lernen in
der Informatik - In praxisnaher Projektgruppe einen Softwareentwicklungsprozess
erforschen. In Schriften zur allgemeinen Hochschuldidaktik - Band 3. Tagungsband
Forschendes Lernen - The wider view.
bibtex: '@inproceedings{Senft_Oberthür_Fischer_2018, title={Forschendes Lernen in
der Informatik - In praxisnaher Projektgruppe einen Softwareentwicklungsprozess
erforschen}, booktitle={Schriften zur allgemeinen Hochschuldidaktik - Band 3.
Tagungsband Forschendes Lernen - The wider view}, author={Senft, Björn and Oberthür,
Simon and Fischer, Holger Gerhard}, year={2018} }'
chicago: Senft, Björn, Simon Oberthür, and Holger Gerhard Fischer. “Forschendes
Lernen in der Informatik - In praxisnaher Projektgruppe einen Softwareentwicklungsprozess
erforschen.” In Schriften zur allgemeinen Hochschuldidaktik - Band 3. Tagungsband
Forschendes Lernen - The wider view, 2018.
ieee: B. Senft, S. Oberthür, and H. G. Fischer, “Forschendes Lernen in der Informatik
- In praxisnaher Projektgruppe einen Softwareentwicklungsprozess erforschen,”
in Schriften zur allgemeinen Hochschuldidaktik - Band 3. Tagungsband Forschendes
Lernen - The wider view, 2018.
mla: Senft, Björn, et al. “Forschendes Lernen in der Informatik - In praxisnaher
Projektgruppe einen Softwareentwicklungsprozess erforschen.” Schriften zur
allgemeinen Hochschuldidaktik - Band 3. Tagungsband Forschendes Lernen - The wider
view, 2018.
short: 'B. Senft, S. Oberthür, H.G. Fischer, in: Schriften zur allgemeinen Hochschuldidaktik
- Band 3. Tagungsband Forschendes Lernen - The wider view, 2018.'
date_created: 2018-12-18T10:36:01Z
date_updated: 2022-01-06T07:02:58Z
department:
- _id: '66'
- _id: '534'
- _id: '221'
language:
- iso: ger
publication: Schriften zur allgemeinen Hochschuldidaktik - Band 3. Tagungsband Forschendes
Lernen - The wider view
publication_identifier:
isbn:
- 978 3-95987-088-7
status: public
title: Forschendes Lernen in der Informatik - In praxisnaher Projektgruppe einen Softwareentwicklungsprozess
erforschen
type: conference
user_id: '30457'
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: '63'
author:
- first_name: Ernst
full_name: Althaus, Ernst
last_name: Althaus
- first_name: Andre
full_name: Brinkmann, Andre
last_name: Brinkmann
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Lars
full_name: Nagel, Lars
last_name: Nagel
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
- first_name: Jiri
full_name: Sgall, Jiri
last_name: Sgall
- first_name: Tim
full_name: Suess, Tim
last_name: Suess
citation:
ama: Althaus E, Brinkmann A, Kling P, et al. Scheduling Shared Continuous Resources
on Many-Cores. Journal of Scheduling. 2018;21(1):77-92. doi:10.1007/s10951-017-0518-0
apa: Althaus, E., Brinkmann, A., Kling, P., Meyer auf der Heide, F., Nagel, L.,
Riechers, S., Sgall, J., & Suess, T. (2018). Scheduling Shared Continuous
Resources on Many-Cores. Journal of Scheduling, 21(1), 77–92. https://doi.org/10.1007/s10951-017-0518-0
bibtex: '@article{Althaus_Brinkmann_Kling_Meyer auf der Heide_Nagel_Riechers_Sgall_Suess_2018,
title={Scheduling Shared Continuous Resources on Many-Cores}, volume={21}, DOI={10.1007/s10951-017-0518-0},
number={1}, journal={Journal of Scheduling}, publisher={Springer}, author={Althaus,
Ernst and Brinkmann, Andre and Kling, Peter and Meyer auf der Heide, Friedhelm
and Nagel, Lars and Riechers, Sören and Sgall, Jiri and Suess, Tim}, year={2018},
pages={77–92} }'
chicago: 'Althaus, Ernst, Andre Brinkmann, Peter Kling, Friedhelm Meyer auf der
Heide, Lars Nagel, Sören Riechers, Jiri Sgall, and Tim Suess. “Scheduling Shared
Continuous Resources on Many-Cores.” Journal of Scheduling 21, no. 1 (2018):
77–92. https://doi.org/10.1007/s10951-017-0518-0.'
ieee: 'E. Althaus et al., “Scheduling Shared Continuous Resources on Many-Cores,”
Journal of Scheduling, vol. 21, no. 1, pp. 77–92, 2018, doi: 10.1007/s10951-017-0518-0.'
mla: Althaus, Ernst, et al. “Scheduling Shared Continuous Resources on Many-Cores.”
Journal of Scheduling, vol. 21, no. 1, Springer, 2018, pp. 77–92, doi:10.1007/s10951-017-0518-0.
short: E. Althaus, A. Brinkmann, P. Kling, F. Meyer auf der Heide, L. Nagel, S.
Riechers, J. Sgall, T. Suess, Journal of Scheduling 21 (2018) 77–92.
date_created: 2017-10-17T12:41:03Z
date_updated: 2022-01-06T07:03:00Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/s10951-017-0518-0
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T13:16:59Z
date_updated: 2018-03-21T13:16:59Z
file_id: '1577'
file_name: 63-main_05.pdf
file_size: 466808
relation: main_file
success: 1
file_date_updated: 2018-03-21T13:16:59Z
has_accepted_license: '1'
intvolume: ' 21'
issue: '1'
language:
- iso: eng
page: 77-92
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '4'
name: SFB 901 - Project Area C
publication: Journal of Scheduling
publisher: Springer
status: public
title: Scheduling Shared Continuous Resources on Many-Cores
type: journal_article
user_id: '15415'
volume: 21
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: '4411'
abstract:
- lang: eng
text: "While a lot of research in distributed computing has covered solutions for
self-stabilizing computing and topologies, there is far less work on self-stabilization
for distributed data structures.\r\nConsidering crashing peers in peer-to-peer
networks, it should not be taken for granted that a distributed data structure
remains intact.\r\nIn this work, we present a self-stabilizing protocol for a
distributed data structure called the hashed Patricia Trie (Kniesburges and Scheideler
WALCOM'11) that enables efficient prefix search on a set of keys.\r\nThe data
structure has a wide area of applications including string matching problems while
offering low overhead and efficient operations when embedded on top of a distributed
hash table.\r\nEspecially, longest prefix matching for $x$ can be done in $\\mathcal{O}(\\log
|x|)$ hash table read accesses.\r\nWe show how to maintain the structure in a
self-stabilizing way.\r\nOur protocol assures low overhead in a legal state and
a total (asymptotically optimal) memory demand of $\\Theta(d)$ bits, where $d$
is the number of bits needed for storing all keys."
author:
- first_name: Till
full_name: Knollmann, Till
id: '39241'
last_name: Knollmann
orcid: 0000-0003-2014-4696
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Knollmann T, Scheideler C. A Self-Stabilizing Hashed Patricia Trie. In: Izumi
T, Kuznetsov P, eds. Proceedings of the 20th International Symposium on Stabilization,
Safety, and Security of Distributed Systems (SSS). Vol 11201. Lecture Notes
of Computer Science. Springer, Cham; 2018. doi:10.1007/978-3-030-03232-6_1'
apa: 'Knollmann, T., & Scheideler, C. (2018). A Self-Stabilizing Hashed Patricia
Trie. In T. Izumi & P. Kuznetsov (Eds.), Proceedings of the 20th International
Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)
(Vol. 11201). Tokyo: Springer, Cham. https://doi.org/10.1007/978-3-030-03232-6_1'
bibtex: '@inproceedings{Knollmann_Scheideler_2018, series={Lecture Notes of Computer
Science}, title={A Self-Stabilizing Hashed Patricia Trie}, volume={11201}, DOI={10.1007/978-3-030-03232-6_1},
booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)}, publisher={Springer, Cham}, author={Knollmann,
Till and Scheideler, Christian}, editor={Izumi, Taisuke and Kuznetsov, PetrEditors},
year={2018}, collection={Lecture Notes of Computer Science} }'
chicago: Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia
Trie.” In Proceedings of the 20th International Symposium on Stabilization,
Safety, and Security of Distributed Systems (SSS), edited by Taisuke Izumi
and Petr Kuznetsov, Vol. 11201. Lecture Notes of Computer Science. Springer, Cham,
2018. https://doi.org/10.1007/978-3-030-03232-6_1.
ieee: T. Knollmann and C. Scheideler, “A Self-Stabilizing Hashed Patricia Trie,”
in Proceedings of the 20th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS), Tokyo, 2018, vol. 11201.
mla: Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia
Trie.” Proceedings of the 20th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS), edited by Taisuke Izumi and Petr
Kuznetsov, vol. 11201, Springer, Cham, 2018, doi:10.1007/978-3-030-03232-6_1.
short: 'T. Knollmann, C. Scheideler, in: T. Izumi, P. Kuznetsov (Eds.), Proceedings
of the 20th International Symposium on Stabilization, Safety, and Security of
Distributed Systems (SSS), Springer, Cham, 2018.'
conference:
end_date: 2018-11-07
location: Tokyo
name: 20th International Symposium on Stabilization, Safety, and Security of Distributed
Systems (SSS)
start_date: 2018-11-04
date_created: 2018-09-17T13:12:18Z
date_updated: 2022-01-06T07:01:02Z
ddc:
- '000'
department:
- _id: '63'
- _id: '79'
doi: 10.1007/978-3-030-03232-6_1
editor:
- first_name: Taisuke
full_name: Izumi, Taisuke
last_name: Izumi
- first_name: Petr
full_name: Kuznetsov, Petr
last_name: Kuznetsov
external_id:
arxiv:
- '1809.04923'
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:38:37Z
date_updated: 2018-11-02T14:38:37Z
file_id: '5277'
file_name: ASelf-stabilizingHashedPatrici.pdf
file_size: 500005
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:38:37Z
has_accepted_license: '1'
intvolume: ' 11201'
keyword:
- Self-Stabilizing
- Prefix Search
- Distributed Data Structure
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Proceedings of the 20th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)
publisher: Springer, Cham
series_title: Lecture Notes of Computer Science
status: public
title: A Self-Stabilizing Hashed Patricia Trie
type: conference
user_id: '39241'
volume: 11201
year: '2018'
...
---
_id: '4563'
abstract:
- lang: eng
text: "Routing is a challenging problem for wireless ad hoc networks, especially
when the nodes are mobile and spread so widely that in most cases multiple hops
are needed to route a message from one node to another. In fact, it is known that
any online routing protocol has a poor performance in the worst case, in a sense
that there is a distribution of nodes resulting in bad routing paths for that
protocol, even if the nodes know their geographic positions and the geographic
position of the destination of a message is known. The reason for that is that
radio holes in the ad hoc network may require messages to take long detours in
order to get to a destination, which are hard to find in an online fashion.\r\n\r\nIn
this paper, we assume that the wireless ad hoc network can make limited use of
long-range links provided by a global communication infrastructure like a cellular
infrastructure or a satellite in order to compute an abstraction of the wireless
ad hoc network that allows the messages to be sent along near-shortest paths in
the ad hoc network. We present distributed algorithms that compute an abstraction
of the ad hoc network in $\\mathcal{O}\\left(\\log ^2 n\\right)$ time using long-range
links, which results in $c$-competitive routing paths between any two nodes of
the ad hoc network for some constant $c$ if the convex hulls of the radio holes
do not intersect. We also show that the storage needed for the abstraction just
depends on the number and size of the radio holes in the wireless ad hoc network
and is independent on the total number of nodes, and this information just has
to be known to a few nodes for the routing to work.\r\n"
author:
- first_name: Daniel
full_name: Jung, Daniel
id: '37827'
last_name: Jung
- 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: Jannik
full_name: Sundermeier, Jannik
id: '38705'
last_name: Sundermeier
citation:
ama: 'Jung D, Kolb C, Scheideler C, Sundermeier J. Competitive Routing in Hybrid
Communication Networks. In: Proceedings of the 14th International Symposium
on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) . Springer;
2018.'
apa: 'Jung, D., Kolb, C., Scheideler, C., & Sundermeier, J. (2018). Competitive
Routing in Hybrid Communication Networks. In Proceedings of the 14th International
Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) .
Helsinki: Springer.'
bibtex: '@inproceedings{Jung_Kolb_Scheideler_Sundermeier_2018, title={Competitive
Routing in Hybrid Communication Networks}, booktitle={Proceedings of the 14th
International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS)
}, publisher={Springer}, author={Jung, Daniel and Kolb, Christina and Scheideler,
Christian and Sundermeier, Jannik}, year={2018} }'
chicago: Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier.
“Competitive Routing in Hybrid Communication Networks.” In Proceedings of the
14th International Symposium on Algorithms and Experiments for Wireless Networks
(ALGOSENSORS) . Springer, 2018.
ieee: D. Jung, C. Kolb, C. Scheideler, and J. Sundermeier, “Competitive Routing
in Hybrid Communication Networks,” in Proceedings of the 14th International
Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) ,
Helsinki, 2018.
mla: Jung, Daniel, et al. “Competitive Routing in Hybrid Communication Networks.”
Proceedings of the 14th International Symposium on Algorithms and Experiments
for Wireless Networks (ALGOSENSORS) , Springer, 2018.
short: 'D. Jung, C. Kolb, C. Scheideler, J. Sundermeier, in: Proceedings of the
14th International Symposium on Algorithms and Experiments for Wireless Networks
(ALGOSENSORS) , Springer, 2018.'
conference:
end_date: 2018-08-24
location: Helsinki
name: '14th International Symposium on Algorithms and Experiments for Wireless Networks
(ALGOSENSORS) '
start_date: 2018-08-23
date_created: 2018-10-02T07:06:05Z
date_updated: 2022-01-06T07:01:11Z
ddc:
- '000'
department:
- _id: '63'
- _id: '79'
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2019-01-11T10:32:38Z
date_updated: 2019-01-11T10:32:38Z
file_id: '6621'
file_name: 23hybrid.pdf
file_size: 349034
relation: main_file
success: 1
file_date_updated: 2019-01-11T10:32:38Z
has_accepted_license: '1'
keyword:
- greedy routing
- ad hoc networks
- convex hulls
- c-competitiveness
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: 'Proceedings of the 14th International Symposium on Algorithms and Experiments
for Wireless Networks (ALGOSENSORS) '
publisher: Springer
status: public
title: Competitive Routing in Hybrid Communication Networks
type: conference
user_id: '38705'
year: '2018'
...
---
_id: '4565'
author:
- first_name: Daniel
full_name: Jung, Daniel
id: '37827'
last_name: Jung
- 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: Jannik
full_name: Sundermeier, Jannik
id: '38705'
last_name: Sundermeier
citation:
ama: 'Jung D, Kolb C, Scheideler C, Sundermeier J. Brief Announcement: Competitive
Routing in Hybrid Communication Networks. In: Proceedings of the 30th on Symposium
on Parallelism in Algorithms and Architectures (SPAA). ACM Press; 2018. doi:10.1145/3210377.3210663'
apa: 'Jung, D., Kolb, C., Scheideler, C., & Sundermeier, J. (2018). Brief Announcement:
Competitive Routing in Hybrid Communication Networks. In Proceedings of the
30th on Symposium on Parallelism in Algorithms and Architectures (SPAA). Wien:
ACM Press. https://doi.org/10.1145/3210377.3210663'
bibtex: '@inproceedings{Jung_Kolb_Scheideler_Sundermeier_2018, title={Brief Announcement:
Competitive Routing in Hybrid Communication Networks}, DOI={10.1145/3210377.3210663},
booktitle={Proceedings of the 30th on Symposium on Parallelism in Algorithms and
Architectures (SPAA)}, publisher={ACM Press}, author={Jung, Daniel and Kolb, Christina
and Scheideler, Christian and Sundermeier, Jannik}, year={2018} }'
chicago: 'Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier.
“Brief Announcement: Competitive Routing in Hybrid Communication Networks.” In
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures
(SPAA). ACM Press, 2018. https://doi.org/10.1145/3210377.3210663.'
ieee: 'D. Jung, C. Kolb, C. Scheideler, and J. Sundermeier, “Brief Announcement:
Competitive Routing in Hybrid Communication Networks,” in Proceedings of the
30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), Wien,
2018.'
mla: 'Jung, Daniel, et al. “Brief Announcement: Competitive Routing in Hybrid Communication
Networks.” Proceedings of the 30th on Symposium on Parallelism in Algorithms
and Architectures (SPAA), ACM Press, 2018, doi:10.1145/3210377.3210663.'
short: 'D. Jung, C. Kolb, C. Scheideler, J. Sundermeier, in: Proceedings of the
30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM Press,
2018.'
conference:
end_date: 2018-07-18
location: Wien
name: SPAA'18
start_date: 2018-07-17
date_created: 2018-10-02T07:34:47Z
date_updated: 2022-01-06T07:01:12Z
ddc:
- '000'
department:
- _id: '63'
- _id: '79'
doi: 10.1145/3210377.3210663
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T13:48:10Z
date_updated: 2018-11-02T13:48:10Z
file_id: '5254'
file_name: p231-jung-1.pdf
file_size: 1025077
relation: main_file
success: 1
file_date_updated: 2018-11-02T13:48:10Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Proceedings of the 30th on Symposium on Parallelism in Algorithms and
Architectures (SPAA)
publication_identifier:
isbn:
- '9781450357999'
publication_status: published
publisher: ACM Press
status: public
title: 'Brief Announcement: Competitive Routing in Hybrid Communication Networks'
type: conference
user_id: '38705'
year: '2018'
...
---
_id: '7570'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Johannes Sebastian
full_name: Schaefer, Johannes Sebastian
id: '30291'
last_name: Schaefer
citation:
ama: 'Meyer auf der Heide F, Schaefer JS. Brief Announcement: Communication in Systems
of Home Based Mobile Agents. In: Proceedings of the 30th on Symposium on Parallelism
in Algorithms and Architectures - SPAA ’18. ACM Press; 2018. doi:10.1145/3210377.3210662'
apa: 'Meyer auf der Heide, F., & Schaefer, J. S. (2018). Brief Announcement:
Communication in Systems of Home Based Mobile Agents. In Proceedings of the
30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18.
Vienna: ACM Press. https://doi.org/10.1145/3210377.3210662'
bibtex: '@inproceedings{Meyer auf der Heide_Schaefer_2018, title={Brief Announcement:
Communication in Systems of Home Based Mobile Agents}, DOI={10.1145/3210377.3210662},
booktitle={Proceedings of the 30th on Symposium on Parallelism in Algorithms and
Architectures - SPAA ’18}, publisher={ACM Press}, author={Meyer auf der Heide,
Friedhelm and Schaefer, Johannes Sebastian}, year={2018} }'
chicago: 'Meyer auf der Heide, Friedhelm, and Johannes Sebastian Schaefer. “Brief
Announcement: Communication in Systems of Home Based Mobile Agents.” In Proceedings
of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA
’18. ACM Press, 2018. https://doi.org/10.1145/3210377.3210662.'
ieee: 'F. Meyer auf der Heide and J. S. Schaefer, “Brief Announcement: Communication
in Systems of Home Based Mobile Agents,” in Proceedings of the 30th on Symposium
on Parallelism in Algorithms and Architectures - SPAA ’18, Vienna, 2018.'
mla: 'Meyer auf der Heide, Friedhelm, and Johannes Sebastian Schaefer. “Brief Announcement:
Communication in Systems of Home Based Mobile Agents.” Proceedings of the 30th
on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, ACM
Press, 2018, doi:10.1145/3210377.3210662.'
short: 'F. Meyer auf der Heide, J.S. Schaefer, in: Proceedings of the 30th on Symposium
on Parallelism in Algorithms and Architectures - SPAA ’18, ACM Press, 2018.'
conference:
end_date: 2018-07-18
location: Vienna
name: 30th Symposium on Parallelism in Algorithms and Architectures
start_date: 2018-07-16
date_created: 2019-02-06T14:16:19Z
date_updated: 2022-01-06T07:03:40Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1145/3210377.3210662
file:
- access_level: closed
content_type: application/pdf
creator: jschaef
date_created: 2019-02-06T14:18:35Z
date_updated: 2019-02-06T14:18:35Z
file_id: '7576'
file_name: p359-meyer-auf-der-heide.pdf
file_size: 1504739
relation: main_file
file_date_updated: 2019-02-06T14:18:35Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 30th on Symposium on Parallelism in Algorithms and
Architectures - SPAA '18
publication_identifier:
isbn:
- '9781450357999'
publication_status: published
publisher: ACM Press
status: public
title: 'Brief Announcement: Communication in Systems of Home Based Mobile Agents'
type: conference
user_id: '30291'
year: '2018'
...
---
_id: '8844'
author:
- first_name: Ivan
full_name: Jovanovikj, Ivan
id: '39187'
last_name: Jovanovikj
orcid: https://orcid.org/0000-0002-1838-794X
- first_name: Baris
full_name: Güldali, Baris
last_name: Güldali
citation:
ama: 'Jovanovikj I, Güldali B. Presentation: Who Guards the Guards? On the Validation
of Test Case Migration. User Conference on Advanced Automated Testing (UCAAT
2018), Paris; 2018.'
apa: 'Jovanovikj, I., & Güldali, B. (2018). Presentation: Who Guards the
Guards? On the Validation of Test Case Migration. User Conference on Advanced
Automated Testing (UCAAT 2018), Paris.'
bibtex: '@book{Jovanovikj_Güldali_2018, place={User Conference on Advanced Automated
Testing (UCAAT 2018), Paris}, title={Presentation: Who Guards the Guards? On the
Validation of Test Case Migration}, author={Jovanovikj, Ivan and Güldali, Baris},
year={2018} }'
chicago: 'Jovanovikj, Ivan, and Baris Güldali. Presentation: Who Guards the Guards?
On the Validation of Test Case Migration. User Conference on Advanced Automated
Testing (UCAAT 2018), Paris, 2018.'
ieee: 'I. Jovanovikj and B. Güldali, Presentation: Who Guards the Guards? On
the Validation of Test Case Migration. User Conference on Advanced Automated
Testing (UCAAT 2018), Paris, 2018.'
mla: 'Jovanovikj, Ivan, and Baris Güldali. Presentation: Who Guards the Guards?
On the Validation of Test Case Migration. 2018.'
short: 'I. Jovanovikj, B. Güldali, Presentation: Who Guards the Guards? On the Validation
of Test Case Migration, User Conference on Advanced Automated Testing (UCAAT 2018),
Paris, 2018.'
date_created: 2019-04-08T07:46:36Z
date_updated: 2022-01-06T07:04:03Z
department:
- _id: '66'
language:
- iso: eng
place: User Conference on Advanced Automated Testing (UCAAT 2018), Paris
status: public
title: 'Presentation: Who Guards the Guards? On the Validation of Test Case Migration'
type: misc
user_id: '39187'
year: '2018'
...
---
_id: '9606'
author:
- first_name: Jia
full_name: Liu, Jia
last_name: Liu
- first_name: Tibor
full_name: Jager, Tibor
id: '64669'
last_name: Jager
- first_name: Saqib
full_name: Kakvi, Saqib
id: '66268'
last_name: Kakvi
- first_name: Bogdan
full_name: Warinschi, Bogdan
last_name: Warinschi
citation:
ama: Liu J, Jager T, Kakvi S, Warinschi B. How to build time-lock encryption. Designs,
Codes and Cryptography. 2018:2549-2586. doi:10.1007/s10623-018-0461-x
apa: Liu, J., Jager, T., Kakvi, S., & Warinschi, B. (2018). How to build time-lock
encryption. Designs, Codes and Cryptography, 2549–2586. https://doi.org/10.1007/s10623-018-0461-x
bibtex: '@article{Liu_Jager_Kakvi_Warinschi_2018, title={How to build time-lock
encryption}, DOI={10.1007/s10623-018-0461-x},
journal={Designs, Codes and Cryptography}, author={Liu, Jia and Jager, Tibor and
Kakvi, Saqib and Warinschi, Bogdan}, year={2018}, pages={2549–2586} }'
chicago: Liu, Jia, Tibor Jager, Saqib Kakvi, and Bogdan Warinschi. “How to Build
Time-Lock Encryption.” Designs, Codes and Cryptography, 2018, 2549–86.
https://doi.org/10.1007/s10623-018-0461-x.
ieee: J. Liu, T. Jager, S. Kakvi, and B. Warinschi, “How to build time-lock encryption,”
Designs, Codes and Cryptography, pp. 2549–2586, 2018.
mla: Liu, Jia, et al. “How to Build Time-Lock Encryption.” Designs, Codes and
Cryptography, 2018, pp. 2549–86, doi:10.1007/s10623-018-0461-x.
short: J. Liu, T. Jager, S. Kakvi, B. Warinschi, Designs, Codes and Cryptography
(2018) 2549–2586.
date_created: 2019-05-03T12:42:01Z
date_updated: 2022-01-06T07:04:16Z
department:
- _id: '558'
doi: 10.1007/s10623-018-0461-x
language:
- iso: eng
page: 2549-2586
publication: Designs, Codes and Cryptography
publication_identifier:
issn:
- 0925-1022
- 1573-7586
publication_status: published
status: public
title: How to build time-lock encryption
type: journal_article
user_id: '66268'
year: '2018'
...
---
_id: '4236'
author:
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
- first_name: Manfred
full_name: Stede, Manfred
last_name: Stede
- first_name: Roxanne
full_name: El Baff, Roxanne
last_name: El Baff
- first_name: Khalid
full_name: Al Khatib, Khalid
last_name: Al Khatib
- first_name: Maria
full_name: Skeppstedt, Maria
last_name: Skeppstedt
- first_name: Benno
full_name: Stein, Benno
last_name: Stein
citation:
ama: 'Wachsmuth H, Stede M, El Baff R, Al Khatib K, Skeppstedt M, Stein B. Argumentation
Synthesis following Rhetorical Strategies. In: Proceedings of the 27th International
Conference on Computational Linguistics. ; 2018:3753-3765.'
apa: Wachsmuth, H., Stede, M., El Baff, R., Al Khatib, K., Skeppstedt, M., &
Stein, B. (2018). Argumentation Synthesis following Rhetorical Strategies. In
Proceedings of the 27th International Conference on Computational Linguistics
(pp. 3753–3765).
bibtex: '@inproceedings{Wachsmuth_Stede_El Baff_Al Khatib_Skeppstedt_Stein_2018,
title={Argumentation Synthesis following Rhetorical Strategies}, booktitle={Proceedings
of the 27th International Conference on Computational Linguistics}, author={Wachsmuth,
Henning and Stede, Manfred and El Baff, Roxanne and Al Khatib, Khalid and Skeppstedt,
Maria and Stein, Benno}, year={2018}, pages={3753–3765} }'
chicago: Wachsmuth, Henning, Manfred Stede, Roxanne El Baff, Khalid Al Khatib, Maria
Skeppstedt, and Benno Stein. “Argumentation Synthesis Following Rhetorical Strategies.”
In Proceedings of the 27th International Conference on Computational Linguistics,
3753–65, 2018.
ieee: H. Wachsmuth, M. Stede, R. El Baff, K. Al Khatib, M. Skeppstedt, and B. Stein,
“Argumentation Synthesis following Rhetorical Strategies,” in Proceedings of
the 27th International Conference on Computational Linguistics, 2018, pp.
3753–3765.
mla: Wachsmuth, Henning, et al. “Argumentation Synthesis Following Rhetorical Strategies.”
Proceedings of the 27th International Conference on Computational Linguistics,
2018, pp. 3753–65.
short: 'H. Wachsmuth, M. Stede, R. El Baff, K. Al Khatib, M. Skeppstedt, B. Stein,
in: Proceedings of the 27th International Conference on Computational Linguistics,
2018, pp. 3753–3765.'
conference:
name: ACL 18
date_created: 2018-08-29T07:48:35Z
date_updated: 2022-01-06T07:00:40Z
department:
- _id: '600'
- _id: '568'
keyword:
- argument
language:
- iso: eng
main_file_link:
- url: 'http://aclweb.org/anthology/C18-1318 '
page: 3753-3765
publication: Proceedings of the 27th International Conference on Computational Linguistics
related_material:
link:
- relation: other
url: http://argumentation.bplaced.net/arguana-publications/posters/wachsmuth18b-coling.pdf
- relation: research_paper
url: http://argumentation.bplaced.net/arguana-publications/papers/wachsmuth18b-coling.pdf
status: public
title: Argumentation Synthesis following Rhetorical Strategies
type: conference
user_id: '3900'
year: '2018'
...
---
_id: '4344'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Sascha
full_name: Brauer, Sascha
id: '13291'
last_name: Brauer
- first_name: Kathrin
full_name: Bujna, Kathrin
last_name: Bujna
citation:
ama: 'Blömer J, Brauer S, Bujna K. Coresets for Fuzzy K-Means with Applications.
In: 29th International Symposium on Algorithms and Computation (ISAAC 2018).
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik; 2018:46:1--46:12. doi:10.4230/LIPIcs.ISAAC.2018.46'
apa: 'Blömer, J., Brauer, S., & Bujna, K. (2018). Coresets for Fuzzy K-Means
with Applications. In 29th International Symposium on Algorithms and Computation
(ISAAC 2018) (pp. 46:1--46:12). Jiaoxi, Yilan County, Taiwan: Schloss Dagstuhl--Leibniz-Zentrum
fuer Informatik. https://doi.org/10.4230/LIPIcs.ISAAC.2018.46'
bibtex: '@inproceedings{Blömer_Brauer_Bujna_2018, title={Coresets for Fuzzy K-Means
with Applications}, DOI={10.4230/LIPIcs.ISAAC.2018.46},
booktitle={29th International Symposium on Algorithms and Computation (ISAAC
2018)}, publisher={Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, author={Blömer,
Johannes and Brauer, Sascha and Bujna, Kathrin}, year={2018}, pages={46:1--46:12}
}'
chicago: Blömer, Johannes, Sascha Brauer, and Kathrin Bujna. “Coresets for Fuzzy
K-Means with Applications.” In 29th International Symposium on Algorithms and
Computation (ISAAC 2018), 46:1--46:12. Schloss Dagstuhl--Leibniz-Zentrum
fuer Informatik, 2018. https://doi.org/10.4230/LIPIcs.ISAAC.2018.46.
ieee: J. Blömer, S. Brauer, and K. Bujna, “Coresets for Fuzzy K-Means with Applications,”
in 29th International Symposium on Algorithms and Computation (ISAAC 2018),
Jiaoxi, Yilan County, Taiwan, 2018, pp. 46:1--46:12.
mla: Blömer, Johannes, et al. “Coresets for Fuzzy K-Means with Applications.” 29th
International Symposium on Algorithms and Computation (ISAAC 2018), Schloss
Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018, pp. 46:1--46:12, doi:10.4230/LIPIcs.ISAAC.2018.46.
short: 'J. Blömer, S. Brauer, K. Bujna, in: 29th International Symposium on Algorithms
and Computation (ISAAC 2018), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik,
2018, pp. 46:1--46:12.'
conference:
end_date: 2018-12-19
location: Jiaoxi, Yilan County, Taiwan
name: 29th International Symposium on Algorithms and Computation (ISAAC)
start_date: 2018-12-17
date_created: 2018-09-03T08:04:19Z
date_updated: 2022-01-06T07:00:57Z
department:
- _id: '64'
doi: 10.4230/LIPIcs.ISAAC.2018.46
language:
- iso: eng
page: 46:1--46:12
project:
- _id: '45'
name: Soft-Clustering - Von Heuristiken zu Approximationsalgorithmen
publication: 29th International Symposium on Algorithms and Computation (ISAAC 2018)
publication_identifier:
isbn:
- 978-3-95977-094-1
publication_status: published
publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
status: public
title: Coresets for Fuzzy K-Means with Applications
type: conference
user_id: '13291'
year: '2018'
...