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