[{"date_updated":"2022-01-06T06:52:14Z","date_created":"2019-11-15T10:24:45Z","author":[{"full_name":"Ahmadi Fahandar, Mohsen","id":"59547","last_name":"Ahmadi Fahandar","first_name":"Mohsen"},{"full_name":"Hüllermeier, Eyke","id":"48129","last_name":"Hüllermeier","first_name":"Eyke"}],"title":"Feature Selection for Analogy-Based Learning to Rank","doi":"10.1007/978-3-030-33778-0_22","publication_identifier":{"isbn":["9783030337773","9783030337780"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","place":"Cham","year":"2019","citation":{"apa":"Ahmadi Fahandar, M., &#38; Hüllermeier, E. (2019). Feature Selection for Analogy-Based Learning to Rank. In <i>Discovery Science</i>. Cham. <a href=\"https://doi.org/10.1007/978-3-030-33778-0_22\">https://doi.org/10.1007/978-3-030-33778-0_22</a>","bibtex":"@inbook{Ahmadi Fahandar_Hüllermeier_2019, place={Cham}, title={Feature Selection for Analogy-Based Learning to Rank}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-33778-0_22\">10.1007/978-3-030-33778-0_22</a>}, booktitle={Discovery Science}, author={Ahmadi Fahandar, Mohsen and Hüllermeier, Eyke}, year={2019} }","mla":"Ahmadi Fahandar, Mohsen, and Eyke Hüllermeier. “Feature Selection for Analogy-Based Learning to Rank.” <i>Discovery Science</i>, 2019, doi:<a href=\"https://doi.org/10.1007/978-3-030-33778-0_22\">10.1007/978-3-030-33778-0_22</a>.","short":"M. Ahmadi Fahandar, E. Hüllermeier, in: Discovery Science, Cham, 2019.","ieee":"M. Ahmadi Fahandar and E. Hüllermeier, “Feature Selection for Analogy-Based Learning to Rank,” in <i>Discovery Science</i>, Cham, 2019.","chicago":"Ahmadi Fahandar, Mohsen, and Eyke Hüllermeier. “Feature Selection for Analogy-Based Learning to Rank.” In <i>Discovery Science</i>. Cham, 2019. <a href=\"https://doi.org/10.1007/978-3-030-33778-0_22\">https://doi.org/10.1007/978-3-030-33778-0_22</a>.","ama":"Ahmadi Fahandar M, Hüllermeier E. Feature Selection for Analogy-Based Learning to Rank. In: <i>Discovery Science</i>. Cham; 2019. doi:<a href=\"https://doi.org/10.1007/978-3-030-33778-0_22\">10.1007/978-3-030-33778-0_22</a>"},"_id":"15004","department":[{"_id":"34"},{"_id":"355"}],"user_id":"315","language":[{"iso":"eng"}],"publication":"Discovery Science","type":"book_chapter","status":"public"},{"date_updated":"2022-01-06T06:52:14Z","date_created":"2019-11-15T10:30:10Z","author":[{"first_name":"Mohsen","id":"59547","full_name":"Ahmadi Fahandar, Mohsen","last_name":"Ahmadi Fahandar"},{"last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","id":"48129","first_name":"Eyke"}],"title":"Analogy-Based Preference Learning with Kernels","doi":"10.1007/978-3-030-30179-8_3","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030301781","9783030301798"]},"year":"2019","place":"Cham","citation":{"ama":"Ahmadi Fahandar M, Hüllermeier E. Analogy-Based Preference Learning with Kernels. In: <i>KI 2019: Advances in Artificial Intelligence</i>. Cham; 2019. doi:<a href=\"https://doi.org/10.1007/978-3-030-30179-8_3\">10.1007/978-3-030-30179-8_3</a>","ieee":"M. Ahmadi Fahandar and E. Hüllermeier, “Analogy-Based Preference Learning with Kernels,” in <i>KI 2019: Advances in Artificial Intelligence</i>, Cham, 2019.","chicago":"Ahmadi Fahandar, Mohsen, and Eyke Hüllermeier. “Analogy-Based Preference Learning with Kernels.” In <i>KI 2019: Advances in Artificial Intelligence</i>. Cham, 2019. <a href=\"https://doi.org/10.1007/978-3-030-30179-8_3\">https://doi.org/10.1007/978-3-030-30179-8_3</a>.","apa":"Ahmadi Fahandar, M., &#38; Hüllermeier, E. (2019). Analogy-Based Preference Learning with Kernels. In <i>KI 2019: Advances in Artificial Intelligence</i>. Cham. <a href=\"https://doi.org/10.1007/978-3-030-30179-8_3\">https://doi.org/10.1007/978-3-030-30179-8_3</a>","bibtex":"@inbook{Ahmadi Fahandar_Hüllermeier_2019, place={Cham}, title={Analogy-Based Preference Learning with Kernels}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-30179-8_3\">10.1007/978-3-030-30179-8_3</a>}, booktitle={KI 2019: Advances in Artificial Intelligence}, author={Ahmadi Fahandar, Mohsen and Hüllermeier, Eyke}, year={2019} }","mla":"Ahmadi Fahandar, Mohsen, and Eyke Hüllermeier. “Analogy-Based Preference Learning with Kernels.” <i>KI 2019: Advances in Artificial Intelligence</i>, 2019, doi:<a href=\"https://doi.org/10.1007/978-3-030-30179-8_3\">10.1007/978-3-030-30179-8_3</a>.","short":"M. Ahmadi Fahandar, E. Hüllermeier, in: KI 2019: Advances in Artificial Intelligence, Cham, 2019."},"_id":"15005","user_id":"315","department":[{"_id":"34"},{"_id":"355"}],"language":[{"iso":"eng"}],"type":"book_chapter","publication":"KI 2019: Advances in Artificial Intelligence","status":"public"},{"type":"book_chapter","publication":"Discovery Science","status":"public","_id":"15006","user_id":"49109","department":[{"_id":"34"},{"_id":"355"}],"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030337773","9783030337780"]},"year":"2019","place":"Cham","citation":{"ama":"Nguyen V-L, Destercke S, Hüllermeier E. Epistemic Uncertainty Sampling. In: <i>Discovery Science</i>. Cham; 2019. doi:<a href=\"https://doi.org/10.1007/978-3-030-33778-0_7\">10.1007/978-3-030-33778-0_7</a>","ieee":"V.-L. Nguyen, S. Destercke, and E. Hüllermeier, “Epistemic Uncertainty Sampling,” in <i>Discovery Science</i>, Cham, 2019.","chicago":"Nguyen, Vu-Linh, Sébastien Destercke, and Eyke Hüllermeier. “Epistemic Uncertainty Sampling.” In <i>Discovery Science</i>. Cham, 2019. <a href=\"https://doi.org/10.1007/978-3-030-33778-0_7\">https://doi.org/10.1007/978-3-030-33778-0_7</a>.","mla":"Nguyen, Vu-Linh, et al. “Epistemic Uncertainty Sampling.” <i>Discovery Science</i>, 2019, doi:<a href=\"https://doi.org/10.1007/978-3-030-33778-0_7\">10.1007/978-3-030-33778-0_7</a>.","bibtex":"@inbook{Nguyen_Destercke_Hüllermeier_2019, place={Cham}, title={Epistemic Uncertainty Sampling}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-33778-0_7\">10.1007/978-3-030-33778-0_7</a>}, booktitle={Discovery Science}, author={Nguyen, Vu-Linh and Destercke, Sébastien and Hüllermeier, Eyke}, year={2019} }","short":"V.-L. Nguyen, S. Destercke, E. Hüllermeier, in: Discovery Science, Cham, 2019.","apa":"Nguyen, V.-L., Destercke, S., &#38; Hüllermeier, E. (2019). Epistemic Uncertainty Sampling. In <i>Discovery Science</i>. Cham. <a href=\"https://doi.org/10.1007/978-3-030-33778-0_7\">https://doi.org/10.1007/978-3-030-33778-0_7</a>"},"date_updated":"2022-01-06T06:52:14Z","date_created":"2019-11-15T10:35:08Z","author":[{"first_name":"Vu-Linh","last_name":"Nguyen","full_name":"Nguyen, Vu-Linh"},{"last_name":"Destercke","full_name":"Destercke, Sébastien","first_name":"Sébastien"},{"first_name":"Eyke","full_name":"Hüllermeier, Eyke","id":"48129","last_name":"Hüllermeier"}],"title":"Epistemic Uncertainty Sampling","doi":"10.1007/978-3-030-33778-0_7"},{"conference":{"location":"Thessaloniki, Greece"},"doi":"10.1007/978-3-030-05716-9_59","title":"How Good Is Good Enough? Establishing Quality Thresholds for the Automatic Text Analysis of Retro-Digitized Comics","author":[{"first_name":"Rita","full_name":"Hartel, Rita","id":"14961","last_name":"Hartel"},{"first_name":"Alexander","full_name":"Dunst, Alexander","last_name":"Dunst"}],"date_created":"2019-11-21T14:42:25Z","publisher":"Springer","date_updated":"2022-01-06T06:52:15Z","citation":{"apa":"Hartel, R., &#38; Dunst, A. (2019). How Good Is Good Enough? Establishing Quality Thresholds for the Automatic Text Analysis of Retro-Digitized Comics. In <i>International Conference on Multimedia Modeling, MMM</i> (pp. 662–671). Thessaloniki, Greece: Springer. <a href=\"https://doi.org/10.1007/978-3-030-05716-9_59\">https://doi.org/10.1007/978-3-030-05716-9_59</a>","mla":"Hartel, Rita, and Alexander Dunst. “How Good Is Good Enough? Establishing Quality Thresholds for the Automatic Text Analysis of Retro-Digitized Comics.” <i>International Conference on Multimedia Modeling, MMM</i>, Springer, 2019, pp. 662–71, doi:<a href=\"https://doi.org/10.1007/978-3-030-05716-9_59\">10.1007/978-3-030-05716-9_59</a>.","bibtex":"@inproceedings{Hartel_Dunst_2019, title={How Good Is Good Enough? Establishing Quality Thresholds for the Automatic Text Analysis of Retro-Digitized Comics}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-05716-9_59\">10.1007/978-3-030-05716-9_59</a>}, booktitle={International Conference on Multimedia Modeling, MMM}, publisher={Springer}, author={Hartel, Rita and Dunst, Alexander}, year={2019}, pages={662–671} }","short":"R. Hartel, A. Dunst, in: International Conference on Multimedia Modeling, MMM, Springer, 2019, pp. 662–671.","ama":"Hartel R, Dunst A. How Good Is Good Enough? Establishing Quality Thresholds for the Automatic Text Analysis of Retro-Digitized Comics. In: <i>International Conference on Multimedia Modeling, MMM</i>. Springer; 2019:662-671. doi:<a href=\"https://doi.org/10.1007/978-3-030-05716-9_59\">10.1007/978-3-030-05716-9_59</a>","ieee":"R. Hartel and A. Dunst, “How Good Is Good Enough? Establishing Quality Thresholds for the Automatic Text Analysis of Retro-Digitized Comics,” in <i>International Conference on Multimedia Modeling, MMM</i>, Thessaloniki, Greece, 2019, pp. 662–671.","chicago":"Hartel, Rita, and Alexander Dunst. “How Good Is Good Enough? Establishing Quality Thresholds for the Automatic Text Analysis of Retro-Digitized Comics.” In <i>International Conference on Multimedia Modeling, MMM</i>, 662–71. Springer, 2019. <a href=\"https://doi.org/10.1007/978-3-030-05716-9_59\">https://doi.org/10.1007/978-3-030-05716-9_59</a>."},"page":"662-671","year":"2019","publication_status":"published","publication_identifier":{"isbn":["9783030057152","9783030057169"],"issn":["0302-9743","1611-3349"]},"language":[{"iso":"eng"}],"user_id":"14961","department":[{"_id":"69"}],"_id":"15080","status":"public","type":"conference","publication":"International Conference on Multimedia Modeling, MMM"},{"doi":"10.1007/978-3-030-16722-6_23","title":"CoVeriTest: Cooperative Verifier-Based Testing","date_created":"2019-10-16T06:39:51Z","author":[{"full_name":"Beyer, Dirk","last_name":"Beyer","first_name":"Dirk"},{"last_name":"Jakobs","full_name":"Jakobs, Marie-Christine","first_name":"Marie-Christine"}],"date_updated":"2022-01-06T06:51:45Z","citation":{"ieee":"D. Beyer and M.-C. Jakobs, “CoVeriTest: Cooperative Verifier-Based Testing,” in <i>Fundamental Approaches to Software Engineering</i>, Cham, 2019.","chicago":"Beyer, Dirk, and Marie-Christine Jakobs. “CoVeriTest: Cooperative Verifier-Based Testing.” In <i>Fundamental Approaches to Software Engineering</i>. Cham, 2019. <a href=\"https://doi.org/10.1007/978-3-030-16722-6_23\">https://doi.org/10.1007/978-3-030-16722-6_23</a>.","ama":"Beyer D, Jakobs M-C. CoVeriTest: Cooperative Verifier-Based Testing. In: <i>Fundamental Approaches to Software Engineering</i>. Cham; 2019. doi:<a href=\"https://doi.org/10.1007/978-3-030-16722-6_23\">10.1007/978-3-030-16722-6_23</a>","mla":"Beyer, Dirk, and Marie-Christine Jakobs. “CoVeriTest: Cooperative Verifier-Based Testing.” <i>Fundamental Approaches to Software Engineering</i>, 2019, doi:<a href=\"https://doi.org/10.1007/978-3-030-16722-6_23\">10.1007/978-3-030-16722-6_23</a>.","bibtex":"@inbook{Beyer_Jakobs_2019, place={Cham}, title={CoVeriTest: Cooperative Verifier-Based Testing}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-16722-6_23\">10.1007/978-3-030-16722-6_23</a>}, booktitle={Fundamental Approaches to Software Engineering}, author={Beyer, Dirk and Jakobs, Marie-Christine}, year={2019} }","short":"D. Beyer, M.-C. Jakobs, in: Fundamental Approaches to Software Engineering, Cham, 2019.","apa":"Beyer, D., &#38; Jakobs, M.-C. (2019). CoVeriTest: Cooperative Verifier-Based Testing. In <i>Fundamental Approaches to Software Engineering</i>. Cham. <a href=\"https://doi.org/10.1007/978-3-030-16722-6_23\">https://doi.org/10.1007/978-3-030-16722-6_23</a>"},"place":"Cham","year":"2019","publication_identifier":{"isbn":["9783030167219","9783030167226"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","language":[{"iso":"eng"}],"department":[{"_id":"77"}],"user_id":"44413","_id":"13872","project":[{"name":"Kooperative Softwareverifikation","_id":"85"}],"status":"public","publication":"Fundamental Approaches to Software Engineering","type":"book_chapter"},{"publication":"Semantic Systems. The Power of AI and Knowledge Graphs","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":1179910,"access_level":"closed","file_name":"Gusmita_et_al-2019-Semantic_Systems._The_Power_of_AI_and_Knowledge_Graphs,_15th_International....pdf","file_id":"57244","date_updated":"2024-11-19T15:28:45Z","creator":"gusmita","date_created":"2024-11-19T15:28:45Z"}],"abstract":[{"lang":"eng","text":"Question answering engines have become one of the most popular type of applications driven by Semantic Web technologies. Consequently, the provision of means to quantify the performance of current question answering approaches on current datasets has become ever more important. However, a large percentage of the queries found in popular question answering benchmarks cannot be executed on current versions of their reference dataset. There is a consequently a clear need to curate question answering benchmarks periodically. However, the manual alteration of question answering benchmarks is often error-prone. We alleviate this problem by presenting QUANT, a novel framework for the creation and curation of question answering benchmarks. QUANT sup-ports the curation of benchmarks by generating smart edit suggestions for question-query pair and for the corresponding metadata. In addition, our framework supports the creation of new benchmark entries by pro-viding predefined quality checks for queries. We evaluate QUANT on 653questions obtained from QALD-1 to QALD-8 with 10 users. Our results show that our framework generates reliable suggestions and can reduce the curation effort for QA benchmarks by up to 91%."}],"language":[{"iso":"eng"}],"ddc":["004"],"keyword":["Benchmark","Question answering","Knowledge base"],"year":"2019","date_created":"2024-10-10T14:25:00Z","publisher":"Springer International Publishing","title":"QUANT - Question Answering Benchmark Curator","type":"book_chapter","status":"public","editor":[{"last_name":"Acosta","full_name":"Acosta, Maribel","first_name":"Maribel"},{"last_name":"Cudr{\\'e}-Mauroux","full_name":"Cudr{\\'e}-Mauroux, Philippe","first_name":"Philippe"},{"last_name":"Maleshkova","full_name":"Maleshkova, Maria","first_name":"Maria"},{"first_name":"Tassilo","full_name":"Pellegrini, Tassilo","last_name":"Pellegrini"},{"last_name":"Sack","full_name":"Sack, Harald","first_name":"Harald"},{"full_name":"Sure-Vetter, York","last_name":"Sure-Vetter","first_name":"York"}],"user_id":"71039","_id":"56579","file_date_updated":"2024-11-19T15:28:45Z","publication_status":"published","publication_identifier":{"eisbn":["978-3-030-33220-4"],"isbn":["978-3-030-33219-8"],"issn":["0302-9743","1611-3349"]},"has_accepted_license":"1","citation":{"apa":"Gusmita, R. H., Jalota, R., Vollmers, D., Reineke, J., Ngonga Ngomo, A.-C., &#38; Usbeck, R. (2019). QUANT - Question Answering Benchmark Curator. In M. Acosta, P. Cudr{\\’e}-Mauroux, M. Maleshkova, T. Pellegrini, H. Sack, &#38; Y. Sure-Vetter (Eds.), <i>Semantic Systems. The Power of AI and Knowledge Graphs</i> (pp. 343--358). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-030-33220-4_25\">https://doi.org/10.1007/978-3-030-33220-4_25</a>","bibtex":"@inbook{Gusmita_Jalota_Vollmers_Reineke_Ngonga Ngomo_Usbeck_2019, place={Cham}, title={QUANT - Question Answering Benchmark Curator}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-33220-4_25\">10.1007/978-3-030-33220-4_25</a>}, booktitle={Semantic Systems. The Power of AI and Knowledge Graphs}, publisher={Springer International Publishing}, author={Gusmita, Ria Hari and Jalota, Rricha and Vollmers, Daniel and Reineke, Jan and Ngonga Ngomo, Axel-Cyrille and Usbeck, Ricardo}, editor={Acosta, Maribel and Cudr{\\’e}-Mauroux, Philippe and Maleshkova, Maria and Pellegrini, Tassilo and Sack, Harald and Sure-Vetter, York}, year={2019}, pages={343--358} }","short":"R.H. Gusmita, R. Jalota, D. Vollmers, J. Reineke, A.-C. Ngonga Ngomo, R. Usbeck, in: M. Acosta, P. Cudr{\\’e}-Mauroux, M. Maleshkova, T. Pellegrini, H. Sack, Y. Sure-Vetter (Eds.), Semantic Systems. The Power of AI and Knowledge Graphs, Springer International Publishing, Cham, 2019, pp. 343--358.","mla":"Gusmita, Ria Hari, et al. “QUANT - Question Answering Benchmark Curator.” <i>Semantic Systems. The Power of AI and Knowledge Graphs</i>, edited by Maribel Acosta et al., Springer International Publishing, 2019, pp. 343--358, doi:<a href=\"https://doi.org/10.1007/978-3-030-33220-4_25\">10.1007/978-3-030-33220-4_25</a>.","ieee":"R. H. Gusmita, R. Jalota, D. Vollmers, J. Reineke, A.-C. Ngonga Ngomo, and R. Usbeck, “QUANT - Question Answering Benchmark Curator,” in <i>Semantic Systems. The Power of AI and Knowledge Graphs</i>, M. Acosta, P. Cudr{\\’e}-Mauroux, M. Maleshkova, T. Pellegrini, H. Sack, and Y. Sure-Vetter, Eds. Cham: Springer International Publishing, 2019, pp. 343--358.","chicago":"Gusmita, Ria Hari, Rricha Jalota, Daniel Vollmers, Jan Reineke, Axel-Cyrille Ngonga Ngomo, and Ricardo Usbeck. “QUANT - Question Answering Benchmark Curator.” In <i>Semantic Systems. The Power of AI and Knowledge Graphs</i>, edited by Maribel Acosta, Philippe Cudr{\\’e}-Mauroux, Maria Maleshkova, Tassilo Pellegrini, Harald Sack, and York Sure-Vetter, 343--358. Cham: Springer International Publishing, 2019. <a href=\"https://doi.org/10.1007/978-3-030-33220-4_25\">https://doi.org/10.1007/978-3-030-33220-4_25</a>.","ama":"Gusmita RH, Jalota R, Vollmers D, Reineke J, Ngonga Ngomo A-C, Usbeck R. QUANT - Question Answering Benchmark Curator. In: Acosta M, Cudr{\\’e}-Mauroux P, Maleshkova M, Pellegrini T, Sack H, Sure-Vetter Y, eds. <i>Semantic Systems. The Power of AI and Knowledge Graphs</i>. Springer International Publishing; 2019:343--358. doi:<a href=\"https://doi.org/10.1007/978-3-030-33220-4_25\">10.1007/978-3-030-33220-4_25</a>"},"page":"343--358","place":"Cham","author":[{"first_name":"Ria Hari","last_name":"Gusmita","full_name":"Gusmita, Ria Hari","id":"71039"},{"first_name":"Rricha","full_name":"Jalota, Rricha","last_name":"Jalota"},{"first_name":"Daniel","last_name":"Vollmers","full_name":"Vollmers, Daniel"},{"full_name":"Reineke, Jan","last_name":"Reineke","first_name":"Jan"},{"first_name":"Axel-Cyrille","last_name":"Ngonga Ngomo","full_name":"Ngonga Ngomo, Axel-Cyrille","id":"65716"},{"full_name":"Usbeck, Ricardo","last_name":"Usbeck","first_name":"Ricardo"}],"oa":"1","date_updated":"2024-11-19T15:34:24Z","main_file_link":[{"open_access":"1","url":"https://rdcu.be/d0KJc"}],"doi":"10.1007/978-3-030-33220-4_25","conference":{"location":"Karlsruhe, Germany","end_date":"2019-09-12","start_date":"2019-09-09","name":"SEMANTiCS 2019"}},{"title":"Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems","publisher":"Springer International Publishing","date_created":"2018-05-24T11:14:02Z","year":"2018","ddc":["004"],"language":[{"iso":"eng"}],"file":[{"access_level":"closed","file_name":"PracticalAnonymousAndPubliclyL.pdf","file_id":"5253","file_size":3371773,"date_created":"2018-11-02T13:45:40Z","creator":"ups","date_updated":"2018-11-02T13:45:40Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"publication":"Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers' Track at the {RSA} Conference 2018, Proceedings","main_file_link":[{"url":"https://eprint.iacr.org/2018/029","open_access":"1"}],"conference":{"location":"San Francisco, CA, USA","end_date":"2018-04-20","start_date":"2018-04-16","name":"Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers' Track at the {RSA} Conference 2018"},"doi":"10.1007/978-3-319-76953-0_25","oa":"1","date_updated":"2022-01-06T06:58:12Z","author":[{"first_name":"Johannes","full_name":"Blömer, Johannes","id":"23","last_name":"Blömer"},{"first_name":"Fabian","full_name":"Eidens, Fabian","id":"25078","last_name":"Eidens"},{"first_name":"Jakob","last_name":"Juhnke","full_name":"Juhnke, Jakob","id":"48090"}],"place":"Cham","citation":{"mla":"Blömer, Johannes, et al. “Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems.” <i>Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings</i>, Springer International Publishing, 2018, pp. 470–90, doi:<a href=\"https://doi.org/10.1007/978-3-319-76953-0_25\">10.1007/978-3-319-76953-0_25</a>.","bibtex":"@inproceedings{Blömer_Eidens_Juhnke_2018, place={Cham}, title={Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-76953-0_25\">10.1007/978-3-319-76953-0_25</a>}, booktitle={Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings}, publisher={Springer International Publishing}, author={Blömer, Johannes and Eidens, Fabian and Juhnke, Jakob}, year={2018}, pages={470–490} }","short":"J. Blömer, F. Eidens, J. Juhnke, in: Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings, Springer International Publishing, Cham, 2018, pp. 470–490.","apa":"Blömer, J., Eidens, F., &#38; Juhnke, J. (2018). Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems. In <i>Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings</i> (pp. 470–490). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-76953-0_25\">https://doi.org/10.1007/978-3-319-76953-0_25</a>","chicago":"Blömer, Johannes, Fabian Eidens, and Jakob Juhnke. “Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems.” In <i>Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings</i>, 470–90. Cham: Springer International Publishing, 2018. <a href=\"https://doi.org/10.1007/978-3-319-76953-0_25\">https://doi.org/10.1007/978-3-319-76953-0_25</a>.","ieee":"J. Blömer, F. Eidens, and J. Juhnke, “Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems,” in <i>Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings</i>, San Francisco, CA, USA, 2018, pp. 470–490.","ama":"Blömer J, Eidens F, Juhnke J. Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems. In: <i>Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings</i>. Cham: Springer International Publishing; 2018:470-490. doi:<a href=\"https://doi.org/10.1007/978-3-319-76953-0_25\">10.1007/978-3-319-76953-0_25</a>"},"page":"470-490","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783319769523","9783319769530"]},"has_accepted_license":"1","file_date_updated":"2018-11-02T13:45:40Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"_id":"2862","user_id":"477","department":[{"_id":"7"},{"_id":"64"}],"status":"public","type":"conference"},{"department":[{"_id":"63"}],"user_id":"15415","_id":"24396","language":[{"iso":"eng"}],"publication":"International Workshop on Combinatorial Algorithms (IWOCA)","type":"conference","status":"public","abstract":[{"lang":"eng","text":"We study the Online Prize-collecting Node-weighted Steiner Forest problem (OPC-NWSF) in which we are given an undirected graph \\(G=(V, E)\\) with \\(|V| = n\\) and node-weight function \\(w: V \\rightarrow \\mathcal {R}^+\\). A sequence of k pairs of nodes of G, each associated with a penalty, arrives online. OPC-NWSF asks to construct a subgraph H such that each pair \\(\\{s, t\\}\\) is either connected (there is a path between s and t in H) or its associated penalty is paid. The goal is to minimize the weight of H and the total penalties paid. The current best result for OPC-NWSF is a randomized \\(\\mathcal {O}(\\log ^4 n)\\)-competitive algorithm due to Hajiaghayi et al. (ICALP 2014). We improve this by proposing a randomized \\(\\mathcal {O}(\\log n \\log k)\\)-competitive algorithm for OPC-NWSF, which is optimal up to constant factor since OPC-NWSF has a randomized lower bound of \\(\\varOmega (\\log ^2 n)\\) due to Korman [11]. Moreover, our result also implies an improvement for two special cases of OPC-NWSF, the Online Prize-collecting Node-weighted Steiner Tree problem (OPC-NWST) and the Online Node-weighted Steiner Forest problem (ONWSF). In OPC-NWST, there is a distinguished node which is one of the nodes in each pair. In ONWSF, all penalties are set to infinity. The currently best known results for OPC-NWST and ONWSF are a randomized \\(\\mathcal {O}(\\log ^3 n)\\)-competitive algorithm due to Hajiaghayi et al. (ICALP 2014) and a randomized \\(\\mathcal {O}(\\log n \\log ^2 k)\\)-competitive algorithm due to Hajiaghayi et al. (FOCS 2013), respectively."}],"author":[{"first_name":"Christine","full_name":"Markarian, Christine","last_name":"Markarian"}],"date_created":"2021-09-14T12:23:29Z","date_updated":"2022-01-06T06:56:19Z","doi":"10.1007/978-3-319-94667-2_18","title":"An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest","publication_identifier":{"issn":["0302-9743","1611-3349"]},"publication_status":"published","citation":{"ieee":"C. Markarian, “An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest,” 2018, doi: <a href=\"https://doi.org/10.1007/978-3-319-94667-2_18\">10.1007/978-3-319-94667-2_18</a>.","chicago":"Markarian, Christine. “An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest.” In <i>International Workshop on Combinatorial Algorithms (IWOCA)</i>. Cham, 2018. <a href=\"https://doi.org/10.1007/978-3-319-94667-2_18\">https://doi.org/10.1007/978-3-319-94667-2_18</a>.","ama":"Markarian C. An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest. In: <i>International Workshop on Combinatorial Algorithms (IWOCA)</i>. ; 2018. doi:<a href=\"https://doi.org/10.1007/978-3-319-94667-2_18\">10.1007/978-3-319-94667-2_18</a>","bibtex":"@inproceedings{Markarian_2018, place={Cham}, title={An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-94667-2_18\">10.1007/978-3-319-94667-2_18</a>}, booktitle={International Workshop on Combinatorial Algorithms (IWOCA)}, author={Markarian, Christine}, year={2018} }","mla":"Markarian, Christine. “An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest.” <i>International Workshop on Combinatorial Algorithms (IWOCA)</i>, 2018, doi:<a href=\"https://doi.org/10.1007/978-3-319-94667-2_18\">10.1007/978-3-319-94667-2_18</a>.","short":"C. Markarian, in: International Workshop on Combinatorial Algorithms (IWOCA), Cham, 2018.","apa":"Markarian, C. (2018). An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest. <i>International Workshop on Combinatorial Algorithms (IWOCA)</i>. <a href=\"https://doi.org/10.1007/978-3-319-94667-2_18\">https://doi.org/10.1007/978-3-319-94667-2_18</a>"},"place":"Cham","year":"2018"},{"author":[{"last_name":"Lösch","id":"43646","full_name":"Lösch, Achim","first_name":"Achim"},{"last_name":"Wiens","full_name":"Wiens, Alex","first_name":"Alex"},{"first_name":"Marco","id":"398","full_name":"Platzner, Marco","last_name":"Platzner"}],"volume":10793,"date_updated":"2022-01-06T06:59:13Z","doi":"10.1007/978-3-319-77610-1_6","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783319776095","9783319776101"]},"has_accepted_license":"1","citation":{"ama":"Lösch A, Wiens A, Platzner M. Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes. In: <i>Proceedings of the International Conference on Architecture of Computing Systems (ARCS)</i>. Vol 10793. Lecture Notes in Computer Science. Cham: Springer International Publishing; 2018:73-84. doi:<a href=\"https://doi.org/10.1007/978-3-319-77610-1_6\">10.1007/978-3-319-77610-1_6</a>","ieee":"A. Lösch, A. Wiens, and M. Platzner, “Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes,” in <i>Proceedings of the International Conference on Architecture of Computing Systems (ARCS)</i>, 2018, vol. 10793, pp. 73–84.","chicago":"Lösch, Achim, Alex Wiens, and Marco Platzner. “Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes.” In <i>Proceedings of the International Conference on Architecture of Computing Systems (ARCS)</i>, 10793:73–84. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2018. <a href=\"https://doi.org/10.1007/978-3-319-77610-1_6\">https://doi.org/10.1007/978-3-319-77610-1_6</a>.","apa":"Lösch, A., Wiens, A., &#38; Platzner, M. (2018). Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes. In <i>Proceedings of the International Conference on Architecture of Computing Systems (ARCS)</i> (Vol. 10793, pp. 73–84). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-77610-1_6\">https://doi.org/10.1007/978-3-319-77610-1_6</a>","bibtex":"@inproceedings{Lösch_Wiens_Platzner_2018, place={Cham}, series={Lecture Notes in Computer Science}, title={Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes}, volume={10793}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-77610-1_6\">10.1007/978-3-319-77610-1_6</a>}, booktitle={Proceedings of the International Conference on Architecture of Computing Systems (ARCS)}, publisher={Springer International Publishing}, author={Lösch, Achim and Wiens, Alex and Platzner, Marco}, year={2018}, pages={73–84}, collection={Lecture Notes in Computer Science} }","short":"A. Lösch, A. Wiens, M. Platzner, in: Proceedings of the International Conference on Architecture of Computing Systems (ARCS), Springer International Publishing, Cham, 2018, pp. 73–84.","mla":"Lösch, Achim, et al. “Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes.” <i>Proceedings of the International Conference on Architecture of Computing Systems (ARCS)</i>, vol. 10793, Springer International Publishing, 2018, pp. 73–84, doi:<a href=\"https://doi.org/10.1007/978-3-319-77610-1_6\">10.1007/978-3-319-77610-1_6</a>."},"page":"73-84","intvolume":"     10793","place":"Cham","series_title":"Lecture Notes in Computer Science","user_id":"477","department":[{"_id":"78"}],"project":[{"name":"SFB 901 - Subproject C2","_id":"14"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901","_id":"1"}],"_id":"3362","file_date_updated":"2018-06-26T13:58:28Z","type":"conference","status":"public","date_created":"2018-06-26T13:47:52Z","publisher":"Springer International Publishing","title":"Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes","year":"2018","ddc":["040"],"publication":"Proceedings of the International Conference on Architecture of Computing Systems (ARCS)","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":1114026,"access_level":"closed","file_id":"3363","file_name":"loesch2017_arcs.pdf","date_updated":"2018-06-26T13:58:28Z","creator":"aloesch","date_created":"2018-06-26T13:58:28Z"}],"abstract":[{"lang":"eng","text":"Profiling applications on a heterogeneous compute node is challenging since the way to retrieve data from the resources and interpret them varies between resource types and manufacturers. This holds especially true for measuring the energy consumption. In this paper we present Ampehre, a novel open source measurement framework that allows developers to gather comparable measurements from heterogeneous compute nodes, e.g., nodes comprising CPU, GPU, and FPGA. We explain the architecture of Ampehre and detail the measurement process on the example of energy measurements on CPU and GPU. To characterize the probing effect, we quantitatively analyze the trade-off between the accuracy of measurements and the CPU load imposed by Ampehre. Based on this analysis, we are able to specify reasonable combinations of sampling periods for the different resource types of a compute node."}]},{"year":"2018","title":"An FPGA/HMC-Based Accelerator for Resolution Proof Checking","publisher":"Springer International Publishing","date_created":"2018-06-27T09:30:24Z","abstract":[{"lang":"eng","text":"Modern Boolean satisfiability solvers can emit proofs of unsatisfiability. There is substantial interest in being able to verify such proofs and also in using them for further computations. In this paper, we present an FPGA accelerator for checking resolution proofs, a popular proof format. Our accelerator exploits parallelism at the low level by implementing the basic resolution step in hardware, and at the high level by instantiating a number of parallel modules for proof checking. Since proof checking involves highly irregular memory accesses, we employ Hybrid Memory Cube technology for accelerator memory. The results show that while the accelerator is scalable and achieves speedups for all benchmark proofs, performance improvements are currently limited by the overhead of transitioning the proof into the accelerator memory."}],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"ups","date_created":"2018-11-02T13:55:07Z","date_updated":"2018-11-02T13:55:07Z","file_name":"AnFPGAHMC-BasedAcceleratorForR.pdf","file_id":"5257","access_level":"closed","file_size":612367}],"publication":"ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and Applications","ddc":["000"],"language":[{"iso":"eng"}],"citation":{"ama":"Hansmeier T, Platzner M, Andrews D. An FPGA/HMC-Based Accelerator for Resolution Proof Checking. In: <i>ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and Applications</i>. Vol 10824. Lecture Notes in Computer Science. Springer International Publishing; 2018:153-165. doi:<a href=\"https://doi.org/10.1007/978-3-319-78890-6_13\">10.1007/978-3-319-78890-6_13</a>","ieee":"T. Hansmeier, M. Platzner, and D. Andrews, “An FPGA/HMC-Based Accelerator for Resolution Proof Checking,” in <i>ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and Applications</i>, Santorini, Greece, 2018, vol. 10824, pp. 153–165.","chicago":"Hansmeier, Tim, Marco Platzner, and David Andrews. “An FPGA/HMC-Based Accelerator for Resolution Proof Checking.” In <i>ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and Applications</i>, 10824:153–65. Lecture Notes in Computer Science. Springer International Publishing, 2018. <a href=\"https://doi.org/10.1007/978-3-319-78890-6_13\">https://doi.org/10.1007/978-3-319-78890-6_13</a>.","apa":"Hansmeier, T., Platzner, M., &#38; Andrews, D. (2018). An FPGA/HMC-Based Accelerator for Resolution Proof Checking. In <i>ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and Applications</i> (Vol. 10824, pp. 153–165). Santorini, Greece: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-78890-6_13\">https://doi.org/10.1007/978-3-319-78890-6_13</a>","mla":"Hansmeier, Tim, et al. “An FPGA/HMC-Based Accelerator for Resolution Proof Checking.” <i>ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and Applications</i>, vol. 10824, Springer International Publishing, 2018, pp. 153–65, doi:<a href=\"https://doi.org/10.1007/978-3-319-78890-6_13\">10.1007/978-3-319-78890-6_13</a>.","bibtex":"@inproceedings{Hansmeier_Platzner_Andrews_2018, series={Lecture Notes in Computer Science}, title={An FPGA/HMC-Based Accelerator for Resolution Proof Checking}, volume={10824}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-78890-6_13\">10.1007/978-3-319-78890-6_13</a>}, booktitle={ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and Applications}, publisher={Springer International Publishing}, author={Hansmeier, Tim and Platzner, Marco and Andrews, David}, year={2018}, pages={153–165}, collection={Lecture Notes in Computer Science} }","short":"T. Hansmeier, M. Platzner, D. Andrews, in: ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and Applications, Springer International Publishing, 2018, pp. 153–165."},"page":"153-165","intvolume":"     10824","publication_status":"published","has_accepted_license":"1","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783319788890","9783319788906"]},"conference":{"name":"ARC: International Symposium on Applied Reconfigurable Computing","start_date":"2018-05-02","end_date":"2018-05-04","location":"Santorini, Greece"},"doi":"10.1007/978-3-319-78890-6_13","date_updated":"2022-01-06T06:59:13Z","author":[{"first_name":"Tim","orcid":"0000-0003-1377-3339","last_name":"Hansmeier","id":"49992","full_name":"Hansmeier, Tim"},{"last_name":"Platzner","full_name":"Platzner, Marco","id":"398","first_name":"Marco"},{"first_name":"David","last_name":"Andrews","full_name":"Andrews, David"}],"volume":10824,"status":"public","type":"conference","file_date_updated":"2018-11-02T13:55:07Z","project":[{"name":"SFB 901 - Subproject B4","_id":"12"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"3373","user_id":"3118","series_title":"Lecture Notes in Computer Science","department":[{"_id":"78"}]},{"page":"105-120","citation":{"ieee":"G. Schellhorn, M. Wedel, O. Travkin, J. König, and H. Wehrheim, “FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity,” in <i>Software Engineering and Formal Methods</i>, Cham: Springer International Publishing, 2018, pp. 105–120.","chicago":"Schellhorn, Gerhard, Monika Wedel, Oleg Travkin, Jürgen König, and Heike Wehrheim. “FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity.” In <i>Software Engineering and Formal Methods</i>, 105–20. Cham: Springer International Publishing, 2018. <a href=\"https://doi.org/10.1007/978-3-319-92970-5_7\">https://doi.org/10.1007/978-3-319-92970-5_7</a>.","ama":"Schellhorn G, Wedel M, Travkin O, König J, Wehrheim H. FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity. In: <i>Software Engineering and Formal Methods</i>. Cham: Springer International Publishing; 2018:105-120. doi:<a href=\"https://doi.org/10.1007/978-3-319-92970-5_7\">10.1007/978-3-319-92970-5_7</a>","mla":"Schellhorn, Gerhard, et al. “FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity.” <i>Software Engineering and Formal Methods</i>, Springer International Publishing, 2018, pp. 105–20, doi:<a href=\"https://doi.org/10.1007/978-3-319-92970-5_7\">10.1007/978-3-319-92970-5_7</a>.","short":"G. Schellhorn, M. Wedel, O. Travkin, J. König, H. Wehrheim, in: Software Engineering and Formal Methods, Springer International Publishing, Cham, 2018, pp. 105–120.","bibtex":"@inbook{Schellhorn_Wedel_Travkin_König_Wehrheim_2018, place={Cham}, title={FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-92970-5_7\">10.1007/978-3-319-92970-5_7</a>}, booktitle={Software Engineering and Formal Methods}, publisher={Springer International Publishing}, author={Schellhorn, Gerhard and Wedel, Monika and Travkin, Oleg and König, Jürgen and Wehrheim, Heike}, year={2018}, pages={105–120} }","apa":"Schellhorn, G., Wedel, M., Travkin, O., König, J., &#38; Wehrheim, H. (2018). FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity. In <i>Software Engineering and Formal Methods</i> (pp. 105–120). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-92970-5_7\">https://doi.org/10.1007/978-3-319-92970-5_7</a>"},"year":"2018","place":"Cham","publication_identifier":{"isbn":["9783319929699","9783319929705"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","doi":"10.1007/978-3-319-92970-5_7","title":"FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity","date_created":"2018-07-11T06:19:58Z","author":[{"first_name":"Gerhard","full_name":"Schellhorn, Gerhard","last_name":"Schellhorn"},{"full_name":"Wedel, Monika","last_name":"Wedel","first_name":"Monika"},{"first_name":"Oleg","full_name":"Travkin, Oleg","last_name":"Travkin"},{"first_name":"Jürgen","last_name":"König","full_name":"König, Jürgen","id":"22358"},{"first_name":"Heike","full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim"}],"date_updated":"2022-01-06T06:59:22Z","publisher":"Springer International Publishing","status":"public","publication":"Software Engineering and Formal Methods","type":"book_chapter","department":[{"_id":"77"}],"user_id":"29719","_id":"3536","project":[{"_id":"78","name":"Validation of Software Transactional Memory"}]},{"publication":"Theoretical Aspects of Computing – ICTAC 2018","file":[{"file_size":518016,"file_name":"Töws-Wehrheim2018_Chapter_InformationFlowCertificates.pdf","file_id":"5837","access_level":"closed","date_updated":"2018-11-26T15:11:32Z","creator":"mtoews","date_created":"2018-11-26T15:11:32Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"abstract":[{"text":"Information flow analysis investigates the flow of data in applications, checking in particular for flows from private sources to public sinks. Flow- and path-sensitive analyses are, however, often too costly to be performed every time a security-critical application is run. In this paper, we propose a variant of proof carrying code for information flow security. To this end, we develop information flow (IF) certificates which get attached to programs as well as a method for IF certificate validation. We prove soundness of our technique, i.e., show it to be tamper-free. The technique is implemented within the program analysis tool CPAchecker. Our experiments confirm that the use of certificates pays off for costly analysis runs.","lang":"eng"}],"language":[{"iso":"eng"}],"ddc":["000"],"year":"2018","date_created":"2018-11-21T09:51:37Z","publisher":"Springer International Publishing","title":"Information Flow Certificates","type":"conference","status":"public","department":[{"_id":"77"}],"user_id":"477","_id":"5774","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"12","name":"SFB 901 - Subproject B4"}],"file_date_updated":"2018-11-26T15:11:32Z","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030025076","9783030025083"]},"has_accepted_license":"1","publication_status":"published","page":"435-454","citation":{"apa":"Töws, M., &#38; Wehrheim, H. (2018). Information Flow Certificates. In <i>Theoretical Aspects of Computing – ICTAC 2018</i> (pp. 435–454). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-030-02508-3_23\">https://doi.org/10.1007/978-3-030-02508-3_23</a>","short":"M. Töws, H. Wehrheim, in: Theoretical Aspects of Computing – ICTAC 2018, Springer International Publishing, Cham, 2018, pp. 435–454.","bibtex":"@inproceedings{Töws_Wehrheim_2018, place={Cham}, title={Information Flow Certificates}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-02508-3_23\">10.1007/978-3-030-02508-3_23</a>}, booktitle={Theoretical Aspects of Computing – ICTAC 2018}, publisher={Springer International Publishing}, author={Töws, Manuel and Wehrheim, Heike}, year={2018}, pages={435–454} }","mla":"Töws, Manuel, and Heike Wehrheim. “Information Flow Certificates.” <i>Theoretical Aspects of Computing – ICTAC 2018</i>, Springer International Publishing, 2018, pp. 435–54, doi:<a href=\"https://doi.org/10.1007/978-3-030-02508-3_23\">10.1007/978-3-030-02508-3_23</a>.","ama":"Töws M, Wehrheim H. Information Flow Certificates. In: <i>Theoretical Aspects of Computing – ICTAC 2018</i>. Cham: Springer International Publishing; 2018:435-454. doi:<a href=\"https://doi.org/10.1007/978-3-030-02508-3_23\">10.1007/978-3-030-02508-3_23</a>","chicago":"Töws, Manuel, and Heike Wehrheim. “Information Flow Certificates.” In <i>Theoretical Aspects of Computing – ICTAC 2018</i>, 435–54. Cham: Springer International Publishing, 2018. <a href=\"https://doi.org/10.1007/978-3-030-02508-3_23\">https://doi.org/10.1007/978-3-030-02508-3_23</a>.","ieee":"M. Töws and H. Wehrheim, “Information Flow Certificates,” in <i>Theoretical Aspects of Computing – ICTAC 2018</i>, 2018, pp. 435–454."},"place":"Cham","author":[{"first_name":"Manuel","id":"11315","full_name":"Töws, Manuel","last_name":"Töws"},{"last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573","first_name":"Heike"}],"date_updated":"2022-01-06T07:02:40Z","doi":"10.1007/978-3-030-02508-3_23"},{"publication_status":"published","publication_identifier":{"isbn":["9783319917962","9783319917979"],"issn":["0302-9743","1611-3349"]},"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} }","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.","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>.","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>","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>","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.","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>."},"page":"758-770","intvolume":"     10918","place":"Cham","author":[{"last_name":"Senft","full_name":"Senft, Björn","id":"9109","first_name":"Björn"},{"first_name":"Holger Gerhard","id":"30457","full_name":"Fischer, Holger Gerhard","last_name":"Fischer"},{"first_name":"Simon","id":"383","full_name":"Oberthür, Simon","last_name":"Oberthür"},{"first_name":"Nitish","full_name":"Patkar, Nitish","last_name":"Patkar"}],"volume":10918,"date_updated":"2022-01-06T07:02:58Z","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"},"doi":"10.1007/978-3-319-91797-9_52","type":"book_chapter","status":"public","series_title":"Lecture Notes in Computer Science","user_id":"30457","department":[{"_id":"66"},{"_id":"534"},{"_id":"221"}],"_id":"6253","year":"2018","date_created":"2018-12-18T10:37:41Z","publisher":"Springer International Publishing","title":"Assist Users to Straightaway Suggest and Describe Experienced Problems","publication":"Design, User Experience, and Usability: Theory and Practice","language":[{"iso":"eng"}]},{"type":"book_chapter","status":"public","editor":[{"first_name":"Aaron","last_name":"Marcus","full_name":"Marcus, Aaron"},{"first_name":"Wentao","last_name":"Wang","full_name":"Wang, Wentao"}],"department":[{"_id":"66"},{"_id":"534"},{"_id":"221"}],"user_id":"30457","series_title":"Lecture Notes in Computer Science","_id":"6254","publication_identifier":{"isbn":["9783319917962","9783319917979"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","intvolume":"     10918","page":"711-724","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>.","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.","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} }","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>","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.","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>."},"place":"Cham","volume":10918,"author":[{"last_name":"Fischer","full_name":"Fischer, Holger Gerhard","id":"30457","first_name":"Holger Gerhard"},{"last_name":"Senft","full_name":"Senft, Björn","id":"9109","first_name":"Björn"},{"id":"5281","full_name":"Rittmeier, Florian","last_name":"Rittmeier","first_name":"Florian"},{"last_name":"Sauer","full_name":"Sauer, Stefan","id":"447","first_name":"Stefan"}],"date_updated":"2022-01-06T07:02:58Z","doi":"10.1007/978-3-319-91797-9_49","conference":{"location":"Las Vegas, USA","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"},"publication":"Design, User Experience, and Usability: Theory and Practice. Proceedings of the 20th International Conference on Human-Computer Interaktion (HCI International 2018)","language":[{"iso":"eng"}],"year":"2018","date_created":"2018-12-18T10:42:39Z","publisher":"Springer International Publishing","title":"A Canvas Method to Foster Interdisciplinary Discussions on Digital Assistance Systems"},{"ddc":["000"],"language":[{"iso":"eng"}],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":458972,"file_name":"Schäfer-Hüllermeier2018_Chapter_Preference-BasedReinforcementL.pdf","access_level":"closed","file_id":"6623","date_updated":"2019-01-11T11:03:50Z","creator":"ups","date_created":"2019-01-11T11:03:50Z"}],"publication":"Discovery Science","title":"Preference-Based Reinforcement Learning Using Dyad Ranking","publisher":"Springer International Publishing","date_created":"2018-12-20T15:52:03Z","year":"2018","file_date_updated":"2019-01-11T11:03:50Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"10","name":"SFB 901 - Subproject B2"}],"_id":"6423","user_id":"49109","department":[{"_id":"355"}],"status":"public","type":"book_chapter","doi":"10.1007/978-3-030-01771-2_11","date_updated":"2022-01-06T07:03:04Z","author":[{"last_name":"Schäfer","full_name":"Schäfer, Dirk","first_name":"Dirk"},{"first_name":"Eyke","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","id":"48129"}],"place":"Cham","citation":{"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>","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>.","short":"D. Schäfer, E. Hüllermeier, in: Discovery Science, Springer International Publishing, Cham, 2018, pp. 161–175.","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} }","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>.","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.","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>"},"page":"161-175","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030017705","9783030017712"]},"has_accepted_license":"1"},{"status":"public","publication":"Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications","type":"book_chapter","language":[{"iso":"eng"}],"_id":"16392","department":[{"_id":"63"}],"user_id":"15415","year":"2018","place":"Cham","citation":{"apa":"Feldkord, B., Malatyali, M., &#38; Meyer auf der Heide, F. (2018). A Dynamic Distributed Data Structure for Top-k and k-Select Queries. In <i>Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications</i>. Cham. <a href=\"https://doi.org/10.1007/978-3-319-98355-4_18\">https://doi.org/10.1007/978-3-319-98355-4_18</a>","mla":"Feldkord, Björn, et al. “A Dynamic Distributed Data Structure for Top-k and k-Select Queries.” <i>Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications</i>, 2018, doi:<a href=\"https://doi.org/10.1007/978-3-319-98355-4_18\">10.1007/978-3-319-98355-4_18</a>.","bibtex":"@inbook{Feldkord_Malatyali_Meyer auf der Heide_2018, place={Cham}, title={A Dynamic Distributed Data Structure for Top-k and k-Select Queries}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-98355-4_18\">10.1007/978-3-319-98355-4_18</a>}, booktitle={Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications}, author={Feldkord, Björn and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2018} }","short":"B. Feldkord, M. Malatyali, F. Meyer auf der Heide, in: Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications, Cham, 2018.","ama":"Feldkord B, Malatyali M, Meyer auf der Heide F. A Dynamic Distributed Data Structure for Top-k and k-Select Queries. In: <i>Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications</i>. Cham; 2018. doi:<a href=\"https://doi.org/10.1007/978-3-319-98355-4_18\">10.1007/978-3-319-98355-4_18</a>","ieee":"B. Feldkord, M. Malatyali, and F. Meyer auf der Heide, “A Dynamic Distributed Data Structure for Top-k and k-Select Queries,” in <i>Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications</i>, Cham, 2018.","chicago":"Feldkord, Björn, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “A Dynamic Distributed Data Structure for Top-k and k-Select Queries.” In <i>Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications</i>. Cham, 2018. <a href=\"https://doi.org/10.1007/978-3-319-98355-4_18\">https://doi.org/10.1007/978-3-319-98355-4_18</a>."},"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783319125671","9783319125688"]},"publication_status":"published","title":"A Dynamic Distributed Data Structure for Top-k and k-Select Queries","doi":"10.1007/978-3-319-98355-4_18","date_updated":"2022-01-06T06:52:50Z","date_created":"2020-04-03T07:04:59Z","author":[{"last_name":"Feldkord","id":"22704","full_name":"Feldkord, Björn","first_name":"Björn"},{"first_name":"Manuel","last_name":"Malatyali","full_name":"Malatyali, Manuel"},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}]},{"author":[{"first_name":"Yara","last_name":"Khaluf","full_name":"Khaluf, Yara"},{"first_name":"Christine","last_name":"Markarian","full_name":"Markarian, Christine"},{"first_name":"Pieter","last_name":"Simoens","full_name":"Simoens, Pieter"},{"last_name":"Reina","full_name":"Reina, Andreagiovanni","first_name":"Andreagiovanni"}],"date_created":"2021-09-14T12:41:58Z","date_updated":"2022-01-06T06:56:19Z","doi":"10.1007/978-3-319-59930-4_12","title":"Scheduling Access to Shared Space in Multi-robot Systems","publication_identifier":{"issn":["0302-9743","1611-3349"]},"publication_status":"published","citation":{"apa":"Khaluf, Y., Markarian, C., Simoens, P., &#38; Reina, A. (2017). Scheduling Access to Shared Space in Multi-robot Systems. <i>International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017)</i>. <a href=\"https://doi.org/10.1007/978-3-319-59930-4_12\">https://doi.org/10.1007/978-3-319-59930-4_12</a>","short":"Y. Khaluf, C. Markarian, P. Simoens, A. Reina, in: International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017), Cham, 2017.","bibtex":"@inproceedings{Khaluf_Markarian_Simoens_Reina_2017, place={Cham}, title={Scheduling Access to Shared Space in Multi-robot Systems}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-59930-4_12\">10.1007/978-3-319-59930-4_12</a>}, booktitle={International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017)}, author={Khaluf, Yara and Markarian, Christine and Simoens, Pieter and Reina, Andreagiovanni}, year={2017} }","mla":"Khaluf, Yara, et al. “Scheduling Access to Shared Space in Multi-Robot Systems.” <i>International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017)</i>, 2017, doi:<a href=\"https://doi.org/10.1007/978-3-319-59930-4_12\">10.1007/978-3-319-59930-4_12</a>.","ieee":"Y. Khaluf, C. Markarian, P. Simoens, and A. Reina, “Scheduling Access to Shared Space in Multi-robot Systems,” 2017, doi: <a href=\"https://doi.org/10.1007/978-3-319-59930-4_12\">10.1007/978-3-319-59930-4_12</a>.","chicago":"Khaluf, Yara, Christine Markarian, Pieter Simoens, and Andreagiovanni Reina. “Scheduling Access to Shared Space in Multi-Robot Systems.” In <i>International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017)</i>. Cham, 2017. <a href=\"https://doi.org/10.1007/978-3-319-59930-4_12\">https://doi.org/10.1007/978-3-319-59930-4_12</a>.","ama":"Khaluf Y, Markarian C, Simoens P, Reina A. Scheduling Access to Shared Space in Multi-robot Systems. In: <i>International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017)</i>. ; 2017. doi:<a href=\"https://doi.org/10.1007/978-3-319-59930-4_12\">10.1007/978-3-319-59930-4_12</a>"},"year":"2017","place":"Cham","department":[{"_id":"63"}],"user_id":"15415","_id":"24398","language":[{"iso":"eng"}],"publication":"International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017)","type":"conference","status":"public","abstract":[{"lang":"eng","text":"Through this study, we introduce the idea of applying scheduling techniques to allocate spatial resources that are shared among multiple robots moving in a static environment and having temporal constraints on the arrival time to destinations. To illustrate this idea, we present an exemplified algorithm that plans and assigns a motion path to each robot. The considered problem is particularly challenging because: (i) the robots share the same environment and thus the planner must take into account overlapping paths which cannot happen at the same time; (ii) there are time deadlines thus the planner must deal with temporal constraints; (iii) new requests arrive without a priori knowledge thus the planner must be able to add new paths online and adjust old plans; (iv) the robot motion is subject to noise thus the planner must be reactive to adapt to online changes. We showcase the functioning of the proposed algorithm through a set of agent-based simulations."}]},{"date_updated":"2022-01-06T06:58:49Z","oa":"1","author":[{"first_name":"Johannes","id":"23","full_name":"Blömer, Johannes","last_name":"Blömer"},{"last_name":"Liske","full_name":"Liske, Gennadij","first_name":"Gennadij"}],"volume":10693,"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2017/453.pdf"}],"doi":"10.1007/978-3-319-72453-9_35","publication_status":"published","publication_identifier":{"isbn":["9783319724522","9783319724539"],"issn":["0302-9743","1611-3349"]},"has_accepted_license":"1","place":"Cham","citation":{"apa":"Blömer, J., &#38; Liske, G. (2017). Subtleties in Security Definitions for Predicate Encryption with Public Index. In <i>Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS)</i> (Vol. 10693, pp. 438–453). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-72453-9_35\">https://doi.org/10.1007/978-3-319-72453-9_35</a>","short":"J. Blömer, G. Liske, in: Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS), Springer International Publishing, Cham, 2017, pp. 438–453.","bibtex":"@inproceedings{Blömer_Liske_2017, place={Cham}, series={Lecture Notes in Computer Science}, title={Subtleties in Security Definitions for Predicate Encryption with Public Index}, volume={10693}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-72453-9_35\">10.1007/978-3-319-72453-9_35</a>}, booktitle={Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS)}, publisher={Springer International Publishing}, author={Blömer, Johannes and Liske, Gennadij}, year={2017}, pages={438–453}, collection={Lecture Notes in Computer Science} }","mla":"Blömer, Johannes, and Gennadij Liske. “Subtleties in Security Definitions for Predicate Encryption with Public Index.” <i>Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS)</i>, vol. 10693, Springer International Publishing, 2017, pp. 438–53, doi:<a href=\"https://doi.org/10.1007/978-3-319-72453-9_35\">10.1007/978-3-319-72453-9_35</a>.","chicago":"Blömer, Johannes, and Gennadij Liske. “Subtleties in Security Definitions for Predicate Encryption with Public Index.” In <i>Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS)</i>, 10693:438–53. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2017. <a href=\"https://doi.org/10.1007/978-3-319-72453-9_35\">https://doi.org/10.1007/978-3-319-72453-9_35</a>.","ieee":"J. Blömer and G. Liske, “Subtleties in Security Definitions for Predicate Encryption with Public Index,” in <i>Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS)</i>, 2017, vol. 10693, pp. 438–453.","ama":"Blömer J, Liske G. Subtleties in Security Definitions for Predicate Encryption with Public Index. In: <i>Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS)</i>. Vol 10693. Lecture Notes in Computer Science. Cham: Springer International Publishing; 2017:438-453. doi:<a href=\"https://doi.org/10.1007/978-3-319-72453-9_35\">10.1007/978-3-319-72453-9_35</a>"},"intvolume":"     10693","page":"438-453","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"_id":"2967","series_title":"Lecture Notes in Computer Science","user_id":"477","department":[{"_id":"64"}],"file_date_updated":"2018-11-02T14:52:10Z","type":"conference","status":"public","publisher":"Springer International Publishing","date_created":"2018-06-04T12:17:48Z","title":"Subtleties in Security Definitions for Predicate Encryption with Public Index","year":"2017","ddc":["000"],"language":[{"iso":"eng"}],"publication":"Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS)","file":[{"file_id":"5286","access_level":"closed","file_name":"SubtletiesInSecurityDefinition.pdf","file_size":463904,"creator":"ups","date_created":"2018-11-02T14:52:10Z","date_updated":"2018-11-02T14:52:10Z","relation":"main_file","success":1,"content_type":"application/pdf"}]},{"type":"conference","status":"public","_id":"2344","project":[{"_id":"13","name":"SFB 901 - Subproject C1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"1","name":"SFB 901"},{"_id":"43","name":"Securing the Financial Cloud"}],"department":[{"_id":"64"}],"user_id":"13703","file_date_updated":"2018-11-08T09:53:34Z","has_accepted_license":"1","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783319756493","9783319756509"]},"publication_status":"published","place":"Cham","page":"3-17","citation":{"apa":"Blömer, J., Günther, P., Krummel, V., &#38; Löken, N. (2017). Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations. In <i>Foundations and Practice of Security</i> (pp. 3–17). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-75650-9_1\">https://doi.org/10.1007/978-3-319-75650-9_1</a>","mla":"Blömer, Johannes, et al. “Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations.” <i>Foundations and Practice of Security</i>, Springer International Publishing, 2017, pp. 3–17, doi:<a href=\"https://doi.org/10.1007/978-3-319-75650-9_1\">10.1007/978-3-319-75650-9_1</a>.","short":"J. Blömer, P. Günther, V. Krummel, N. Löken, in: Foundations and Practice of Security, Springer International Publishing, Cham, 2017, pp. 3–17.","bibtex":"@inproceedings{Blömer_Günther_Krummel_Löken_2017, place={Cham}, title={Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-75650-9_1\">10.1007/978-3-319-75650-9_1</a>}, booktitle={Foundations and Practice of Security}, publisher={Springer International Publishing}, author={Blömer, Johannes and Günther, Peter and Krummel, Volker and Löken, Nils}, year={2017}, pages={3–17} }","chicago":"Blömer, Johannes, Peter Günther, Volker Krummel, and Nils Löken. “Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations.” In <i>Foundations and Practice of Security</i>, 3–17. Cham: Springer International Publishing, 2017. <a href=\"https://doi.org/10.1007/978-3-319-75650-9_1\">https://doi.org/10.1007/978-3-319-75650-9_1</a>.","ieee":"J. Blömer, P. Günther, V. Krummel, and N. Löken, “Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations,” in <i>Foundations and Practice of Security</i>, 2017, pp. 3–17.","ama":"Blömer J, Günther P, Krummel V, Löken N. Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations. In: <i>Foundations and Practice of Security</i>. Cham: Springer International Publishing; 2017:3-17. doi:<a href=\"https://doi.org/10.1007/978-3-319-75650-9_1\">10.1007/978-3-319-75650-9_1</a>"},"date_updated":"2022-01-06T06:55:55Z","oa":"1","author":[{"last_name":"Blömer","id":"23","full_name":"Blömer, Johannes","first_name":"Johannes"},{"first_name":"Peter","last_name":"Günther","full_name":"Günther, Peter"},{"full_name":"Krummel, Volker","last_name":"Krummel","first_name":"Volker"},{"last_name":"Löken","id":"13703","full_name":"Löken, Nils","first_name":"Nils"}],"doi":"10.1007/978-3-319-75650-9_1","publication":"Foundations and Practice of Security","file":[{"file_size":634736,"access_level":"closed","file_id":"5292","file_name":"Attribute-BasedEncryptionAsASe.pdf","date_updated":"2018-11-02T15:04:13Z","date_created":"2018-11-02T15:04:13Z","creator":"ups","success":1,"relation":"main_file","content_type":"application/pdf"},{"date_updated":"2018-11-08T09:53:34Z","creator":"nilo","date_created":"2018-11-08T09:53:34Z","file_size":522516,"file_name":"abe_aas.pdf","file_id":"5425","access_level":"open_access","content_type":"application/pdf","relation":"main_file"}],"ddc":["000"],"language":[{"iso":"eng"}],"year":"2017","publisher":"Springer International Publishing","date_created":"2018-04-13T11:40:48Z","title":"Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations"},{"author":[{"first_name":"Sascha","full_name":"Brauer, Sascha","id":"13291","last_name":"Brauer"}],"volume":10236,"date_updated":"2022-01-06T06:56:00Z","conference":{"name":"10th International Conference on Algorithms and Complexity","start_date":"2017-05-24","end_date":"2017-05-26","location":"Athens, Greece"},"doi":"10.1007/978-3-319-57586-5_11","publication_status":"published","publication_identifier":{"isbn":["9783319575858","9783319575865"],"issn":["0302-9743","1611-3349"]},"citation":{"ama":"Brauer S. Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems. In: Fotakis D, Pagourtzis A, Paschos VT, eds. <i>Lecture Notes in Computer Science</i>. Vol 10236. Cham: Springer International Publishing; 2017:116-127. doi:<a href=\"https://doi.org/10.1007/978-3-319-57586-5_11\">10.1007/978-3-319-57586-5_11</a>","ieee":"S. Brauer, “Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems,” in <i>Lecture Notes in Computer Science</i>, vol. 10236, D. Fotakis, A. Pagourtzis, and V. T. Paschos, Eds. Cham: Springer International Publishing, 2017, pp. 116–127.","chicago":"Brauer, Sascha. “Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems.” In <i>Lecture Notes in Computer Science</i>, edited by Dimitris Fotakis, Aris Pagourtzis, and Vangelis Th. Paschos, 10236:116–27. Cham: Springer International Publishing, 2017. <a href=\"https://doi.org/10.1007/978-3-319-57586-5_11\">https://doi.org/10.1007/978-3-319-57586-5_11</a>.","bibtex":"@inbook{Brauer_2017, place={Cham}, title={Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems}, volume={10236}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-57586-5_11\">10.1007/978-3-319-57586-5_11</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer International Publishing}, author={Brauer, Sascha}, editor={Fotakis, Dimitris and Pagourtzis, Aris and Paschos, Vangelis Th.Editors}, year={2017}, pages={116–127} }","mla":"Brauer, Sascha. “Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems.” <i>Lecture Notes in Computer Science</i>, edited by Dimitris Fotakis et al., vol. 10236, Springer International Publishing, 2017, pp. 116–27, doi:<a href=\"https://doi.org/10.1007/978-3-319-57586-5_11\">10.1007/978-3-319-57586-5_11</a>.","short":"S. Brauer, in: D. Fotakis, A. Pagourtzis, V.T. Paschos (Eds.), Lecture Notes in Computer Science, Springer International Publishing, Cham, 2017, pp. 116–127.","apa":"Brauer, S. (2017). Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems. In D. Fotakis, A. Pagourtzis, &#38; V. T. Paschos (Eds.), <i>Lecture Notes in Computer Science</i> (Vol. 10236, pp. 116–127). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-57586-5_11\">https://doi.org/10.1007/978-3-319-57586-5_11</a>"},"intvolume":"     10236","page":"116-127","place":"Cham","user_id":"13291","department":[{"_id":"64"}],"_id":"2381","type":"book_chapter","status":"public","editor":[{"first_name":"Dimitris","last_name":"Fotakis","full_name":"Fotakis, Dimitris"},{"full_name":"Pagourtzis, Aris","last_name":"Pagourtzis","first_name":"Aris"},{"first_name":"Vangelis Th.","last_name":"Paschos","full_name":"Paschos, Vangelis Th."}],"date_created":"2018-04-17T12:20:53Z","publisher":"Springer International Publishing","title":"Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems","year":"2017","language":[{"iso":"eng"}],"publication":"Lecture Notes in Computer Science","abstract":[{"lang":"eng","text":"Metric facility location and K-means are well-known problems of combinatorial optimization. Both admit a fairly simple heuristic called single-swap, which adds, drops or swaps open facilities until it reaches a local optimum. For both problems, it is known that this algorithm produces a solution that is at most a constant factor worse than the respective global optimum. In this paper, we show that single-swap applied to the weighted metric uncapacitated facility location and weighted discrete K-means problem is tightly PLS-complete and hence has exponential worst-case running time."}]}]