[{"date_updated":"2026-07-05T14:48:17Z","citation":{"bibtex":"@article{TREE: Tree Regularization for Efficient Execution_2024, DOI={<a href=\"https://doi.org/10.48550/ARXIV.2406.12531\">10.48550/ARXIV.2406.12531</a>}, year={2024} }","ama":"TREE: Tree Regularization for Efficient Execution. Published online 2024. doi:<a href=\"https://doi.org/10.48550/ARXIV.2406.12531\">10.48550/ARXIV.2406.12531</a>","mla":"<i>TREE: Tree Regularization for Efficient Execution</i>. 2024, doi:<a href=\"https://doi.org/10.48550/ARXIV.2406.12531\">10.48550/ARXIV.2406.12531</a>.","chicago":"“TREE: Tree Regularization for Efficient Execution,” 2024. <a href=\"https://doi.org/10.48550/ARXIV.2406.12531\">https://doi.org/10.48550/ARXIV.2406.12531</a>.","short":"(2024).","ieee":"“TREE: Tree Regularization for Efficient Execution,” 2024, doi: <a href=\"https://doi.org/10.48550/ARXIV.2406.12531\">10.48550/ARXIV.2406.12531</a>.","apa":"<i>TREE: Tree Regularization for Efficient Execution</i>. (2024). <a href=\"https://doi.org/10.48550/ARXIV.2406.12531\">https://doi.org/10.48550/ARXIV.2406.12531</a>"},"status":"public","title":"TREE: Tree Regularization for Efficient Execution","year":"2024","user_id":"128464","type":"journal_article","doi":"10.48550/ARXIV.2406.12531","date_created":"2026-07-03T21:13:01Z","_id":"66175"},{"date_created":"2026-07-08T06:22:23Z","external_id":{"arxiv":["2407.05808"]},"type":"preprint","citation":{"ama":"Giansiracusa J, Rincón F, Schleis V, Ulirsch M. Log-concavity for independent sets of valuated matroids. <i>arXiv:240705808</i>. Published online 2024.","bibtex":"@article{Giansiracusa_Rincón_Schleis_Ulirsch_2024, title={Log-concavity for independent sets of valuated matroids}, journal={arXiv:2407.05808}, author={Giansiracusa, Jeffrey and Rincón, Felipe and Schleis, Victoria and Ulirsch, Martin}, year={2024} }","mla":"Giansiracusa, Jeffrey, et al. “Log-Concavity for Independent Sets of Valuated Matroids.” <i>ArXiv:2407.05808</i>, 2024.","short":"J. Giansiracusa, F. Rincón, V. Schleis, M. Ulirsch, ArXiv:2407.05808 (2024).","chicago":"Giansiracusa, Jeffrey, Felipe Rincón, Victoria Schleis, and Martin Ulirsch. “Log-Concavity for Independent Sets of Valuated Matroids.” <i>ArXiv:2407.05808</i>, 2024.","apa":"Giansiracusa, J., Rincón, F., Schleis, V., &#38; Ulirsch, M. (2024). Log-concavity for independent sets of valuated matroids. In <i>arXiv:2407.05808</i>.","ieee":"J. Giansiracusa, F. Rincón, V. Schleis, and M. Ulirsch, “Log-concavity for independent sets of valuated matroids,” <i>arXiv:2407.05808</i>. 2024."},"publication":"arXiv:2407.05808","abstract":[{"lang":"eng","text":"Recently, several proofs of the Mason--Welsh conjecture for matroids have been found, which asserts the log-concavity of the sequence that counts independent sets of a given size. In this article we use the theory of Lorentzian polynomials, developed by Brändén and Huh, to prove a generalization of the Mason-Welsh conjecture to the context of valuated matroids. In fact, we provide a log-concavity result in the more general setting of valuated discrete polymatroids, or equivalently, M-convex functions. Our approach is via the construction of a generic extension of a valuated matroid or M-convex function, so that the bases of the extension are related to the independent sets of the original matroid. We also provide a similar log-concavity result for valuated bimatroids, which, we believe, might be of independent interest."}],"language":[{"iso":"eng"}],"_id":"66306","user_id":"82981","author":[{"first_name":"Jeffrey","last_name":"Giansiracusa","full_name":"Giansiracusa, Jeffrey"},{"first_name":"Felipe","last_name":"Rincón","full_name":"Rincón, Felipe"},{"first_name":"Victoria","last_name":"Schleis","full_name":"Schleis, Victoria"},{"last_name":"Ulirsch","first_name":"Martin","full_name":"Ulirsch, Martin","id":"114697"}],"status":"public","year":"2024","title":"Log-concavity for independent sets of valuated matroids","date_updated":"2026-07-08T06:22:38Z"},{"abstract":[{"text":"Motivated by the recent surge of interest in the geometry of hybrid spaces, we prove an Abel-Jacobi theorem for a metrized complex of Riemann surfaces, generalizing both the classical Abel-Jacobi theorem and its tropical analogue.","lang":"eng"}],"publication":"arXiv:2408.03851","citation":{"apa":"Hofmann, M. C. E., &#38; Ulirsch, M. (2024). An Abel-Jacobi theorem for metrized complexes of Riemann surfaces. In <i>arXiv:2408.03851</i>.","ieee":"M. C. E. Hofmann and M. Ulirsch, “An Abel-Jacobi theorem for metrized complexes of Riemann surfaces,” <i>arXiv:2408.03851</i>. 2024.","chicago":"Hofmann, Maximilian C. E., and Martin Ulirsch. “An Abel-Jacobi Theorem for Metrized Complexes of Riemann Surfaces.” <i>ArXiv:2408.03851</i>, 2024.","short":"M.C.E. Hofmann, M. Ulirsch, ArXiv:2408.03851 (2024).","mla":"Hofmann, Maximilian C. E., and Martin Ulirsch. “An Abel-Jacobi Theorem for Metrized Complexes of Riemann Surfaces.” <i>ArXiv:2408.03851</i>, 2024.","ama":"Hofmann MCE, Ulirsch M. An Abel-Jacobi theorem for metrized complexes of Riemann surfaces. <i>arXiv:240803851</i>. Published online 2024.","bibtex":"@article{Hofmann_Ulirsch_2024, title={An Abel-Jacobi theorem for metrized complexes of Riemann surfaces}, journal={arXiv:2408.03851}, author={Hofmann, Maximilian C. E. and Ulirsch, Martin}, year={2024} }"},"type":"preprint","external_id":{"arxiv":["2408.03851"]},"date_created":"2026-07-08T06:21:39Z","date_updated":"2026-07-08T06:21:58Z","title":"An Abel-Jacobi theorem for metrized complexes of Riemann surfaces","year":"2024","status":"public","author":[{"full_name":"Hofmann, Maximilian C. E.","last_name":"Hofmann","first_name":"Maximilian C. E."},{"last_name":"Ulirsch","first_name":"Martin","full_name":"Ulirsch, Martin"}],"user_id":"82981","language":[{"iso":"eng"}],"_id":"66305"},{"date_created":"2026-07-02T09:39:07Z","type":"report","oa":"1","department":[{"_id":"19"}],"citation":{"mla":"Radermacher, Katharina, and M. Rösener. <i>Eine Analyse Der Arbeitsplatzkonzepte Preisgekrönter Unternehmen. Auf Dem Weg Zum Arbeitsplatz Der Zukunft.</i> 2024.","ama":"Radermacher K, Rösener M. <i>Eine Analyse Der Arbeitsplatzkonzepte Preisgekrönter Unternehmen. Auf Dem Weg Zum Arbeitsplatz Der Zukunft.</i>; 2024.","bibtex":"@book{Radermacher_Rösener_2024, title={Eine Analyse der Arbeitsplatzkonzepte preisgekrönter Unternehmen. Auf dem Weg zum Arbeitsplatz der Zukunft.}, author={Radermacher, Katharina and Rösener, M.}, year={2024} }","apa":"Radermacher, K., &#38; Rösener, M. (2024). <i>Eine Analyse der Arbeitsplatzkonzepte preisgekrönter Unternehmen. Auf dem Weg zum Arbeitsplatz der Zukunft.</i>","ieee":"K. Radermacher and M. Rösener, <i>Eine Analyse der Arbeitsplatzkonzepte preisgekrönter Unternehmen. Auf dem Weg zum Arbeitsplatz der Zukunft.</i> 2024.","chicago":"Radermacher, Katharina, and M. Rösener. <i>Eine Analyse Der Arbeitsplatzkonzepte Preisgekrönter Unternehmen. Auf Dem Weg Zum Arbeitsplatz Der Zukunft.</i>, 2024.","short":"K. Radermacher, M. Rösener, Eine Analyse Der Arbeitsplatzkonzepte Preisgekrönter Unternehmen. Auf Dem Weg Zum Arbeitsplatz Der Zukunft., 2024."},"main_file_link":[{"url":"https://iba.online/studynet/arbeitsplatzkonzepte-bwa/","open_access":"1"}],"language":[{"iso":"eng"}],"_id":"66110","user_id":"54657","title":"Eine Analyse der Arbeitsplatzkonzepte preisgekrönter Unternehmen. Auf dem Weg zum Arbeitsplatz der Zukunft.","status":"public","year":"2024","author":[{"id":"47691","first_name":"Katharina","last_name":"Radermacher","full_name":"Radermacher, Katharina"},{"last_name":"Rösener","first_name":"M.","full_name":"Rösener, M."}],"date_updated":"2026-07-02T09:40:47Z"},{"department":[{"_id":"555"}],"keyword":["Mathematics (miscellaneous)"],"type":"journal_article","date_created":"2024-04-17T13:18:30Z","abstract":[{"text":"<jats:title>Abstract</jats:title><jats:p>This work deals with the extension problem for the fractional Laplacian on Riemannian symmetric spaces <jats:italic>G</jats:italic>/<jats:italic>K</jats:italic> of noncompact type and of general rank, which gives rise to a family of convolution operators, including the Poisson operator. More precisely, motivated by Euclidean results for the Poisson semigroup, we study the long-time asymptotic behavior of solutions to the extension problem for <jats:inline-formula><jats:alternatives><jats:tex-math>$$L^1$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                  <mml:msup>\r\n                    <mml:mi>L</mml:mi>\r\n                    <mml:mn>1</mml:mn>\r\n                  </mml:msup>\r\n                </mml:math></jats:alternatives></jats:inline-formula> initial data. In the case of the Laplace–Beltrami operator, we show that if the initial data are bi-<jats:italic>K</jats:italic>-invariant, then the solution to the extension problem behaves asymptotically as the mass times the fundamental solution, but this convergence may break down in the non-bi-<jats:italic>K</jats:italic>-invariant case. In the second part, we investigate the long-time asymptotic behavior of the extension problem associated with the so-called distinguished Laplacian on <jats:italic>G</jats:italic>/<jats:italic>K</jats:italic>. In this case, we observe phenomena which are similar to the Euclidean setting for the Poisson semigroup, such as <jats:inline-formula><jats:alternatives><jats:tex-math>$$L^1$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                  <mml:msup>\r\n                    <mml:mi>L</mml:mi>\r\n                    <mml:mn>1</mml:mn>\r\n                  </mml:msup>\r\n                </mml:math></jats:alternatives></jats:inline-formula> asymptotic convergence without the assumption of bi-<jats:italic>K</jats:italic>-invariance.</jats:p>","lang":"eng"}],"publication":"Journal of Evolution Equations","issue":"2","doi":"10.1007/s00028-024-00959-6","language":[{"iso":"eng"}],"article_number":"34","intvolume":"        24","date_updated":"2026-07-03T12:35:54Z","publication_status":"published","publication_identifier":{"issn":["1424-3199","1424-3202"]},"author":[{"last_name":"Papageorgiou","first_name":"Efthymia","full_name":"Papageorgiou, Efthymia","id":"100325"}],"title":"Asymptotic behavior of solutions to the extension problem for the fractional Laplacian on noncompact symmetric spaces","year":"2024","citation":{"chicago":"Papageorgiou, Efthymia. “Asymptotic Behavior of Solutions to the Extension Problem for the Fractional Laplacian on Noncompact Symmetric Spaces.” <i>Journal of Evolution Equations</i> 24, no. 2 (2024). <a href=\"https://doi.org/10.1007/s00028-024-00959-6\">https://doi.org/10.1007/s00028-024-00959-6</a>.","short":"E. Papageorgiou, Journal of Evolution Equations 24 (2024).","ieee":"E. Papageorgiou, “Asymptotic behavior of solutions to the extension problem for the fractional Laplacian on noncompact symmetric spaces,” <i>Journal of Evolution Equations</i>, vol. 24, no. 2, Art. no. 34, 2024, doi: <a href=\"https://doi.org/10.1007/s00028-024-00959-6\">10.1007/s00028-024-00959-6</a>.","apa":"Papageorgiou, E. (2024). Asymptotic behavior of solutions to the extension problem for the fractional Laplacian on noncompact symmetric spaces. <i>Journal of Evolution Equations</i>, <i>24</i>(2), Article 34. <a href=\"https://doi.org/10.1007/s00028-024-00959-6\">https://doi.org/10.1007/s00028-024-00959-6</a>","bibtex":"@article{Papageorgiou_2024, title={Asymptotic behavior of solutions to the extension problem for the fractional Laplacian on noncompact symmetric spaces}, volume={24}, DOI={<a href=\"https://doi.org/10.1007/s00028-024-00959-6\">10.1007/s00028-024-00959-6</a>}, number={234}, journal={Journal of Evolution Equations}, publisher={Springer Science and Business Media LLC}, author={Papageorgiou, Efthymia}, year={2024} }","ama":"Papageorgiou E. Asymptotic behavior of solutions to the extension problem for the fractional Laplacian on noncompact symmetric spaces. <i>Journal of Evolution Equations</i>. 2024;24(2). doi:<a href=\"https://doi.org/10.1007/s00028-024-00959-6\">10.1007/s00028-024-00959-6</a>","mla":"Papageorgiou, Efthymia. “Asymptotic Behavior of Solutions to the Extension Problem for the Fractional Laplacian on Noncompact Symmetric Spaces.” <i>Journal of Evolution Equations</i>, vol. 24, no. 2, 34, Springer Science and Business Media LLC, 2024, doi:<a href=\"https://doi.org/10.1007/s00028-024-00959-6\">10.1007/s00028-024-00959-6</a>."},"volume":24,"user_id":"100325","_id":"53542","publisher":"Springer Science and Business Media LLC","status":"public"},{"abstract":[{"text":"<jats:title>Abstract</jats:title>\r\n          <jats:p>Let <jats:inline-formula>\r\n              <jats:alternatives>\r\n                <jats:tex-math>$$\\mu $$</jats:tex-math>\r\n                <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                  <mml:mi>μ</mml:mi>\r\n                </mml:math>\r\n              </jats:alternatives>\r\n            </jats:inline-formula> be a radial compactly supported distribution on a harmonic <jats:italic>NA</jats:italic> group. We prove that the right convolution operator <jats:inline-formula>\r\n              <jats:alternatives>\r\n                <jats:tex-math>$$c_{\\mu }:f \\mapsto f* \\mu $$</jats:tex-math>\r\n                <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                  <mml:mrow>\r\n                    <mml:msub>\r\n                      <mml:mi>c</mml:mi>\r\n                      <mml:mi>μ</mml:mi>\r\n                    </mml:msub>\r\n                    <mml:mo>:</mml:mo>\r\n                    <mml:mi>f</mml:mi>\r\n                    <mml:mo>↦</mml:mo>\r\n                    <mml:mi>f</mml:mi>\r\n                    <mml:mrow/>\r\n                    <mml:mo>∗</mml:mo>\r\n                    <mml:mi>μ</mml:mi>\r\n                  </mml:mrow>\r\n                </mml:math>\r\n              </jats:alternatives>\r\n            </jats:inline-formula> maps the space of smooth <jats:inline-formula>\r\n              <jats:alternatives>\r\n                <jats:tex-math>$$\\mathfrak {v}$$</jats:tex-math>\r\n                <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                  <mml:mi>v</mml:mi>\r\n                </mml:math>\r\n              </jats:alternatives>\r\n            </jats:inline-formula>-radial functions onto itself if and only if the spherical Fourier transform <jats:inline-formula>\r\n              <jats:alternatives>\r\n                <jats:tex-math>$$\\widetilde{\\mu }(\\lambda )$$</jats:tex-math>\r\n                <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                  <mml:mrow>\r\n                    <mml:mover>\r\n                      <mml:mi>μ</mml:mi>\r\n                      <mml:mo>~</mml:mo>\r\n                    </mml:mover>\r\n                    <mml:mrow>\r\n                      <mml:mo>(</mml:mo>\r\n                      <mml:mi>λ</mml:mi>\r\n                      <mml:mo>)</mml:mo>\r\n                    </mml:mrow>\r\n                  </mml:mrow>\r\n                </mml:math>\r\n              </jats:alternatives>\r\n            </jats:inline-formula>, <jats:inline-formula>\r\n              <jats:alternatives>\r\n                <jats:tex-math>$$\\lambda \\in \\mathbb {C}$$</jats:tex-math>\r\n                <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                  <mml:mrow>\r\n                    <mml:mi>λ</mml:mi>\r\n                    <mml:mo>∈</mml:mo>\r\n                    <mml:mi>C</mml:mi>\r\n                  </mml:mrow>\r\n                </mml:math>\r\n              </jats:alternatives>\r\n            </jats:inline-formula>, is slowly decreasing. As an application, we prove that certain averages over spheres are surjective on the space of smooth <jats:inline-formula>\r\n              <jats:alternatives>\r\n                <jats:tex-math>$$\\mathfrak {v}$$</jats:tex-math>\r\n                <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                  <mml:mi>v</mml:mi>\r\n                </mml:math>\r\n              </jats:alternatives>\r\n            </jats:inline-formula>-radial functions.</jats:p>","lang":"eng"}],"publication":"The Journal of Geometric Analysis","issue":"1","type":"journal_article","date_created":"2026-01-06T09:39:35Z","intvolume":"        35","publication_status":"published","date_updated":"2026-07-03T12:35:33Z","publication_identifier":{"issn":["1050-6926","1559-002X"]},"author":[{"id":"100325","full_name":"Papageorgiou, Efthymia","last_name":"Papageorgiou","first_name":"Efthymia"}],"title":"Surjectivity of Convolution Operators on Harmonic NA Groups","year":"2024","doi":"10.1007/s12220-024-01837-w","language":[{"iso":"eng"}],"article_number":"7","citation":{"mla":"Papageorgiou, Efthymia. “Surjectivity of Convolution Operators on Harmonic NA Groups.” <i>The Journal of Geometric Analysis</i>, vol. 35, no. 1, 7, Springer Science and Business Media LLC, 2024, doi:<a href=\"https://doi.org/10.1007/s12220-024-01837-w\">10.1007/s12220-024-01837-w</a>.","bibtex":"@article{Papageorgiou_2024, title={Surjectivity of Convolution Operators on Harmonic NA Groups}, volume={35}, DOI={<a href=\"https://doi.org/10.1007/s12220-024-01837-w\">10.1007/s12220-024-01837-w</a>}, number={17}, journal={The Journal of Geometric Analysis}, publisher={Springer Science and Business Media LLC}, author={Papageorgiou, Efthymia}, year={2024} }","ama":"Papageorgiou E. Surjectivity of Convolution Operators on Harmonic NA Groups. <i>The Journal of Geometric Analysis</i>. 2024;35(1). doi:<a href=\"https://doi.org/10.1007/s12220-024-01837-w\">10.1007/s12220-024-01837-w</a>","ieee":"E. Papageorgiou, “Surjectivity of Convolution Operators on Harmonic NA Groups,” <i>The Journal of Geometric Analysis</i>, vol. 35, no. 1, Art. no. 7, 2024, doi: <a href=\"https://doi.org/10.1007/s12220-024-01837-w\">10.1007/s12220-024-01837-w</a>.","apa":"Papageorgiou, E. (2024). Surjectivity of Convolution Operators on Harmonic NA Groups. <i>The Journal of Geometric Analysis</i>, <i>35</i>(1), Article 7. <a href=\"https://doi.org/10.1007/s12220-024-01837-w\">https://doi.org/10.1007/s12220-024-01837-w</a>","short":"E. Papageorgiou, The Journal of Geometric Analysis 35 (2024).","chicago":"Papageorgiou, Efthymia. “Surjectivity of Convolution Operators on Harmonic NA Groups.” <i>The Journal of Geometric Analysis</i> 35, no. 1 (2024). <a href=\"https://doi.org/10.1007/s12220-024-01837-w\">https://doi.org/10.1007/s12220-024-01837-w</a>."},"status":"public","volume":35,"user_id":"100325","_id":"63502","publisher":"Springer Science and Business Media LLC"},{"citation":{"apa":"Kolountzakis, M. N., &#38; Papageorgiou, E. (2024). Large sets containing no copies of a given infinite sequence. <i>Analysis &#38;amp; PDE</i>, <i>18</i>(1), 93–108. <a href=\"https://doi.org/10.2140/apde.2025.18.93\">https://doi.org/10.2140/apde.2025.18.93</a>","ieee":"M. N. Kolountzakis and E. Papageorgiou, “Large sets containing no copies of a given infinite sequence,” <i>Analysis &#38;amp; PDE</i>, vol. 18, no. 1, pp. 93–108, 2024, doi: <a href=\"https://doi.org/10.2140/apde.2025.18.93\">10.2140/apde.2025.18.93</a>.","chicago":"Kolountzakis, Mihail N., and Efthymia Papageorgiou. “Large Sets Containing No Copies of a given Infinite Sequence.” <i>Analysis &#38;amp; PDE</i> 18, no. 1 (2024): 93–108. <a href=\"https://doi.org/10.2140/apde.2025.18.93\">https://doi.org/10.2140/apde.2025.18.93</a>.","short":"M.N. Kolountzakis, E. Papageorgiou, Analysis &#38;amp; PDE 18 (2024) 93–108.","mla":"Kolountzakis, Mihail N., and Efthymia Papageorgiou. “Large Sets Containing No Copies of a given Infinite Sequence.” <i>Analysis &#38;amp; PDE</i>, vol. 18, no. 1, Mathematical Sciences Publishers, 2024, pp. 93–108, doi:<a href=\"https://doi.org/10.2140/apde.2025.18.93\">10.2140/apde.2025.18.93</a>.","ama":"Kolountzakis MN, Papageorgiou E. Large sets containing no copies of a given infinite sequence. <i>Analysis &#38;amp; PDE</i>. 2024;18(1):93-108. doi:<a href=\"https://doi.org/10.2140/apde.2025.18.93\">10.2140/apde.2025.18.93</a>","bibtex":"@article{Kolountzakis_Papageorgiou_2024, title={Large sets containing no copies of a given infinite sequence}, volume={18}, DOI={<a href=\"https://doi.org/10.2140/apde.2025.18.93\">10.2140/apde.2025.18.93</a>}, number={1}, journal={Analysis &#38;amp; PDE}, publisher={Mathematical Sciences Publishers}, author={Kolountzakis, Mihail N. and Papageorgiou, Efthymia}, year={2024}, pages={93–108} }"},"issue":"1","publication":"Analysis &amp; PDE","date_created":"2026-01-06T09:43:35Z","type":"journal_article","publication_identifier":{"issn":["1948-206X","2157-5045"]},"author":[{"full_name":"Kolountzakis, Mihail N.","last_name":"Kolountzakis","first_name":"Mihail N."},{"full_name":"Papageorgiou, Efthymia","last_name":"Papageorgiou","first_name":"Efthymia","id":"100325"}],"title":"Large sets containing no copies of a given infinite sequence","year":"2024","status":"public","intvolume":"        18","date_updated":"2026-07-03T12:31:35Z","publication_status":"published","_id":"63504","publisher":"Mathematical Sciences Publishers","language":[{"iso":"eng"}],"page":"93-108","volume":18,"doi":"10.2140/apde.2025.18.93","user_id":"100325"},{"publication":"Proceedings of the International Conference on Compilers, Architecture, and Synthesis for Embedded Systems","citation":{"apa":"Henkel, J., Siddhu, L., Bauer, L., Teich, J., Wildermann, S., Tahoori, M., Mayahinia, M., Castrillon, J., Khan, A. A., Farzaneh, H., Lima, J. P. C. D., Chen, J.-J., Hakert, C., Chen, K.-H., Yang, C.-L., &#38; Cheng, H.-Y. (2024). Special Session - Non-Volatile Memories: Challenges and Opportunities for Embedded System Architectures with Focus on Machine Learning Applications. <i>Proceedings of the International Conference on Compilers, Architecture, and Synthesis for Embedded Systems</i>. <a href=\"https://doi.org/10.1145/3607889.3609088\">https://doi.org/10.1145/3607889.3609088</a>","ieee":"J. Henkel <i>et al.</i>, “Special Session - Non-Volatile Memories: Challenges and Opportunities for Embedded System Architectures with Focus on Machine Learning Applications,” 2024, doi: <a href=\"https://doi.org/10.1145/3607889.3609088\">10.1145/3607889.3609088</a>.","chicago":"Henkel, Jorg, Lokesh Siddhu, Lars Bauer, Jurgen Teich, Stefan Wildermann, Mehdi Tahoori, Mahta Mayahinia, et al. “Special Session - Non-Volatile Memories: Challenges and Opportunities for Embedded System Architectures with Focus on Machine Learning Applications.” In <i>Proceedings of the International Conference on Compilers, Architecture, and Synthesis for Embedded Systems</i>. ACM, 2024. <a href=\"https://doi.org/10.1145/3607889.3609088\">https://doi.org/10.1145/3607889.3609088</a>.","short":"J. Henkel, L. Siddhu, L. Bauer, J. Teich, S. Wildermann, M. Tahoori, M. Mayahinia, J. Castrillon, A.A. Khan, H. Farzaneh, J.P.C.D. Lima, J.-J. Chen, C. Hakert, K.-H. Chen, C.-L. Yang, H.-Y. Cheng, in: Proceedings of the International Conference on Compilers, Architecture, and Synthesis for Embedded Systems, ACM, 2024.","mla":"Henkel, Jorg, et al. “Special Session - Non-Volatile Memories: Challenges and Opportunities for Embedded System Architectures with Focus on Machine Learning Applications.” <i>Proceedings of the International Conference on Compilers, Architecture, and Synthesis for Embedded Systems</i>, ACM, 2024, doi:<a href=\"https://doi.org/10.1145/3607889.3609088\">10.1145/3607889.3609088</a>.","ama":"Henkel J, Siddhu L, Bauer L, et al. Special Session - Non-Volatile Memories: Challenges and Opportunities for Embedded System Architectures with Focus on Machine Learning Applications. In: <i>Proceedings of the International Conference on Compilers, Architecture, and Synthesis for Embedded Systems</i>. ACM; 2024. doi:<a href=\"https://doi.org/10.1145/3607889.3609088\">10.1145/3607889.3609088</a>","bibtex":"@inproceedings{Henkel_Siddhu_Bauer_Teich_Wildermann_Tahoori_Mayahinia_Castrillon_Khan_Farzaneh_et al._2024, title={Special Session - Non-Volatile Memories: Challenges and Opportunities for Embedded System Architectures with Focus on Machine Learning Applications}, DOI={<a href=\"https://doi.org/10.1145/3607889.3609088\">10.1145/3607889.3609088</a>}, booktitle={Proceedings of the International Conference on Compilers, Architecture, and Synthesis for Embedded Systems}, publisher={ACM}, author={Henkel, Jorg and Siddhu, Lokesh and Bauer, Lars and Teich, Jurgen and Wildermann, Stefan and Tahoori, Mehdi and Mayahinia, Mahta and Castrillon, Jeronimo and Khan, Asif Ali and Farzaneh, Hamid and et al.}, year={2024} }"},"date_created":"2026-07-03T21:15:39Z","type":"conference","year":"2024","title":"Special Session - Non-Volatile Memories: Challenges and Opportunities for Embedded System Architectures with Focus on Machine Learning Applications","status":"public","author":[{"full_name":"Henkel, Jorg","last_name":"Henkel","first_name":"Jorg"},{"full_name":"Siddhu, Lokesh","last_name":"Siddhu","first_name":"Lokesh"},{"first_name":"Lars","last_name":"Bauer","full_name":"Bauer, Lars"},{"first_name":"Jurgen","last_name":"Teich","full_name":"Teich, Jurgen"},{"last_name":"Wildermann","first_name":"Stefan","full_name":"Wildermann, Stefan"},{"full_name":"Tahoori, Mehdi","first_name":"Mehdi","last_name":"Tahoori"},{"first_name":"Mahta","last_name":"Mayahinia","full_name":"Mayahinia, Mahta"},{"last_name":"Castrillon","first_name":"Jeronimo","full_name":"Castrillon, Jeronimo"},{"full_name":"Khan, Asif Ali","first_name":"Asif Ali","last_name":"Khan"},{"full_name":"Farzaneh, Hamid","last_name":"Farzaneh","first_name":"Hamid"},{"full_name":"Lima, Joao Paulo C. De","first_name":"Joao Paulo C. De","last_name":"Lima"},{"full_name":"Chen, Jian-Jia","last_name":"Chen","first_name":"Jian-Jia"},{"last_name":"Hakert","first_name":"Christian","full_name":"Hakert, Christian"},{"full_name":"Chen, Kuan-Hsun","first_name":"Kuan-Hsun","last_name":"Chen"},{"full_name":"Yang, Chia-Lin","last_name":"Yang","first_name":"Chia-Lin"},{"full_name":"Cheng, Hsiang-Yun","first_name":"Hsiang-Yun","last_name":"Cheng"}],"publication_status":"published","date_updated":"2026-07-05T14:47:13Z","_id":"66190","publisher":"ACM","user_id":"128464","doi":"10.1145/3607889.3609088"},{"publication":"Proceedings of the International Conference on Compilers, Architecture, and Synthesis for Embedded Systems","citation":{"apa":"Henkel, J., Siddhu, L., Bauer, L., Teich, J., Wildermann, S., Tahoori, M., Mayahinia, M., Castrillon, J., Khan, A. A., Farzaneh, H., Lima, J. P. C. D., Chen, J.-J., Hakert, C., Chen, K.-H., Yang, C.-L., &#38; Cheng, H.-Y. (2024). Special Session - Non-Volatile Memories: Challenges and Opportunities for Embedded System Architectures with Focus on Machine Learning Applications. <i>Proceedings of the International Conference on Compilers, Architecture, and Synthesis for Embedded Systems</i>. <a href=\"https://doi.org/10.1145/3607889.3609088\">https://doi.org/10.1145/3607889.3609088</a>","ieee":"J. Henkel <i>et al.</i>, “Special Session - Non-Volatile Memories: Challenges and Opportunities for Embedded System Architectures with Focus on Machine Learning Applications,” 2024, doi: <a href=\"https://doi.org/10.1145/3607889.3609088\">10.1145/3607889.3609088</a>.","chicago":"Henkel, Jorg, Lokesh Siddhu, Lars Bauer, Jurgen Teich, Stefan Wildermann, Mehdi Tahoori, Mahta Mayahinia, et al. “Special Session - Non-Volatile Memories: Challenges and Opportunities for Embedded System Architectures with Focus on Machine Learning Applications.” In <i>Proceedings of the International Conference on Compilers, Architecture, and Synthesis for Embedded Systems</i>. ACM, 2024. <a href=\"https://doi.org/10.1145/3607889.3609088\">https://doi.org/10.1145/3607889.3609088</a>.","short":"J. Henkel, L. Siddhu, L. Bauer, J. Teich, S. Wildermann, M. Tahoori, M. Mayahinia, J. Castrillon, A.A. Khan, H. Farzaneh, J.P.C.D. Lima, J.-J. Chen, C. Hakert, K.-H. Chen, C.-L. Yang, H.-Y. Cheng, in: Proceedings of the International Conference on Compilers, Architecture, and Synthesis for Embedded Systems, ACM, 2024.","mla":"Henkel, Jorg, et al. “Special Session - Non-Volatile Memories: Challenges and Opportunities for Embedded System Architectures with Focus on Machine Learning Applications.” <i>Proceedings of the International Conference on Compilers, Architecture, and Synthesis for Embedded Systems</i>, ACM, 2024, doi:<a href=\"https://doi.org/10.1145/3607889.3609088\">10.1145/3607889.3609088</a>.","ama":"Henkel J, Siddhu L, Bauer L, et al. Special Session - Non-Volatile Memories: Challenges and Opportunities for Embedded System Architectures with Focus on Machine Learning Applications. In: <i>Proceedings of the International Conference on Compilers, Architecture, and Synthesis for Embedded Systems</i>. ACM; 2024. doi:<a href=\"https://doi.org/10.1145/3607889.3609088\">10.1145/3607889.3609088</a>","bibtex":"@inproceedings{Henkel_Siddhu_Bauer_Teich_Wildermann_Tahoori_Mayahinia_Castrillon_Khan_Farzaneh_et al._2024, title={Special Session - Non-Volatile Memories: Challenges and Opportunities for Embedded System Architectures with Focus on Machine Learning Applications}, DOI={<a href=\"https://doi.org/10.1145/3607889.3609088\">10.1145/3607889.3609088</a>}, booktitle={Proceedings of the International Conference on Compilers, Architecture, and Synthesis for Embedded Systems}, publisher={ACM}, author={Henkel, Jorg and Siddhu, Lokesh and Bauer, Lars and Teich, Jurgen and Wildermann, Stefan and Tahoori, Mehdi and Mayahinia, Mahta and Castrillon, Jeronimo and Khan, Asif Ali and Farzaneh, Hamid and et al.}, year={2024} }"},"date_created":"2026-07-03T21:14:56Z","type":"conference","year":"2024","status":"public","title":"Special Session - Non-Volatile Memories: Challenges and Opportunities for Embedded System Architectures with Focus on Machine Learning Applications","author":[{"full_name":"Henkel, Jorg","first_name":"Jorg","last_name":"Henkel"},{"full_name":"Siddhu, Lokesh","last_name":"Siddhu","first_name":"Lokesh"},{"full_name":"Bauer, Lars","last_name":"Bauer","first_name":"Lars"},{"full_name":"Teich, Jurgen","last_name":"Teich","first_name":"Jurgen"},{"first_name":"Stefan","last_name":"Wildermann","full_name":"Wildermann, Stefan"},{"full_name":"Tahoori, Mehdi","first_name":"Mehdi","last_name":"Tahoori"},{"last_name":"Mayahinia","first_name":"Mahta","full_name":"Mayahinia, Mahta"},{"full_name":"Castrillon, Jeronimo","last_name":"Castrillon","first_name":"Jeronimo"},{"first_name":"Asif Ali","last_name":"Khan","full_name":"Khan, Asif Ali"},{"full_name":"Farzaneh, Hamid","last_name":"Farzaneh","first_name":"Hamid"},{"last_name":"Lima","first_name":"Joao Paulo C. De","full_name":"Lima, Joao Paulo C. De"},{"first_name":"Jian-Jia","last_name":"Chen","full_name":"Chen, Jian-Jia"},{"first_name":"Christian","last_name":"Hakert","full_name":"Hakert, Christian"},{"full_name":"Chen, Kuan-Hsun","last_name":"Chen","first_name":"Kuan-Hsun"},{"full_name":"Yang, Chia-Lin","first_name":"Chia-Lin","last_name":"Yang"},{"full_name":"Cheng, Hsiang-Yun","last_name":"Cheng","first_name":"Hsiang-Yun"}],"date_updated":"2026-07-05T14:47:06Z","publication_status":"published","_id":"66186","publisher":"ACM","doi":"10.1145/3607889.3609088","user_id":"128464"},{"user_id":"128464","doi":"10.1109/icfpt59805.2023.00031","_id":"66189","publisher":"IEEE","publication_status":"published","date_updated":"2026-07-05T14:47:11Z","status":"public","title":"Accelerated Real-Time Classification of Evolving Data Streams using Adaptive Random Forests","year":"2024","author":[{"first_name":"Frank","last_name":"Ridder","full_name":"Ridder, Frank"},{"full_name":"Chen, Kuan-Hsun","first_name":"Kuan-Hsun","last_name":"Chen"},{"full_name":"Alachiotis, Nikolaos","last_name":"Alachiotis","first_name":"Nikolaos"}],"type":"conference","date_created":"2026-07-03T21:15:24Z","publication":"2023 International Conference on Field Programmable Technology (ICFPT)","citation":{"bibtex":"@inproceedings{Ridder_Chen_Alachiotis_2024, title={Accelerated Real-Time Classification of Evolving Data Streams using Adaptive Random Forests}, DOI={<a href=\"https://doi.org/10.1109/icfpt59805.2023.00031\">10.1109/icfpt59805.2023.00031</a>}, booktitle={2023 International Conference on Field Programmable Technology (ICFPT)}, publisher={IEEE}, author={Ridder, Frank and Chen, Kuan-Hsun and Alachiotis, Nikolaos}, year={2024} }","ama":"Ridder F, Chen K-H, Alachiotis N. Accelerated Real-Time Classification of Evolving Data Streams using Adaptive Random Forests. In: <i>2023 International Conference on Field Programmable Technology (ICFPT)</i>. IEEE; 2024. doi:<a href=\"https://doi.org/10.1109/icfpt59805.2023.00031\">10.1109/icfpt59805.2023.00031</a>","mla":"Ridder, Frank, et al. “Accelerated Real-Time Classification of Evolving Data Streams Using Adaptive Random Forests.” <i>2023 International Conference on Field Programmable Technology (ICFPT)</i>, IEEE, 2024, doi:<a href=\"https://doi.org/10.1109/icfpt59805.2023.00031\">10.1109/icfpt59805.2023.00031</a>.","chicago":"Ridder, Frank, Kuan-Hsun Chen, and Nikolaos Alachiotis. “Accelerated Real-Time Classification of Evolving Data Streams Using Adaptive Random Forests.” In <i>2023 International Conference on Field Programmable Technology (ICFPT)</i>. IEEE, 2024. <a href=\"https://doi.org/10.1109/icfpt59805.2023.00031\">https://doi.org/10.1109/icfpt59805.2023.00031</a>.","short":"F. Ridder, K.-H. Chen, N. Alachiotis, in: 2023 International Conference on Field Programmable Technology (ICFPT), IEEE, 2024.","ieee":"F. Ridder, K.-H. Chen, and N. Alachiotis, “Accelerated Real-Time Classification of Evolving Data Streams using Adaptive Random Forests,” 2024, doi: <a href=\"https://doi.org/10.1109/icfpt59805.2023.00031\">10.1109/icfpt59805.2023.00031</a>.","apa":"Ridder, F., Chen, K.-H., &#38; Alachiotis, N. (2024). Accelerated Real-Time Classification of Evolving Data Streams using Adaptive Random Forests. <i>2023 International Conference on Field Programmable Technology (ICFPT)</i>. <a href=\"https://doi.org/10.1109/icfpt59805.2023.00031\">https://doi.org/10.1109/icfpt59805.2023.00031</a>"}},{"type":"journal_article","date_created":"2026-07-03T21:11:12Z","issue":"6","publication":"ACM Transactions on Embedded Computing Systems","citation":{"apa":"Shi, L., Shi, J., Amrouch, H., Chen, K.-H., Zhao, M., &#38; Liu, W. (2024). Introduction to Special Issue on In/Near Memory and Storage Computing for Embedded Systems. <i>ACM Transactions on Embedded Computing Systems</i>, <i>23</i>(6), 1–3. <a href=\"https://doi.org/10.1145/3677018\">https://doi.org/10.1145/3677018</a>","ieee":"L. Shi, J. Shi, H. Amrouch, K.-H. Chen, M. Zhao, and W. Liu, “Introduction to Special Issue on In/Near Memory and Storage Computing for Embedded Systems,” <i>ACM Transactions on Embedded Computing Systems</i>, vol. 23, no. 6, pp. 1–3, 2024, doi: <a href=\"https://doi.org/10.1145/3677018\">10.1145/3677018</a>.","chicago":"Shi, Liang, Jingtong Shi, Hussam Amrouch, Kuan-Hsun Chen, Mengying Zhao, and Weichen Liu. “Introduction to Special Issue on In/Near Memory and Storage Computing for Embedded Systems.” <i>ACM Transactions on Embedded Computing Systems</i> 23, no. 6 (2024): 1–3. <a href=\"https://doi.org/10.1145/3677018\">https://doi.org/10.1145/3677018</a>.","short":"L. Shi, J. Shi, H. Amrouch, K.-H. Chen, M. Zhao, W. Liu, ACM Transactions on Embedded Computing Systems 23 (2024) 1–3.","mla":"Shi, Liang, et al. “Introduction to Special Issue on In/Near Memory and Storage Computing for Embedded Systems.” <i>ACM Transactions on Embedded Computing Systems</i>, vol. 23, no. 6, Association for Computing Machinery (ACM), 2024, pp. 1–3, doi:<a href=\"https://doi.org/10.1145/3677018\">10.1145/3677018</a>.","ama":"Shi L, Shi J, Amrouch H, Chen K-H, Zhao M, Liu W. Introduction to Special Issue on In/Near Memory and Storage Computing for Embedded Systems. <i>ACM Transactions on Embedded Computing Systems</i>. 2024;23(6):1-3. doi:<a href=\"https://doi.org/10.1145/3677018\">10.1145/3677018</a>","bibtex":"@article{Shi_Shi_Amrouch_Chen_Zhao_Liu_2024, title={Introduction to Special Issue on In/Near Memory and Storage Computing for Embedded Systems}, volume={23}, DOI={<a href=\"https://doi.org/10.1145/3677018\">10.1145/3677018</a>}, number={6}, journal={ACM Transactions on Embedded Computing Systems}, publisher={Association for Computing Machinery (ACM)}, author={Shi, Liang and Shi, Jingtong and Amrouch, Hussam and Chen, Kuan-Hsun and Zhao, Mengying and Liu, Weichen}, year={2024}, pages={1–3} }"},"user_id":"128464","doi":"10.1145/3677018","volume":23,"page":"1-3","language":[{"iso":"eng"}],"_id":"66166","publisher":"Association for Computing Machinery (ACM)","publication_status":"published","date_updated":"2026-07-05T14:47:57Z","intvolume":"        23","status":"public","year":"2024","title":"Introduction to Special Issue on In/Near Memory and Storage Computing for Embedded Systems","author":[{"full_name":"Shi, Liang","first_name":"Liang","last_name":"Shi"},{"last_name":"Shi","first_name":"Jingtong","full_name":"Shi, Jingtong"},{"first_name":"Hussam","last_name":"Amrouch","full_name":"Amrouch, Hussam"},{"full_name":"Chen, Kuan-Hsun","last_name":"Chen","first_name":"Kuan-Hsun"},{"first_name":"Mengying","last_name":"Zhao","full_name":"Zhao, Mengying"},{"full_name":"Liu, Weichen","last_name":"Liu","first_name":"Weichen"}],"publication_identifier":{"issn":["1539-9087","1558-3465"]}},{"date_created":"2026-07-03T21:12:22Z","type":"conference","citation":{"short":"J. Malcher, D. Biebert, K.-H. Chen, S. Buschjäger, C. Hakert, J.-J. Chen, in: Proceedings of the 25th ACM SIGPLAN/SIGBED International Conference on Languages, Compilers, and Tools for Embedded Systems, ACM, 2024.","chicago":"Malcher, Jannik, Daniel Biebert, Kuan-Hsun Chen, Sebastian Buschjäger, Christian Hakert, and Jian-Jia Chen. “Language-Based Deployment Optimization for Random Forests (Invited Paper).” In <i>Proceedings of the 25th ACM SIGPLAN/SIGBED International Conference on Languages, Compilers, and Tools for Embedded Systems</i>. ACM, 2024. <a href=\"https://doi.org/10.1145/3652032.3659366\">https://doi.org/10.1145/3652032.3659366</a>.","ieee":"J. Malcher, D. Biebert, K.-H. Chen, S. Buschjäger, C. Hakert, and J.-J. Chen, “Language-Based Deployment Optimization for Random Forests (Invited Paper),” 2024, doi: <a href=\"https://doi.org/10.1145/3652032.3659366\">10.1145/3652032.3659366</a>.","apa":"Malcher, J., Biebert, D., Chen, K.-H., Buschjäger, S., Hakert, C., &#38; Chen, J.-J. (2024). Language-Based Deployment Optimization for Random Forests (Invited Paper). <i>Proceedings of the 25th ACM SIGPLAN/SIGBED International Conference on Languages, Compilers, and Tools for Embedded Systems</i>. <a href=\"https://doi.org/10.1145/3652032.3659366\">https://doi.org/10.1145/3652032.3659366</a>","bibtex":"@inproceedings{Malcher_Biebert_Chen_Buschjäger_Hakert_Chen_2024, title={Language-Based Deployment Optimization for Random Forests (Invited Paper)}, DOI={<a href=\"https://doi.org/10.1145/3652032.3659366\">10.1145/3652032.3659366</a>}, booktitle={Proceedings of the 25th ACM SIGPLAN/SIGBED International Conference on Languages, Compilers, and Tools for Embedded Systems}, publisher={ACM}, author={Malcher, Jannik and Biebert, Daniel and Chen, Kuan-Hsun and Buschjäger, Sebastian and Hakert, Christian and Chen, Jian-Jia}, year={2024} }","ama":"Malcher J, Biebert D, Chen K-H, Buschjäger S, Hakert C, Chen J-J. Language-Based Deployment Optimization for Random Forests (Invited Paper). In: <i>Proceedings of the 25th ACM SIGPLAN/SIGBED International Conference on Languages, Compilers, and Tools for Embedded Systems</i>. ACM; 2024. doi:<a href=\"https://doi.org/10.1145/3652032.3659366\">10.1145/3652032.3659366</a>","mla":"Malcher, Jannik, et al. “Language-Based Deployment Optimization for Random Forests (Invited Paper).” <i>Proceedings of the 25th ACM SIGPLAN/SIGBED International Conference on Languages, Compilers, and Tools for Embedded Systems</i>, ACM, 2024, doi:<a href=\"https://doi.org/10.1145/3652032.3659366\">10.1145/3652032.3659366</a>."},"publication":"Proceedings of the 25th ACM SIGPLAN/SIGBED International Conference on Languages, Compilers, and Tools for Embedded Systems","_id":"66172","publisher":"ACM","doi":"10.1145/3652032.3659366","user_id":"128464","author":[{"full_name":"Malcher, Jannik","last_name":"Malcher","first_name":"Jannik"},{"full_name":"Biebert, Daniel","first_name":"Daniel","last_name":"Biebert"},{"full_name":"Chen, Kuan-Hsun","first_name":"Kuan-Hsun","last_name":"Chen"},{"last_name":"Buschjäger","first_name":"Sebastian","full_name":"Buschjäger, Sebastian"},{"full_name":"Hakert, Christian","first_name":"Christian","last_name":"Hakert"},{"last_name":"Chen","first_name":"Jian-Jia","full_name":"Chen, Jian-Jia"}],"title":"Language-Based Deployment Optimization for Random Forests (Invited Paper)","status":"public","year":"2024","date_updated":"2026-07-05T14:48:11Z","publication_status":"published"},{"author":[{"first_name":"Tijmen T.","last_name":"Smit","full_name":"Smit, Tijmen T."},{"last_name":"Forlin","first_name":"Bruno Endres","full_name":"Forlin, Bruno Endres"},{"first_name":"Kuan-Hsun","last_name":"Chen","full_name":"Chen, Kuan-Hsun"},{"last_name":"Souvatzoglou","first_name":"Ioanna","full_name":"Souvatzoglou, Ioanna"},{"last_name":"Psarakis","first_name":"Mihalis","full_name":"Psarakis, Mihalis"},{"last_name":"Ottavi","first_name":"Marco","full_name":"Ottavi, Marco"}],"year":"2024","status":"public","title":"An Enhanced Fault Injection Framework for FPGA-Based Soft-Cores","publication_status":"published","date_updated":"2026-07-05T14:48:07Z","_id":"66170","publisher":"IEEE","user_id":"128464","doi":"10.1109/dft63277.2024.10753564","citation":{"mla":"Smit, Tijmen T., et al. “An Enhanced Fault Injection Framework for FPGA-Based Soft-Cores.” <i>2024 IEEE International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology Systems (DFT)</i>, IEEE, 2024, doi:<a href=\"https://doi.org/10.1109/dft63277.2024.10753564\">10.1109/dft63277.2024.10753564</a>.","ama":"Smit TT, Forlin BE, Chen K-H, Souvatzoglou I, Psarakis M, Ottavi M. An Enhanced Fault Injection Framework for FPGA-Based Soft-Cores. In: <i>2024 IEEE International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology Systems (DFT)</i>. IEEE; 2024. doi:<a href=\"https://doi.org/10.1109/dft63277.2024.10753564\">10.1109/dft63277.2024.10753564</a>","bibtex":"@inproceedings{Smit_Forlin_Chen_Souvatzoglou_Psarakis_Ottavi_2024, title={An Enhanced Fault Injection Framework for FPGA-Based Soft-Cores}, DOI={<a href=\"https://doi.org/10.1109/dft63277.2024.10753564\">10.1109/dft63277.2024.10753564</a>}, booktitle={2024 IEEE International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology Systems (DFT)}, publisher={IEEE}, author={Smit, Tijmen T. and Forlin, Bruno Endres and Chen, Kuan-Hsun and Souvatzoglou, Ioanna and Psarakis, Mihalis and Ottavi, Marco}, year={2024} }","apa":"Smit, T. T., Forlin, B. E., Chen, K.-H., Souvatzoglou, I., Psarakis, M., &#38; Ottavi, M. (2024). An Enhanced Fault Injection Framework for FPGA-Based Soft-Cores. <i>2024 IEEE International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology Systems (DFT)</i>. <a href=\"https://doi.org/10.1109/dft63277.2024.10753564\">https://doi.org/10.1109/dft63277.2024.10753564</a>","ieee":"T. T. Smit, B. E. Forlin, K.-H. Chen, I. Souvatzoglou, M. Psarakis, and M. Ottavi, “An Enhanced Fault Injection Framework for FPGA-Based Soft-Cores,” 2024, doi: <a href=\"https://doi.org/10.1109/dft63277.2024.10753564\">10.1109/dft63277.2024.10753564</a>.","chicago":"Smit, Tijmen T., Bruno Endres Forlin, Kuan-Hsun Chen, Ioanna Souvatzoglou, Mihalis Psarakis, and Marco Ottavi. “An Enhanced Fault Injection Framework for FPGA-Based Soft-Cores.” In <i>2024 IEEE International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology Systems (DFT)</i>. IEEE, 2024. <a href=\"https://doi.org/10.1109/dft63277.2024.10753564\">https://doi.org/10.1109/dft63277.2024.10753564</a>.","short":"T.T. Smit, B.E. Forlin, K.-H. Chen, I. Souvatzoglou, M. Psarakis, M. Ottavi, in: 2024 IEEE International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology Systems (DFT), IEEE, 2024."},"publication":"2024 IEEE International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology Systems (DFT)","date_created":"2026-07-03T21:11:54Z","type":"conference"},{"year":"2024","title":"Lightweight Instrumentation for Accurate Performance Monitoring in RTOSes","status":"public","author":[{"full_name":"Forlin, Bruno","last_name":"Forlin","first_name":"Bruno"},{"full_name":"Chen, Kuan-Hsun","first_name":"Kuan-Hsun","last_name":"Chen"},{"last_name":"Alachiotis","first_name":"Nikolaos","full_name":"Alachiotis, Nikolaos"},{"full_name":"Cassano, Luca","last_name":"Cassano","first_name":"Luca"},{"last_name":"Ottavi","first_name":"Marco","full_name":"Ottavi, Marco"}],"date_updated":"2026-07-05T14:47:59Z","publication_status":"published","publisher":"IEEE","_id":"66167","doi":"10.23919/date58400.2024.10546790","user_id":"128464","publication":"2024 Design, Automation &amp;amp; Test in Europe Conference &amp;amp; Exhibition (DATE)","citation":{"short":"B. Forlin, K.-H. Chen, N. Alachiotis, L. Cassano, M. Ottavi, in: 2024 Design, Automation &#38;amp;Amp; Test in Europe Conference &#38;amp;Amp; Exhibition (DATE), IEEE, 2024.","chicago":"Forlin, Bruno, Kuan-Hsun Chen, Nikolaos Alachiotis, Luca Cassano, and Marco Ottavi. “Lightweight Instrumentation for Accurate Performance Monitoring in RTOSes.” In <i>2024 Design, Automation &#38;amp;Amp; Test in Europe Conference &#38;amp;Amp; Exhibition (DATE)</i>. IEEE, 2024. <a href=\"https://doi.org/10.23919/date58400.2024.10546790\">https://doi.org/10.23919/date58400.2024.10546790</a>.","apa":"Forlin, B., Chen, K.-H., Alachiotis, N., Cassano, L., &#38; Ottavi, M. (2024). Lightweight Instrumentation for Accurate Performance Monitoring in RTOSes. <i>2024 Design, Automation &#38;amp;Amp; Test in Europe Conference &#38;amp;Amp; Exhibition (DATE)</i>. <a href=\"https://doi.org/10.23919/date58400.2024.10546790\">https://doi.org/10.23919/date58400.2024.10546790</a>","ieee":"B. Forlin, K.-H. Chen, N. Alachiotis, L. Cassano, and M. Ottavi, “Lightweight Instrumentation for Accurate Performance Monitoring in RTOSes,” 2024, doi: <a href=\"https://doi.org/10.23919/date58400.2024.10546790\">10.23919/date58400.2024.10546790</a>.","ama":"Forlin B, Chen K-H, Alachiotis N, Cassano L, Ottavi M. Lightweight Instrumentation for Accurate Performance Monitoring in RTOSes. In: <i>2024 Design, Automation &#38;amp;Amp; Test in Europe Conference &#38;amp;Amp; Exhibition (DATE)</i>. IEEE; 2024. doi:<a href=\"https://doi.org/10.23919/date58400.2024.10546790\">10.23919/date58400.2024.10546790</a>","bibtex":"@inproceedings{Forlin_Chen_Alachiotis_Cassano_Ottavi_2024, title={Lightweight Instrumentation for Accurate Performance Monitoring in RTOSes}, DOI={<a href=\"https://doi.org/10.23919/date58400.2024.10546790\">10.23919/date58400.2024.10546790</a>}, booktitle={2024 Design, Automation &#38;amp;amp; Test in Europe Conference &#38;amp;amp; Exhibition (DATE)}, publisher={IEEE}, author={Forlin, Bruno and Chen, Kuan-Hsun and Alachiotis, Nikolaos and Cassano, Luca and Ottavi, Marco}, year={2024} }","mla":"Forlin, Bruno, et al. “Lightweight Instrumentation for Accurate Performance Monitoring in RTOSes.” <i>2024 Design, Automation &#38;amp;Amp; Test in Europe Conference &#38;amp;Amp; Exhibition (DATE)</i>, IEEE, 2024, doi:<a href=\"https://doi.org/10.23919/date58400.2024.10546790\">10.23919/date58400.2024.10546790</a>."},"date_created":"2026-07-03T21:11:32Z","type":"conference"},{"date_created":"2026-07-03T21:11:43Z","type":"conference","publication":"2024 Design, Automation &amp;amp; Test in Europe Conference &amp;amp; Exhibition (DATE)","citation":{"mla":"Hakert, Christian, et al. “FLInt: Exploiting Floating Point Enabled Integer Arithmetic for Efficient Random Forest Inference.” <i>2024 Design, Automation &#38;amp;Amp; Test in Europe Conference &#38;amp;Amp; Exhibition (DATE)</i>, IEEE, 2024, doi:<a href=\"https://doi.org/10.23919/date58400.2024.10546851\">10.23919/date58400.2024.10546851</a>.","bibtex":"@inproceedings{Hakert_Chen_Chen_2024, title={FLInt: Exploiting Floating Point Enabled Integer Arithmetic for Efficient Random Forest Inference}, DOI={<a href=\"https://doi.org/10.23919/date58400.2024.10546851\">10.23919/date58400.2024.10546851</a>}, booktitle={2024 Design, Automation &#38;amp;amp; Test in Europe Conference &#38;amp;amp; Exhibition (DATE)}, publisher={IEEE}, author={Hakert, Christian and Chen, Kuan-Hsun and Chen, Jian-Jia}, year={2024} }","ama":"Hakert C, Chen K-H, Chen J-J. FLInt: Exploiting Floating Point Enabled Integer Arithmetic for Efficient Random Forest Inference. In: <i>2024 Design, Automation &#38;amp;Amp; Test in Europe Conference &#38;amp;Amp; Exhibition (DATE)</i>. IEEE; 2024. doi:<a href=\"https://doi.org/10.23919/date58400.2024.10546851\">10.23919/date58400.2024.10546851</a>","ieee":"C. Hakert, K.-H. Chen, and J.-J. Chen, “FLInt: Exploiting Floating Point Enabled Integer Arithmetic for Efficient Random Forest Inference,” 2024, doi: <a href=\"https://doi.org/10.23919/date58400.2024.10546851\">10.23919/date58400.2024.10546851</a>.","apa":"Hakert, C., Chen, K.-H., &#38; Chen, J.-J. (2024). FLInt: Exploiting Floating Point Enabled Integer Arithmetic for Efficient Random Forest Inference. <i>2024 Design, Automation &#38;amp;Amp; Test in Europe Conference &#38;amp;Amp; Exhibition (DATE)</i>. <a href=\"https://doi.org/10.23919/date58400.2024.10546851\">https://doi.org/10.23919/date58400.2024.10546851</a>","short":"C. Hakert, K.-H. Chen, J.-J. Chen, in: 2024 Design, Automation &#38;amp;Amp; Test in Europe Conference &#38;amp;Amp; Exhibition (DATE), IEEE, 2024.","chicago":"Hakert, Christian, Kuan-Hsun Chen, and Jian-Jia Chen. “FLInt: Exploiting Floating Point Enabled Integer Arithmetic for Efficient Random Forest Inference.” In <i>2024 Design, Automation &#38;amp;Amp; Test in Europe Conference &#38;amp;Amp; Exhibition (DATE)</i>. IEEE, 2024. <a href=\"https://doi.org/10.23919/date58400.2024.10546851\">https://doi.org/10.23919/date58400.2024.10546851</a>."},"publisher":"IEEE","_id":"66169","user_id":"128464","doi":"10.23919/date58400.2024.10546851","title":"FLInt: Exploiting Floating Point Enabled Integer Arithmetic for Efficient Random Forest Inference","status":"public","year":"2024","author":[{"full_name":"Hakert, Christian","last_name":"Hakert","first_name":"Christian"},{"last_name":"Chen","first_name":"Kuan-Hsun","full_name":"Chen, Kuan-Hsun"},{"full_name":"Chen, Jian-Jia","first_name":"Jian-Jia","last_name":"Chen"}],"publication_status":"published","date_updated":"2026-07-05T14:48:04Z"},{"year":"2024","status":"public","title":"Register Your Forests: Decision Tree Ensemble Optimization by Explicit CPU Register Allocation","citation":{"mla":"<i>Register Your Forests: Decision Tree Ensemble Optimization by Explicit CPU Register Allocation</i>. 2024, doi:<a href=\"https://doi.org/10.48550/ARXIV.2404.06846\">10.48550/ARXIV.2404.06846</a>.","bibtex":"@article{Register Your Forests: Decision Tree Ensemble Optimization by Explicit CPU Register Allocation_2024, DOI={<a href=\"https://doi.org/10.48550/ARXIV.2404.06846\">10.48550/ARXIV.2404.06846</a>}, year={2024} }","ama":"Register Your Forests: Decision Tree Ensemble Optimization by Explicit CPU Register Allocation. Published online 2024. doi:<a href=\"https://doi.org/10.48550/ARXIV.2404.06846\">10.48550/ARXIV.2404.06846</a>","ieee":"“Register Your Forests: Decision Tree Ensemble Optimization by Explicit CPU Register Allocation,” 2024, doi: <a href=\"https://doi.org/10.48550/ARXIV.2404.06846\">10.48550/ARXIV.2404.06846</a>.","apa":"<i>Register Your Forests: Decision Tree Ensemble Optimization by Explicit CPU Register Allocation</i>. (2024). <a href=\"https://doi.org/10.48550/ARXIV.2404.06846\">https://doi.org/10.48550/ARXIV.2404.06846</a>","chicago":"“Register Your Forests: Decision Tree Ensemble Optimization by Explicit CPU Register Allocation,” 2024. <a href=\"https://doi.org/10.48550/ARXIV.2404.06846\">https://doi.org/10.48550/ARXIV.2404.06846</a>.","short":"(2024)."},"date_updated":"2026-07-05T14:48:15Z","_id":"66174","date_created":"2026-07-03T21:12:50Z","doi":"10.48550/ARXIV.2404.06846","user_id":"128464","type":"journal_article"},{"_id":"66173","date_created":"2026-07-03T21:12:41Z","doi":"10.48550/ARXIV.2401.15503","type":"journal_article","user_id":"128464","year":"2024","status":"public","title":"Dawn of the Dead(line Misses): Impact of Job Dismiss on the Deadline Miss Rate","citation":{"short":"(2024).","chicago":"“Dawn of the Dead(Line Misses): Impact of Job Dismiss on the Deadline Miss Rate,” 2024. <a href=\"https://doi.org/10.48550/ARXIV.2401.15503\">https://doi.org/10.48550/ARXIV.2401.15503</a>.","ieee":"“Dawn of the Dead(line Misses): Impact of Job Dismiss on the Deadline Miss Rate,” 2024, doi: <a href=\"https://doi.org/10.48550/ARXIV.2401.15503\">10.48550/ARXIV.2401.15503</a>.","apa":"<i>Dawn of the Dead(line Misses): Impact of Job Dismiss on the Deadline Miss Rate</i>. (2024). <a href=\"https://doi.org/10.48550/ARXIV.2401.15503\">https://doi.org/10.48550/ARXIV.2401.15503</a>","bibtex":"@article{Dawn of the Dead(line Misses): Impact of Job Dismiss on the Deadline Miss Rate_2024, DOI={<a href=\"https://doi.org/10.48550/ARXIV.2401.15503\">10.48550/ARXIV.2401.15503</a>}, year={2024} }","ama":"Dawn of the Dead(line Misses): Impact of Job Dismiss on the Deadline Miss Rate. Published online 2024. doi:<a href=\"https://doi.org/10.48550/ARXIV.2401.15503\">10.48550/ARXIV.2401.15503</a>","mla":"<i>Dawn of the Dead(Line Misses): Impact of Job Dismiss on the Deadline Miss Rate</i>. 2024, doi:<a href=\"https://doi.org/10.48550/ARXIV.2401.15503\">10.48550/ARXIV.2401.15503</a>."},"date_updated":"2026-07-05T14:48:13Z"},{"type":"preprint","date_created":"2026-07-07T06:32:11Z","external_id":{"arxiv":["2410.05792"]},"abstract":[{"text":"In this paper, we study properties of nodal orders defined over arbitrary base fields. In particular we give a classification of complete real nodal orders.","lang":"eng"}],"citation":{"bibtex":"@article{Burban_Drozd_2024, title={Classification of real nodal orders}, journal={arXiv:2410.05792}, author={Burban, Igor and Drozd, Yuriy}, year={2024} }","ama":"Burban I, Drozd Y. Classification of real nodal orders. <i>arXiv:241005792</i>. Published online 2024.","mla":"Burban, Igor, and Yuriy Drozd. “Classification of Real Nodal Orders.” <i>ArXiv:2410.05792</i>, 2024.","chicago":"Burban, Igor, and Yuriy Drozd. “Classification of Real Nodal Orders.” <i>ArXiv:2410.05792</i>, 2024.","short":"I. Burban, Y. Drozd, ArXiv:2410.05792 (2024).","ieee":"I. Burban and Y. Drozd, “Classification of real nodal orders,” <i>arXiv:2410.05792</i>. 2024.","apa":"Burban, I., &#38; Drozd, Y. (2024). Classification of real nodal orders. In <i>arXiv:2410.05792</i>."},"publication":"arXiv:2410.05792","user_id":"72064","_id":"66295","language":[{"iso":"eng"}],"date_updated":"2026-07-07T06:32:30Z","author":[{"id":"72064","full_name":"Burban, Igor","last_name":"Burban","first_name":"Igor"},{"first_name":"Yuriy","last_name":"Drozd","full_name":"Drozd, Yuriy"}],"status":"public","title":"Classification of real nodal orders","year":"2024"},{"language":[{"iso":"eng"}],"_id":"34083","user_id":"77647","author":[{"first_name":"Maja","last_name":"Stahl","full_name":"Stahl, Maja","id":"77647"},{"id":"3900","full_name":"Wachsmuth, Henning","last_name":"Wachsmuth","first_name":"Henning"}],"conference":{"name":"16th International Natural Language Generation Conference"},"status":"public","year":"2023","title":"Identifying Feedback Types to Augment Feedback Comment Generation","publication_status":"accepted","date_updated":"2022-11-15T08:48:01Z","date_created":"2022-11-15T08:47:57Z","type":"conference","citation":{"short":"M. Stahl, H. Wachsmuth, in: Proceedings of the 16th International Natural Language Generation Conference, n.d.","chicago":"Stahl, Maja, and Henning Wachsmuth. “Identifying Feedback Types to Augment Feedback Comment Generation.” In <i>Proceedings of the 16th International Natural Language Generation Conference</i>, n.d.","apa":"Stahl, M., &#38; Wachsmuth, H. (n.d.). Identifying Feedback Types to Augment Feedback Comment Generation. <i>Proceedings of the 16th International Natural Language Generation Conference</i>. 16th International Natural Language Generation Conference.","ieee":"M. Stahl and H. Wachsmuth, “Identifying Feedback Types to Augment Feedback Comment Generation,” presented at the 16th International Natural Language Generation Conference.","ama":"Stahl M, Wachsmuth H. Identifying Feedback Types to Augment Feedback Comment Generation. In: <i>Proceedings of the 16th International Natural Language Generation Conference</i>.","bibtex":"@inproceedings{Stahl_Wachsmuth, title={Identifying Feedback Types to Augment Feedback Comment Generation}, booktitle={Proceedings of the 16th International Natural Language Generation Conference}, author={Stahl, Maja and Wachsmuth, Henning} }","mla":"Stahl, Maja, and Henning Wachsmuth. “Identifying Feedback Types to Augment Feedback Comment Generation.” <i>Proceedings of the 16th International Natural Language Generation Conference</i>."},"publication":"Proceedings of the 16th International Natural Language Generation Conference","extern":"1","abstract":[{"lang":"eng","text":"In the context of language learning, feedback comment generation is the task of generating hints or explanatory notes for learner texts that help understand why a part of text is erroneous. This paper presents our approach to the Feedback Comment Generation Shared Task, collocated with the 16th International Natural Language Generation Conference (INLG 2023). The approach augments the generation of feedback comments by a self-supervised identification of feedback types in a multitask-learning setting. Within the shared task, other approaches performed more effective, yet the combined modeling of feedback type classification and feedback comment generation is superior to performing feedback generation only."}]},{"doi":"10.4324/9781003333197","main_file_link":[{"open_access":"1","url":"https://www.taylorfrancis.com/books/oa-edit/10.4324/9781003333197/histories-tax-evasion-avoidance-resistance-korinna-sch%C3%B6nh%C3%A4rl-gisela-h%C3%BCrlimann-dorothea-rohde"}],"language":[{"iso":"eng"}],"series_title":"Financial History","date_updated":"2022-12-19T11:03:07Z","publication_status":"published","year":"2023","title":"Histories of Tax Evasion, Avoidance and Resistance","publication_identifier":{"isbn":["9781003333197"]},"author":[{"id":"89037","last_name":"Schönhärl","first_name":"Korinna","orcid":"0000-0002-7967-3261","full_name":"Schönhärl, Korinna"},{"last_name":"Hürlimann","first_name":"Gisela","full_name":"Hürlimann, Gisela"},{"full_name":"Rohde, Dorothea","last_name":"Rohde","first_name":"Dorothea"}],"type":"book","keyword":["Tax History","Financial History"],"department":[{"_id":"445"}],"file":[{"creator":"schoenha","date_created":"2022-12-19T10:44:55Z","file_size":4393218,"access_level":"closed","file_name":"Schönhärl_Hürlimann_Rohde_Histories_Tax_Evasion.pdf","date_updated":"2022-12-19T10:44:55Z","relation":"main_file","content_type":"application/pdf","success":1,"file_id":"34545"}],"date_created":"2022-12-19T10:42:01Z","abstract":[{"text":"Tax evasion, tax avoidance and tax resistance are widespread phenomena in political, economic, social and fiscal history from antiquity through medieval, early modern and modern times. Histories of Tax Evasion, Avoidance and Resistance shows how different groups and individuals around the globe have succeeded or failed in not paying their due taxes, whether in kind or in cash, on their properties or on their crops.\r\n\r\nIt analyses how, throughout history, wealthy and poor taxpayers have tried to avoid or reduce their tax burden by negotiating with tax authorities, through practices of legal or illegal tax evasion, by filing lawsuits, seeking armed resistance or by migration, and how state authorities have dealt with such acts of claim making, defiance, open resistance or elusion. It fills an important research gap in tax history, addressing questions of tax morale and fairness, and how social and political inequality was negotiated through taxation. It gives rich insights into the development of citizen-state relationships throughout the course of history. The book comprises case studies from Ancient Athens, Roman Egypt, Medieval Europe, Early Modern Mexico, the Ottoman Empire, Nigeria under British colonial rule, the United Kingdom of the early 20th century, Greece during the Second World War, as well as West Germany, Switzerland, Sweden and the United States in the 20th century, including transnational entanglements in the world of late-modern offshore finance and taxation. The authors are experts in fiscal, economic, financial, legal, social and/or cultural history.\r\nThe book is intended for students, researchers and scholars of economic and financial history, social and world history and political economy.\r\nThe Open Access version of this book, available at www.taylorfrancis.com, has been made available under a Creative Commons Attribution-Share Alike 4.0 license.","lang":"eng"}],"ddc":["900"],"user_id":"89037","_id":"34544","publisher":"Routledge","edition":"1","has_accepted_license":"1","status":"public","oa":"1","place":"London","quality_controlled":"1","file_date_updated":"2022-12-19T10:44:55Z","citation":{"ama":"Schönhärl K, Hürlimann G, Rohde D. <i>Histories of Tax Evasion, Avoidance and Resistance</i>. 1st ed. Routledge; 2023. doi:<a href=\"https://doi.org/10.4324/9781003333197\">10.4324/9781003333197</a>","bibtex":"@book{Schönhärl_Hürlimann_Rohde_2023, place={London}, edition={1}, series={Financial History}, title={Histories of Tax Evasion, Avoidance and Resistance}, DOI={<a href=\"https://doi.org/10.4324/9781003333197\">10.4324/9781003333197</a>}, publisher={Routledge}, author={Schönhärl, Korinna and Hürlimann, Gisela and Rohde, Dorothea}, year={2023}, collection={Financial History} }","mla":"Schönhärl, Korinna, et al. <i>Histories of Tax Evasion, Avoidance and Resistance</i>. 1st ed., Routledge, 2023, doi:<a href=\"https://doi.org/10.4324/9781003333197\">10.4324/9781003333197</a>.","short":"K. Schönhärl, G. Hürlimann, D. Rohde, Histories of Tax Evasion, Avoidance and Resistance, 1st ed., Routledge, London, 2023.","chicago":"Schönhärl, Korinna, Gisela Hürlimann, and Dorothea Rohde. <i>Histories of Tax Evasion, Avoidance and Resistance</i>. 1st ed. Financial History. London: Routledge, 2023. <a href=\"https://doi.org/10.4324/9781003333197\">https://doi.org/10.4324/9781003333197</a>.","apa":"Schönhärl, K., Hürlimann, G., &#38; Rohde, D. (2023). <i>Histories of Tax Evasion, Avoidance and Resistance</i> (1st ed.). Routledge. <a href=\"https://doi.org/10.4324/9781003333197\">https://doi.org/10.4324/9781003333197</a>","ieee":"K. Schönhärl, G. Hürlimann, and D. Rohde, <i>Histories of Tax Evasion, Avoidance and Resistance</i>, 1st ed. London: Routledge, 2023."}}]