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