[{"status":"public","year":"2018","title":"Local Strategies for Swarm Formations on a Grid","publication_identifier":{"isbn":["978-3-942647-99-1"]},"author":[{"full_name":"Jung, Daniel","first_name":"Daniel","last_name":"Jung","id":"37827"}],"date_updated":"2024-07-12T12:05:00Z","language":[{"iso":"eng"}],"_id":"1209","publisher":"Universität Paderborn","user_id":"1112","doi":"10.17619/UNIPB/1-271","citation":{"apa":"Jung, D. (2018). <i>Local Strategies for Swarm Formations on a Grid</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-271\">https://doi.org/10.17619/UNIPB/1-271</a>","mla":"Jung, Daniel. <i>Local Strategies for Swarm Formations on a Grid</i>. Universität Paderborn, 2018, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-271\">10.17619/UNIPB/1-271</a>.","ieee":"D. Jung, <i>Local Strategies for Swarm Formations on a Grid</i>. Universität Paderborn, 2018.","chicago":"Jung, Daniel. <i>Local Strategies for Swarm Formations on a Grid</i>. Universität Paderborn, 2018. <a href=\"https://doi.org/10.17619/UNIPB/1-271\">https://doi.org/10.17619/UNIPB/1-271</a>.","ama":"Jung D. <i>Local Strategies for Swarm Formations on a Grid</i>. Universität Paderborn; 2018. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-271\">10.17619/UNIPB/1-271</a>","short":"D. Jung, Local Strategies for Swarm Formations on a Grid, Universität Paderborn, 2018.","bibtex":"@book{Jung_2018, title={Local Strategies for Swarm Formations on a Grid}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-271\">10.17619/UNIPB/1-271</a>}, publisher={Universität Paderborn}, author={Jung, Daniel}, year={2018} }"},"supervisor":[{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"abstract":[{"text":"My dissertation deals with the Gathering problem for swarms of n point-shaped robots on a grid, in which all robots of the swarm are supposed to gather at a previously undefined point. Special attention is paid to the strong limitation of robot capabilities. These include in particular the lack of global control, a global compass, global visibility and (global) communication skills. Furthermore, all robots are identical. The robots are given only local abilities. This includes a constant range of vision. The robots all work completely synchronously. In this work we present and analyze three different Gathering strategies in different robot models. We formally prove correctness and total running time: Chapter 4 focuses on minimizing the available robot capabilities. The underlying strategy completes the gathering in O(n^2) time. For the following Chapters 5 and 6, the aim is to optimize the total running time under using only local robot capabilities: We additionally allow a constant-sized memory and a constant number of locally visible statuses (lights, flags). For the strategies of both chapters we show an asymptotically optimal running time of O(n). Unlike in Chapters 4 and 5, we additionally restrict connectivity and vision to an initially given chain connectivity in Chapter 6, where two chain neighbors must have a distance of 1 from each other. A robot can only see and interact with a constant number of its direct chain neighbors.","lang":"eng"}],"related_material":{"link":[{"relation":"confirmation","url":"https://doi.org/10.17619/UNIPB/1-271"}]},"project":[{"name":"SFB 901","_id":"1","grant_number":"160364472"},{"_id":"2","name":"SFB 901 - Project Area A"},{"grant_number":"160364472","_id":"5","name":"SFB 901 - Subproject A1"}],"date_created":"2018-03-13T10:26:16Z","type":"dissertation","department":[{"_id":"63"},{"_id":"26"}]},{"page":"38:1-38:16","publisher":"Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik","_id":"8162","user_id":"71541","volume":117,"editor":[{"full_name":"Potapov, Igor","first_name":"Igor","last_name":"Potapov"},{"full_name":"Spirakis, Paul","last_name":"Spirakis","first_name":"Paul"},{"first_name":"James","last_name":"Worrell","full_name":"Worrell, James"}],"status":"public","conference":{"location":"Liverpool, UK","name":"43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)"},"external_id":{"arxiv":["1712.09617"]},"place":"Dagstuhl, Germany","oa":"1","citation":{"apa":"Aldi, M., de Beaudrap, N., Gharibian, S., &#38; Saeedi, S. (2018). On Efficiently Solvable Cases of Quantum k-SAT. In I. Potapov, P. Spirakis, &#38; J. Worrell (Eds.), <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i> (Vol. 117, p. 38:1-38:16). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.38\">https://doi.org/10.4230/LIPIcs.MFCS.2018.38</a>","ieee":"M. Aldi, N. de Beaudrap, S. Gharibian, and S. Saeedi, “On Efficiently Solvable Cases of Quantum k-SAT,” in <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i>, Liverpool, UK, 2018, vol. 117, p. 38:1-38:16, doi: <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.38\">10.4230/LIPIcs.MFCS.2018.38</a>.","short":"M. Aldi, N. de Beaudrap, S. Gharibian, S. Saeedi, in: I. Potapov, P. Spirakis, J. Worrell (Eds.), 43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2018, p. 38:1-38:16.","chicago":"Aldi, Marco, Niel de Beaudrap, Sevag Gharibian, and Seyran Saeedi. “On Efficiently Solvable Cases of Quantum K-SAT.” In <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i>, edited by Igor Potapov, Paul Spirakis, and James Worrell, 117:38:1-38:16. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.38\">https://doi.org/10.4230/LIPIcs.MFCS.2018.38</a>.","mla":"Aldi, Marco, et al. “On Efficiently Solvable Cases of Quantum K-SAT.” <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i>, edited by Igor Potapov et al., vol. 117, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018, p. 38:1-38:16, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.38\">10.4230/LIPIcs.MFCS.2018.38</a>.","ama":"Aldi M, de Beaudrap N, Gharibian S, Saeedi S. On Efficiently Solvable Cases of Quantum k-SAT. In: Potapov I, Spirakis P, Worrell J, eds. <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i>. Vol 117. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik; 2018:38:1-38:16. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.38\">10.4230/LIPIcs.MFCS.2018.38</a>","bibtex":"@inproceedings{Aldi_de Beaudrap_Gharibian_Saeedi_2018, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={On Efficiently Solvable Cases of Quantum k-SAT}, volume={117}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.38\">10.4230/LIPIcs.MFCS.2018.38</a>}, booktitle={43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)}, publisher={Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, author={Aldi, Marco and de Beaudrap, Niel and Gharibian, Sevag and Saeedi, Seyran}, editor={Potapov, Igor and Spirakis, Paul and Worrell, James}, year={2018}, pages={38:1-38:16}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }"},"main_file_link":[{"url":"http://drops.dagstuhl.de/opus/volltexte/2018/9620/","open_access":"1"}],"series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.MFCS.2018.38","title":"On Efficiently Solvable Cases of Quantum k-SAT","year":"2018","author":[{"full_name":"Aldi, Marco","first_name":"Marco","last_name":"Aldi"},{"full_name":"de Beaudrap, Niel","last_name":"de Beaudrap","first_name":"Niel"},{"id":"71541","first_name":"Sevag","orcid":"0000-0002-9992-3379","last_name":"Gharibian","full_name":"Gharibian, Sevag"},{"full_name":"Saeedi, Seyran","first_name":"Seyran","last_name":"Saeedi"}],"publication_identifier":{"unknown":["978-3-95977-086-6"]},"publication_status":"published","date_updated":"2023-02-28T11:01:16Z","intvolume":"       117","date_created":"2019-03-01T11:34:41Z","keyword":["search complexity","local Hamiltonian","Quantum SAT","algebraic geometry"],"type":"conference","department":[{"_id":"623"},{"_id":"7"}],"publication":"43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)","abstract":[{"lang":"eng","text":"The constraint satisfaction problems k-SAT and Quantum k-SAT (k-QSAT) are canonical NP-complete and QMA_1-complete problems (for k >= 3), respectively, where QMA_1 is a quantum generalization of NP with one-sided error. Whereas k-SAT has been well-studied for special tractable cases, as well as from a parameterized complexity perspective, much less is known in similar settings for k-QSAT. Here, we study the open problem of computing satisfying assignments to k-QSAT instances which have a \"matching\" or \"dimer covering\"; this is an NP problem whose decision variant is trivial, but whose search complexity remains open. Our results fall into three directions, all of which relate to the \"matching\" setting: (1) We give a polynomial-time classical algorithm for k-QSAT when all qubits occur in at most two clauses. (2) We give a parameterized algorithm for k-QSAT instances from a certain non-trivial class, which allows us to obtain exponential speedups over brute force methods in some cases by reducing the problem to solving for a single root of a single univariate polynomial. (3) We conduct a structural graph theoretic study of 3-QSAT interaction graphs which have a \"matching\". We remark that the results of (2), in particular, introduce a number of new tools to the study of Quantum SAT, including graph theoretic concepts such as transfer filtrations and blow-ups from algebraic geometry; we hope these prove useful elsewhere."}]},{"status":"public","conference":{"location":"Liverpool, UK","name":"43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)"},"user_id":"71541","volume":117,"editor":[{"full_name":"Potapov, Igor","last_name":"Potapov","first_name":"Igor"},{"full_name":"Spirakis, Paul","last_name":"Spirakis","first_name":"Paul"},{"full_name":"Worrell, James","last_name":"Worrell","first_name":"James"}],"page":"58:1-58:16","publisher":"Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik","_id":"8161","citation":{"apa":"Gharibian, S., Santha, M., Sikora, J., Sundaram, A., &#38; Yirka, J. (2018). Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2). In I. Potapov, P. Spirakis, &#38; J. Worrell (Eds.), <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i> (Vol. 117, p. 58:1-58:16). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.58\">https://doi.org/10.4230/LIPIcs.MFCS.2018.58</a>","ieee":"S. Gharibian, M. Santha, J. Sikora, A. Sundaram, and J. Yirka, “Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2),” in <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i>, Liverpool, UK, 2018, vol. 117, p. 58:1-58:16, doi: <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.58\">10.4230/LIPIcs.MFCS.2018.58</a>.","chicago":"Gharibian, Sevag, Miklos Santha, Jamie Sikora, Aarthi Sundaram, and Justin Yirka. “Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2).” In <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i>, edited by Igor Potapov, Paul Spirakis, and James Worrell, 117:58:1-58:16. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.58\">https://doi.org/10.4230/LIPIcs.MFCS.2018.58</a>.","short":"S. Gharibian, M. Santha, J. Sikora, A. Sundaram, J. Yirka, in: I. Potapov, P. Spirakis, J. Worrell (Eds.), 43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2018, p. 58:1-58:16.","mla":"Gharibian, Sevag, et al. “Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2).” <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i>, edited by Igor Potapov et al., vol. 117, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018, p. 58:1-58:16, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.58\">10.4230/LIPIcs.MFCS.2018.58</a>.","ama":"Gharibian S, Santha M, Sikora J, Sundaram A, Yirka J. Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2). In: Potapov I, Spirakis P, Worrell J, eds. <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i>. Vol 117. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik; 2018:58:1-58:16. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.58\">10.4230/LIPIcs.MFCS.2018.58</a>","bibtex":"@inproceedings{Gharibian_Santha_Sikora_Sundaram_Yirka_2018, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2)}, volume={117}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.58\">10.4230/LIPIcs.MFCS.2018.58</a>}, booktitle={43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)}, publisher={Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, author={Gharibian, Sevag and Santha, Miklos and Sikora, Jamie and Sundaram, Aarthi and Yirka, Justin}, editor={Potapov, Igor and Spirakis, Paul and Worrell, James}, year={2018}, pages={58:1-58:16}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }"},"oa":"1","external_id":{"arxiv":["1805.11139"]},"place":"Dagstuhl, Germany","publication_status":"published","date_updated":"2023-02-28T11:01:03Z","intvolume":"       117","title":"Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2)","year":"2018","publication_identifier":{"unknown":["978-3-95977-086-6"]},"author":[{"id":"71541","full_name":"Gharibian, Sevag","orcid":"0000-0002-9992-3379","last_name":"Gharibian","first_name":"Sevag"},{"full_name":"Santha, Miklos","last_name":"Santha","first_name":"Miklos"},{"full_name":"Sikora, Jamie","first_name":"Jamie","last_name":"Sikora"},{"first_name":"Aarthi","last_name":"Sundaram","full_name":"Sundaram, Aarthi"},{"full_name":"Yirka, Justin","last_name":"Yirka","first_name":"Justin"}],"doi":"10.4230/LIPIcs.MFCS.2018.58","main_file_link":[{"open_access":"1","url":"http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=9640"}],"language":[{"iso":"eng"}],"series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","abstract":[{"lang":"eng","text":"The polynomial-time hierarchy (PH) has proven to be a powerful tool for providing separations in computational complexity theory (modulo standard conjectures such as PH does not collapse). Here, we study whether two quantum generalizations of PH can similarly prove separations in the quantum setting. The first generalization, QCPH, uses classical proofs, and the second, QPH, uses quantum proofs. For the former, we show quantum variants of the Karp-Lipton theorem and Toda's theorem. For the latter, we place its third level, Q Sigma_3, into NEXP using the Ellipsoid Method for efficiently solving semidefinite programs. These results yield two implications for QMA(2), the variant of Quantum Merlin-Arthur (QMA) with two unentangled proofs, a complexity class whose characterization has proven difficult. First, if QCPH=QPH (i.e., alternating quantifiers are sufficiently powerful so as to make classical and quantum proofs \"equivalent\"), then QMA(2) is in the Counting Hierarchy (specifically, in P^{PP^{PP}}). Second, unless QMA(2)= Q Sigma_3 (i.e., alternating quantifiers do not help in the presence of \"unentanglement\"), QMA(2) is strictly contained in NEXP."}],"publication":"43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)","keyword":["Complexity Theory","Quantum Computing","Polynomial Hierarchy","Semidefinite Programming","QMA(2)","Quantum Complexity"],"type":"conference","department":[{"_id":"623"},{"_id":"7"}],"date_created":"2019-03-01T11:29:44Z"},{"citation":{"bibtex":"@inproceedings{Gharibian_Yirka_2018, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={The Complexity of Simulating Local Measurements on Quantum Systems}, volume={73}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.TQC.2017.2\">10.4230/LIPIcs.TQC.2017.2</a>}, booktitle={12th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2017)}, publisher={Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, author={Gharibian, Sevag and Yirka, Justin}, editor={Wilde, Mark}, year={2018}, pages={2:1-2:17}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","ama":"Gharibian S, Yirka J. The Complexity of Simulating Local Measurements on Quantum Systems. In: Wilde M, ed. <i>12th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2017)</i>. Vol 73. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik; 2018:2:1-2:17. doi:<a href=\"https://doi.org/10.4230/LIPIcs.TQC.2017.2\">10.4230/LIPIcs.TQC.2017.2</a>","short":"S. Gharibian, J. Yirka, in: M. Wilde (Ed.), 12th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2017), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2018, p. 2:1-2:17.","chicago":"Gharibian, Sevag, and Justin Yirka. “The Complexity of Simulating Local Measurements on Quantum Systems.” In <i>12th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2017)</i>, edited by Mark Wilde, 73:2:1-2:17. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPIcs.TQC.2017.2\">https://doi.org/10.4230/LIPIcs.TQC.2017.2</a>.","ieee":"S. Gharibian and J. Yirka, “The Complexity of Simulating Local Measurements on Quantum Systems,” in <i>12th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2017)</i>, Paris, France, 2018, vol. 73, p. 2:1-2:17, doi: <a href=\"https://doi.org/10.4230/LIPIcs.TQC.2017.2\">10.4230/LIPIcs.TQC.2017.2</a>.","apa":"Gharibian, S., &#38; Yirka, J. (2018). The Complexity of Simulating Local Measurements on Quantum Systems. In M. Wilde (Ed.), <i>12th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2017)</i> (Vol. 73, p. 2:1-2:17). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.TQC.2017.2\">https://doi.org/10.4230/LIPIcs.TQC.2017.2</a>","mla":"Gharibian, Sevag, and Justin Yirka. “The Complexity of Simulating Local Measurements on Quantum Systems.” <i>12th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2017)</i>, edited by Mark Wilde, vol. 73, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018, p. 2:1-2:17, doi:<a href=\"https://doi.org/10.4230/LIPIcs.TQC.2017.2\">10.4230/LIPIcs.TQC.2017.2</a>."},"place":"Dagstuhl, Germany","external_id":{"arxiv":["1606.05626"]},"oa":"1","conference":{"name":"12th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2017)","location":"Paris, France"},"status":"public","publisher":"Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik","_id":"8160","page":"2:1-2:17","volume":73,"editor":[{"full_name":"Wilde, Mark","last_name":"Wilde","first_name":"Mark"}],"user_id":"71541","publication":"12th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2017)","abstract":[{"text":"An important task in quantum physics is the estimation of local quantities for ground states of local Hamiltonians. Recently, Ambainis defined the complexity class P^QMA[log], and motivated its study by showing that the physical task of estimating the expectation value of a local observable against the ground state of a local Hamiltonian is P^QMA[log]-complete. In this paper, we continue the study of P^QMA[log], obtaining the following results. The P^QMA[log]-completeness result of Ambainis requires O(log n)-local observ- ables and Hamiltonians. We show that simulating even a single qubit measurement on ground states of 5-local Hamiltonians is P^QMA[log]-complete, resolving an open question of Ambainis. We formalize the complexity theoretic study of estimating two-point correlation functions against ground states, and show that this task is similarly P^QMA[log]-complete. P^QMA[log] is thought of as \"slightly harder\" than QMA. We justify this formally by exploiting the hierarchical voting technique of Beigel, Hemachandra, and Wechsung to show P^QMA[log] \\subseteq PP. This improves the containment QMA \\subseteq PP from Kitaev and Watrous. A central theme of this work is the subtlety involved in the study of oracle classes in which the oracle solves a promise problem. In this vein, we identify a flaw in Ambainis' prior work regarding a P^UQMA[log]-hardness proof for estimating spectral gaps of local Hamiltonians. By introducing a \"query validation\" technique, we build on his prior work to obtain P^UQMA[log]-hardness for estimating spectral gaps under polynomial-time Turing reductions.","lang":"eng"}],"date_created":"2019-03-01T11:25:27Z","department":[{"_id":"623"},{"_id":"7"}],"type":"conference","keyword":["Complexity theory","Quantum Merlin Arthur (QMA)","local Hamiltonian","local measurement","spectral gap"],"author":[{"orcid":"0000-0002-9992-3379","last_name":"Gharibian","first_name":"Sevag","full_name":"Gharibian, Sevag","id":"71541"},{"full_name":"Yirka, Justin","last_name":"Yirka","first_name":"Justin"}],"publication_identifier":{"unknown":["978-3-95977-034-7"]},"title":"The Complexity of Simulating Local Measurements on Quantum Systems","year":"2018","intvolume":"        73","publication_status":"published","date_updated":"2023-02-28T11:00:48Z","language":[{"iso":"eng"}],"series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","main_file_link":[{"url":"http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=8577","open_access":"1"}],"doi":"10.4230/LIPIcs.TQC.2017.2"},{"status":"public","page":"8:1-8:28","publisher":"ACM","_id":"8167","user_id":"71541","volume":10,"citation":{"ama":"Gharibian S, Sikora J. Ground State Connectivity of Local Hamiltonians. <i>ACM Transactions on Computation Theory (TOCT)</i>. 2018;10(2):8:1-8:28. doi:<a href=\"https://doi.org/10.1145/3186587\">10.1145/3186587</a>","bibtex":"@article{Gharibian_Sikora_2018, title={Ground State Connectivity of Local Hamiltonians}, volume={10}, DOI={<a href=\"https://doi.org/10.1145/3186587\">10.1145/3186587</a>}, number={2}, journal={ACM Transactions on Computation Theory (TOCT)}, publisher={ACM}, author={Gharibian, Sevag and Sikora, Jamie}, year={2018}, pages={8:1-8:28} }","mla":"Gharibian, Sevag, and Jamie Sikora. “Ground State Connectivity of Local Hamiltonians.” <i>ACM Transactions on Computation Theory (TOCT)</i>, vol. 10, no. 2, ACM, 2018, p. 8:1-8:28, doi:<a href=\"https://doi.org/10.1145/3186587\">10.1145/3186587</a>.","chicago":"Gharibian, Sevag, and Jamie Sikora. “Ground State Connectivity of Local Hamiltonians.” <i>ACM Transactions on Computation Theory (TOCT)</i> 10, no. 2 (2018): 8:1-8:28. <a href=\"https://doi.org/10.1145/3186587\">https://doi.org/10.1145/3186587</a>.","short":"S. Gharibian, J. Sikora, ACM Transactions on Computation Theory (TOCT) 10 (2018) 8:1-8:28.","apa":"Gharibian, S., &#38; Sikora, J. (2018). Ground State Connectivity of Local Hamiltonians. <i>ACM Transactions on Computation Theory (TOCT)</i>, <i>10</i>(2), 8:1-8:28. <a href=\"https://doi.org/10.1145/3186587\">https://doi.org/10.1145/3186587</a>","ieee":"S. Gharibian and J. Sikora, “Ground State Connectivity of Local Hamiltonians,” <i>ACM Transactions on Computation Theory (TOCT)</i>, vol. 10, no. 2, p. 8:1-8:28, 2018, doi: <a href=\"https://doi.org/10.1145/3186587\">10.1145/3186587</a>."},"external_id":{"arxiv":["1409.3182"]},"oa":"1","year":"2018","title":"Ground State Connectivity of Local Hamiltonians","author":[{"id":"71541","orcid":"0000-0002-9992-3379","last_name":"Gharibian","first_name":"Sevag","full_name":"Gharibian, Sevag"},{"last_name":"Sikora","first_name":"Jamie","full_name":"Sikora, Jamie"}],"publication_identifier":{"issn":["1942-3454"]},"publication_status":"published","date_updated":"2023-02-28T11:01:36Z","intvolume":"        10","main_file_link":[{"url":"https://arxiv.org/abs/1409.3182","open_access":"1"}],"language":[{"iso":"eng"}],"doi":"10.1145/3186587","publication":"ACM Transactions on Computation Theory (TOCT)","issue":"2","date_created":"2019-03-01T11:49:31Z","keyword":["Local Hamiltonian","ground state connectivity","quantum Hamiltonian complexity","reconfiguration problem"],"type":"journal_article","department":[{"_id":"623"},{"_id":"7"}]},{"keyword":["tet_topic_hpc"],"type":"conference","department":[{"_id":"27"},{"_id":"518"},{"_id":"61"}],"file":[{"creator":"ups","date_created":"2018-11-02T14:45:05Z","access_level":"closed","file_size":269130,"file_name":"08457652.pdf","date_updated":"2018-11-02T14:45:05Z","relation":"main_file","content_type":"application/pdf","success":1,"file_id":"5282"}],"date_created":"2018-03-22T10:48:01Z","abstract":[{"text":"The exploration of FPGAs as accelerators for scientific simulations has so far mostly been focused on small kernels of methods working on regular data structures, for example in the form of stencil computations for finite difference methods. In computational sciences, often more advanced methods are employed that promise better stability, convergence, locality and scaling. Unstructured meshes are shown to be more effective and more accurate, compared to regular grids, in representing computation domains of various shapes. Using unstructured meshes, the discontinuous Galerkin method preserves the ability to perform explicit local update operations for simulations in the time domain. In this work, we investigate FPGAs as target platform for an implementation of the nodal discontinuous Galerkin method to find time-domain solutions of Maxwell's equations in an unstructured mesh. When maximizing data reuse and fitting constant coefficients into suitably partitioned on-chip memory, high computational intensity allows us to implement and feed wide data paths with hundreds of floating point operators. By decoupling off-chip memory accesses from the computations, high memory bandwidth can be sustained, even for the irregular access pattern required by parts of the application. Using the Intel/Altera OpenCL SDK for FPGAs, we present different implementation variants for different polynomial orders of the method. In different phases of the algorithm, either computational or bandwidth limits of the Arria 10 platform are almost reached, thus outperforming a highly multithreaded CPU implementation by around 2x.","lang":"eng"}],"publication":"Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM)","doi":"10.1109/FCCM.2018.00037","language":[{"iso":"eng"}],"date_updated":"2023-09-26T11:47:52Z","year":"2018","title":"OpenCL-based FPGA Design to Accelerate the Nodal Discontinuous Galerkin Method for Unstructured Meshes","author":[{"first_name":"Tobias","last_name":"Kenter","full_name":"Kenter, Tobias","id":"3145"},{"last_name":"Mahale","first_name":"Gopinath","full_name":"Mahale, Gopinath"},{"full_name":"Alhaddad, Samer","first_name":"Samer","last_name":"Alhaddad","id":"42456"},{"id":"26059","last_name":"Grynko","first_name":"Yevgen","full_name":"Grynko, Yevgen"},{"first_name":"Christian","last_name":"Schmitt","full_name":"Schmitt, Christian"},{"first_name":"Ayesha","last_name":"Afzal","full_name":"Afzal, Ayesha"},{"last_name":"Hannig","first_name":"Frank","full_name":"Hannig, Frank"},{"full_name":"Förstner, Jens","orcid":"0000-0001-7059-9862","last_name":"Förstner","first_name":"Jens","id":"158"},{"id":"16153","full_name":"Plessl, Christian","first_name":"Christian","last_name":"Plessl","orcid":"0000-0001-5728-9982"}],"quality_controlled":"1","project":[{"name":"HighPerMeshes","grant_number":"01|H16005A","_id":"33"},{"name":"SFB 901","grant_number":"160364472","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C2","grant_number":"160364472","_id":"14"}],"file_date_updated":"2018-11-02T14:45:05Z","citation":{"apa":"Kenter, T., Mahale, G., Alhaddad, S., Grynko, Y., Schmitt, C., Afzal, A., Hannig, F., Förstner, J., &#38; Plessl, C. (2018). OpenCL-based FPGA Design to Accelerate the Nodal Discontinuous Galerkin Method for Unstructured Meshes. <i>Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM)</i>. Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM). <a href=\"https://doi.org/10.1109/FCCM.2018.00037\">https://doi.org/10.1109/FCCM.2018.00037</a>","ieee":"T. Kenter <i>et al.</i>, “OpenCL-based FPGA Design to Accelerate the Nodal Discontinuous Galerkin Method for Unstructured Meshes,” presented at the Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM), 2018, doi: <a href=\"https://doi.org/10.1109/FCCM.2018.00037\">10.1109/FCCM.2018.00037</a>.","chicago":"Kenter, Tobias, Gopinath Mahale, Samer Alhaddad, Yevgen Grynko, Christian Schmitt, Ayesha Afzal, Frank Hannig, Jens Förstner, and Christian Plessl. “OpenCL-Based FPGA Design to Accelerate the Nodal Discontinuous Galerkin Method for Unstructured Meshes.” In <i>Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM)</i>. IEEE, 2018. <a href=\"https://doi.org/10.1109/FCCM.2018.00037\">https://doi.org/10.1109/FCCM.2018.00037</a>.","short":"T. Kenter, G. Mahale, S. Alhaddad, Y. Grynko, C. Schmitt, A. Afzal, F. Hannig, J. Förstner, C. Plessl, in: Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM), IEEE, 2018.","mla":"Kenter, Tobias, et al. “OpenCL-Based FPGA Design to Accelerate the Nodal Discontinuous Galerkin Method for Unstructured Meshes.” <i>Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM)</i>, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/FCCM.2018.00037\">10.1109/FCCM.2018.00037</a>.","ama":"Kenter T, Mahale G, Alhaddad S, et al. OpenCL-based FPGA Design to Accelerate the Nodal Discontinuous Galerkin Method for Unstructured Meshes. In: <i>Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM)</i>. IEEE; 2018. doi:<a href=\"https://doi.org/10.1109/FCCM.2018.00037\">10.1109/FCCM.2018.00037</a>","bibtex":"@inproceedings{Kenter_Mahale_Alhaddad_Grynko_Schmitt_Afzal_Hannig_Förstner_Plessl_2018, title={OpenCL-based FPGA Design to Accelerate the Nodal Discontinuous Galerkin Method for Unstructured Meshes}, DOI={<a href=\"https://doi.org/10.1109/FCCM.2018.00037\">10.1109/FCCM.2018.00037</a>}, booktitle={Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM)}, publisher={IEEE}, author={Kenter, Tobias and Mahale, Gopinath and Alhaddad, Samer and Grynko, Yevgen and Schmitt, Christian and Afzal, Ayesha and Hannig, Frank and Förstner, Jens and Plessl, Christian}, year={2018} }"},"ddc":["000"],"user_id":"15278","_id":"1588","publisher":"IEEE","has_accepted_license":"1","status":"public","conference":{"name":"Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM)"}},{"publisher":"ACM","_id":"1590","user_id":"15278","status":"public","conference":{"end_date":"2018-07-04","start_date":"2018-07-02","name":"Platform for Advanced Scientific Computing Conference (PASC)","location":"Basel, Switzerland"},"external_id":{"arxiv":["1710.10899"]},"place":"New York, NY, USA","citation":{"apa":"Lass, M., Mohr, S., Wiebeler, H., Kühne, T., &#38; Plessl, C. (2018). A Massively Parallel Algorithm for the Approximate Calculation of Inverse p-th Roots of Large Sparse Matrices. <i>Proc. Platform for Advanced Scientific Computing (PASC) Conference</i>. Platform for Advanced Scientific Computing Conference (PASC), Basel, Switzerland. <a href=\"https://doi.org/10.1145/3218176.3218231\">https://doi.org/10.1145/3218176.3218231</a>","ieee":"M. Lass, S. Mohr, H. Wiebeler, T. Kühne, and C. Plessl, “A Massively Parallel Algorithm for the Approximate Calculation of Inverse p-th Roots of Large Sparse Matrices,” presented at the Platform for Advanced Scientific Computing Conference (PASC), Basel, Switzerland, 2018, doi: <a href=\"https://doi.org/10.1145/3218176.3218231\">10.1145/3218176.3218231</a>.","short":"M. Lass, S. Mohr, H. Wiebeler, T. Kühne, C. Plessl, in: Proc. Platform for Advanced Scientific Computing (PASC) Conference, ACM, New York, NY, USA, 2018.","chicago":"Lass, Michael, Stephan Mohr, Hendrik Wiebeler, Thomas Kühne, and Christian Plessl. “A Massively Parallel Algorithm for the Approximate Calculation of Inverse P-Th Roots of Large Sparse Matrices.” In <i>Proc. Platform for Advanced Scientific Computing (PASC) Conference</i>. New York, NY, USA: ACM, 2018. <a href=\"https://doi.org/10.1145/3218176.3218231\">https://doi.org/10.1145/3218176.3218231</a>.","mla":"Lass, Michael, et al. “A Massively Parallel Algorithm for the Approximate Calculation of Inverse P-Th Roots of Large Sparse Matrices.” <i>Proc. Platform for Advanced Scientific Computing (PASC) Conference</i>, ACM, 2018, doi:<a href=\"https://doi.org/10.1145/3218176.3218231\">10.1145/3218176.3218231</a>.","ama":"Lass M, Mohr S, Wiebeler H, Kühne T, Plessl C. A Massively Parallel Algorithm for the Approximate Calculation of Inverse p-th Roots of Large Sparse Matrices. In: <i>Proc. Platform for Advanced Scientific Computing (PASC) Conference</i>. ACM; 2018. doi:<a href=\"https://doi.org/10.1145/3218176.3218231\">10.1145/3218176.3218231</a>","bibtex":"@inproceedings{Lass_Mohr_Wiebeler_Kühne_Plessl_2018, place={New York, NY, USA}, title={A Massively Parallel Algorithm for the Approximate Calculation of Inverse p-th Roots of Large Sparse Matrices}, DOI={<a href=\"https://doi.org/10.1145/3218176.3218231\">10.1145/3218176.3218231</a>}, booktitle={Proc. Platform for Advanced Scientific Computing (PASC) Conference}, publisher={ACM}, author={Lass, Michael and Mohr, Stephan and Wiebeler, Hendrik and Kühne, Thomas and Plessl, Christian}, year={2018} }"},"quality_controlled":"1","project":[{"grant_number":"PL 595/2-1 / 320898746","_id":"32","name":"Performance and Efficiency in HPC with Custom Computing"},{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"language":[{"iso":"eng"}],"doi":"10.1145/3218176.3218231","title":"A Massively Parallel Algorithm for the Approximate Calculation of Inverse p-th Roots of Large Sparse Matrices","year":"2018","publication_identifier":{"isbn":["978-1-4503-5891-0/18/07"]},"author":[{"id":"24135","orcid":"0000-0002-5708-7632","first_name":"Michael","last_name":"Lass","full_name":"Lass, Michael"},{"last_name":"Mohr","first_name":"Stephan","full_name":"Mohr, Stephan"},{"full_name":"Wiebeler, Hendrik","first_name":"Hendrik","last_name":"Wiebeler"},{"id":"49079","full_name":"Kühne, Thomas","first_name":"Thomas","last_name":"Kühne"},{"id":"16153","first_name":"Christian","last_name":"Plessl","orcid":"0000-0001-5728-9982","full_name":"Plessl, Christian"}],"date_updated":"2023-09-26T11:48:12Z","date_created":"2018-03-22T10:53:01Z","type":"conference","keyword":["approximate computing","linear algebra","matrix inversion","matrix p-th roots","numeric algorithm","parallel computing"],"department":[{"_id":"27"},{"_id":"518"},{"_id":"304"}],"publication":"Proc. Platform for Advanced Scientific Computing (PASC) Conference","abstract":[{"lang":"eng","text":"We present the submatrix method, a highly parallelizable method for the approximate calculation of inverse p-th roots of large sparse symmetric matrices which are required in different scientific applications. Following the idea of Approximate Computing, we allow imprecision in the final result in order to utilize the sparsity of the input matrix and to allow massively parallel execution. For an n x n matrix, the proposed algorithm allows to distribute the calculations over n nodes with only little communication overhead. The result matrix exhibits the same sparsity pattern as the input matrix, allowing for efficient reuse of allocated data structures.\r\n\r\nWe evaluate the algorithm with respect to the error that it introduces into calculated results, as well as its performance and scalability. We demonstrate that the error is relatively limited for well-conditioned matrices and that results are still valuable for error-resilient applications like preconditioning even for ill-conditioned matrices. We discuss the execution time and scaling of the algorithm on a theoretical level and present a distributed implementation of the algorithm using MPI and OpenMP. We demonstrate the scalability of this implementation by running it on a high-performance compute cluster comprised of 1024 CPU cores, showing a speedup of 665x compared to single-threaded execution."}]},{"status":"public","has_accepted_license":"1","_id":"1204","publisher":"ACM","user_id":"15278","ddc":["000"],"citation":{"apa":"Riebler, H., Vaz, G. F., Kenter, T., &#38; Plessl, C. (2018). Automated Code Acceleration Targeting Heterogeneous OpenCL Devices. <i>Proc. ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP)</i>. <a href=\"https://doi.org/10.1145/3178487.3178534\">https://doi.org/10.1145/3178487.3178534</a>","ieee":"H. Riebler, G. F. Vaz, T. Kenter, and C. Plessl, “Automated Code Acceleration Targeting Heterogeneous OpenCL Devices,” 2018, doi: <a href=\"https://doi.org/10.1145/3178487.3178534\">10.1145/3178487.3178534</a>.","chicago":"Riebler, Heinrich, Gavin Francis Vaz, Tobias Kenter, and Christian Plessl. “Automated Code Acceleration Targeting Heterogeneous OpenCL Devices.” In <i>Proc. ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP)</i>. ACM, 2018. <a href=\"https://doi.org/10.1145/3178487.3178534\">https://doi.org/10.1145/3178487.3178534</a>.","short":"H. Riebler, G.F. Vaz, T. Kenter, C. Plessl, in: Proc. ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP), ACM, 2018.","mla":"Riebler, Heinrich, et al. “Automated Code Acceleration Targeting Heterogeneous OpenCL Devices.” <i>Proc. ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP)</i>, ACM, 2018, doi:<a href=\"https://doi.org/10.1145/3178487.3178534\">10.1145/3178487.3178534</a>.","ama":"Riebler H, Vaz GF, Kenter T, Plessl C. Automated Code Acceleration Targeting Heterogeneous OpenCL Devices. In: <i>Proc. ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP)</i>. ACM; 2018. doi:<a href=\"https://doi.org/10.1145/3178487.3178534\">10.1145/3178487.3178534</a>","bibtex":"@inproceedings{Riebler_Vaz_Kenter_Plessl_2018, title={Automated Code Acceleration Targeting Heterogeneous OpenCL Devices}, DOI={<a href=\"https://doi.org/10.1145/3178487.3178534\">10.1145/3178487.3178534</a>}, booktitle={Proc. ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP)}, publisher={ACM}, author={Riebler, Heinrich and Vaz, Gavin Francis and Kenter, Tobias and Plessl, Christian}, year={2018} }"},"file_date_updated":"2018-11-02T14:43:37Z","project":[{"grant_number":"160364472","_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C2","_id":"14","grant_number":"160364472"}],"quality_controlled":"1","publication_identifier":{"isbn":["9781450349826"]},"author":[{"id":"8961","full_name":"Riebler, Heinrich","first_name":"Heinrich","last_name":"Riebler"},{"full_name":"Vaz, Gavin Francis","first_name":"Gavin Francis","last_name":"Vaz","id":"30332"},{"id":"3145","full_name":"Kenter, Tobias","last_name":"Kenter","first_name":"Tobias"},{"id":"16153","last_name":"Plessl","orcid":"0000-0001-5728-9982","first_name":"Christian","full_name":"Plessl, Christian"}],"year":"2018","title":"Automated Code Acceleration Targeting Heterogeneous OpenCL Devices","publication_status":"published","date_updated":"2023-09-26T11:47:23Z","language":[{"iso":"eng"}],"doi":"10.1145/3178487.3178534","publication":"Proc. ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP)","date_created":"2018-03-08T14:45:18Z","file":[{"file_size":447769,"access_level":"closed","file_name":"p417-riebler.pdf","date_updated":"2018-11-02T14:43:37Z","relation":"main_file","success":1,"content_type":"application/pdf","file_id":"5281","creator":"ups","date_created":"2018-11-02T14:43:37Z"}],"department":[{"_id":"27"},{"_id":"518"}],"type":"conference","keyword":["htrop"]},{"publisher":"ACM","_id":"56157","language":[{"iso":"eng"}],"doi":"10.1145/3265757.3265781","user_id":"9503","alternative_title":["a concept for repair cafes in computing edcuation"],"title":"The computing repair cafe","status":"public","year":"2018","author":[{"last_name":"Schulte","first_name":"Carsten","full_name":"Schulte, Carsten"},{"first_name":"Jessica","last_name":"Krüger","full_name":"Krüger, Jessica"},{"id":"9503","first_name":"Andreas","last_name":"Gödecke","full_name":"Gödecke, Andreas"},{"full_name":"Schmidt, Ann-Katrin","last_name":"Schmidt","first_name":"Ann-Katrin"}],"date_updated":"2024-09-17T08:43:34Z","publication_status":"published","date_created":"2024-09-17T08:42:15Z","type":"conference","department":[{"_id":"67"}],"publication":"Proceedings of the 13th Workshop in Primary and Secondary Computing Education","citation":{"ama":"Schulte C, Krüger J, Gödecke A, Schmidt A-K. The computing repair cafe. In: <i>Proceedings of the 13th Workshop in Primary and Secondary Computing Education</i>. ACM; 2018. doi:<a href=\"https://doi.org/10.1145/3265757.3265781\">10.1145/3265757.3265781</a>","bibtex":"@inproceedings{Schulte_Krüger_Gödecke_Schmidt_2018, title={The computing repair cafe}, DOI={<a href=\"https://doi.org/10.1145/3265757.3265781\">10.1145/3265757.3265781</a>}, booktitle={Proceedings of the 13th Workshop in Primary and Secondary Computing Education}, publisher={ACM}, author={Schulte, Carsten and Krüger, Jessica and Gödecke, Andreas and Schmidt, Ann-Katrin}, year={2018} }","mla":"Schulte, Carsten, et al. “The Computing Repair Cafe.” <i>Proceedings of the 13th Workshop in Primary and Secondary Computing Education</i>, ACM, 2018, doi:<a href=\"https://doi.org/10.1145/3265757.3265781\">10.1145/3265757.3265781</a>.","chicago":"Schulte, Carsten, Jessica Krüger, Andreas Gödecke, and Ann-Katrin Schmidt. “The Computing Repair Cafe.” In <i>Proceedings of the 13th Workshop in Primary and Secondary Computing Education</i>. ACM, 2018. <a href=\"https://doi.org/10.1145/3265757.3265781\">https://doi.org/10.1145/3265757.3265781</a>.","short":"C. Schulte, J. Krüger, A. Gödecke, A.-K. Schmidt, in: Proceedings of the 13th Workshop in Primary and Secondary Computing Education, ACM, 2018.","apa":"Schulte, C., Krüger, J., Gödecke, A., &#38; Schmidt, A.-K. (2018). The computing repair cafe. <i>Proceedings of the 13th Workshop in Primary and Secondary Computing Education</i>. <a href=\"https://doi.org/10.1145/3265757.3265781\">https://doi.org/10.1145/3265757.3265781</a>","ieee":"C. Schulte, J. Krüger, A. Gödecke, and A.-K. Schmidt, “The computing repair cafe,” 2018, doi: <a href=\"https://doi.org/10.1145/3265757.3265781\">10.1145/3265757.3265781</a>."}},{"publication":"Koli Calling","citation":{"bibtex":"@inproceedings{Heinemann_Opel_Budde_Schulte_Frischemeier_Biehler_Podworny_Wassong_2018, title={Drafting a Data Science Curriculum for Secondary Schools}, booktitle={Koli Calling}, publisher={ACM}, author={Heinemann, Birte and Opel, Simone Anna and Budde, Lea and Schulte, Carsten and Frischemeier, Daniel and Biehler, Rolf and Podworny, Susanne and Wassong, Thomas}, year={2018}, pages={17:1-17:5} }","ama":"Heinemann B, Opel SA, Budde L, et al. Drafting a Data Science Curriculum for Secondary Schools. In: <i>Koli Calling</i>. ACM; 2018:17:1-17:5.","mla":"Heinemann, Birte, et al. “Drafting a Data Science Curriculum for Secondary Schools.” <i>Koli Calling</i>, ACM, 2018, p. 17:1-17:5.","short":"B. Heinemann, S.A. Opel, L. Budde, C. Schulte, D. Frischemeier, R. Biehler, S. Podworny, T. Wassong, in: Koli Calling, ACM, 2018, p. 17:1-17:5.","chicago":"Heinemann, Birte, Simone Anna Opel, Lea Budde, Carsten Schulte, Daniel Frischemeier, Rolf Biehler, Susanne Podworny, and Thomas Wassong. “Drafting a Data Science Curriculum for Secondary Schools.” In <i>Koli Calling</i>, 17:1-17:5. ACM, 2018.","ieee":"B. Heinemann <i>et al.</i>, “Drafting a Data Science Curriculum for Secondary Schools,” in <i>Koli Calling</i>, 2018, p. 17:1-17:5.","apa":"Heinemann, B., Opel, S. A., Budde, L., Schulte, C., Frischemeier, D., Biehler, R., Podworny, S., &#38; Wassong, T. (2018). Drafting a Data Science Curriculum for Secondary Schools. <i>Koli Calling</i>, 17:1-17:5."},"date_created":"2020-01-28T10:28:41Z","type":"conference","department":[{"_id":"67"}],"year":"2018","status":"public","title":"Drafting a Data Science Curriculum for Secondary Schools","author":[{"full_name":"Heinemann, Birte","last_name":"Heinemann","first_name":"Birte"},{"id":"72932","first_name":"Simone Anna","last_name":"Opel","full_name":"Opel, Simone Anna"},{"first_name":"Lea","last_name":"Budde","full_name":"Budde, Lea","id":"32443"},{"first_name":"Carsten","last_name":"Schulte","full_name":"Schulte, Carsten","id":"60311"},{"full_name":"Frischemeier, Daniel","first_name":"Daniel","last_name":"Frischemeier"},{"full_name":"Biehler, Rolf","first_name":"Rolf","last_name":"Biehler"},{"last_name":"Podworny","first_name":"Susanne","full_name":"Podworny, Susanne"},{"last_name":"Wassong","first_name":"Thomas","full_name":"Wassong, Thomas","id":"21241"}],"date_updated":"2025-05-25T20:14:49Z","page":"17:1-17:5","publisher":"ACM","_id":"15646","language":[{"iso":"eng"}],"user_id":"21241"},{"author":[{"full_name":"Jiménez-Ruiz, Ernesto","first_name":"Ernesto","last_name":"Jiménez-Ruiz"},{"full_name":"Saveta, Tzanina","last_name":"Saveta","first_name":"Tzanina"},{"full_name":"Zamazal, Ondrej","first_name":"Ondrej","last_name":"Zamazal"},{"last_name":"Hertling","first_name":"Sven","full_name":"Hertling, Sven"},{"full_name":"Röder, Michael","first_name":"Michael","last_name":"Röder"},{"full_name":"Fundulaki, Irini","last_name":"Fundulaki","first_name":"Irini"},{"id":"65716","first_name":"Axel-Cyrille","last_name":"Ngonga Ngomo","full_name":"Ngonga Ngomo, Axel-Cyrille"},{"id":"67234","orcid":"https://orcid.org/0000-0002-9927-2203","last_name":"Sherif","first_name":"Mohamed","full_name":"Sherif, Mohamed"},{"last_name":"Annane","first_name":"Amina","full_name":"Annane, Amina"},{"full_name":"Bellahsene, Zohra","last_name":"Bellahsene","first_name":"Zohra"},{"full_name":"Yahia, Sadok Ben","last_name":"Yahia","first_name":"Sadok Ben"},{"first_name":"Gayo","last_name":"Diallo","full_name":"Diallo, Gayo"},{"full_name":"Faria, Daniel","last_name":"Faria","first_name":"Daniel"},{"full_name":"Kachroudi, Marouen","first_name":"Marouen","last_name":"Kachroudi"},{"full_name":"Khiat, Abderrahmane","first_name":"Abderrahmane","last_name":"Khiat"},{"full_name":"Lambrix, Patrick","last_name":"Lambrix","first_name":"Patrick"},{"full_name":"Li, Huanyu","last_name":"Li","first_name":"Huanyu"},{"last_name":"Mackeprang","first_name":"Maximilian","full_name":"Mackeprang, Maximilian"},{"full_name":"Mohammadi, Majid","first_name":"Majid","last_name":"Mohammadi"},{"full_name":"Rybinski, Maciej","last_name":"Rybinski","first_name":"Maciej"},{"full_name":"Balasubramani, Booma Sowkarthiga","last_name":"Balasubramani","first_name":"Booma Sowkarthiga"},{"full_name":"Trojahn, Cassia","last_name":"Trojahn","first_name":"Cassia"}],"year":"2018","status":"public","title":"Introducing the HOBBIT platform into the Ontology Alignment Evaluation Campaign","date_updated":"2026-03-09T12:49:48Z","_id":"46539","language":[{"iso":"eng"}],"user_id":"14972","citation":{"ieee":"E. Jiménez-Ruiz <i>et al.</i>, “Introducing the HOBBIT platform into the Ontology Alignment Evaluation Campaign,” 2018.","mla":"Jiménez-Ruiz, Ernesto, et al. “Introducing the HOBBIT Platform into the Ontology Alignment Evaluation Campaign.” <i>Proceedings of the Ontology Matching Workshop 2018</i>, 2018.","apa":"Jiménez-Ruiz, E., Saveta, T., Zamazal, O., Hertling, S., Röder, M., Fundulaki, I., Ngonga Ngomo, A.-C., Sherif, M., Annane, A., Bellahsene, Z., Yahia, S. B., Diallo, G., Faria, D., Kachroudi, M., Khiat, A., Lambrix, P., Li, H., Mackeprang, M., Mohammadi, M., … Trojahn, C. (2018). Introducing the HOBBIT platform into the Ontology Alignment Evaluation Campaign. <i>Proceedings of the Ontology Matching Workshop 2018</i>.","bibtex":"@inproceedings{Jiménez-Ruiz_Saveta_Zamazal_Hertling_Röder_Fundulaki_Ngonga Ngomo_Sherif_Annane_Bellahsene_et al._2018, title={Introducing the HOBBIT platform into the Ontology Alignment Evaluation Campaign}, booktitle={Proceedings of the Ontology Matching Workshop 2018}, author={Jiménez-Ruiz, Ernesto and Saveta, Tzanina and Zamazal, Ondrej and Hertling, Sven and Röder, Michael and Fundulaki, Irini and Ngonga Ngomo, Axel-Cyrille and Sherif, Mohamed and Annane, Amina and Bellahsene, Zohra and et al.}, year={2018} }","short":"E. Jiménez-Ruiz, T. Saveta, O. Zamazal, S. Hertling, M. Röder, I. Fundulaki, A.-C. Ngonga Ngomo, M. Sherif, A. Annane, Z. Bellahsene, S.B. Yahia, G. Diallo, D. Faria, M. Kachroudi, A. Khiat, P. Lambrix, H. Li, M. Mackeprang, M. Mohammadi, M. Rybinski, B.S. Balasubramani, C. Trojahn, in: Proceedings of the Ontology Matching Workshop 2018, 2018.","ama":"Jiménez-Ruiz E, Saveta T, Zamazal O, et al. Introducing the HOBBIT platform into the Ontology Alignment Evaluation Campaign. In: <i>Proceedings of the Ontology Matching Workshop 2018</i>. ; 2018.","chicago":"Jiménez-Ruiz, Ernesto, Tzanina Saveta, Ondrej Zamazal, Sven Hertling, Michael Röder, Irini Fundulaki, Axel-Cyrille Ngonga Ngomo, et al. “Introducing the HOBBIT Platform into the Ontology Alignment Evaluation Campaign.” In <i>Proceedings of the Ontology Matching Workshop 2018</i>, 2018."},"publication":"Proceedings of the Ontology Matching Workshop 2018","abstract":[{"lang":"eng","text":"This paper describes the Ontology Alignment Evaluation Initiative 2017.5 pre-campaign. Like in 2012, when we transitioned the evaluation to the SEALS platform, we have also conducted a pre-campaign to assess the feasibility of moving to the HOBBIT platform. We report the experiences of this precampaign and discuss the future steps for the OAEI."}],"date_created":"2023-08-16T10:31:40Z","department":[{"_id":"574"}],"keyword":["2018 DICE SIMBA group_aksw ngonga projecthobbit roeder sherif"],"type":"conference"},{"department":[{"_id":"969"}],"type":"conference","date_created":"2025-06-27T10:30:34Z","extern":"1","publication":"Computer Vision - ECCV 2018 Workshops - Munich, Germany, September 8-14, 2018, Proceedings, Part III","doi":"10.1007/978-3-030-11015-4_26","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"intvolume":"     11131","date_updated":"2025-07-14T12:40:32Z","author":[{"first_name":"Isaak","last_name":"Lim","full_name":"Lim, Isaak"},{"full_name":"Dielen, Alexander","last_name":"Dielen","first_name":"Alexander"},{"orcid":"0000-0003-2340-3462","first_name":"Marcel","last_name":"Campen","full_name":"Campen, Marcel","id":"114904"},{"last_name":"Kobbelt","first_name":"Leif","full_name":"Kobbelt, Leif"}],"title":"A Simple Approach to Intrinsic Correspondence Learning on Unstructured 3D Meshes","year":"2018","citation":{"ieee":"I. Lim, A. Dielen, M. Campen, and L. Kobbelt, “A Simple Approach to Intrinsic Correspondence Learning on Unstructured 3D Meshes,” in <i>Computer Vision - ECCV 2018 Workshops - Munich, Germany, September 8-14, 2018, Proceedings, Part III</i>, 2018, vol. 11131, pp. 349–362, doi: <a href=\"https://doi.org/10.1007/978-3-030-11015-4_26\">10.1007/978-3-030-11015-4_26</a>.","mla":"Lim, Isaak, et al. “A Simple Approach to Intrinsic Correspondence Learning on Unstructured 3D Meshes.” <i>Computer Vision - ECCV 2018 Workshops - Munich, Germany, September 8-14, 2018, Proceedings, Part III</i>, edited by Laura Leal-Taixé and Stefan Roth, vol. 11131, Springer, 2018, pp. 349–362, doi:<a href=\"https://doi.org/10.1007/978-3-030-11015-4_26\">10.1007/978-3-030-11015-4_26</a>.","apa":"Lim, I., Dielen, A., Campen, M., &#38; Kobbelt, L. (2018). A Simple Approach to Intrinsic Correspondence Learning on Unstructured 3D Meshes. In L. Leal-Taixé &#38; S. Roth (Eds.), <i>Computer Vision - ECCV 2018 Workshops - Munich, Germany, September 8-14, 2018, Proceedings, Part III</i> (Vol. 11131, pp. 349–362). Springer. <a href=\"https://doi.org/10.1007/978-3-030-11015-4_26\">https://doi.org/10.1007/978-3-030-11015-4_26</a>","bibtex":"@inproceedings{Lim_Dielen_Campen_Kobbelt_2018, series={Lecture Notes in Computer Science}, title={A Simple Approach to Intrinsic Correspondence Learning on Unstructured 3D Meshes}, volume={11131}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-11015-4_26\">10.1007/978-3-030-11015-4_26</a>}, booktitle={Computer Vision - ECCV 2018 Workshops - Munich, Germany, September 8-14, 2018, Proceedings, Part III}, publisher={Springer}, author={Lim, Isaak and Dielen, Alexander and Campen, Marcel and Kobbelt, Leif}, editor={Leal-Taixé, Laura and Roth, Stefan}, year={2018}, pages={349–362}, collection={Lecture Notes in Computer Science} }","ama":"Lim I, Dielen A, Campen M, Kobbelt L. A Simple Approach to Intrinsic Correspondence Learning on Unstructured 3D Meshes. In: Leal-Taixé L, Roth S, eds. <i>Computer Vision - ECCV 2018 Workshops - Munich, Germany, September 8-14, 2018, Proceedings, Part III</i>. Vol 11131. Lecture Notes in Computer Science. Springer; 2018:349–362. doi:<a href=\"https://doi.org/10.1007/978-3-030-11015-4_26\">10.1007/978-3-030-11015-4_26</a>","short":"I. Lim, A. Dielen, M. Campen, L. Kobbelt, in: L. Leal-Taixé, S. Roth (Eds.), Computer Vision - ECCV 2018 Workshops - Munich, Germany, September 8-14, 2018, Proceedings, Part III, Springer, 2018, pp. 349–362.","chicago":"Lim, Isaak, Alexander Dielen, Marcel Campen, and Leif Kobbelt. “A Simple Approach to Intrinsic Correspondence Learning on Unstructured 3D Meshes.” In <i>Computer Vision - ECCV 2018 Workshops - Munich, Germany, September 8-14, 2018, Proceedings, Part III</i>, edited by Laura Leal-Taixé and Stefan Roth, 11131:349–362. Lecture Notes in Computer Science. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-030-11015-4_26\">https://doi.org/10.1007/978-3-030-11015-4_26</a>."},"editor":[{"first_name":"Laura","last_name":"Leal-Taixé","full_name":"Leal-Taixé, Laura"},{"last_name":"Roth","first_name":"Stefan","full_name":"Roth, Stefan"}],"volume":11131,"user_id":"117512","_id":"60448","publisher":"Springer","page":"349–362","status":"public"},{"department":[{"_id":"969"}],"type":"journal_article","date_created":"2025-06-26T07:59:11Z","extern":"1","publication":"Computer Aided Geometric Design","doi":"10.1016/j.cagd.2018.03.003","language":[{"iso":"eng"}],"intvolume":"        62","date_updated":"2025-07-14T12:44:44Z","publication_status":"published","author":[{"full_name":"Zhou, Jiaran","first_name":"Jiaran","last_name":"Zhou"},{"first_name":"Marcel","orcid":"0000-0003-2340-3462","last_name":"Campen","full_name":"Campen, Marcel","id":"114904"},{"full_name":"Zorin, Denis","first_name":"Denis","last_name":"Zorin"},{"last_name":"Tu","first_name":"Changhe","full_name":"Tu, Changhe"},{"full_name":"Silva, Claudio T.","last_name":"Silva","first_name":"Claudio T."}],"publication_identifier":{"issn":["0167-8396"]},"year":"2018","title":"Quadrangulation of non-rigid objects using deformation metrics","citation":{"ieee":"J. Zhou, M. Campen, D. Zorin, C. Tu, and C. T. Silva, “Quadrangulation of non-rigid objects using deformation metrics,” <i>Computer Aided Geometric Design</i>, vol. 62, pp. 3–15, 2018, doi: <a href=\"https://doi.org/10.1016/j.cagd.2018.03.003\">10.1016/j.cagd.2018.03.003</a>.","mla":"Zhou, Jiaran, et al. “Quadrangulation of Non-Rigid Objects Using Deformation Metrics.” <i>Computer Aided Geometric Design</i>, vol. 62, Elsevier BV, 2018, pp. 3–15, doi:<a href=\"https://doi.org/10.1016/j.cagd.2018.03.003\">10.1016/j.cagd.2018.03.003</a>.","apa":"Zhou, J., Campen, M., Zorin, D., Tu, C., &#38; Silva, C. T. (2018). Quadrangulation of non-rigid objects using deformation metrics. <i>Computer Aided Geometric Design</i>, <i>62</i>, 3–15. <a href=\"https://doi.org/10.1016/j.cagd.2018.03.003\">https://doi.org/10.1016/j.cagd.2018.03.003</a>","bibtex":"@article{Zhou_Campen_Zorin_Tu_Silva_2018, title={Quadrangulation of non-rigid objects using deformation metrics}, volume={62}, DOI={<a href=\"https://doi.org/10.1016/j.cagd.2018.03.003\">10.1016/j.cagd.2018.03.003</a>}, journal={Computer Aided Geometric Design}, publisher={Elsevier BV}, author={Zhou, Jiaran and Campen, Marcel and Zorin, Denis and Tu, Changhe and Silva, Claudio T.}, year={2018}, pages={3–15} }","chicago":"Zhou, Jiaran, Marcel Campen, Denis Zorin, Changhe Tu, and Claudio T. Silva. “Quadrangulation of Non-Rigid Objects Using Deformation Metrics.” <i>Computer Aided Geometric Design</i> 62 (2018): 3–15. <a href=\"https://doi.org/10.1016/j.cagd.2018.03.003\">https://doi.org/10.1016/j.cagd.2018.03.003</a>.","ama":"Zhou J, Campen M, Zorin D, Tu C, Silva CT. Quadrangulation of non-rigid objects using deformation metrics. <i>Computer Aided Geometric Design</i>. 2018;62:3-15. doi:<a href=\"https://doi.org/10.1016/j.cagd.2018.03.003\">10.1016/j.cagd.2018.03.003</a>","short":"J. Zhou, M. Campen, D. Zorin, C. Tu, C.T. Silva, Computer Aided Geometric Design 62 (2018) 3–15."},"volume":62,"user_id":"117512","_id":"60391","publisher":"Elsevier BV","page":"3-15","status":"public"},{"doi":"10.17619/UNIPB/1-374","user_id":"14972","language":[{"iso":"eng"}],"_id":"15596","publisher":"Paderborn University","page":"109","main_file_link":[{"url":"https://digital.ub.uni-paderborn.de/hs/doi/10.17619/UNIPB/1-374","open_access":"1"}],"date_updated":"2026-03-10T12:22:50Z","author":[{"full_name":"Biehler, Rolf","last_name":"Biehler","first_name":"Rolf"},{"full_name":"Budde, Lea","first_name":"Lea","last_name":"Budde"},{"last_name":"Frischemeier","first_name":"Daniel","full_name":"Frischemeier, Daniel"},{"last_name":"Heinemann","first_name":"Birte","full_name":"Heinemann, Birte"},{"full_name":"Podworny, Susanne","first_name":"Susanne","last_name":"Podworny"},{"first_name":"Carsten","last_name":"Schulte","full_name":"Schulte, Carsten"},{"full_name":"Wassong, Thomas","last_name":"Wassong","first_name":"Thomas"}],"year":"2018","status":"public","title":"Paderborn Symposium on Data Science Education at School Level 2017: The Collected Extended Abstracts","oa":"1","department":[{"_id":"67"}],"type":"misc","place":"Paderborn","date_created":"2020-01-16T08:35:37Z","abstract":[{"text":"Data science is increasingly relevant in more and more areas of everyday life - but the general education at school so far has hardly responded to these specific changes in digitalization. Completely new challenges for the teaching of mathematics and computer science have emerged, as well as for the subjects of the social and cultural sciences field and for cross-curricular media education. All these subjects have to be reinterpreted in regard to the raising attention to data science, to big data and in regard to a fundamentally changing world of labor and economy. As a reaction, schools have to realize a broad general education that is to be newly defined on the one hand. On the other hand, school education has to stimulate and promote interest in the current, exciting and dynamic new scientific area of data science with its numerous applications. This book presents the extended abstracts of the presentations at a symposium held in November 2017, discussing economic, social and cultural impacts of big data and data science with experts in curriculum development and educational research in statistics and computer science as well as experts from different facets of data science and its applications. Moreover, analyses from a socio-cultural perspective were included. The main goal was to inspire ideas for teaching data science in secondary schools.","lang":"eng"}],"citation":{"ieee":"R. Biehler <i>et al.</i>, <i>Paderborn Symposium on Data Science Education at School Level 2017: The Collected Extended Abstracts</i>. Paderborn: Paderborn University, 2018.","apa":"Biehler, R., Budde, L., Frischemeier, D., Heinemann, B., Podworny, S., Schulte, C., &#38; Wassong, T. (2018). <i>Paderborn Symposium on Data Science Education at School Level 2017: The Collected Extended Abstracts</i>. Paderborn University. <a href=\"https://doi.org/10.17619/UNIPB/1-374\">https://doi.org/10.17619/UNIPB/1-374</a>","chicago":"Biehler, Rolf, Lea Budde, Daniel Frischemeier, Birte Heinemann, Susanne Podworny, Carsten Schulte, and Thomas Wassong. <i>Paderborn Symposium on Data Science Education at School Level 2017: The Collected Extended Abstracts</i>. Paderborn: Paderborn University, 2018. <a href=\"https://doi.org/10.17619/UNIPB/1-374\">https://doi.org/10.17619/UNIPB/1-374</a>.","short":"R. Biehler, L. Budde, D. Frischemeier, B. Heinemann, S. Podworny, C. Schulte, T. Wassong, Paderborn Symposium on Data Science Education at School Level 2017: The Collected Extended Abstracts, Paderborn University, Paderborn, 2018.","mla":"Biehler, Rolf, et al. <i>Paderborn Symposium on Data Science Education at School Level 2017: The Collected Extended Abstracts</i>. Paderborn University, 2018, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-374\">10.17619/UNIPB/1-374</a>.","bibtex":"@book{Biehler_Budde_Frischemeier_Heinemann_Podworny_Schulte_Wassong_2018, place={Paderborn}, title={Paderborn Symposium on Data Science Education at School Level 2017: The Collected Extended Abstracts}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-374\">10.17619/UNIPB/1-374</a>}, publisher={Paderborn University}, author={Biehler, Rolf and Budde, Lea and Frischemeier, Daniel and Heinemann, Birte and Podworny, Susanne and Schulte, Carsten and Wassong, Thomas}, year={2018} }","ama":"Biehler R, Budde L, Frischemeier D, et al. <i>Paderborn Symposium on Data Science Education at School Level 2017: The Collected Extended Abstracts</i>. Paderborn University; 2018. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-374\">10.17619/UNIPB/1-374</a>"}},{"language":[{"iso":"eng"}],"_id":"19604","user_id":"15415","doi":"10.17619/UNIPB/1-252","title":"Parallel fixed parameter tractable problems","status":"public","year":"2017","author":[{"last_name":"Li","first_name":"Shouwei","full_name":"Li, Shouwei"}],"date_updated":"2022-01-06T06:54:07Z","date_created":"2020-09-21T13:52:09Z","place":"Universität Paderborn","type":"dissertation","department":[{"_id":"63"}],"citation":{"short":"S. Li, Parallel Fixed Parameter Tractable Problems, Universität Paderborn, 2017.","chicago":"Li, Shouwei. <i>Parallel Fixed Parameter Tractable Problems</i>. Universität Paderborn, 2017. <a href=\"https://doi.org/10.17619/UNIPB/1-252\">https://doi.org/10.17619/UNIPB/1-252</a>.","ieee":"S. Li, <i>Parallel fixed parameter tractable problems</i>. Universität Paderborn, 2017.","apa":"Li, S. (2017). <i>Parallel fixed parameter tractable problems</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-252\">https://doi.org/10.17619/UNIPB/1-252</a>","bibtex":"@book{Li_2017, place={Universität Paderborn}, title={Parallel fixed parameter tractable problems}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-252\">10.17619/UNIPB/1-252</a>}, author={Li, Shouwei}, year={2017} }","ama":"Li S. <i>Parallel Fixed Parameter Tractable Problems</i>. Universität Paderborn; 2017. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-252\">10.17619/UNIPB/1-252</a>","mla":"Li, Shouwei. <i>Parallel Fixed Parameter Tractable Problems</i>. 2017, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-252\">10.17619/UNIPB/1-252</a>."},"supervisor":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"}],"related_material":{"link":[{"url":"10.17619/UNIPB/1-252 ","relation":"confirmation"}]}},{"_id":"2851","language":[{"iso":"eng"}],"user_id":"14052","doi":"10.1007/978-3-319-89920-6_57","ddc":["000"],"author":[{"last_name":"Markarian","first_name":"Christine","full_name":"Markarian, Christine","id":"37612"}],"conference":{"start_date":"Sept 6, 2017","location":"Berlin","end_date":"Sept 8, 2017"},"title":"Leasing with Uncertainty","year":"2017","status":"public","has_accepted_license":"1","date_updated":"2022-01-06T06:58:08Z","date_created":"2018-05-24T08:44:43Z","file":[{"file_id":"5537","content_type":"application/pdf","success":1,"file_name":"Markarian2018_Chapter_LeasingWithUncertainty.pdf","access_level":"closed","file_size":257103,"relation":"main_file","date_updated":"2018-11-13T13:16:30Z","date_created":"2018-11-13T13:16:30Z","creator":"feldi"}],"department":[{"_id":"63"}],"type":"conference","citation":{"mla":"Markarian, Christine. “Leasing with Uncertainty.” <i>International Conference on Operations Research (OR)</i>, 2017, doi:<a href=\"https://doi.org/10.1007/978-3-319-89920-6_57\">10.1007/978-3-319-89920-6_57</a>.","apa":"Markarian, C. (2017). Leasing with Uncertainty. In <i>International Conference on Operations Research (OR)</i>. Berlin. <a href=\"https://doi.org/10.1007/978-3-319-89920-6_57\">https://doi.org/10.1007/978-3-319-89920-6_57</a>","ieee":"C. Markarian, “Leasing with Uncertainty,” in <i>International Conference on Operations Research (OR)</i>, Berlin, 2017.","ama":"Markarian C. Leasing with Uncertainty. In: <i>International Conference on Operations Research (OR)</i>. ; 2017. doi:<a href=\"https://doi.org/10.1007/978-3-319-89920-6_57\">10.1007/978-3-319-89920-6_57</a>","short":"C. Markarian, in: International Conference on Operations Research (OR), 2017.","chicago":"Markarian, Christine. “Leasing with Uncertainty.” In <i>International Conference on Operations Research (OR)</i>, 2017. <a href=\"https://doi.org/10.1007/978-3-319-89920-6_57\">https://doi.org/10.1007/978-3-319-89920-6_57</a>.","bibtex":"@inproceedings{Markarian_2017, title={Leasing with Uncertainty}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-89920-6_57\">10.1007/978-3-319-89920-6_57</a>}, booktitle={International Conference on Operations Research (OR)}, author={Markarian, Christine}, year={2017} }"},"file_date_updated":"2018-11-13T13:16:30Z","publication":"International Conference on Operations Research (OR)","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}]},{"date_created":"2021-09-10T10:19:40Z","department":[{"_id":"355"}],"type":"journal_article","citation":{"short":"A. Ramaswamy, S. Bhatnagar, IEEE Transactions on Automatic Control 63 (2017) 1465–1471.","chicago":"Ramaswamy, Arunselvan, and Shalabh Bhatnagar. “Analysis of Gradient Descent Methods with Nondiminishing Bounded Errors.” <i>IEEE Transactions on Automatic Control</i> 63, no. 5 (2017): 1465–71.","ieee":"A. Ramaswamy and S. Bhatnagar, “Analysis of gradient descent methods with nondiminishing bounded errors,” <i>IEEE Transactions on Automatic Control</i>, vol. 63, no. 5, pp. 1465–1471, 2017.","apa":"Ramaswamy, A., &#38; Bhatnagar, S. (2017). Analysis of gradient descent methods with nondiminishing bounded errors. <i>IEEE Transactions on Automatic Control</i>, <i>63</i>(5), 1465–1471.","bibtex":"@article{Ramaswamy_Bhatnagar_2017, title={Analysis of gradient descent methods with nondiminishing bounded errors}, volume={63}, number={5}, journal={IEEE Transactions on Automatic Control}, publisher={IEEE}, author={Ramaswamy, Arunselvan and Bhatnagar, Shalabh}, year={2017}, pages={1465–1471} }","ama":"Ramaswamy A, Bhatnagar S. Analysis of gradient descent methods with nondiminishing bounded errors. <i>IEEE Transactions on Automatic Control</i>. 2017;63(5):1465-1471.","mla":"Ramaswamy, Arunselvan, and Shalabh Bhatnagar. “Analysis of Gradient Descent Methods with Nondiminishing Bounded Errors.” <i>IEEE Transactions on Automatic Control</i>, vol. 63, no. 5, IEEE, 2017, pp. 1465–71."},"issue":"5","publication":"IEEE Transactions on Automatic Control","extern":"1","_id":"24152","publisher":"IEEE","language":[{"iso":"eng"}],"page":"1465-1471","volume":63,"user_id":"66937","author":[{"first_name":"Arunselvan","orcid":"https://orcid.org/ 0000-0001-7547-8111","last_name":"Ramaswamy","full_name":"Ramaswamy, Arunselvan","id":"66937"},{"first_name":"Shalabh","last_name":"Bhatnagar","full_name":"Bhatnagar, Shalabh"}],"status":"public","year":"2017","title":"Analysis of gradient descent methods with nondiminishing bounded errors","intvolume":"        63","date_updated":"2022-01-06T06:56:08Z"},{"language":[{"iso":"eng"}],"_id":"24153","publisher":"INFORMS","page":"648-661","volume":42,"user_id":"66937","author":[{"first_name":"Arunselvan","last_name":"Ramaswamy","orcid":"https://orcid.org/ 0000-0001-7547-8111","full_name":"Ramaswamy, Arunselvan","id":"66937"},{"full_name":"Bhatnagar, Shalabh","first_name":"Shalabh","last_name":"Bhatnagar"}],"title":"A generalization of the Borkar-Meyn theorem for stochastic recursive inclusions","year":"2017","status":"public","intvolume":"        42","date_updated":"2022-01-06T06:56:08Z","date_created":"2021-09-10T10:21:02Z","department":[{"_id":"355"}],"type":"journal_article","citation":{"short":"A. Ramaswamy, S. Bhatnagar, Mathematics of Operations Research 42 (2017) 648–661.","chicago":"Ramaswamy, Arunselvan, and Shalabh Bhatnagar. “A Generalization of the Borkar-Meyn Theorem for Stochastic Recursive Inclusions.” <i>Mathematics of Operations Research</i> 42, no. 3 (2017): 648–61.","ieee":"A. Ramaswamy and S. Bhatnagar, “A generalization of the Borkar-Meyn theorem for stochastic recursive inclusions,” <i>Mathematics of Operations Research</i>, vol. 42, no. 3, pp. 648–661, 2017.","apa":"Ramaswamy, A., &#38; Bhatnagar, S. (2017). A generalization of the Borkar-Meyn theorem for stochastic recursive inclusions. <i>Mathematics of Operations Research</i>, <i>42</i>(3), 648–661.","bibtex":"@article{Ramaswamy_Bhatnagar_2017, title={A generalization of the Borkar-Meyn theorem for stochastic recursive inclusions}, volume={42}, number={3}, journal={Mathematics of Operations Research}, publisher={INFORMS}, author={Ramaswamy, Arunselvan and Bhatnagar, Shalabh}, year={2017}, pages={648–661} }","ama":"Ramaswamy A, Bhatnagar S. A generalization of the Borkar-Meyn theorem for stochastic recursive inclusions. <i>Mathematics of Operations Research</i>. 2017;42(3):648-661.","mla":"Ramaswamy, Arunselvan, and Shalabh Bhatnagar. “A Generalization of the Borkar-Meyn Theorem for Stochastic Recursive Inclusions.” <i>Mathematics of Operations Research</i>, vol. 42, no. 3, INFORMS, 2017, pp. 648–61."},"publication":"Mathematics of Operations Research","issue":"3","extern":"1"},{"publication":"International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017)","citation":{"mla":"Khaluf, Yara, et al. “Scheduling Access to Shared Space in Multi-Robot Systems.” <i>International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017)</i>, 2017, doi:<a href=\"https://doi.org/10.1007/978-3-319-59930-4_12\">10.1007/978-3-319-59930-4_12</a>.","ama":"Khaluf Y, Markarian C, Simoens P, Reina A. Scheduling Access to Shared Space in Multi-robot Systems. In: <i>International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017)</i>. ; 2017. doi:<a href=\"https://doi.org/10.1007/978-3-319-59930-4_12\">10.1007/978-3-319-59930-4_12</a>","bibtex":"@inproceedings{Khaluf_Markarian_Simoens_Reina_2017, place={Cham}, title={Scheduling Access to Shared Space in Multi-robot Systems}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-59930-4_12\">10.1007/978-3-319-59930-4_12</a>}, booktitle={International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017)}, author={Khaluf, Yara and Markarian, Christine and Simoens, Pieter and Reina, Andreagiovanni}, year={2017} }","apa":"Khaluf, Y., Markarian, C., Simoens, P., &#38; Reina, A. (2017). Scheduling Access to Shared Space in Multi-robot Systems. <i>International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017)</i>. <a href=\"https://doi.org/10.1007/978-3-319-59930-4_12\">https://doi.org/10.1007/978-3-319-59930-4_12</a>","ieee":"Y. Khaluf, C. Markarian, P. Simoens, and A. Reina, “Scheduling Access to Shared Space in Multi-robot Systems,” 2017, doi: <a href=\"https://doi.org/10.1007/978-3-319-59930-4_12\">10.1007/978-3-319-59930-4_12</a>.","chicago":"Khaluf, Yara, Christine Markarian, Pieter Simoens, and Andreagiovanni Reina. “Scheduling Access to Shared Space in Multi-Robot Systems.” In <i>International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017)</i>. Cham, 2017. <a href=\"https://doi.org/10.1007/978-3-319-59930-4_12\">https://doi.org/10.1007/978-3-319-59930-4_12</a>.","short":"Y. Khaluf, C. Markarian, P. Simoens, A. Reina, in: International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017), Cham, 2017."},"abstract":[{"text":"Through this study, we introduce the idea of applying scheduling techniques to allocate spatial resources that are shared among multiple robots moving in a static environment and having temporal constraints on the arrival time to destinations. To illustrate this idea, we present an exemplified algorithm that plans and assigns a motion path to each robot. The considered problem is particularly challenging because: (i) the robots share the same environment and thus the planner must take into account overlapping paths which cannot happen at the same time; (ii) there are time deadlines thus the planner must deal with temporal constraints; (iii) new requests arrive without a priori knowledge thus the planner must be able to add new paths online and adjust old plans; (iv) the robot motion is subject to noise thus the planner must be reactive to adapt to online changes. We showcase the functioning of the proposed algorithm through a set of agent-based simulations.","lang":"eng"}],"date_created":"2021-09-14T12:41:58Z","place":"Cham","type":"conference","department":[{"_id":"63"}],"status":"public","year":"2017","title":"Scheduling Access to Shared Space in Multi-robot Systems","publication_identifier":{"issn":["0302-9743","1611-3349"]},"author":[{"full_name":"Khaluf, Yara","last_name":"Khaluf","first_name":"Yara"},{"first_name":"Christine","last_name":"Markarian","full_name":"Markarian, Christine"},{"full_name":"Simoens, Pieter","last_name":"Simoens","first_name":"Pieter"},{"last_name":"Reina","first_name":"Andreagiovanni","full_name":"Reina, Andreagiovanni"}],"publication_status":"published","date_updated":"2022-01-06T06:56:19Z","_id":"24398","language":[{"iso":"eng"}],"user_id":"15415","doi":"10.1007/978-3-319-59930-4_12"},{"page":"255-275","language":[{"iso":"eng"}],"_id":"26426","user_id":"71124","volume":"11:2","year":"2017","title":"Challenges for Annotation Concepts in Music","status":"public","author":[{"first_name":"Aristotelis","last_name":"Hadjakos","full_name":"Hadjakos, Aristotelis"},{"last_name":"Iffland","first_name":" Joachim","full_name":"Iffland,  Joachim"},{"first_name":"Reinhard","last_name":" Keil","full_name":" Keil, Reinhard"},{"full_name":"Oberhoff, Andreas","first_name":"Andreas","last_name":"Oberhoff"},{"full_name":"Veit, Joachim","first_name":"Joachim","last_name":"Veit"}],"date_updated":"2022-01-06T06:57:20Z","publication_status":"published","date_created":"2021-10-18T18:45:13Z","type":"journal_article","department":[{"_id":"71"}],"publication":"International Journal of Humanities and Arts Computing","citation":{"short":"A. Hadjakos,  Joachim Iffland, R.  Keil, A. Oberhoff, J. Veit, International Journal of Humanities and Arts Computing 11:2 (2017) 255–275.","chicago":"Hadjakos, Aristotelis,  Joachim Iffland, Reinhard  Keil, Andreas Oberhoff, and Joachim Veit. “Challenges for Annotation Concepts in Music.” <i>International Journal of Humanities and Arts Computing</i> 11:2 (2017): 255–75.","ieee":"A. Hadjakos,  Joachim Iffland, R.  Keil, A. Oberhoff, and J. Veit, “Challenges for Annotation Concepts in Music,” <i>International Journal of Humanities and Arts Computing</i>, vol. 11:2, pp. 255–275, 2017.","apa":"Hadjakos, A., Iffland,  Joachim,  Keil, R., Oberhoff, A., &#38; Veit, J. (2017). Challenges for Annotation Concepts in Music. <i>International Journal of Humanities and Arts Computing</i>, <i>11:2</i>, 255–275.","bibtex":"@article{Hadjakos_Iffland_ Keil_Oberhoff_Veit_2017, title={Challenges for Annotation Concepts in Music}, volume={11:2}, journal={International Journal of Humanities and Arts Computing}, author={Hadjakos, Aristotelis and Iffland,  Joachim and  Keil, Reinhard and Oberhoff, Andreas and Veit, Joachim}, year={2017}, pages={255–275} }","ama":"Hadjakos A, Iffland  Joachim,  Keil R, Oberhoff A, Veit J. Challenges for Annotation Concepts in Music. <i>International Journal of Humanities and Arts Computing</i>. 2017;11:2:255-275.","mla":"Hadjakos, Aristotelis, et al. “Challenges for Annotation Concepts in Music.” <i>International Journal of Humanities and Arts Computing</i>, vol. 11:2, 2017, pp. 255–75."}}]