[{"date_created":"2026-01-22T14:44:19Z","type":"conference","department":[{"_id":"819"}],"publication":"Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2024, Melbourne, VIC, Australia, July 14-18, 2024","citation":{"mla":"Schmidbauer, Marcus, et al. “Guiding Quality Diversity on Monotone Submodular Functions: Customising the Feature Space by Adding Boolean Conjunctions.” <i>Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2024, Melbourne, VIC, Australia, July 14-18, 2024</i>, edited by Xiaodong Li and Julia Handl, ACM, 2024, doi:<a href=\"https://doi.org/10.1145/3638529.3654160\">10.1145/3638529.3654160</a>.","apa":"Schmidbauer, M., Opris, A., Bossek, J., Neumann, F., &#38; Sudholt, D. (2024). Guiding Quality Diversity on Monotone Submodular Functions: Customising the Feature Space by Adding Boolean Conjunctions. In X. Li &#38; J. Handl (Eds.), <i>Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2024, Melbourne, VIC, Australia, July 14-18, 2024</i>. ACM. <a href=\"https://doi.org/10.1145/3638529.3654160\">https://doi.org/10.1145/3638529.3654160</a>","ieee":"M. Schmidbauer, A. Opris, J. Bossek, F. Neumann, and D. Sudholt, “Guiding Quality Diversity on Monotone Submodular Functions: Customising the Feature Space by Adding Boolean Conjunctions,” in <i>Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2024, Melbourne, VIC, Australia, July 14-18, 2024</i>, 2024, doi: <a href=\"https://doi.org/10.1145/3638529.3654160\">10.1145/3638529.3654160</a>.","chicago":"Schmidbauer, Marcus, Andre Opris, Jakob Bossek, Frank Neumann, and Dirk Sudholt. “Guiding Quality Diversity on Monotone Submodular Functions: Customising the Feature Space by Adding Boolean Conjunctions.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2024, Melbourne, VIC, Australia, July 14-18, 2024</i>, edited by Xiaodong Li and Julia Handl. ACM, 2024. <a href=\"https://doi.org/10.1145/3638529.3654160\">https://doi.org/10.1145/3638529.3654160</a>.","short":"M. Schmidbauer, A. Opris, J. Bossek, F. Neumann, D. Sudholt, in: X. Li, J. Handl (Eds.), Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2024, Melbourne, VIC, Australia, July 14-18, 2024, ACM, 2024.","ama":"Schmidbauer M, Opris A, Bossek J, Neumann F, Sudholt D. Guiding Quality Diversity on Monotone Submodular Functions: Customising the Feature Space by Adding Boolean Conjunctions. In: Li X, Handl J, eds. <i>Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2024, Melbourne, VIC, Australia, July 14-18, 2024</i>. ACM; 2024. doi:<a href=\"https://doi.org/10.1145/3638529.3654160\">10.1145/3638529.3654160</a>","bibtex":"@inproceedings{Schmidbauer_Opris_Bossek_Neumann_Sudholt_2024, title={Guiding Quality Diversity on Monotone Submodular Functions: Customising the Feature Space by Adding Boolean Conjunctions}, DOI={<a href=\"https://doi.org/10.1145/3638529.3654160\">10.1145/3638529.3654160</a>}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2024, Melbourne, VIC, Australia, July 14-18, 2024}, publisher={ACM}, author={Schmidbauer, Marcus and Opris, Andre and Bossek, Jakob and Neumann, Frank and Sudholt, Dirk}, editor={Li, Xiaodong and Handl, Julia}, year={2024} }"},"_id":"63706","language":[{"iso":"eng"}],"publisher":"ACM","doi":"10.1145/3638529.3654160","user_id":"15504","editor":[{"full_name":"Li, Xiaodong","last_name":"Li","first_name":"Xiaodong"},{"full_name":"Handl, Julia","first_name":"Julia","last_name":"Handl"}],"status":"public","year":"2024","title":"Guiding Quality Diversity on Monotone Submodular Functions: Customising the Feature Space by Adding Boolean Conjunctions","author":[{"first_name":"Marcus","last_name":"Schmidbauer","full_name":"Schmidbauer, Marcus"},{"first_name":"Andre","last_name":"Opris","full_name":"Opris, Andre"},{"orcid":"0000-0002-4121-4668","first_name":"Jakob","last_name":"Bossek","full_name":"Bossek, Jakob","id":"102979"},{"full_name":"Neumann, Frank","first_name":"Frank","last_name":"Neumann"},{"last_name":"Sudholt","first_name":"Dirk","full_name":"Sudholt, Dirk"}],"date_updated":"2026-01-22T14:45:57Z"},{"citation":{"mla":"Klüttermann, Simon, et al. “On the Effectiveness of Heterogeneous Ensemble Methods for Re-Identification.” <i>International Conference on Machine Learning and Applications, ICMLA 2024, Miami, FL, USA, December 18-20, 2024</i>, edited by M. Arif Wani et al., IEEE, 2024, pp. 1705–1711, doi:<a href=\"https://doi.org/10.1109/ICMLA61862.2024.00263\">10.1109/ICMLA61862.2024.00263</a>.","bibtex":"@inproceedings{Klüttermann_Rutinowski_Polachowski_Nguyen_Grimme_Roidl_Müller_2024, title={On the Effectiveness of Heterogeneous Ensemble Methods for Re-Identification}, DOI={<a href=\"https://doi.org/10.1109/ICMLA61862.2024.00263\">10.1109/ICMLA61862.2024.00263</a>}, booktitle={International Conference on Machine Learning and Applications, ICMLA 2024, Miami, FL, USA, December 18-20, 2024}, publisher={IEEE}, 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}, editor={Wani, M. Arif and Angelov, Plamen and Luo, Feng and Ogihara, Mitsunori and Wu, Xintao and Precup, Radu-Emil and Ramezani, Ramin and Gu, Xiaowei}, year={2024}, pages={1705–1711} }","ama":"Klüttermann S, Rutinowski J, Polachowski F, et al. On the Effectiveness of Heterogeneous Ensemble Methods for Re-Identification. In: Wani MA, Angelov P, Luo F, et al., eds. <i>International Conference on Machine Learning and Applications, ICMLA 2024, Miami, FL, USA, December 18-20, 2024</i>. IEEE; 2024:1705–1711. doi:<a href=\"https://doi.org/10.1109/ICMLA61862.2024.00263\">10.1109/ICMLA61862.2024.00263</a>","ieee":"S. Klüttermann <i>et al.</i>, “On the Effectiveness of Heterogeneous Ensemble Methods for Re-Identification,” in <i>International Conference on Machine Learning and Applications, ICMLA 2024, Miami, FL, USA, December 18-20, 2024</i>, 2024, pp. 1705–1711, doi: <a href=\"https://doi.org/10.1109/ICMLA61862.2024.00263\">10.1109/ICMLA61862.2024.00263</a>.","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. In M. A. Wani, P. Angelov, F. Luo, M. Ogihara, X. Wu, R.-E. Precup, R. Ramezani, &#38; X. Gu (Eds.), <i>International Conference on Machine Learning and Applications, ICMLA 2024, Miami, FL, USA, December 18-20, 2024</i> (pp. 1705–1711). IEEE. <a href=\"https://doi.org/10.1109/ICMLA61862.2024.00263\">https://doi.org/10.1109/ICMLA61862.2024.00263</a>","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>International Conference on Machine Learning and Applications, ICMLA 2024, Miami, FL, USA, December 18-20, 2024</i>, edited by M. Arif Wani, Plamen Angelov, Feng Luo, Mitsunori Ogihara, Xintao Wu, Radu-Emil Precup, Ramin Ramezani, and Xiaowei Gu, 1705–1711. IEEE, 2024. <a href=\"https://doi.org/10.1109/ICMLA61862.2024.00263\">https://doi.org/10.1109/ICMLA61862.2024.00263</a>.","short":"S. Klüttermann, J. Rutinowski, F. Polachowski, A. Nguyen, B. Grimme, M. Roidl, E. Müller, in: M.A. Wani, P. Angelov, F. Luo, M. Ogihara, X. Wu, R.-E. Precup, R. Ramezani, X. Gu (Eds.), International Conference on Machine Learning and Applications, ICMLA 2024, Miami, FL, USA, December 18-20, 2024, IEEE, 2024, pp. 1705–1711."},"publication":"International Conference on Machine Learning and Applications, ICMLA 2024, Miami, FL, USA, December 18-20, 2024","department":[{"_id":"819"}],"type":"conference","date_created":"2026-01-22T14:50:26Z","date_updated":"2026-01-22T14:53:20Z","author":[{"full_name":"Klüttermann, Simon","first_name":"Simon","last_name":"Klüttermann"},{"full_name":"Rutinowski, Jérôme","last_name":"Rutinowski","first_name":"Jérôme"},{"full_name":"Polachowski, Frederik","first_name":"Frederik","last_name":"Polachowski"},{"first_name":"Anh","last_name":"Nguyen","full_name":"Nguyen, Anh"},{"full_name":"Grimme, Britta","first_name":"Britta","last_name":"Grimme"},{"full_name":"Roidl, Moritz","last_name":"Roidl","first_name":"Moritz"},{"first_name":"Emmanuel","last_name":"Müller","full_name":"Müller, Emmanuel"}],"status":"public","title":"On the Effectiveness of Heterogeneous Ensemble Methods for Re-Identification","year":"2024","editor":[{"last_name":"Wani","first_name":"M. Arif","full_name":"Wani, M. Arif"},{"full_name":"Angelov, Plamen","first_name":"Plamen","last_name":"Angelov"},{"full_name":"Luo, Feng","first_name":"Feng","last_name":"Luo"},{"full_name":"Ogihara, Mitsunori","first_name":"Mitsunori","last_name":"Ogihara"},{"first_name":"Xintao","last_name":"Wu","full_name":"Wu, Xintao"},{"last_name":"Precup","first_name":"Radu-Emil","full_name":"Precup, Radu-Emil"},{"first_name":"Ramin","last_name":"Ramezani","full_name":"Ramezani, Ramin"},{"last_name":"Gu","first_name":"Xiaowei","full_name":"Gu, Xiaowei"}],"user_id":"15504","doi":"10.1109/ICMLA61862.2024.00263","_id":"63708","publisher":"IEEE","page":"1705–1711"},{"date_created":"2026-01-22T14:43:22Z","type":"conference","department":[{"_id":"819"}],"publication":"Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2024, Melbourne, VIC, Australia, July 14-18, 2024","citation":{"mla":"Bossek, Jakob, and Christian Grimme. “Generalised Kruskal Mutation for the Multi-Objective Minimum Spanning Tree Problem.” <i>Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2024, Melbourne, VIC, Australia, July 14-18, 2024</i>, edited by Xiaodong Li and Julia Handl, ACM, 2024, doi:<a href=\"https://doi.org/10.1145/3638529.3654165\">10.1145/3638529.3654165</a>.","ama":"Bossek J, Grimme C. Generalised Kruskal Mutation for the Multi-Objective Minimum Spanning Tree Problem. In: Li X, Handl J, eds. <i>Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2024, Melbourne, VIC, Australia, July 14-18, 2024</i>. ACM; 2024. doi:<a href=\"https://doi.org/10.1145/3638529.3654165\">10.1145/3638529.3654165</a>","bibtex":"@inproceedings{Bossek_Grimme_2024, title={Generalised Kruskal Mutation for the Multi-Objective Minimum Spanning Tree Problem}, DOI={<a href=\"https://doi.org/10.1145/3638529.3654165\">10.1145/3638529.3654165</a>}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2024, Melbourne, VIC, Australia, July 14-18, 2024}, publisher={ACM}, author={Bossek, Jakob and Grimme, Christian}, editor={Li, Xiaodong and Handl, Julia}, year={2024} }","apa":"Bossek, J., &#38; Grimme, C. (2024). Generalised Kruskal Mutation for the Multi-Objective Minimum Spanning Tree Problem. In X. Li &#38; J. Handl (Eds.), <i>Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2024, Melbourne, VIC, Australia, July 14-18, 2024</i>. ACM. <a href=\"https://doi.org/10.1145/3638529.3654165\">https://doi.org/10.1145/3638529.3654165</a>","ieee":"J. Bossek and C. Grimme, “Generalised Kruskal Mutation for the Multi-Objective Minimum Spanning Tree Problem,” in <i>Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2024, Melbourne, VIC, Australia, July 14-18, 2024</i>, 2024, doi: <a href=\"https://doi.org/10.1145/3638529.3654165\">10.1145/3638529.3654165</a>.","chicago":"Bossek, Jakob, and Christian Grimme. “Generalised Kruskal Mutation for the Multi-Objective Minimum Spanning Tree Problem.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2024, Melbourne, VIC, Australia, July 14-18, 2024</i>, edited by Xiaodong Li and Julia Handl. ACM, 2024. <a href=\"https://doi.org/10.1145/3638529.3654165\">https://doi.org/10.1145/3638529.3654165</a>.","short":"J. Bossek, C. Grimme, in: X. Li, J. Handl (Eds.), Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2024, Melbourne, VIC, Australia, July 14-18, 2024, ACM, 2024."},"publisher":"ACM","_id":"63705","language":[{"iso":"eng"}],"doi":"10.1145/3638529.3654165","user_id":"15504","editor":[{"full_name":"Li, Xiaodong","last_name":"Li","first_name":"Xiaodong"},{"last_name":"Handl","first_name":"Julia","full_name":"Handl, Julia"}],"title":"Generalised Kruskal Mutation for the Multi-Objective Minimum Spanning Tree Problem","status":"public","year":"2024","author":[{"full_name":"Bossek, Jakob","first_name":"Jakob","last_name":"Bossek","orcid":"0000-0002-4121-4668","id":"102979"},{"full_name":"Grimme, Christian","last_name":"Grimme","first_name":"Christian"}],"date_updated":"2026-01-22T14:46:01Z"},{"user_id":"15578","language":[{"iso":"eng"}],"_id":"64104","date_updated":"2026-02-11T09:12:05Z","status":"public","title":"Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures. SAND 2024: 15:1-15:20","year":"2024","author":[{"id":"20792","last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"},{"first_name":"Kristian ","last_name":"Hinnenthal ","full_name":"Hinnenthal , Kristian "},{"id":"55557","full_name":"Liedtke, David Jan","first_name":"David Jan","last_name":"Liedtke"}],"type":"conference","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"date_created":"2026-02-10T10:12:18Z","place":"CoRR abs/2401.17734 (2024)","citation":{"bibtex":"@inproceedings{Scheideler_Hinnenthal _Liedtke_2024, place={CoRR abs/2401.17734 (2024)}, title={Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures. SAND 2024: 15:1-15:20}, author={Scheideler, Christian and Hinnenthal , Kristian  and Liedtke, David Jan}, year={2024} }","ama":"Scheideler C, Hinnenthal  K, Liedtke DJ. Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures. SAND 2024: 15:1-15:20. In: ; 2024.","mla":"Scheideler, Christian, et al. <i>Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures. SAND 2024: 15:1-15:20</i>. 2024.","chicago":"Scheideler, Christian, Kristian  Hinnenthal , and David Jan Liedtke. “Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures. SAND 2024: 15:1-15:20.” CoRR abs/2401.17734 (2024), 2024.","short":"C. Scheideler, K. Hinnenthal , D.J. Liedtke, in: CoRR abs/2401.17734 (2024), 2024.","ieee":"C. Scheideler, K. Hinnenthal , and D. J. Liedtke, “Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures. SAND 2024: 15:1-15:20,” 2024.","apa":"Scheideler, C., Hinnenthal , K., &#38; Liedtke, D. J. (2024). <i>Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures. SAND 2024: 15:1-15:20</i>."}},{"date_created":"2026-02-10T10:06:36Z","place":"PODC 2024: 65-75","type":"conference","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"citation":{"ieee":"C. Scheideler and A. Padalkin, “Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. ,” 2024, pp. 65–75.","mla":"Scheideler, Christian, and Andreas Padalkin. <i>Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. </i>. 2024, pp. 65–75.","apa":"Scheideler, C., &#38; Padalkin, A. (2024). <i>Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. </i>. 65–75.","bibtex":"@inproceedings{Scheideler_Padalkin_2024, place={PODC 2024: 65-75}, title={Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. }, author={Scheideler, Christian and Padalkin, Andreas}, year={2024}, pages={65–75} }","ama":"Scheideler C, Padalkin A. Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. . In: ; 2024:65-75.","short":"C. Scheideler, A. Padalkin, in: PODC 2024: 65-75, 2024, pp. 65–75.","chicago":"Scheideler, Christian, and Andreas Padalkin. “Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. ,” 65–75. PODC 2024: 65-75, 2024."},"page":"65 - 75","_id":"64103","language":[{"iso":"eng"}],"user_id":"15578","status":"public","title":"Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. ","year":"2024","author":[{"full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian","id":"20792"},{"full_name":"Padalkin, Andreas","first_name":"Andreas","last_name":"Padalkin","id":"88238"}],"date_updated":"2026-02-11T09:11:58Z"},{"date_created":"2026-02-10T10:21:39Z","place":"SIROCCO 2024: 384-401","type":"conference","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"citation":{"ieee":"C. Scheideler, I. Kostitsyna, and D. J. Liedtke, “Universal Coating by 3D Hybrid Programmable Matter.,” 2024.","apa":"Scheideler, C., Kostitsyna, I., &#38; Liedtke, D. J. (2024). <i>Universal Coating by 3D Hybrid Programmable Matter.</i>","chicago":"Scheideler, Christian, Irina  Kostitsyna, and David Jan Liedtke. “Universal Coating by 3D Hybrid Programmable Matter.” SIROCCO 2024: 384-401, 2024.","short":"C. Scheideler, I. Kostitsyna, D.J. Liedtke, in: SIROCCO 2024: 384-401, 2024.","mla":"Scheideler, Christian, et al. <i>Universal Coating by 3D Hybrid Programmable Matter.</i> 2024.","bibtex":"@inproceedings{Scheideler_Kostitsyna_Liedtke_2024, place={SIROCCO 2024: 384-401}, title={Universal Coating by 3D Hybrid Programmable Matter.}, author={Scheideler, Christian and Kostitsyna, Irina  and Liedtke, David Jan}, year={2024} }","ama":"Scheideler C, Kostitsyna I, Liedtke DJ. Universal Coating by 3D Hybrid Programmable Matter. In: ; 2024."},"_id":"64106","language":[{"iso":"eng"}],"user_id":"15578","year":"2024","title":"Universal Coating by 3D Hybrid Programmable Matter.","status":"public","author":[{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"},{"full_name":"Kostitsyna, Irina ","last_name":"Kostitsyna","first_name":"Irina "},{"last_name":"Liedtke","first_name":"David Jan","full_name":"Liedtke, David Jan","id":"55557"}],"date_updated":"2026-02-11T09:12:11Z"},{"date_updated":"2026-02-11T09:13:04Z","author":[{"full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian","id":"20792"},{"first_name":"Andreas","last_name":"Padalkin","full_name":"Padalkin, Andreas","id":"88238"},{"first_name":"Daniel","last_name":"Warner","full_name":"Warner, Daniel","id":"3902"}],"status":"public","year":"2024","title":"The structural power of reconfigurable circuits in the amoebot model. ","user_id":"15578","language":[{"iso":"eng"}],"_id":"64100","page":"603 - 625","citation":{"ieee":"C. Scheideler, A. Padalkin, and D. Warner, “The structural power of reconfigurable circuits in the amoebot model. ,” <i>The structural power of reconfigurable circuits in the amoebot model. Nat. Comput. 23(4): 603-625 (2024)</i>, pp. 603–625, 2024.","apa":"Scheideler, C., Padalkin, A., &#38; Warner, D. (2024). The structural power of reconfigurable circuits in the amoebot model. . <i>The Structural Power of Reconfigurable Circuits in the Amoebot Model. Nat. Comput. 23(4): 603-625 (2024)</i>, 603–625.","short":"C. Scheideler, A. Padalkin, D. Warner, The Structural Power of Reconfigurable Circuits in the Amoebot Model. Nat. Comput. 23(4): 603-625 (2024) (2024) 603–625.","chicago":"Scheideler, Christian, Andreas Padalkin, and Daniel Warner. “The Structural Power of Reconfigurable Circuits in the Amoebot Model. .” <i>The Structural Power of Reconfigurable Circuits in the Amoebot Model. Nat. Comput. 23(4): 603-625 (2024)</i>, 2024, 603–25.","mla":"Scheideler, Christian, et al. “The Structural Power of Reconfigurable Circuits in the Amoebot Model. .” <i>The Structural Power of Reconfigurable Circuits in the Amoebot Model. Nat. Comput. 23(4): 603-625 (2024)</i>, 2024, pp. 603–25.","bibtex":"@article{Scheideler_Padalkin_Warner_2024, title={The structural power of reconfigurable circuits in the amoebot model. }, journal={The structural power of reconfigurable circuits in the amoebot model. Nat. Comput. 23(4): 603-625 (2024)}, author={Scheideler, Christian and Padalkin, Andreas and Warner, Daniel}, year={2024}, pages={603–625} }","ama":"Scheideler C, Padalkin A, Warner D. The structural power of reconfigurable circuits in the amoebot model. . <i>The structural power of reconfigurable circuits in the amoebot model Nat Comput 23(4): 603-625 (2024)</i>. Published online 2024:603-625."},"publication":"The structural power of reconfigurable circuits in the amoebot model. Nat. Comput. 23(4): 603-625 (2024)","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"type":"journal_article","date_created":"2026-02-10T09:56:23Z"},{"publication":"Routing schemes for hybrid communication networks. Theor. Comput. Sci. 985: 114352 (2024)","citation":{"ama":"Scheideler C, Coy S, Czumaj A, Schneider P, Werthmann J. Routing schemes for hybrid communication networks. . <i>Routing schemes for hybrid communication networks Theor Comput Sci 985: 114352 (2024)</i>. Published online 2024.","bibtex":"@article{Scheideler_Coy_Czumaj_Schneider_Werthmann_2024, title={Routing schemes for hybrid communication networks. }, journal={Routing schemes for hybrid communication networks. Theor. Comput. Sci. 985: 114352 (2024)}, author={Scheideler, Christian and Coy, Sam  and Czumaj, Arthur  and Schneider, Philipp  and Werthmann, Julian}, year={2024} }","mla":"Scheideler, Christian, et al. “Routing Schemes for Hybrid Communication Networks. .” <i>Routing Schemes for Hybrid Communication Networks. Theor. Comput. Sci. 985: 114352 (2024)</i>, 2024.","chicago":"Scheideler, Christian, Sam  Coy, Arthur  Czumaj, Philipp  Schneider, and Julian Werthmann. “Routing Schemes for Hybrid Communication Networks. .” <i>Routing Schemes for Hybrid Communication Networks. Theor. Comput. Sci. 985: 114352 (2024)</i>, 2024.","short":"C. Scheideler, S. Coy, A. Czumaj, P. Schneider, J. Werthmann, Routing Schemes for Hybrid Communication Networks. Theor. Comput. Sci. 985: 114352 (2024) (2024).","apa":"Scheideler, C., Coy, S., Czumaj, A., Schneider, P., &#38; Werthmann, J. (2024). Routing schemes for hybrid communication networks. . <i>Routing Schemes for Hybrid Communication Networks. Theor. Comput. Sci. 985: 114352 (2024)</i>.","ieee":"C. Scheideler, S. Coy, A. Czumaj, P. Schneider, and J. Werthmann, “Routing schemes for hybrid communication networks. ,” <i>Routing schemes for hybrid communication networks. Theor. Comput. Sci. 985: 114352 (2024)</i>, 2024."},"type":"journal_article","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"date_created":"2026-02-10T10:00:43Z","date_updated":"2026-02-11T09:12:57Z","status":"public","title":"Routing schemes for hybrid communication networks. ","year":"2024","author":[{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"},{"full_name":"Coy, Sam ","last_name":"Coy","first_name":"Sam "},{"full_name":"Czumaj, Arthur ","last_name":"Czumaj","first_name":"Arthur "},{"first_name":"Philipp ","last_name":"Schneider","full_name":"Schneider, Philipp "},{"full_name":"Werthmann, Julian","first_name":"Julian","last_name":"Werthmann","id":"50024"}],"user_id":"15578","language":[{"iso":"eng"}],"_id":"64101"},{"author":[{"last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian","id":"20792"},{"full_name":"Dou, Jinfeng","last_name":"Dou","first_name":"Jinfeng","id":"92888"}],"title":"Invited Paper: Blockchains made Lightweight: A Median Rule for State Machine Replication. ","year":"2024","status":"public","date_updated":"2026-02-11T09:12:28Z","language":[{"iso":"eng"}],"_id":"64102","publisher":"ApPLIED@PODC 2024","user_id":"15578","citation":{"mla":"Scheideler, Christian, and Jinfeng Dou. <i>Invited Paper: Blockchains Made Lightweight: A Median Rule for State Machine Replication. </i>. ApPLIED@PODC 2024, 2024.","ama":"Scheideler C, Dou J. Invited Paper: Blockchains made Lightweight: A Median Rule for State Machine Replication. . In: ApPLIED@PODC 2024; 2024.","bibtex":"@inproceedings{Scheideler_Dou_2024, title={Invited Paper: Blockchains made Lightweight: A Median Rule for State Machine Replication. }, publisher={ApPLIED@PODC 2024}, author={Scheideler, Christian and Dou, Jinfeng}, year={2024} }","apa":"Scheideler, C., &#38; Dou, J. (2024). <i>Invited Paper: Blockchains made Lightweight: A Median Rule for State Machine Replication. </i>.","ieee":"C. Scheideler and J. Dou, “Invited Paper: Blockchains made Lightweight: A Median Rule for State Machine Replication. ,” 2024.","short":"C. Scheideler, J. Dou, in: ApPLIED@PODC 2024, 2024.","chicago":"Scheideler, Christian, and Jinfeng Dou. “Invited Paper: Blockchains Made Lightweight: A Median Rule for State Machine Replication. .” ApPLIED@PODC 2024, 2024."},"date_created":"2026-02-10T10:04:11Z","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"type":"conference"},{"type":"conference","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"place":"SAND 2024: 18:1-18:20","date_created":"2026-02-10T10:15:08Z","citation":{"ieee":"C. Scheideler, A. Padalkin, and M. Kumar , “Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. ,” 2024.","apa":"Scheideler, C., Padalkin, A., &#38; Kumar , M. (2024). <i>Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. </i>.","chicago":"Scheideler, Christian, Andreas Padalkin, and Manish  Kumar . “Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. .” SAND 2024: 18:1-18:20, 2024.","short":"C. Scheideler, A. Padalkin, M. Kumar , in: SAND 2024: 18:1-18:20, 2024.","mla":"Scheideler, Christian, et al. <i>Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. </i>. 2024.","bibtex":"@inproceedings{Scheideler_Padalkin_Kumar _2024, place={SAND 2024: 18:1-18:20}, title={Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. }, author={Scheideler, Christian and Padalkin, Andreas and Kumar , Manish }, year={2024} }","ama":"Scheideler C, Padalkin A, Kumar  M. Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. . In: ; 2024."},"user_id":"15578","language":[{"iso":"eng"}],"_id":"64105","date_updated":"2026-02-11T09:12:18Z","title":"Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. ","year":"2024","status":"public","author":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"},{"first_name":"Andreas","last_name":"Padalkin","full_name":"Padalkin, Andreas","id":"88238"},{"last_name":"Kumar ","first_name":"Manish ","full_name":"Kumar , Manish "}]},{"publication":"Proceedings of the IEEE/ACM 11th International Conference on Mobile Software Engineering and Systems (MOBILESoft '24). Association for Computing Machinery, New York, NY, USA, 65–68.","abstract":[{"lang":"eng","text":"Android applications collecting data from users must protect it according to the current legal frameworks. Such data protection has become even more important since the European Union rolled out the General Data Protection Regulation (GDPR). Since app developers are not legal experts, they find it difficult to write privacy-aware source code. Moreover, they have limited tool support to reason about data protection throughout their app development process.\r\nThis paper motivates the need for a static analysis approach to diagnose and explain data protection in Android apps. The analysis will recognize personal data sources in the source code, and aims to further examine the data flow originating from these sources. App developers can then address key questions about data manipulation, derived data, and the presence of technical measures. Despite challenges, we explore to what extent one can realize this analysis through static taint analysis, a common method for identifying security vulnerabilities. This is a first step towards designing a tool-based approach that aids app developers and assessors in ensuring data protection in Android apps, based on automated static program analysis. "}],"date_created":"2024-03-03T14:37:53Z","file":[{"file_id":"52236","content_type":"application/pdf","success":1,"file_name":"2402.07889v1.pdf","access_level":"closed","file_size":530812,"relation":"main_file","date_updated":"2024-03-03T14:39:08Z","date_created":"2024-03-03T14:39:08Z","creator":"khedkarm"}],"department":[{"_id":"76"}],"keyword":["static program analysis","data protection and privacy","GDPR compliance"],"type":"conference","author":[{"id":"88024","full_name":"Khedkar, Mugdha","last_name":"Khedkar","first_name":"Mugdha"},{"orcid":"0000-0003-3470-3647","first_name":"Eric","last_name":"Bodden","full_name":"Bodden, Eric","id":"59256"}],"title":"Toward an Android Static Analysis Approach for Data Protection","year":"2024","date_updated":"2026-03-04T08:11:48Z","language":[{"iso":"eng"}],"doi":"10.1145/3647632.3651389","citation":{"ama":"Khedkar M, Bodden E. Toward an Android Static Analysis Approach for Data Protection. In: <i>Proceedings of the IEEE/ACM 11th International Conference on Mobile Software Engineering and Systems (MOBILESoft ’24). Association for Computing Machinery, New York, NY, USA, 65–68.</i> ; 2024. doi:<a href=\"https://doi.org/10.1145/3647632.3651389\">10.1145/3647632.3651389</a>","bibtex":"@inproceedings{Khedkar_Bodden_2024, title={Toward an Android Static Analysis Approach for Data Protection}, DOI={<a href=\"https://doi.org/10.1145/3647632.3651389\">10.1145/3647632.3651389</a>}, booktitle={Proceedings of the IEEE/ACM 11th International Conference on Mobile Software Engineering and Systems (MOBILESoft ’24). Association for Computing Machinery, New York, NY, USA, 65–68.}, author={Khedkar, Mugdha and Bodden, Eric}, year={2024} }","mla":"Khedkar, Mugdha, and Eric Bodden. “Toward an Android Static Analysis Approach for Data Protection.” <i>Proceedings of the IEEE/ACM 11th International Conference on Mobile Software Engineering and Systems (MOBILESoft ’24). Association for Computing Machinery, New York, NY, USA, 65–68.</i>, 2024, doi:<a href=\"https://doi.org/10.1145/3647632.3651389\">10.1145/3647632.3651389</a>.","short":"M. Khedkar, E. Bodden, in: Proceedings of the IEEE/ACM 11th International Conference on Mobile Software Engineering and Systems (MOBILESoft ’24). Association for Computing Machinery, New York, NY, USA, 65–68., 2024.","chicago":"Khedkar, Mugdha, and Eric Bodden. “Toward an Android Static Analysis Approach for Data Protection.” In <i>Proceedings of the IEEE/ACM 11th International Conference on Mobile Software Engineering and Systems (MOBILESoft ’24). Association for Computing Machinery, New York, NY, USA, 65–68.</i>, 2024. <a href=\"https://doi.org/10.1145/3647632.3651389\">https://doi.org/10.1145/3647632.3651389</a>.","apa":"Khedkar, M., &#38; Bodden, E. (2024). Toward an Android Static Analysis Approach for Data Protection. <i>Proceedings of the IEEE/ACM 11th International Conference on Mobile Software Engineering and Systems (MOBILESoft ’24). Association for Computing Machinery, New York, NY, USA, 65–68.</i> 11th International Conference on Mobile Software Engineering and Systems 2024, Lisbon, Portugal. <a href=\"https://doi.org/10.1145/3647632.3651389\">https://doi.org/10.1145/3647632.3651389</a>","ieee":"M. Khedkar and E. Bodden, “Toward an Android Static Analysis Approach for Data Protection,” presented at the 11th International Conference on Mobile Software Engineering and Systems 2024, Lisbon, Portugal, 2024, doi: <a href=\"https://doi.org/10.1145/3647632.3651389\">10.1145/3647632.3651389</a>."},"file_date_updated":"2024-03-03T14:39:08Z","external_id":{"arxiv":["2402.07889"]},"conference":{"location":"Lisbon, Portugal","start_date":"2024-04-14","name":"11th International Conference on Mobile Software Engineering and Systems 2024","end_date":"2024-04-15"},"status":"public","has_accepted_license":"1","_id":"52235","user_id":"88024","ddc":["006"]},{"user_id":"67234","publisher":"Springer Nature Switzerland","_id":"61210","conference":{"name":"ISWC 2024: : The 23ed International Semantic Web Conference","start_date":"2024-11-11","location":"Baltimore, USA","end_date":"2024-11-15"},"status":"public","place":"Cham","project":[{"name":"SAIL - Nachhaltiger Lebenszyklus von intelligenten soziotechnischen Systemen","_id":"285"}],"citation":{"chicago":"Becker, Alexander, Mohamed Sherif, and Axel-Cyrille Ngonga Ngomo. “Blink: Blank Node Matching Using Embeddings.” In <i>Lecture Notes in Computer Science</i>. Cham: Springer Nature Switzerland, 2024. <a href=\"https://doi.org/10.1007/978-3-031-77844-5_12\">https://doi.org/10.1007/978-3-031-77844-5_12</a>.","short":"A. Becker, M. Sherif, A.-C. Ngonga Ngomo, in: Lecture Notes in Computer Science, Springer Nature Switzerland, Cham, 2024.","ieee":"A. Becker, M. Sherif, and A.-C. Ngonga Ngomo, “Blink: Blank Node Matching Using Embeddings,” in <i>Lecture Notes in Computer Science</i>, Cham: Springer Nature Switzerland, 2024.","apa":"Becker, A., Sherif, M., &#38; Ngonga Ngomo, A.-C. (2024). Blink: Blank Node Matching Using Embeddings. In <i>Lecture Notes in Computer Science</i>. ISWC 2024: : The 23ed International Semantic Web Conference, Baltimore, USA. Springer Nature Switzerland. <a href=\"https://doi.org/10.1007/978-3-031-77844-5_12\">https://doi.org/10.1007/978-3-031-77844-5_12</a>","bibtex":"@inbook{Becker_Sherif_Ngonga Ngomo_2024, place={Cham}, title={Blink: Blank Node Matching Using Embeddings}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-77844-5_12\">10.1007/978-3-031-77844-5_12</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Nature Switzerland}, author={Becker, Alexander and Sherif, Mohamed and Ngonga Ngomo, Axel-Cyrille}, year={2024} }","ama":"Becker A, Sherif M, Ngonga Ngomo A-C. Blink: Blank Node Matching Using Embeddings. In: <i>Lecture Notes in Computer Science</i>. Springer Nature Switzerland; 2024. doi:<a href=\"https://doi.org/10.1007/978-3-031-77844-5_12\">10.1007/978-3-031-77844-5_12</a>","mla":"Becker, Alexander, et al. “Blink: Blank Node Matching Using Embeddings.” <i>Lecture Notes in Computer Science</i>, Springer Nature Switzerland, 2024, doi:<a href=\"https://doi.org/10.1007/978-3-031-77844-5_12\">10.1007/978-3-031-77844-5_12</a>."},"doi":"10.1007/978-3-031-77844-5_12","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://papers.dice-research.org/2024/ISWC_BLINK/public.pdf"}],"publication_status":"published","date_updated":"2025-09-11T10:34:02Z","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783031778438","9783031778445"]},"author":[{"full_name":"Becker, Alexander","last_name":"Becker","first_name":"Alexander"},{"first_name":"Mohamed","orcid":"https://orcid.org/0000-0002-9927-2203","last_name":"Sherif","full_name":"Sherif, Mohamed","id":"67234"},{"full_name":"Ngonga Ngomo, Axel-Cyrille","first_name":"Axel-Cyrille","last_name":"Ngonga Ngomo","id":"65716"}],"year":"2024","title":"Blink: Blank Node Matching Using Embeddings","department":[{"_id":"574"}],"type":"book_chapter","date_created":"2025-09-11T10:19:47Z","abstract":[{"text":"Knowledge graphs (KGs) differ significantly over multiple different versions of the same data source. They also often contain blank nodes that do not have a constant identifier over all versions. Linking such blank nodes from different versions is a challenging task. Previous works propose different approaches to create signatures for all blank nodes based on named nodes in their neighborhood to match blank nodes with similar signatures. However, these works struggle to find a good mapping when the difference between the KGs’ versions grows too large. In this work, we propose Blink, an embedding-based approach for blank node linking. Blink merges two KGs’ versions and embeds the merged graph into a latent vector space based on translational embeddings and subsequently matches the closest pairs of blank nodes from different graphs. We evaluate our approach using real-world datasets against state-of-the-art approaches by computing the blank node matching for isomorphic graphs and graphs that contain triple changes (i.e., added or removed triples). The results indicate that Blink achieves perfect accuracy for isomorphic graphs. For graph versions that contain changes, such as having up to 20% of triples removed in one version, Blink still produces a mapping with an Optimal Mapping Deviation Ratio of under 1%. These results show that Blink leads to a better linking of KGs over different versions and similar graphs adhering to the linked data guidelines.","lang":"eng"}],"publication":"Lecture Notes in Computer Science"},{"user_id":"67234","_id":"54084","language":[{"iso":"eng"}],"date_updated":"2025-09-11T10:36:03Z","year":"2024","title":"Efficient Evaluation of Conjunctive Regular Path Queries Using Multi-way Joins","status":"public","author":[{"last_name":"Karalis","first_name":"Nikolaos","full_name":"Karalis, Nikolaos"},{"id":"72857","first_name":"Alexander","last_name":"Bigerl","full_name":"Bigerl, Alexander"},{"last_name":"Heidrich","first_name":"Liss","full_name":"Heidrich, Liss"},{"full_name":"Sherif, Mohamed","orcid":"https://orcid.org/0000-0002-9927-2203","last_name":"Sherif","first_name":"Mohamed","id":"67234"},{"full_name":"Ngonga Ngomo, Axel-Cyrille","last_name":"Ngonga Ngomo","first_name":"Axel-Cyrille","id":"65716"}],"type":"conference","keyword":["bigerl dice enexa heidrich karalis ngonga sail sherif"],"department":[{"_id":"574"}],"date_created":"2024-05-08T10:25:54Z","publication":"ESWC","citation":{"ama":"Karalis N, Bigerl A, Heidrich L, Sherif M, Ngonga Ngomo A-C. Efficient Evaluation of Conjunctive Regular Path Queries Using Multi-way Joins. In: <i>ESWC</i>. ; 2024.","bibtex":"@inproceedings{Karalis_Bigerl_Heidrich_Sherif_Ngonga Ngomo_2024, title={Efficient Evaluation of Conjunctive Regular Path Queries Using Multi-way Joins}, booktitle={ESWC}, author={Karalis, Nikolaos and Bigerl, Alexander and Heidrich, Liss and Sherif, Mohamed and Ngonga Ngomo, Axel-Cyrille}, year={2024} }","mla":"Karalis, Nikolaos, et al. “Efficient Evaluation of Conjunctive Regular Path Queries Using Multi-Way Joins.” <i>ESWC</i>, 2024.","chicago":"Karalis, Nikolaos, Alexander Bigerl, Liss Heidrich, Mohamed Sherif, and Axel-Cyrille Ngonga Ngomo. “Efficient Evaluation of Conjunctive Regular Path Queries Using Multi-Way Joins.” In <i>ESWC</i>, 2024.","short":"N. Karalis, A. Bigerl, L. Heidrich, M. Sherif, A.-C. Ngonga Ngomo, in: ESWC, 2024.","apa":"Karalis, N., Bigerl, A., Heidrich, L., Sherif, M., &#38; Ngonga Ngomo, A.-C. (2024). Efficient Evaluation of Conjunctive Regular Path Queries Using Multi-way Joins. <i>ESWC</i>.","ieee":"N. Karalis, A. Bigerl, L. Heidrich, M. Sherif, and A.-C. Ngonga Ngomo, “Efficient Evaluation of Conjunctive Regular Path Queries Using Multi-way Joins,” 2024."}},{"date_updated":"2025-09-11T10:46:35Z","intvolume":"      3759","title":"PCFWebUI: Data-driven WebUI for holistic decarbonization based on PCF-Tracking","status":"public","year":"2024","conference":{"name":"International Conference on Semantic Systems (SEMANTiCS 2024)","start_date":"2024-09-17","location":" Amsterdam,The Netherlands","end_date":"2024-09-19"},"author":[{"full_name":"Kumar, Ajay","last_name":"Kumar","first_name":"Ajay"},{"id":"94950","full_name":"Naumann, Marius","first_name":"Marius","last_name":"Naumann"},{"full_name":"Henne, Kevin","last_name":"Henne","first_name":"Kevin","id":"56918"},{"full_name":"Sherif, Mohamed","orcid":"https://orcid.org/0000-0002-9927-2203","first_name":"Mohamed","last_name":"Sherif","id":"67234"}],"user_id":"67234","editor":[{"first_name":"Daniel","last_name":"Garijo","full_name":"Garijo, Daniel"},{"last_name":"Gentile","first_name":"Anna Lisa","full_name":"Gentile, Anna Lisa"},{"last_name":"Kurteva","first_name":"Anelia","full_name":"Kurteva, Anelia"},{"full_name":"Mannocci, Andrea","first_name":"Andrea","last_name":"Mannocci"},{"full_name":"Osborne, Francesco","last_name":"Osborne","first_name":"Francesco"},{"last_name":"Vahdati","first_name":"Sahar","full_name":"Vahdati, Sahar"}],"volume":3759,"_id":"61219","language":[{"iso":"eng"}],"publisher":"CEUR-WS.org","series_title":"CEUR Workshop Proceedings","publication":"Joint Proceedings of Posters, Demos, Workshops, and Tutorials of the 20th International Conference on Semantic Systems co-located with 20th International Conference on Semantic Systems (SEMANTiCS 2024), Amsterdam, The Netherlands, September 17-19, 2024","citation":{"chicago":"Kumar, Ajay, Marius Naumann, Kevin Henne, and Mohamed Sherif. “PCFWebUI: Data-Driven WebUI for Holistic Decarbonization Based on PCF-Tracking.” In <i>Joint Proceedings of Posters, Demos, Workshops, and Tutorials of the 20th International Conference on Semantic Systems Co-Located with 20th International Conference on Semantic Systems (SEMANTiCS 2024), Amsterdam, The Netherlands, September 17-19, 2024</i>, edited by Daniel Garijo, Anna Lisa Gentile, Anelia Kurteva, Andrea Mannocci, Francesco Osborne, and Sahar Vahdati, Vol. 3759. CEUR Workshop Proceedings. CEUR-WS.org, 2024.","short":"A. Kumar, M. Naumann, K. Henne, M. Sherif, in: D. Garijo, A.L. Gentile, A. Kurteva, A. Mannocci, F. Osborne, S. Vahdati (Eds.), Joint Proceedings of Posters, Demos, Workshops, and Tutorials of the 20th International Conference on Semantic Systems Co-Located with 20th International Conference on Semantic Systems (SEMANTiCS 2024), Amsterdam, The Netherlands, September 17-19, 2024, CEUR-WS.org, 2024.","apa":"Kumar, A., Naumann, M., Henne, K., &#38; Sherif, M. (2024). PCFWebUI: Data-driven WebUI for holistic decarbonization based on PCF-Tracking. In D. Garijo, A. L. Gentile, A. Kurteva, A. Mannocci, F. Osborne, &#38; S. Vahdati (Eds.), <i>Joint Proceedings of Posters, Demos, Workshops, and Tutorials of the 20th International Conference on Semantic Systems co-located with 20th International Conference on Semantic Systems (SEMANTiCS 2024), Amsterdam, The Netherlands, September 17-19, 2024</i> (Vol. 3759). CEUR-WS.org.","ieee":"A. Kumar, M. Naumann, K. Henne, and M. Sherif, “PCFWebUI: Data-driven WebUI for holistic decarbonization based on PCF-Tracking,” in <i>Joint Proceedings of Posters, Demos, Workshops, and Tutorials of the 20th International Conference on Semantic Systems co-located with 20th International Conference on Semantic Systems (SEMANTiCS 2024), Amsterdam, The Netherlands, September 17-19, 2024</i>,  Amsterdam,The Netherlands, 2024, vol. 3759.","ama":"Kumar A, Naumann M, Henne K, Sherif M. PCFWebUI: Data-driven WebUI for holistic decarbonization based on PCF-Tracking. In: Garijo D, Gentile AL, Kurteva A, Mannocci A, Osborne F, Vahdati S, eds. <i>Joint Proceedings of Posters, Demos, Workshops, and Tutorials of the 20th International Conference on Semantic Systems Co-Located with 20th International Conference on Semantic Systems (SEMANTiCS 2024), Amsterdam, The Netherlands, September 17-19, 2024</i>. Vol 3759. CEUR Workshop Proceedings. CEUR-WS.org; 2024.","bibtex":"@inproceedings{Kumar_Naumann_Henne_Sherif_2024, series={CEUR Workshop Proceedings}, title={PCFWebUI: Data-driven WebUI for holistic decarbonization based on PCF-Tracking}, volume={3759}, booktitle={Joint Proceedings of Posters, Demos, Workshops, and Tutorials of the 20th International Conference on Semantic Systems co-located with 20th International Conference on Semantic Systems (SEMANTiCS 2024), Amsterdam, The Netherlands, September 17-19, 2024}, publisher={CEUR-WS.org}, author={Kumar, Ajay and Naumann, Marius and Henne, Kevin and Sherif, Mohamed}, editor={Garijo, Daniel and Gentile, Anna Lisa and Kurteva, Anelia and Mannocci, Andrea and Osborne, Francesco and Vahdati, Sahar}, year={2024}, collection={CEUR Workshop Proceedings} }","mla":"Kumar, Ajay, et al. “PCFWebUI: Data-Driven WebUI for Holistic Decarbonization Based on PCF-Tracking.” <i>Joint Proceedings of Posters, Demos, Workshops, and Tutorials of the 20th International Conference on Semantic Systems Co-Located with 20th International Conference on Semantic Systems (SEMANTiCS 2024), Amsterdam, The Netherlands, September 17-19, 2024</i>, edited by Daniel Garijo et al., vol. 3759, CEUR-WS.org, 2024."},"keyword":["kumar sherif enexa climatebowl ingrid simba dice whale"],"type":"conference","department":[{"_id":"574"}],"date_created":"2025-09-11T10:43:04Z"},{"language":[{"iso":"eng"}],"_id":"55094","user_id":"67234","status":"public","title":"Generating SPARQL from Natural Language Using Chain-of-Thoughts Prompting","year":"2024","author":[{"first_name":"Hamada Mohamed Abdelsamee","last_name":"Zahera","orcid":"0000-0003-0215-1278","full_name":"Zahera, Hamada Mohamed Abdelsamee","id":"72768"},{"id":"77309","full_name":"Manzoor, Ali","last_name":"Manzoor","first_name":"Ali","orcid":"https://orcid.org/0000-0001-8403-5160"},{"first_name":"Mohamed","last_name":"Sherif","orcid":"https://orcid.org/0000-0002-9927-2203","full_name":"Sherif, Mohamed","id":"67234"},{"id":"71635","full_name":"Moussallem, Diego","first_name":"Diego","last_name":"Moussallem"},{"full_name":"Ngonga Ngomo, Axel-Cyrille","first_name":"Axel-Cyrille","last_name":"Ngonga Ngomo","id":"65716"}],"date_updated":"2025-09-11T10:37:39Z","date_created":"2024-07-05T13:59:24Z","place":"Amsterdam, Netherlands","keyword":["TRR318 climatebowl colide dice enexa kiam manzoor moussallem ngonga sailproject sherif simba zahera"],"type":"conference","department":[{"_id":"574"}],"publication":"SEMANTiCS","citation":{"apa":"Zahera, H. M. A., Manzoor, A., Sherif, M., Moussallem, D., &#38; Ngonga Ngomo, A.-C. (2024). Generating SPARQL from Natural Language Using Chain-of-Thoughts Prompting. <i>SEMANTiCS</i>.","ieee":"H. M. A. Zahera, A. Manzoor, M. Sherif, D. Moussallem, and A.-C. Ngonga Ngomo, “Generating SPARQL from Natural Language Using Chain-of-Thoughts Prompting,” 2024.","chicago":"Zahera, Hamada Mohamed Abdelsamee, Ali Manzoor, Mohamed Sherif, Diego Moussallem, and Axel-Cyrille Ngonga Ngomo. “Generating SPARQL from Natural Language Using Chain-of-Thoughts Prompting.” In <i>SEMANTiCS</i>. Amsterdam, Netherlands, 2024.","short":"H.M.A. Zahera, A. Manzoor, M. Sherif, D. Moussallem, A.-C. Ngonga Ngomo, in: SEMANTiCS, Amsterdam, Netherlands, 2024.","mla":"Zahera, Hamada Mohamed Abdelsamee, et al. “Generating SPARQL from Natural Language Using Chain-of-Thoughts Prompting.” <i>SEMANTiCS</i>, 2024.","ama":"Zahera HMA, Manzoor A, Sherif M, Moussallem D, Ngonga Ngomo A-C. Generating SPARQL from Natural Language Using Chain-of-Thoughts Prompting. In: <i>SEMANTiCS</i>. ; 2024.","bibtex":"@inproceedings{Zahera_Manzoor_Sherif_Moussallem_Ngonga Ngomo_2024, place={Amsterdam, Netherlands}, title={Generating SPARQL from Natural Language Using Chain-of-Thoughts Prompting}, booktitle={SEMANTiCS}, author={Zahera, Hamada Mohamed Abdelsamee and Manzoor, Ali and Sherif, Mohamed and Moussallem, Diego and Ngonga Ngomo, Axel-Cyrille}, year={2024} }"}},{"publication":"Findings of the Association for Computational Linguistics: ACL 2024","related_material":{"link":[{"url":"https://github.com/webis-de/acl24-dialect-aware-bias-detection","relation":"software"}]},"abstract":[{"text":"Dialects introduce syntactic and lexical variations in language that occur in regional or social groups. Most NLP methods are not sensitive to such variations. This may lead to unfair behavior of the methods, conveying negative bias towards dialect speakers. While previous work has studied dialect-related fairness for aspects like hate speech, other aspects of biased language, such as lewdness, remain fully unexplored. To fill this gap, we investigate performance disparities between dialects in the detection of five aspects of biased language and how to mitigate them. To alleviate bias, we present a multitask learning approach that models dialect language as an auxiliary task to incorporate syntactic and lexical variations. In our experiments with African-American English dialect, we provide empirical evidence that complementing common learning approaches with dialect modeling improves their fairness. Furthermore, the results suggest that multitask learning achieves state-of-the-art performance and helps to detect properties of biased language more reliably.","lang":"eng"}],"date_created":"2025-02-20T08:18:01Z","type":"conference","department":[{"_id":"600"},{"_id":"660"}],"title":"Disentangling Dialect from Social Bias via Multitask Learning to Improve Fairness","year":"2024","author":[{"full_name":"Spliethöver, Maximilian","last_name":"Spliethöver","first_name":"Maximilian","orcid":"0000-0003-4364-1409","id":"84035"},{"first_name":"Sai Nikhil","last_name":"Menon","full_name":"Menon, Sai Nikhil"},{"id":"3900","full_name":"Wachsmuth, Henning","last_name":"Wachsmuth","first_name":"Henning"}],"date_updated":"2025-09-12T09:52:59Z","main_file_link":[{"url":"https://aclanthology.org/2024.findings-acl.553/","open_access":"1"}],"language":[{"iso":"eng"}],"doi":"10.18653/v1/2024.findings-acl.553","citation":{"short":"M. Spliethöver, S.N. Menon, H. Wachsmuth, in: L.-W. Ku, A. Martins, V. Srikumar (Eds.), Findings of the Association for Computational Linguistics: ACL 2024, Association for Computational Linguistics, Bangkok, Thailand, 2024, pp. 9294–9313.","chicago":"Spliethöver, Maximilian, Sai Nikhil Menon, and Henning Wachsmuth. “Disentangling Dialect from Social Bias via Multitask Learning to Improve Fairness.” In <i>Findings of the Association for Computational Linguistics: ACL 2024</i>, edited by Lun-Wei Ku, Andre Martins, and Vivek Srikumar, 9294–9313. Bangkok, Thailand: Association for Computational Linguistics, 2024. <a href=\"https://doi.org/10.18653/v1/2024.findings-acl.553\">https://doi.org/10.18653/v1/2024.findings-acl.553</a>.","apa":"Spliethöver, M., Menon, S. N., &#38; Wachsmuth, H. (2024). Disentangling Dialect from Social Bias via Multitask Learning to Improve Fairness. In L.-W. Ku, A. Martins, &#38; V. Srikumar (Eds.), <i>Findings of the Association for Computational Linguistics: ACL 2024</i> (pp. 9294–9313). Association for Computational Linguistics. <a href=\"https://doi.org/10.18653/v1/2024.findings-acl.553\">https://doi.org/10.18653/v1/2024.findings-acl.553</a>","ieee":"M. Spliethöver, S. N. Menon, and H. Wachsmuth, “Disentangling Dialect from Social Bias via Multitask Learning to Improve Fairness,” in <i>Findings of the Association for Computational Linguistics: ACL 2024</i>, 2024, pp. 9294–9313, doi: <a href=\"https://doi.org/10.18653/v1/2024.findings-acl.553\">10.18653/v1/2024.findings-acl.553</a>.","ama":"Spliethöver M, Menon SN, Wachsmuth H. Disentangling Dialect from Social Bias via Multitask Learning to Improve Fairness. In: Ku L-W, Martins A, Srikumar V, eds. <i>Findings of the Association for Computational Linguistics: ACL 2024</i>. Association for Computational Linguistics; 2024:9294–9313. doi:<a href=\"https://doi.org/10.18653/v1/2024.findings-acl.553\">10.18653/v1/2024.findings-acl.553</a>","bibtex":"@inproceedings{Spliethöver_Menon_Wachsmuth_2024, place={Bangkok, Thailand}, title={Disentangling Dialect from Social Bias via Multitask Learning to Improve Fairness}, DOI={<a href=\"https://doi.org/10.18653/v1/2024.findings-acl.553\">10.18653/v1/2024.findings-acl.553</a>}, booktitle={Findings of the Association for Computational Linguistics: ACL 2024}, publisher={Association for Computational Linguistics}, author={Spliethöver, Maximilian and Menon, Sai Nikhil and Wachsmuth, Henning}, editor={Ku, Lun-Wei and Martins, Andre and Srikumar, Vivek}, year={2024}, pages={9294–9313} }","mla":"Spliethöver, Maximilian, et al. “Disentangling Dialect from Social Bias via Multitask Learning to Improve Fairness.” <i>Findings of the Association for Computational Linguistics: ACL 2024</i>, edited by Lun-Wei Ku et al., Association for Computational Linguistics, 2024, pp. 9294–9313, doi:<a href=\"https://doi.org/10.18653/v1/2024.findings-acl.553\">10.18653/v1/2024.findings-acl.553</a>."},"project":[{"_id":"118","name":"TRR 318 - INF: TRR 318 - Project Area INF"}],"place":"Bangkok, Thailand","oa":"1","status":"public","page":"9294–9313","publisher":"Association for Computational Linguistics","_id":"58722","user_id":"84035","editor":[{"last_name":"Ku","first_name":"Lun-Wei","full_name":"Ku, Lun-Wei"},{"last_name":"Martins","first_name":"Andre","full_name":"Martins, Andre"},{"last_name":"Srikumar","first_name":"Vivek","full_name":"Srikumar, Vivek"}]},{"publication":"Lecture Notes in Computer Science","abstract":[{"lang":"eng","text":"Most FPGA boards in the HPC domain are well-suited for parallel scaling because of the direct integration of versatile and high-throughput network ports. However, the utilization of their network capabilities is often challenging and error-prone because the whole network stack and communication patterns have to be implemented and managed on the FPGAs. Also, this approach conceptually involves a trade-off between the performance potential of improved communication and the impact of resource consumption for communication infrastructure, since the utilized resources on the FPGAs could otherwise be used for computations. In this work, we investigate this trade-off, firstly, by using synthetic benchmarks to evaluate the different configuration options of the communication framework ACCL and their impact on communication latency and throughput. Finally, we use our findings to implement a shallow water simulation whose scalability heavily depends on low-latency communication. With a suitable configuration of ACCL, good scaling behavior can be shown to all 48 FPGAs installed in the system. Overall, the results show that the availability of inter-FPGA communication frameworks as well as the configurability of framework and network stack are crucial to achieve the best application performance with low latency communication."}],"date_created":"2025-11-04T09:50:24Z","department":[{"_id":"27"},{"_id":"518"}],"type":"book_chapter","publication_identifier":{"isbn":["9783031697654","9783031697661"],"issn":["0302-9743","1611-3349"]},"author":[{"last_name":"Meyer","first_name":"Marius","full_name":"Meyer, Marius","id":"40778"},{"first_name":"Tobias","last_name":"Kenter","full_name":"Kenter, Tobias","id":"3145"},{"full_name":"Petrica, Lucian","last_name":"Petrica","first_name":"Lucian"},{"full_name":"O’Brien, Kenneth","first_name":"Kenneth","last_name":"O’Brien"},{"first_name":"Michaela","last_name":"Blott","full_name":"Blott, Michaela"},{"id":"16153","full_name":"Plessl, Christian","first_name":"Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl"}],"year":"2024","title":"Optimizing Communication for Latency Sensitive HPC Applications on up to 48 FPGAs Using ACCL","date_updated":"2025-11-04T09:51:22Z","publication_status":"published","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1"}],"doi":"10.1007/978-3-031-69766-1_9","citation":{"mla":"Meyer, Marius, et al. “Optimizing Communication for Latency Sensitive HPC Applications on up to 48 FPGAs Using ACCL.” <i>Lecture Notes in Computer Science</i>, Springer Nature Switzerland, 2024, doi:<a href=\"https://doi.org/10.1007/978-3-031-69766-1_9\">10.1007/978-3-031-69766-1_9</a>.","bibtex":"@inbook{Meyer_Kenter_Petrica_O’Brien_Blott_Plessl_2024, place={Cham}, title={Optimizing Communication for Latency Sensitive HPC Applications on up to 48 FPGAs Using ACCL}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-69766-1_9\">10.1007/978-3-031-69766-1_9</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Nature Switzerland}, author={Meyer, Marius and Kenter, Tobias and Petrica, Lucian and O’Brien, Kenneth and Blott, Michaela and Plessl, Christian}, year={2024} }","ama":"Meyer M, Kenter T, Petrica L, O’Brien K, Blott M, Plessl C. Optimizing Communication for Latency Sensitive HPC Applications on up to 48 FPGAs Using ACCL. In: <i>Lecture Notes in Computer Science</i>. Springer Nature Switzerland; 2024. doi:<a href=\"https://doi.org/10.1007/978-3-031-69766-1_9\">10.1007/978-3-031-69766-1_9</a>","ieee":"M. Meyer, T. Kenter, L. Petrica, K. O’Brien, M. Blott, and C. Plessl, “Optimizing Communication for Latency Sensitive HPC Applications on up to 48 FPGAs Using ACCL,” in <i>Lecture Notes in Computer Science</i>, Cham: Springer Nature Switzerland, 2024.","apa":"Meyer, M., Kenter, T., Petrica, L., O’Brien, K., Blott, M., &#38; Plessl, C. (2024). Optimizing Communication for Latency Sensitive HPC Applications on up to 48 FPGAs Using ACCL. In <i>Lecture Notes in Computer Science</i>. Springer Nature Switzerland. <a href=\"https://doi.org/10.1007/978-3-031-69766-1_9\">https://doi.org/10.1007/978-3-031-69766-1_9</a>","short":"M. Meyer, T. Kenter, L. Petrica, K. O’Brien, M. Blott, C. Plessl, in: Lecture Notes in Computer Science, Springer Nature Switzerland, Cham, 2024.","chicago":"Meyer, Marius, Tobias Kenter, Lucian Petrica, Kenneth O’Brien, Michaela Blott, and Christian Plessl. “Optimizing Communication for Latency Sensitive HPC Applications on up to 48 FPGAs Using ACCL.” In <i>Lecture Notes in Computer Science</i>. Cham: Springer Nature Switzerland, 2024. <a href=\"https://doi.org/10.1007/978-3-031-69766-1_9\">https://doi.org/10.1007/978-3-031-69766-1_9</a>."},"project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"quality_controlled":"1","place":"Cham","oa":"1","status":"public","publisher":"Springer Nature Switzerland","_id":"62067","user_id":"3145"},{"department":[{"_id":"27"},{"_id":"518"}],"type":"journal_article","date_created":"2024-10-14T07:38:29Z","abstract":[{"lang":"eng","text":"This manuscript makes the claim of having computed the 9th Dedekind number, D(9). This was done by accelerating the core operation of the process with an efficient FPGA design that outperforms an optimized 64-core CPU reference by 95x. The FPGA execution was parallelized on the Noctua 2 supercomputer at Paderborn University. The resulting value for D(9) is 286386577668298411128469151667598498812366. This value can be verified in two steps. We have made the data file containing the 490 M results available, each of which can be verified separately on CPU, and the whole file sums to our proposed value. The paper explains the mathematical approach in the first part, before putting the focus on a deep dive into the FPGA accelerator implementation followed by a performance analysis. The FPGA implementation was done in Register-Transfer Level using a dual-clock architecture and shows how we achieved an impressive FMax of 450 MHz on the targeted Stratix 10 GX 2,800 FPGAs. The total compute time used was 47,000 FPGA hours."}],"publication":"ACM Transactions on Reconfigurable Technology and Systems","issue":"3","doi":"10.1145/3674147","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1"}],"intvolume":"        17","publication_status":"published","date_updated":"2025-11-04T09:53:26Z","author":[{"full_name":"Van Hirtum, Lennart","first_name":"Lennart","last_name":"Van Hirtum","id":"100210"},{"last_name":"De Causmaecker","first_name":"Patrick","full_name":"De Causmaecker, Patrick"},{"first_name":"Jens","last_name":"Goemaere","full_name":"Goemaere, Jens"},{"full_name":"Kenter, Tobias","first_name":"Tobias","last_name":"Kenter","id":"3145"},{"id":"8961","last_name":"Riebler","first_name":"Heinrich","full_name":"Riebler, Heinrich"},{"last_name":"Lass","first_name":"Michael","orcid":"0000-0002-5708-7632","full_name":"Lass, Michael","id":"24135"},{"id":"16153","orcid":"0000-0001-5728-9982","first_name":"Christian","last_name":"Plessl","full_name":"Plessl, Christian"}],"publication_identifier":{"issn":["1936-7406","1936-7414"]},"year":"2024","title":"A Computation of the Ninth Dedekind Number Using FPGA Supercomputing","oa":"1","project":[{"_id":"52","name":"PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"quality_controlled":"1","citation":{"mla":"Van Hirtum, Lennart, et al. “A Computation of the Ninth Dedekind Number Using FPGA Supercomputing.” <i>ACM Transactions on Reconfigurable Technology and Systems</i>, vol. 17, no. 3, Association for Computing Machinery (ACM), 2024, pp. 1–28, doi:<a href=\"https://doi.org/10.1145/3674147\">10.1145/3674147</a>.","bibtex":"@article{Van Hirtum_De Causmaecker_Goemaere_Kenter_Riebler_Lass_Plessl_2024, title={A Computation of the Ninth Dedekind Number Using FPGA Supercomputing}, volume={17}, DOI={<a href=\"https://doi.org/10.1145/3674147\">10.1145/3674147</a>}, number={3}, journal={ACM Transactions on Reconfigurable Technology and Systems}, publisher={Association for Computing Machinery (ACM)}, author={Van Hirtum, Lennart and De Causmaecker, Patrick and Goemaere, Jens and Kenter, Tobias and Riebler, Heinrich and Lass, Michael and Plessl, Christian}, year={2024}, pages={1–28} }","ama":"Van Hirtum L, De Causmaecker P, Goemaere J, et al. A Computation of the Ninth Dedekind Number Using FPGA Supercomputing. <i>ACM Transactions on Reconfigurable Technology and Systems</i>. 2024;17(3):1-28. doi:<a href=\"https://doi.org/10.1145/3674147\">10.1145/3674147</a>","ieee":"L. Van Hirtum <i>et al.</i>, “A Computation of the Ninth Dedekind Number Using FPGA Supercomputing,” <i>ACM Transactions on Reconfigurable Technology and Systems</i>, vol. 17, no. 3, pp. 1–28, 2024, doi: <a href=\"https://doi.org/10.1145/3674147\">10.1145/3674147</a>.","apa":"Van Hirtum, L., De Causmaecker, P., Goemaere, J., Kenter, T., Riebler, H., Lass, M., &#38; Plessl, C. (2024). A Computation of the Ninth Dedekind Number Using FPGA Supercomputing. <i>ACM Transactions on Reconfigurable Technology and Systems</i>, <i>17</i>(3), 1–28. <a href=\"https://doi.org/10.1145/3674147\">https://doi.org/10.1145/3674147</a>","chicago":"Van Hirtum, Lennart, Patrick De Causmaecker, Jens Goemaere, Tobias Kenter, Heinrich Riebler, Michael Lass, and Christian Plessl. “A Computation of the Ninth Dedekind Number Using FPGA Supercomputing.” <i>ACM Transactions on Reconfigurable Technology and Systems</i> 17, no. 3 (2024): 1–28. <a href=\"https://doi.org/10.1145/3674147\">https://doi.org/10.1145/3674147</a>.","short":"L. Van Hirtum, P. De Causmaecker, J. Goemaere, T. Kenter, H. Riebler, M. Lass, C. Plessl, ACM Transactions on Reconfigurable Technology and Systems 17 (2024) 1–28."},"volume":17,"user_id":"3145","publisher":"Association for Computing Machinery (ACM)","_id":"56604","page":"1-28","status":"public"},{"project":[{"_id":"52","name":"PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"quality_controlled":"1","citation":{"short":"K. Olgu, T. Kenter, J. Nunez-Yanez, S. Mcintosh-Smith, in: Proceedings of the 12th International Workshop on OpenCL and SYCL, ACM, 2024.","chicago":"Olgu, Kaan, Tobias Kenter, Jose Nunez-Yanez, and Simon Mcintosh-Smith. “Optimisation and Evaluation of Breadth First Search with OneAPI/SYCL on Intel FPGAs: From Describing Algorithms to Describing Architectures.” In <i>Proceedings of the 12th International Workshop on OpenCL and SYCL</i>. ACM, 2024. <a href=\"https://doi.org/10.1145/3648115.3648134\">https://doi.org/10.1145/3648115.3648134</a>.","apa":"Olgu, K., Kenter, T., Nunez-Yanez, J., &#38; Mcintosh-Smith, S. (2024). Optimisation and Evaluation of Breadth First Search with oneAPI/SYCL on Intel FPGAs: from Describing Algorithms to Describing Architectures. <i>Proceedings of the 12th International Workshop on OpenCL and SYCL</i>. <a href=\"https://doi.org/10.1145/3648115.3648134\">https://doi.org/10.1145/3648115.3648134</a>","ieee":"K. Olgu, T. Kenter, J. Nunez-Yanez, and S. Mcintosh-Smith, “Optimisation and Evaluation of Breadth First Search with oneAPI/SYCL on Intel FPGAs: from Describing Algorithms to Describing Architectures,” 2024, doi: <a href=\"https://doi.org/10.1145/3648115.3648134\">10.1145/3648115.3648134</a>.","ama":"Olgu K, Kenter T, Nunez-Yanez J, Mcintosh-Smith S. Optimisation and Evaluation of Breadth First Search with oneAPI/SYCL on Intel FPGAs: from Describing Algorithms to Describing Architectures. In: <i>Proceedings of the 12th International Workshop on OpenCL and SYCL</i>. ACM; 2024. doi:<a href=\"https://doi.org/10.1145/3648115.3648134\">10.1145/3648115.3648134</a>","bibtex":"@inproceedings{Olgu_Kenter_Nunez-Yanez_Mcintosh-Smith_2024, title={Optimisation and Evaluation of Breadth First Search with oneAPI/SYCL on Intel FPGAs: from Describing Algorithms to Describing Architectures}, DOI={<a href=\"https://doi.org/10.1145/3648115.3648134\">10.1145/3648115.3648134</a>}, booktitle={Proceedings of the 12th International Workshop on OpenCL and SYCL}, publisher={ACM}, author={Olgu, Kaan and Kenter, Tobias and Nunez-Yanez, Jose and Mcintosh-Smith, Simon}, year={2024} }","mla":"Olgu, Kaan, et al. “Optimisation and Evaluation of Breadth First Search with OneAPI/SYCL on Intel FPGAs: From Describing Algorithms to Describing Architectures.” <i>Proceedings of the 12th International Workshop on OpenCL and SYCL</i>, ACM, 2024, doi:<a href=\"https://doi.org/10.1145/3648115.3648134\">10.1145/3648115.3648134</a>."},"publication":"Proceedings of the 12th International Workshop on OpenCL and SYCL","department":[{"_id":"27"},{"_id":"518"}],"type":"conference","date_created":"2024-04-15T07:41:21Z","date_updated":"2025-11-04T09:53:59Z","publication_status":"published","author":[{"full_name":"Olgu, Kaan","last_name":"Olgu","first_name":"Kaan"},{"first_name":"Tobias","last_name":"Kenter","full_name":"Kenter, Tobias","id":"3145"},{"full_name":"Nunez-Yanez, Jose","first_name":"Jose","last_name":"Nunez-Yanez"},{"first_name":"Simon","last_name":"Mcintosh-Smith","full_name":"Mcintosh-Smith, Simon"}],"status":"public","year":"2024","title":"Optimisation and Evaluation of Breadth First Search with oneAPI/SYCL on Intel FPGAs: from Describing Algorithms to Describing Architectures","doi":"10.1145/3648115.3648134","user_id":"3145","_id":"53503","language":[{"iso":"eng"}],"publisher":"ACM"},{"doi":"10.1007/978-3-031-57246-3_13","user_id":"477","language":[{"iso":"eng"}],"_id":"53942","publisher":"Springer Nature Switzerland","date_updated":"2025-11-11T14:26:52Z","publication_status":"published","status":"public","year":"2024","title":"SootUp: A Redesign of the Soot Static Analysis Framework","author":[{"id":"70410","full_name":"Karakaya, Kadiray","last_name":"Karakaya","first_name":"Kadiray","orcid":"https://orcid.org/0000-0001-9266-2084"},{"full_name":"Schott, Stefan","first_name":"Stefan","last_name":"Schott","id":"54847"},{"full_name":"Klauke, Jonas","last_name":"Klauke","orcid":"0000-0001-9160-9636","first_name":"Jonas","id":"40915"},{"id":"59256","first_name":"Eric","orcid":"0000-0003-3470-3647","last_name":"Bodden","full_name":"Bodden, Eric"},{"full_name":"Schmidt, Markus","last_name":"Schmidt","first_name":"Markus"},{"full_name":"Luo, Linghui","first_name":"Linghui","last_name":"Luo"},{"full_name":"He, Dongjie","first_name":"Dongjie","last_name":"He"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783031572456","9783031572463"]},"type":"book_chapter","department":[{"_id":"76"}],"place":"Cham","date_created":"2024-05-06T11:29:36Z","abstract":[{"lang":"eng","text":"<jats:title>Abstract</jats:title><jats:p>Since its inception two decades ago, <jats:sc>Soot</jats:sc> has become one of the most widely used open-source static analysis frameworks. Over time it has been extended with the contributions of countless researchers. Yet, at the same time, the requirements for <jats:sc>Soot</jats:sc> have changed over the years and become increasingly at odds with some of the major design decisions that underlie it. In this work, we thus present <jats:sc>SootUp</jats:sc>, a complete reimplementation of <jats:sc>Soot</jats:sc> that seeks to fulfill these requirements with a novel design, while at the same time keeping elements that <jats:sc>Soot</jats:sc> users have grown accustomed to.</jats:p>"}],"project":[{"_id":"107","name":"Reaktor: SFB 901 - Automatisierte Risikoanalyse in Bezug auf Open-Source-Abhängigkeiten (Hektor) (Transferproject T3)"},{"_id":"668","name":"HEKTOR: Automatisierte Risikoanalyse unter Berücksichtigung von Open-Source-Abhängigkeiten"},{"_id":"1","name":"SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten"},{"name":"SFB 901; Projektbereich T: Transferprojekte des Sonderforschungsbereichs","_id":"82"},{"_id":"107","name":"SFB 901; TP T3: Automatisierte Risikoanalyse in Bezug auf Open-Source-Abhängigkeiten (Hektor)"}],"publication":"Tools and Algorithms for the Construction and Analysis of Systems","citation":{"mla":"Karakaya, Kadiray, et al. “SootUp: A Redesign of the Soot Static Analysis Framework.” <i>Tools and Algorithms for the Construction and Analysis of Systems</i>, Springer Nature Switzerland, 2024, doi:<a href=\"https://doi.org/10.1007/978-3-031-57246-3_13\">10.1007/978-3-031-57246-3_13</a>.","bibtex":"@inbook{Karakaya_Schott_Klauke_Bodden_Schmidt_Luo_He_2024, place={Cham}, title={SootUp: A Redesign of the Soot Static Analysis Framework}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-57246-3_13\">10.1007/978-3-031-57246-3_13</a>}, booktitle={Tools and Algorithms for the Construction and Analysis of Systems}, publisher={Springer Nature Switzerland}, author={Karakaya, Kadiray and Schott, Stefan and Klauke, Jonas and Bodden, Eric and Schmidt, Markus and Luo, Linghui and He, Dongjie}, year={2024} }","ama":"Karakaya K, Schott S, Klauke J, et al. SootUp: A Redesign of the Soot Static Analysis Framework. In: <i>Tools and Algorithms for the Construction and Analysis of Systems</i>. Springer Nature Switzerland; 2024. doi:<a href=\"https://doi.org/10.1007/978-3-031-57246-3_13\">10.1007/978-3-031-57246-3_13</a>","ieee":"K. Karakaya <i>et al.</i>, “SootUp: A Redesign of the Soot Static Analysis Framework,” in <i>Tools and Algorithms for the Construction and Analysis of Systems</i>, Cham: Springer Nature Switzerland, 2024.","apa":"Karakaya, K., Schott, S., Klauke, J., Bodden, E., Schmidt, M., Luo, L., &#38; He, D. (2024). SootUp: A Redesign of the Soot Static Analysis Framework. In <i>Tools and Algorithms for the Construction and Analysis of Systems</i>. Springer Nature Switzerland. <a href=\"https://doi.org/10.1007/978-3-031-57246-3_13\">https://doi.org/10.1007/978-3-031-57246-3_13</a>","short":"K. Karakaya, S. Schott, J. Klauke, E. Bodden, M. Schmidt, L. Luo, D. He, in: Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature Switzerland, Cham, 2024.","chicago":"Karakaya, Kadiray, Stefan Schott, Jonas Klauke, Eric Bodden, Markus Schmidt, Linghui Luo, and Dongjie He. “SootUp: A Redesign of the Soot Static Analysis Framework.” In <i>Tools and Algorithms for the Construction and Analysis of Systems</i>. Cham: Springer Nature Switzerland, 2024. <a href=\"https://doi.org/10.1007/978-3-031-57246-3_13\">https://doi.org/10.1007/978-3-031-57246-3_13</a>."}}]