[{"author":[{"id":"38705","full_name":"Castenow, Jannik","first_name":"Jannik","last_name":"Castenow"},{"last_name":"Harbig","first_name":"Jonas","full_name":"Harbig, Jonas","id":"47213"},{"first_name":"Daniel","last_name":"Jung","full_name":"Jung, Daniel","id":"37827"},{"full_name":"Knollmann, Till","last_name":"Knollmann","first_name":"Till","orcid":"0000-0003-2014-4696","id":"39241"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"publication_identifier":{"issn":["0304-3975"]},"title":"Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation","year":"2023","article_type":"original","intvolume":"       939","publication_status":"published","date_updated":"2023-01-30T09:20:09Z","language":[{"iso":"eng"}],"doi":"10.1016/j.tcs.2022.10.031","publication":"Theoretical Computer Science","date_created":"2022-10-28T05:11:16Z","department":[{"_id":"63"}],"type":"journal_article","keyword":["General Computer Science","Theoretical Computer Science"],"status":"public","publisher":"Elsevier BV","_id":"33947","page":"261-291","volume":939,"user_id":"38705","citation":{"ama":"Castenow J, Harbig J, Jung D, Knollmann T, Meyer auf der Heide F. Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation. <i>Theoretical Computer Science</i>. 2023;939:261-291. doi:<a href=\"https://doi.org/10.1016/j.tcs.2022.10.031\">10.1016/j.tcs.2022.10.031</a>","bibtex":"@article{Castenow_Harbig_Jung_Knollmann_Meyer auf der Heide_2023, title={Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation}, volume={939}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2022.10.031\">10.1016/j.tcs.2022.10.031</a>}, journal={Theoretical Computer Science}, publisher={Elsevier BV}, author={Castenow, Jannik and Harbig, Jonas and Jung, Daniel and Knollmann, Till and Meyer auf der Heide, Friedhelm}, year={2023}, pages={261–291} }","mla":"Castenow, Jannik, et al. “Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation.” <i>Theoretical Computer Science</i>, vol. 939, Elsevier BV, 2023, pp. 261–91, doi:<a href=\"https://doi.org/10.1016/j.tcs.2022.10.031\">10.1016/j.tcs.2022.10.031</a>.","short":"J. Castenow, J. Harbig, D. Jung, T. Knollmann, F. Meyer auf der Heide, Theoretical Computer Science 939 (2023) 261–291.","chicago":"Castenow, Jannik, Jonas Harbig, Daniel Jung, Till Knollmann, and Friedhelm Meyer auf der Heide. “Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation.” <i>Theoretical Computer Science</i> 939 (2023): 261–91. <a href=\"https://doi.org/10.1016/j.tcs.2022.10.031\">https://doi.org/10.1016/j.tcs.2022.10.031</a>.","apa":"Castenow, J., Harbig, J., Jung, D., Knollmann, T., &#38; Meyer auf der Heide, F. (2023). Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation. <i>Theoretical Computer Science</i>, <i>939</i>, 261–291. <a href=\"https://doi.org/10.1016/j.tcs.2022.10.031\">https://doi.org/10.1016/j.tcs.2022.10.031</a>","ieee":"J. Castenow, J. Harbig, D. Jung, T. Knollmann, and F. Meyer auf der Heide, “Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation,” <i>Theoretical Computer Science</i>, vol. 939, pp. 261–291, 2023, doi: <a href=\"https://doi.org/10.1016/j.tcs.2022.10.031\">10.1016/j.tcs.2022.10.031</a>."},"project":[{"_id":"106","name":"Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme"}],"external_id":{"arxiv":["2010.04424 "]}},{"date_updated":"2023-02-06T10:46:00Z","year":"2023","title":"Enhancing Comprehension and Navigation in Jupyter Notebooks with Static Analysis","status":"public","author":[{"id":"66637","full_name":"Shivarpatna Venkatesh, Ashwin Prasad","last_name":"Shivarpatna Venkatesh","first_name":"Ashwin Prasad"},{"full_name":"Wang, Jiawei","last_name":"Wang","first_name":"Jiawei"},{"last_name":"Li","first_name":"Li","full_name":"Li, Li"},{"id":"59256","first_name":"Eric","last_name":"Bodden","orcid":"0000-0003-3470-3647","full_name":"Bodden, Eric"}],"user_id":"15249","language":[{"iso":"eng"}],"_id":"41813","publication":"IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)","citation":{"chicago":"Shivarpatna Venkatesh, Ashwin Prasad, Jiawei Wang, Li Li, and Eric Bodden. “Enhancing Comprehension and Navigation in Jupyter Notebooks with Static Analysis.” In <i>IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)</i>, 2023.","short":"A.P. Shivarpatna Venkatesh, J. Wang, L. Li, E. Bodden, in: IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER), 2023.","ieee":"A. P. Shivarpatna Venkatesh, J. Wang, L. Li, and E. Bodden, “Enhancing Comprehension and Navigation in Jupyter Notebooks with Static Analysis,” 2023.","apa":"Shivarpatna Venkatesh, A. P., Wang, J., Li, L., &#38; Bodden, E. (2023). Enhancing Comprehension and Navigation in Jupyter Notebooks with Static Analysis. <i>IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)</i>.","bibtex":"@inproceedings{Shivarpatna Venkatesh_Wang_Li_Bodden_2023, title={Enhancing Comprehension and Navigation in Jupyter Notebooks with Static Analysis}, booktitle={IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)}, author={Shivarpatna Venkatesh, Ashwin Prasad and Wang, Jiawei and Li, Li and Bodden, Eric}, year={2023} }","ama":"Shivarpatna Venkatesh AP, Wang J, Li L, Bodden E. Enhancing Comprehension and Navigation in Jupyter Notebooks with Static Analysis. In: <i>IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)</i>. ; 2023.","mla":"Shivarpatna Venkatesh, Ashwin Prasad, et al. “Enhancing Comprehension and Navigation in Jupyter Notebooks with Static Analysis.” <i>IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)</i>, 2023."},"type":"conference","department":[{"_id":"76"}],"date_created":"2023-02-06T10:44:08Z"},{"department":[{"_id":"66"},{"_id":"534"}],"type":"journal_article","date_created":"2022-12-12T20:04:29Z","citation":{"apa":"Yigitbas, E., Klauke, J., Gottschalk, S., &#38; Engels, G. (2023). End-User Development of Interactive Web-Based Virtual Reality Scenes. <i>Journal on Computer Languages (COLA) </i>.","ieee":"E. Yigitbas, J. Klauke, S. Gottschalk, and G. Engels, “End-User Development of Interactive Web-Based Virtual Reality Scenes,” <i>Journal on Computer Languages (COLA) </i>, 2023.","chicago":"Yigitbas, Enes, Jonas Klauke, Sebastian Gottschalk, and Gregor Engels. “End-User Development of Interactive Web-Based Virtual Reality Scenes.” <i>Journal on Computer Languages (COLA) </i>, 2023.","short":"E. Yigitbas, J. Klauke, S. Gottschalk, G. Engels, Journal on Computer Languages (COLA)  (2023).","mla":"Yigitbas, Enes, et al. “End-User Development of Interactive Web-Based Virtual Reality Scenes.” <i>Journal on Computer Languages (COLA) </i>, Elsevier, 2023.","ama":"Yigitbas E, Klauke J, Gottschalk S, Engels G. End-User Development of Interactive Web-Based Virtual Reality Scenes. <i>Journal on Computer Languages (COLA) </i>. Published online 2023.","bibtex":"@article{Yigitbas_Klauke_Gottschalk_Engels_2023, title={End-User Development of Interactive Web-Based Virtual Reality Scenes}, journal={Journal on Computer Languages (COLA) }, publisher={Elsevier}, author={Yigitbas, Enes and Klauke, Jonas and Gottschalk, Sebastian and Engels, Gregor}, year={2023} }"},"publication":"Journal on Computer Languages (COLA) ","user_id":"8447","_id":"34402","language":[{"iso":"eng"}],"publisher":"Elsevier","date_updated":"2023-02-14T10:48:12Z","author":[{"id":"8447","full_name":"Yigitbas, Enes","orcid":"0000-0002-5967-833X","first_name":"Enes","last_name":"Yigitbas"},{"full_name":"Klauke, Jonas","first_name":"Jonas","orcid":"0000-0001-9160-9636","last_name":"Klauke","id":"40915"},{"last_name":"Gottschalk","first_name":"Sebastian","full_name":"Gottschalk, Sebastian","id":"47208"},{"id":"107","full_name":"Engels, Gregor","last_name":"Engels","first_name":"Gregor"}],"status":"public","title":"End-User Development of Interactive Web-Based Virtual Reality Scenes","year":"2023"},{"user_id":"8447","language":[{"iso":"eng"}],"_id":"33511","publisher":"ScholarSpace","date_updated":"2023-02-14T10:49:19Z","status":"public","year":"2023","title":"Enhancing Robot Programming through Digital Twin and Augmented Reality ","author":[{"full_name":"Yigitbas, Enes","first_name":"Enes","last_name":"Yigitbas","orcid":"0000-0002-5967-833X","id":"8447"},{"id":"107","full_name":"Engels, Gregor","first_name":"Gregor","last_name":"Engels"}],"type":"conference","department":[{"_id":"66"},{"_id":"534"}],"date_created":"2022-10-04T13:30:06Z","publication":"56th Hawaii International Conference on System Science (HICSS 2023) ","citation":{"short":"E. Yigitbas, G. Engels, in: 56th Hawaii International Conference on System Science (HICSS 2023) , ScholarSpace, 2023.","chicago":"Yigitbas, Enes, and Gregor Engels. “Enhancing Robot Programming through Digital Twin and Augmented Reality .” In <i>56th Hawaii International Conference on System Science (HICSS 2023) </i>. ScholarSpace, 2023.","ieee":"E. Yigitbas and G. Engels, “Enhancing Robot Programming through Digital Twin and Augmented Reality ,” 2023.","apa":"Yigitbas, E., &#38; Engels, G. (2023). Enhancing Robot Programming through Digital Twin and Augmented Reality . <i>56th Hawaii International Conference on System Science (HICSS 2023) </i>.","bibtex":"@inproceedings{Yigitbas_Engels_2023, title={Enhancing Robot Programming through Digital Twin and Augmented Reality }, booktitle={56th Hawaii International Conference on System Science (HICSS 2023) }, publisher={ScholarSpace}, author={Yigitbas, Enes and Engels, Gregor}, year={2023} }","ama":"Yigitbas E, Engels G. Enhancing Robot Programming through Digital Twin and Augmented Reality . In: <i>56th Hawaii International Conference on System Science (HICSS 2023) </i>. ScholarSpace; 2023.","mla":"Yigitbas, Enes, and Gregor Engels. “Enhancing Robot Programming through Digital Twin and Augmented Reality .” <i>56th Hawaii International Conference on System Science (HICSS 2023) </i>, ScholarSpace, 2023."}},{"language":[{"iso":"eng"}],"_id":"34401","user_id":"8447","author":[{"id":"8447","last_name":"Yigitbas","orcid":"0000-0002-5967-833X","first_name":"Enes","full_name":"Yigitbas, Enes"},{"full_name":"Krois, Sebastian","last_name":"Krois","first_name":"Sebastian"},{"id":"47208","full_name":"Gottschalk, Sebastian","first_name":"Sebastian","last_name":"Gottschalk"},{"first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor","id":"107"}],"title":"Towards Enhanced Guiding Mechanisms in VR Training through Process Mining","status":"public","year":"2023","date_updated":"2023-02-14T10:49:40Z","date_created":"2022-12-12T20:02:01Z","department":[{"_id":"66"},{"_id":"534"}],"type":"conference","citation":{"chicago":"Yigitbas, Enes, Sebastian Krois, Sebastian Gottschalk, and Gregor Engels. “Towards Enhanced Guiding Mechanisms in VR Training through Process Mining.” In <i>Proceedings of the 7th International Conference on Human Computer Interaction Theory and Applications (HUCAPP’23) </i>, 2023.","short":"E. Yigitbas, S. Krois, S. Gottschalk, G. Engels, in: Proceedings of the 7th International Conference on Human Computer Interaction Theory and Applications (HUCAPP’23) , 2023.","apa":"Yigitbas, E., Krois, S., Gottschalk, S., &#38; Engels, G. (2023). Towards Enhanced Guiding Mechanisms in VR Training through Process Mining. <i>Proceedings of the 7th International Conference on Human Computer Interaction Theory and Applications (HUCAPP’23) </i>.","ieee":"E. Yigitbas, S. Krois, S. Gottschalk, and G. Engels, “Towards Enhanced Guiding Mechanisms in VR Training through Process Mining,” 2023.","ama":"Yigitbas E, Krois S, Gottschalk S, Engels G. Towards Enhanced Guiding Mechanisms in VR Training through Process Mining. In: <i>Proceedings of the 7th International Conference on Human Computer Interaction Theory and Applications (HUCAPP’23) </i>. ; 2023.","bibtex":"@inproceedings{Yigitbas_Krois_Gottschalk_Engels_2023, title={Towards Enhanced Guiding Mechanisms in VR Training through Process Mining}, booktitle={Proceedings of the 7th International Conference on Human Computer Interaction Theory and Applications (HUCAPP’23) }, author={Yigitbas, Enes and Krois, Sebastian and Gottschalk, Sebastian and Engels, Gregor}, year={2023} }","mla":"Yigitbas, Enes, et al. “Towards Enhanced Guiding Mechanisms in VR Training through Process Mining.” <i>Proceedings of the 7th International Conference on Human Computer Interaction Theory and Applications (HUCAPP’23) </i>, 2023."},"publication":"Proceedings of the 7th International Conference on Human Computer Interaction Theory and Applications (HUCAPP'23) "},{"conference":{"location":"Brussels","start_date":"2022-12-13","name":"26th International Conference on Principles of Distributed Systems (OPODIS)","end_date":"2022-12-15"},"status":"public","editor":[{"full_name":"Hillel, Eshcar","first_name":"Eshcar","last_name":"Hillel"},{"full_name":"Palmieri, Roberto","first_name":"Roberto","last_name":"Palmieri"},{"full_name":"Riviére, Etienne","first_name":"Etienne","last_name":"Riviére"}],"volume":253,"user_id":"38705","_id":"34008","publisher":"Schloss Dagstuhl – Leibniz Zentrum für Informatik","page":"15:1–15:25","project":[{"_id":"106","name":"Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme"}],"citation":{"ama":"Castenow J, Harbig J, Jung D, Kling P, Knollmann T, Meyer auf der Heide F. A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility . In: Hillel E, Palmieri R, Riviére E, eds. <i>Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) </i>. Vol 253. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz Zentrum für Informatik; 2023:15:1–15:25. doi:<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2022.15\">10.4230/LIPIcs.OPODIS.2022.15</a>","bibtex":"@inproceedings{Castenow_Harbig_Jung_Kling_Knollmann_Meyer auf der Heide_2023, place={Brussels}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility }, volume={253}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2022.15\">10.4230/LIPIcs.OPODIS.2022.15</a>}, booktitle={Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) }, publisher={Schloss Dagstuhl – Leibniz Zentrum für Informatik}, author={Castenow, Jannik and Harbig, Jonas and Jung, Daniel and Kling, Peter and Knollmann, Till and Meyer auf der Heide, Friedhelm}, editor={Hillel, Eshcar and Palmieri, Roberto and Riviére, Etienne}, year={2023}, pages={15:1–15:25}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","mla":"Castenow, Jannik, et al. “A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility .” <i>Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) </i>, edited by Eshcar Hillel et al., vol. 253, Schloss Dagstuhl – Leibniz Zentrum für Informatik, 2023, p. 15:1–15:25, doi:<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2022.15\">10.4230/LIPIcs.OPODIS.2022.15</a>.","short":"J. Castenow, J. Harbig, D. Jung, P. Kling, T. Knollmann, F. Meyer auf der Heide, in: E. Hillel, R. Palmieri, E. Riviére (Eds.), Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) , Schloss Dagstuhl – Leibniz Zentrum für Informatik, Brussels, 2023, p. 15:1–15:25.","chicago":"Castenow, Jannik, Jonas Harbig, Daniel Jung, Peter Kling, Till Knollmann, and Friedhelm Meyer auf der Heide. “A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility .” In <i>Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) </i>, edited by Eshcar Hillel, Roberto Palmieri, and Etienne Riviére, 253:15:1–15:25. Leibniz International Proceedings in Informatics (LIPIcs). Brussels: Schloss Dagstuhl – Leibniz Zentrum für Informatik, 2023. <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2022.15\">https://doi.org/10.4230/LIPIcs.OPODIS.2022.15</a>.","apa":"Castenow, J., Harbig, J., Jung, D., Kling, P., Knollmann, T., &#38; Meyer auf der Heide, F. (2023). A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility . In E. Hillel, R. Palmieri, &#38; E. Riviére (Eds.), <i>Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) </i> (Vol. 253, p. 15:1–15:25). Schloss Dagstuhl – Leibniz Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2022.15\">https://doi.org/10.4230/LIPIcs.OPODIS.2022.15</a>","ieee":"J. Castenow, J. Harbig, D. Jung, P. Kling, T. Knollmann, and F. Meyer auf der Heide, “A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility ,” in <i>Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) </i>, Brussels, 2023, vol. 253, p. 15:1–15:25, doi: <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2022.15\">10.4230/LIPIcs.OPODIS.2022.15</a>."},"place":"Brussels","external_id":{"arxiv":["2206.07567 "]},"intvolume":"       253","date_updated":"2023-02-15T14:53:12Z","publication_status":"published","author":[{"id":"38705","last_name":"Castenow","first_name":"Jannik","full_name":"Castenow, Jannik"},{"full_name":"Harbig, Jonas","first_name":"Jonas","last_name":"Harbig","id":"47213"},{"id":"37827","last_name":"Jung","first_name":"Daniel","full_name":"Jung, Daniel"},{"first_name":"Peter","last_name":"Kling","full_name":"Kling, Peter"},{"last_name":"Knollmann","first_name":"Till","orcid":"0000-0003-2014-4696","full_name":"Knollmann, Till","id":"39241"},{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"publication_identifier":{"isbn":["978-3-95977-265-5"],"issn":["1868-8969"]},"title":"A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility ","year":"2023","doi":"10.4230/LIPIcs.OPODIS.2022.15","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","language":[{"iso":"eng"}],"publication":"Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) ","department":[{"_id":"63"}],"type":"conference","date_created":"2022-11-04T09:41:30Z"},{"abstract":[{"text":"The goal of this paper is to make a strong point for the usage of dynamical models when using reinforcement learning (RL) for feedback control of dynamical systems governed by partial differential equations (PDEs). To breach the gap between the immense promises we see in RL and the applicability in complex engineering systems, the main challenges are the massive requirements in terms of the training data, as well as the lack of performance guarantees. We present a solution for the first issue using a data-driven surrogate model in the form of a convolutional LSTM with actuation. We demonstrate that learning an actuated model in parallel to training the RL agent significantly reduces the total amount of required data sampled from the real system. Furthermore, we show that iteratively updating the model is of major importance to avoid biases in the RL training. Detailed ablation studies reveal the most important ingredients of the modeling process. We use the chaotic Kuramoto-Sivashinsky equation do demonstarte our findings.","lang":"eng"}],"citation":{"mla":"Werner, Stefan, and Sebastian Peitz. “Learning a Model Is Paramount for Sample Efficiency in Reinforcement  Learning Control of PDEs.” <i>ArXiv:2302.07160</i>, 2023.","bibtex":"@article{Werner_Peitz_2023, title={Learning a model is paramount for sample efficiency in reinforcement  learning control of PDEs}, journal={arXiv:2302.07160}, author={Werner, Stefan and Peitz, Sebastian}, year={2023} }","ama":"Werner S, Peitz S. Learning a model is paramount for sample efficiency in reinforcement  learning control of PDEs. <i>arXiv:230207160</i>. Published online 2023.","ieee":"S. Werner and S. Peitz, “Learning a model is paramount for sample efficiency in reinforcement  learning control of PDEs,” <i>arXiv:2302.07160</i>. 2023.","apa":"Werner, S., &#38; Peitz, S. (2023). Learning a model is paramount for sample efficiency in reinforcement  learning control of PDEs. In <i>arXiv:2302.07160</i>.","chicago":"Werner, Stefan, and Sebastian Peitz. “Learning a Model Is Paramount for Sample Efficiency in Reinforcement  Learning Control of PDEs.” <i>ArXiv:2302.07160</i>, 2023.","short":"S. Werner, S. Peitz, ArXiv:2302.07160 (2023)."},"publication":"arXiv:2302.07160","oa":"1","department":[{"_id":"655"}],"type":"preprint","date_created":"2023-02-15T20:57:20Z","external_id":{"arxiv":["2302.07160"]},"date_updated":"2023-02-15T20:58:33Z","author":[{"last_name":"Werner","first_name":"Stefan","full_name":"Werner, Stefan"},{"full_name":"Peitz, Sebastian","first_name":"Sebastian","orcid":"0000-0002-3389-793X","last_name":"Peitz","id":"47427"}],"title":"Learning a model is paramount for sample efficiency in reinforcement  learning control of PDEs","status":"public","year":"2023","user_id":"47427","_id":"42160","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/pdf/2302.07160","open_access":"1"}]},{"department":[{"_id":"623"},{"_id":"7"}],"type":"conference","date_created":"2022-06-13T14:40:46Z","abstract":[{"text":"Savitch's theorem states that NPSPACE computations can be simulated in\r\nPSPACE. We initiate the study of a quantum analogue of NPSPACE, denoted\r\nStreaming-QCMASPACE (SQCMASPACE), where an exponentially long classical proof\r\nis streamed to a poly-space quantum verifier. Besides two main results, we also\r\nshow that a quantum analogue of Savitch's theorem is unlikely to hold, as\r\nSQCMASPACE=NEXP. For completeness, we introduce Streaming-QMASPACE (SQMASPACE)\r\nwith an exponentially long streamed quantum proof, and show SQMASPACE=QMA_EXP\r\n(quantum analogue of NEXP). Our first main result shows, in contrast to the\r\nclassical setting, the solution space of a quantum constraint satisfaction\r\nproblem (i.e. a local Hamiltonian) is always connected when exponentially long\r\nproofs are permitted. For this, we show how to simulate any Lipschitz\r\ncontinuous path on the unit hypersphere via a sequence of local unitary gates,\r\nat the expense of blowing up the circuit size. This shows quantum\r\nerror-correcting codes can be unable to detect one codeword erroneously\r\nevolving to another if the evolution happens sufficiently slowly, and answers\r\nan open question of [Gharibian, Sikora, ICALP 2015] regarding the Ground State\r\nConnectivity problem. Our second main result is that any SQCMASPACE computation\r\ncan be embedded into \"unentanglement\", i.e. into a quantum constraint\r\nsatisfaction problem with unentangled provers. Formally, we show how to embed\r\nSQCMASPACE into the Sparse Separable Hamiltonian problem of [Chailloux,\r\nSattath, CCC 2012] (QMA(2)-complete for 1/poly promise gap), at the expense of\r\nscaling the promise gap with the streamed proof size. As a corollary, we obtain\r\nthe first systematic construction for obtaining QMA(2)-type upper bounds on\r\narbitrary multi-prover interactive proof systems, where the QMA(2) promise gap\r\nscales exponentially with the number of bits of communication in the\r\ninteractive proof.","lang":"eng"}],"publication":"14th Innovations in Theoretical Computer Science (ITCS)","doi":"10.4230/LIPIcs.ITCS.2023.53","language":[{"iso":"eng"}],"intvolume":"       251","publication_status":"published","date_updated":"2023-02-28T11:06:55Z","author":[{"last_name":"Gharibian","orcid":"0000-0002-9992-3379","first_name":"Sevag","full_name":"Gharibian, Sevag","id":"71541"},{"full_name":"Rudolph, Dorian","last_name":"Rudolph","first_name":"Dorian"}],"title":"Quantum space, ground space traversal, and how to embed multi-prover  interactive proofs into unentanglement","year":"2023","external_id":{"arxiv":["2206.05243"]},"citation":{"mla":"Gharibian, Sevag, and Dorian Rudolph. “Quantum Space, Ground Space Traversal, and How to Embed Multi-Prover  Interactive Proofs into Unentanglement.” <i>14th Innovations in Theoretical Computer Science (ITCS)</i>, vol. 251, 2023, p. 53:1-53:23, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2023.53\">10.4230/LIPIcs.ITCS.2023.53</a>.","bibtex":"@inproceedings{Gharibian_Rudolph_2023, title={Quantum space, ground space traversal, and how to embed multi-prover  interactive proofs into unentanglement}, volume={251}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2023.53\">10.4230/LIPIcs.ITCS.2023.53</a>}, booktitle={14th Innovations in Theoretical Computer Science (ITCS)}, author={Gharibian, Sevag and Rudolph, Dorian}, year={2023}, pages={53:1-53:23} }","ama":"Gharibian S, Rudolph D. Quantum space, ground space traversal, and how to embed multi-prover  interactive proofs into unentanglement. In: <i>14th Innovations in Theoretical Computer Science (ITCS)</i>. Vol 251. ; 2023:53:1-53:23. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2023.53\">10.4230/LIPIcs.ITCS.2023.53</a>","ieee":"S. Gharibian and D. Rudolph, “Quantum space, ground space traversal, and how to embed multi-prover  interactive proofs into unentanglement,” in <i>14th Innovations in Theoretical Computer Science (ITCS)</i>, 2023, vol. 251, p. 53:1-53:23, doi: <a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2023.53\">10.4230/LIPIcs.ITCS.2023.53</a>.","apa":"Gharibian, S., &#38; Rudolph, D. (2023). Quantum space, ground space traversal, and how to embed multi-prover  interactive proofs into unentanglement. <i>14th Innovations in Theoretical Computer Science (ITCS)</i>, <i>251</i>, 53:1-53:23. <a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2023.53\">https://doi.org/10.4230/LIPIcs.ITCS.2023.53</a>","chicago":"Gharibian, Sevag, and Dorian Rudolph. “Quantum Space, Ground Space Traversal, and How to Embed Multi-Prover  Interactive Proofs into Unentanglement.” In <i>14th Innovations in Theoretical Computer Science (ITCS)</i>, 251:53:1-53:23, 2023. <a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2023.53\">https://doi.org/10.4230/LIPIcs.ITCS.2023.53</a>.","short":"S. Gharibian, D. Rudolph, in: 14th Innovations in Theoretical Computer Science (ITCS), 2023, p. 53:1-53:23."},"volume":251,"user_id":"71541","_id":"31872","page":"53:1-53:23","status":"public"},{"user_id":"47427","volume":85,"page":"709-741","_id":"27426","status":"public","oa":"1","citation":{"mla":"Gebken, Bennet, et al. “On the Structure of Regularization Paths for Piecewise Differentiable Regularization Terms.” <i>Journal of Global Optimization</i>, vol. 85, no. 3, 2023, pp. 709–41, doi:<a href=\"https://doi.org/10.1007/s10898-022-01223-2\">10.1007/s10898-022-01223-2</a>.","ama":"Gebken B, Bieker K, Peitz S. On the structure of regularization paths for piecewise differentiable regularization terms. <i>Journal of Global Optimization</i>. 2023;85(3):709-741. doi:<a href=\"https://doi.org/10.1007/s10898-022-01223-2\">10.1007/s10898-022-01223-2</a>","bibtex":"@article{Gebken_Bieker_Peitz_2023, title={On the structure of regularization paths for piecewise differentiable regularization terms}, volume={85}, DOI={<a href=\"https://doi.org/10.1007/s10898-022-01223-2\">10.1007/s10898-022-01223-2</a>}, number={3}, journal={Journal of Global Optimization}, author={Gebken, Bennet and Bieker, Katharina and Peitz, Sebastian}, year={2023}, pages={709–741} }","apa":"Gebken, B., Bieker, K., &#38; Peitz, S. (2023). On the structure of regularization paths for piecewise differentiable regularization terms. <i>Journal of Global Optimization</i>, <i>85</i>(3), 709–741. <a href=\"https://doi.org/10.1007/s10898-022-01223-2\">https://doi.org/10.1007/s10898-022-01223-2</a>","ieee":"B. Gebken, K. Bieker, and S. Peitz, “On the structure of regularization paths for piecewise differentiable regularization terms,” <i>Journal of Global Optimization</i>, vol. 85, no. 3, pp. 709–741, 2023, doi: <a href=\"https://doi.org/10.1007/s10898-022-01223-2\">10.1007/s10898-022-01223-2</a>.","chicago":"Gebken, Bennet, Katharina Bieker, and Sebastian Peitz. “On the Structure of Regularization Paths for Piecewise Differentiable Regularization Terms.” <i>Journal of Global Optimization</i> 85, no. 3 (2023): 709–41. <a href=\"https://doi.org/10.1007/s10898-022-01223-2\">https://doi.org/10.1007/s10898-022-01223-2</a>.","short":"B. Gebken, K. Bieker, S. Peitz, Journal of Global Optimization 85 (2023) 709–741."},"doi":"10.1007/s10898-022-01223-2","main_file_link":[{"open_access":"1","url":"https://link.springer.com/content/pdf/10.1007/s10898-022-01223-2.pdf"}],"language":[{"iso":"eng"}],"date_updated":"2023-03-11T17:16:33Z","intvolume":"        85","title":"On the structure of regularization paths for piecewise differentiable regularization terms","year":"2023","author":[{"id":"32643","full_name":"Gebken, Bennet","first_name":"Bennet","last_name":"Gebken"},{"id":"32829","full_name":"Bieker, Katharina","last_name":"Bieker","first_name":"Katharina"},{"id":"47427","full_name":"Peitz, Sebastian","last_name":"Peitz","first_name":"Sebastian","orcid":"0000-0002-3389-793X"}],"type":"journal_article","department":[{"_id":"101"},{"_id":"655"}],"date_created":"2021-11-15T09:24:59Z","abstract":[{"lang":"eng","text":"Regularization is used in many different areas of optimization when solutions\r\nare sought which not only minimize a given function, but also possess a certain\r\ndegree of regularity. Popular applications are image denoising, sparse\r\nregression and machine learning. Since the choice of the regularization\r\nparameter is crucial but often difficult, path-following methods are used to\r\napproximate the entire regularization path, i.e., the set of all possible\r\nsolutions for all regularization parameters. Due to their nature, the\r\ndevelopment of these methods requires structural results about the\r\nregularization path. The goal of this article is to derive these results for\r\nthe case of a smooth objective function which is penalized by a piecewise\r\ndifferentiable regularization term. We do this by treating regularization as a\r\nmultiobjective optimization problem. Our results suggest that even in this\r\ngeneral case, the regularization path is piecewise smooth. Moreover, our theory\r\nallows for a classification of the nonsmooth features that occur in between\r\nsmooth parts. This is demonstrated in two applications, namely support-vector\r\nmachines and exact penalty methods."}],"publication":"Journal of Global Optimization","issue":"3"},{"intvolume":"       950","date_updated":"2023-03-27T09:55:04Z","author":[{"full_name":"Götte, Thorsten","last_name":"Götte","first_name":"Thorsten","id":"34727"},{"full_name":"Kolb, Christina","first_name":"Christina","last_name":"Kolb"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"},{"last_name":"Werthmann","first_name":"Julian","full_name":"Werthmann, Julian","id":"50024"}],"year":"2023","status":"public","title":"Beep-and-Sleep: Message and Energy Efficient Set Cover","volume":950,"doi":"10.1016/j.tcs.2023.113756","user_id":"15504","_id":"43109","language":[{"iso":"eng"}],"page":"113756","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - A1: SFB 901 - Subproject A1","_id":"5"}],"citation":{"ama":"Götte T, Kolb C, Scheideler C, Werthmann J. Beep-and-Sleep: Message and Energy Efficient Set Cover. <i>Theor Comput Sci</i>. 2023;950:113756. doi:<a href=\"https://doi.org/10.1016/j.tcs.2023.113756\">10.1016/j.tcs.2023.113756</a>","bibtex":"@article{Götte_Kolb_Scheideler_Werthmann_2023, title={Beep-and-Sleep: Message and Energy Efficient Set Cover}, volume={950}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2023.113756\">10.1016/j.tcs.2023.113756</a>}, journal={Theor. Comput. Sci.}, author={Götte, Thorsten and Kolb, Christina and Scheideler, Christian and Werthmann, Julian}, year={2023}, pages={113756} }","mla":"Götte, Thorsten, et al. “Beep-and-Sleep: Message and Energy Efficient Set Cover.” <i>Theor. Comput. Sci.</i>, vol. 950, 2023, p. 113756, doi:<a href=\"https://doi.org/10.1016/j.tcs.2023.113756\">10.1016/j.tcs.2023.113756</a>.","chicago":"Götte, Thorsten, Christina Kolb, Christian Scheideler, and Julian Werthmann. “Beep-and-Sleep: Message and Energy Efficient Set Cover.” <i>Theor. Comput. Sci.</i> 950 (2023): 113756. <a href=\"https://doi.org/10.1016/j.tcs.2023.113756\">https://doi.org/10.1016/j.tcs.2023.113756</a>.","short":"T. Götte, C. Kolb, C. Scheideler, J. Werthmann, Theor. Comput. Sci. 950 (2023) 113756.","apa":"Götte, T., Kolb, C., Scheideler, C., &#38; Werthmann, J. (2023). Beep-and-Sleep: Message and Energy Efficient Set Cover. <i>Theor. Comput. Sci.</i>, <i>950</i>, 113756. <a href=\"https://doi.org/10.1016/j.tcs.2023.113756\">https://doi.org/10.1016/j.tcs.2023.113756</a>","ieee":"T. Götte, C. Kolb, C. Scheideler, and J. Werthmann, “Beep-and-Sleep: Message and Energy Efficient Set Cover,” <i>Theor. Comput. Sci.</i>, vol. 950, p. 113756, 2023, doi: <a href=\"https://doi.org/10.1016/j.tcs.2023.113756\">10.1016/j.tcs.2023.113756</a>."},"publication":"Theor. Comput. Sci.","department":[{"_id":"79"}],"type":"journal_article","date_created":"2023-03-27T07:45:44Z"},{"user_id":"8447","publisher":"Springer","_id":"43424","language":[{"iso":"eng"}],"date_updated":"2023-04-06T07:26:55Z","author":[{"orcid":"0000-0002-5967-833X","last_name":"Yigitbas","first_name":"Enes","full_name":"Yigitbas, Enes","id":"8447"},{"full_name":"Nowosad, Alexander","first_name":"Alexander","last_name":"Nowosad"},{"id":"107","full_name":"Engels, Gregor","last_name":"Engels","first_name":"Gregor"}],"year":"2023","title":"Supporting Construction and Architectural Visualization through BIM and AR/VR: A Systematic Literature Review","status":"public","department":[{"_id":"66"},{"_id":"534"}],"type":"conference","date_created":"2023-04-06T07:26:07Z","citation":{"ieee":"E. Yigitbas, A. Nowosad, and G. Engels, “Supporting Construction and Architectural Visualization through BIM and AR/VR: A Systematic Literature Review,” 2023.","apa":"Yigitbas, E., Nowosad, A., &#38; Engels, G. (2023). Supporting Construction and Architectural Visualization through BIM and AR/VR: A Systematic Literature Review. <i>Proceedings of the 19th IFIP TC13 International Conference on Human-Computer Interaction (INTERACT 2023)</i>.","chicago":"Yigitbas, Enes, Alexander Nowosad, and Gregor Engels. “Supporting Construction and Architectural Visualization through BIM and AR/VR: A Systematic Literature Review.” In <i>Proceedings of the 19th IFIP TC13 International Conference on Human-Computer Interaction (INTERACT 2023)</i>. Springer, 2023.","short":"E. Yigitbas, A. Nowosad, G. Engels, in: Proceedings of the 19th IFIP TC13 International Conference on Human-Computer Interaction (INTERACT 2023), Springer, 2023.","mla":"Yigitbas, Enes, et al. “Supporting Construction and Architectural Visualization through BIM and AR/VR: A Systematic Literature Review.” <i>Proceedings of the 19th IFIP TC13 International Conference on Human-Computer Interaction (INTERACT 2023)</i>, Springer, 2023.","bibtex":"@inproceedings{Yigitbas_Nowosad_Engels_2023, title={Supporting Construction and Architectural Visualization through BIM and AR/VR: A Systematic Literature Review}, booktitle={Proceedings of the 19th IFIP TC13 International Conference on Human-Computer Interaction (INTERACT 2023)}, publisher={Springer}, author={Yigitbas, Enes and Nowosad, Alexander and Engels, Gregor}, year={2023} }","ama":"Yigitbas E, Nowosad A, Engels G. Supporting Construction and Architectural Visualization through BIM and AR/VR: A Systematic Literature Review. In: <i>Proceedings of the 19th IFIP TC13 International Conference on Human-Computer Interaction (INTERACT 2023)</i>. Springer; 2023."},"publication":"Proceedings of the 19th IFIP TC13 International Conference on Human-Computer Interaction (INTERACT 2023)"},{"abstract":[{"lang":"eng","text":"We present an approach for guaranteed constraint satisfaction by means of data-based optimal control, where the model is unknown and has to be obtained from measurement data. To this end, we utilize the Koopman framework and an eDMD-based bilinear surrogate modeling approach for control systems to show an error bound on predicted observables, i.e., functions of the state. This result is then applied to the constraints of the optimal control problem to show that satisfaction of tightened constraints in the purely data-based surrogate model implies constraint satisfaction for the original system."}],"issue":"1","publication":"IFAC-PapersOnLine","department":[{"_id":"655"}],"type":"conference","date_created":"2022-02-25T17:14:58Z","intvolume":"        56","publication_status":"published","date_updated":"2023-03-17T15:55:33Z","author":[{"first_name":"Manuel","last_name":"Schaller","full_name":"Schaller, Manuel"},{"first_name":"Karl","last_name":"Worthmann","full_name":"Worthmann, Karl"},{"last_name":"Philipp","first_name":"Friedrich","full_name":"Philipp, Friedrich"},{"last_name":"Peitz","orcid":"0000-0002-3389-793X","first_name":"Sebastian","full_name":"Peitz, Sebastian","id":"47427"},{"first_name":"Feliks","orcid":"0000-0003-2444-7889","last_name":"Nüske","full_name":"Nüske, Feliks","id":"81513"}],"title":"Towards reliable data-based optimal and predictive control using extended DMD","year":"2023","doi":"10.1016/j.ifacol.2023.02.029","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://www.sciencedirect.com/science/article/pii/S2405896323002173/pdf?md5=164ee9a0343a1bd0e0b9ac4187e44b77&pid=1-s2.0-S2405896323002173-main.pdf"}],"citation":{"mla":"Schaller, Manuel, et al. “Towards Reliable Data-Based Optimal and Predictive Control Using Extended DMD.” <i>IFAC-PapersOnLine</i>, vol. 56, no. 1, 2023, pp. 169–74, doi:<a href=\"https://doi.org/10.1016/j.ifacol.2023.02.029\">10.1016/j.ifacol.2023.02.029</a>.","ama":"Schaller M, Worthmann K, Philipp F, Peitz S, Nüske F. Towards reliable data-based optimal and predictive control using extended DMD. In: <i>IFAC-PapersOnLine</i>. Vol 56. ; 2023:169-174. doi:<a href=\"https://doi.org/10.1016/j.ifacol.2023.02.029\">10.1016/j.ifacol.2023.02.029</a>","bibtex":"@inproceedings{Schaller_Worthmann_Philipp_Peitz_Nüske_2023, title={Towards reliable data-based optimal and predictive control using extended DMD}, volume={56}, DOI={<a href=\"https://doi.org/10.1016/j.ifacol.2023.02.029\">10.1016/j.ifacol.2023.02.029</a>}, number={1}, booktitle={IFAC-PapersOnLine}, author={Schaller, Manuel and Worthmann, Karl and Philipp, Friedrich and Peitz, Sebastian and Nüske, Feliks}, year={2023}, pages={169–174} }","apa":"Schaller, M., Worthmann, K., Philipp, F., Peitz, S., &#38; Nüske, F. (2023). Towards reliable data-based optimal and predictive control using extended DMD. <i>IFAC-PapersOnLine</i>, <i>56</i>(1), 169–174. <a href=\"https://doi.org/10.1016/j.ifacol.2023.02.029\">https://doi.org/10.1016/j.ifacol.2023.02.029</a>","ieee":"M. Schaller, K. Worthmann, F. Philipp, S. Peitz, and F. Nüske, “Towards reliable data-based optimal and predictive control using extended DMD,” in <i>IFAC-PapersOnLine</i>, 2023, vol. 56, no. 1, pp. 169–174, doi: <a href=\"https://doi.org/10.1016/j.ifacol.2023.02.029\">10.1016/j.ifacol.2023.02.029</a>.","short":"M. Schaller, K. Worthmann, F. Philipp, S. Peitz, F. Nüske, in: IFAC-PapersOnLine, 2023, pp. 169–174.","chicago":"Schaller, Manuel, Karl Worthmann, Friedrich Philipp, Sebastian Peitz, and Feliks Nüske. “Towards Reliable Data-Based Optimal and Predictive Control Using Extended DMD.” In <i>IFAC-PapersOnLine</i>, 56:169–74, 2023. <a href=\"https://doi.org/10.1016/j.ifacol.2023.02.029\">https://doi.org/10.1016/j.ifacol.2023.02.029</a>."},"oa":"1","external_id":{"arxiv":["2202.09084"]},"conference":{"name":"12th IFAC Symposium on Nonlinear Control Systems (NOLCOS)"},"status":"public","volume":56,"user_id":"47427","_id":"30125","page":"169-174"},{"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - C4: SFB 901 - Subproject C4","_id":"16"}],"citation":{"short":"M. Maack, Operations Research Letters 51 (2023) 220–225.","chicago":"Maack, Marten. “Online Load Balancing on Uniform Machines with Limited Migration.” <i>Operations Research Letters</i> 51, no. 3 (2023): 220–25. <a href=\"https://doi.org/10.1016/j.orl.2023.02.013\">https://doi.org/10.1016/j.orl.2023.02.013</a>.","apa":"Maack, M. (2023). Online load balancing on uniform machines with limited migration. <i>Operations Research Letters</i>, <i>51</i>(3), 220–225. <a href=\"https://doi.org/10.1016/j.orl.2023.02.013\">https://doi.org/10.1016/j.orl.2023.02.013</a>","ieee":"M. Maack, “Online load balancing on uniform machines with limited migration,” <i>Operations Research Letters</i>, vol. 51, no. 3, pp. 220–225, 2023, doi: <a href=\"https://doi.org/10.1016/j.orl.2023.02.013\">10.1016/j.orl.2023.02.013</a>.","ama":"Maack M. Online load balancing on uniform machines with limited migration. <i>Operations Research Letters</i>. 2023;51(3):220-225. doi:<a href=\"https://doi.org/10.1016/j.orl.2023.02.013\">10.1016/j.orl.2023.02.013</a>","bibtex":"@article{Maack_2023, title={Online load balancing on uniform machines with limited migration}, volume={51}, DOI={<a href=\"https://doi.org/10.1016/j.orl.2023.02.013\">10.1016/j.orl.2023.02.013</a>}, number={3}, journal={Operations Research Letters}, publisher={Elsevier BV}, author={Maack, Marten}, year={2023}, pages={220–225} }","mla":"Maack, Marten. “Online Load Balancing on Uniform Machines with Limited Migration.” <i>Operations Research Letters</i>, vol. 51, no. 3, Elsevier BV, 2023, pp. 220–25, doi:<a href=\"https://doi.org/10.1016/j.orl.2023.02.013\">10.1016/j.orl.2023.02.013</a>."},"volume":51,"user_id":"88252","publisher":"Elsevier BV","_id":"44077","page":"220-225","status":"public","department":[{"_id":"63"}],"type":"journal_article","keyword":["Applied Mathematics","Industrial and Manufacturing Engineering","Management Science and Operations Research","Software"],"date_created":"2023-04-20T08:59:14Z","publication":"Operations Research Letters","issue":"3","doi":"10.1016/j.orl.2023.02.013","language":[{"iso":"eng"}],"intvolume":"        51","date_updated":"2023-04-21T07:53:42Z","author":[{"last_name":"Maack","first_name":"Marten","full_name":"Maack, Marten"}],"publication_identifier":{"issn":["0167-6377"]},"year":"2023","title":"Online load balancing on uniform machines with limited migration"},{"author":[{"full_name":"Schürmann, Patrick","first_name":"Patrick","last_name":"Schürmann"}],"title":" A Formal Comparison of Advanced Digital Signature Primitives","status":"public","year":"2023","has_accepted_license":"1","date_updated":"2023-04-25T22:43:21Z","language":[{"iso":"eng"}],"_id":"43374","user_id":"41047","ddc":["000"],"citation":{"chicago":"Schürmann, Patrick. <i> A Formal Comparison of Advanced Digital Signature Primitives</i>, 2023.","short":"P. Schürmann,  A Formal Comparison of Advanced Digital Signature Primitives, 2023.","apa":"Schürmann, P. (2023). <i> A Formal Comparison of Advanced Digital Signature Primitives</i>.","ieee":"P. Schürmann, <i> A Formal Comparison of Advanced Digital Signature Primitives</i>. 2023.","ama":"Schürmann P. <i> A Formal Comparison of Advanced Digital Signature Primitives</i>.; 2023.","bibtex":"@book{Schürmann_2023, title={ A Formal Comparison of Advanced Digital Signature Primitives}, author={Schürmann, Patrick}, year={2023} }","mla":"Schürmann, Patrick. <i> A Formal Comparison of Advanced Digital Signature Primitives</i>. 2023."},"supervisor":[{"id":"23","first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes"}],"file_date_updated":"2023-04-25T10:49:36Z","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"}],"date_created":"2023-04-03T14:07:32Z","file":[{"file_size":1367369,"access_level":"open_access","file_name":"masters_thesis_schuermann.pdf","date_updated":"2023-04-25T10:49:36Z","relation":"main_file","content_type":"application/pdf","file_id":"44177","title":" A Formal Comparison of Advanced Digital Signature Primitives","creator":"bhenrik","date_created":"2023-04-25T10:49:36Z"}],"department":[{"_id":"64"}],"oa":"1","type":"mastersthesis"},{"page":"54:1-54:21","_id":"20841","user_id":"71541","volume":254,"status":"public","external_id":{"arxiv":["2012.12717"]},"oa":"1","citation":{"ama":"Gharibian S, Watson J, Bausch J. The Complexity of Translationally Invariant Problems beyond Ground State Energies. In: <i>Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science (STACS)</i>. Vol 254. ; 2023:54:1-54:21. doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2023.54\">https://doi.org/10.4230/LIPIcs.STACS.2023.54</a>","bibtex":"@inproceedings{Gharibian_Watson_Bausch_2023, title={The Complexity of Translationally Invariant Problems beyond Ground State Energies}, volume={254}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2023.54\">https://doi.org/10.4230/LIPIcs.STACS.2023.54</a>}, booktitle={Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science (STACS)}, author={Gharibian, Sevag and Watson, James and Bausch, Johannes}, year={2023}, pages={54:1-54:21} }","mla":"Gharibian, Sevag, et al. “The Complexity of Translationally Invariant Problems beyond Ground State Energies.” <i>Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science (STACS)</i>, vol. 254, 2023, p. 54:1-54:21, doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2023.54\">https://doi.org/10.4230/LIPIcs.STACS.2023.54</a>.","chicago":"Gharibian, Sevag, James Watson, and Johannes Bausch. “The Complexity of Translationally Invariant Problems beyond Ground State Energies.” In <i>Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science (STACS)</i>, 254:54:1-54:21, 2023. <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2023.54\">https://doi.org/10.4230/LIPIcs.STACS.2023.54</a>.","short":"S. Gharibian, J. Watson, J. Bausch, in: Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science (STACS), 2023, p. 54:1-54:21.","apa":"Gharibian, S., Watson, J., &#38; Bausch, J. (2023). The Complexity of Translationally Invariant Problems beyond Ground State Energies. <i>Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science (STACS)</i>, <i>254</i>, 54:1-54:21. <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2023.54\">https://doi.org/10.4230/LIPIcs.STACS.2023.54</a>","ieee":"S. Gharibian, J. Watson, and J. Bausch, “The Complexity of Translationally Invariant Problems beyond Ground State Energies,” in <i>Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science (STACS)</i>, 2023, vol. 254, p. 54:1-54:21, doi: <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2023.54\">https://doi.org/10.4230/LIPIcs.STACS.2023.54</a>."},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2012.12717"}],"language":[{"iso":"eng"}],"doi":"https://doi.org/10.4230/LIPIcs.STACS.2023.54","year":"2023","title":"The Complexity of Translationally Invariant Problems beyond Ground State Energies","author":[{"full_name":"Gharibian, Sevag","last_name":"Gharibian","first_name":"Sevag","orcid":"0000-0002-9992-3379","id":"71541"},{"full_name":"Watson, James","last_name":"Watson","first_name":"James"},{"first_name":"Johannes","last_name":"Bausch","full_name":"Bausch, Johannes"}],"publication_status":"published","date_updated":"2023-05-04T17:51:23Z","intvolume":"       254","date_created":"2020-12-24T14:15:09Z","type":"conference","department":[{"_id":"623"},{"_id":"7"}],"publication":"Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science (STACS)"},{"date_updated":"2023-05-10T13:52:14Z","author":[{"last_name":"Ahmed","orcid":"0000-0002-1837-2254","first_name":"Qazi Arbab","full_name":"Ahmed, Qazi Arbab","id":"72764"},{"last_name":"Awais","first_name":"Muhammad","full_name":"Awais, Muhammad"},{"last_name":"Platzner","first_name":"Marco","full_name":"Platzner, Marco","id":"398"}],"year":"2023","title":"MAAS: Hiding Trojans in Approximate Circuits","language":[{"iso":"eng"}],"publication":"The 24th International Symposium on Quality Electronic Design (ISQED'23), San Francisco, Califorina USA","department":[{"_id":"78"}],"type":"conference","date_created":"2023-04-26T13:04:56Z","file":[{"creator":"qazi","date_created":"2023-04-26T13:03:54Z","file_name":"s4Bp4-041.pdf","access_level":"open_access","file_size":614626,"relation":"main_file","date_updated":"2023-05-10T13:52:14Z","file_id":"44196","content_type":"application/pdf"}],"has_accepted_license":"1","conference":{"location":"San Fransico CA 94023-0607, USA","start_date":"2023-04-05","name":"The 24th International Symposium on Quality Electronic Design (ISQED'23)","end_date":"2023-04-07"},"status":"public","user_id":"72764","ddc":["620"],"_id":"44194","project":[{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"_id":"12","name":"SFB 901 - B4: SFB 901 - Subproject B4"},{"_id":"1","name":"SFB 901: SFB 901"}],"citation":{"apa":"Ahmed, Q. A., Awais, M., &#38; Platzner, M. (2023). MAAS: Hiding Trojans in Approximate Circuits. <i>The 24th International Symposium on Quality Electronic Design (ISQED’23), San Francisco, Califorina USA</i>. The 24th International Symposium on Quality Electronic Design (ISQED’23), San Fransico CA 94023-0607, USA.","ieee":"Q. A. Ahmed, M. Awais, and M. Platzner, “MAAS: Hiding Trojans in Approximate Circuits,” presented at the The 24th International Symposium on Quality Electronic Design (ISQED’23), San Fransico CA 94023-0607, USA, 2023.","chicago":"Ahmed, Qazi Arbab, Muhammad Awais, and Marco Platzner. “MAAS: Hiding Trojans in Approximate Circuits.” In <i>The 24th International Symposium on Quality Electronic Design (ISQED’23), San Francisco, Califorina USA</i>, 2023.","short":"Q.A. Ahmed, M. Awais, M. Platzner, in: The 24th International Symposium on Quality Electronic Design (ISQED’23), San Francisco, Califorina USA, 2023.","mla":"Ahmed, Qazi Arbab, et al. “MAAS: Hiding Trojans in Approximate Circuits.” <i>The 24th International Symposium on Quality Electronic Design (ISQED’23), San Francisco, Califorina USA</i>, 2023.","ama":"Ahmed QA, Awais M, Platzner M. MAAS: Hiding Trojans in Approximate Circuits. In: <i>The 24th International Symposium on Quality Electronic Design (ISQED’23), San Francisco, Califorina USA</i>. ; 2023.","bibtex":"@inproceedings{Ahmed_Awais_Platzner_2023, title={MAAS: Hiding Trojans in Approximate Circuits}, booktitle={The 24th International Symposium on Quality Electronic Design (ISQED’23), San Francisco, Califorina USA}, author={Ahmed, Qazi Arbab and Awais, Muhammad and Platzner, Marco}, year={2023} }"},"file_date_updated":"2023-05-10T13:52:14Z","oa":"1"},{"user_id":"15504","_id":"44735","language":[{"iso":"eng"}],"date_updated":"2023-05-11T05:51:15Z","author":[{"full_name":"Schweichhart, Jonas","last_name":"Schweichhart","first_name":"Jonas"}],"year":"2023","title":"Minimum Edge Cuts in Overlay Networks","status":"public","department":[{"_id":"79"}],"type":"mastersthesis","date_created":"2023-05-11T05:50:41Z","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Subproject A1"}],"supervisor":[{"full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian","id":"20792"}],"citation":{"mla":"Schweichhart, Jonas. <i>Minimum Edge Cuts in Overlay Networks</i>. 2023.","bibtex":"@book{Schweichhart_2023, title={Minimum Edge Cuts in Overlay Networks}, author={Schweichhart, Jonas}, year={2023} }","ama":"Schweichhart J. <i>Minimum Edge Cuts in Overlay Networks</i>.; 2023.","ieee":"J. Schweichhart, <i>Minimum Edge Cuts in Overlay Networks</i>. 2023.","apa":"Schweichhart, J. (2023). <i>Minimum Edge Cuts in Overlay Networks</i>.","short":"J. Schweichhart, Minimum Edge Cuts in Overlay Networks, 2023.","chicago":"Schweichhart, Jonas. <i>Minimum Edge Cuts in Overlay Networks</i>, 2023."}},{"user_id":"38705","doi":"10.1007/978-3-031-30448-4_1","language":[{"iso":"eng"}],"_id":"44769","publisher":"Springer International Publishing","publication_status":"published","date_updated":"2023-05-11T13:14:43Z","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783031304477","9783031304484"]},"author":[{"full_name":"Castenow, Jannik","first_name":"Jannik","last_name":"Castenow","id":"38705"},{"first_name":"Jonas","last_name":"Harbig","full_name":"Harbig, Jonas","id":"47213"},{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"status":"public","title":"Unifying Gathering Protocols for Swarms of Mobile Robots","year":"2023","department":[{"_id":"63"}],"type":"book_chapter","date_created":"2023-05-11T13:13:45Z","place":"Cham","project":[{"name":"Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme","_id":"106"}],"citation":{"ieee":"J. Castenow, J. Harbig, and F. Meyer auf der Heide, “Unifying Gathering Protocols for Swarms of Mobile Robots,” in <i>Lecture Notes in Computer Science</i>, Cham: Springer International Publishing, 2023.","apa":"Castenow, J., Harbig, J., &#38; Meyer auf der Heide, F. (2023). Unifying Gathering Protocols for Swarms of Mobile Robots. In <i>Lecture Notes in Computer Science</i>. Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-031-30448-4_1\">https://doi.org/10.1007/978-3-031-30448-4_1</a>","chicago":"Castenow, Jannik, Jonas Harbig, and Friedhelm Meyer auf der Heide. “Unifying Gathering Protocols for Swarms of Mobile Robots.” In <i>Lecture Notes in Computer Science</i>. Cham: Springer International Publishing, 2023. <a href=\"https://doi.org/10.1007/978-3-031-30448-4_1\">https://doi.org/10.1007/978-3-031-30448-4_1</a>.","short":"J. Castenow, J. Harbig, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Springer International Publishing, Cham, 2023.","mla":"Castenow, Jannik, et al. “Unifying Gathering Protocols for Swarms of Mobile Robots.” <i>Lecture Notes in Computer Science</i>, Springer International Publishing, 2023, doi:<a href=\"https://doi.org/10.1007/978-3-031-30448-4_1\">10.1007/978-3-031-30448-4_1</a>.","bibtex":"@inbook{Castenow_Harbig_Meyer auf der Heide_2023, place={Cham}, title={Unifying Gathering Protocols for Swarms of Mobile Robots}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-30448-4_1\">10.1007/978-3-031-30448-4_1</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer International Publishing}, author={Castenow, Jannik and Harbig, Jonas and Meyer auf der Heide, Friedhelm}, year={2023} }","ama":"Castenow J, Harbig J, Meyer auf der Heide F. Unifying Gathering Protocols for Swarms of Mobile Robots. In: <i>Lecture Notes in Computer Science</i>. Springer International Publishing; 2023. doi:<a href=\"https://doi.org/10.1007/978-3-031-30448-4_1\">10.1007/978-3-031-30448-4_1</a>"},"publication":"Lecture Notes in Computer Science"},{"page":"133-142","_id":"34294","publisher":"SCITEPRESS","language":[{"iso":"eng"}],"doi":"10.5220/0011675700003402","user_id":"11308","title":"Model-driven Collaborative Design of Professional Education Programmes With Extended Online Whiteboards","status":"public","year":"2023","author":[{"full_name":"Wolters, Dennis","first_name":"Dennis","last_name":"Wolters","id":"11308"},{"id":"107","full_name":"Engels, Gregor","first_name":"Gregor","last_name":"Engels"}],"publication_identifier":{"issn":["2184-4348"],"isbn":["978-989-758-633-0"]},"date_updated":"2023-05-16T12:19:26Z","publication_status":"accepted","date_created":"2022-12-08T19:32:25Z","type":"conference","department":[{"_id":"66"}],"publication":"MODELSWARD'23","citation":{"ama":"Wolters D, Engels G. Model-driven Collaborative Design of Professional Education Programmes With Extended Online Whiteboards. In: <i>MODELSWARD’23</i>. SCITEPRESS; :133-142. doi:<a href=\"https://doi.org/10.5220/0011675700003402\">10.5220/0011675700003402</a>","bibtex":"@inproceedings{Wolters_Engels, title={Model-driven Collaborative Design of Professional Education Programmes With Extended Online Whiteboards}, DOI={<a href=\"https://doi.org/10.5220/0011675700003402\">10.5220/0011675700003402</a>}, booktitle={MODELSWARD’23}, publisher={SCITEPRESS}, author={Wolters, Dennis and Engels, Gregor}, pages={133–142} }","mla":"Wolters, Dennis, and Gregor Engels. “Model-Driven Collaborative Design of Professional Education Programmes With Extended Online Whiteboards.” <i>MODELSWARD’23</i>, SCITEPRESS, pp. 133–42, doi:<a href=\"https://doi.org/10.5220/0011675700003402\">10.5220/0011675700003402</a>.","short":"D. Wolters, G. Engels, in: MODELSWARD’23, SCITEPRESS, n.d., pp. 133–142.","chicago":"Wolters, Dennis, and Gregor Engels. “Model-Driven Collaborative Design of Professional Education Programmes With Extended Online Whiteboards.” In <i>MODELSWARD’23</i>, 133–42. SCITEPRESS, n.d. <a href=\"https://doi.org/10.5220/0011675700003402\">https://doi.org/10.5220/0011675700003402</a>.","apa":"Wolters, D., &#38; Engels, G. (n.d.). Model-driven Collaborative Design of Professional Education Programmes With Extended Online Whiteboards. <i>MODELSWARD’23</i>, 133–142. <a href=\"https://doi.org/10.5220/0011675700003402\">https://doi.org/10.5220/0011675700003402</a>","ieee":"D. Wolters and G. Engels, “Model-driven Collaborative Design of Professional Education Programmes With Extended Online Whiteboards,” in <i>MODELSWARD’23</i>, pp. 133–142, doi: <a href=\"https://doi.org/10.5220/0011675700003402\">10.5220/0011675700003402</a>."}},{"date_created":"2023-03-27T07:39:35Z","department":[{"_id":"77"}],"type":"dissertation","supervisor":[{"first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573"}],"citation":{"mla":"Pauck, Felix. <i>Cooperative Android App Analysis</i>. Paderborn University, 2023, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1698\">10.17619/UNIPB/1-1698</a>.","ama":"Pauck F. <i>Cooperative Android App Analysis</i>. Paderborn University; 2023. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1698\">10.17619/UNIPB/1-1698</a>","bibtex":"@book{Pauck_2023, title={Cooperative Android App Analysis}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1698\">10.17619/UNIPB/1-1698</a>}, publisher={Paderborn University}, author={Pauck, Felix}, year={2023} }","apa":"Pauck, F. (2023). <i>Cooperative Android App Analysis</i>. Paderborn University. <a href=\"https://doi.org/10.17619/UNIPB/1-1698\">https://doi.org/10.17619/UNIPB/1-1698</a>","ieee":"F. Pauck, <i>Cooperative Android App Analysis</i>. Paderborn University, 2023.","chicago":"Pauck, Felix. <i>Cooperative Android App Analysis</i>. Paderborn University, 2023. <a href=\"https://doi.org/10.17619/UNIPB/1-1698\">https://doi.org/10.17619/UNIPB/1-1698</a>.","short":"F. Pauck, Cooperative Android App Analysis, Paderborn University, 2023."},"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"name":"SFB 901 - B4: SFB 901 - Subproject B4","_id":"12"}],"_id":"43108","publisher":"Paderborn University","language":[{"iso":"eng"}],"doi":"10.17619/UNIPB/1-1698","user_id":"22398","author":[{"last_name":"Pauck","first_name":"Felix","full_name":"Pauck, Felix","id":"22398"}],"status":"public","year":"2023","title":"Cooperative Android App Analysis","date_updated":"2023-05-22T04:57:42Z"}]