[{"citation":{"ieee":"M. Alptekin and K. Temmen, “Effectiveness Study of an Augmented Reality App as Preparation Tool for Electrical Engineering Laboratory Courses,” in <i>Smart Technologies for a Sustainable Future</i>, vol. 1027, M. E. Auer, R. Langmann, D. May, and K. Roos, Eds. Cham: Springer Nature Switzerland, 2024, pp. 297–304.","apa":"Alptekin, M., &#38; Temmen, K. (2024). Effectiveness Study of an Augmented Reality App as Preparation Tool for Electrical Engineering Laboratory Courses. In M. E. Auer, R. Langmann, D. May, &#38; K. Roos (Eds.), <i>Smart Technologies for a Sustainable Future</i> (Vol. 1027, pp. 297–304). Springer Nature Switzerland. <a href=\"https://doi.org/10.1007/978-3-031-61891-8_29\">https://doi.org/10.1007/978-3-031-61891-8_29</a>","mla":"Alptekin, Mesut, and Katrin Temmen. “Effectiveness Study of an Augmented Reality App as Preparation Tool for Electrical Engineering Laboratory Courses.” <i>Smart Technologies for a Sustainable Future</i>, edited by Michael E. Auer et al., vol. 1027, Springer Nature Switzerland, 2024, pp. 297–304, doi:<a href=\"https://doi.org/10.1007/978-3-031-61891-8_29\">10.1007/978-3-031-61891-8_29</a>.","bibtex":"@inbook{Alptekin_Temmen_2024, place={Cham}, title={Effectiveness Study of an Augmented Reality App as Preparation Tool for Electrical Engineering Laboratory Courses}, volume={1027}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-61891-8_29\">10.1007/978-3-031-61891-8_29</a>}, booktitle={Smart Technologies for a Sustainable Future}, publisher={Springer Nature Switzerland}, author={Alptekin, Mesut and Temmen, Katrin}, editor={Auer, Michael E. and Langmann, Reinhard and May, Dominik and Roos, Kim}, year={2024}, pages={297–304} }","short":"M. Alptekin, K. Temmen, in: M.E. Auer, R. Langmann, D. May, K. Roos (Eds.), Smart Technologies for a Sustainable Future, Springer Nature Switzerland, Cham, 2024, pp. 297–304.","ama":"Alptekin M, Temmen K. Effectiveness Study of an Augmented Reality App as Preparation Tool for Electrical Engineering Laboratory Courses. In: Auer ME, Langmann R, May D, Roos K, eds. <i>Smart Technologies for a Sustainable Future</i>. Vol 1027. Springer Nature Switzerland; 2024:297–304. doi:<a href=\"https://doi.org/10.1007/978-3-031-61891-8_29\">10.1007/978-3-031-61891-8_29</a>","chicago":"Alptekin, Mesut, and Katrin Temmen. “Effectiveness Study of an Augmented Reality App as Preparation Tool for Electrical Engineering Laboratory Courses.” In <i>Smart Technologies for a Sustainable Future</i>, edited by Michael E. Auer, Reinhard Langmann, Dominik May, and Kim Roos, 1027:297–304. Cham: Springer Nature Switzerland, 2024. <a href=\"https://doi.org/10.1007/978-3-031-61891-8_29\">https://doi.org/10.1007/978-3-031-61891-8_29</a>."},"project":[{"_id":"1387","name":"DigiSelF - Digitalisierung als Herausforderung und Innovation in der Hochschullehre"}],"place":"Cham","status":"public","publisher":"Springer Nature Switzerland","_id":"57863","page":"297–304","volume":1027,"editor":[{"last_name":"Auer","first_name":"Michael E.","full_name":"Auer, Michael E."},{"last_name":"Langmann","first_name":"Reinhard","full_name":"Langmann, Reinhard"},{"last_name":"May","first_name":"Dominik","full_name":"May, Dominik"},{"last_name":"Roos","first_name":"Kim","full_name":"Roos, Kim"}],"user_id":"11763","publication":"Smart Technologies for a Sustainable Future","date_created":"2024-12-29T11:03:09Z","department":[{"_id":"34"},{"_id":"300"}],"type":"book_chapter","author":[{"full_name":"Alptekin, Mesut","last_name":"Alptekin","orcid":"0009-0004-8545-1165","first_name":"Mesut","id":"11763"},{"first_name":"Katrin","last_name":"Temmen","full_name":"Temmen, Katrin","id":"30086"}],"publication_identifier":{"isbn":["978-3-031-61890-1 978-3-031-61891-8"]},"title":"Effectiveness Study of an Augmented Reality App as Preparation Tool for Electrical Engineering Laboratory Courses","year":"2024","intvolume":"      1027","date_updated":"2025-08-19T08:50:21Z","language":[{"iso":"eng"}],"doi":"10.1007/978-3-031-61891-8_29"},{"citation":{"mla":"Knorr, Lukas, et al. “Flexible Operation and Integration of High-Temperature Heat Pumps Using Large Temperature Glides.” <i>Applied Energy</i>, vol. 368, 123417, Elsevier BV, 2024, doi:<a href=\"https://doi.org/10.1016/j.apenergy.2024.123417\">10.1016/j.apenergy.2024.123417</a>.","bibtex":"@article{Knorr_Schlosser_Horstmann_Divkovic_Meschede_2024, title={Flexible operation and integration of high-temperature heat pumps using large temperature glides}, volume={368}, DOI={<a href=\"https://doi.org/10.1016/j.apenergy.2024.123417\">10.1016/j.apenergy.2024.123417</a>}, number={123417}, journal={Applied Energy}, publisher={Elsevier BV}, author={Knorr, Lukas and Schlosser, Florian and Horstmann, Nils and Divkovic, Denis and Meschede, Henning}, year={2024} }","ama":"Knorr L, Schlosser F, Horstmann N, Divkovic D, Meschede H. Flexible operation and integration of high-temperature heat pumps using large temperature glides. <i>Applied Energy</i>. 2024;368. doi:<a href=\"https://doi.org/10.1016/j.apenergy.2024.123417\">10.1016/j.apenergy.2024.123417</a>","ieee":"L. Knorr, F. Schlosser, N. Horstmann, D. Divkovic, and H. Meschede, “Flexible operation and integration of high-temperature heat pumps using large temperature glides,” <i>Applied Energy</i>, vol. 368, Art. no. 123417, 2024, doi: <a href=\"https://doi.org/10.1016/j.apenergy.2024.123417\">10.1016/j.apenergy.2024.123417</a>.","apa":"Knorr, L., Schlosser, F., Horstmann, N., Divkovic, D., &#38; Meschede, H. (2024). Flexible operation and integration of high-temperature heat pumps using large temperature glides. <i>Applied Energy</i>, <i>368</i>, Article 123417. <a href=\"https://doi.org/10.1016/j.apenergy.2024.123417\">https://doi.org/10.1016/j.apenergy.2024.123417</a>","chicago":"Knorr, Lukas, Florian Schlosser, Nils Horstmann, Denis Divkovic, and Henning Meschede. “Flexible Operation and Integration of High-Temperature Heat Pumps Using Large Temperature Glides.” <i>Applied Energy</i> 368 (2024). <a href=\"https://doi.org/10.1016/j.apenergy.2024.123417\">https://doi.org/10.1016/j.apenergy.2024.123417</a>.","short":"L. Knorr, F. Schlosser, N. Horstmann, D. Divkovic, H. Meschede, Applied Energy 368 (2024)."},"publication":"Applied Energy","department":[{"_id":"644"}],"type":"journal_article","date_created":"2024-05-27T10:29:14Z","intvolume":"       368","publication_status":"published","date_updated":"2025-09-03T12:21:47Z","publication_identifier":{"issn":["0306-2619"]},"author":[{"id":"90391","last_name":"Knorr","first_name":"Lukas","full_name":"Knorr, Lukas"},{"id":"88614","full_name":"Schlosser, Florian","last_name":"Schlosser","first_name":"Florian"},{"full_name":"Horstmann, Nils","last_name":"Horstmann","first_name":"Nils"},{"full_name":"Divkovic, Denis","first_name":"Denis","last_name":"Divkovic","id":"89059"},{"id":"86954","full_name":"Meschede, Henning","first_name":"Henning","last_name":"Meschede","orcid":"0000-0002-1538-089X"}],"title":"Flexible operation and integration of high-temperature heat pumps using large temperature glides","status":"public","year":"2024","volume":368,"user_id":"90391","doi":"10.1016/j.apenergy.2024.123417","language":[{"iso":"eng"}],"_id":"54459","publisher":"Elsevier BV","article_number":"123417"},{"user_id":"15458","editor":[{"full_name":"Balzarotti, Davide","first_name":"Davide","last_name":"Balzarotti"},{"last_name":"Xu","first_name":"Wenyuan","full_name":"Xu, Wenyuan"}],"language":[{"iso":"eng"}],"_id":"55637","publisher":"USENIX Association","date_updated":"2025-09-04T11:19:24Z","status":"public","year":"2024","title":"Exploring digital security and privacy in relative poverty in Germany through qualitative interviews","author":[{"full_name":"Kostan, Anastassija","first_name":"Anastassija","last_name":"Kostan"},{"last_name":"Olschar","first_name":"Sara","full_name":"Olschar, Sara"},{"full_name":"Simko, Lucy","first_name":"Lucy","last_name":"Simko"},{"id":"94636","last_name":"Acar","first_name":"Yasemin","full_name":"Acar, Yasemin"}],"type":"conference","department":[{"_id":"740"}],"date_created":"2024-08-19T08:27:57Z","publication":"33rd USENIX Security Symposium, USENIX Security 2024, Philadelphia, PA, USA, August 14-16, 2024","citation":{"ama":"Kostan A, Olschar S, Simko L, Acar Y. Exploring digital security and privacy in relative poverty in Germany through qualitative interviews. In: Balzarotti D, Xu W, eds. <i>33rd USENIX Security Symposium, USENIX Security 2024, Philadelphia, PA, USA, August 14-16, 2024</i>. USENIX Association; 2024.","bibtex":"@inproceedings{Kostan_Olschar_Simko_Acar_2024, title={Exploring digital security and privacy in relative poverty in Germany through qualitative interviews}, booktitle={33rd USENIX Security Symposium, USENIX Security 2024, Philadelphia, PA, USA, August 14-16, 2024}, publisher={USENIX Association}, author={Kostan, Anastassija and Olschar, Sara and Simko, Lucy and Acar, Yasemin}, editor={Balzarotti, Davide and Xu, Wenyuan}, year={2024} }","mla":"Kostan, Anastassija, et al. “Exploring Digital Security and Privacy in Relative Poverty in Germany through Qualitative Interviews.” <i>33rd USENIX Security Symposium, USENIX Security 2024, Philadelphia, PA, USA, August 14-16, 2024</i>, edited by Davide Balzarotti and Wenyuan Xu, USENIX Association, 2024.","short":"A. Kostan, S. Olschar, L. Simko, Y. Acar, in: D. Balzarotti, W. Xu (Eds.), 33rd USENIX Security Symposium, USENIX Security 2024, Philadelphia, PA, USA, August 14-16, 2024, USENIX Association, 2024.","chicago":"Kostan, Anastassija, Sara Olschar, Lucy Simko, and Yasemin Acar. “Exploring Digital Security and Privacy in Relative Poverty in Germany through Qualitative Interviews.” In <i>33rd USENIX Security Symposium, USENIX Security 2024, Philadelphia, PA, USA, August 14-16, 2024</i>, edited by Davide Balzarotti and Wenyuan Xu. USENIX Association, 2024.","apa":"Kostan, A., Olschar, S., Simko, L., &#38; Acar, Y. (2024). Exploring digital security and privacy in relative poverty in Germany through qualitative interviews. In D. Balzarotti &#38; W. Xu (Eds.), <i>33rd USENIX Security Symposium, USENIX Security 2024, Philadelphia, PA, USA, August 14-16, 2024</i>. USENIX Association.","ieee":"A. Kostan, S. Olschar, L. Simko, and Y. Acar, “Exploring digital security and privacy in relative poverty in Germany through qualitative interviews,” in <i>33rd USENIX Security Symposium, USENIX Security 2024, Philadelphia, PA, USA, August 14-16, 2024</i>, 2024."}},{"publication":"Beiträge zum Mathematikuntericht 2024. 57. Jahrestagung der Gesellschaft für Didaktik der Mathematik","citation":{"apa":"Häsel-Weide, U., &#38; Nührenbörger, M. (2024).  Praktiken der Förderung im inklusiven Mathematikunterricht. In P. Ebers, F. Rösken, B. Barzel, A. Büchter, F. Schacht, &#38; P. Scherer (Eds.), <i>Beiträge zum Mathematikuntericht 2024. 57. Jahrestagung der Gesellschaft für Didaktik der Mathematik</i> (pp. 207–210). <a href=\"https://doi.ohttps://doi.org/10.37626/GA9783959872782.0 rg/10.37626/GA9783959872782.0\">https://doi.ohttps://doi.org/10.37626/GA9783959872782.0 rg/10.37626/GA9783959872782.0</a>","ieee":"U. Häsel-Weide and M. Nührenbörger, “ Praktiken der Förderung im inklusiven Mathematikunterricht,” in <i>Beiträge zum Mathematikuntericht 2024. 57. Jahrestagung der Gesellschaft für Didaktik der Mathematik</i>, P. Ebers, F. Rösken, B. Barzel, A. Büchter, F. Schacht, and P. Scherer, Eds. 2024, pp. 207–210.","short":"U. Häsel-Weide, M. Nührenbörger, in: P. Ebers, F. Rösken, B. Barzel, A. Büchter, F. Schacht, P. Scherer (Eds.), Beiträge zum Mathematikuntericht 2024. 57. Jahrestagung der Gesellschaft für Didaktik der Mathematik, 2024, pp. 207–210.","chicago":"Häsel-Weide, Uta, and M. Nührenbörger. “ Praktiken der Förderung im inklusiven Mathematikunterricht.” In <i>Beiträge zum Mathematikuntericht 2024. 57. Jahrestagung der Gesellschaft für Didaktik der Mathematik</i>, edited by P. Ebers, F. Rösken, B. Barzel, A. Büchter, F. Schacht, and P. Scherer, 207–10, 2024. <a href=\"https://doi.ohttps://doi.org/10.37626/GA9783959872782.0 rg/10.37626/GA9783959872782.0\">https://doi.ohttps://doi.org/10.37626/GA9783959872782.0 rg/10.37626/GA9783959872782.0</a>.","mla":"Häsel-Weide, Uta, and M. Nührenbörger. “ Praktiken der Förderung im inklusiven Mathematikunterricht.” <i>Beiträge zum Mathematikuntericht 2024. 57. Jahrestagung der Gesellschaft für Didaktik der Mathematik</i>, edited by P. Ebers et al., 2024, pp. 207–10, doi:<a href=\"https://doi.ohttps://doi.org/10.37626/GA9783959872782.0 rg/10.37626/GA9783959872782.0\">https://doi.ohttps://doi.org/10.37626/GA9783959872782.0 rg/10.37626/GA9783959872782.0</a>.","ama":"Häsel-Weide U, Nührenbörger M.  Praktiken der Förderung im inklusiven Mathematikunterricht. In: Ebers P, Rösken F, Barzel B, Büchter A, Schacht F, Scherer P, eds. <i>Beiträge zum Mathematikuntericht 2024. 57. Jahrestagung der Gesellschaft für Didaktik der Mathematik</i>. ; 2024:207-210. doi:<a href=\"https://doi.ohttps://doi.org/10.37626/GA9783959872782.0 rg/10.37626/GA9783959872782.0\">https://doi.ohttps://doi.org/10.37626/GA9783959872782.0 rg/10.37626/GA9783959872782.0</a>","bibtex":"@inbook{Häsel-Weide_Nührenbörger_2024, title={ Praktiken der Förderung im inklusiven Mathematikunterricht}, DOI={<a href=\"https://doi.ohttps://doi.org/10.37626/GA9783959872782.0 rg/10.37626/GA9783959872782.0\">https://doi.ohttps://doi.org/10.37626/GA9783959872782.0 rg/10.37626/GA9783959872782.0</a>}, booktitle={Beiträge zum Mathematikuntericht 2024. 57. Jahrestagung der Gesellschaft für Didaktik der Mathematik}, author={Häsel-Weide, Uta and Nührenbörger, M.}, editor={Ebers, P. and Rösken, F. and Barzel, B. and Büchter, A. and Schacht, F. and Scherer, P.}, year={2024}, pages={207–210} }"},"date_created":"2025-04-15T10:06:42Z","type":"book_chapter","department":[{"_id":"543"}],"status":"public","title":" Praktiken der Förderung im inklusiven Mathematikunterricht","year":"2024","author":[{"id":"60267","last_name":"Häsel-Weide","first_name":"Uta","orcid":"0000-0001-6278-4240","full_name":"Häsel-Weide, Uta"},{"full_name":"Nührenbörger, M.","last_name":"Nührenbörger","first_name":"M."}],"date_updated":"2025-09-08T07:32:38Z","page":"207-210","language":[{"iso":"ger"}],"_id":"59581","doi":"https://doi.ohttps://doi.org/10.37626/GA9783959872782.0 rg/10.37626/GA9783959872782.0","user_id":"44184","editor":[{"full_name":"Ebers, P.","first_name":"P.","last_name":"Ebers"},{"full_name":"Rösken, F.","last_name":"Rösken","first_name":"F."},{"first_name":"B.","last_name":"Barzel","full_name":"Barzel, B."},{"last_name":"Büchter","first_name":"A.","full_name":"Büchter, A."},{"first_name":"F.","last_name":"Schacht","full_name":"Schacht, F."},{"first_name":"P.","last_name":"Scherer","full_name":"Scherer, P."}]},{"department":[{"_id":"79"}],"type":"journal_article","date_created":"2025-09-10T14:26:11Z","publication":"Theoretical Computer Science","doi":"10.1016/j.tcs.2023.114352","language":[{"iso":"eng"}],"article_number":"114352","intvolume":"       985","date_updated":"2025-09-10T14:52:21Z","publication_status":"published","publication_identifier":{"issn":["0304-3975"]},"author":[{"last_name":"Coy","first_name":"Sam","full_name":"Coy, Sam"},{"full_name":"Czumaj, Artur","first_name":"Artur","last_name":"Czumaj"},{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"},{"first_name":"Philipp","last_name":"Schneider","full_name":"Schneider, Philipp"},{"full_name":"Werthmann, Julian","last_name":"Werthmann","first_name":"Julian","id":"50024"}],"title":"Routing Schemes for Hybrid Communication Networks","year":"2024","project":[{"_id":"5","name":"SFB 901; TP A1: Möglichkeiten und Grenzen lokaler Strategien in dynamischen Netzen"}],"citation":{"mla":"Coy, Sam, et al. “Routing Schemes for Hybrid Communication Networks.” <i>Theoretical Computer Science</i>, vol. 985, 114352, Elsevier BV, 2024, doi:<a href=\"https://doi.org/10.1016/j.tcs.2023.114352\">10.1016/j.tcs.2023.114352</a>.","ama":"Coy S, Czumaj A, Scheideler C, Schneider P, Werthmann J. Routing Schemes for Hybrid Communication Networks. <i>Theoretical Computer Science</i>. 2024;985. doi:<a href=\"https://doi.org/10.1016/j.tcs.2023.114352\">10.1016/j.tcs.2023.114352</a>","bibtex":"@article{Coy_Czumaj_Scheideler_Schneider_Werthmann_2024, title={Routing Schemes for Hybrid Communication Networks}, volume={985}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2023.114352\">10.1016/j.tcs.2023.114352</a>}, number={114352}, journal={Theoretical Computer Science}, publisher={Elsevier BV}, author={Coy, Sam and Czumaj, Artur and Scheideler, Christian and Schneider, Philipp and Werthmann, Julian}, year={2024} }","apa":"Coy, S., Czumaj, A., Scheideler, C., Schneider, P., &#38; Werthmann, J. (2024). Routing Schemes for Hybrid Communication Networks. <i>Theoretical Computer Science</i>, <i>985</i>, Article 114352. <a href=\"https://doi.org/10.1016/j.tcs.2023.114352\">https://doi.org/10.1016/j.tcs.2023.114352</a>","ieee":"S. Coy, A. Czumaj, C. Scheideler, P. Schneider, and J. Werthmann, “Routing Schemes for Hybrid Communication Networks,” <i>Theoretical Computer Science</i>, vol. 985, Art. no. 114352, 2024, doi: <a href=\"https://doi.org/10.1016/j.tcs.2023.114352\">10.1016/j.tcs.2023.114352</a>.","short":"S. Coy, A. Czumaj, C. Scheideler, P. Schneider, J. Werthmann, Theoretical Computer Science 985 (2024).","chicago":"Coy, Sam, Artur Czumaj, Christian Scheideler, Philipp Schneider, and Julian Werthmann. “Routing Schemes for Hybrid Communication Networks.” <i>Theoretical Computer Science</i> 985 (2024). <a href=\"https://doi.org/10.1016/j.tcs.2023.114352\">https://doi.org/10.1016/j.tcs.2023.114352</a>."},"volume":985,"user_id":"50024","_id":"61172","publisher":"Elsevier BV","status":"public"},{"_id":"57240","ddc":["600"],"user_id":"83392","editor":[{"full_name":"Rospocher, Marco","last_name":"Rospocher","first_name":"Marco"}],"status":"public","conference":{"end_date":"2024-11-28","name":"24th International Conference on Knowledge Engineering and Knowledge Management","start_date":"2024-11-26","location":"Amsterdam, Netherlands"},"has_accepted_license":"1","file_date_updated":"2024-11-19T14:14:14Z","popular_science":"1","citation":{"mla":"Qudus, Umair, et al. “FaVEL: Fact Validation Ensemble Learning.” <i>EKAW 2024</i>, edited by Marco Rospocher and Mehwish Alam, 2024.","bibtex":"@inproceedings{Qudus_Röder_Tatkeu Pekarou_Morim da Silva_Ngonga Ngomo_2024, title={FaVEL: Fact Validation Ensemble Learning}, booktitle={EKAW 2024}, author={Qudus, Umair and Röder, Michael and Tatkeu Pekarou, Franck Lionel and Morim da Silva, Ana Alexandra and Ngonga Ngomo, Axel-Cyrille}, editor={Rospocher, Marco and Mehwish Alam}, year={2024} }","ama":"Qudus U, Röder M, Tatkeu Pekarou FL, Morim da Silva AA, Ngonga Ngomo A-C. FaVEL: Fact Validation Ensemble Learning. In: Rospocher M, Mehwish Alam, eds. <i>EKAW 2024</i>. ; 2024.","ieee":"U. Qudus, M. Röder, F. L. Tatkeu Pekarou, A. A. Morim da Silva, and A.-C. Ngonga Ngomo, “FaVEL: Fact Validation Ensemble Learning,” in <i>EKAW 2024</i>, Amsterdam, Netherlands, 2024.","apa":"Qudus, U., Röder, M., Tatkeu Pekarou, F. L., Morim da Silva, A. A., &#38; Ngonga Ngomo, A.-C. (2024). FaVEL: Fact Validation Ensemble Learning. In M. Rospocher &#38; Mehwish Alam (Eds.), <i>EKAW 2024</i>.","short":"U. Qudus, M. Röder, F.L. Tatkeu Pekarou, A.A. Morim da Silva, A.-C. Ngonga Ngomo, in: M. Rospocher, Mehwish Alam (Eds.), EKAW 2024, 2024.","chicago":"Qudus, Umair, Michael Röder, Franck Lionel Tatkeu Pekarou, Ana Alexandra Morim da Silva, and Axel-Cyrille Ngonga Ngomo. “FaVEL: Fact Validation Ensemble Learning.” In <i>EKAW 2024</i>, edited by Marco Rospocher and Mehwish Alam, 2024."},"quality_controlled":"1","project":[{"_id":"412","name":"NEBULA: Nutzerzentrierte KI-basierte Erkennung von Fake-News und Fehlinformationen"},{"name":"SAIL: SAIL - Nachhaltiger Lebenszyklus von intelligenten soziotechnischen Systemen","_id":"285"},{"name":"KnowGraphs: KnowGraphs: Knowledge Graphs at Scale","_id":"410"}],"language":[{"iso":"eng"}],"title":"FaVEL: Fact Validation Ensemble Learning","year":"2024","corporate_editor":["Mehwish Alam"],"author":[{"id":"83392","last_name":"Qudus","first_name":"Umair","orcid":"0000-0001-6714-8729","full_name":"Qudus, Umair"},{"orcid":"https://orcid.org/0000-0002-8609-8277","first_name":"Michael","last_name":"Röder","full_name":"Röder, Michael","id":"67199"},{"last_name":"Tatkeu Pekarou","first_name":"Franck Lionel","full_name":"Tatkeu Pekarou, Franck Lionel"},{"full_name":"Morim da Silva, Ana Alexandra","first_name":"Ana Alexandra","last_name":"Morim da Silva","id":"72108"},{"id":"65716","full_name":"Ngonga Ngomo, Axel-Cyrille","last_name":"Ngonga Ngomo","first_name":"Axel-Cyrille"}],"date_updated":"2025-09-11T09:48:12Z","file":[{"date_created":"2024-11-19T14:14:14Z","creator":"uqudus","success":1,"content_type":"application/pdf","file_id":"57241","date_updated":"2024-11-19T14:14:14Z","relation":"main_file","access_level":"closed","file_size":190661,"file_name":"favel.pdf"}],"date_created":"2024-11-19T14:12:49Z","type":"conference","keyword":["fact checking","ensemble learning","transfer learning","knowledge management."],"department":[{"_id":"34"}],"publication":"EKAW 2024","abstract":[{"text":"Validating assertions before adding them to a knowledge graph is an essential part of its creation and maintenance. Due to the sheer size of knowledge graphs, automatic fact-checking approaches have been developed. These approaches rely on reference knowledge to decide whether a given assertion is correct. Recent hybrid approaches achieve good results by including several knowledge sources. However, it is often impractical to provide a sheer quantity of textual knowledge or generate embedding models to leverage these hybrid approaches. We present FaVEL, an approach that uses algorithm selection and ensemble learning to amalgamate several existing fact-checking approaches that rely solely on a reference knowledge graph and, hence, use fewer resources than current hybrid approaches. For our evaluation, we create updated versions of two existing datasets and a new dataset dubbed FaVEL-DS. Our evaluation compares our approach to 15 fact-checking approaches—including the state-of-the-art approach HybridFC—on 3 datasets. Our results demonstrate that FaVEL outperforms all other approaches significantly by at least 0.04 in terms of the area under the ROC curve. Our source code, datasets, and evaluation results are open-source and can be found at https://github.com/dice-group/favel.","lang":"eng"}]},{"_id":"58377","language":[{"iso":"eng"}],"user_id":"99353","doi":"10.1609/AAAI.V39I14.33651","author":[{"id":"99353","full_name":"Mahmood, Yasir","first_name":"Yasir","last_name":"Mahmood"},{"full_name":"Hecher, Markus","first_name":"Markus","last_name":"Hecher"},{"id":"65716","last_name":"Ngonga Ngomo","first_name":"Axel-Cyrille","full_name":"Ngonga Ngomo, Axel-Cyrille"}],"title":"Dung's Argumentation Framework: Unveiling the Expressive Power with  Inconsistent Databases","status":"public","year":"2024","date_updated":"2025-09-11T10:01:11Z","date_created":"2025-01-27T15:30:41Z","external_id":{"arxiv":["2412.11617"]},"department":[{"_id":"574"}],"type":"conference","citation":{"bibtex":"@inproceedings{Mahmood_Hecher_Ngonga Ngomo_2024, title={Dung’s Argumentation Framework: Unveiling the Expressive Power with  Inconsistent Databases}, DOI={<a href=\"https://doi.org/10.1609/AAAI.V39I14.33651\">10.1609/AAAI.V39I14.33651</a>}, author={Mahmood, Yasir and Hecher, Markus and Ngonga Ngomo, Axel-Cyrille}, year={2024} }","ama":"Mahmood Y, Hecher M, Ngonga Ngomo A-C. Dung’s Argumentation Framework: Unveiling the Expressive Power with  Inconsistent Databases. In: ; 2024. doi:<a href=\"https://doi.org/10.1609/AAAI.V39I14.33651\">10.1609/AAAI.V39I14.33651</a>","mla":"Mahmood, Yasir, et al. <i>Dung’s Argumentation Framework: Unveiling the Expressive Power with  Inconsistent Databases</i>. 2024, doi:<a href=\"https://doi.org/10.1609/AAAI.V39I14.33651\">10.1609/AAAI.V39I14.33651</a>.","chicago":"Mahmood, Yasir, Markus Hecher, and Axel-Cyrille Ngonga Ngomo. “Dung’s Argumentation Framework: Unveiling the Expressive Power with  Inconsistent Databases,” 2024. <a href=\"https://doi.org/10.1609/AAAI.V39I14.33651\">https://doi.org/10.1609/AAAI.V39I14.33651</a>.","short":"Y. Mahmood, M. Hecher, A.-C. Ngonga Ngomo, in: 2024.","ieee":"Y. Mahmood, M. Hecher, and A.-C. Ngonga Ngomo, “Dung’s Argumentation Framework: Unveiling the Expressive Power with  Inconsistent Databases,” 2024, doi: <a href=\"https://doi.org/10.1609/AAAI.V39I14.33651\">10.1609/AAAI.V39I14.33651</a>.","apa":"Mahmood, Y., Hecher, M., &#38; Ngonga Ngomo, A.-C. (2024). <i>Dung’s Argumentation Framework: Unveiling the Expressive Power with  Inconsistent Databases</i>. <a href=\"https://doi.org/10.1609/AAAI.V39I14.33651\">https://doi.org/10.1609/AAAI.V39I14.33651</a>"},"project":[{"name":"TRR 318; TP B01: Ein dialogbasierter Ansatz zur Erklärung von Modellen des maschinellen Lernens","_id":"121"}],"abstract":[{"text":"The connection between inconsistent databases and Dung's abstract\r\nargumentation framework has recently drawn growing interest. Specifically, an\r\ninconsistent database, involving certain types of integrity constraints such as\r\nfunctional and inclusion dependencies, can be viewed as an argumentation\r\nframework in Dung's setting. Nevertheless, no prior work has explored the exact\r\nexpressive power of Dung's theory of argumentation when compared to\r\ninconsistent databases and integrity constraints. In this paper, we close this\r\ngap by arguing that an argumentation framework can also be viewed as an\r\ninconsistent database. We first establish a connection between subset-repairs\r\nfor databases and extensions for AFs, considering conflict-free, naive,\r\nadmissible, and preferred semantics. Further, we define a new family of\r\nattribute-based repairs based on the principle of maximal content preservation.\r\nThe effectiveness of these repairs is then highlighted by connecting them to\r\nstable, semi-stable, and stage semantics. Our main contributions include\r\ntranslating an argumentation framework into a database together with integrity\r\nconstraints. Moreover, this translation can be achieved in polynomial time,\r\nwhich is essential in transferring complexity results between the two\r\nformalisms.","lang":"eng"}]},{"date_updated":"2025-09-11T10:01:52Z","publication_status":"published","status":"public","title":"Rejection in Abstract Argumentation: Harder Than Acceptance?","year":"2024","conference":{"location":"Santiago de Compostela, Spain","name":"ECAI} 2024 - 27th European Conference on Artificial Intelligence"},"author":[{"full_name":"Fichte, Johannes K.","last_name":"Fichte","first_name":"Johannes K."},{"last_name":"Hecher","first_name":"Markus","full_name":"Hecher, Markus"},{"id":"99353","last_name":"Mahmood","first_name":"Yasir","full_name":"Mahmood, Yasir"},{"full_name":"Meier, Arne","last_name":"Meier","first_name":"Arne"}],"publication_identifier":{"issn":["0922-6389","1879-8314"],"isbn":["9781643685489"]},"doi":"10.3233/faia240867","user_id":"99353","_id":"57238","language":[{"iso":"eng"}],"publisher":"IOS Press","abstract":[{"lang":"eng","text":"<jats:p>Abstract argumentation is a popular toolkit for modeling, evaluating, and comparing arguments. Relationships between arguments are specified in argumentation frameworks (AFs), and conditions are placed on sets (extensions) of arguments that allow AFs to be evaluated. For more expressiveness, AFs are augmented with acceptance conditions on directly interacting arguments or a constraint on the admissible sets of arguments, resulting in dialectic frameworks or constrained argumentation frameworks. In this paper, we consider flexible conditions for rejecting an argument from an extension, which we call rejection conditions (RCs). On the technical level, we associate each argument with a specific logic program. We analyze the resulting complexity, including the structural parameter treewidth. Rejection AFs are highly expressive, giving rise to natural problems on higher levels of the polynomial hierarchy.</jats:p>"}],"project":[{"_id":"121","name":"TRR 318; TP B01: Ein dialogbasierter Ansatz zur Erklärung von Modellen des maschinellen Lernens"}],"publication":"Frontiers in Artificial Intelligence and Applications","citation":{"mla":"Fichte, Johannes K., et al. “Rejection in Abstract Argumentation: Harder Than Acceptance?” <i>Frontiers in Artificial Intelligence and Applications</i>, IOS Press, 2024, doi:<a href=\"https://doi.org/10.3233/faia240867\">10.3233/faia240867</a>.","ama":"Fichte JK, Hecher M, Mahmood Y, Meier A. Rejection in Abstract Argumentation: Harder Than Acceptance? In: <i>Frontiers in Artificial Intelligence and Applications</i>. IOS Press; 2024. doi:<a href=\"https://doi.org/10.3233/faia240867\">10.3233/faia240867</a>","bibtex":"@inbook{Fichte_Hecher_Mahmood_Meier_2024, title={Rejection in Abstract Argumentation: Harder Than Acceptance?}, DOI={<a href=\"https://doi.org/10.3233/faia240867\">10.3233/faia240867</a>}, booktitle={Frontiers in Artificial Intelligence and Applications}, publisher={IOS Press}, author={Fichte, Johannes K. and Hecher, Markus and Mahmood, Yasir and Meier, Arne}, year={2024} }","apa":"Fichte, J. K., Hecher, M., Mahmood, Y., &#38; Meier, A. (2024). Rejection in Abstract Argumentation: Harder Than Acceptance? In <i>Frontiers in Artificial Intelligence and Applications</i>. ECAI} 2024 - 27th European Conference on Artificial Intelligence, Santiago de Compostela, Spain. IOS Press. <a href=\"https://doi.org/10.3233/faia240867\">https://doi.org/10.3233/faia240867</a>","ieee":"J. K. Fichte, M. Hecher, Y. Mahmood, and A. Meier, “Rejection in Abstract Argumentation: Harder Than Acceptance?,” in <i>Frontiers in Artificial Intelligence and Applications</i>, IOS Press, 2024.","chicago":"Fichte, Johannes K., Markus Hecher, Yasir Mahmood, and Arne Meier. “Rejection in Abstract Argumentation: Harder Than Acceptance?” In <i>Frontiers in Artificial Intelligence and Applications</i>. IOS Press, 2024. <a href=\"https://doi.org/10.3233/faia240867\">https://doi.org/10.3233/faia240867</a>.","short":"J.K. Fichte, M. Hecher, Y. Mahmood, A. Meier, in: Frontiers in Artificial Intelligence and Applications, IOS Press, 2024."},"type":"book_chapter","department":[{"_id":"574"}],"date_created":"2024-11-19T11:46:55Z"},{"citation":{"mla":"Hecher, Markus, et al. “Quantitative Claim-Centric Reasoning in Logic-Based Argumentation.” <i>Proceedings of the Thirty-ThirdInternational Joint Conference on Artificial Intelligence</i>, International Joint Conferences on Artificial Intelligence Organization, 2024, doi:<a href=\"https://doi.org/10.24963/ijcai.2024/377\">10.24963/ijcai.2024/377</a>.","ama":"Hecher M, Mahmood Y, Meier A, Schmidt J. Quantitative Claim-Centric Reasoning in Logic-Based Argumentation. In: <i>Proceedings of the Thirty-ThirdInternational Joint Conference on Artificial Intelligence</i>. International Joint Conferences on Artificial Intelligence Organization; 2024. doi:<a href=\"https://doi.org/10.24963/ijcai.2024/377\">10.24963/ijcai.2024/377</a>","bibtex":"@inproceedings{Hecher_Mahmood_Meier_Schmidt_2024, title={Quantitative Claim-Centric Reasoning in Logic-Based Argumentation}, DOI={<a href=\"https://doi.org/10.24963/ijcai.2024/377\">10.24963/ijcai.2024/377</a>}, booktitle={Proceedings of the Thirty-ThirdInternational Joint Conference on Artificial Intelligence}, publisher={International Joint Conferences on Artificial Intelligence Organization}, author={Hecher, Markus and Mahmood, Yasir and Meier, Arne and Schmidt, Johannes}, year={2024} }","apa":"Hecher, M., Mahmood, Y., Meier, A., &#38; Schmidt, J. (2024). Quantitative Claim-Centric Reasoning in Logic-Based Argumentation. <i>Proceedings of the Thirty-ThirdInternational Joint Conference on Artificial Intelligence</i>. <a href=\"https://doi.org/10.24963/ijcai.2024/377\">https://doi.org/10.24963/ijcai.2024/377</a>","ieee":"M. Hecher, Y. Mahmood, A. Meier, and J. Schmidt, “Quantitative Claim-Centric Reasoning in Logic-Based Argumentation,” 2024, doi: <a href=\"https://doi.org/10.24963/ijcai.2024/377\">10.24963/ijcai.2024/377</a>.","chicago":"Hecher, Markus, Yasir Mahmood, Arne Meier, and Johannes Schmidt. “Quantitative Claim-Centric Reasoning in Logic-Based Argumentation.” In <i>Proceedings of the Thirty-ThirdInternational Joint Conference on Artificial Intelligence</i>. International Joint Conferences on Artificial Intelligence Organization, 2024. <a href=\"https://doi.org/10.24963/ijcai.2024/377\">https://doi.org/10.24963/ijcai.2024/377</a>.","short":"M. Hecher, Y. Mahmood, A. Meier, J. Schmidt, in: Proceedings of the Thirty-ThirdInternational Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence Organization, 2024."},"publication":"Proceedings of the Thirty-ThirdInternational Joint Conference on Artificial Intelligence","project":[{"_id":"121","name":"TRR 318; TP B01: Ein dialogbasierter Ansatz zur Erklärung von Modellen des maschinellen Lernens"}],"abstract":[{"text":"<jats:p>Argumentation is a well-established formalism for nonmonotonic reasoning, with popular frameworks being Dung’s abstract argumentation (AFs) or logic-based argumentation (Besnard-Hunter’s framework). Structurally, a set of formulas forms support for a claim if it is consistent, subset-minimal, and implies the claim. Then, an argument comprises support and a claim. We observe that the computational task (ARG) of asking for support of a claim in a knowledge base is “brave”, since many claims with a single support are accepted. As a result, ARG falls short when it comes to the question of confidence in a claim, or claim strength. In this paper, we propose a concept for measuring the (acceptance) strength of claims, based on counting supports for a claim. Further, we settle classical and structural complexity of counting arguments favoring a given claim in propositional knowledge bases (KBs). We introduce quantitative reasoning to measure the strength of claims in a KB and to determine the relevance strength of a formula for a claim.</jats:p>","lang":"eng"}],"date_created":"2024-08-19T16:21:51Z","department":[{"_id":"574"}],"type":"conference","author":[{"full_name":"Hecher, Markus","first_name":"Markus","last_name":"Hecher"},{"id":"99353","last_name":"Mahmood","first_name":"Yasir","full_name":"Mahmood, Yasir"},{"first_name":"Arne","last_name":"Meier","full_name":"Meier, Arne"},{"full_name":"Schmidt, Johannes","first_name":"Johannes","last_name":"Schmidt"}],"title":"Quantitative Claim-Centric Reasoning in Logic-Based Argumentation","year":"2024","status":"public","date_updated":"2025-09-11T10:02:03Z","publication_status":"published","language":[{"iso":"eng"}],"_id":"55655","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi":"10.24963/ijcai.2024/377","user_id":"99353"},{"_id":"57814","language":[{"iso":"eng"}],"user_id":"99353","year":"2024","title":"Parameterised Complexity of Consistent Query Answering via Graph  Representations","status":"public","author":[{"last_name":"Hankala","first_name":"Teemu","full_name":"Hankala, Teemu"},{"last_name":"Hannula","first_name":"Miika","full_name":"Hannula, Miika"},{"full_name":"Mahmood, Yasir","last_name":"Mahmood","first_name":"Yasir","id":"99353"},{"last_name":"Meier","first_name":"Arne","full_name":"Meier, Arne"}],"date_updated":"2025-09-11T10:01:35Z","external_id":{"arxiv":["2412.08324"]},"date_created":"2024-12-15T20:12:56Z","type":"preprint","department":[{"_id":"574"}],"publication":"arXiv:2412.08324","citation":{"mla":"Hankala, Teemu, et al. “Parameterised Complexity of Consistent Query Answering via Graph  Representations.” <i>ArXiv:2412.08324</i>, 2024.","ama":"Hankala T, Hannula M, Mahmood Y, Meier A. Parameterised Complexity of Consistent Query Answering via Graph  Representations. <i>arXiv:241208324</i>. Published online 2024.","bibtex":"@article{Hankala_Hannula_Mahmood_Meier_2024, title={Parameterised Complexity of Consistent Query Answering via Graph  Representations}, journal={arXiv:2412.08324}, author={Hankala, Teemu and Hannula, Miika and Mahmood, Yasir and Meier, Arne}, year={2024} }","apa":"Hankala, T., Hannula, M., Mahmood, Y., &#38; Meier, A. (2024). Parameterised Complexity of Consistent Query Answering via Graph  Representations. In <i>arXiv:2412.08324</i>.","ieee":"T. Hankala, M. Hannula, Y. Mahmood, and A. Meier, “Parameterised Complexity of Consistent Query Answering via Graph  Representations,” <i>arXiv:2412.08324</i>. 2024.","chicago":"Hankala, Teemu, Miika Hannula, Yasir Mahmood, and Arne Meier. “Parameterised Complexity of Consistent Query Answering via Graph  Representations.” <i>ArXiv:2412.08324</i>, 2024.","short":"T. Hankala, M. Hannula, Y. Mahmood, A. Meier, ArXiv:2412.08324 (2024)."},"abstract":[{"text":"We study consistent query answering via different graph representations.\r\nFirst, we introduce solution-conflict hypergraphs in which nodes represent\r\nfacts and edges represent either conflicts or query solutions. Considering a\r\nmonotonic query and a set of antimonotonic constraints, we present an explicit\r\nalgorithm for counting the number of repairs satisfying the query based on a\r\ntree decomposition of the solution-conflict hypergraph. The algorithm not only\r\nprovides fixed-parameter tractability results for data complexity over\r\nexpressive query and constraint classes, but also introduces a novel and\r\npotentially implementable approach to repair counting. Second, we consider the\r\nGaifman graphs arising from MSO descriptions of consistent query answering.\r\nUsing a generalization of Courcelle's theorem, we then present fixed-parameter\r\ntractability results for combined complexity over expressive query and\r\nconstraint classes.","lang":"eng"}],"project":[{"_id":"121","name":"TRR 318; TP B01: Ein dialogbasierter Ansatz zur Erklärung von Modellen des maschinellen Lernens"}]},{"conference":{"end_date":"2024-11-01","location":"Sacramento, California","start_date":"2024-10-27","name":"39th IEEE/ACM International Conference on Automated Software Engineering (ASE 2024)"},"status":"public","has_accepted_license":"1","_id":"56140","user_id":"32312","ddc":["000"],"citation":{"apa":"Khedkar, M., Schlichtig, M., &#38; Bodden, E. (2024). Advancing Android Privacy Assessments with Automation. <i>In Proceedings of the 39th IEEE/ACM International Conference on Automated Software Engineering Workshops (ASEW ’24)</i>. 39th IEEE/ACM International Conference on Automated Software Engineering (ASE 2024), Sacramento, California. <a href=\"https://doi.org/10.1145/3691621.3694953\">https://doi.org/10.1145/3691621.3694953</a>","ieee":"M. Khedkar, M. Schlichtig, and E. Bodden, “Advancing Android Privacy Assessments with Automation,” presented at the 39th IEEE/ACM International Conference on Automated Software Engineering (ASE 2024), Sacramento, California, 2024, doi: <a href=\"https://doi.org/10.1145/3691621.3694953\">10.1145/3691621.3694953</a>.","chicago":"Khedkar, Mugdha, Michael Schlichtig, and Eric Bodden. “Advancing Android Privacy Assessments with Automation.” In <i>In Proceedings of the 39th IEEE/ACM International Conference on Automated Software Engineering Workshops (ASEW ’24)</i>, 2024. <a href=\"https://doi.org/10.1145/3691621.3694953\">https://doi.org/10.1145/3691621.3694953</a>.","short":"M. Khedkar, M. Schlichtig, E. Bodden, in: In Proceedings of the 39th IEEE/ACM International Conference on Automated Software Engineering Workshops (ASEW ’24), 2024.","mla":"Khedkar, Mugdha, et al. “Advancing Android Privacy Assessments with Automation.” <i>In Proceedings of the 39th IEEE/ACM International Conference on Automated Software Engineering Workshops (ASEW ’24)</i>, 2024, doi:<a href=\"https://doi.org/10.1145/3691621.3694953\">10.1145/3691621.3694953</a>.","ama":"Khedkar M, Schlichtig M, Bodden E. Advancing Android Privacy Assessments with Automation. In: <i>In Proceedings of the 39th IEEE/ACM International Conference on Automated Software Engineering Workshops (ASEW ’24)</i>. ; 2024. doi:<a href=\"https://doi.org/10.1145/3691621.3694953\">10.1145/3691621.3694953</a>","bibtex":"@inproceedings{Khedkar_Schlichtig_Bodden_2024, title={Advancing Android Privacy Assessments with Automation}, DOI={<a href=\"https://doi.org/10.1145/3691621.3694953\">10.1145/3691621.3694953</a>}, booktitle={In Proceedings of the 39th IEEE/ACM International Conference on Automated Software Engineering Workshops (ASEW ’24)}, author={Khedkar, Mugdha and Schlichtig, Michael and Bodden, Eric}, year={2024} }"},"file_date_updated":"2024-09-16T08:55:23Z","external_id":{"arxiv":["2409.06564"]},"author":[{"id":"88024","full_name":"Khedkar, Mugdha","last_name":"Khedkar","first_name":"Mugdha"},{"last_name":"Schlichtig","first_name":"Michael","orcid":"0000-0001-6600-6171","full_name":"Schlichtig, Michael","id":"32312"},{"full_name":"Bodden, Eric","first_name":"Eric","orcid":"0000-0003-3470-3647","last_name":"Bodden","id":"59256"}],"title":"Advancing Android Privacy Assessments with Automation","year":"2024","date_updated":"2026-03-13T12:12:45Z","language":[{"iso":"eng"}],"doi":"10.1145/3691621.3694953","publication":"In Proceedings of the 39th IEEE/ACM International Conference on Automated Software Engineering Workshops (ASEW ’24)","abstract":[{"text":"    Android apps collecting data from users must comply with legal frameworks to ensure data protection. This requirement has become even more important since the implementation of the General Data Protection Regulation (GDPR) by the European Union in 2018. Moreover, with the proposed Cyber Resilience Act on the horizon, stakeholders will soon need to assess software against even more stringent security and privacy standards. Effective privacy assessments require collaboration among groups with diverse expertise to function effectively as a cohesive unit.\r\n    This paper motivates the need for an automated approach that enhances understanding of data protection in Android apps and improves communication between the various parties involved in privacy assessments. We propose the Assessor View, a tool designed to bridge the knowledge gap between these parties, facilitating more effective privacy assessments of Android applications. ","lang":"eng"}],"date_created":"2024-09-16T08:55:34Z","file":[{"access_level":"closed","file_size":1207856,"file_name":"2409.06564v1.pdf","date_updated":"2024-09-16T08:55:23Z","relation":"main_file","success":1,"content_type":"application/pdf","file_id":"56141","creator":"khedkarm","date_created":"2024-09-16T08:55:23Z"}],"department":[{"_id":"76"}],"type":"conference"},{"type":"conference","department":[{"_id":"819"}],"date_created":"2026-01-19T11:29:47Z","publication":"2024 International Conference on Machine Learning and Applications (ICMLA)","citation":{"chicago":"Klüttermann, Simon, Jérôme Rutinowski, Frederik Polachowski, Anh Nguyen, Britta Grimme, Moritz Roidl, and Emmanuel Müller. “On the Effectiveness of Heterogeneous Ensemble Methods for Re-Identification.” In <i>2024 International Conference on Machine Learning and Applications (ICMLA)</i>, 1705–1711, 2024.","ama":"Klüttermann S, Rutinowski J, Polachowski F, et al. On the Effectiveness of Heterogeneous Ensemble Methods for Re-identification. In: <i>2024 International Conference on Machine Learning and Applications (ICMLA)</i>. ; 2024:1705–1711.","short":"S. Klüttermann, J. Rutinowski, F. Polachowski, A. Nguyen, B. Grimme, M. Roidl, E. Müller, in: 2024 International Conference on Machine Learning and Applications (ICMLA), 2024, pp. 1705–1711.","bibtex":"@inproceedings{Klüttermann_Rutinowski_Polachowski_Nguyen_Grimme_Roidl_Müller_2024, title={On the Effectiveness of Heterogeneous Ensemble Methods for Re-identification}, booktitle={2024 International Conference on Machine Learning and Applications (ICMLA)}, author={Klüttermann, Simon and Rutinowski, Jérôme and Polachowski, Frederik and Nguyen, Anh and Grimme, Britta and Roidl, Moritz and Müller, Emmanuel}, year={2024}, pages={1705–1711} }","mla":"Klüttermann, Simon, et al. “On the Effectiveness of Heterogeneous Ensemble Methods for Re-Identification.” <i>2024 International Conference on Machine Learning and Applications (ICMLA)</i>, 2024, pp. 1705–1711.","apa":"Klüttermann, S., Rutinowski, J., Polachowski, F., Nguyen, A., Grimme, B., Roidl, M., &#38; Müller, E. (2024). On the Effectiveness of Heterogeneous Ensemble Methods for Re-identification. <i>2024 International Conference on Machine Learning and Applications (ICMLA)</i>, 1705–1711.","ieee":"S. Klüttermann <i>et al.</i>, “On the Effectiveness of Heterogeneous Ensemble Methods for Re-identification,” in <i>2024 International Conference on Machine Learning and Applications (ICMLA)</i>, 2024, pp. 1705–1711."},"user_id":"103682","page":"1705–1711","_id":"63658","language":[{"iso":"eng"}],"date_updated":"2026-03-19T07:47:29Z","status":"public","title":"On the Effectiveness of Heterogeneous Ensemble Methods for Re-identification","year":"2024","author":[{"full_name":"Klüttermann, Simon","last_name":"Klüttermann","first_name":"Simon"},{"full_name":"Rutinowski, Jérôme","last_name":"Rutinowski","first_name":"Jérôme"},{"first_name":"Frederik","last_name":"Polachowski","full_name":"Polachowski, Frederik"},{"full_name":"Nguyen, Anh","first_name":"Anh","last_name":"Nguyen"},{"full_name":"Grimme, Britta","last_name":"Grimme","first_name":"Britta"},{"full_name":"Roidl, Moritz","last_name":"Roidl","first_name":"Moritz"},{"full_name":"Müller, Emmanuel","first_name":"Emmanuel","last_name":"Müller"}]},{"_id":"58873","language":[{"iso":"eng"}],"user_id":"109467","author":[{"id":"70575","full_name":"Delarue, Benjamin","last_name":"Delarue","first_name":"Benjamin"},{"last_name":"Palmirotta","first_name":"Guendalina","full_name":"Palmirotta, Guendalina","id":"109467"}],"title":"Patterson-Sullivan and Wigner distributions of convex-cocompact  hyperbolic surfaces","status":"public","year":"2024","date_updated":"2026-03-30T12:01:12Z","date_created":"2025-02-28T10:32:30Z","external_id":{"arxiv":["2411.19782"]},"department":[{"_id":"548"}],"type":"preprint","citation":{"bibtex":"@article{Delarue_Palmirotta_2024, title={Patterson-Sullivan and Wigner distributions of convex-cocompact  hyperbolic surfaces}, journal={arXiv:2411.19782}, author={Delarue, Benjamin and Palmirotta, Guendalina}, year={2024} }","ama":"Delarue B, Palmirotta G. Patterson-Sullivan and Wigner distributions of convex-cocompact  hyperbolic surfaces. <i>arXiv:241119782</i>. Published online 2024.","mla":"Delarue, Benjamin, and Guendalina Palmirotta. “Patterson-Sullivan and Wigner Distributions of Convex-Cocompact  Hyperbolic Surfaces.” <i>ArXiv:2411.19782</i>, 2024.","short":"B. Delarue, G. Palmirotta, ArXiv:2411.19782 (2024).","chicago":"Delarue, Benjamin, and Guendalina Palmirotta. “Patterson-Sullivan and Wigner Distributions of Convex-Cocompact  Hyperbolic Surfaces.” <i>ArXiv:2411.19782</i>, 2024.","ieee":"B. Delarue and G. Palmirotta, “Patterson-Sullivan and Wigner distributions of convex-cocompact  hyperbolic surfaces,” <i>arXiv:2411.19782</i>. 2024.","apa":"Delarue, B., &#38; Palmirotta, G. (2024). Patterson-Sullivan and Wigner distributions of convex-cocompact  hyperbolic surfaces. In <i>arXiv:2411.19782</i>."},"publication":"arXiv:2411.19782","project":[{"_id":"356","name":"TRR 358; TP B02: Spektraltheorie in höherem Rang und unendlichem Volumen"}],"abstract":[{"lang":"eng","text":"We prove that the Patterson-Sullivan and Wigner distributions on the unit\r\nsphere bundle of a convex-cocompact hyperbolic surface are asymptotically\r\nidentical. This generalizes results in the compact case by\r\nAnantharaman-Zelditch and Hansen-Hilgert-Schr\\\"oder."}]},{"user_id":"405","volume":22,"page":"69-72","_id":"52587","publisher":"Institute of Electrical and Electronics Engineers (IEEE)","status":"public","quality_controlled":"1","citation":{"chicago":"Bodden, Eric, Jens Pottebaum, Markus Fockel, and Iris Gräßler. “Evaluating Security Through Isolation and Defense in Depth.” <i>IEEE Security &#38; Privacy</i> 22, no. 1 (2024): 69–72. <a href=\"https://doi.org/10.1109/msec.2023.3336028\">https://doi.org/10.1109/msec.2023.3336028</a>.","short":"E. Bodden, J. Pottebaum, M. Fockel, I. Gräßler, IEEE Security &#38; Privacy 22 (2024) 69–72.","apa":"Bodden, E., Pottebaum, J., Fockel, M., &#38; Gräßler, I. (2024). Evaluating Security Through Isolation and Defense in Depth. <i>IEEE Security &#38; Privacy</i>, <i>22</i>(1), 69–72. <a href=\"https://doi.org/10.1109/msec.2023.3336028\">https://doi.org/10.1109/msec.2023.3336028</a>","ieee":"E. Bodden, J. Pottebaum, M. Fockel, and I. Gräßler, “Evaluating Security Through Isolation and Defense in Depth,” <i>IEEE Security &#38; Privacy</i>, vol. 22, no. 1, pp. 69–72, 2024, doi: <a href=\"https://doi.org/10.1109/msec.2023.3336028\">10.1109/msec.2023.3336028</a>.","ama":"Bodden E, Pottebaum J, Fockel M, Gräßler I. Evaluating Security Through Isolation and Defense in Depth. <i>IEEE Security &#38; Privacy</i>. 2024;22(1):69-72. doi:<a href=\"https://doi.org/10.1109/msec.2023.3336028\">10.1109/msec.2023.3336028</a>","bibtex":"@article{Bodden_Pottebaum_Fockel_Gräßler_2024, title={Evaluating Security Through Isolation and Defense in Depth}, volume={22}, DOI={<a href=\"https://doi.org/10.1109/msec.2023.3336028\">10.1109/msec.2023.3336028</a>}, number={1}, journal={IEEE Security &#38; Privacy}, publisher={Institute of Electrical and Electronics Engineers (IEEE)}, author={Bodden, Eric and Pottebaum, Jens and Fockel, Markus and Gräßler, Iris}, year={2024}, pages={69–72} }","mla":"Bodden, Eric, et al. “Evaluating Security Through Isolation and Defense in Depth.” <i>IEEE Security &#38; Privacy</i>, vol. 22, no. 1, Institute of Electrical and Electronics Engineers (IEEE), 2024, pp. 69–72, doi:<a href=\"https://doi.org/10.1109/msec.2023.3336028\">10.1109/msec.2023.3336028</a>."},"doi":"10.1109/msec.2023.3336028","main_file_link":[{"url":"https://ieeexplore.ieee.org/document/10411721"}],"language":[{"iso":"eng"}],"date_updated":"2026-03-31T02:19:49Z","publication_status":"published","intvolume":"        22","title":"Evaluating Security Through Isolation and Defense in Depth","year":"2024","author":[{"id":"59256","full_name":"Bodden, Eric","last_name":"Bodden","first_name":"Eric","orcid":"0000-0003-3470-3647"},{"id":"405","full_name":"Pottebaum, Jens","last_name":"Pottebaum","orcid":"http://orcid.org/0000-0001-8778-2989","first_name":"Jens"},{"first_name":"Markus","orcid":"0000-0002-1269-0702","last_name":"Fockel","full_name":"Fockel, Markus","id":"8472"},{"last_name":"Gräßler","first_name":"Iris","orcid":"0000-0001-5765-971X","full_name":"Gräßler, Iris","id":"47565"}],"publication_identifier":{"issn":["1540-7993","1558-4046"]},"keyword":["Law","Electrical and Electronic Engineering","Computer Networks and Communications"],"type":"journal_article","department":[{"_id":"152"},{"_id":"76"},{"_id":"662"}],"date_created":"2024-03-15T20:16:18Z","issue":"1","publication":"IEEE Security & Privacy"},{"doi":"10.35468/6126","user_id":"10831","editor":[{"first_name":"Ewa","last_name":"Andrzejewska","full_name":"Andrzejewska, Ewa"},{"full_name":"Matthes, Eva","last_name":"Matthes","first_name":"Eva"},{"full_name":"Schütze, Sylvia","last_name":"Schütze","first_name":"Sylvia"},{"full_name":"Van Wiele, Jan","last_name":"Van Wiele","first_name":"Jan"}],"page":"245–255","language":[{"iso":"eng"}],"_id":"57154","publisher":"Verlag Julius Klinkhardt","date_updated":"2026-04-24T09:08:34Z","title":"Which Media for Whom? The Implementation of Microgrids as a Trigger of Transformational Adult Learning Opportunities in Formal, Informal and Situational Settings in Times of Change","status":"public","year":"2024","publication_identifier":{"isbn":["978-3-7815-2670-9"]},"author":[{"full_name":"Asiimwe, Henry","first_name":"Henry","last_name":"Asiimwe"},{"id":"40880","first_name":"Henrik","last_name":"Bode","full_name":"Bode, Henrik"},{"id":"88496","first_name":"Paul","orcid":"0000-0002-7159-5916","last_name":"Bogere","full_name":"Bogere, Paul"},{"id":"20560","full_name":"Freitag, Christine","last_name":"Freitag","first_name":"Christine"},{"full_name":"Mangeni, Teddy","first_name":"Teddy","last_name":"Mangeni"}],"type":"book_chapter","department":[{"_id":"300"}],"date_created":"2024-11-18T07:41:43Z","publication":"Bildungsmedien für Erwachsene Educational Media for Adults ","citation":{"bibtex":"@inbook{Asiimwe_Bode_Bogere_Freitag_Mangeni_2024, title={Which Media for Whom? The Implementation of Microgrids as a Trigger of Transformational Adult Learning Opportunities in Formal, Informal and Situational Settings in Times of Change}, DOI={<a href=\"https://doi.org/10.35468/6126\">10.35468/6126</a>}, booktitle={Bildungsmedien für Erwachsene Educational Media for Adults }, publisher={Verlag Julius Klinkhardt}, author={Asiimwe, Henry and Bode, Henrik and Bogere, Paul and Freitag, Christine and Mangeni, Teddy}, editor={Andrzejewska, Ewa and Matthes, Eva and Schütze, Sylvia and Van Wiele, Jan}, year={2024}, pages={245–255} }","short":"H. Asiimwe, H. Bode, P. Bogere, C. Freitag, T. Mangeni, in: E. Andrzejewska, E. Matthes, S. Schütze, J. Van Wiele (Eds.), Bildungsmedien Für Erwachsene Educational Media for Adults , Verlag Julius Klinkhardt, 2024, pp. 245–255.","ama":"Asiimwe H, Bode H, Bogere P, Freitag C, Mangeni T. Which Media for Whom? The Implementation of Microgrids as a Trigger of Transformational Adult Learning Opportunities in Formal, Informal and Situational Settings in Times of Change. In: Andrzejewska E, Matthes E, Schütze S, Van Wiele J, eds. <i>Bildungsmedien Für Erwachsene Educational Media for Adults </i>. Verlag Julius Klinkhardt; 2024:245–255. doi:<a href=\"https://doi.org/10.35468/6126\">10.35468/6126</a>","chicago":"Asiimwe, Henry, Henrik Bode, Paul Bogere, Christine Freitag, and Teddy Mangeni. “Which Media for Whom? The Implementation of Microgrids as a Trigger of Transformational Adult Learning Opportunities in Formal, Informal and Situational Settings in Times of Change.” In <i>Bildungsmedien Für Erwachsene Educational Media for Adults </i>, edited by Ewa Andrzejewska, Eva Matthes, Sylvia Schütze, and Jan Van Wiele, 245–255. Verlag Julius Klinkhardt, 2024. <a href=\"https://doi.org/10.35468/6126\">https://doi.org/10.35468/6126</a>.","ieee":"H. Asiimwe, H. Bode, P. Bogere, C. Freitag, and T. Mangeni, “Which Media for Whom? The Implementation of Microgrids as a Trigger of Transformational Adult Learning Opportunities in Formal, Informal and Situational Settings in Times of Change,” in <i>Bildungsmedien für Erwachsene Educational Media for Adults </i>, E. Andrzejewska, E. Matthes, S. Schütze, and J. Van Wiele, Eds. Verlag Julius Klinkhardt, 2024, pp. 245–255.","mla":"Asiimwe, Henry, et al. “Which Media for Whom? The Implementation of Microgrids as a Trigger of Transformational Adult Learning Opportunities in Formal, Informal and Situational Settings in Times of Change.” <i>Bildungsmedien Für Erwachsene Educational Media for Adults </i>, edited by Ewa Andrzejewska et al., Verlag Julius Klinkhardt, 2024, pp. 245–255, doi:<a href=\"https://doi.org/10.35468/6126\">10.35468/6126</a>.","apa":"Asiimwe, H., Bode, H., Bogere, P., Freitag, C., &#38; Mangeni, T. (2024). Which Media for Whom? The Implementation of Microgrids as a Trigger of Transformational Adult Learning Opportunities in Formal, Informal and Situational Settings in Times of Change. In E. Andrzejewska, E. Matthes, S. Schütze, &#38; J. Van Wiele (Eds.), <i>Bildungsmedien für Erwachsene Educational Media for Adults </i> (pp. 245–255). Verlag Julius Klinkhardt. <a href=\"https://doi.org/10.35468/6126\">https://doi.org/10.35468/6126</a>"}},{"language":[{"iso":"eng"}],"_id":"56481","user_id":"55631","conference":{"end_date":"2024-12-12","location":"Sydney","name":"International Conference on Field Programmable Technology","start_date":"2024-12-10"},"author":[{"last_name":"Berganski","first_name":"Christoph","full_name":"Berganski, Christoph","id":"98854"},{"id":"55631","orcid":"0000-0003-4987-5708","first_name":"Felix","last_name":"Jentzsch","full_name":"Jentzsch, Felix"},{"last_name":"Platzner","first_name":"Marco","full_name":"Platzner, Marco","id":"398"},{"first_name":"Max","last_name":"Kuhmichel","full_name":"Kuhmichel, Max"},{"first_name":"Heiner","last_name":"Giefers","full_name":"Giefers, Heiner"}],"status":"public","title":"FINN-T: Compiling Custom Dataflow Accelerators for Quantized Transformers","year":"2024","date_updated":"2026-04-27T14:14:40Z","date_created":"2024-10-10T07:49:13Z","department":[{"_id":"78"}],"type":"conference","citation":{"chicago":"Berganski, Christoph, Felix Jentzsch, Marco Platzner, Max Kuhmichel, and Heiner Giefers. “FINN-T: Compiling Custom Dataflow Accelerators for Quantized Transformers,” 2024.","short":"C. Berganski, F. Jentzsch, M. Platzner, M. Kuhmichel, H. Giefers, in: 2024.","apa":"Berganski, C., Jentzsch, F., Platzner, M., Kuhmichel, M., &#38; Giefers, H. (2024). <i>FINN-T: Compiling Custom Dataflow Accelerators for Quantized Transformers</i>. International Conference on Field Programmable Technology, Sydney.","ieee":"C. Berganski, F. Jentzsch, M. Platzner, M. Kuhmichel, and H. Giefers, “FINN-T: Compiling Custom Dataflow Accelerators for Quantized Transformers,” presented at the International Conference on Field Programmable Technology, Sydney, 2024.","ama":"Berganski C, Jentzsch F, Platzner M, Kuhmichel M, Giefers H. FINN-T: Compiling Custom Dataflow Accelerators for Quantized Transformers. In: ; 2024.","bibtex":"@inproceedings{Berganski_Jentzsch_Platzner_Kuhmichel_Giefers_2024, title={FINN-T: Compiling Custom Dataflow Accelerators for Quantized Transformers}, author={Berganski, Christoph and Jentzsch, Felix and Platzner, Marco and Kuhmichel, Max and Giefers, Heiner}, year={2024} }","mla":"Berganski, Christoph, et al. <i>FINN-T: Compiling Custom Dataflow Accelerators for Quantized Transformers</i>. 2024."},"project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}]},{"user_id":"55631","_id":"54245","language":[{"iso":"eng"}],"date_updated":"2026-04-27T14:20:23Z","status":"public","year":"2024","title":"Exploring Custom FPGA Accelerators for DNN-based RF Fingerprinting","author":[{"first_name":"Luca-Sebastian","last_name":"Henke","full_name":"Henke, Luca-Sebastian"}],"type":"mastersthesis","department":[{"_id":"78"}],"date_created":"2024-05-13T14:00:01Z","project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"citation":{"apa":"Henke, L.-S. (2024). <i>Exploring Custom FPGA Accelerators for DNN-based RF Fingerprinting</i>.","ieee":"L.-S. Henke, <i>Exploring Custom FPGA Accelerators for DNN-based RF Fingerprinting</i>. 2024.","chicago":"Henke, Luca-Sebastian. <i>Exploring Custom FPGA Accelerators for DNN-Based RF Fingerprinting</i>, 2024.","short":"L.-S. Henke, Exploring Custom FPGA Accelerators for DNN-Based RF Fingerprinting, 2024.","mla":"Henke, Luca-Sebastian. <i>Exploring Custom FPGA Accelerators for DNN-Based RF Fingerprinting</i>. 2024.","ama":"Henke L-S. <i>Exploring Custom FPGA Accelerators for DNN-Based RF Fingerprinting</i>.; 2024.","bibtex":"@book{Henke_2024, title={Exploring Custom FPGA Accelerators for DNN-based RF Fingerprinting}, author={Henke, Luca-Sebastian}, year={2024} }"},"supervisor":[{"full_name":"Jentzsch, Felix","first_name":"Felix","orcid":"0000-0003-4987-5708","last_name":"Jentzsch","id":"55631"},{"last_name":"Platzner","first_name":"Marco","full_name":"Platzner, Marco","id":"398"}]},{"date_updated":"2026-04-30T10:41:25Z","conference":{"end_date":"2024-03-09","location":"Hannover","name":"GDSU-Jahrestagung","start_date":"2024-03-07"},"author":[{"id":"101166","full_name":"Reckmann, Eileen","first_name":"Eileen","last_name":"Reckmann"},{"id":"30086","first_name":"Katrin","last_name":"Temmen","full_name":"Temmen, Katrin"}],"year":"2024","title":"Erste Ergebnisse aus einer Interviewstudie mit Workshop-Moderierenden mobiler Schülerlaborangebote an außerschulischen Lernorten","status":"public","user_id":"101166","_id":"62047","language":[{"iso":"ger"}],"citation":{"mla":"Reckmann, Eileen, and Katrin Temmen. <i>Erste Ergebnisse aus einer Interviewstudie mit Workshop-Moderierenden mobiler Schülerlaborangebote an außerschulischen Lernorten</i>. 2024.","apa":"Reckmann, E., &#38; Temmen, K. (2024). <i>Erste Ergebnisse aus einer Interviewstudie mit Workshop-Moderierenden mobiler Schülerlaborangebote an außerschulischen Lernorten</i>. GDSU-Jahrestagung, Hannover.","ieee":"E. Reckmann and K. Temmen, “Erste Ergebnisse aus einer Interviewstudie mit Workshop-Moderierenden mobiler Schülerlaborangebote an außerschulischen Lernorten,” presented at the GDSU-Jahrestagung, Hannover, 2024.","short":"E. Reckmann, K. Temmen, in: 2024.","ama":"Reckmann E, Temmen K. Erste Ergebnisse aus einer Interviewstudie mit Workshop-Moderierenden mobiler Schülerlaborangebote an außerschulischen Lernorten. In: ; 2024.","chicago":"Reckmann, Eileen, and Katrin Temmen. “Erste Ergebnisse aus einer Interviewstudie mit Workshop-Moderierenden mobiler Schülerlaborangebote an außerschulischen Lernorten,” 2024.","bibtex":"@inproceedings{Reckmann_Temmen_2024, title={Erste Ergebnisse aus einer Interviewstudie mit Workshop-Moderierenden mobiler Schülerlaborangebote an außerschulischen Lernorten}, author={Reckmann, Eileen and Temmen, Katrin}, year={2024} }"},"department":[{"_id":"300"}],"type":"conference_abstract","date_created":"2025-11-03T10:12:06Z"},{"status":"public","volume":306,"user_id":"71541","_id":"50273","page":"7-17","citation":{"short":"A. Agarwal, S. Gharibian, V. Koppula, D. Rudolph, in: Proceedings of 49th International Symposium on Mathematical Foundations of Computer Science (MFCS), 2024, pp. 7–17.","chicago":"Agarwal, Avantika, Sevag Gharibian, Venkata Koppula, and Dorian Rudolph. “Quantum Polynomial Hierarchies: Karp-Lipton, Error Reduction, and Lower  Bounds.” In <i>Proceedings of 49th International Symposium on Mathematical Foundations of Computer Science (MFCS)</i>, 306:7–17, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2024.7\">https://doi.org/10.4230/LIPIcs.MFCS.2024.7</a>.","apa":"Agarwal, A., Gharibian, S., Koppula, V., &#38; Rudolph, D. (2024). Quantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower  bounds. <i>Proceedings of 49th International Symposium on Mathematical Foundations of Computer Science (MFCS)</i>, <i>306</i>(7), 7–17. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2024.7\">https://doi.org/10.4230/LIPIcs.MFCS.2024.7</a>","ieee":"A. Agarwal, S. Gharibian, V. Koppula, and D. Rudolph, “Quantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower  bounds,” in <i>Proceedings of 49th International Symposium on Mathematical Foundations of Computer Science (MFCS)</i>, 2024, vol. 306, no. 7, pp. 7–17, doi: <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2024.7\">10.4230/LIPIcs.MFCS.2024.7</a>.","ama":"Agarwal A, Gharibian S, Koppula V, Rudolph D. Quantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower  bounds. In: <i>Proceedings of 49th International Symposium on Mathematical Foundations of Computer Science (MFCS)</i>. Vol 306. ; 2024:7-17. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2024.7\">10.4230/LIPIcs.MFCS.2024.7</a>","bibtex":"@inproceedings{Agarwal_Gharibian_Koppula_Rudolph_2024, title={Quantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower  bounds}, volume={306}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2024.7\">10.4230/LIPIcs.MFCS.2024.7</a>}, number={7}, booktitle={Proceedings of 49th International Symposium on Mathematical Foundations of Computer Science (MFCS)}, author={Agarwal, Avantika and Gharibian, Sevag and Koppula, Venkata and Rudolph, Dorian}, year={2024}, pages={7–17} }","mla":"Agarwal, Avantika, et al. “Quantum Polynomial Hierarchies: Karp-Lipton, Error Reduction, and Lower  Bounds.” <i>Proceedings of 49th International Symposium on Mathematical Foundations of Computer Science (MFCS)</i>, vol. 306, no. 7, 2024, pp. 7–17, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2024.7\">10.4230/LIPIcs.MFCS.2024.7</a>."},"external_id":{"arxiv":["2401.01633"]},"intvolume":"       306","publication_status":"published","date_updated":"2026-05-15T08:39:23Z","author":[{"full_name":"Agarwal, Avantika","first_name":"Avantika","last_name":"Agarwal"},{"last_name":"Gharibian","first_name":"Sevag","orcid":"0000-0002-9992-3379","full_name":"Gharibian, Sevag","id":"71541"},{"full_name":"Koppula, Venkata","last_name":"Koppula","first_name":"Venkata"},{"first_name":"Dorian","last_name":"Rudolph","full_name":"Rudolph, Dorian","id":"57863"}],"title":"Quantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower  bounds","year":"2024","doi":"10.4230/LIPIcs.MFCS.2024.7","language":[{"iso":"eng"}],"abstract":[{"text":"The Polynomial-Time Hierarchy ($\\mathsf{PH}$) is a staple of classical\r\ncomplexity theory, with applications spanning randomized computation to circuit\r\nlower bounds to ''quantum advantage'' analyses for near-term quantum computers.\r\nQuantumly, however, despite the fact that at least \\emph{four} definitions of\r\nquantum $\\mathsf{PH}$ exist, it has been challenging to prove analogues for\r\nthese of even basic facts from $\\mathsf{PH}$. This work studies three\r\nquantum-verifier based generalizations of $\\mathsf{PH}$, two of which are from\r\n[Gharibian, Santha, Sikora, Sundaram, Yirka, 2022] and use classical strings\r\n($\\mathsf{QCPH}$) and quantum mixed states ($\\mathsf{QPH}$) as proofs, and one\r\nof which is new to this work, utilizing quantum pure states\r\n($\\mathsf{pureQPH}$) as proofs. We first resolve several open problems from\r\n[GSSSY22], including a collapse theorem and a Karp-Lipton theorem for\r\n$\\mathsf{QCPH}$. Then, for our new class $\\mathsf{pureQPH}$, we show one-sided\r\nerror reduction for $\\mathsf{pureQPH}$, as well as the first bounds relating\r\nthese quantum variants of $\\mathsf{PH}$, namely $\\mathsf{QCPH}\\subseteq\r\n\\mathsf{pureQPH} \\subseteq \\mathsf{EXP}^{\\mathsf{PP}}$.","lang":"eng"}],"issue":"7","publication":"Proceedings of 49th International Symposium on Mathematical Foundations of Computer Science (MFCS)","department":[{"_id":"7"},{"_id":"623"}],"type":"conference","date_created":"2024-01-07T20:09:32Z"},{"abstract":[{"lang":"eng","text":"What is the power of polynomial-time quantum computation with access to an NP\r\noracle? In this work, we focus on two fundamental tasks from the study of\r\nBoolean satisfiability (SAT) problems: search-to-decision reductions, and\r\napproximate counting. We first show that, in strong contrast to the classical\r\nsetting where a poly-time Turing machine requires $\\Theta(n)$ queries to an NP\r\noracle to compute a witness to a given SAT formula, quantumly $\\Theta(\\log n)$\r\nqueries suffice. We then show this is tight in the black-box model - any\r\nquantum algorithm with \"NP-like\" query access to a formula requires\r\n$\\Omega(\\log n)$ queries to extract a solution with constant probability.\r\nMoving to approximate counting of SAT solutions, by exploiting a quantum link\r\nbetween search-to-decision reductions and approximate counting, we show that\r\nexisting classical approximate counting algorithms are likely optimal. First,\r\nwe give a lower bound in the \"NP-like\" black-box query setting: Approximate\r\ncounting requires $\\Omega(\\log n)$ queries, even on a quantum computer. We then\r\ngive a \"white-box\" lower bound (i.e. where the input formula is not hidden in\r\nthe oracle) - if there exists a randomized poly-time classical or quantum\r\nalgorithm for approximate counting making $o(log n)$ NP queries, then\r\n$\\text{BPP}^{\\text{NP}[o(n)]}$ contains a $\\text{P}^{\\text{NP}}$-complete\r\nproblem if the algorithm is classical and $\\text{FBQP}^{\\text{NP}[o(n)]}$\r\ncontains an $\\text{FP}^{\\text{NP}}$-complete problem if the algorithm is\r\nquantum."}],"publication":"Proceedings of 51st EATCS International Colloquium on Automata, Languages and Programming (ICALP)","issue":"70","citation":{"ama":"Gharibian S, Kamminga J. BQP, meet NP: Search-to-decision reductions and approximate counting. In: <i>Proceedings of 51st EATCS International Colloquium on Automata, Languages and Programming (ICALP)</i>. Vol 297. ; 2024:1-19.","bibtex":"@inproceedings{Gharibian_Kamminga_2024, title={BQP, meet NP: Search-to-decision reductions and approximate counting}, volume={297}, number={70}, booktitle={Proceedings of 51st EATCS International Colloquium on Automata, Languages and Programming (ICALP)}, author={Gharibian, Sevag and Kamminga, Jonas}, year={2024}, pages={1–19} }","mla":"Gharibian, Sevag, and Jonas Kamminga. “BQP, Meet NP: Search-to-Decision Reductions and Approximate Counting.” <i>Proceedings of 51st EATCS International Colloquium on Automata, Languages and Programming (ICALP)</i>, vol. 297, no. 70, 2024, pp. 1–19.","short":"S. Gharibian, J. Kamminga, in: Proceedings of 51st EATCS International Colloquium on Automata, Languages and Programming (ICALP), 2024, pp. 1–19.","chicago":"Gharibian, Sevag, and Jonas Kamminga. “BQP, Meet NP: Search-to-Decision Reductions and Approximate Counting.” In <i>Proceedings of 51st EATCS International Colloquium on Automata, Languages and Programming (ICALP)</i>, 297:1–19, 2024.","apa":"Gharibian, S., &#38; Kamminga, J. (2024). BQP, meet NP: Search-to-decision reductions and approximate counting. <i>Proceedings of 51st EATCS International Colloquium on Automata, Languages and Programming (ICALP)</i>, <i>297</i>(70), 1–19.","ieee":"S. Gharibian and J. Kamminga, “BQP, meet NP: Search-to-decision reductions and approximate counting,” in <i>Proceedings of 51st EATCS International Colloquium on Automata, Languages and Programming (ICALP)</i>, 2024, vol. 297, no. 70, pp. 1–19."},"type":"conference","department":[{"_id":"7"},{"_id":"623"}],"external_id":{"arxiv":["2401.03943"]},"date_created":"2024-01-09T13:59:44Z","date_updated":"2026-05-15T08:41:59Z","publication_status":"published","intvolume":"       297","title":"BQP, meet NP: Search-to-decision reductions and approximate counting","status":"public","year":"2024","author":[{"id":"71541","last_name":"Gharibian","first_name":"Sevag","orcid":"0000-0002-9992-3379","full_name":"Gharibian, Sevag"},{"full_name":"Kamminga, Jonas","last_name":"Kamminga","first_name":"Jonas"}],"user_id":"71541","volume":297,"page":"1-19","_id":"50406","language":[{"iso":"eng"}]}]