[{"citation":{"mla":"Gulenko, Maryna, et al. <i>CSR Reporting under the Non-Financial Reporting Directive: Evidence from Non-Publicly Listed Firms</i>. 2022, doi:<a href=\"https://doi.org/10.2139/ssrn.4040946\">10.2139/ssrn.4040946</a>.","ama":"Gulenko M, Kohlhase S, Kosi U. <i>CSR Reporting under the Non-Financial Reporting Directive: Evidence from Non-Publicly Listed Firms</i>.; 2022. doi:<a href=\"https://doi.org/10.2139/ssrn.4040946\">10.2139/ssrn.4040946</a>","bibtex":"@book{Gulenko_Kohlhase_Kosi_2022, title={CSR Reporting under the Non-Financial Reporting Directive: Evidence from Non-publicly Listed Firms}, DOI={<a href=\"https://doi.org/10.2139/ssrn.4040946\">10.2139/ssrn.4040946</a>}, author={Gulenko, Maryna and Kohlhase, Saskia and Kosi, Urska}, year={2022} }","apa":"Gulenko, M., Kohlhase, S., &#38; Kosi, U. (2022). <i>CSR Reporting under the Non-Financial Reporting Directive: Evidence from Non-publicly Listed Firms</i>. <a href=\"https://doi.org/10.2139/ssrn.4040946\">https://doi.org/10.2139/ssrn.4040946</a>","ieee":"M. Gulenko, S. Kohlhase, and U. Kosi, <i>CSR Reporting under the Non-Financial Reporting Directive: Evidence from Non-publicly Listed Firms</i>. 2022.","chicago":"Gulenko, Maryna, Saskia Kohlhase, and Urska Kosi. <i>CSR Reporting under the Non-Financial Reporting Directive: Evidence from Non-Publicly Listed Firms</i>, 2022. <a href=\"https://doi.org/10.2139/ssrn.4040946\">https://doi.org/10.2139/ssrn.4040946</a>.","short":"M. Gulenko, S. Kohlhase, U. Kosi, CSR Reporting under the Non-Financial Reporting Directive: Evidence from Non-Publicly Listed Firms, 2022."},"abstract":[{"text":"We examine variation in mandatory CSR reporting practices based on a large sample of non-publicly listed savings banks in Germany. They do not have typical shareholders but rather are established by municipal trustees and can serve clients only in their distinct operating area. This setting permits us to identify demand for CSR information by their main stakeholder groups – municipal trustees and private and corporate clients. In this way, our analysis focuses on the double-materiality approach to CSR reporting. We find that demand for CSR information by supervisory board chairperson belonging to a left-wing or green party and the presence of more supervisory board members belonging to a left-wing or green party are associated with longer CSR reports and more disclosure on environmental, social, employee and human rights matters. In addition, competition for private clients and the sustainability orientation of corporate clients are associated with longer reports and more disclosure on environmental, employee and human rights matters. These findings suggest that savings banks’ CSR reports cater to their principal stakeholders’ demand for CSR information.","lang":"eng"}],"date_created":"2023-01-17T12:40:09Z","department":[{"_id":"635"},{"_id":"186"},{"_id":"551"}],"keyword":["Corporate social responsibility","Mandatory reporting","Non-publicly listed banks","Double materiality","Stakeholder groups","Political influence"],"type":"working_paper","author":[{"id":"64226","first_name":"Maryna","last_name":"Gulenko","full_name":"Gulenko, Maryna"},{"first_name":"Saskia","last_name":"Kohlhase","full_name":"Kohlhase, Saskia"},{"id":"54068","full_name":"Kosi, Urska","first_name":"Urska","orcid":"0009-0009-2545-5929","last_name":"Kosi"}],"status":"public","title":"CSR Reporting under the Non-Financial Reporting Directive: Evidence from Non-publicly Listed Firms","year":"2022","date_updated":"2026-06-15T09:42:09Z","_id":"37088","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://papers.ssrn.com/sol3/papers.cfm?abstract_id=4040946"}],"doi":"10.2139/ssrn.4040946","user_id":"54068"},{"author":[{"first_name":"Raja","last_name":"Herold-Blasius","full_name":"Herold-Blasius, Raja","id":"126182"},{"full_name":"Rott, Benjamin","first_name":"Benjamin","last_name":"Rott"}],"conference":{"name":"Twelfth Congress of the European Society for Research in Mathematics Education (CERME12)","location":"Bozen-Bolzano"},"status":"public","title":"Low-achieving secondary students learn mathematical problem solving. A longitudinal, qualitative video study","year":"2022","has_accepted_license":"1","date_updated":"2026-06-24T06:38:24Z","_id":"65890","language":[{"iso":"eng"}],"page":"452-459","user_id":"126182","ddc":["510"],"citation":{"bibtex":"@inproceedings{Herold-Blasius_Rott_2022, title={Low-achieving secondary students learn mathematical problem solving. A longitudinal, qualitative video study}, booktitle={Twelfth Congress of the European Society for Research in Mathematics Education (CERME12)}, author={Herold-Blasius, Raja and Rott, Benjamin}, year={2022}, pages={452–459} }","ama":"Herold-Blasius R, Rott B. Low-achieving secondary students learn mathematical problem solving. A longitudinal, qualitative video study. In: <i>Twelfth Congress of the European Society for Research in Mathematics Education (CERME12)</i>. ; 2022:452-459.","mla":"Herold-Blasius, Raja, and Benjamin Rott. “Low-Achieving Secondary Students Learn Mathematical Problem Solving. A Longitudinal, Qualitative Video Study.” <i>Twelfth Congress of the European Society for Research in Mathematics Education (CERME12)</i>, 2022, pp. 452–59.","short":"R. Herold-Blasius, B. Rott, in: Twelfth Congress of the European Society for Research in Mathematics Education (CERME12), 2022, pp. 452–459.","chicago":"Herold-Blasius, Raja, and Benjamin Rott. “Low-Achieving Secondary Students Learn Mathematical Problem Solving. A Longitudinal, Qualitative Video Study.” In <i>Twelfth Congress of the European Society for Research in Mathematics Education (CERME12)</i>, 452–59, 2022.","ieee":"R. Herold-Blasius and B. Rott, “Low-achieving secondary students learn mathematical problem solving. A longitudinal, qualitative video study,” in <i>Twelfth Congress of the European Society for Research in Mathematics Education (CERME12)</i>, Bozen-Bolzano, 2022, pp. 452–459.","apa":"Herold-Blasius, R., &#38; Rott, B. (2022). Low-achieving secondary students learn mathematical problem solving. A longitudinal, qualitative video study. <i>Twelfth Congress of the European Society for Research in Mathematics Education (CERME12)</i>, 452–459."},"file_date_updated":"2026-06-15T10:11:28Z","publication":"Twelfth Congress of the European Society for Research in Mathematics Education (CERME12)","quality_controlled":"1","date_created":"2026-06-15T10:11:31Z","file":[{"relation":"main_file","date_updated":"2026-06-15T10:11:28Z","file_name":"2022_TWG25_10_Herold-Blasius.pdf","access_level":"open_access","file_size":366608,"file_id":"65891","content_type":"application/pdf","creator":"rheroldb","date_created":"2026-06-15T10:11:28Z"}],"oa":"1","type":"conference"},{"_id":"66265","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","page":"6:1–6:22","editor":[{"first_name":"Martina","last_name":"Maggio","full_name":"Maggio, Martina"}],"volume":231,"doi":"10.4230/LIPIcs.ECRTS.2022.6","user_id":"128464","publication_identifier":{"isbn":["978-3-95977-239-6"],"issn":["1868-8969"]},"author":[{"last_name":"Chen","first_name":"Kuan-Hsun","full_name":"Chen, Kuan-Hsun"},{"full_name":"Günzel, Mario","last_name":"Günzel","first_name":"Mario"},{"full_name":"Jablkowski, Boguslaw","last_name":"Jablkowski","first_name":"Boguslaw"},{"last_name":"Buschhoff","first_name":"Markus","full_name":"Buschhoff, Markus"},{"full_name":"Chen, Jian-Jia","first_name":"Jian-Jia","last_name":"Chen"}],"status":"public","title":"Unikernel-Based Real-Time Virtualization Under Deferrable Servers: Analysis and Realization","year":"2022","intvolume":"       231","date_updated":"2026-07-05T14:42:53Z","place":"Dagstuhl, Germany","date_created":"2026-07-05T14:40:21Z","type":"conference","citation":{"mla":"Chen, Kuan-Hsun, et al. “Unikernel-Based Real-Time Virtualization Under Deferrable Servers: Analysis and Realization.” <i>34th Euromicro Conference on Real-Time Systems (ECRTS 2022)</i>, edited by Martina Maggio, vol. 231, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022, p. 6:1–6:22, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ECRTS.2022.6\">10.4230/LIPIcs.ECRTS.2022.6</a>.","bibtex":"@inproceedings{Chen_Günzel_Jablkowski_Buschhoff_Chen_2022, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Unikernel-Based Real-Time Virtualization Under Deferrable Servers: Analysis and Realization}, volume={231}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.ECRTS.2022.6\">10.4230/LIPIcs.ECRTS.2022.6</a>}, booktitle={34th Euromicro Conference on Real-Time Systems (ECRTS 2022)}, publisher={Schloss Dagstuhl – Leibniz-Zentrum für Informatik}, author={Chen, Kuan-Hsun and Günzel, Mario and Jablkowski, Boguslaw and Buschhoff, Markus and Chen, Jian-Jia}, editor={Maggio, Martina}, year={2022}, pages={6:1–6:22}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","ama":"Chen K-H, Günzel M, Jablkowski B, Buschhoff M, Chen J-J. Unikernel-Based Real-Time Virtualization Under Deferrable Servers: Analysis and Realization. In: Maggio M, ed. <i>34th Euromicro Conference on Real-Time Systems (ECRTS 2022)</i>. Vol 231. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2022:6:1–6:22. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ECRTS.2022.6\">10.4230/LIPIcs.ECRTS.2022.6</a>","ieee":"K.-H. Chen, M. Günzel, B. Jablkowski, M. Buschhoff, and J.-J. Chen, “Unikernel-Based Real-Time Virtualization Under Deferrable Servers: Analysis and Realization,” in <i>34th Euromicro Conference on Real-Time Systems (ECRTS 2022)</i>, 2022, vol. 231, p. 6:1–6:22, doi: <a href=\"https://doi.org/10.4230/LIPIcs.ECRTS.2022.6\">10.4230/LIPIcs.ECRTS.2022.6</a>.","apa":"Chen, K.-H., Günzel, M., Jablkowski, B., Buschhoff, M., &#38; Chen, J.-J. (2022). Unikernel-Based Real-Time Virtualization Under Deferrable Servers: Analysis and Realization. In M. Maggio (Ed.), <i>34th Euromicro Conference on Real-Time Systems (ECRTS 2022)</i> (Vol. 231, p. 6:1–6:22). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ECRTS.2022.6\">https://doi.org/10.4230/LIPIcs.ECRTS.2022.6</a>","chicago":"Chen, Kuan-Hsun, Mario Günzel, Boguslaw Jablkowski, Markus Buschhoff, and Jian-Jia Chen. “Unikernel-Based Real-Time Virtualization Under Deferrable Servers: Analysis and Realization.” In <i>34th Euromicro Conference on Real-Time Systems (ECRTS 2022)</i>, edited by Martina Maggio, 231:6:1–6:22. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.ECRTS.2022.6\">https://doi.org/10.4230/LIPIcs.ECRTS.2022.6</a>.","short":"K.-H. Chen, M. Günzel, B. Jablkowski, M. Buschhoff, J.-J. Chen, in: M. Maggio (Ed.), 34th Euromicro Conference on Real-Time Systems (ECRTS 2022), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022, p. 6:1–6:22."},"publication":"34th Euromicro Conference on Real-Time Systems (ECRTS 2022)"},{"type":"conference","place":"Dagstuhl, Germany","date_created":"2026-07-05T14:39:51Z","citation":{"chicago":"Hahn, Sebastian, Michael Jacobs, Nils Hölscher, Kuan-Hsun Chen, Jian-Jia Chen, and Jan Reineke. “LLVMTA: An LLVM-Based WCET Analysis Tool.” In <i>20th International Workshop on Worst-Case Execution Time Analysis (WCET 2022)</i>, edited by Clément Ballabriga, 103:2:1–2:17. Open Access Series in Informatics (OASIcs). Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/OASIcs.WCET.2022.2\">https://doi.org/10.4230/OASIcs.WCET.2022.2</a>.","short":"S. Hahn, M. Jacobs, N. Hölscher, K.-H. Chen, J.-J. Chen, J. Reineke, in: C. Ballabriga (Ed.), 20th International Workshop on Worst-Case Execution Time Analysis (WCET 2022), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022, p. 2:1–2:17.","ieee":"S. Hahn, M. Jacobs, N. Hölscher, K.-H. Chen, J.-J. Chen, and J. Reineke, “LLVMTA: An LLVM-Based WCET Analysis Tool,” in <i>20th International Workshop on Worst-Case Execution Time Analysis (WCET 2022)</i>, 2022, vol. 103, p. 2:1–2:17, doi: <a href=\"https://doi.org/10.4230/OASIcs.WCET.2022.2\">10.4230/OASIcs.WCET.2022.2</a>.","apa":"Hahn, S., Jacobs, M., Hölscher, N., Chen, K.-H., Chen, J.-J., &#38; Reineke, J. (2022). LLVMTA: An LLVM-Based WCET Analysis Tool. In C. Ballabriga (Ed.), <i>20th International Workshop on Worst-Case Execution Time Analysis (WCET 2022)</i> (Vol. 103, p. 2:1–2:17). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/OASIcs.WCET.2022.2\">https://doi.org/10.4230/OASIcs.WCET.2022.2</a>","bibtex":"@inproceedings{Hahn_Jacobs_Hölscher_Chen_Chen_Reineke_2022, place={Dagstuhl, Germany}, series={Open Access Series in Informatics (OASIcs)}, title={LLVMTA: An LLVM-Based WCET Analysis Tool}, volume={103}, DOI={<a href=\"https://doi.org/10.4230/OASIcs.WCET.2022.2\">10.4230/OASIcs.WCET.2022.2</a>}, booktitle={20th International Workshop on Worst-Case Execution Time Analysis (WCET 2022)}, publisher={Schloss Dagstuhl – Leibniz-Zentrum für Informatik}, author={Hahn, Sebastian and Jacobs, Michael and Hölscher, Nils and Chen, Kuan-Hsun and Chen, Jian-Jia and Reineke, Jan}, editor={Ballabriga, Clément}, year={2022}, pages={2:1–2:17}, collection={Open Access Series in Informatics (OASIcs)} }","ama":"Hahn S, Jacobs M, Hölscher N, Chen K-H, Chen J-J, Reineke J. LLVMTA: An LLVM-Based WCET Analysis Tool. In: Ballabriga C, ed. <i>20th International Workshop on Worst-Case Execution Time Analysis (WCET 2022)</i>. Vol 103. Open Access Series in Informatics (OASIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2022:2:1–2:17. doi:<a href=\"https://doi.org/10.4230/OASIcs.WCET.2022.2\">10.4230/OASIcs.WCET.2022.2</a>","mla":"Hahn, Sebastian, et al. “LLVMTA: An LLVM-Based WCET Analysis Tool.” <i>20th International Workshop on Worst-Case Execution Time Analysis (WCET 2022)</i>, edited by Clément Ballabriga, vol. 103, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022, p. 2:1–2:17, doi:<a href=\"https://doi.org/10.4230/OASIcs.WCET.2022.2\">10.4230/OASIcs.WCET.2022.2</a>."},"publication":"20th International Workshop on Worst-Case Execution Time Analysis (WCET 2022)","editor":[{"last_name":"Ballabriga","first_name":"Clément","full_name":"Ballabriga, Clément"}],"volume":103,"doi":"10.4230/OASIcs.WCET.2022.2","user_id":"128464","series_title":"Open Access Series in Informatics (OASIcs)","_id":"66262","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","page":"2:1–2:17","intvolume":"       103","date_updated":"2026-07-05T14:43:03Z","publication_identifier":{"issn":["2190-6807"],"isbn":["978-3-95977-244-0"]},"author":[{"full_name":"Hahn, Sebastian","first_name":"Sebastian","last_name":"Hahn"},{"last_name":"Jacobs","first_name":"Michael","full_name":"Jacobs, Michael"},{"first_name":"Nils","last_name":"Hölscher","full_name":"Hölscher, Nils"},{"full_name":"Chen, Kuan-Hsun","last_name":"Chen","first_name":"Kuan-Hsun"},{"first_name":"Jian-Jia","last_name":"Chen","full_name":"Chen, Jian-Jia"},{"full_name":"Reineke, Jan","first_name":"Jan","last_name":"Reineke"}],"title":"LLVMTA: An LLVM-Based WCET Analysis Tool","status":"public","year":"2022"},{"_id":"66224","publisher":"IEEE","doi":"10.1109/fmec54266.2021.9732572","user_id":"128464","author":[{"last_name":"Freymann","first_name":"Raphael","full_name":"Freymann, Raphael"},{"full_name":"Shi, Junjie","first_name":"Junjie","last_name":"Shi"},{"last_name":"Chen","first_name":"Jian-Jia","full_name":"Chen, Jian-Jia"},{"last_name":"Chen","first_name":"Kuan-Hsun","full_name":"Chen, Kuan-Hsun"}],"title":"Renovation of EdgeCloudSim: An Efficient Discrete-Event Approach","status":"public","year":"2022","date_updated":"2026-07-05T14:44:25Z","publication_status":"published","date_created":"2026-07-03T21:21:50Z","type":"conference","citation":{"apa":"Freymann, R., Shi, J., Chen, J.-J., &#38; Chen, K.-H. (2022). Renovation of EdgeCloudSim: An Efficient Discrete-Event Approach. <i>2021 Sixth International Conference on Fog and Mobile Edge Computing (FMEC)</i>. <a href=\"https://doi.org/10.1109/fmec54266.2021.9732572\">https://doi.org/10.1109/fmec54266.2021.9732572</a>","ieee":"R. Freymann, J. Shi, J.-J. Chen, and K.-H. Chen, “Renovation of EdgeCloudSim: An Efficient Discrete-Event Approach,” 2022, doi: <a href=\"https://doi.org/10.1109/fmec54266.2021.9732572\">10.1109/fmec54266.2021.9732572</a>.","short":"R. Freymann, J. Shi, J.-J. Chen, K.-H. Chen, in: 2021 Sixth International Conference on Fog and Mobile Edge Computing (FMEC), IEEE, 2022.","chicago":"Freymann, Raphael, Junjie Shi, Jian-Jia Chen, and Kuan-Hsun Chen. “Renovation of EdgeCloudSim: An Efficient Discrete-Event Approach.” In <i>2021 Sixth International Conference on Fog and Mobile Edge Computing (FMEC)</i>. IEEE, 2022. <a href=\"https://doi.org/10.1109/fmec54266.2021.9732572\">https://doi.org/10.1109/fmec54266.2021.9732572</a>.","mla":"Freymann, Raphael, et al. “Renovation of EdgeCloudSim: An Efficient Discrete-Event Approach.” <i>2021 Sixth International Conference on Fog and Mobile Edge Computing (FMEC)</i>, IEEE, 2022, doi:<a href=\"https://doi.org/10.1109/fmec54266.2021.9732572\">10.1109/fmec54266.2021.9732572</a>.","ama":"Freymann R, Shi J, Chen J-J, Chen K-H. Renovation of EdgeCloudSim: An Efficient Discrete-Event Approach. In: <i>2021 Sixth International Conference on Fog and Mobile Edge Computing (FMEC)</i>. IEEE; 2022. doi:<a href=\"https://doi.org/10.1109/fmec54266.2021.9732572\">10.1109/fmec54266.2021.9732572</a>","bibtex":"@inproceedings{Freymann_Shi_Chen_Chen_2022, title={Renovation of EdgeCloudSim: An Efficient Discrete-Event Approach}, DOI={<a href=\"https://doi.org/10.1109/fmec54266.2021.9732572\">10.1109/fmec54266.2021.9732572</a>}, booktitle={2021 Sixth International Conference on Fog and Mobile Edge Computing (FMEC)}, publisher={IEEE}, author={Freymann, Raphael and Shi, Junjie and Chen, Jian-Jia and Chen, Kuan-Hsun}, year={2022} }"},"publication":"2021 Sixth International Conference on Fog and Mobile Edge Computing (FMEC)"},{"user_id":"128464","volume":21,"page":"1-26","_id":"66203","publisher":"Association for Computing Machinery (ACM)","status":"public","citation":{"bibtex":"@article{Chen_Su_Hakert_Buschjäger_Lee_Lee_Morik_Chen_2022, title={Efficient Realization of Decision Trees for Real-Time Inference}, volume={21}, DOI={<a href=\"https://doi.org/10.1145/3508019\">10.1145/3508019</a>}, number={6}, journal={ACM Transactions on Embedded Computing Systems}, publisher={Association for Computing Machinery (ACM)}, author={Chen, Kuan-Hsun and Su, Chiahui and Hakert, Christian and Buschjäger, Sebastian and Lee, Chao-Lin and Lee, Jenq-Kuen and Morik, Katharina and Chen, Jian-Jia}, year={2022}, pages={1–26} }","ama":"Chen K-H, Su C, Hakert C, et al. Efficient Realization of Decision Trees for Real-Time Inference. <i>ACM Transactions on Embedded Computing Systems</i>. 2022;21(6):1-26. doi:<a href=\"https://doi.org/10.1145/3508019\">10.1145/3508019</a>","mla":"Chen, Kuan-Hsun, et al. “Efficient Realization of Decision Trees for Real-Time Inference.” <i>ACM Transactions on Embedded Computing Systems</i>, vol. 21, no. 6, Association for Computing Machinery (ACM), 2022, pp. 1–26, doi:<a href=\"https://doi.org/10.1145/3508019\">10.1145/3508019</a>.","short":"K.-H. Chen, C. Su, C. Hakert, S. Buschjäger, C.-L. Lee, J.-K. Lee, K. Morik, J.-J. Chen, ACM Transactions on Embedded Computing Systems 21 (2022) 1–26.","chicago":"Chen, Kuan-Hsun, Chiahui Su, Christian Hakert, Sebastian Buschjäger, Chao-Lin Lee, Jenq-Kuen Lee, Katharina Morik, and Jian-Jia Chen. “Efficient Realization of Decision Trees for Real-Time Inference.” <i>ACM Transactions on Embedded Computing Systems</i> 21, no. 6 (2022): 1–26. <a href=\"https://doi.org/10.1145/3508019\">https://doi.org/10.1145/3508019</a>.","ieee":"K.-H. Chen <i>et al.</i>, “Efficient Realization of Decision Trees for Real-Time Inference,” <i>ACM Transactions on Embedded Computing Systems</i>, vol. 21, no. 6, pp. 1–26, 2022, doi: <a href=\"https://doi.org/10.1145/3508019\">10.1145/3508019</a>.","apa":"Chen, K.-H., Su, C., Hakert, C., Buschjäger, S., Lee, C.-L., Lee, J.-K., Morik, K., &#38; Chen, J.-J. (2022). Efficient Realization of Decision Trees for Real-Time Inference. <i>ACM Transactions on Embedded Computing Systems</i>, <i>21</i>(6), 1–26. <a href=\"https://doi.org/10.1145/3508019\">https://doi.org/10.1145/3508019</a>"},"doi":"10.1145/3508019","language":[{"iso":"eng"}],"date_updated":"2026-07-05T14:45:39Z","publication_status":"published","intvolume":"        21","title":"Efficient Realization of Decision Trees for Real-Time Inference","year":"2022","author":[{"first_name":"Kuan-Hsun","last_name":"Chen","full_name":"Chen, Kuan-Hsun"},{"last_name":"Su","first_name":"Chiahui","full_name":"Su, Chiahui"},{"full_name":"Hakert, Christian","last_name":"Hakert","first_name":"Christian"},{"first_name":"Sebastian","last_name":"Buschjäger","full_name":"Buschjäger, Sebastian"},{"full_name":"Lee, Chao-Lin","first_name":"Chao-Lin","last_name":"Lee"},{"full_name":"Lee, Jenq-Kuen","last_name":"Lee","first_name":"Jenq-Kuen"},{"last_name":"Morik","first_name":"Katharina","full_name":"Morik, Katharina"},{"full_name":"Chen, Jian-Jia","last_name":"Chen","first_name":"Jian-Jia"}],"publication_identifier":{"issn":["1539-9087","1558-3465"]},"type":"journal_article","date_created":"2026-07-03T21:17:45Z","abstract":[{"text":"<jats:p>For timing-sensitive edge applications, the demand for efficient lightweight machine learning solutions has increased recently. Tree ensembles are among the state-of-the-art in many machine learning applications. While single decision trees are comparably small, an ensemble of trees can have a significant memory footprint leading to cache locality issues, which are crucial to performance in terms of execution time. In this work, we analyze memory-locality issues of the two most common realizations of decision trees, i.e., native and if-else trees. We highlight that both realizations demand a more careful memory layout to improve caching behavior and maximize performance. We adopt a probabilistic model of decision tree inference to find the best memory layout for each tree at the application layer. Further, we present an efficient heuristic to take architecture-dependent information into account thereby optimizing the given ensemble for a target computer architecture. Our code-generation framework, which is freely available on an open-source repository, produces optimized code sessions while preserving the structure and accuracy of the trees. With several real-world data sets, we evaluate the elapsed time of various tree realizations on server hardware as well as embedded systems for Intel and ARM processors. Our optimized memory layout achieves a reduction in execution time up to 75 % execution for server-class systems, and up to 70 % for embedded systems, respectively.</jats:p>","lang":"eng"}],"publication":"ACM Transactions on Embedded Computing Systems","issue":"6"},{"citation":{"ieee":"K.-H. Chen <i>et al.</i>, “Efficient Realization of Decision Trees for Real-Time Inference,” <i>ACM Transactions on Embedded Computing Systems</i>, vol. 21, no. 6, pp. 1–26, 2022, doi: <a href=\"https://doi.org/10.1145/3508019\">10.1145/3508019</a>.","apa":"Chen, K.-H., Su, C., Hakert, C., Buschjäger, S., Lee, C.-L., Lee, J.-K., Morik, K., &#38; Chen, J.-J. (2022). Efficient Realization of Decision Trees for Real-Time Inference. <i>ACM Transactions on Embedded Computing Systems</i>, <i>21</i>(6), 1–26. <a href=\"https://doi.org/10.1145/3508019\">https://doi.org/10.1145/3508019</a>","chicago":"Chen, Kuan-Hsun, Chiahui Su, Christian Hakert, Sebastian Buschjäger, Chao-Lin Lee, Jenq-Kuen Lee, Katharina Morik, and Jian-Jia Chen. “Efficient Realization of Decision Trees for Real-Time Inference.” <i>ACM Transactions on Embedded Computing Systems</i> 21, no. 6 (2022): 1–26. <a href=\"https://doi.org/10.1145/3508019\">https://doi.org/10.1145/3508019</a>.","short":"K.-H. Chen, C. Su, C. Hakert, S. Buschjäger, C.-L. Lee, J.-K. Lee, K. Morik, J.-J. Chen, ACM Transactions on Embedded Computing Systems 21 (2022) 1–26.","mla":"Chen, Kuan-Hsun, et al. “Efficient Realization of Decision Trees for Real-Time Inference.” <i>ACM Transactions on Embedded Computing Systems</i>, vol. 21, no. 6, Association for Computing Machinery (ACM), 2022, pp. 1–26, doi:<a href=\"https://doi.org/10.1145/3508019\">10.1145/3508019</a>.","bibtex":"@article{Chen_Su_Hakert_Buschjäger_Lee_Lee_Morik_Chen_2022, title={Efficient Realization of Decision Trees for Real-Time Inference}, volume={21}, DOI={<a href=\"https://doi.org/10.1145/3508019\">10.1145/3508019</a>}, number={6}, journal={ACM Transactions on Embedded Computing Systems}, publisher={Association for Computing Machinery (ACM)}, author={Chen, Kuan-Hsun and Su, Chiahui and Hakert, Christian and Buschjäger, Sebastian and Lee, Chao-Lin and Lee, Jenq-Kuen and Morik, Katharina and Chen, Jian-Jia}, year={2022}, pages={1–26} }","ama":"Chen K-H, Su C, Hakert C, et al. Efficient Realization of Decision Trees for Real-Time Inference. <i>ACM Transactions on Embedded Computing Systems</i>. 2022;21(6):1-26. doi:<a href=\"https://doi.org/10.1145/3508019\">10.1145/3508019</a>"},"user_id":"128464","volume":21,"page":"1-26","_id":"66209","publisher":"Association for Computing Machinery (ACM)","status":"public","type":"journal_article","date_created":"2026-07-03T21:18:32Z","abstract":[{"text":"<jats:p>For timing-sensitive edge applications, the demand for efficient lightweight machine learning solutions has increased recently. Tree ensembles are among the state-of-the-art in many machine learning applications. While single decision trees are comparably small, an ensemble of trees can have a significant memory footprint leading to cache locality issues, which are crucial to performance in terms of execution time. In this work, we analyze memory-locality issues of the two most common realizations of decision trees, i.e., native and if-else trees. We highlight that both realizations demand a more careful memory layout to improve caching behavior and maximize performance. We adopt a probabilistic model of decision tree inference to find the best memory layout for each tree at the application layer. Further, we present an efficient heuristic to take architecture-dependent information into account thereby optimizing the given ensemble for a target computer architecture. Our code-generation framework, which is freely available on an open-source repository, produces optimized code sessions while preserving the structure and accuracy of the trees. With several real-world data sets, we evaluate the elapsed time of various tree realizations on server hardware as well as embedded systems for Intel and ARM processors. Our optimized memory layout achieves a reduction in execution time up to 75 % execution for server-class systems, and up to 70 % for embedded systems, respectively.</jats:p>","lang":"eng"}],"issue":"6","publication":"ACM Transactions on Embedded Computing Systems","doi":"10.1145/3508019","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2026-07-05T14:45:55Z","intvolume":"        21","year":"2022","title":"Efficient Realization of Decision Trees for Real-Time Inference","publication_identifier":{"issn":["1539-9087","1558-3465"]},"author":[{"full_name":"Chen, Kuan-Hsun","last_name":"Chen","first_name":"Kuan-Hsun"},{"first_name":"Chiahui","last_name":"Su","full_name":"Su, Chiahui"},{"full_name":"Hakert, Christian","first_name":"Christian","last_name":"Hakert"},{"full_name":"Buschjäger, Sebastian","first_name":"Sebastian","last_name":"Buschjäger"},{"first_name":"Chao-Lin","last_name":"Lee","full_name":"Lee, Chao-Lin"},{"full_name":"Lee, Jenq-Kuen","first_name":"Jenq-Kuen","last_name":"Lee"},{"first_name":"Katharina","last_name":"Morik","full_name":"Morik, Katharina"},{"first_name":"Jian-Jia","last_name":"Chen","full_name":"Chen, Jian-Jia"}]},{"date_created":"2026-07-03T21:17:30Z","type":"journal_article","publication":"ACM Transactions on Embedded Computing Systems","issue":"1","abstract":[{"lang":"eng","text":"<jats:p>\n            In-memory wear-leveling has become an important research field for emerging non-volatile main memories over the past years. Many approaches in the literature perform wear-leveling by making use of special hardware. Since most non-volatile memories only wear out from write accesses, the proposed approaches in the literature also usually try to spread write accesses widely over the entire memory space. Some non-volatile memories, however, also wear out from read accesses, because every read causes a consecutive write access. Software-based solutions only operate from the application or kernel level, where read and write accesses are realized with different instructions and semantics. Therefore different mechanisms are required to handle reads and writes on the software level. First, we design a method to approximate read and write accesses to the memory to allow aging aware coarse-grained wear-leveling in the absence of special hardware, providing the age information. Second, we provide specific solutions to resolve\n            <jats:italic>access hot-spots</jats:italic>\n            within the compiled program code (text segment) and on the application stack. In our evaluation, we estimate the cell age by counting the total amount of accesses per cell. The results show that employing all our methods improves the memory lifetime by up to a factor of 955×.\n          </jats:p>"}],"language":[{"iso":"eng"}],"doi":"10.1145/3483839","year":"2022","title":"Software-Managed Read and Write Wear-Leveling for Non-Volatile Main Memory","author":[{"first_name":"Christian","last_name":"Hakert","full_name":"Hakert, Christian"},{"full_name":"Chen, Kuan-Hsun","last_name":"Chen","first_name":"Kuan-Hsun"},{"first_name":"Horst","last_name":"Schirmeier","full_name":"Schirmeier, Horst"},{"full_name":"Bauer, Lars","last_name":"Bauer","first_name":"Lars"},{"last_name":"Genssler","first_name":"Paul R.","full_name":"Genssler, Paul R."},{"first_name":"Georg","last_name":"von der Brüggen","full_name":"von der Brüggen, Georg"},{"full_name":"Amrouch, Hussam","first_name":"Hussam","last_name":"Amrouch"},{"last_name":"Henkel","first_name":"Jörg","full_name":"Henkel, Jörg"},{"first_name":"Jian-Jia","last_name":"Chen","full_name":"Chen, Jian-Jia"}],"publication_identifier":{"issn":["1539-9087","1558-3465"]},"publication_status":"published","date_updated":"2026-07-05T14:45:36Z","intvolume":"        21","citation":{"bibtex":"@article{Hakert_Chen_Schirmeier_Bauer_Genssler_von der Brüggen_Amrouch_Henkel_Chen_2022, title={Software-Managed Read and Write Wear-Leveling for Non-Volatile Main Memory}, volume={21}, DOI={<a href=\"https://doi.org/10.1145/3483839\">10.1145/3483839</a>}, number={1}, journal={ACM Transactions on Embedded Computing Systems}, publisher={Association for Computing Machinery (ACM)}, author={Hakert, Christian and Chen, Kuan-Hsun and Schirmeier, Horst and Bauer, Lars and Genssler, Paul R. and von der Brüggen, Georg and Amrouch, Hussam and Henkel, Jörg and Chen, Jian-Jia}, year={2022}, pages={1–24} }","ama":"Hakert C, Chen K-H, Schirmeier H, et al. Software-Managed Read and Write Wear-Leveling for Non-Volatile Main Memory. <i>ACM Transactions on Embedded Computing Systems</i>. 2022;21(1):1-24. doi:<a href=\"https://doi.org/10.1145/3483839\">10.1145/3483839</a>","mla":"Hakert, Christian, et al. “Software-Managed Read and Write Wear-Leveling for Non-Volatile Main Memory.” <i>ACM Transactions on Embedded Computing Systems</i>, vol. 21, no. 1, Association for Computing Machinery (ACM), 2022, pp. 1–24, doi:<a href=\"https://doi.org/10.1145/3483839\">10.1145/3483839</a>.","chicago":"Hakert, Christian, Kuan-Hsun Chen, Horst Schirmeier, Lars Bauer, Paul R. Genssler, Georg von der Brüggen, Hussam Amrouch, Jörg Henkel, and Jian-Jia Chen. “Software-Managed Read and Write Wear-Leveling for Non-Volatile Main Memory.” <i>ACM Transactions on Embedded Computing Systems</i> 21, no. 1 (2022): 1–24. <a href=\"https://doi.org/10.1145/3483839\">https://doi.org/10.1145/3483839</a>.","short":"C. Hakert, K.-H. Chen, H. Schirmeier, L. Bauer, P.R. Genssler, G. von der Brüggen, H. Amrouch, J. Henkel, J.-J. Chen, ACM Transactions on Embedded Computing Systems 21 (2022) 1–24.","ieee":"C. Hakert <i>et al.</i>, “Software-Managed Read and Write Wear-Leveling for Non-Volatile Main Memory,” <i>ACM Transactions on Embedded Computing Systems</i>, vol. 21, no. 1, pp. 1–24, 2022, doi: <a href=\"https://doi.org/10.1145/3483839\">10.1145/3483839</a>.","apa":"Hakert, C., Chen, K.-H., Schirmeier, H., Bauer, L., Genssler, P. R., von der Brüggen, G., Amrouch, H., Henkel, J., &#38; Chen, J.-J. (2022). Software-Managed Read and Write Wear-Leveling for Non-Volatile Main Memory. <i>ACM Transactions on Embedded Computing Systems</i>, <i>21</i>(1), 1–24. <a href=\"https://doi.org/10.1145/3483839\">https://doi.org/10.1145/3483839</a>"},"page":"1-24","publisher":"Association for Computing Machinery (ACM)","_id":"66202","user_id":"128464","volume":21,"status":"public"},{"date_updated":"2026-07-05T14:45:57Z","publication_status":"published","author":[{"full_name":"Chen, Kuan-Hsun","last_name":"Chen","first_name":"Kuan-Hsun"},{"last_name":"Gunzel","first_name":"Mario","full_name":"Gunzel, Mario"},{"full_name":"von der Bruggen, Georg","first_name":"Georg","last_name":"von der Bruggen"},{"first_name":"Jian-Jia","last_name":"Chen","full_name":"Chen, Jian-Jia"}],"year":"2022","title":"Critical Instant for Probabilistic Timing Guarantees: Refuted and Revisited","status":"public","doi":"10.1109/rtss55097.2022.00022","user_id":"128464","publisher":"IEEE","_id":"66210","citation":{"ama":"Chen K-H, Gunzel M, von der Bruggen G, Chen J-J. Critical Instant for Probabilistic Timing Guarantees: Refuted and Revisited. In: <i>2022 IEEE Real-Time Systems Symposium (RTSS)</i>. IEEE; 2022. doi:<a href=\"https://doi.org/10.1109/rtss55097.2022.00022\">10.1109/rtss55097.2022.00022</a>","bibtex":"@inproceedings{Chen_Gunzel_von der Bruggen_Chen_2022, title={Critical Instant for Probabilistic Timing Guarantees: Refuted and Revisited}, DOI={<a href=\"https://doi.org/10.1109/rtss55097.2022.00022\">10.1109/rtss55097.2022.00022</a>}, booktitle={2022 IEEE Real-Time Systems Symposium (RTSS)}, publisher={IEEE}, author={Chen, Kuan-Hsun and Gunzel, Mario and von der Bruggen, Georg and Chen, Jian-Jia}, year={2022} }","mla":"Chen, Kuan-Hsun, et al. “Critical Instant for Probabilistic Timing Guarantees: Refuted and Revisited.” <i>2022 IEEE Real-Time Systems Symposium (RTSS)</i>, IEEE, 2022, doi:<a href=\"https://doi.org/10.1109/rtss55097.2022.00022\">10.1109/rtss55097.2022.00022</a>.","chicago":"Chen, Kuan-Hsun, Mario Gunzel, Georg von der Bruggen, and Jian-Jia Chen. “Critical Instant for Probabilistic Timing Guarantees: Refuted and Revisited.” In <i>2022 IEEE Real-Time Systems Symposium (RTSS)</i>. IEEE, 2022. <a href=\"https://doi.org/10.1109/rtss55097.2022.00022\">https://doi.org/10.1109/rtss55097.2022.00022</a>.","short":"K.-H. Chen, M. Gunzel, G. von der Bruggen, J.-J. Chen, in: 2022 IEEE Real-Time Systems Symposium (RTSS), IEEE, 2022.","apa":"Chen, K.-H., Gunzel, M., von der Bruggen, G., &#38; Chen, J.-J. (2022). Critical Instant for Probabilistic Timing Guarantees: Refuted and Revisited. <i>2022 IEEE Real-Time Systems Symposium (RTSS)</i>. <a href=\"https://doi.org/10.1109/rtss55097.2022.00022\">https://doi.org/10.1109/rtss55097.2022.00022</a>","ieee":"K.-H. Chen, M. Gunzel, G. von der Bruggen, and J.-J. Chen, “Critical Instant for Probabilistic Timing Guarantees: Refuted and Revisited,” 2022, doi: <a href=\"https://doi.org/10.1109/rtss55097.2022.00022\">10.1109/rtss55097.2022.00022</a>."},"publication":"2022 IEEE Real-Time Systems Symposium (RTSS)","type":"conference","date_created":"2026-07-03T21:18:40Z"},{"date_updated":"2026-07-05T14:45:52Z","publication_status":"published","year":"2022","title":"7 Memory Awareness","status":"public","author":[{"full_name":"Kotthaus, Helena","first_name":"Helena","last_name":"Kotthaus"},{"first_name":"Peter","last_name":"Marwedel","full_name":"Marwedel, Peter"},{"full_name":"Yayla, Mikail","first_name":"Mikail","last_name":"Yayla"},{"last_name":"Buschjäger","first_name":"Sebastian","full_name":"Buschjäger, Sebastian"},{"first_name":"Hussam","last_name":"Amrouch","full_name":"Amrouch, Hussam"},{"first_name":"Kuan-Hsun","last_name":"Chen","full_name":"Chen, Kuan-Hsun"}],"publication_identifier":{"isbn":["9783110785944"]},"doi":"10.1515/9783110785944-007","user_id":"128464","publisher":"De Gruyter","_id":"66213","publication":"Fundamentals","citation":{"mla":"Kotthaus, Helena, et al. “7 Memory Awareness.” <i>Fundamentals</i>, De Gruyter, 2022, doi:<a href=\"https://doi.org/10.1515/9783110785944-007\">10.1515/9783110785944-007</a>.","ama":"Kotthaus H, Marwedel P, Yayla M, Buschjäger S, Amrouch H, Chen K-H. 7 Memory Awareness. In: <i>Fundamentals</i>. De Gruyter; 2022. doi:<a href=\"https://doi.org/10.1515/9783110785944-007\">10.1515/9783110785944-007</a>","bibtex":"@inbook{Kotthaus_Marwedel_Yayla_Buschjäger_Amrouch_Chen_2022, title={7 Memory Awareness}, DOI={<a href=\"https://doi.org/10.1515/9783110785944-007\">10.1515/9783110785944-007</a>}, booktitle={Fundamentals}, publisher={De Gruyter}, author={Kotthaus, Helena and Marwedel, Peter and Yayla, Mikail and Buschjäger, Sebastian and Amrouch, Hussam and Chen, Kuan-Hsun}, year={2022} }","apa":"Kotthaus, H., Marwedel, P., Yayla, M., Buschjäger, S., Amrouch, H., &#38; Chen, K.-H. (2022). 7 Memory Awareness. In <i>Fundamentals</i>. De Gruyter. <a href=\"https://doi.org/10.1515/9783110785944-007\">https://doi.org/10.1515/9783110785944-007</a>","ieee":"H. Kotthaus, P. Marwedel, M. Yayla, S. Buschjäger, H. Amrouch, and K.-H. Chen, “7 Memory Awareness,” in <i>Fundamentals</i>, De Gruyter, 2022.","short":"H. Kotthaus, P. Marwedel, M. Yayla, S. Buschjäger, H. Amrouch, K.-H. Chen, in: Fundamentals, De Gruyter, 2022.","chicago":"Kotthaus, Helena, Peter Marwedel, Mikail Yayla, Sebastian Buschjäger, Hussam Amrouch, and Kuan-Hsun Chen. “7 Memory Awareness.” In <i>Fundamentals</i>. De Gruyter, 2022. <a href=\"https://doi.org/10.1515/9783110785944-007\">https://doi.org/10.1515/9783110785944-007</a>."},"type":"book_chapter","date_created":"2026-07-03T21:19:24Z"},{"citation":{"apa":"Gunzel, M., von der Bruggen, G., Chen, K.-H., &#38; Chen, J.-J. (2022). EDF-Like Scheduling for Self-Suspending Real-Time Tasks. <i>2022 IEEE Real-Time Systems Symposium (RTSS)</i>. <a href=\"https://doi.org/10.1109/rtss55097.2022.00024\">https://doi.org/10.1109/rtss55097.2022.00024</a>","ieee":"M. Gunzel, G. von der Bruggen, K.-H. Chen, and J.-J. Chen, “EDF-Like Scheduling for Self-Suspending Real-Time Tasks,” 2022, doi: <a href=\"https://doi.org/10.1109/rtss55097.2022.00024\">10.1109/rtss55097.2022.00024</a>.","chicago":"Gunzel, Mario, Georg von der Bruggen, Kuan-Hsun Chen, and Jian-Jia Chen. “EDF-Like Scheduling for Self-Suspending Real-Time Tasks.” In <i>2022 IEEE Real-Time Systems Symposium (RTSS)</i>. IEEE, 2022. <a href=\"https://doi.org/10.1109/rtss55097.2022.00024\">https://doi.org/10.1109/rtss55097.2022.00024</a>.","short":"M. Gunzel, G. von der Bruggen, K.-H. Chen, J.-J. Chen, in: 2022 IEEE Real-Time Systems Symposium (RTSS), IEEE, 2022.","mla":"Gunzel, Mario, et al. “EDF-Like Scheduling for Self-Suspending Real-Time Tasks.” <i>2022 IEEE Real-Time Systems Symposium (RTSS)</i>, IEEE, 2022, doi:<a href=\"https://doi.org/10.1109/rtss55097.2022.00024\">10.1109/rtss55097.2022.00024</a>.","ama":"Gunzel M, von der Bruggen G, Chen K-H, Chen J-J. EDF-Like Scheduling for Self-Suspending Real-Time Tasks. In: <i>2022 IEEE Real-Time Systems Symposium (RTSS)</i>. IEEE; 2022. doi:<a href=\"https://doi.org/10.1109/rtss55097.2022.00024\">10.1109/rtss55097.2022.00024</a>","bibtex":"@inproceedings{Gunzel_von der Bruggen_Chen_Chen_2022, title={EDF-Like Scheduling for Self-Suspending Real-Time Tasks}, DOI={<a href=\"https://doi.org/10.1109/rtss55097.2022.00024\">10.1109/rtss55097.2022.00024</a>}, booktitle={2022 IEEE Real-Time Systems Symposium (RTSS)}, publisher={IEEE}, author={Gunzel, Mario and von der Bruggen, Georg and Chen, Kuan-Hsun and Chen, Jian-Jia}, year={2022} }"},"publication":"2022 IEEE Real-Time Systems Symposium (RTSS)","type":"conference","date_created":"2026-07-03T21:18:53Z","date_updated":"2026-07-05T14:46:00Z","publication_status":"published","author":[{"last_name":"Gunzel","first_name":"Mario","full_name":"Gunzel, Mario"},{"full_name":"von der Bruggen, Georg","last_name":"von der Bruggen","first_name":"Georg"},{"first_name":"Kuan-Hsun","last_name":"Chen","full_name":"Chen, Kuan-Hsun"},{"full_name":"Chen, Jian-Jia","last_name":"Chen","first_name":"Jian-Jia"}],"status":"public","year":"2022","title":"EDF-Like Scheduling for Self-Suspending Real-Time Tasks","doi":"10.1109/rtss55097.2022.00024","user_id":"128464","publisher":"IEEE","_id":"66211"},{"date_created":"2026-07-03T21:13:39Z","type":"journal_article","publication":"IEEE Transactions on Computers","issue":"5","citation":{"short":"C. Hakert, A.A. Khan, K.-H. Chen, F. Hameed, J. Castrillon, J.-J. Chen, IEEE Transactions on Computers 72 (2022) 1488–1502.","chicago":"Hakert, Christian, Asif Ali Khan, Kuan-Hsun Chen, Fazal Hameed, Jeronimo Castrillon, and Jian-Jia Chen. “ROLLED: &#60;u&#62;R&#60;/U&#62;acetrack Memory &#60;u&#62;O&#60;/U&#62;ptimized &#60;u&#62;L&#60;/U&#62;inear &#60;u&#62;L&#60;/U&#62;ayout and &#60;u&#62;E&#60;/U&#62;fficient &#60;u&#62;D&#60;/U&#62;ecomposition of Decision Trees.” <i>IEEE Transactions on Computers</i> 72, no. 5 (2022): 1488–1502. <a href=\"https://doi.org/10.1109/tc.2022.3197094\">https://doi.org/10.1109/tc.2022.3197094</a>.","ieee":"C. Hakert, A. A. Khan, K.-H. Chen, F. Hameed, J. Castrillon, and J.-J. Chen, “ROLLED: &#60;u&#62;R&#60;/u&#62;acetrack Memory &#60;u&#62;O&#60;/u&#62;ptimized &#60;u&#62;L&#60;/u&#62;inear &#60;u&#62;L&#60;/u&#62;ayout and &#60;u&#62;E&#60;/u&#62;fficient &#60;u&#62;D&#60;/u&#62;ecomposition of Decision Trees,” <i>IEEE Transactions on Computers</i>, vol. 72, no. 5, pp. 1488–1502, 2022, doi: <a href=\"https://doi.org/10.1109/tc.2022.3197094\">10.1109/tc.2022.3197094</a>.","apa":"Hakert, C., Khan, A. A., Chen, K.-H., Hameed, F., Castrillon, J., &#38; Chen, J.-J. (2022). ROLLED: &#60;u&#62;R&#60;/u&#62;acetrack Memory &#60;u&#62;O&#60;/u&#62;ptimized &#60;u&#62;L&#60;/u&#62;inear &#60;u&#62;L&#60;/u&#62;ayout and &#60;u&#62;E&#60;/u&#62;fficient &#60;u&#62;D&#60;/u&#62;ecomposition of Decision Trees. <i>IEEE Transactions on Computers</i>, <i>72</i>(5), 1488–1502. <a href=\"https://doi.org/10.1109/tc.2022.3197094\">https://doi.org/10.1109/tc.2022.3197094</a>","bibtex":"@article{Hakert_Khan_Chen_Hameed_Castrillon_Chen_2022, title={ROLLED: &#60;u&#62;R&#60;/u&#62;acetrack Memory &#60;u&#62;O&#60;/u&#62;ptimized &#60;u&#62;L&#60;/u&#62;inear &#60;u&#62;L&#60;/u&#62;ayout and &#60;u&#62;E&#60;/u&#62;fficient &#60;u&#62;D&#60;/u&#62;ecomposition of Decision Trees}, volume={72}, DOI={<a href=\"https://doi.org/10.1109/tc.2022.3197094\">10.1109/tc.2022.3197094</a>}, number={5}, journal={IEEE Transactions on Computers}, publisher={Institute of Electrical and Electronics Engineers (IEEE)}, author={Hakert, Christian and Khan, Asif Ali and Chen, Kuan-Hsun and Hameed, Fazal and Castrillon, Jeronimo and Chen, Jian-Jia}, year={2022}, pages={1488–1502} }","ama":"Hakert C, Khan AA, Chen K-H, Hameed F, Castrillon J, Chen J-J. ROLLED: &#60;u&#62;R&#60;/u&#62;acetrack Memory &#60;u&#62;O&#60;/u&#62;ptimized &#60;u&#62;L&#60;/u&#62;inear &#60;u&#62;L&#60;/u&#62;ayout and &#60;u&#62;E&#60;/u&#62;fficient &#60;u&#62;D&#60;/u&#62;ecomposition of Decision Trees. <i>IEEE Transactions on Computers</i>. 2022;72(5):1488-1502. doi:<a href=\"https://doi.org/10.1109/tc.2022.3197094\">10.1109/tc.2022.3197094</a>","mla":"Hakert, Christian, et al. “ROLLED: &#60;u&#62;R&#60;/U&#62;acetrack Memory &#60;u&#62;O&#60;/U&#62;ptimized &#60;u&#62;L&#60;/U&#62;inear &#60;u&#62;L&#60;/U&#62;ayout and &#60;u&#62;E&#60;/U&#62;fficient &#60;u&#62;D&#60;/U&#62;ecomposition of Decision Trees.” <i>IEEE Transactions on Computers</i>, vol. 72, no. 5, Institute of Electrical and Electronics Engineers (IEEE), 2022, pp. 1488–502, doi:<a href=\"https://doi.org/10.1109/tc.2022.3197094\">10.1109/tc.2022.3197094</a>."},"page":"1488-1502","publisher":"Institute of Electrical and Electronics Engineers (IEEE)","_id":"66180","user_id":"128464","doi":"10.1109/tc.2022.3197094","volume":72,"year":"2022","title":"ROLLED: <u>R</u>acetrack Memory <u>O</u>ptimized <u>L</u>inear <u>L</u>ayout and <u>E</u>fficient <u>D</u>ecomposition of Decision Trees","status":"public","author":[{"full_name":"Hakert, Christian","last_name":"Hakert","first_name":"Christian"},{"full_name":"Khan, Asif Ali","last_name":"Khan","first_name":"Asif Ali"},{"last_name":"Chen","first_name":"Kuan-Hsun","full_name":"Chen, Kuan-Hsun"},{"full_name":"Hameed, Fazal","last_name":"Hameed","first_name":"Fazal"},{"full_name":"Castrillon, Jeronimo","first_name":"Jeronimo","last_name":"Castrillon"},{"full_name":"Chen, Jian-Jia","first_name":"Jian-Jia","last_name":"Chen"}],"publication_identifier":{"issn":["0018-9340","1557-9956","2326-3814"]},"publication_status":"published","date_updated":"2026-07-05T14:46:40Z","intvolume":"        72"},{"volume":42,"user_id":"128464","doi":"10.1109/tcad.2022.3228897","publisher":"Institute of Electrical and Electronics Engineers (IEEE)","_id":"66181","page":"2527-2539","intvolume":"        42","publication_status":"published","date_updated":"2026-07-05T14:46:44Z","publication_identifier":{"issn":["0278-0070","1937-4151"]},"author":[{"full_name":"Hölscher, Nils","last_name":"Hölscher","first_name":"Nils"},{"full_name":"Hakert, Christian","first_name":"Christian","last_name":"Hakert"},{"full_name":"Nassar, Hassan","last_name":"Nassar","first_name":"Hassan"},{"first_name":"Kuan-Hsun","last_name":"Chen","full_name":"Chen, Kuan-Hsun"},{"last_name":"Bauer","first_name":"Lars","full_name":"Bauer, Lars"},{"full_name":"Chen, Jian-Jia","last_name":"Chen","first_name":"Jian-Jia"},{"full_name":"Henkel, Jörg","first_name":"Jörg","last_name":"Henkel"}],"title":"Memory Carousel: LLVM-Based Bitwise Wear Leveling for Nonvolatile Main Memory","status":"public","year":"2022","type":"journal_article","date_created":"2026-07-03T21:13:49Z","citation":{"mla":"Hölscher, Nils, et al. “Memory Carousel: LLVM-Based Bitwise Wear Leveling for Nonvolatile Main Memory.” <i>IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems</i>, vol. 42, no. 8, Institute of Electrical and Electronics Engineers (IEEE), 2022, pp. 2527–39, doi:<a href=\"https://doi.org/10.1109/tcad.2022.3228897\">10.1109/tcad.2022.3228897</a>.","ama":"Hölscher N, Hakert C, Nassar H, et al. Memory Carousel: LLVM-Based Bitwise Wear Leveling for Nonvolatile Main Memory. <i>IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems</i>. 2022;42(8):2527-2539. doi:<a href=\"https://doi.org/10.1109/tcad.2022.3228897\">10.1109/tcad.2022.3228897</a>","bibtex":"@article{Hölscher_Hakert_Nassar_Chen_Bauer_Chen_Henkel_2022, title={Memory Carousel: LLVM-Based Bitwise Wear Leveling for Nonvolatile Main Memory}, volume={42}, DOI={<a href=\"https://doi.org/10.1109/tcad.2022.3228897\">10.1109/tcad.2022.3228897</a>}, number={8}, journal={IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems}, publisher={Institute of Electrical and Electronics Engineers (IEEE)}, author={Hölscher, Nils and Hakert, Christian and Nassar, Hassan and Chen, Kuan-Hsun and Bauer, Lars and Chen, Jian-Jia and Henkel, Jörg}, year={2022}, pages={2527–2539} }","apa":"Hölscher, N., Hakert, C., Nassar, H., Chen, K.-H., Bauer, L., Chen, J.-J., &#38; Henkel, J. (2022). Memory Carousel: LLVM-Based Bitwise Wear Leveling for Nonvolatile Main Memory. <i>IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems</i>, <i>42</i>(8), 2527–2539. <a href=\"https://doi.org/10.1109/tcad.2022.3228897\">https://doi.org/10.1109/tcad.2022.3228897</a>","ieee":"N. Hölscher <i>et al.</i>, “Memory Carousel: LLVM-Based Bitwise Wear Leveling for Nonvolatile Main Memory,” <i>IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems</i>, vol. 42, no. 8, pp. 2527–2539, 2022, doi: <a href=\"https://doi.org/10.1109/tcad.2022.3228897\">10.1109/tcad.2022.3228897</a>.","chicago":"Hölscher, Nils, Christian Hakert, Hassan Nassar, Kuan-Hsun Chen, Lars Bauer, Jian-Jia Chen, and Jörg Henkel. “Memory Carousel: LLVM-Based Bitwise Wear Leveling for Nonvolatile Main Memory.” <i>IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems</i> 42, no. 8 (2022): 2527–39. <a href=\"https://doi.org/10.1109/tcad.2022.3228897\">https://doi.org/10.1109/tcad.2022.3228897</a>.","short":"N. Hölscher, C. Hakert, H. Nassar, K.-H. Chen, L. Bauer, J.-J. Chen, J. Henkel, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 42 (2022) 2527–2539."},"issue":"8","publication":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"date_updated":"2026-07-06T11:49:41Z","intvolume":"         3","year":"2022","status":"public","title":"Care und Care-Arbeit: Themen und Policies im Spiegel alter und neuer Entwicklungen.","author":[{"id":"22563","full_name":"Riegraf, Birgitt","first_name":"Birgitt","last_name":"Riegraf"},{"orcid":"https://orcid.org/0000-0002-0915-7544","last_name":"Weber","first_name":"Lena","full_name":"Weber, Lena","id":"26084"}],"user_id":"22563","volume":3,"page":"86-91","main_file_link":[{"url":"https://www.lpb-bw.de/publikation-anzeige/bs-2022-3-care-arbeit-3628"}],"_id":"66283","publisher":"Landeszentrale für Politische Bildung Baden-Württemberg","language":[{"iso":"ger"}],"publication":"Bürger & Staat - Care-Arbeit. Pflege auf dem Prüfstand","citation":{"mla":"Riegraf, Birgitt, and Lena Weber. “Care und Care-Arbeit: Themen und Policies im Spiegel alter und neuer Entwicklungen.” <i>Bürger &#38; Staat - Care-Arbeit. Pflege auf dem Prüfstand</i>, vol. 3, Landeszentrale für Politische Bildung Baden-Württemberg, 2022, pp. 86–91.","bibtex":"@article{Riegraf_Weber_2022, title={Care und Care-Arbeit: Themen und Policies im Spiegel alter und neuer Entwicklungen.}, volume={3}, journal={Bürger &#38; Staat - Care-Arbeit. Pflege auf dem Prüfstand}, publisher={Landeszentrale für Politische Bildung Baden-Württemberg}, author={Riegraf, Birgitt and Weber, Lena}, year={2022}, pages={86–91} }","ama":"Riegraf B, Weber L. Care und Care-Arbeit: Themen und Policies im Spiegel alter und neuer Entwicklungen. <i>Bürger &#38; Staat - Care-Arbeit Pflege auf dem Prüfstand</i>. 2022;3:86-91.","ieee":"B. Riegraf and L. Weber, “Care und Care-Arbeit: Themen und Policies im Spiegel alter und neuer Entwicklungen.,” <i>Bürger &#38; Staat - Care-Arbeit. Pflege auf dem Prüfstand</i>, vol. 3, pp. 86–91, 2022.","apa":"Riegraf, B., &#38; Weber, L. (2022). Care und Care-Arbeit: Themen und Policies im Spiegel alter und neuer Entwicklungen. <i>Bürger &#38; Staat - Care-Arbeit. Pflege auf dem Prüfstand</i>, <i>3</i>, 86–91.","short":"B. Riegraf, L. Weber, Bürger &#38; Staat - Care-Arbeit. Pflege auf dem Prüfstand 3 (2022) 86–91.","chicago":"Riegraf, Birgitt, and Lena Weber. “Care und Care-Arbeit: Themen und Policies im Spiegel alter und neuer Entwicklungen.” <i>Bürger &#38; Staat - Care-Arbeit. Pflege auf dem Prüfstand</i> 3 (2022): 86–91."},"type":"journal_article","date_created":"2026-07-06T11:49:28Z"},{"status":"public","_id":"48429","page":"483-499","volume":9,"user_id":"95414","citation":{"short":"C. Brachtendorf, Fashion, Style &#38; Popular Culture 9 (2022) 483–499.","chicago":"Brachtendorf, Charlotte. “Lil Miquela in the Folds of Fashion: (Ad-)Dressing Virtual Influencers.” <i>Fashion, Style &#38; Popular Culture</i> 9, no. 4 (2022): 483–99. <a href=\"https://doi.org/10.1386/fspc_00157_1\">https://doi.org/10.1386/fspc_00157_1</a>.","apa":"Brachtendorf, C. (2022). Lil Miquela in the Folds of Fashion: (Ad-)Dressing Virtual Influencers. <i>Fashion, Style &#38; Popular Culture</i>, <i>9</i>(4), 483–499. <a href=\"https://doi.org/10.1386/fspc_00157_1\">https://doi.org/10.1386/fspc_00157_1</a>","ieee":"C. Brachtendorf, “Lil Miquela in the Folds of Fashion: (Ad-)Dressing Virtual Influencers,” <i>Fashion, Style &#38; Popular Culture</i>, vol. 9, no. 4, pp. 483–499, 2022, doi: <a href=\"https://doi.org/10.1386/fspc_00157_1\">10.1386/fspc_00157_1</a>.","ama":"Brachtendorf C. Lil Miquela in the Folds of Fashion: (Ad-)Dressing Virtual Influencers. <i>Fashion, Style &#38; Popular Culture</i>. 2022;9(4):483-499. doi:<a href=\"https://doi.org/10.1386/fspc_00157_1\">10.1386/fspc_00157_1</a>","bibtex":"@article{Brachtendorf_2022, title={Lil Miquela in the Folds of Fashion: (Ad-)Dressing Virtual Influencers}, volume={9}, DOI={<a href=\"https://doi.org/10.1386/fspc_00157_1\">10.1386/fspc_00157_1</a>}, number={4}, journal={Fashion, Style &#38; Popular Culture}, author={Brachtendorf, Charlotte}, year={2022}, pages={483–499} }","mla":"Brachtendorf, Charlotte. “Lil Miquela in the Folds of Fashion: (Ad-)Dressing Virtual Influencers.” <i>Fashion, Style &#38; Popular Culture</i>, vol. 9, no. 4, 2022, pp. 483–99, doi:<a href=\"https://doi.org/10.1386/fspc_00157_1\">10.1386/fspc_00157_1</a>."},"quality_controlled":"1","author":[{"full_name":"Brachtendorf, Charlotte","first_name":"Charlotte","last_name":"Brachtendorf","orcid":"0000-0001-5739-933X","id":"95414"}],"publication_identifier":{"eissn":["2050-0734"]},"year":"2022","title":"Lil Miquela in the Folds of Fashion: (Ad-)Dressing Virtual Influencers","article_type":"original","intvolume":"         9","publication_status":"published","date_updated":"2026-07-07T19:48:31Z","language":[{"iso":"eng"}],"doi":"10.1386/fspc_00157_1","issue":"4","publication":"Fashion, Style & Popular Culture","extern":"1","abstract":[{"text":"Since her debut on Instagram in 2016, Lil Miquela has amassed over 3 million followers. She was the first of many virtual influencers; avatars with a hyper-realistic humanoid appearance who operate on social media. This article investigates how the fashioning of virtual influencers informs the relationship between virtual and human bodies. A visual and textual analysis of virtual influencers on Instagram has revealed that they are emblematic of a coalescence between the virtual and the actual. Virtual influencers often evoke discussions about human nature because their cyberpunk narratives and uncanny appearance position them as autonomous posthuman subjects. Virtual influencers are positioned as Bodies without Organs, as their bodies can be manipulated into any form. Yet, they adhere to normative ideals of youth, slimness and beauty, encouraging their audiences to follow suit. Their fashion reflects the streetwear aesthetic but is often designed by luxury brands. This strategy positions virtual influencers as authentic, while generating visibility within the attention economy. Further, the Deleuzian concept of the fold serves as a metaphor to understand fashion as an interface between surface and depth. It is fashion in its folded form that hominizes virtual influencers, although they are merely a fashionable surface.","lang":"eng"}],"date_created":"2023-10-24T13:15:19Z","department":[{"_id":"434"}],"keyword":["authenticity","body-without-organs","Deleuze","digital avatars","fashionable ideal","hominization","Instagram"],"type":"journal_article"},{"status":"public","year":"2022","title":"Principal bundles on metric graphs: the $\\mathrm{GL}_n$ case","author":[{"last_name":"Gross","first_name":"Andreas","full_name":"Gross, Andreas"},{"first_name":"Martin","last_name":"Ulirsch","full_name":"Ulirsch, Martin"},{"full_name":"Zakharov, Dmitry","last_name":"Zakharov","first_name":"Dmitry"}],"date_updated":"2026-07-08T06:37:46Z","_id":"66313","language":[{"iso":"eng"}],"user_id":"82981","publication":"arXiv:2206.10219","citation":{"apa":"Gross, A., Ulirsch, M., &#38; Zakharov, D. (2022). Principal bundles on metric graphs: the $\\mathrm{GL}_n$ case. In <i>arXiv:2206.10219</i>.","ieee":"A. Gross, M. Ulirsch, and D. Zakharov, “Principal bundles on metric graphs: the $\\mathrm{GL}_n$ case,” <i>arXiv:2206.10219</i>. 2022.","short":"A. Gross, M. Ulirsch, D. Zakharov, ArXiv:2206.10219 (2022).","chicago":"Gross, Andreas, Martin Ulirsch, and Dmitry Zakharov. “Principal Bundles on Metric Graphs: The $\\mathrm{GL}_n$ Case.” <i>ArXiv:2206.10219</i>, 2022.","mla":"Gross, Andreas, et al. “Principal Bundles on Metric Graphs: The $\\mathrm{GL}_n$ Case.” <i>ArXiv:2206.10219</i>, 2022.","ama":"Gross A, Ulirsch M, Zakharov D. Principal bundles on metric graphs: the $\\mathrm{GL}_n$ case. <i>arXiv:220610219</i>. Published online 2022.","bibtex":"@article{Gross_Ulirsch_Zakharov_2022, title={Principal bundles on metric graphs: the $\\mathrm{GL}_n$ case}, journal={arXiv:2206.10219}, author={Gross, Andreas and Ulirsch, Martin and Zakharov, Dmitry}, year={2022} }"},"abstract":[{"lang":"eng","text":"Using the notion of a root datum of a reductive group $G$ we propose a tropical analogue of a principal $G$-bundle on a metric graph. We focus on the case $G=\\mathrm{GL}_n$, i.e. the case of vector bundles. Here we give a characterization of vector bundles in terms of multidivisors and use this description to prove analogues of the Weil--Riemann--Roch theorem and the Narasimhan--Seshadri correspondence. We proceed by studying the process of tropicalization. In particular, we show that the non-Archimedean skeleton of the moduli space of semistable vector bundles on a Tate curve is isomorphic to a certain component of the moduli space of semistable tropical vector bundles on its dual metric graph."}],"external_id":{"arxiv":["2206.10219"]},"date_created":"2026-07-08T06:33:08Z","type":"preprint"},{"date_created":"2026-07-08T06:42:43Z","type":"journal_article","publication":"Advances in Mathematics","citation":{"chicago":"Gross, Andreas, Martin Ulirsch, and Dmitry Zakharov. “Principal Bundles on Metric Graphs: The $\\mathrm{GL}_n$ Case.” <i>Advances in Mathematics</i> 411 (2022). <a href=\"https://doi.org/10.1016/j.aim.2022.108775\">https://doi.org/10.1016/j.aim.2022.108775</a>.","short":"A. Gross, M. Ulirsch, D. Zakharov, Advances in Mathematics 411 (2022).","ieee":"A. Gross, M. Ulirsch, and D. Zakharov, “Principal bundles on metric graphs: the $\\mathrm{GL}_n$ case,” <i>Advances in Mathematics</i>, vol. 411, Art. no. 108775, 2022, doi: <a href=\"https://doi.org/10.1016/j.aim.2022.108775\">10.1016/j.aim.2022.108775</a>.","apa":"Gross, A., Ulirsch, M., &#38; Zakharov, D. (2022). Principal bundles on metric graphs: the $\\mathrm{GL}_n$ case. <i>Advances in Mathematics</i>, <i>411</i>, Article 108775. <a href=\"https://doi.org/10.1016/j.aim.2022.108775\">https://doi.org/10.1016/j.aim.2022.108775</a>","bibtex":"@article{Gross_Ulirsch_Zakharov_2022, title={Principal bundles on metric graphs: the $\\mathrm{GL}_n$ case}, volume={411}, DOI={<a href=\"https://doi.org/10.1016/j.aim.2022.108775\">10.1016/j.aim.2022.108775</a>}, number={108775}, journal={Advances in Mathematics}, publisher={Elsevier BV}, author={Gross, Andreas and Ulirsch, Martin and Zakharov, Dmitry}, year={2022} }","ama":"Gross A, Ulirsch M, Zakharov D. Principal bundles on metric graphs: the $\\mathrm{GL}_n$ case. <i>Advances in Mathematics</i>. 2022;411. doi:<a href=\"https://doi.org/10.1016/j.aim.2022.108775\">10.1016/j.aim.2022.108775</a>","mla":"Gross, Andreas, et al. “Principal Bundles on Metric Graphs: The $\\mathrm{GL}_n$ Case.” <i>Advances in Mathematics</i>, vol. 411, 108775, Elsevier BV, 2022, doi:<a href=\"https://doi.org/10.1016/j.aim.2022.108775\">10.1016/j.aim.2022.108775</a>."},"article_number":"108775","language":[{"iso":"eng"}],"_id":"66316","publisher":"Elsevier BV","doi":"10.1016/j.aim.2022.108775","user_id":"82981","volume":411,"year":"2022","title":"Principal bundles on metric graphs: the $\\mathrm{GL}_n$ case","status":"public","author":[{"last_name":"Gross","first_name":"Andreas","full_name":"Gross, Andreas"},{"first_name":"Martin","last_name":"Ulirsch","full_name":"Ulirsch, Martin","id":"114697"},{"first_name":"Dmitry","last_name":"Zakharov","full_name":"Zakharov, Dmitry"}],"publication_identifier":{"issn":["0001-8708"]},"date_updated":"2026-07-09T06:57:16Z","publication_status":"published","intvolume":"       411"},{"volume":1,"editor":[{"full_name":"Harmening, Anda-Lisa","first_name":"Anda-Lisa","last_name":"Harmening","id":"48437"},{"id":"15313","first_name":"Stefanie","last_name":"Leinfellner","full_name":"Leinfellner, Stefanie"},{"id":"38887","last_name":"Meier","first_name":"Rebecca","full_name":"Meier, Rebecca"}],"user_id":"15313","_id":"58740","publisher":"Herder","page":"352","status":"public","oa":"1","place":"Darmstadt","citation":{"ama":"Harmening A-L, Leinfellner S, Meier R, eds. <i>Wissenstransfer. Aufgabe, Herausforderung und Chance kulturwissenschaftlicher Forschung</i>. Vol 1. Herder; 2022.","bibtex":"@book{Harmening_Leinfellner_Meier_2022, place={Darmstadt}, series={Interdisziplinäre Studien des Paderborner Graduiertenzentrums für Kulturwissenschaften}, title={Wissenstransfer. Aufgabe, Herausforderung und Chance kulturwissenschaftlicher Forschung}, volume={1}, publisher={Herder}, year={2022}, collection={Interdisziplinäre Studien des Paderborner Graduiertenzentrums für Kulturwissenschaften} }","mla":"Harmening, Anda-Lisa, et al., editors. <i>Wissenstransfer. Aufgabe, Herausforderung und Chance kulturwissenschaftlicher Forschung</i>. Herder, 2022.","short":"A.-L. Harmening, S. Leinfellner, R. Meier, eds., Wissenstransfer. Aufgabe, Herausforderung und Chance kulturwissenschaftlicher Forschung, Herder, Darmstadt, 2022.","chicago":"Harmening, Anda-Lisa, Stefanie Leinfellner, and Rebecca Meier, eds. <i>Wissenstransfer. Aufgabe, Herausforderung und Chance kulturwissenschaftlicher Forschung</i>. Vol. 1. Interdisziplinäre Studien des Paderborner Graduiertenzentrums für Kulturwissenschaften. Darmstadt: Herder, 2022.","apa":"Harmening, A.-L., Leinfellner, S., &#38; Meier, R. (Eds.). (2022). <i>Wissenstransfer. Aufgabe, Herausforderung und Chance kulturwissenschaftlicher Forschung</i> (Vol. 1). Herder.","ieee":"A.-L. Harmening, S. Leinfellner, and R. Meier, Eds., <i>Wissenstransfer. Aufgabe, Herausforderung und Chance kulturwissenschaftlicher Forschung</i>, vol. 1. Darmstadt: Herder, 2022."},"language":[{"iso":"ger"}],"series_title":"Interdisziplinäre Studien des Paderborner Graduiertenzentrums für Kulturwissenschaften","main_file_link":[{"url":"https://ris.uni-paderborn.de/download/36253/36254/ARTK_ZOA_1029465_0001.pdf","open_access":"1"}],"intvolume":"         1","publication_status":"published","date_updated":"2026-08-06T12:20:30Z","publication_identifier":{"isbn":["978-3-534-27585-4"]},"year":"2022","title":"Wissenstransfer. Aufgabe, Herausforderung und Chance kulturwissenschaftlicher Forschung","type":"book_editor","date_created":"2025-02-20T14:55:47Z","abstract":[{"text":"Der Terminus Wissenstransfer hat in den letzten Jahren verstärkt an Bedeutung gewonnen. Er bezieht sich auf die Zirkulation von Wissen zwischen Systemen, Organisationen oder Parteien, etwa zwischen Hochschulen und Gesellschaft. Damit ist nicht ‚nur‘ der Transfer wissenschaftlicher Erkenntnisse in gesellschaftliche Kontexte gemeint, sondern vielmehr - über den Erwerb und die Weitergabe von Wissen hinaus - der Dialog und die Diskursbildung zwischen Wissenschaft und Gesellschaft. Der vorliegende Band nimmt dabei entstehende Aufgaben, Herausforderungen und Chancen kulturwissenschaftlicher Forschung in den Blick. Entgegen der Annahme, Projekte aus dem Feld der Kulturwissenschaften würden im Bereich des Abstrakten verbleiben, präsentiert er Beispiele kulturwissenschaftlicher Forschung, die Theorie und Praxis berücksichtigen sowie die Verzahnung von theoretischen Erkenntnissen und ihr Mitwirken an gesellschaftlichen Diskursen verdeutlichen.","lang":"ger"}]},{"user_id":"105186","editor":[{"full_name":"Serke, Björn","last_name":"Serke","first_name":"Björn"},{"full_name":"Streese, Bettina","last_name":"Streese","first_name":"Bettina"}],"page":"130 - 146","_id":"39614","publisher":"Julius Klinkhardt","status":"public","jel":["I24"],"oa":"1","place":"Bad Heilbrunn","citation":{"apa":"Kullmann, H., Globisch, E.-L., &#38; Heister, N. (2022). Hier wie dort? Ein Vergleich der Tätigkeits- und Kooperationsprofile von Schulbegleitungen an inklusiven Gesamtschulen und Förderschulen in Nordrhein-Westfalen. In B. Serke &#38; B. Streese (Eds.), <i>Wege der Kooperation im Kontext inklusiver Bildung</i> (pp. 130–146). Julius Klinkhardt. <a href=\"https://doi.org/doi.org/10.35468/5958\">https://doi.org/doi.org/10.35468/5958</a>","ieee":"H. Kullmann, E.-L. Globisch, and N. Heister, “Hier wie dort? Ein Vergleich der Tätigkeits- und Kooperationsprofile von Schulbegleitungen an inklusiven Gesamtschulen und Förderschulen in Nordrhein-Westfalen,” in <i>Wege der Kooperation im Kontext inklusiver Bildung</i>, B. Serke and B. Streese, Eds. Bad Heilbrunn: Julius Klinkhardt, 2022, pp. 130–146.","chicago":"Kullmann, Harry, Eva-Luisa Globisch, and Nicolas Heister. “Hier wie dort? Ein Vergleich der Tätigkeits- und Kooperationsprofile von Schulbegleitungen an inklusiven Gesamtschulen und Förderschulen in Nordrhein-Westfalen.” In <i>Wege der Kooperation im Kontext inklusiver Bildung</i>, edited by Björn Serke and Bettina Streese, 130–46. Bad Heilbrunn: Julius Klinkhardt, 2022. <a href=\"https://doi.org/doi.org/10.35468/5958\">https://doi.org/doi.org/10.35468/5958</a>.","short":"H. Kullmann, E.-L. Globisch, N. Heister, in: B. Serke, B. Streese (Eds.), Wege der Kooperation im Kontext inklusiver Bildung, Julius Klinkhardt, Bad Heilbrunn, 2022, pp. 130–146.","mla":"Kullmann, Harry, et al. “Hier wie dort? Ein Vergleich der Tätigkeits- und Kooperationsprofile von Schulbegleitungen an inklusiven Gesamtschulen und Förderschulen in Nordrhein-Westfalen.” <i>Wege der Kooperation im Kontext inklusiver Bildung</i>, edited by Björn Serke and Bettina Streese, Julius Klinkhardt, 2022, pp. 130–46, doi:<a href=\"https://doi.org/doi.org/10.35468/5958\">doi.org/10.35468/5958</a>.","ama":"Kullmann H, Globisch E-L, Heister N. Hier wie dort? Ein Vergleich der Tätigkeits- und Kooperationsprofile von Schulbegleitungen an inklusiven Gesamtschulen und Förderschulen in Nordrhein-Westfalen. In: Serke B, Streese B, eds. <i>Wege der Kooperation im Kontext inklusiver Bildung</i>. Julius Klinkhardt; 2022:130-146. doi:<a href=\"https://doi.org/doi.org/10.35468/5958\">doi.org/10.35468/5958</a>","bibtex":"@inbook{Kullmann_Globisch_Heister_2022, place={Bad Heilbrunn}, title={Hier wie dort? Ein Vergleich der Tätigkeits- und Kooperationsprofile von Schulbegleitungen an inklusiven Gesamtschulen und Förderschulen in Nordrhein-Westfalen}, DOI={<a href=\"https://doi.org/doi.org/10.35468/5958\">doi.org/10.35468/5958</a>}, booktitle={Wege der Kooperation im Kontext inklusiver Bildung}, publisher={Julius Klinkhardt}, author={Kullmann, Harry and Globisch, Eva-Luisa and Heister, Nicolas}, editor={Serke, Björn and Streese, Bettina}, year={2022}, pages={130–146} }"},"doi":"doi.org/10.35468/5958","main_file_link":[{"url":"https://www.pedocs.de/volltexte/2022/24881/pdf/Serke_Streese_2022_Wege_der_Kooperation.pdf","open_access":"1"}],"language":[{"iso":"ger"}],"date_updated":"2026-08-16T13:48:00Z","publication_status":"published","year":"2022","title":"Hier wie dort? Ein Vergleich der Tätigkeits- und Kooperationsprofile von Schulbegleitungen an inklusiven Gesamtschulen und Förderschulen in Nordrhein-Westfalen","author":[{"full_name":"Kullmann, Harry","orcid":"0000-0001-5488-5105","first_name":"Harry","last_name":"Kullmann","id":"77972"},{"full_name":"Globisch, Eva-Luisa","last_name":"Globisch","first_name":"Eva-Luisa"},{"full_name":"Heister, Nicolas","first_name":"Nicolas","last_name":"Heister"}],"publication_identifier":{"eisbn":["978-3-7815-5958-5"]},"type":"book_chapter","department":[{"_id":"556"}],"date_created":"2023-01-24T14:18:15Z","publication":"Wege der Kooperation im Kontext inklusiver Bildung"},{"citation":{"mla":"Bauer, A., et al. “Kernkompetenzen Für Das Studium Der Pädagogik Im Sonderpädagogischen Förderschwerpunkt Sprache Und Kommunikation.” <i>Praxis Sprache</i>, 2022.","ama":"Bauer A, Glück CW, Jonas K, Mayer A, Sallat S, Stitzinger U. Kernkompetenzen für das Studium der Pädagogik im sonderpädagogischen Förderschwerpunkt Sprache und Kommunikation. <i>Praxis Sprache</i>. Published online 2022.","bibtex":"@article{Bauer_Glück_Jonas_Mayer_Sallat_Stitzinger_2022, title={Kernkompetenzen für das Studium der Pädagogik im sonderpädagogischen Förderschwerpunkt Sprache und Kommunikation}, journal={Praxis Sprache}, author={Bauer, A. and Glück, C. W. and Jonas, K. and Mayer, A. and Sallat, S. and Stitzinger, U.}, year={2022} }","apa":"Bauer, A., Glück, C. W., Jonas, K., Mayer, A., Sallat, S., &#38; Stitzinger, U. (2022). Kernkompetenzen für das Studium der Pädagogik im sonderpädagogischen Förderschwerpunkt Sprache und Kommunikation. <i>Praxis Sprache</i>.","ieee":"A. Bauer, C. W. Glück, K. Jonas, A. Mayer, S. Sallat, and U. Stitzinger, “Kernkompetenzen für das Studium der Pädagogik im sonderpädagogischen Förderschwerpunkt Sprache und Kommunikation,” <i>Praxis Sprache</i>, 2022.","chicago":"Bauer, A., C. W. Glück, K. Jonas, A. Mayer, S. Sallat, and U. Stitzinger. “Kernkompetenzen Für Das Studium Der Pädagogik Im Sonderpädagogischen Förderschwerpunkt Sprache Und Kommunikation.” <i>Praxis Sprache</i>, 2022.","short":"A. Bauer, C.W. Glück, K. Jonas, A. Mayer, S. Sallat, U. Stitzinger, Praxis Sprache (2022)."},"publication":"Praxis Sprache","type":"journal_article","date_created":"2025-01-06T12:11:51Z","date_updated":"2026-08-19T11:05:16Z","author":[{"full_name":"Bauer, A.","first_name":"A.","last_name":"Bauer"},{"full_name":"Glück, C. W.","last_name":"Glück","first_name":"C. W."},{"full_name":"Jonas, K.","last_name":"Jonas","first_name":"K."},{"full_name":"Mayer, A.","first_name":"A.","last_name":"Mayer"},{"full_name":"Sallat, S.","first_name":"S.","last_name":"Sallat"},{"first_name":"U.","last_name":"Stitzinger","full_name":"Stitzinger, U."}],"title":"Kernkompetenzen für das Studium der Pädagogik im sonderpädagogischen Förderschwerpunkt Sprache und Kommunikation","status":"public","year":"2022","user_id":"61071","_id":"58021","language":[{"iso":"eng"}]}]