--- _id: '54537' author: - first_name: Maike full_name: Bauer, Maike id: '29647' last_name: Bauer - first_name: Peter full_name: Hohwiller, Peter id: '62925' last_name: Hohwiller orcid: 0000-0002-1182-6364 citation: ama: Bauer M, Hohwiller P. iMustHave. Anhand von Werbevideos den Kult um den digital global player Apple untersuchen. Der fremdsprachliche Unterricht Englisch. 2022:30-33. apa: Bauer, M., & Hohwiller, P. (2022). iMustHave. Anhand von Werbevideos den Kult um den digital global player Apple untersuchen. Der fremdsprachliche Unterricht Englisch, 178, 30–33. bibtex: '@article{Bauer_Hohwiller_2022, title={iMustHave. Anhand von Werbevideos den Kult um den digital global player Apple untersuchen}, volume={178}, journal={Der fremdsprachliche Unterricht Englisch}, author={Bauer, Maike and Hohwiller, Peter}, year={2022}, pages={30–33} }' chicago: Bauer, Maike, and Peter Hohwiller. “iMustHave. Anhand von Werbevideos den Kult um den digital global player Apple untersuchen.” Der fremdsprachliche Unterricht Englisch, 2022. ieee: M. Bauer and P. Hohwiller, “iMustHave. Anhand von Werbevideos den Kult um den digital global player Apple untersuchen,” Der fremdsprachliche Unterricht Englisch, vol. 178, pp. 30–33, 2022. mla: Bauer, Maike, and Peter Hohwiller. “iMustHave. Anhand von Werbevideos den Kult um den digital global player Apple untersuchen.” Der fremdsprachliche Unterricht Englisch, vol. 178, 2022, pp. 30–33. short: M. Bauer, P. Hohwiller, Der fremdsprachliche Unterricht Englisch 178 (2022) 30–33. date_created: 2024-05-31T13:19:35Z date_updated: 2024-05-31T13:23:15Z intvolume: ' 178' language: - iso: ger page: 30-33 publication: Der fremdsprachliche Unterricht Englisch publication_date: '2022' status: public title: iMustHave. Anhand von Werbevideos den Kult um den digital global player Apple untersuchen type: newspaper_article user_id: '29647' volume: 178 year: '2022' ... --- _id: '54534' author: - first_name: Maike full_name: Bauer, Maike id: '29647' last_name: Bauer - first_name: Leigh full_name: Menschig, Leigh last_name: Menschig citation: ama: Bauer M, Menschig L. Should I Stay or Should I Go? Discussing the Advantages and Disadvantages of Taking a Gap Year. Englisch Betrifft Uns. 2022:1-5. apa: Bauer, M., & Menschig, L. (2022). Should I Stay or Should I Go? Discussing the Advantages and Disadvantages of Taking a Gap Year. Englisch Betrifft Uns, 6, 1–5. bibtex: '@article{Bauer_Menschig_2022, title={Should I Stay or Should I Go? Discussing the Advantages and Disadvantages of Taking a Gap Year}, volume={6}, journal={Englisch Betrifft Uns}, author={Bauer, Maike and Menschig, Leigh}, year={2022}, pages={1–5} }' chicago: Bauer, Maike, and Leigh Menschig. “Should I Stay or Should I Go? Discussing the Advantages and Disadvantages of Taking a Gap Year.” Englisch Betrifft Uns, 2022. ieee: M. Bauer and L. Menschig, “Should I Stay or Should I Go? Discussing the Advantages and Disadvantages of Taking a Gap Year,” Englisch Betrifft Uns, vol. 6, pp. 1–5, 2022. mla: Bauer, Maike, and Leigh Menschig. “Should I Stay or Should I Go? Discussing the Advantages and Disadvantages of Taking a Gap Year.” Englisch Betrifft Uns, vol. 6, 2022, pp. 1–5. short: M. Bauer, L. Menschig, Englisch Betrifft Uns 6 (2022) 1–5. date_created: 2024-05-31T13:16:00Z date_updated: 2024-05-31T13:23:20Z intvolume: ' 6' language: - iso: eng page: 1-5 publication: Englisch Betrifft Uns publication_date: '2022' status: public title: Should I Stay or Should I Go? Discussing the Advantages and Disadvantages of Taking a Gap Year type: newspaper_article user_id: '29647' volume: 6 year: '2022' ... --- _id: '54535' author: - first_name: Maike full_name: Bauer, Maike id: '29647' last_name: Bauer - first_name: Leigh full_name: Menschig, Leigh last_name: Menschig citation: ama: 'Bauer M, Menschig L. Virtual Employees in India: Off-site Employment for Large Corporations. Two oral exams. Englisch Betrifft Uns. 2022:22-25.' apa: 'Bauer, M., & Menschig, L. (2022). Virtual Employees in India: Off-site Employment for Large Corporations. Two oral exams. Englisch Betrifft Uns, 5, 22–25.' bibtex: '@article{Bauer_Menschig_2022, title={Virtual Employees in India: Off-site Employment for Large Corporations. Two oral exams}, volume={5}, journal={Englisch Betrifft Uns}, author={Bauer, Maike and Menschig, Leigh}, year={2022}, pages={22–25} }' chicago: 'Bauer, Maike, and Leigh Menschig. “Virtual Employees in India: Off-Site Employment for Large Corporations. Two Oral Exams.” Englisch Betrifft Uns, 2022.' ieee: 'M. Bauer and L. Menschig, “Virtual Employees in India: Off-site Employment for Large Corporations. Two oral exams,” Englisch Betrifft Uns, vol. 5, pp. 22–25, 2022.' mla: 'Bauer, Maike, and Leigh Menschig. “Virtual Employees in India: Off-Site Employment for Large Corporations. Two Oral Exams.” Englisch Betrifft Uns, vol. 5, 2022, pp. 22–25.' short: M. Bauer, L. Menschig, Englisch Betrifft Uns 5 (2022) 22–25. date_created: 2024-05-31T13:17:11Z date_updated: 2024-05-31T13:23:24Z intvolume: ' 5' language: - iso: eng page: 22-25 publication: Englisch Betrifft Uns publication_date: '2022' status: public title: 'Virtual Employees in India: Off-site Employment for Large Corporations. Two oral exams' type: newspaper_article user_id: '29647' volume: 5 year: '2022' ... --- _id: '54536' author: - first_name: Maike full_name: Bauer, Maike id: '29647' last_name: Bauer - first_name: Leigh full_name: Menschig, Leigh last_name: Menschig citation: ama: 'Bauer M, Menschig L. Modern Slavery vs. Fairtrade: Raising Awareness of the Working Conditions in India. Englisch Betrifft Uns. 2022:17-21.' apa: 'Bauer, M., & Menschig, L. (2022). Modern Slavery vs. Fairtrade: Raising Awareness of the Working Conditions in India. Englisch Betrifft Uns, 5, 17–21.' bibtex: '@article{Bauer_Menschig_2022, title={Modern Slavery vs. Fairtrade: Raising Awareness of the Working Conditions in India}, volume={5}, journal={Englisch Betrifft Uns}, author={Bauer, Maike and Menschig, Leigh}, year={2022}, pages={17–21} }' chicago: 'Bauer, Maike, and Leigh Menschig. “Modern Slavery vs. Fairtrade: Raising Awareness of the Working Conditions in India.” Englisch Betrifft Uns, 2022.' ieee: 'M. Bauer and L. Menschig, “Modern Slavery vs. Fairtrade: Raising Awareness of the Working Conditions in India,” Englisch Betrifft Uns, vol. 5, pp. 17–21, 2022.' mla: 'Bauer, Maike, and Leigh Menschig. “Modern Slavery vs. Fairtrade: Raising Awareness of the Working Conditions in India.” Englisch Betrifft Uns, vol. 5, 2022, pp. 17–21.' short: M. Bauer, L. Menschig, Englisch Betrifft Uns 5 (2022) 17–21. date_created: 2024-05-31T13:18:17Z date_updated: 2024-05-31T13:23:17Z intvolume: ' 5' language: - iso: eng page: 17-21 publication: Englisch Betrifft Uns publication_date: '2022' status: public title: 'Modern Slavery vs. Fairtrade: Raising Awareness of the Working Conditions in India' type: newspaper_article user_id: '29647' volume: 5 year: '2022' ... --- _id: '54541' author: - first_name: Maike full_name: Bauer, Maike id: '29647' last_name: Bauer citation: ama: 'Bauer M. Diaspora Short Stories – A Meaningful Aspect in Young Adult Literature? . In: ; 2022.' apa: Bauer, M. (2022). Diaspora Short Stories – A Meaningful Aspect in Young Adult Literature? . Reading Young Adult Literature in the EFL Classroom and Beyond, Münster. bibtex: '@inproceedings{Bauer_2022, title={Diaspora Short Stories – A Meaningful Aspect in Young Adult Literature? }, author={Bauer, Maike}, year={2022} }' chicago: Bauer, Maike. “Diaspora Short Stories – A Meaningful Aspect in Young Adult Literature? ,” 2022. ieee: M. Bauer, “Diaspora Short Stories – A Meaningful Aspect in Young Adult Literature? ,” presented at the Reading Young Adult Literature in the EFL Classroom and Beyond, Münster, 2022. mla: Bauer, Maike. Diaspora Short Stories – A Meaningful Aspect in Young Adult Literature? . 2022. short: 'M. Bauer, in: 2022.' conference: end_date: 2022-05-20 location: Münster name: Reading Young Adult Literature in the EFL Classroom and Beyond start_date: 2022-05-20 date_created: 2024-05-31T13:30:04Z date_updated: 2024-05-31T13:33:58Z language: - iso: eng status: public title: 'Diaspora Short Stories – A Meaningful Aspect in Young Adult Literature? ' type: conference user_id: '29647' year: '2022' ... --- _id: '52924' author: - first_name: Satyadharma full_name: Tirtarasa, Satyadharma last_name: Tirtarasa - first_name: Anni-Yasmin full_name: Turhan, Anni-Yasmin id: '104470' last_name: Turhan citation: ama: 'Tirtarasa S, Turhan A-Y. Computing generalizations of temporal ϵL concepts with next and global. In: Hong J, Bures M, Park JW, Cerný T, eds. SAC ’22: The 37th {ACM/SIGAPP} Symposium on Applied Computing, Virtual Event, April 25 - 29, 2022. ACM; 2022:903–910. doi:10.1145/3477314.3507136' apa: 'Tirtarasa, S., & Turhan, A.-Y. (2022). Computing generalizations of temporal ϵL concepts with next and global. In J. Hong, M. Bures, J. W. Park, & T. Cerný (Eds.), SAC ’22: The 37th {ACM/SIGAPP} Symposium on Applied Computing, Virtual Event, April 25 - 29, 2022 (pp. 903–910). ACM. https://doi.org/10.1145/3477314.3507136' bibtex: '@inproceedings{Tirtarasa_Turhan_2022, title={Computing generalizations of temporal ϵL concepts with next and global}, DOI={10.1145/3477314.3507136}, booktitle={SAC ’22: The 37th {ACM/SIGAPP} Symposium on Applied Computing, Virtual Event, April 25 - 29, 2022}, publisher={ACM}, author={Tirtarasa, Satyadharma and Turhan, Anni-Yasmin}, editor={Hong, Jiman and Bures, Miroslav and Park, Juw Won and Cerný, Tomás}, year={2022}, pages={903–910} }' chicago: 'Tirtarasa, Satyadharma, and Anni-Yasmin Turhan. “Computing Generalizations of Temporal ΕL Concepts with next and Global.” In SAC ’22: The 37th {ACM/SIGAPP} Symposium on Applied Computing, Virtual Event, April 25 - 29, 2022, edited by Jiman Hong, Miroslav Bures, Juw Won Park, and Tomás Cerný, 903–910. ACM, 2022. https://doi.org/10.1145/3477314.3507136.' ieee: 'S. Tirtarasa and A.-Y. Turhan, “Computing generalizations of temporal ϵL concepts with next and global,” in SAC ’22: The 37th {ACM/SIGAPP} Symposium on Applied Computing, Virtual Event, April 25 - 29, 2022, 2022, pp. 903–910, doi: 10.1145/3477314.3507136.' mla: 'Tirtarasa, Satyadharma, and Anni-Yasmin Turhan. “Computing Generalizations of Temporal ΕL Concepts with next and Global.” SAC ’22: The 37th {ACM/SIGAPP} Symposium on Applied Computing, Virtual Event, April 25 - 29, 2022, edited by Jiman Hong et al., ACM, 2022, pp. 903–910, doi:10.1145/3477314.3507136.' short: 'S. Tirtarasa, A.-Y. Turhan, in: J. Hong, M. Bures, J.W. Park, T. Cerný (Eds.), SAC ’22: The 37th {ACM/SIGAPP} Symposium on Applied Computing, Virtual Event, April 25 - 29, 2022, ACM, 2022, pp. 903–910.' date_created: 2024-03-26T10:54:20Z date_updated: 2024-06-03T08:07:35Z department: - _id: '888' doi: 10.1145/3477314.3507136 editor: - first_name: Jiman full_name: Hong, Jiman last_name: Hong - first_name: Miroslav full_name: Bures, Miroslav last_name: Bures - first_name: Juw Won full_name: Park, Juw Won last_name: Park - first_name: Tomás full_name: Cerný, Tomás last_name: Cerný language: - iso: eng page: 903–910 publication: 'SAC ’22: The 37th {ACM/SIGAPP} Symposium on Applied Computing, Virtual Event, April 25 - 29, 2022' publisher: ACM status: public title: Computing generalizations of temporal ϵL concepts with next and global type: conference user_id: '9503' year: '2022' ... --- _id: '54549' author: - first_name: Nicole full_name: Janicki, Nicole id: '50915' last_name: Janicki citation: ama: 'Janicki N. Technische Bildung im Sachunterricht der Grundschule am Beispiel von Lernrobotern - Entwicklung und Evaluation eines Fortbildungskonzepts. Posterbeitrag im Rahmen der 31. Jahrestagung der Gesellschaft für Didaktik des Sachunterrichts (GDSU) vom 09. bis 12.03.2022 in Köln. In: ; 2022.' apa: Janicki, N. (2022). Technische Bildung im Sachunterricht der Grundschule am Beispiel von Lernrobotern - Entwicklung und Evaluation eines Fortbildungskonzepts. Posterbeitrag im Rahmen der 31. Jahrestagung der Gesellschaft für Didaktik des Sachunterrichts (GDSU) vom 09. bis 12.03.2022 in Köln. 31. Jahrestagung der Gesellschaft für Didaktik des Sachunterrichts (GDSU), Universität zu Köln. bibtex: '@inproceedings{Janicki_2022, title={Technische Bildung im Sachunterricht der Grundschule am Beispiel von Lernrobotern - Entwicklung und Evaluation eines Fortbildungskonzepts. Posterbeitrag im Rahmen der 31. Jahrestagung der Gesellschaft für Didaktik des Sachunterrichts (GDSU) vom 09. bis 12.03.2022 in Köln}, author={Janicki, Nicole}, year={2022} }' chicago: Janicki, Nicole. “Technische Bildung im Sachunterricht der Grundschule am Beispiel von Lernrobotern - Entwicklung und Evaluation eines Fortbildungskonzepts. Posterbeitrag im Rahmen der 31. Jahrestagung der Gesellschaft für Didaktik des Sachunterrichts (GDSU) vom 09. bis 12.03.2022 in Köln,” 2022. ieee: N. Janicki, “Technische Bildung im Sachunterricht der Grundschule am Beispiel von Lernrobotern - Entwicklung und Evaluation eines Fortbildungskonzepts. Posterbeitrag im Rahmen der 31. Jahrestagung der Gesellschaft für Didaktik des Sachunterrichts (GDSU) vom 09. bis 12.03.2022 in Köln,” presented at the 31. Jahrestagung der Gesellschaft für Didaktik des Sachunterrichts (GDSU), Universität zu Köln, 2022. mla: Janicki, Nicole. Technische Bildung im Sachunterricht der Grundschule am Beispiel von Lernrobotern - Entwicklung und Evaluation eines Fortbildungskonzepts. Posterbeitrag im Rahmen der 31. Jahrestagung der Gesellschaft für Didaktik des Sachunterrichts (GDSU) vom 09. bis 12.03.2022 in Köln. 2022. short: 'N. Janicki, in: 2022.' conference: end_date: 12.03.2022 location: Universität zu Köln name: 31. Jahrestagung der Gesellschaft für Didaktik des Sachunterrichts (GDSU) start_date: 10.03.2022 date_created: 2024-06-03T07:34:33Z date_updated: 2024-06-03T07:49:33Z language: - iso: ger status: public title: Technische Bildung im Sachunterricht der Grundschule am Beispiel von Lernrobotern - Entwicklung und Evaluation eines Fortbildungskonzepts. Posterbeitrag im Rahmen der 31. Jahrestagung der Gesellschaft für Didaktik des Sachunterrichts (GDSU) vom 09. bis 12.03.2022 in Köln type: conference_abstract user_id: '50915' year: '2022' ... --- _id: '52918' author: - first_name: Franz full_name: Baader, Franz last_name: Baader - first_name: Patrick full_name: Koopmann, Patrick last_name: Koopmann - first_name: Friedrich full_name: Michel, Friedrich last_name: Michel - first_name: Anni-Yasmin full_name: Turhan, Anni-Yasmin id: '104470' last_name: Turhan - first_name: Benjamin full_name: Zarrieß, Benjamin last_name: Zarrieß citation: ama: Baader F, Koopmann P, Michel F, Turhan A-Y, Zarrieß B. Efficient TBox Reasoning with Value Restrictions using the Flower Reasoner. Theory Pract Log Program. 2022;22(2):162–192. doi:10.1017/S1471068421000466 apa: Baader, F., Koopmann, P., Michel, F., Turhan, A.-Y., & Zarrieß, B. (2022). Efficient TBox Reasoning with Value Restrictions using the Flower Reasoner. Theory Pract. Log. Program., 22(2), 162–192. https://doi.org/10.1017/S1471068421000466 bibtex: '@article{Baader_Koopmann_Michel_Turhan_Zarrieß_2022, title={Efficient TBox Reasoning with Value Restrictions using the Flower Reasoner}, volume={22}, DOI={10.1017/S1471068421000466}, number={2}, journal={Theory Pract. Log. Program.}, author={Baader, Franz and Koopmann, Patrick and Michel, Friedrich and Turhan, Anni-Yasmin and Zarrieß, Benjamin}, year={2022}, pages={162–192} }' chicago: 'Baader, Franz, Patrick Koopmann, Friedrich Michel, Anni-Yasmin Turhan, and Benjamin Zarrieß. “Efficient TBox Reasoning with Value Restrictions Using the Flower Reasoner.” Theory Pract. Log. Program. 22, no. 2 (2022): 162–192. https://doi.org/10.1017/S1471068421000466.' ieee: 'F. Baader, P. Koopmann, F. Michel, A.-Y. Turhan, and B. Zarrieß, “Efficient TBox Reasoning with Value Restrictions using the Flower Reasoner,” Theory Pract. Log. Program., vol. 22, no. 2, pp. 162–192, 2022, doi: 10.1017/S1471068421000466.' mla: Baader, Franz, et al. “Efficient TBox Reasoning with Value Restrictions Using the Flower Reasoner.” Theory Pract. Log. Program., vol. 22, no. 2, 2022, pp. 162–192, doi:10.1017/S1471068421000466. short: F. Baader, P. Koopmann, F. Michel, A.-Y. Turhan, B. Zarrieß, Theory Pract. Log. Program. 22 (2022) 162–192. date_created: 2024-03-26T10:53:00Z date_updated: 2024-06-03T08:25:12Z department: - _id: '888' doi: 10.1017/S1471068421000466 intvolume: ' 22' issue: '2' language: - iso: eng page: 162–192 publication: Theory Pract. Log. Program. status: public title: Efficient TBox Reasoning with Value Restrictions using the Flower Reasoner type: journal_article user_id: '9503' volume: 22 year: '2022' ... --- _id: '54554' author: - first_name: Richard full_name: Janus, Richard id: '31047' last_name: Janus orcid: https://orcid.org/0009-0006-0365-4546 citation: ama: Janus R. Gott wird Mensch. Weihnachten zwischen Fiktion und Evangelium. Vol 4. Evangelischer Bund; 2022. apa: Janus, R. (2022). Gott wird Mensch. Weihnachten zwischen Fiktion und Evangelium (Vol. 4). Evangelischer Bund. bibtex: '@book{Janus_2022, place={Bensheim}, series={Evangelische Orientierung}, title={Gott wird Mensch. Weihnachten zwischen Fiktion und Evangelium}, volume={4}, publisher={Evangelischer Bund}, author={Janus, Richard}, year={2022}, collection={Evangelische Orientierung} }' chicago: 'Janus, Richard. Gott wird Mensch. Weihnachten zwischen Fiktion und Evangelium. Vol. 4. Evangelische Orientierung. Bensheim: Evangelischer Bund, 2022.' ieee: 'R. Janus, Gott wird Mensch. Weihnachten zwischen Fiktion und Evangelium, vol. 4. Bensheim: Evangelischer Bund, 2022.' mla: Janus, Richard. Gott wird Mensch. Weihnachten zwischen Fiktion und Evangelium. Evangelischer Bund, 2022. short: R. Janus, Gott wird Mensch. Weihnachten zwischen Fiktion und Evangelium, Evangelischer Bund, Bensheim, 2022. date_created: 2024-06-03T14:02:21Z date_updated: 2024-06-03T14:02:30Z department: - _id: '36' - _id: '20' - _id: '500' intvolume: ' 4' language: - iso: ger page: '1' place: Bensheim publication_status: published publisher: Evangelischer Bund series_title: Evangelische Orientierung status: public title: Gott wird Mensch. Weihnachten zwischen Fiktion und Evangelium type: misc user_id: '31047' volume: 4 year: '2022' ... --- _id: '49458' author: - first_name: I. full_name: Nastjuk, I. last_name: Nastjuk - first_name: Simon Thanh-Nam full_name: Trang, Simon Thanh-Nam id: '98948' last_name: Trang orcid: 0000-0002-4784-4038 - first_name: E. full_name: Papageorgiou, E. last_name: Papageorgiou citation: ama: Nastjuk I, Trang ST-N, Papageorgiou E. Smart cities and smart governance models for future cities. Electronic Markets. 2022;32:1917-1924. apa: Nastjuk, I., Trang, S. T.-N., & Papageorgiou, E. (2022). Smart cities and smart governance models for future cities. Electronic Markets, 32, 1917–1924. bibtex: '@article{Nastjuk_Trang_Papageorgiou_2022, title={Smart cities and smart governance models for future cities}, volume={32}, journal={Electronic Markets}, author={Nastjuk, I. and Trang, Simon Thanh-Nam and Papageorgiou, E.}, year={2022}, pages={1917–1924} }' chicago: 'Nastjuk, I., Simon Thanh-Nam Trang, and E. Papageorgiou. “Smart Cities and Smart Governance Models for Future Cities.” Electronic Markets 32 (2022): 1917–24.' ieee: I. Nastjuk, S. T.-N. Trang, and E. Papageorgiou, “Smart cities and smart governance models for future cities,” Electronic Markets, vol. 32, pp. 1917–1924, 2022. mla: Nastjuk, I., et al. “Smart Cities and Smart Governance Models for Future Cities.” Electronic Markets, vol. 32, 2022, pp. 1917–24. short: I. Nastjuk, S.T.-N. Trang, E. Papageorgiou, Electronic Markets 32 (2022) 1917–1924. date_created: 2023-12-04T13:37:18Z date_updated: 2024-06-04T09:48:00Z department: - _id: '792' intvolume: ' 32' language: - iso: eng main_file_link: - open_access: '1' url: https://link.springer.com/article/10.1007/s12525-022-00609-0 oa: '1' page: 1917-1924 publication: Electronic Markets status: public title: Smart cities and smart governance models for future cities type: journal_article user_id: '98948' volume: 32 year: '2022' ... --- _id: '49460' author: - first_name: K. full_name: Masuch, K. last_name: Masuch - first_name: M. full_name: Greve, M. last_name: Greve - first_name: Simon Thanh-Nam full_name: Trang, Simon Thanh-Nam id: '98948' last_name: Trang orcid: 0000-0002-4784-4038 citation: ama: Masuch K, Greve M, Trang ST-N. What to do after a data breach? Examining apology and compensation as response strategies for health service providers. Electronic Markets. 2022;31:829-848. apa: Masuch, K., Greve, M., & Trang, S. T.-N. (2022). What to do after a data breach? Examining apology and compensation as response strategies for health service providers. Electronic Markets, 31, 829–848. bibtex: '@article{Masuch_Greve_Trang_2022, title={What to do after a data breach? Examining apology and compensation as response strategies for health service providers}, volume={31}, journal={Electronic Markets}, author={Masuch, K. and Greve, M. and Trang, Simon Thanh-Nam}, year={2022}, pages={829–848} }' chicago: 'Masuch, K., M. Greve, and Simon Thanh-Nam Trang. “What to Do after a Data Breach? Examining Apology and Compensation as Response Strategies for Health Service Providers.” Electronic Markets 31 (2022): 829–48.' ieee: K. Masuch, M. Greve, and S. T.-N. Trang, “What to do after a data breach? Examining apology and compensation as response strategies for health service providers,” Electronic Markets, vol. 31, pp. 829–848, 2022. mla: Masuch, K., et al. “What to Do after a Data Breach? Examining Apology and Compensation as Response Strategies for Health Service Providers.” Electronic Markets, vol. 31, 2022, pp. 829–48. short: K. Masuch, M. Greve, S.T.-N. Trang, Electronic Markets 31 (2022) 829–848. date_created: 2023-12-04T13:37:36Z date_updated: 2024-06-04T09:50:51Z department: - _id: '792' intvolume: ' 31' language: - iso: eng page: 829-848 publication: Electronic Markets status: public title: What to do after a data breach? Examining apology and compensation as response strategies for health service providers type: journal_article user_id: '98948' volume: 31 year: '2022' ... --- _id: '49459' author: - first_name: K. full_name: Masuch, K. last_name: Masuch - first_name: M. full_name: Greve, M. last_name: Greve - first_name: Simon Thanh-Nam full_name: Trang, Simon Thanh-Nam id: '98948' last_name: Trang orcid: 0000-0002-4784-4038 citation: ama: Masuch K, Greve M, Trang ST-N. Apologize or Justify? Examining the Impact of Data Breach Response Actions on Stock Value of Affected Companies. Computers & Security. 2022;12. apa: Masuch, K., Greve, M., & Trang, S. T.-N. (2022). Apologize or Justify? Examining the Impact of Data Breach Response Actions on Stock Value of Affected Companies. Computers & Security, 12. bibtex: '@article{Masuch_Greve_Trang_2022, title={Apologize or Justify? Examining the Impact of Data Breach Response Actions on Stock Value of Affected Companies}, volume={12}, journal={Computers & Security}, author={Masuch, K. and Greve, M. and Trang, Simon Thanh-Nam}, year={2022} }' chicago: Masuch, K., M. Greve, and Simon Thanh-Nam Trang. “Apologize or Justify? Examining the Impact of Data Breach Response Actions on Stock Value of Affected Companies.” Computers & Security 12 (2022). ieee: K. Masuch, M. Greve, and S. T.-N. Trang, “Apologize or Justify? Examining the Impact of Data Breach Response Actions on Stock Value of Affected Companies,” Computers & Security, vol. 12, 2022. mla: Masuch, K., et al. “Apologize or Justify? Examining the Impact of Data Breach Response Actions on Stock Value of Affected Companies.” Computers & Security, vol. 12, 2022. short: K. Masuch, M. Greve, S.T.-N. Trang, Computers & Security 12 (2022). date_created: 2023-12-04T13:37:24Z date_updated: 2024-06-04T09:50:12Z department: - _id: '792' intvolume: ' 12' language: - iso: eng publication: Computers & Security status: public title: Apologize or Justify? Examining the Impact of Data Breach Response Actions on Stock Value of Affected Companies type: journal_article user_id: '98948' volume: 12 year: '2022' ... --- _id: '54585' author: - first_name: Ali full_name: Manzoor, Ali id: '77309' last_name: Manzoor - first_name: Muhammad full_name: Saleem, Muhammad last_name: Saleem - first_name: Axel-Cyrille full_name: Ngonga Ngomo, Axel-Cyrille id: '65716' last_name: Ngonga Ngomo citation: ama: 'Manzoor A, Saleem M, Ngonga Ngomo A-C. REBench: Microbenchmarking Framework for Relation Extraction Systems. In: The Semantic Web – ISWC 2022. Springer International Publishing; 2022. doi:10.1007/978-3-031-19433-7_37' apa: 'Manzoor, A., Saleem, M., & Ngonga Ngomo, A.-C. (2022). REBench: Microbenchmarking Framework for Relation Extraction Systems. In The Semantic Web – ISWC 2022. Springer International Publishing. https://doi.org/10.1007/978-3-031-19433-7_37' bibtex: '@inbook{Manzoor_Saleem_Ngonga Ngomo_2022, place={Cham}, title={REBench: Microbenchmarking Framework for Relation Extraction Systems}, DOI={10.1007/978-3-031-19433-7_37}, booktitle={The Semantic Web – ISWC 2022}, publisher={Springer International Publishing}, author={Manzoor, Ali and Saleem, Muhammad and Ngonga Ngomo, Axel-Cyrille}, year={2022} }' chicago: 'Manzoor, Ali, Muhammad Saleem, and Axel-Cyrille Ngonga Ngomo. “REBench: Microbenchmarking Framework for Relation Extraction Systems.” In The Semantic Web – ISWC 2022. Cham: Springer International Publishing, 2022. https://doi.org/10.1007/978-3-031-19433-7_37.' ieee: 'A. Manzoor, M. Saleem, and A.-C. Ngonga Ngomo, “REBench: Microbenchmarking Framework for Relation Extraction Systems,” in The Semantic Web – ISWC 2022, Cham: Springer International Publishing, 2022.' mla: 'Manzoor, Ali, et al. “REBench: Microbenchmarking Framework for Relation Extraction Systems.” The Semantic Web – ISWC 2022, Springer International Publishing, 2022, doi:10.1007/978-3-031-19433-7_37.' short: 'A. Manzoor, M. Saleem, A.-C. Ngonga Ngomo, in: The Semantic Web – ISWC 2022, Springer International Publishing, Cham, 2022.' date_created: 2024-06-04T12:21:30Z date_updated: 2024-06-04T12:24:49Z department: - _id: '574' doi: 10.1007/978-3-031-19433-7_37 language: - iso: eng place: Cham publication: The Semantic Web – ISWC 2022 publication_identifier: isbn: - '9783031194320' - '9783031194337' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer International Publishing status: public title: 'REBench: Microbenchmarking Framework for Relation Extraction Systems' type: book_chapter user_id: '77309' year: '2022' ... --- _id: '45849' abstract: - lang: eng text: 'AbstractDependence Logic was introduced by Jouko Väänänen in 2007. We study a propositional variant of this logic(PDL)and investigate a variety of parameterisations with respect to central decision problems. The model checking problem (MC) ofPDLisNP-complete (Ebbing and Lohmann, SOFSEM 2012). The subject of this research is to identify a list of parameterisations (formula-size, formula-depth, treewidth, team-size, number of variables) under which MC becomes fixed-parameter tractable. Furthermore, we show that the number of disjunctions or the arity of dependence atoms (dep-arity) as a parameter both yield a paraNP-completeness result. Then, we consider the satisfiability problem (SAT) which classically is known to beNP-complete as well (Lohmann and Vollmer, Studia Logica 2013). There we are presenting a different picture: under team-size, or dep-arity SAT isparaNP-complete whereas under all other mentioned parameters the problem isFPT. Finally, we introduce a variant of the satisfiability problem, asking for a team of a given size, and show for this problem an almost complete picture.' author: - first_name: Yasir full_name: Mahmood, Yasir id: '99353' 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. Annals of Mathematics and Artificial Intelligence. 2022;90(2-3):271-296. doi:10.1007/s10472-021-09730-w apa: Mahmood, Y., & Meier, A. (2022). Parameterised complexity of model checking and satisfiability in propositional dependence logic. Annals of Mathematics and Artificial Intelligence, 90(2–3), 271–296. https://doi.org/10.1007/s10472-021-09730-w bibtex: '@article{Mahmood_Meier_2022, title={Parameterised complexity of model checking and satisfiability in propositional dependence logic}, volume={90}, DOI={10.1007/s10472-021-09730-w}, number={2–3}, journal={Annals of Mathematics and Artificial Intelligence}, publisher={Springer Science and Business Media LLC}, author={Mahmood, Yasir and Meier, Arne}, year={2022}, pages={271–296} }' chicago: 'Mahmood, Yasir, and Arne Meier. “Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic.” Annals of Mathematics and Artificial Intelligence 90, no. 2–3 (2022): 271–96. https://doi.org/10.1007/s10472-021-09730-w.' ieee: 'Y. Mahmood and A. Meier, “Parameterised complexity of model checking and satisfiability in propositional dependence logic,” Annals of Mathematics and Artificial Intelligence, vol. 90, no. 2–3, pp. 271–296, 2022, doi: 10.1007/s10472-021-09730-w.' mla: Mahmood, Yasir, and Arne Meier. “Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic.” Annals of Mathematics and Artificial Intelligence, vol. 90, no. 2–3, Springer Science and Business Media LLC, 2022, pp. 271–96, doi:10.1007/s10472-021-09730-w. short: Y. Mahmood, A. Meier, Annals of Mathematics and Artificial Intelligence 90 (2022) 271–296. date_created: 2023-07-03T11:45:39Z date_updated: 2024-06-04T16:06:59Z doi: 10.1007/s10472-021-09730-w extern: '1' intvolume: ' 90' issue: 2-3 keyword: - Applied Mathematics - Artificial Intelligence language: - iso: eng page: 271-296 publication: Annals of Mathematics and Artificial Intelligence publication_identifier: issn: - 1012-2443 - 1573-7470 publication_status: published publisher: Springer Science and Business Media LLC status: public title: Parameterised complexity of model checking and satisfiability in propositional dependence logic type: journal_article user_id: '99353' volume: 90 year: '2022' ... --- _id: '45847' abstract: - lang: eng text: "Abstract\r\n In this paper, we investigate the parameterized complexity of model checking for Dependence and Independence logic, which are well studied logics in the area of Team Semantics. We start with a list of nine immediate parameterizations for this problem, namely the number of disjunctions (i.e. splits)/(free) variables/universal quantifiers, formula-size, the tree-width of the Gaifman graph of the input structure, the size of the universe/team and the arity of dependence atoms. We present a comprehensive picture of the parameterized complexity of model checking and obtain a division of the problem into tractable and various intractable degrees. Furthermore, we also consider the complexity of the most important variants (data and expression complexity) of the model checking problem by fixing parts of the input." 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 id: '99353' last_name: Mahmood citation: ama: Kontinen J, Meier A, Mahmood Y. A parameterized view on the complexity of dependence and independence logic. Journal of Logic and Computation. 2022;32(8):1624-1644. doi:10.1093/logcom/exac070 apa: Kontinen, J., Meier, A., & Mahmood, Y. (2022). A parameterized view on the complexity of dependence and independence logic. Journal of Logic and Computation, 32(8), 1624–1644. https://doi.org/10.1093/logcom/exac070 bibtex: '@article{Kontinen_Meier_Mahmood_2022, title={A parameterized view on the complexity of dependence and independence logic}, volume={32}, DOI={10.1093/logcom/exac070}, number={8}, journal={Journal of Logic and Computation}, publisher={Oxford University Press (OUP)}, author={Kontinen, Juha and Meier, Arne and Mahmood, Yasir}, year={2022}, pages={1624–1644} }' chicago: 'Kontinen, Juha, Arne Meier, and Yasir Mahmood. “A Parameterized View on the Complexity of Dependence and Independence Logic.” Journal of Logic and Computation 32, no. 8 (2022): 1624–44. https://doi.org/10.1093/logcom/exac070.' ieee: 'J. Kontinen, A. Meier, and Y. Mahmood, “A parameterized view on the complexity of dependence and independence logic,” Journal of Logic and Computation, vol. 32, no. 8, pp. 1624–1644, 2022, doi: 10.1093/logcom/exac070.' mla: Kontinen, Juha, et al. “A Parameterized View on the Complexity of Dependence and Independence Logic.” Journal of Logic and Computation, vol. 32, no. 8, Oxford University Press (OUP), 2022, pp. 1624–44, doi:10.1093/logcom/exac070. short: J. Kontinen, A. Meier, Y. Mahmood, Journal of Logic and Computation 32 (2022) 1624–1644. date_created: 2023-07-03T11:36:55Z date_updated: 2024-06-04T16:06:37Z doi: 10.1093/logcom/exac070 extern: '1' intvolume: ' 32' issue: '8' keyword: - Logic - Hardware and Architecture - Arts and Humanities (miscellaneous) - Software - Theoretical Computer Science language: - iso: eng page: 1624-1644 publication: Journal of Logic and Computation publication_identifier: issn: - 0955-792X - 1465-363X publication_status: published publisher: Oxford University Press (OUP) status: public title: A parameterized view on the complexity of dependence and independence logic type: journal_article user_id: '99353' volume: 32 year: '2022' ... --- _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 id: '99353' 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; 2022. doi:10.1007/978-3-030-93100-1_9' apa: Kontinen, J., Meier, A., & Mahmood, Y. (2022). 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_2022, 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={2022} }' 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, 2022. 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,” 2022, 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, 2022, 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, 2022.' date_created: 2023-07-03T11:36:33Z date_updated: 2024-06-04T16:06:49Z doi: 10.1007/978-3-030-93100-1_9 extern: '1' 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: '2022' ... --- _id: '47289' author: - first_name: Nicolas full_name: Huaman, Nicolas last_name: Huaman - first_name: Alexander full_name: Krause, Alexander last_name: Krause - first_name: Dominik full_name: Wermke, Dominik last_name: Wermke - first_name: Jan H. full_name: Klemmer, Jan H. last_name: Klemmer - first_name: Christian full_name: Stransky, Christian last_name: Stransky - first_name: Yasemin full_name: Acar, Yasemin id: '94636' last_name: Acar - first_name: Sascha full_name: Fahl, Sascha last_name: Fahl citation: ama: 'Huaman N, Krause A, Wermke D, et al. If You Can’t Get Them to the Lab: Evaluating a Virtual Study Environment with Security Information Workers. In: Chiasson S, Kapadia A, eds. Eighteenth Symposium on Usable Privacy and Security, SOUPS 2022, Boston, MA, USA, August 7-9, 2022. USENIX Association; 2022:313–330.' apa: 'Huaman, N., Krause, A., Wermke, D., Klemmer, J. H., Stransky, C., Acar, Y., & Fahl, S. (2022). If You Can’t Get Them to the Lab: Evaluating a Virtual Study Environment with Security Information Workers. In S. Chiasson & A. Kapadia (Eds.), Eighteenth Symposium on Usable Privacy and Security, SOUPS 2022, Boston, MA, USA, August 7-9, 2022 (pp. 313–330). USENIX Association.' bibtex: '@inproceedings{Huaman_Krause_Wermke_Klemmer_Stransky_Acar_Fahl_2022, title={If You Can’t Get Them to the Lab: Evaluating a Virtual Study Environment with Security Information Workers}, booktitle={Eighteenth Symposium on Usable Privacy and Security, SOUPS 2022, Boston, MA, USA, August 7-9, 2022}, publisher={USENIX Association}, author={Huaman, Nicolas and Krause, Alexander and Wermke, Dominik and Klemmer, Jan H. and Stransky, Christian and Acar, Yasemin and Fahl, Sascha}, editor={Chiasson, Sonia and Kapadia, Apu}, year={2022}, pages={313–330} }' chicago: 'Huaman, Nicolas, Alexander Krause, Dominik Wermke, Jan H. Klemmer, Christian Stransky, Yasemin Acar, and Sascha Fahl. “If You Can’t Get Them to the Lab: Evaluating a Virtual Study Environment with Security Information Workers.” In Eighteenth Symposium on Usable Privacy and Security, SOUPS 2022, Boston, MA, USA, August 7-9, 2022, edited by Sonia Chiasson and Apu Kapadia, 313–330. USENIX Association, 2022.' ieee: 'N. Huaman et al., “If You Can’t Get Them to the Lab: Evaluating a Virtual Study Environment with Security Information Workers,” in Eighteenth Symposium on Usable Privacy and Security, SOUPS 2022, Boston, MA, USA, August 7-9, 2022, 2022, pp. 313–330.' mla: 'Huaman, Nicolas, et al. “If You Can’t Get Them to the Lab: Evaluating a Virtual Study Environment with Security Information Workers.” Eighteenth Symposium on Usable Privacy and Security, SOUPS 2022, Boston, MA, USA, August 7-9, 2022, edited by Sonia Chiasson and Apu Kapadia, USENIX Association, 2022, pp. 313–330.' short: 'N. Huaman, A. Krause, D. Wermke, J.H. Klemmer, C. Stransky, Y. Acar, S. Fahl, in: S. Chiasson, A. Kapadia (Eds.), Eighteenth Symposium on Usable Privacy and Security, SOUPS 2022, Boston, MA, USA, August 7-9, 2022, USENIX Association, 2022, pp. 313–330.' date_created: 2023-09-22T13:21:22Z date_updated: 2024-06-05T12:52:28Z department: - _id: '34' - _id: '858' editor: - first_name: Sonia full_name: Chiasson, Sonia last_name: Chiasson - first_name: Apu full_name: Kapadia, Apu last_name: Kapadia extern: '1' language: - iso: eng page: 313–330 publication: Eighteenth Symposium on Usable Privacy and Security, SOUPS 2022, Boston, MA, USA, August 7-9, 2022 publisher: USENIX Association status: public title: 'If You Can’t Get Them to the Lab: Evaluating a Virtual Study Environment with Security Information Workers' type: conference user_id: '14931' year: '2022' ... --- _id: '47844' author: - first_name: Jan full_name: Jancar, Jan last_name: Jancar - first_name: Marcel full_name: Fourné, Marcel id: '99291' last_name: Fourné - first_name: Daniel De Almeida full_name: Braga, Daniel De Almeida last_name: Braga - first_name: Mohamed full_name: Sabt, Mohamed last_name: Sabt - first_name: Peter full_name: Schwabe, Peter last_name: Schwabe - first_name: Gilles full_name: Barthe, Gilles last_name: Barthe - first_name: Pierre-Alain full_name: Fouque, Pierre-Alain last_name: Fouque - first_name: Yasemin full_name: Acar, Yasemin id: '94636' last_name: Acar citation: ama: 'Jancar J, Fourné M, Braga DDA, et al. “They’re not that hard to mitigate”: What Cryptographic Library Developers Think About Timing Attacks. In: 2022 IEEE Symposium on Security and Privacy (SP). IEEE; 2022. doi:10.1109/sp46214.2022.9833713' apa: 'Jancar, J., Fourné, M., Braga, D. D. A., Sabt, M., Schwabe, P., Barthe, G., Fouque, P.-A., & Acar, Y. (2022). “They’re not that hard to mitigate”: What Cryptographic Library Developers Think About Timing Attacks. 2022 IEEE Symposium on Security and Privacy (SP). https://doi.org/10.1109/sp46214.2022.9833713' bibtex: '@inproceedings{Jancar_Fourné_Braga_Sabt_Schwabe_Barthe_Fouque_Acar_2022, title={“They’re not that hard to mitigate”: What Cryptographic Library Developers Think About Timing Attacks}, DOI={10.1109/sp46214.2022.9833713}, booktitle={2022 IEEE Symposium on Security and Privacy (SP)}, publisher={IEEE}, author={Jancar, Jan and Fourné, Marcel and Braga, Daniel De Almeida and Sabt, Mohamed and Schwabe, Peter and Barthe, Gilles and Fouque, Pierre-Alain and Acar, Yasemin}, year={2022} }' chicago: 'Jancar, Jan, Marcel Fourné, Daniel De Almeida Braga, Mohamed Sabt, Peter Schwabe, Gilles Barthe, Pierre-Alain Fouque, and Yasemin Acar. “‘They’re Not That Hard to Mitigate’: What Cryptographic Library Developers Think About Timing Attacks.” In 2022 IEEE Symposium on Security and Privacy (SP). IEEE, 2022. https://doi.org/10.1109/sp46214.2022.9833713.' ieee: 'J. Jancar et al., “‘They’re not that hard to mitigate’: What Cryptographic Library Developers Think About Timing Attacks,” 2022, doi: 10.1109/sp46214.2022.9833713.' mla: 'Jancar, Jan, et al. “‘They’re Not That Hard to Mitigate’: What Cryptographic Library Developers Think About Timing Attacks.” 2022 IEEE Symposium on Security and Privacy (SP), IEEE, 2022, doi:10.1109/sp46214.2022.9833713.' short: 'J. Jancar, M. Fourné, D.D.A. Braga, M. Sabt, P. Schwabe, G. Barthe, P.-A. Fouque, Y. Acar, in: 2022 IEEE Symposium on Security and Privacy (SP), IEEE, 2022.' date_created: 2023-10-06T16:12:30Z date_updated: 2024-06-05T12:55:00Z department: - _id: '858' doi: 10.1109/sp46214.2022.9833713 extern: '1' language: - iso: eng publication: 2022 IEEE Symposium on Security and Privacy (SP) publication_status: published publisher: IEEE status: public title: '“They’re not that hard to mitigate”: What Cryptographic Library Developers Think About Timing Attacks' type: conference user_id: '14931' year: '2022' ... --- _id: '47286' author: - first_name: Marco full_name: Gutfleisch, Marco last_name: Gutfleisch - first_name: Jan H. full_name: Klemmer, Jan H. last_name: Klemmer - first_name: Niklas full_name: Busch, Niklas last_name: Busch - first_name: Yasemin full_name: Acar, Yasemin id: '94636' last_name: Acar - first_name: M. Angela full_name: Sasse, M. Angela last_name: Sasse - first_name: Sascha full_name: Fahl, Sascha last_name: Fahl citation: ama: 'Gutfleisch M, Klemmer JH, Busch N, Acar Y, Sasse MA, Fahl S. How Does Usable Security (Not) End Up in Software Products? Results From a Qualitative Interview Study. In: 43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022. IEEE; 2022:893–910. doi:10.1109/SP46214.2022.9833756' apa: Gutfleisch, M., Klemmer, J. H., Busch, N., Acar, Y., Sasse, M. A., & Fahl, S. (2022). How Does Usable Security (Not) End Up in Software Products? Results From a Qualitative Interview Study. 43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022, 893–910. https://doi.org/10.1109/SP46214.2022.9833756 bibtex: '@inproceedings{Gutfleisch_Klemmer_Busch_Acar_Sasse_Fahl_2022, title={How Does Usable Security (Not) End Up in Software Products? Results From a Qualitative Interview Study}, DOI={10.1109/SP46214.2022.9833756}, booktitle={43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022}, publisher={IEEE}, author={Gutfleisch, Marco and Klemmer, Jan H. and Busch, Niklas and Acar, Yasemin and Sasse, M. Angela and Fahl, Sascha}, year={2022}, pages={893–910} }' chicago: Gutfleisch, Marco, Jan H. Klemmer, Niklas Busch, Yasemin Acar, M. Angela Sasse, and Sascha Fahl. “How Does Usable Security (Not) End Up in Software Products? Results From a Qualitative Interview Study.” In 43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022, 893–910. IEEE, 2022. https://doi.org/10.1109/SP46214.2022.9833756. ieee: 'M. Gutfleisch, J. H. Klemmer, N. Busch, Y. Acar, M. A. Sasse, and S. Fahl, “How Does Usable Security (Not) End Up in Software Products? Results From a Qualitative Interview Study,” in 43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022, 2022, pp. 893–910, doi: 10.1109/SP46214.2022.9833756.' mla: Gutfleisch, Marco, et al. “How Does Usable Security (Not) End Up in Software Products? Results From a Qualitative Interview Study.” 43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022, IEEE, 2022, pp. 893–910, doi:10.1109/SP46214.2022.9833756. short: 'M. Gutfleisch, J.H. Klemmer, N. Busch, Y. Acar, M.A. Sasse, S. Fahl, in: 43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022, IEEE, 2022, pp. 893–910.' date_created: 2023-09-22T13:18:54Z date_updated: 2024-06-05T12:53:00Z department: - _id: '34' - _id: '858' doi: 10.1109/SP46214.2022.9833756 extern: '1' language: - iso: eng page: 893–910 publication: 43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022 publisher: IEEE status: public title: How Does Usable Security (Not) End Up in Software Products? Results From a Qualitative Interview Study type: conference user_id: '14931' year: '2022' ... --- _id: '47287' author: - first_name: Christian full_name: Stransky, Christian last_name: Stransky - first_name: Oliver full_name: Wiese, Oliver last_name: Wiese - first_name: Volker full_name: Roth, Volker last_name: Roth - first_name: Yasemin full_name: Acar, Yasemin id: '94636' last_name: Acar - first_name: Sascha full_name: Fahl, Sascha last_name: Fahl citation: ama: 'Stransky C, Wiese O, Roth V, Acar Y, Fahl S. 27 Years and 81 Million Opportunities Later: Investigating the Use of Email Encryption for an Entire University. In: 43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022. IEEE; 2022:860–875. doi:10.1109/SP46214.2022.9833755' apa: 'Stransky, C., Wiese, O., Roth, V., Acar, Y., & Fahl, S. (2022). 27 Years and 81 Million Opportunities Later: Investigating the Use of Email Encryption for an Entire University. 43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022, 860–875. https://doi.org/10.1109/SP46214.2022.9833755' bibtex: '@inproceedings{Stransky_Wiese_Roth_Acar_Fahl_2022, title={27 Years and 81 Million Opportunities Later: Investigating the Use of Email Encryption for an Entire University}, DOI={10.1109/SP46214.2022.9833755}, booktitle={43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022}, publisher={IEEE}, author={Stransky, Christian and Wiese, Oliver and Roth, Volker and Acar, Yasemin and Fahl, Sascha}, year={2022}, pages={860–875} }' chicago: 'Stransky, Christian, Oliver Wiese, Volker Roth, Yasemin Acar, and Sascha Fahl. “27 Years and 81 Million Opportunities Later: Investigating the Use of Email Encryption for an Entire University.” In 43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022, 860–875. IEEE, 2022. https://doi.org/10.1109/SP46214.2022.9833755.' ieee: 'C. Stransky, O. Wiese, V. Roth, Y. Acar, and S. Fahl, “27 Years and 81 Million Opportunities Later: Investigating the Use of Email Encryption for an Entire University,” in 43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022, 2022, pp. 860–875, doi: 10.1109/SP46214.2022.9833755.' mla: 'Stransky, Christian, et al. “27 Years and 81 Million Opportunities Later: Investigating the Use of Email Encryption for an Entire University.” 43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022, IEEE, 2022, pp. 860–875, doi:10.1109/SP46214.2022.9833755.' short: 'C. Stransky, O. Wiese, V. Roth, Y. Acar, S. Fahl, in: 43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022, IEEE, 2022, pp. 860–875.' date_created: 2023-09-22T13:19:56Z date_updated: 2024-06-05T12:53:20Z department: - _id: '34' - _id: '858' doi: 10.1109/SP46214.2022.9833755 extern: '1' language: - iso: eng page: 860–875 publication: 43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022 publisher: IEEE status: public title: '27 Years and 81 Million Opportunities Later: Investigating the Use of Email Encryption for an Entire University' type: conference user_id: '14931' year: '2022' ...