[{"citation":{"ieee":"P. Arias-Cabarcos, M. Fallahi, T. Habrich, K. Schulze, C. Becker, and T. Strufe, “Performance and Usability Evaluation of Brainwave Authentication Techniques with Consumer Devices,” <i>ACM Transactions on Privacy and Security</i>, vol. 26, no. 3, pp. 1–36, 2023, doi: <a href=\"https://doi.org/10.1145/3579356\">10.1145/3579356</a>.","apa":"Arias-Cabarcos, P., Fallahi, M., Habrich, T., Schulze, K., Becker, C., &#38; Strufe, T. (2023). Performance and Usability Evaluation of Brainwave Authentication Techniques with Consumer Devices. <i>ACM Transactions on Privacy and Security</i>, <i>26</i>(3), 1–36. <a href=\"https://doi.org/10.1145/3579356\">https://doi.org/10.1145/3579356</a>","mla":"Arias-Cabarcos, Patricia, et al. “Performance and Usability Evaluation of Brainwave Authentication Techniques with Consumer Devices.” <i>ACM Transactions on Privacy and Security</i>, vol. 26, no. 3, Association for Computing Machinery (ACM), 2023, pp. 1–36, doi:<a href=\"https://doi.org/10.1145/3579356\">10.1145/3579356</a>.","bibtex":"@article{Arias-Cabarcos_Fallahi_Habrich_Schulze_Becker_Strufe_2023, title={Performance and Usability Evaluation of Brainwave Authentication Techniques with Consumer Devices}, volume={26}, DOI={<a href=\"https://doi.org/10.1145/3579356\">10.1145/3579356</a>}, number={3}, journal={ACM Transactions on Privacy and Security}, publisher={Association for Computing Machinery (ACM)}, author={Arias-Cabarcos, Patricia and Fallahi, Matin and Habrich, Thilo and Schulze, Karen and Becker, Christian and Strufe, Thorsten}, year={2023}, pages={1–36} }","ama":"Arias-Cabarcos P, Fallahi M, Habrich T, Schulze K, Becker C, Strufe T. Performance and Usability Evaluation of Brainwave Authentication Techniques with Consumer Devices. <i>ACM Transactions on Privacy and Security</i>. 2023;26(3):1-36. doi:<a href=\"https://doi.org/10.1145/3579356\">10.1145/3579356</a>","short":"P. Arias-Cabarcos, M. Fallahi, T. Habrich, K. Schulze, C. Becker, T. Strufe, ACM Transactions on Privacy and Security 26 (2023) 1–36.","chicago":"Arias-Cabarcos, Patricia, Matin Fallahi, Thilo Habrich, Karen Schulze, Christian Becker, and Thorsten Strufe. “Performance and Usability Evaluation of Brainwave Authentication Techniques with Consumer Devices.” <i>ACM Transactions on Privacy and Security</i> 26, no. 3 (2023): 1–36. <a href=\"https://doi.org/10.1145/3579356\">https://doi.org/10.1145/3579356</a>."},"user_id":"92804","volume":26,"page":"1-36","_id":"48063","publisher":"Association for Computing Machinery (ACM)","status":"public","type":"journal_article","keyword":["Safety","Risk","Reliability and Quality","General Computer Science"],"date_created":"2023-10-14T12:11:55Z","abstract":[{"lang":"eng","text":"<jats:p>Brainwaves have demonstrated to be unique enough across individuals to be useful as biometrics. They also provide promising advantages over traditional means of authentication, such as resistance to external observability, revocability, and intrinsic liveness detection. However, most of the research so far has been conducted with expensive, bulky, medical-grade helmets, which offer limited applicability for everyday usage. With the aim to bring brainwave authentication and its benefits closer to real world deployment, we investigate brain biometrics with consumer devices. We conduct a comprehensive measurement experiment and user study that compare five authentication tasks on a user sample up to 10 times larger than those from previous studies, introducing three novel techniques based on cognitive semantic processing. Furthermore, we apply our analysis on high-quality open brainwave data obtained with a medical-grade headset, to assess the differences. We investigate both the performance, security, and usability of the different options and use this evidence to elicit design and research recommendations. Our results show that it is possible to achieve Equal Error Rates as low as 7.2% (a reduction between 68–72% with respect to existing approaches) based on brain responses to images with current inexpensive technology. We show that the common practice of testing authentication systems only with known attacker data is unrealistic and may lead to overly optimistic evaluations. With regard to adoption, users call for simpler devices, faster authentication, and better privacy.</jats:p>\r\n          <jats:p />"}],"issue":"3","publication":"ACM Transactions on Privacy and Security","doi":"10.1145/3579356","language":[{"iso":"eng"}],"date_updated":"2023-10-14T12:12:42Z","publication_status":"published","intvolume":"        26","title":"Performance and Usability Evaluation of Brainwave Authentication Techniques with Consumer Devices","year":"2023","author":[{"full_name":"Arias-Cabarcos, Patricia","first_name":"Patricia","last_name":"Arias-Cabarcos"},{"last_name":"Fallahi","first_name":"Matin","full_name":"Fallahi, Matin"},{"full_name":"Habrich, Thilo","first_name":"Thilo","last_name":"Habrich"},{"full_name":"Schulze, Karen","first_name":"Karen","last_name":"Schulze"},{"full_name":"Becker, Christian","last_name":"Becker","first_name":"Christian"},{"full_name":"Strufe, Thorsten","last_name":"Strufe","first_name":"Thorsten"}],"publication_identifier":{"issn":["2471-2566","2471-2574"]}},{"extern":"1","abstract":[{"lang":"eng","text":"<jats:title>Abstract</jats:title><jats:p>Consider a set of jobs connected to a directed acyclic task graph with a fixed source and sink. The edges of this graph model precedence constraints and the jobs have to be scheduled with respect to those. We introduce the server cloud scheduling problem, in which the jobs have to be processed either on a single local machine or on one of infinitely many cloud machines. For each job, processing times both on the server and in the cloud are given. Furthermore, for each edge in the task graph, a communication delay is included in the input and has to be taken into account if one of the two jobs is scheduled on the server and the other in the cloud. The server processes jobs sequentially, whereas the cloud can serve as many as needed in parallel, but induces costs. We consider both makespan and cost minimization. The main results are an FPTAS for the makespan objective for graphs with a constant source and sink dividing cut and strong hardness for the case with unit processing times and delays.</jats:p>"}],"publication":"Algorithmica","department":[{"_id":"63"}],"type":"journal_article","keyword":["Applied Mathematics","Computer Science Applications","General Computer Science"],"date_created":"2024-01-11T11:10:53Z","publication_status":"published","date_updated":"2024-01-11T11:19:33Z","publication_identifier":{"issn":["0178-4617","1432-0541"]},"author":[{"last_name":"Maack","first_name":"Marten","full_name":"Maack, Marten","id":"88252"},{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"id":"44428","full_name":"Pukrop, Simon","last_name":"Pukrop","first_name":"Simon"}],"title":"Server Cloud Scheduling","year":"2023","doi":"10.1007/s00453-023-01189-x","language":[{"iso":"eng"}],"project":[{"_id":"1","grant_number":"160364472","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten "},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter Dienste in konfigurierbaren Rechenzentren (Subproject C4)","grant_number":"160364472","_id":"16"}],"citation":{"chicago":"Maack, Marten, Friedhelm Meyer auf der Heide, and Simon Pukrop. “Server Cloud Scheduling.” <i>Algorithmica</i>, 2023. <a href=\"https://doi.org/10.1007/s00453-023-01189-x\">https://doi.org/10.1007/s00453-023-01189-x</a>.","short":"M. Maack, F. Meyer auf der Heide, S. Pukrop, Algorithmica (2023).","apa":"Maack, M., Meyer auf der Heide, F., &#38; Pukrop, S. (2023). Server Cloud Scheduling. <i>Algorithmica</i>. <a href=\"https://doi.org/10.1007/s00453-023-01189-x\">https://doi.org/10.1007/s00453-023-01189-x</a>","ieee":"M. Maack, F. Meyer auf der Heide, and S. Pukrop, “Server Cloud Scheduling,” <i>Algorithmica</i>, 2023, doi: <a href=\"https://doi.org/10.1007/s00453-023-01189-x\">10.1007/s00453-023-01189-x</a>.","ama":"Maack M, Meyer auf der Heide F, Pukrop S. Server Cloud Scheduling. <i>Algorithmica</i>. Published online 2023. doi:<a href=\"https://doi.org/10.1007/s00453-023-01189-x\">10.1007/s00453-023-01189-x</a>","bibtex":"@article{Maack_Meyer auf der Heide_Pukrop_2023, title={Server Cloud Scheduling}, DOI={<a href=\"https://doi.org/10.1007/s00453-023-01189-x\">10.1007/s00453-023-01189-x</a>}, journal={Algorithmica}, publisher={Springer Science and Business Media LLC}, author={Maack, Marten and Meyer auf der Heide, Friedhelm and Pukrop, Simon}, year={2023} }","mla":"Maack, Marten, et al. “Server Cloud Scheduling.” <i>Algorithmica</i>, Springer Science and Business Media LLC, 2023, doi:<a href=\"https://doi.org/10.1007/s00453-023-01189-x\">10.1007/s00453-023-01189-x</a>."},"status":"public","user_id":"44428","_id":"50458","publisher":"Springer Science and Business Media LLC"},{"publication":"IEEE Access","date_created":"2024-04-05T09:01:49Z","department":[{"_id":"263"}],"keyword":["General Engineering","General Materials Science","General Computer Science","Electrical and Electronic Engineering"],"type":"journal_article","author":[{"full_name":"Soleymani, Mohammad","last_name":"Soleymani","first_name":"Mohammad"},{"full_name":"Santamaria, Ignacio","last_name":"Santamaria","first_name":"Ignacio"},{"full_name":"Jorswieck, Eduard A.","last_name":"Jorswieck","first_name":"Eduard A."}],"publication_identifier":{"issn":["2169-3536"]},"year":"2023","title":"Spectral and Energy Efficiency Maximization of MISO STAR-RIS-Assisted URLLC Systems","intvolume":"        11","date_updated":"2024-04-05T13:21:01Z","publication_status":"published","language":[{"iso":"eng"}],"doi":"10.1109/access.2023.3294092","citation":{"mla":"Soleymani, Mohammad, et al. “Spectral and Energy Efficiency Maximization of MISO STAR-RIS-Assisted URLLC Systems.” <i>IEEE Access</i>, vol. 11, Institute of Electrical and Electronics Engineers (IEEE), 2023, pp. 70833–52, doi:<a href=\"https://doi.org/10.1109/access.2023.3294092\">10.1109/access.2023.3294092</a>.","bibtex":"@article{Soleymani_Santamaria_Jorswieck_2023, title={Spectral and Energy Efficiency Maximization of MISO STAR-RIS-Assisted URLLC Systems}, volume={11}, DOI={<a href=\"https://doi.org/10.1109/access.2023.3294092\">10.1109/access.2023.3294092</a>}, journal={IEEE Access}, publisher={Institute of Electrical and Electronics Engineers (IEEE)}, author={Soleymani, Mohammad and Santamaria, Ignacio and Jorswieck, Eduard A.}, year={2023}, pages={70833–70852} }","ama":"Soleymani M, Santamaria I, Jorswieck EA. Spectral and Energy Efficiency Maximization of MISO STAR-RIS-Assisted URLLC Systems. <i>IEEE Access</i>. 2023;11:70833-70852. doi:<a href=\"https://doi.org/10.1109/access.2023.3294092\">10.1109/access.2023.3294092</a>","ieee":"M. Soleymani, I. Santamaria, and E. A. Jorswieck, “Spectral and Energy Efficiency Maximization of MISO STAR-RIS-Assisted URLLC Systems,” <i>IEEE Access</i>, vol. 11, pp. 70833–70852, 2023, doi: <a href=\"https://doi.org/10.1109/access.2023.3294092\">10.1109/access.2023.3294092</a>.","apa":"Soleymani, M., Santamaria, I., &#38; Jorswieck, E. A. (2023). Spectral and Energy Efficiency Maximization of MISO STAR-RIS-Assisted URLLC Systems. <i>IEEE Access</i>, <i>11</i>, 70833–70852. <a href=\"https://doi.org/10.1109/access.2023.3294092\">https://doi.org/10.1109/access.2023.3294092</a>","short":"M. Soleymani, I. Santamaria, E.A. Jorswieck, IEEE Access 11 (2023) 70833–70852.","chicago":"Soleymani, Mohammad, Ignacio Santamaria, and Eduard A. Jorswieck. “Spectral and Energy Efficiency Maximization of MISO STAR-RIS-Assisted URLLC Systems.” <i>IEEE Access</i> 11 (2023): 70833–52. <a href=\"https://doi.org/10.1109/access.2023.3294092\">https://doi.org/10.1109/access.2023.3294092</a>."},"status":"public","_id":"53263","publisher":"Institute of Electrical and Electronics Engineers (IEEE)","page":"70833-70852","volume":11,"user_id":"67076"},{"_id":"53225","publisher":"Elsevier BV","user_id":"51811","volume":185,"status":"public","citation":{"bibtex":"@article{Hilbert_Dellnitz_Kleine_Tavana_2023, title={A novel indicator for sustainability in production planning using Center of Gravity-based assessment of Pareto fronts}, volume={185}, DOI={<a href=\"https://doi.org/10.1016/j.cie.2023.109618\">10.1016/j.cie.2023.109618</a>}, number={109618}, journal={Computers &#38; Industrial Engineering}, publisher={Elsevier BV}, author={Hilbert, Markus and Dellnitz, Andreas and Kleine, Andreas and Tavana, Madjid}, year={2023} }","ama":"Hilbert M, Dellnitz A, Kleine A, Tavana M. A novel indicator for sustainability in production planning using Center of Gravity-based assessment of Pareto fronts. <i>Computers &#38; Industrial Engineering</i>. 2023;185. doi:<a href=\"https://doi.org/10.1016/j.cie.2023.109618\">10.1016/j.cie.2023.109618</a>","mla":"Hilbert, Markus, et al. “A Novel Indicator for Sustainability in Production Planning Using Center of Gravity-Based Assessment of Pareto Fronts.” <i>Computers &#38; Industrial Engineering</i>, vol. 185, 109618, Elsevier BV, 2023, doi:<a href=\"https://doi.org/10.1016/j.cie.2023.109618\">10.1016/j.cie.2023.109618</a>.","chicago":"Hilbert, Markus, Andreas Dellnitz, Andreas Kleine, and Madjid Tavana. “A Novel Indicator for Sustainability in Production Planning Using Center of Gravity-Based Assessment of Pareto Fronts.” <i>Computers &#38; Industrial Engineering</i> 185 (2023). <a href=\"https://doi.org/10.1016/j.cie.2023.109618\">https://doi.org/10.1016/j.cie.2023.109618</a>.","short":"M. Hilbert, A. Dellnitz, A. Kleine, M. Tavana, Computers &#38; Industrial Engineering 185 (2023).","ieee":"M. Hilbert, A. Dellnitz, A. Kleine, and M. Tavana, “A novel indicator for sustainability in production planning using Center of Gravity-based assessment of Pareto fronts,” <i>Computers &#38; Industrial Engineering</i>, vol. 185, Art. no. 109618, 2023, doi: <a href=\"https://doi.org/10.1016/j.cie.2023.109618\">10.1016/j.cie.2023.109618</a>.","apa":"Hilbert, M., Dellnitz, A., Kleine, A., &#38; Tavana, M. (2023). A novel indicator for sustainability in production planning using Center of Gravity-based assessment of Pareto fronts. <i>Computers &#38; Industrial Engineering</i>, <i>185</i>, Article 109618. <a href=\"https://doi.org/10.1016/j.cie.2023.109618\">https://doi.org/10.1016/j.cie.2023.109618</a>"},"article_number":"109618","language":[{"iso":"eng"}],"doi":"10.1016/j.cie.2023.109618","title":"A novel indicator for sustainability in production planning using Center of Gravity-based assessment of Pareto fronts","year":"2023","author":[{"full_name":"Hilbert, Markus","last_name":"Hilbert","first_name":"Markus"},{"last_name":"Dellnitz","first_name":"Andreas","full_name":"Dellnitz, Andreas"},{"full_name":"Kleine, Andreas","last_name":"Kleine","first_name":"Andreas"},{"last_name":"Tavana","first_name":"Madjid","full_name":"Tavana, Madjid","id":"31858"}],"publication_identifier":{"issn":["0360-8352"]},"publication_status":"published","date_updated":"2024-04-15T13:13:19Z","intvolume":"       185","date_created":"2024-04-04T13:54:44Z","keyword":["General Engineering","General Computer Science"],"type":"journal_article","department":[{"_id":"277"}],"publication":"Computers & Industrial Engineering"},{"citation":{"ieee":"A. Robles-González, P. Arias Cabarcos, and J. Parra-Arnau, “Privacy-centered authentication: A new framework and analysis,” <i>Computers &#38;amp; Security</i>, vol. 132, Art. no. 103353, 2023, doi: <a href=\"https://doi.org/10.1016/j.cose.2023.103353\">10.1016/j.cose.2023.103353</a>.","apa":"Robles-González, A., Arias Cabarcos, P., &#38; Parra-Arnau, J. (2023). Privacy-centered authentication: A new framework and analysis. <i>Computers &#38;amp; Security</i>, <i>132</i>, Article 103353. <a href=\"https://doi.org/10.1016/j.cose.2023.103353\">https://doi.org/10.1016/j.cose.2023.103353</a>","short":"A. Robles-González, P. Arias Cabarcos, J. Parra-Arnau, Computers &#38;amp; Security 132 (2023).","chicago":"Robles-González, Antonio, Patricia Arias Cabarcos, and Javier Parra-Arnau. “Privacy-Centered Authentication: A New Framework and Analysis.” <i>Computers &#38;amp; Security</i> 132 (2023). <a href=\"https://doi.org/10.1016/j.cose.2023.103353\">https://doi.org/10.1016/j.cose.2023.103353</a>.","mla":"Robles-González, Antonio, et al. “Privacy-Centered Authentication: A New Framework and Analysis.” <i>Computers &#38;amp; Security</i>, vol. 132, 103353, Elsevier BV, 2023, doi:<a href=\"https://doi.org/10.1016/j.cose.2023.103353\">10.1016/j.cose.2023.103353</a>.","bibtex":"@article{Robles-González_Arias Cabarcos_Parra-Arnau_2023, title={Privacy-centered authentication: A new framework and analysis}, volume={132}, DOI={<a href=\"https://doi.org/10.1016/j.cose.2023.103353\">10.1016/j.cose.2023.103353</a>}, number={103353}, journal={Computers &#38;amp; Security}, publisher={Elsevier BV}, author={Robles-González, Antonio and Arias Cabarcos, Patricia and Parra-Arnau, Javier}, year={2023} }","ama":"Robles-González A, Arias Cabarcos P, Parra-Arnau J. Privacy-centered authentication: A new framework and analysis. <i>Computers &#38;amp; Security</i>. 2023;132. doi:<a href=\"https://doi.org/10.1016/j.cose.2023.103353\">10.1016/j.cose.2023.103353</a>"},"publication":"Computers &amp; Security","keyword":["Law","General Computer Science"],"type":"journal_article","date_created":"2024-04-17T13:17:58Z","intvolume":"       132","publication_status":"published","date_updated":"2024-04-17T13:18:31Z","publication_identifier":{"issn":["0167-4048"]},"author":[{"full_name":"Robles-González, Antonio","first_name":"Antonio","last_name":"Robles-González"},{"last_name":"Arias Cabarcos","first_name":"Patricia","full_name":"Arias Cabarcos, Patricia","id":"92804"},{"first_name":"Javier","last_name":"Parra-Arnau","full_name":"Parra-Arnau, Javier"}],"title":"Privacy-centered authentication: A new framework and analysis","status":"public","year":"2023","volume":132,"user_id":"92804","doi":"10.1016/j.cose.2023.103353","language":[{"iso":"eng"}],"_id":"53541","publisher":"Elsevier BV","article_number":"103353"},{"publication":"Computers & Education","date_created":"2023-09-15T12:57:53Z","file":[{"file_id":"55665","success":1,"content_type":"application/pdf","relation":"main_file","date_updated":"2024-08-21T08:56:23Z","file_name":"1-s2.0-S036013152300177X-main.pdf","access_level":"closed","file_size":4364880,"date_created":"2024-08-21T08:56:23Z","creator":"riejon"}],"department":[{"_id":"299"}],"keyword":["Education","General Computer Science"],"type":"journal_article","author":[{"full_name":"Schubatzky, Thomas","last_name":"Schubatzky","first_name":"Thomas"},{"first_name":"Jan-Philipp","last_name":"Burde","full_name":"Burde, Jan-Philipp"},{"id":"99511","first_name":"Rike Isabel","last_name":"Große-Heilmann","orcid":"0000-0001-8713-3014","full_name":"Große-Heilmann, Rike Isabel"},{"last_name":"Haagen-Schützenhöfer","first_name":"Claudia","full_name":"Haagen-Schützenhöfer, Claudia"},{"last_name":"Riese","first_name":"Josef","orcid":"0000-0003-2927-2619","full_name":"Riese, Josef","id":"429"},{"full_name":"Weiler, David","first_name":"David","last_name":"Weiler"}],"publication_identifier":{"issn":["0360-1315"]},"year":"2023","title":"Predicting the development of digital media PCK/TPACK: The role of PCK, motivation to use digital media, interest in and previous experience with digital media","intvolume":"       206","publication_status":"published","date_updated":"2024-08-21T08:57:00Z","language":[{"iso":"eng"}],"article_number":"104900","doi":"10.1016/j.compedu.2023.104900","citation":{"short":"T. Schubatzky, J.-P. Burde, R.I. Große-Heilmann, C. Haagen-Schützenhöfer, J. Riese, D. Weiler, Computers &#38; Education 206 (2023).","ama":"Schubatzky T, Burde J-P, Große-Heilmann RI, Haagen-Schützenhöfer C, Riese J, Weiler D. Predicting the development of digital media PCK/TPACK: The role of PCK, motivation to use digital media, interest in and previous experience with digital media. <i>Computers &#38; Education</i>. 2023;206. doi:<a href=\"https://doi.org/10.1016/j.compedu.2023.104900\">10.1016/j.compedu.2023.104900</a>","chicago":"Schubatzky, Thomas, Jan-Philipp Burde, Rike Isabel Große-Heilmann, Claudia Haagen-Schützenhöfer, Josef Riese, and David Weiler. “Predicting the Development of Digital Media PCK/TPACK: The Role of PCK, Motivation to Use Digital Media, Interest in and Previous Experience with Digital Media.” <i>Computers &#38; Education</i> 206 (2023). <a href=\"https://doi.org/10.1016/j.compedu.2023.104900\">https://doi.org/10.1016/j.compedu.2023.104900</a>.","bibtex":"@article{Schubatzky_Burde_Große-Heilmann_Haagen-Schützenhöfer_Riese_Weiler_2023, title={Predicting the development of digital media PCK/TPACK: The role of PCK, motivation to use digital media, interest in and previous experience with digital media}, volume={206}, DOI={<a href=\"https://doi.org/10.1016/j.compedu.2023.104900\">10.1016/j.compedu.2023.104900</a>}, number={104900}, journal={Computers &#38; Education}, publisher={Elsevier BV}, author={Schubatzky, Thomas and Burde, Jan-Philipp and Große-Heilmann, Rike Isabel and Haagen-Schützenhöfer, Claudia and Riese, Josef and Weiler, David}, year={2023} }","apa":"Schubatzky, T., Burde, J.-P., Große-Heilmann, R. I., Haagen-Schützenhöfer, C., Riese, J., &#38; Weiler, D. (2023). Predicting the development of digital media PCK/TPACK: The role of PCK, motivation to use digital media, interest in and previous experience with digital media. <i>Computers &#38; Education</i>, <i>206</i>, Article 104900. <a href=\"https://doi.org/10.1016/j.compedu.2023.104900\">https://doi.org/10.1016/j.compedu.2023.104900</a>","mla":"Schubatzky, Thomas, et al. “Predicting the Development of Digital Media PCK/TPACK: The Role of PCK, Motivation to Use Digital Media, Interest in and Previous Experience with Digital Media.” <i>Computers &#38; Education</i>, vol. 206, 104900, Elsevier BV, 2023, doi:<a href=\"https://doi.org/10.1016/j.compedu.2023.104900\">10.1016/j.compedu.2023.104900</a>.","ieee":"T. Schubatzky, J.-P. Burde, R. I. Große-Heilmann, C. Haagen-Schützenhöfer, J. Riese, and D. Weiler, “Predicting the development of digital media PCK/TPACK: The role of PCK, motivation to use digital media, interest in and previous experience with digital media,” <i>Computers &#38; Education</i>, vol. 206, Art. no. 104900, 2023, doi: <a href=\"https://doi.org/10.1016/j.compedu.2023.104900\">10.1016/j.compedu.2023.104900</a>."},"file_date_updated":"2024-08-21T08:56:23Z","status":"public","has_accepted_license":"1","_id":"47085","publisher":"Elsevier BV","volume":206,"user_id":"429","ddc":["370"]},{"publication":"Theoretical Computer Science","department":[{"_id":"63"}],"keyword":["General Computer Science","Theoretical Computer Science"],"type":"journal_article","date_created":"2022-10-28T05:11:16Z","intvolume":"       939","article_type":"original","date_updated":"2023-01-30T09:20:09Z","publication_status":"published","author":[{"id":"38705","full_name":"Castenow, Jannik","first_name":"Jannik","last_name":"Castenow"},{"id":"47213","first_name":"Jonas","last_name":"Harbig","full_name":"Harbig, Jonas"},{"id":"37827","full_name":"Jung, Daniel","first_name":"Daniel","last_name":"Jung"},{"id":"39241","first_name":"Till","orcid":"0000-0003-2014-4696","last_name":"Knollmann","full_name":"Knollmann, Till"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"publication_identifier":{"issn":["0304-3975"]},"title":"Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation","year":"2023","doi":"10.1016/j.tcs.2022.10.031","language":[{"iso":"eng"}],"project":[{"_id":"106","name":"Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme"}],"citation":{"bibtex":"@article{Castenow_Harbig_Jung_Knollmann_Meyer auf der Heide_2023, title={Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation}, volume={939}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2022.10.031\">10.1016/j.tcs.2022.10.031</a>}, journal={Theoretical Computer Science}, publisher={Elsevier BV}, author={Castenow, Jannik and Harbig, Jonas and Jung, Daniel and Knollmann, Till and Meyer auf der Heide, Friedhelm}, year={2023}, pages={261–291} }","ama":"Castenow J, Harbig J, Jung D, Knollmann T, Meyer auf der Heide F. Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation. <i>Theoretical Computer Science</i>. 2023;939:261-291. doi:<a href=\"https://doi.org/10.1016/j.tcs.2022.10.031\">10.1016/j.tcs.2022.10.031</a>","mla":"Castenow, Jannik, et al. “Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation.” <i>Theoretical Computer Science</i>, vol. 939, Elsevier BV, 2023, pp. 261–91, doi:<a href=\"https://doi.org/10.1016/j.tcs.2022.10.031\">10.1016/j.tcs.2022.10.031</a>.","chicago":"Castenow, Jannik, Jonas Harbig, Daniel Jung, Till Knollmann, and Friedhelm Meyer auf der Heide. “Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation.” <i>Theoretical Computer Science</i> 939 (2023): 261–91. <a href=\"https://doi.org/10.1016/j.tcs.2022.10.031\">https://doi.org/10.1016/j.tcs.2022.10.031</a>.","short":"J. Castenow, J. Harbig, D. Jung, T. Knollmann, F. Meyer auf der Heide, Theoretical Computer Science 939 (2023) 261–291.","ieee":"J. Castenow, J. Harbig, D. Jung, T. Knollmann, and F. Meyer auf der Heide, “Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation,” <i>Theoretical Computer Science</i>, vol. 939, pp. 261–291, 2023, doi: <a href=\"https://doi.org/10.1016/j.tcs.2022.10.031\">10.1016/j.tcs.2022.10.031</a>.","apa":"Castenow, J., Harbig, J., Jung, D., Knollmann, T., &#38; Meyer auf der Heide, F. (2023). Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation. <i>Theoretical Computer Science</i>, <i>939</i>, 261–291. <a href=\"https://doi.org/10.1016/j.tcs.2022.10.031\">https://doi.org/10.1016/j.tcs.2022.10.031</a>"},"external_id":{"arxiv":["2010.04424 "]},"status":"public","volume":939,"user_id":"38705","_id":"33947","publisher":"Elsevier BV","page":"261-291"},{"status":"public","user_id":"24135","_id":"38041","publisher":"Association for Computing Machinery (ACM)","quality_controlled":"1","project":[{"name":"PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"_id":"1","grant_number":"160364472","name":"SFB 901: SFB 901"},{"grant_number":"160364472","_id":"14","name":"SFB 901 - C2: SFB 901 - Subproject C2"}],"citation":{"short":"M. Meyer, T. Kenter, C. Plessl, ACM Transactions on Reconfigurable Technology and Systems (2023).","chicago":"Meyer, Marius, Tobias Kenter, and Christian Plessl. “Multi-FPGA Designs and Scaling of HPC Challenge Benchmarks via MPI and Circuit-Switched Inter-FPGA Networks.” <i>ACM Transactions on Reconfigurable Technology and Systems</i>, 2023. <a href=\"https://doi.org/10.1145/3576200\">https://doi.org/10.1145/3576200</a>.","apa":"Meyer, M., Kenter, T., &#38; Plessl, C. (2023). Multi-FPGA Designs and Scaling of HPC Challenge Benchmarks via MPI and Circuit-Switched Inter-FPGA Networks. <i>ACM Transactions on Reconfigurable Technology and Systems</i>. <a href=\"https://doi.org/10.1145/3576200\">https://doi.org/10.1145/3576200</a>","ieee":"M. Meyer, T. Kenter, and C. Plessl, “Multi-FPGA Designs and Scaling of HPC Challenge Benchmarks via MPI and Circuit-Switched Inter-FPGA Networks,” <i>ACM Transactions on Reconfigurable Technology and Systems</i>, 2023, doi: <a href=\"https://doi.org/10.1145/3576200\">10.1145/3576200</a>.","ama":"Meyer M, Kenter T, Plessl C. Multi-FPGA Designs and Scaling of HPC Challenge Benchmarks via MPI and Circuit-Switched Inter-FPGA Networks. <i>ACM Transactions on Reconfigurable Technology and Systems</i>. Published online 2023. doi:<a href=\"https://doi.org/10.1145/3576200\">10.1145/3576200</a>","bibtex":"@article{Meyer_Kenter_Plessl_2023, title={Multi-FPGA Designs and Scaling of HPC Challenge Benchmarks via MPI and Circuit-Switched Inter-FPGA Networks}, DOI={<a href=\"https://doi.org/10.1145/3576200\">10.1145/3576200</a>}, journal={ACM Transactions on Reconfigurable Technology and Systems}, publisher={Association for Computing Machinery (ACM)}, author={Meyer, Marius and Kenter, Tobias and Plessl, Christian}, year={2023} }","mla":"Meyer, Marius, et al. “Multi-FPGA Designs and Scaling of HPC Challenge Benchmarks via MPI and Circuit-Switched Inter-FPGA Networks.” <i>ACM Transactions on Reconfigurable Technology and Systems</i>, Association for Computing Machinery (ACM), 2023, doi:<a href=\"https://doi.org/10.1145/3576200\">10.1145/3576200</a>."},"oa":"1","publication_status":"published","date_updated":"2023-07-28T08:02:05Z","title":"Multi-FPGA Designs and Scaling of HPC Challenge Benchmarks via MPI and Circuit-Switched Inter-FPGA Networks","year":"2023","author":[{"last_name":"Meyer","first_name":"Marius","full_name":"Meyer, Marius","id":"40778"},{"id":"3145","last_name":"Kenter","first_name":"Tobias","full_name":"Kenter, Tobias"},{"full_name":"Plessl, Christian","orcid":"0000-0001-5728-9982","first_name":"Christian","last_name":"Plessl","id":"16153"}],"publication_identifier":{"issn":["1936-7406","1936-7414"]},"doi":"10.1145/3576200","main_file_link":[{"url":"https://dl.acm.org/doi/10.1145/3576200","open_access":"1"}],"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"<jats:p>While FPGA accelerator boards and their respective high-level design tools are maturing, there is still a lack of multi-FPGA applications, libraries, and not least, benchmarks and reference implementations towards sustained HPC usage of these devices. As in the early days of GPUs in HPC, for workloads that can reasonably be decoupled into loosely coupled working sets, multi-accelerator support can be achieved by using standard communication interfaces like MPI on the host side. However, for performance and productivity, some applications can profit from a tighter coupling of the accelerators. FPGAs offer unique opportunities here when extending the dataflow characteristics to their communication interfaces.</jats:p>\r\n          <jats:p>In this work, we extend the HPCC FPGA benchmark suite by multi-FPGA support and three missing benchmarks that particularly characterize or stress inter-device communication: b_eff, PTRANS, and LINPACK. With all benchmarks implemented for current boards with Intel and Xilinx FPGAs, we established a baseline for multi-FPGA performance. Additionally, for the communication-centric benchmarks, we explored the potential of direct FPGA-to-FPGA communication with a circuit-switched inter-FPGA network that is currently only available for one of the boards. The evaluation with parallel execution on up to 26 FPGA boards makes use of one of the largest academic FPGA installations.</jats:p>"}],"publication":"ACM Transactions on Reconfigurable Technology and Systems","keyword":["General Computer Science"],"type":"journal_article","department":[{"_id":"27"},{"_id":"518"}],"date_created":"2023-01-23T08:40:42Z"},{"title":"Steady-State Error Compensation for Reinforcement Learning-Based Control of Power Electronic Systems","year":"2023","author":[{"full_name":"Weber, Daniel","last_name":"Weber","first_name":"Daniel"},{"full_name":"Schenke, Maximilian","last_name":"Schenke","first_name":"Maximilian"},{"first_name":"Oliver","last_name":"Wallscheid","full_name":"Wallscheid, Oliver"}],"publication_identifier":{"issn":["2169-3536"]},"date_updated":"2023-07-31T07:04:48Z","publication_status":"published","intvolume":"        11","language":[{"iso":"eng"}],"doi":"10.1109/access.2023.3297274","publication":"IEEE Access","date_created":"2023-07-31T07:04:27Z","type":"journal_article","keyword":["General Engineering","General Materials Science","General Computer Science","Electrical and Electronic Engineering"],"department":[{"_id":"34"},{"_id":"52"}],"status":"public","page":"76524-76536","publisher":"Institute of Electrical and Electronics Engineers (IEEE)","_id":"46213","user_id":"24041","volume":11,"citation":{"mla":"Weber, Daniel, et al. “Steady-State Error Compensation for Reinforcement Learning-Based Control of Power Electronic Systems.” <i>IEEE Access</i>, vol. 11, Institute of Electrical and Electronics Engineers (IEEE), 2023, pp. 76524–36, doi:<a href=\"https://doi.org/10.1109/access.2023.3297274\">10.1109/access.2023.3297274</a>.","ama":"Weber D, Schenke M, Wallscheid O. Steady-State Error Compensation for Reinforcement Learning-Based Control of Power Electronic Systems. <i>IEEE Access</i>. 2023;11:76524-76536. doi:<a href=\"https://doi.org/10.1109/access.2023.3297274\">10.1109/access.2023.3297274</a>","bibtex":"@article{Weber_Schenke_Wallscheid_2023, title={Steady-State Error Compensation for Reinforcement Learning-Based Control of Power Electronic Systems}, volume={11}, DOI={<a href=\"https://doi.org/10.1109/access.2023.3297274\">10.1109/access.2023.3297274</a>}, journal={IEEE Access}, publisher={Institute of Electrical and Electronics Engineers (IEEE)}, author={Weber, Daniel and Schenke, Maximilian and Wallscheid, Oliver}, year={2023}, pages={76524–76536} }","apa":"Weber, D., Schenke, M., &#38; Wallscheid, O. (2023). Steady-State Error Compensation for Reinforcement Learning-Based Control of Power Electronic Systems. <i>IEEE Access</i>, <i>11</i>, 76524–76536. <a href=\"https://doi.org/10.1109/access.2023.3297274\">https://doi.org/10.1109/access.2023.3297274</a>","ieee":"D. Weber, M. Schenke, and O. Wallscheid, “Steady-State Error Compensation for Reinforcement Learning-Based Control of Power Electronic Systems,” <i>IEEE Access</i>, vol. 11, pp. 76524–76536, 2023, doi: <a href=\"https://doi.org/10.1109/access.2023.3297274\">10.1109/access.2023.3297274</a>.","chicago":"Weber, Daniel, Maximilian Schenke, and Oliver Wallscheid. “Steady-State Error Compensation for Reinforcement Learning-Based Control of Power Electronic Systems.” <i>IEEE Access</i> 11 (2023): 76524–36. <a href=\"https://doi.org/10.1109/access.2023.3297274\">https://doi.org/10.1109/access.2023.3297274</a>.","short":"D. Weber, M. Schenke, O. Wallscheid, IEEE Access 11 (2023) 76524–76536."}},{"doi":"10.1109/access.2023.3300694","user_id":"67234","publisher":"Institute of Electrical and Electronics Engineers (IEEE)","_id":"46517","page":"1-1","date_updated":"2023-08-16T09:03:52Z","publication_status":"published","publication_identifier":{"issn":["2169-3536"]},"author":[{"full_name":"Ahmed, Abdullah Fathi","first_name":"Abdullah Fathi","last_name":"Ahmed"},{"full_name":"Sherif, Mohamed Ahmed","last_name":"Sherif","first_name":"Mohamed Ahmed"},{"full_name":"Ngomo, Axel-Cyrille Ngonga","first_name":"Axel-Cyrille Ngonga","last_name":"Ngomo"}],"title":"NELLIE: Never-Ending Linking for Linked Open Data","year":"2023","status":"public","type":"journal_article","keyword":["General Engineering","General Materials Science","General Computer Science","Electrical and Electronic Engineering"],"date_created":"2023-08-16T08:57:39Z","citation":{"apa":"Ahmed, A. F., Sherif, M. A., &#38; Ngomo, A.-C. N. (2023). NELLIE: Never-Ending Linking for Linked Open Data. <i>IEEE Access</i>, 1–1. <a href=\"https://doi.org/10.1109/access.2023.3300694\">https://doi.org/10.1109/access.2023.3300694</a>","mla":"Ahmed, Abdullah Fathi, et al. “NELLIE: Never-Ending Linking for Linked Open Data.” <i>IEEE Access</i>, Institute of Electrical and Electronics Engineers (IEEE), 2023, pp. 1–1, doi:<a href=\"https://doi.org/10.1109/access.2023.3300694\">10.1109/access.2023.3300694</a>.","ieee":"A. F. Ahmed, M. A. Sherif, and A.-C. N. Ngomo, “NELLIE: Never-Ending Linking for Linked Open Data,” <i>IEEE Access</i>, pp. 1–1, 2023, doi: <a href=\"https://doi.org/10.1109/access.2023.3300694\">10.1109/access.2023.3300694</a>.","short":"A.F. Ahmed, M.A. Sherif, A.-C.N. Ngomo, IEEE Access (2023) 1–1.","ama":"Ahmed AF, Sherif MA, Ngomo A-CN. NELLIE: Never-Ending Linking for Linked Open Data. <i>IEEE Access</i>. Published online 2023:1-1. doi:<a href=\"https://doi.org/10.1109/access.2023.3300694\">10.1109/access.2023.3300694</a>","chicago":"Ahmed, Abdullah Fathi, Mohamed Ahmed Sherif, and Axel-Cyrille Ngonga Ngomo. “NELLIE: Never-Ending Linking for Linked Open Data.” <i>IEEE Access</i>, 2023, 1–1. <a href=\"https://doi.org/10.1109/access.2023.3300694\">https://doi.org/10.1109/access.2023.3300694</a>.","bibtex":"@article{Ahmed_Sherif_Ngomo_2023, title={NELLIE: Never-Ending Linking for Linked Open Data}, DOI={<a href=\"https://doi.org/10.1109/access.2023.3300694\">10.1109/access.2023.3300694</a>}, journal={IEEE Access}, publisher={Institute of Electrical and Electronics Engineers (IEEE)}, author={Ahmed, Abdullah Fathi and Sherif, Mohamed Ahmed and Ngomo, Axel-Cyrille Ngonga}, year={2023}, pages={1–1} }"},"publication":"IEEE Access"},{"department":[{"_id":"288"},{"_id":"623"},{"_id":"15"}],"keyword":["General Physics and Astronomy","Mathematical Physics","Applied Mathematics","Electronic","Optical and Magnetic Materials","Electrical and Electronic Engineering","General Computer Science"],"type":"journal_article","date_created":"2023-04-20T12:38:23Z","publication":"PRX Quantum","issue":"2","doi":"10.1103/prxquantum.4.020306","language":[{"iso":"eng"}],"article_number":"020306","intvolume":"         4","publication_status":"published","date_updated":"2025-12-18T16:15:18Z","publication_identifier":{"issn":["2691-3399"]},"author":[{"full_name":"Serino, Laura","last_name":"Serino","first_name":"Laura","id":"88242"},{"id":"51223","full_name":"Gil López, Jano","last_name":"Gil López","first_name":"Jano"},{"id":"42777","last_name":"Stefszky","first_name":"Michael","full_name":"Stefszky, Michael"},{"full_name":"Ricken, Raimund","first_name":"Raimund","last_name":"Ricken"},{"id":"13244","full_name":"Eigner, Christof","first_name":"Christof","last_name":"Eigner","orcid":"https://orcid.org/0000-0002-5693-3083"},{"id":"27150","full_name":"Brecht, Benjamin","first_name":"Benjamin","last_name":"Brecht","orcid":"0000-0003-4140-0556 "},{"full_name":"Silberhorn, Christine","first_name":"Christine","last_name":"Silberhorn","id":"26263"}],"year":"2023","title":"Realization of a Multi-Output Quantum Pulse Gate for Decoding High-Dimensional Temporal Modes of Single-Photon States","citation":{"apa":"Serino, L., Gil López, J., Stefszky, M., Ricken, R., Eigner, C., Brecht, B., &#38; Silberhorn, C. (2023). Realization of a Multi-Output Quantum Pulse Gate for Decoding High-Dimensional Temporal Modes of Single-Photon States. <i>PRX Quantum</i>, <i>4</i>(2), Article 020306. <a href=\"https://doi.org/10.1103/prxquantum.4.020306\">https://doi.org/10.1103/prxquantum.4.020306</a>","ieee":"L. Serino <i>et al.</i>, “Realization of a Multi-Output Quantum Pulse Gate for Decoding High-Dimensional Temporal Modes of Single-Photon States,” <i>PRX Quantum</i>, vol. 4, no. 2, Art. no. 020306, 2023, doi: <a href=\"https://doi.org/10.1103/prxquantum.4.020306\">10.1103/prxquantum.4.020306</a>.","short":"L. Serino, J. Gil López, M. Stefszky, R. Ricken, C. Eigner, B. Brecht, C. Silberhorn, PRX Quantum 4 (2023).","chicago":"Serino, Laura, Jano Gil López, Michael Stefszky, Raimund Ricken, Christof Eigner, Benjamin Brecht, and Christine Silberhorn. “Realization of a Multi-Output Quantum Pulse Gate for Decoding High-Dimensional Temporal Modes of Single-Photon States.” <i>PRX Quantum</i> 4, no. 2 (2023). <a href=\"https://doi.org/10.1103/prxquantum.4.020306\">https://doi.org/10.1103/prxquantum.4.020306</a>.","mla":"Serino, Laura, et al. “Realization of a Multi-Output Quantum Pulse Gate for Decoding High-Dimensional Temporal Modes of Single-Photon States.” <i>PRX Quantum</i>, vol. 4, no. 2, 020306, American Physical Society (APS), 2023, doi:<a href=\"https://doi.org/10.1103/prxquantum.4.020306\">10.1103/prxquantum.4.020306</a>.","ama":"Serino L, Gil López J, Stefszky M, et al. Realization of a Multi-Output Quantum Pulse Gate for Decoding High-Dimensional Temporal Modes of Single-Photon States. <i>PRX Quantum</i>. 2023;4(2). doi:<a href=\"https://doi.org/10.1103/prxquantum.4.020306\">10.1103/prxquantum.4.020306</a>","bibtex":"@article{Serino_Gil López_Stefszky_Ricken_Eigner_Brecht_Silberhorn_2023, title={Realization of a Multi-Output Quantum Pulse Gate for Decoding High-Dimensional Temporal Modes of Single-Photon States}, volume={4}, DOI={<a href=\"https://doi.org/10.1103/prxquantum.4.020306\">10.1103/prxquantum.4.020306</a>}, number={2020306}, journal={PRX Quantum}, publisher={American Physical Society (APS)}, author={Serino, Laura and Gil López, Jano and Stefszky, Michael and Ricken, Raimund and Eigner, Christof and Brecht, Benjamin and Silberhorn, Christine}, year={2023} }"},"volume":4,"user_id":"27150","_id":"44081","publisher":"American Physical Society (APS)","status":"public"},{"date_created":"2024-01-07T18:19:42Z","department":[{"_id":"7"},{"_id":"623"}],"keyword":["General Mathematics","General Computer Science"],"type":"journal_article","issue":"4","publication":"SIAM Journal on Computing","language":[{"iso":"eng"}],"doi":"10.1137/22m1513721","author":[{"id":"71541","full_name":"Gharibian, Sevag","first_name":"Sevag","orcid":"0000-0002-9992-3379","last_name":"Gharibian"},{"last_name":"Le Gall","first_name":"François","full_name":"Le Gall, François"}],"publication_identifier":{"issn":["0097-5397","1095-7111"]},"year":"2023","title":"Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture","intvolume":"        52","date_updated":"2026-05-15T08:42:17Z","publication_status":"published","citation":{"bibtex":"@article{Gharibian_Le Gall_2023, title={Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture}, volume={52}, DOI={<a href=\"https://doi.org/10.1137/22m1513721\">10.1137/22m1513721</a>}, number={4}, journal={SIAM Journal on Computing}, publisher={Society for Industrial &#38; Applied Mathematics (SIAM)}, author={Gharibian, Sevag and Le Gall, François}, year={2023}, pages={1009–1038} }","ama":"Gharibian S, Le Gall F. Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture. <i>SIAM Journal on Computing</i>. 2023;52(4):1009-1038. doi:<a href=\"https://doi.org/10.1137/22m1513721\">10.1137/22m1513721</a>","mla":"Gharibian, Sevag, and François Le Gall. “Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture.” <i>SIAM Journal on Computing</i>, vol. 52, no. 4, Society for Industrial &#38; Applied Mathematics (SIAM), 2023, pp. 1009–38, doi:<a href=\"https://doi.org/10.1137/22m1513721\">10.1137/22m1513721</a>.","chicago":"Gharibian, Sevag, and François Le Gall. “Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture.” <i>SIAM Journal on Computing</i> 52, no. 4 (2023): 1009–38. <a href=\"https://doi.org/10.1137/22m1513721\">https://doi.org/10.1137/22m1513721</a>.","short":"S. Gharibian, F. Le Gall, SIAM Journal on Computing 52 (2023) 1009–1038.","ieee":"S. Gharibian and F. Le Gall, “Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture,” <i>SIAM Journal on Computing</i>, vol. 52, no. 4, pp. 1009–1038, 2023, doi: <a href=\"https://doi.org/10.1137/22m1513721\">10.1137/22m1513721</a>.","apa":"Gharibian, S., &#38; Le Gall, F. (2023). Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture. <i>SIAM Journal on Computing</i>, <i>52</i>(4), 1009–1038. <a href=\"https://doi.org/10.1137/22m1513721\">https://doi.org/10.1137/22m1513721</a>"},"_id":"50271","publisher":"Society for Industrial & Applied Mathematics (SIAM)","page":"1009-1038","volume":52,"user_id":"71541","status":"public"},{"citation":{"bibtex":"@article{Fischer_Fuhry_Kußmaul_Janneck_Kerschbaum_Bodden_2022, title={Computation on Encrypted Data Using Dataflow Authentication}, volume={25}, DOI={<a href=\"https://doi.org/10.1145/3513005\">10.1145/3513005</a>}, number={3}, journal={ACM Transactions on Privacy and Security}, publisher={Association for Computing Machinery (ACM)}, author={Fischer, Andreas and Fuhry, Benny and Kußmaul, Jörn and Janneck, Jonas and Kerschbaum, Florian and Bodden, Eric}, year={2022}, pages={1–36} }","ama":"Fischer A, Fuhry B, Kußmaul J, Janneck J, Kerschbaum F, Bodden E. Computation on Encrypted Data Using Dataflow Authentication. <i>ACM Transactions on Privacy and Security</i>. 2022;25(3):1-36. doi:<a href=\"https://doi.org/10.1145/3513005\">10.1145/3513005</a>","mla":"Fischer, Andreas, et al. “Computation on Encrypted Data Using Dataflow Authentication.” <i>ACM Transactions on Privacy and Security</i>, vol. 25, no. 3, Association for Computing Machinery (ACM), 2022, pp. 1–36, doi:<a href=\"https://doi.org/10.1145/3513005\">10.1145/3513005</a>.","short":"A. Fischer, B. Fuhry, J. Kußmaul, J. Janneck, F. Kerschbaum, E. Bodden, ACM Transactions on Privacy and Security 25 (2022) 1–36.","chicago":"Fischer, Andreas, Benny Fuhry, Jörn Kußmaul, Jonas Janneck, Florian Kerschbaum, and Eric Bodden. “Computation on Encrypted Data Using Dataflow Authentication.” <i>ACM Transactions on Privacy and Security</i> 25, no. 3 (2022): 1–36. <a href=\"https://doi.org/10.1145/3513005\">https://doi.org/10.1145/3513005</a>.","ieee":"A. Fischer, B. Fuhry, J. Kußmaul, J. Janneck, F. Kerschbaum, and E. Bodden, “Computation on Encrypted Data Using Dataflow Authentication,” <i>ACM Transactions on Privacy and Security</i>, vol. 25, no. 3, pp. 1–36, 2022, doi: <a href=\"https://doi.org/10.1145/3513005\">10.1145/3513005</a>.","apa":"Fischer, A., Fuhry, B., Kußmaul, J., Janneck, J., Kerschbaum, F., &#38; Bodden, E. (2022). Computation on Encrypted Data Using Dataflow Authentication. <i>ACM Transactions on Privacy and Security</i>, <i>25</i>(3), 1–36. <a href=\"https://doi.org/10.1145/3513005\">https://doi.org/10.1145/3513005</a>"},"volume":25,"user_id":"15249","_id":"31844","publisher":"Association for Computing Machinery (ACM)","page":"1-36","status":"public","department":[{"_id":"76"}],"keyword":["Safety","Risk","Reliability and Quality","General Computer Science"],"type":"journal_article","date_created":"2022-06-09T10:28:03Z","abstract":[{"lang":"eng","text":"<jats:p>Encrypting data before sending it to the cloud ensures data confidentiality but requires the cloud to compute on encrypted data. Trusted execution environments, such as Intel SGX enclaves, promise to provide a secure environment in which data can be decrypted and then processed. However, vulnerabilities in the executed program give attackers ample opportunities to execute arbitrary code inside the enclave. This code can modify the dataflow of the program and leak secrets via SGX side channels. Fully homomorphic encryption would be an alternative to compute on encrypted data without data leaks. However, due to its high computational complexity, its applicability to general-purpose computing remains limited. Researchers have made several proposals for transforming programs to perform encrypted computations on less powerful encryption schemes. Yet current approaches do not support programs making control-flow decisions based on encrypted data.</jats:p>\r\n          <jats:p>\r\n            We introduce the concept of\r\n            <jats:italic>dataflow authentication</jats:italic>\r\n            (DFAuth) to enable such programs. DFAuth prevents an adversary from arbitrarily deviating from the dataflow of a program. Our technique hence offers protections against the side-channel attacks described previously. We implemented two flavors of DFAuth, a Java bytecode-to-bytecode compiler, and an SGX enclave running a small and program-independent trusted code base. We applied DFAuth to a neural network performing machine learning on sensitive medical data and a smart charging scheduler for electric vehicles. Our transformation yields a neural network with encrypted weights, which can be evaluated on encrypted inputs in\r\n            <jats:inline-formula content-type=\"math/tex\">\r\n              <jats:tex-math notation=\"LaTeX\" version=\"MathJax\">\\( 12.55 \\,\\mathrm{m}\\mathrm{s} \\)</jats:tex-math>\r\n            </jats:inline-formula>\r\n            . Our protected scheduler is capable of updating the encrypted charging plan in approximately 1.06 seconds.\r\n          </jats:p>"}],"publication":"ACM Transactions on Privacy and Security","issue":"3","doi":"10.1145/3513005","language":[{"iso":"eng"}],"intvolume":"        25","date_updated":"2022-06-09T10:29:19Z","publication_status":"published","author":[{"full_name":"Fischer, Andreas","first_name":"Andreas","last_name":"Fischer"},{"full_name":"Fuhry, Benny","first_name":"Benny","last_name":"Fuhry"},{"last_name":"Kußmaul","first_name":"Jörn","full_name":"Kußmaul, Jörn"},{"full_name":"Janneck, Jonas","first_name":"Jonas","last_name":"Janneck"},{"full_name":"Kerschbaum, Florian","first_name":"Florian","last_name":"Kerschbaum"},{"full_name":"Bodden, Eric","first_name":"Eric","last_name":"Bodden","orcid":"0000-0003-3470-3647","id":"59256"}],"publication_identifier":{"issn":["2471-2566","2471-2574"]},"year":"2022","title":"Computation on Encrypted Data Using Dataflow Authentication"},{"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Subproject A1"}],"publication":"Algorithmica","citation":{"ieee":"S. Baswana, S. Gupta, and T. Knollmann, “Mincut Sensitivity Data Structures for the Insertion of an Edge,” <i>Algorithmica</i>, 2022, doi: <a href=\"https://doi.org/10.1007/s00453-022-00978-0\">10.1007/s00453-022-00978-0</a>.","apa":"Baswana, S., Gupta, S., &#38; Knollmann, T. (2022). Mincut Sensitivity Data Structures for the Insertion of an Edge. <i>Algorithmica</i>. <a href=\"https://doi.org/10.1007/s00453-022-00978-0\">https://doi.org/10.1007/s00453-022-00978-0</a>","short":"S. Baswana, S. Gupta, T. Knollmann, Algorithmica (2022).","chicago":"Baswana, Surender, Shiv Gupta, and Till Knollmann. “Mincut Sensitivity Data Structures for the Insertion of an Edge.” <i>Algorithmica</i>, 2022. <a href=\"https://doi.org/10.1007/s00453-022-00978-0\">https://doi.org/10.1007/s00453-022-00978-0</a>.","mla":"Baswana, Surender, et al. “Mincut Sensitivity Data Structures for the Insertion of an Edge.” <i>Algorithmica</i>, Springer Science and Business Media LLC, 2022, doi:<a href=\"https://doi.org/10.1007/s00453-022-00978-0\">10.1007/s00453-022-00978-0</a>.","bibtex":"@article{Baswana_Gupta_Knollmann_2022, title={Mincut Sensitivity Data Structures for the Insertion of an Edge}, DOI={<a href=\"https://doi.org/10.1007/s00453-022-00978-0\">10.1007/s00453-022-00978-0</a>}, journal={Algorithmica}, publisher={Springer Science and Business Media LLC}, author={Baswana, Surender and Gupta, Shiv and Knollmann, Till}, year={2022} }","ama":"Baswana S, Gupta S, Knollmann T. Mincut Sensitivity Data Structures for the Insertion of an Edge. <i>Algorithmica</i>. Published online 2022. doi:<a href=\"https://doi.org/10.1007/s00453-022-00978-0\">10.1007/s00453-022-00978-0</a>"},"keyword":["Applied Mathematics","Computer Science Applications","General Computer Science"],"type":"journal_article","department":[{"_id":"63"}],"date_created":"2022-05-27T10:09:24Z","date_updated":"2022-05-27T10:14:27Z","publication_status":"published","title":"Mincut Sensitivity Data Structures for the Insertion of an Edge","status":"public","year":"2022","publication_identifier":{"issn":["0178-4617","1432-0541"]},"author":[{"first_name":"Surender","last_name":"Baswana","full_name":"Baswana, Surender"},{"full_name":"Gupta, Shiv","last_name":"Gupta","first_name":"Shiv"},{"id":"39241","orcid":"0000-0003-2014-4696","first_name":"Till","last_name":"Knollmann","full_name":"Knollmann, Till"}],"doi":"10.1007/s00453-022-00978-0","user_id":"39241","genbank":["tillk"],"_id":"31479","language":[{"iso":"eng"}],"publisher":"Springer Science and Business Media LLC"},{"citation":{"bibtex":"@article{Bonnard_Cots_Gergaud_Wembe Moafo_2022, title={Abnormal geodesics in 2D-Zermelo navigation problems in the case of revolution and the fan shape of the small time balls}, volume={161}, DOI={<a href=\"https://doi.org/10.1016/j.sysconle.2022.105140\">10.1016/j.sysconle.2022.105140</a>}, number={105140}, journal={Systems &#38;amp; Control Letters}, publisher={Elsevier BV}, author={Bonnard, B. and Cots, O. and Gergaud, J. and Wembe Moafo, Boris Edgar}, year={2022} }","ama":"Bonnard B, Cots O, Gergaud J, Wembe Moafo BE. Abnormal geodesics in 2D-Zermelo navigation problems in the case of revolution and the fan shape of the small time balls. <i>Systems &#38;amp; Control Letters</i>. 2022;161. doi:<a href=\"https://doi.org/10.1016/j.sysconle.2022.105140\">10.1016/j.sysconle.2022.105140</a>","mla":"Bonnard, B., et al. “Abnormal Geodesics in 2D-Zermelo Navigation Problems in the Case of Revolution and the Fan Shape of the Small Time Balls.” <i>Systems &#38;amp; Control Letters</i>, vol. 161, 105140, Elsevier BV, 2022, doi:<a href=\"https://doi.org/10.1016/j.sysconle.2022.105140\">10.1016/j.sysconle.2022.105140</a>.","chicago":"Bonnard, B., O. Cots, J. Gergaud, and Boris Edgar Wembe Moafo. “Abnormal Geodesics in 2D-Zermelo Navigation Problems in the Case of Revolution and the Fan Shape of the Small Time Balls.” <i>Systems &#38;amp; Control Letters</i> 161 (2022). <a href=\"https://doi.org/10.1016/j.sysconle.2022.105140\">https://doi.org/10.1016/j.sysconle.2022.105140</a>.","short":"B. Bonnard, O. Cots, J. Gergaud, B.E. Wembe Moafo, Systems &#38;amp; Control Letters 161 (2022).","ieee":"B. Bonnard, O. Cots, J. Gergaud, and B. E. Wembe Moafo, “Abnormal geodesics in 2D-Zermelo navigation problems in the case of revolution and the fan shape of the small time balls,” <i>Systems &#38;amp; Control Letters</i>, vol. 161, Art. no. 105140, 2022, doi: <a href=\"https://doi.org/10.1016/j.sysconle.2022.105140\">10.1016/j.sysconle.2022.105140</a>.","apa":"Bonnard, B., Cots, O., Gergaud, J., &#38; Wembe Moafo, B. E. (2022). Abnormal geodesics in 2D-Zermelo navigation problems in the case of revolution and the fan shape of the small time balls. <i>Systems &#38;amp; Control Letters</i>, <i>161</i>, Article 105140. <a href=\"https://doi.org/10.1016/j.sysconle.2022.105140\">https://doi.org/10.1016/j.sysconle.2022.105140</a>"},"publication":"Systems &amp; Control Letters","keyword":["Electrical and Electronic Engineering","Mechanical Engineering","General Computer Science","Control and Systems Engineering"],"type":"journal_article","date_created":"2022-10-24T12:54:24Z","intvolume":"       161","publication_status":"published","date_updated":"2023-01-16T12:08:58Z","author":[{"full_name":"Bonnard, B.","last_name":"Bonnard","first_name":"B."},{"full_name":"Cots, O.","last_name":"Cots","first_name":"O."},{"full_name":"Gergaud, J.","last_name":"Gergaud","first_name":"J."},{"full_name":"Wembe Moafo, Boris Edgar","first_name":"Boris Edgar","last_name":"Wembe Moafo","id":"95394"}],"publication_identifier":{"issn":["0167-6911"]},"status":"public","year":"2022","title":"Abnormal geodesics in 2D-Zermelo navigation problems in the case of revolution and the fan shape of the small time balls","volume":161,"user_id":"95394","doi":"10.1016/j.sysconle.2022.105140","publisher":"Elsevier BV","_id":"33869","language":[{"iso":"eng"}],"article_number":"105140"},{"citation":{"mla":"Mirhosseini, Hossein, et al. “An Automated Approach for Developing Neural Network Interatomic Potentials with FLAME.” <i>Computational Materials Science</i>, vol. 197, 110567, Elsevier BV, 2021, doi:<a href=\"https://doi.org/10.1016/j.commatsci.2021.110567\">10.1016/j.commatsci.2021.110567</a>.","bibtex":"@article{Mirhosseini_Tahmasbi_Kuchana_Ghasemi_Kühne_2021, title={An automated approach for developing neural network interatomic potentials with FLAME}, volume={197}, DOI={<a href=\"https://doi.org/10.1016/j.commatsci.2021.110567\">10.1016/j.commatsci.2021.110567</a>}, number={110567}, journal={Computational Materials Science}, publisher={Elsevier BV}, author={Mirhosseini, Hossein and Tahmasbi, Hossein and Kuchana, Sai Ram and Ghasemi, Alireza and Kühne, Thomas}, year={2021} }","ama":"Mirhosseini H, Tahmasbi H, Kuchana SR, Ghasemi A, Kühne T. An automated approach for developing neural network interatomic potentials with FLAME. <i>Computational Materials Science</i>. 2021;197. doi:<a href=\"https://doi.org/10.1016/j.commatsci.2021.110567\">10.1016/j.commatsci.2021.110567</a>","ieee":"H. Mirhosseini, H. Tahmasbi, S. R. Kuchana, A. Ghasemi, and T. Kühne, “An automated approach for developing neural network interatomic potentials with FLAME,” <i>Computational Materials Science</i>, vol. 197, Art. no. 110567, 2021, doi: <a href=\"https://doi.org/10.1016/j.commatsci.2021.110567\">10.1016/j.commatsci.2021.110567</a>.","apa":"Mirhosseini, H., Tahmasbi, H., Kuchana, S. R., Ghasemi, A., &#38; Kühne, T. (2021). An automated approach for developing neural network interatomic potentials with FLAME. <i>Computational Materials Science</i>, <i>197</i>, Article 110567. <a href=\"https://doi.org/10.1016/j.commatsci.2021.110567\">https://doi.org/10.1016/j.commatsci.2021.110567</a>","short":"H. Mirhosseini, H. Tahmasbi, S.R. Kuchana, A. Ghasemi, T. Kühne, Computational Materials Science 197 (2021).","chicago":"Mirhosseini, Hossein, Hossein Tahmasbi, Sai Ram Kuchana, Alireza Ghasemi, and Thomas Kühne. “An Automated Approach for Developing Neural Network Interatomic Potentials with FLAME.” <i>Computational Materials Science</i> 197 (2021). <a href=\"https://doi.org/10.1016/j.commatsci.2021.110567\">https://doi.org/10.1016/j.commatsci.2021.110567</a>."},"status":"public","volume":197,"user_id":"71051","publisher":"Elsevier BV","_id":"33657","publication":"Computational Materials Science","department":[{"_id":"613"}],"type":"journal_article","keyword":["Computational Mathematics","General Physics and Astronomy","Mechanics of Materials","General Materials Science","General Chemistry","General Computer Science"],"date_created":"2022-10-10T08:23:50Z","intvolume":"       197","date_updated":"2022-10-10T08:24:13Z","publication_status":"published","publication_identifier":{"issn":["0927-0256"]},"author":[{"id":"71051","orcid":"0000-0001-6179-1545","last_name":"Mirhosseini","first_name":"Hossein","full_name":"Mirhosseini, Hossein"},{"full_name":"Tahmasbi, Hossein","first_name":"Hossein","last_name":"Tahmasbi"},{"last_name":"Kuchana","first_name":"Sai Ram","full_name":"Kuchana, Sai Ram"},{"id":"77282","first_name":"Alireza","last_name":"Ghasemi","full_name":"Ghasemi, Alireza"},{"full_name":"Kühne, Thomas","first_name":"Thomas","last_name":"Kühne","id":"49079"}],"title":"An automated approach for developing neural network interatomic potentials with FLAME","year":"2021","doi":"10.1016/j.commatsci.2021.110567","language":[{"iso":"eng"}],"article_number":"110567"},{"user_id":"67076","volume":9,"page":"96948-96963","_id":"53268","publisher":"Institute of Electrical and Electronics Engineers (IEEE)","status":"public","citation":{"short":"M. Soleymani, I. Santamaria, P.J. Schreier, IEEE Access 9 (2021) 96948–96963.","chicago":"Soleymani, Mohammad, Ignacio Santamaria, and Peter J. Schreier. “Distributed Algorithms for Spectral and Energy-Efficiency Maximization of <i>K</i>-User Interference Channels.” <i>IEEE Access</i> 9 (2021): 96948–63. <a href=\"https://doi.org/10.1109/access.2021.3094976\">https://doi.org/10.1109/access.2021.3094976</a>.","apa":"Soleymani, M., Santamaria, I., &#38; Schreier, P. J. (2021). Distributed Algorithms for Spectral and Energy-Efficiency Maximization of <i>K</i>-User Interference Channels. <i>IEEE Access</i>, <i>9</i>, 96948–96963. <a href=\"https://doi.org/10.1109/access.2021.3094976\">https://doi.org/10.1109/access.2021.3094976</a>","ieee":"M. Soleymani, I. Santamaria, and P. J. Schreier, “Distributed Algorithms for Spectral and Energy-Efficiency Maximization of <i>K</i>-User Interference Channels,” <i>IEEE Access</i>, vol. 9, pp. 96948–96963, 2021, doi: <a href=\"https://doi.org/10.1109/access.2021.3094976\">10.1109/access.2021.3094976</a>.","ama":"Soleymani M, Santamaria I, Schreier PJ. Distributed Algorithms for Spectral and Energy-Efficiency Maximization of <i>K</i>-User Interference Channels. <i>IEEE Access</i>. 2021;9:96948-96963. doi:<a href=\"https://doi.org/10.1109/access.2021.3094976\">10.1109/access.2021.3094976</a>","bibtex":"@article{Soleymani_Santamaria_Schreier_2021, title={Distributed Algorithms for Spectral and Energy-Efficiency Maximization of <i>K</i>-User Interference Channels}, volume={9}, DOI={<a href=\"https://doi.org/10.1109/access.2021.3094976\">10.1109/access.2021.3094976</a>}, journal={IEEE Access}, publisher={Institute of Electrical and Electronics Engineers (IEEE)}, author={Soleymani, Mohammad and Santamaria, Ignacio and Schreier, Peter J.}, year={2021}, pages={96948–96963} }","mla":"Soleymani, Mohammad, et al. “Distributed Algorithms for Spectral and Energy-Efficiency Maximization of <i>K</i>-User Interference Channels.” <i>IEEE Access</i>, vol. 9, Institute of Electrical and Electronics Engineers (IEEE), 2021, pp. 96948–63, doi:<a href=\"https://doi.org/10.1109/access.2021.3094976\">10.1109/access.2021.3094976</a>."},"doi":"10.1109/access.2021.3094976","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2024-04-05T13:20:18Z","intvolume":"         9","title":"Distributed Algorithms for Spectral and Energy-Efficiency Maximization of <i>K</i>-User Interference Channels","year":"2021","publication_identifier":{"issn":["2169-3536"]},"author":[{"full_name":"Soleymani, Mohammad","last_name":"Soleymani","first_name":"Mohammad"},{"last_name":"Santamaria","first_name":"Ignacio","full_name":"Santamaria, Ignacio"},{"first_name":"Peter J.","last_name":"Schreier","full_name":"Schreier, Peter J."}],"type":"journal_article","keyword":["General Engineering","General Materials Science","General Computer Science"],"department":[{"_id":"263"}],"date_created":"2024-04-05T09:04:50Z","publication":"IEEE Access"},{"author":[{"full_name":"Zahera, H.M.A","first_name":"H.M.A","last_name":"Zahera"},{"full_name":"Jalota, Rricha","last_name":"Jalota","first_name":"Rricha"},{"full_name":"Sherif, Mohamed Ahmed","first_name":"Mohamed Ahmed","last_name":"Sherif"},{"full_name":"Ngomo, Axel-Cyrille Ngonga","last_name":"Ngomo","first_name":"Axel-Cyrille Ngonga"}],"publication_identifier":{"issn":["2169-3536"]},"status":"public","title":"I-AID: Identifying Actionable Information From Disaster-Related Tweets","year":"2021","intvolume":"         9","publication_status":"published","date_updated":"2023-06-23T09:24:06Z","_id":"30372","publisher":"Institute of Electrical and Electronics Engineers (IEEE)","language":[{"iso":"eng"}],"page":"118861-118870","volume":9,"user_id":"72768","doi":"10.1109/access.2021.3107812","citation":{"bibtex":"@article{Zahera_Jalota_Sherif_Ngomo_2021, title={I-AID: Identifying Actionable Information From Disaster-Related Tweets}, volume={9}, DOI={<a href=\"https://doi.org/10.1109/access.2021.3107812\">10.1109/access.2021.3107812</a>}, journal={IEEE Access}, publisher={Institute of Electrical and Electronics Engineers (IEEE)}, author={Zahera, H.M.A and Jalota, Rricha and Sherif, Mohamed Ahmed and Ngomo, Axel-Cyrille Ngonga}, year={2021}, pages={118861–118870} }","ama":"Zahera HMA, Jalota R, Sherif MA, Ngomo A-CN. I-AID: Identifying Actionable Information From Disaster-Related Tweets. <i>IEEE Access</i>. 2021;9:118861-118870. doi:<a href=\"https://doi.org/10.1109/access.2021.3107812\">10.1109/access.2021.3107812</a>","mla":"Zahera, H. M. A., et al. “I-AID: Identifying Actionable Information From Disaster-Related Tweets.” <i>IEEE Access</i>, vol. 9, Institute of Electrical and Electronics Engineers (IEEE), 2021, pp. 118861–70, doi:<a href=\"https://doi.org/10.1109/access.2021.3107812\">10.1109/access.2021.3107812</a>.","chicago":"Zahera, H.M.A, Rricha Jalota, Mohamed Ahmed Sherif, and Axel-Cyrille Ngonga Ngomo. “I-AID: Identifying Actionable Information From Disaster-Related Tweets.” <i>IEEE Access</i> 9 (2021): 118861–70. <a href=\"https://doi.org/10.1109/access.2021.3107812\">https://doi.org/10.1109/access.2021.3107812</a>.","short":"H.M.A. Zahera, R. Jalota, M.A. Sherif, A.-C.N. Ngomo, IEEE Access 9 (2021) 118861–118870.","ieee":"H. M. A. Zahera, R. Jalota, M. A. Sherif, and A.-C. N. Ngomo, “I-AID: Identifying Actionable Information From Disaster-Related Tweets,” <i>IEEE Access</i>, vol. 9, pp. 118861–118870, 2021, doi: <a href=\"https://doi.org/10.1109/access.2021.3107812\">10.1109/access.2021.3107812</a>.","apa":"Zahera, H. M. A., Jalota, R., Sherif, M. A., &#38; Ngomo, A.-C. N. (2021). I-AID: Identifying Actionable Information From Disaster-Related Tweets. <i>IEEE Access</i>, <i>9</i>, 118861–118870. <a href=\"https://doi.org/10.1109/access.2021.3107812\">https://doi.org/10.1109/access.2021.3107812</a>"},"publication":"IEEE Access","date_created":"2022-03-18T10:12:15Z","keyword":["General Engineering","General Materials Science","General Computer Science"],"type":"journal_article"},{"citation":{"apa":"Kirschmer, M., &#38; Voight, J. (2010). Algorithmic Enumeration of Ideal Classes for Quaternion Orders. <i>SIAM Journal on Computing</i>, <i>39</i>(5), 1714–1747. <a href=\"https://doi.org/10.1137/080734467\">https://doi.org/10.1137/080734467</a>","ieee":"M. Kirschmer and J. Voight, “Algorithmic Enumeration of Ideal Classes for Quaternion Orders,” <i>SIAM Journal on Computing</i>, vol. 39, no. 5, pp. 1714–1747, 2010, doi: <a href=\"https://doi.org/10.1137/080734467\">10.1137/080734467</a>.","short":"M. Kirschmer, J. Voight, SIAM Journal on Computing 39 (2010) 1714–1747.","chicago":"Kirschmer, Markus, and John Voight. “Algorithmic Enumeration of Ideal Classes for Quaternion Orders.” <i>SIAM Journal on Computing</i> 39, no. 5 (2010): 1714–47. <a href=\"https://doi.org/10.1137/080734467\">https://doi.org/10.1137/080734467</a>.","mla":"Kirschmer, Markus, and John Voight. “Algorithmic Enumeration of Ideal Classes for Quaternion Orders.” <i>SIAM Journal on Computing</i>, vol. 39, no. 5, Society for Industrial &#38; Applied Mathematics (SIAM), 2010, pp. 1714–47, doi:<a href=\"https://doi.org/10.1137/080734467\">10.1137/080734467</a>.","ama":"Kirschmer M, Voight J. Algorithmic Enumeration of Ideal Classes for Quaternion Orders. <i>SIAM Journal on Computing</i>. 2010;39(5):1714-1747. doi:<a href=\"https://doi.org/10.1137/080734467\">10.1137/080734467</a>","bibtex":"@article{Kirschmer_Voight_2010, title={Algorithmic Enumeration of Ideal Classes for Quaternion Orders}, volume={39}, DOI={<a href=\"https://doi.org/10.1137/080734467\">10.1137/080734467</a>}, number={5}, journal={SIAM Journal on Computing}, publisher={Society for Industrial &#38; Applied Mathematics (SIAM)}, author={Kirschmer, Markus and Voight, John}, year={2010}, pages={1714–1747} }"},"user_id":"93826","volume":39,"page":"1714-1747","publisher":"Society for Industrial & Applied Mathematics (SIAM)","_id":"42803","status":"public","keyword":["General Mathematics","General Computer Science"],"type":"journal_article","department":[{"_id":"102"}],"date_created":"2023-03-07T08:49:35Z","extern":"1","abstract":[{"lang":"eng","text":"We provide algorithms to count and enumerate representatives of the (right) ideal classes of an Eichler order in a quaternion algebra defined over a number field. We analyze the run time of these algorithms and consider several related problems, including the computation of two-sided ideal classes, isomorphism classes of orders, connecting ideals for orders, and ideal principalization. We conclude by giving the complete list of definite Eichler orders with class number at most 2."}],"issue":"5","publication":"SIAM Journal on Computing","doi":"10.1137/080734467","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2023-04-04T09:25:08Z","intvolume":"        39","year":"2010","title":"Algorithmic Enumeration of Ideal Classes for Quaternion Orders","publication_identifier":{"issn":["0097-5397","1095-7111"]},"author":[{"id":"82258","full_name":"Kirschmer, Markus","last_name":"Kirschmer","first_name":"Markus"},{"last_name":"Voight","first_name":"John","full_name":"Voight, John"}]},{"_id":"35857","publisher":"Springer Science and Business Media LLC","page":"2-15","volume":28,"user_id":"23","status":"public","citation":{"mla":"Blömer, J. “Denesting by Bounded Degree Radicals.” <i>Algorithmica</i>, vol. 28, no. 1, Springer Science and Business Media LLC, 2002, pp. 2–15, doi:<a href=\"https://doi.org/10.1007/s004530010028\">10.1007/s004530010028</a>.","ama":"Blömer J. Denesting by Bounded Degree Radicals. <i>Algorithmica</i>. 2002;28(1):2-15. doi:<a href=\"https://doi.org/10.1007/s004530010028\">10.1007/s004530010028</a>","bibtex":"@article{Blömer_2002, title={Denesting by Bounded Degree Radicals}, volume={28}, DOI={<a href=\"https://doi.org/10.1007/s004530010028\">10.1007/s004530010028</a>}, number={1}, journal={Algorithmica}, publisher={Springer Science and Business Media LLC}, author={Blömer, J.}, year={2002}, pages={2–15} }","apa":"Blömer, J. (2002). Denesting by Bounded Degree Radicals. <i>Algorithmica</i>, <i>28</i>(1), 2–15. <a href=\"https://doi.org/10.1007/s004530010028\">https://doi.org/10.1007/s004530010028</a>","ieee":"J. Blömer, “Denesting by Bounded Degree Radicals,” <i>Algorithmica</i>, vol. 28, no. 1, pp. 2–15, 2002, doi: <a href=\"https://doi.org/10.1007/s004530010028\">10.1007/s004530010028</a>.","chicago":"Blömer, J. “Denesting by Bounded Degree Radicals.” <i>Algorithmica</i> 28, no. 1 (2002): 2–15. <a href=\"https://doi.org/10.1007/s004530010028\">https://doi.org/10.1007/s004530010028</a>.","short":"J. Blömer, Algorithmica 28 (2002) 2–15."},"language":[{"iso":"eng"}],"doi":"10.1007/s004530010028","author":[{"first_name":"J.","last_name":"Blömer","full_name":"Blömer, J."}],"publication_identifier":{"issn":["0178-4617","1432-0541"]},"year":"2002","title":"Denesting by Bounded Degree Radicals","intvolume":"        28","date_updated":"2023-01-10T13:48:53Z","publication_status":"published","date_created":"2023-01-10T13:44:28Z","department":[{"_id":"64"}],"type":"journal_article","keyword":["Applied Mathematics","Computer Science Applications","General Computer Science"],"issue":"1","publication":"Algorithmica"}]