[{"publist_id":"7736","file_date_updated":"2020-07-14T12:45:18Z","license":"https://creativecommons.org/licenses/by/4.0/","related_material":{"record":[{"relation":"later_version","status":"public","id":"7108"}]},"author":[{"full_name":"Goaoc, Xavier","last_name":"Goaoc","first_name":"Xavier"},{"full_name":"Paták, Pavel","last_name":"Paták","first_name":"Pavel"},{"full_name":"Patakova, Zuzana","first_name":"Zuzana","last_name":"Patakova","id":"48B57058-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3975-1683"},{"orcid":"0000-0002-1191-6714","id":"38AC689C-F248-11E8-B48F-1D18A9856A87","last_name":"Tancer","first_name":"Martin","full_name":"Tancer, Martin"},{"full_name":"Wagner, Uli","orcid":"0000-0002-1494-0568","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner","first_name":"Uli"}],"volume":99,"date_created":"2018-12-11T11:45:04Z","date_updated":"2023-09-06T11:10:57Z","acknowledgement":"Partially supported by the project EMBEDS II (CZ: 7AMB17FR029, FR: 38087RM) of Czech-French collaboration.","year":"2018","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"UlWa"}],"publication_status":"published","month":"06","doi":"10.4230/LIPIcs.SoCG.2018.41","conference":{"start_date":"2018-06-11","location":"Budapest, Hungary","end_date":"2018-06-14","name":"SoCG: Symposium on Computational Geometry"},"language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","abstract":[{"lang":"eng","text":"We prove that for every d ≥ 2, deciding if a pure, d-dimensional, simplicial complex is shellable is NP-hard, hence NP-complete. This resolves a question raised, e.g., by Danaraj and Klee in 1978. Our reduction also yields that for every d ≥ 2 and k ≥ 0, deciding if a pure, d-dimensional, simplicial complex is k-decomposable is NP-hard. For d ≥ 3, both problems remain NP-hard when restricted to contractible pure d-dimensional complexes."}],"type":"conference","alternative_title":["Leibniz International Proceedings in Information, LIPIcs"],"file":[{"file_name":"2018_LIPIcs_Goaoc.pdf","access_level":"open_access","creator":"dernst","file_size":718414,"content_type":"application/pdf","file_id":"5725","relation":"main_file","date_updated":"2020-07-14T12:45:18Z","date_created":"2018-12-17T16:35:02Z","checksum":"d12bdd60f04a57307867704b5f930afd"}],"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"184","intvolume":" 99","ddc":["516","000"],"status":"public","title":"Shellability is NP-complete","has_accepted_license":"1","day":"11","scopus_import":1,"date_published":"2018-06-11T00:00:00Z","citation":{"ama":"Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. Shellability is NP-complete. In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018:41:1-41:16. doi:10.4230/LIPIcs.SoCG.2018.41","ista":"Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. 2018. Shellability is NP-complete. SoCG: Symposium on Computational Geometry, Leibniz International Proceedings in Information, LIPIcs, vol. 99, 41:1-41:16.","ieee":"X. Goaoc, P. Paták, Z. Patakova, M. Tancer, and U. Wagner, “Shellability is NP-complete,” presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99, p. 41:1-41:16.","apa":"Goaoc, X., Paták, P., Patakova, Z., Tancer, M., & Wagner, U. (2018). Shellability is NP-complete (Vol. 99, p. 41:1-41:16). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2018.41","mla":"Goaoc, Xavier, et al. Shellability Is NP-Complete. Vol. 99, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 41:1-41:16, doi:10.4230/LIPIcs.SoCG.2018.41.","short":"X. Goaoc, P. Paták, Z. Patakova, M. Tancer, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 41:1-41:16.","chicago":"Goaoc, Xavier, Pavel Paták, Zuzana Patakova, Martin Tancer, and Uli Wagner. “Shellability Is NP-Complete,” 99:41:1-41:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.SoCG.2018.41."},"page":"41:1 - 41:16"},{"file_date_updated":"2020-07-14T12:45:51Z","publist_id":"7614","article_number":"46","date_created":"2018-12-11T11:45:37Z","date_updated":"2023-09-06T11:13:41Z","volume":99,"author":[{"orcid":"0000-0002-5445-5057","id":"33C26278-F248-11E8-B48F-1D18A9856A87","last_name":"Huszár","first_name":"Kristóf","full_name":"Huszár, Kristóf"},{"first_name":"Jonathan","last_name":"Spreer","full_name":"Spreer, Jonathan"},{"first_name":"Uli","last_name":"Wagner","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1494-0568","full_name":"Wagner, Uli"}],"related_material":{"record":[{"status":"public","relation":"later_version","id":"7093"}]},"publication_status":"published","department":[{"_id":"UlWa"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","acknowledgement":"Research of the second author was supported by the Einstein Foundation (project “Einstein Visiting Fellow Santos”) and by the Simons Foundation (“Simons Visiting Professors” program).","year":"2018","month":"06","publication_identifier":{"issn":["18688969"]},"language":[{"iso":"eng"}],"conference":{"name":"SoCG: Symposium on Computational Geometry","end_date":"2018-06-14","location":"Budapest, Hungary","start_date":"2018-06-11"},"doi":"10.4230/LIPIcs.SoCG.2018.46","quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["1712.00434"]},"abstract":[{"text":"In graph theory, as well as in 3-manifold topology, there exist several width-type parameters to describe how "simple" or "thin" a given graph or 3-manifold is. These parameters, such as pathwidth or treewidth for graphs, or the concept of thin position for 3-manifolds, play an important role when studying algorithmic problems; in particular, there is a variety of problems in computational 3-manifold topology - some of them known to be computationally hard in general - that become solvable in polynomial time as soon as the dual graph of the input triangulation has bounded treewidth. In view of these algorithmic results, it is natural to ask whether every 3-manifold admits a triangulation of bounded treewidth. We show that this is not the case, i.e., that there exists an infinite family of closed 3-manifolds not admitting triangulations of bounded pathwidth or treewidth (the latter implies the former, but we present two separate proofs). We derive these results from work of Agol and of Scharlemann and Thompson, by exhibiting explicit connections between the topology of a 3-manifold M on the one hand and width-type parameters of the dual graphs of triangulations of M on the other hand, answering a question that had been raised repeatedly by researchers in computational 3-manifold topology. In particular, we show that if a closed, orientable, irreducible, non-Haken 3-manifold M has a triangulation of treewidth (resp. pathwidth) k then the Heegaard genus of M is at most 48(k+1) (resp. 4(3k+1)).","lang":"eng"}],"alternative_title":["LIPIcs"],"type":"conference","file":[{"checksum":"530d084116778135d5bffaa317479cac","date_created":"2018-12-17T15:32:38Z","date_updated":"2020-07-14T12:45:51Z","relation":"main_file","file_id":"5713","content_type":"application/pdf","file_size":642522,"creator":"dernst","access_level":"open_access","file_name":"2018_LIPIcs_Huszar.pdf"}],"oa_version":"Submitted Version","ddc":["516","000"],"status":"public","title":"On the treewidth of triangulated 3-manifolds","intvolume":" 99","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"285","day":"01","article_processing_charge":"No","has_accepted_license":"1","scopus_import":1,"date_published":"2018-06-01T00:00:00Z","citation":{"short":"K. Huszár, J. Spreer, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.","mla":"Huszár, Kristóf, et al. On the Treewidth of Triangulated 3-Manifolds. Vol. 99, 46, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPIcs.SoCG.2018.46.","chicago":"Huszár, Kristóf, Jonathan Spreer, and Uli Wagner. “On the Treewidth of Triangulated 3-Manifolds,” Vol. 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.SoCG.2018.46.","ama":"Huszár K, Spreer J, Wagner U. On the treewidth of triangulated 3-manifolds. In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPIcs.SoCG.2018.46","apa":"Huszár, K., Spreer, J., & Wagner, U. (2018). On the treewidth of triangulated 3-manifolds (Vol. 99). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2018.46","ieee":"K. Huszár, J. Spreer, and U. Wagner, “On the treewidth of triangulated 3-manifolds,” presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99.","ista":"Huszár K, Spreer J, Wagner U. 2018. On the treewidth of triangulated 3-manifolds. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 99, 46."}},{"day":"07","month":"12","article_processing_charge":"No","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"citation":{"ama":"Garriga E, di Tommaso P, Magis C, et al. Fast and accurate large multiple sequence alignments with a root-to-leaf regressive method. 2018. doi:10.5281/ZENODO.2025846","apa":"Garriga, E., di Tommaso, P., Magis, C., Erb, I., Mansouri, L., Baltzis, A., … Notredame, C. (2018). Fast and accurate large multiple sequence alignments with a root-to-leaf regressive method. Zenodo. https://doi.org/10.5281/ZENODO.2025846","ieee":"E. Garriga et al., “Fast and accurate large multiple sequence alignments with a root-to-leaf regressive method.” Zenodo, 2018.","ista":"Garriga E, di Tommaso P, Magis C, Erb I, Mansouri L, Baltzis A, Laayouni H, Kondrashov F, Floden E, Notredame C. 2018. Fast and accurate large multiple sequence alignments with a root-to-leaf regressive method, Zenodo, 10.5281/ZENODO.2025846.","short":"E. Garriga, P. di Tommaso, C. Magis, I. Erb, L. Mansouri, A. Baltzis, H. Laayouni, F. Kondrashov, E. Floden, C. Notredame, (2018).","mla":"Garriga, Edgar, et al. Fast and Accurate Large Multiple Sequence Alignments with a Root-to-Leaf Regressive Method. Zenodo, 2018, doi:10.5281/ZENODO.2025846.","chicago":"Garriga, Edgar, Paolo di Tommaso, Cedrik Magis, Ionas Erb, Leila Mansouri, Athanasios Baltzis, Hafid Laayouni, Fyodor Kondrashov, Evan Floden, and Cedric Notredame. “Fast and Accurate Large Multiple Sequence Alignments with a Root-to-Leaf Regressive Method.” Zenodo, 2018. https://doi.org/10.5281/ZENODO.2025846."},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.5281/zenodo.3271452"}],"doi":"10.5281/ZENODO.2025846","date_published":"2018-12-07T00:00:00Z","type":"research_data_reference","abstract":[{"lang":"eng","text":"This dataset contains a GitHub repository containing all the data, analysis, Nextflow workflows and Jupyter notebooks to replicate the manuscript titled \"Fast and accurate large multiple sequence alignments with a root-to-leaf regressive method\".\r\nIt also contains the Multiple Sequence Alignments (MSAs) generated and well as the main figures and tables from the manuscript.\r\nThe repository is also available at GitHub (https://github.com/cbcrg/dpa-analysis) release `v1.2`.\r\nFor details on how to use the regressive alignment algorithm, see the T-Coffee software suite (https://github.com/cbcrg/tcoffee)."}],"status":"public","title":"Fast and accurate large multiple sequence alignments with a root-to-leaf regressive method","ddc":["570"],"department":[{"_id":"FyKo"}],"publisher":"Zenodo","_id":"13059","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2018","date_updated":"2023-09-06T14:32:51Z","date_created":"2023-05-23T16:08:20Z","oa_version":"Published Version","author":[{"full_name":"Garriga, Edgar","first_name":"Edgar","last_name":"Garriga"},{"full_name":"di Tommaso, Paolo","first_name":"Paolo","last_name":"di Tommaso"},{"full_name":"Magis, Cedrik","last_name":"Magis","first_name":"Cedrik"},{"full_name":"Erb, Ionas","first_name":"Ionas","last_name":"Erb"},{"full_name":"Mansouri, Leila","first_name":"Leila","last_name":"Mansouri"},{"full_name":"Baltzis, Athanasios","last_name":"Baltzis","first_name":"Athanasios"},{"last_name":"Laayouni","first_name":"Hafid","full_name":"Laayouni, Hafid"},{"first_name":"Fyodor","last_name":"Kondrashov","id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8243-4694","full_name":"Kondrashov, Fyodor"},{"first_name":"Evan","last_name":"Floden","full_name":"Floden, Evan"},{"full_name":"Notredame, Cedric","last_name":"Notredame","first_name":"Cedric"}],"related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"7181"}]}},{"file_date_updated":"2020-07-14T12:46:35Z","publist_id":"8005","year":"2018","publication_status":"published","department":[{"_id":"GeKa"}],"publisher":"Institute of Science and Technology Austria","author":[{"full_name":"Watzinger, Hannes","last_name":"Watzinger","first_name":"Hannes","id":"35DF8E50-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2018-12-11T11:44:21Z","date_updated":"2023-09-07T12:27:43Z","month":"07","publication_identifier":{"issn":["2663-337X"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"doi":"10.15479/AT:ISTA:th_1033","degree_awarded":"PhD","supervisor":[{"id":"38DB5788-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8342-202X","first_name":"Georgios","last_name":"Katsaros","full_name":"Katsaros, Georgios"}],"language":[{"iso":"eng"}],"type":"dissertation","alternative_title":["ISTA Thesis"],"abstract":[{"text":"Nowadays, quantum computation is receiving more and more attention as an alternative to the classical way of computing. For realizing a quantum computer, different devices are investigated as potential quantum bits. In this thesis, the focus is on Ge hut wires, which turned out to be promising candidates for implementing hole spin quantum bits. The advantages of Ge as a material system are the low hyperfine interaction for holes and the strong spin orbit coupling, as well as the compatibility with the highly developed CMOS processes in industry. In addition, Ge can also be isotopically purified which is expected to boost the spin coherence times. The strong spin orbit interaction for holes in Ge on the one hand enables the full electrical control of the quantum bit and on the other hand should allow short spin manipulation times. Starting with a bare Si wafer, this work covers the entire process reaching from growth over the fabrication and characterization of hut wire devices up to the demonstration of hole spin resonance. From experiments with single quantum dots, a large g-factor anisotropy between the in-plane and the out-of-plane direction was found. A comparison to a theoretical model unveiled the heavy-hole character of the lowest energy states. The second part of the thesis addresses double quantum dot devices, which were realized by adding two gate electrodes to a hut wire. In such devices, Pauli spin blockade was observed, which can serve as a read-out mechanism for spin quantum bits. Applying oscillating electric fields in spin blockade allowed the demonstration of continuous spin rotations and the extraction of a lower bound for the spin dephasing time. Despite the strong spin orbit coupling in Ge, the obtained value for the dephasing time is comparable to what has been recently reported for holes in Si. All in all, the presented results point out the high potential of Ge hut wires as a platform for long-lived, fast and fully electrically tunable hole spin quantum bits.","lang":"eng"}],"_id":"49","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","ddc":["530"],"title":"Ge hut wires - from growth to hole spin resonance","status":"public","pubrep_id":"1033","oa_version":"Published Version","file":[{"relation":"main_file","file_id":"6249","checksum":"b653b5216251f938ddbeafd1de88667c","date_created":"2019-04-09T07:13:28Z","date_updated":"2020-07-14T12:46:35Z","access_level":"open_access","file_name":"2018_Thesis_Watzinger.pdf","file_size":85539748,"content_type":"application/pdf","creator":"dernst"},{"content_type":"application/zip","file_size":21830697,"creator":"dernst","access_level":"closed","file_name":"2018_Thesis_Watzinger_source.zip","checksum":"39bcf8de7ac5b1bb516b11ce2f966785","date_created":"2019-04-09T07:13:27Z","date_updated":"2020-07-14T12:46:35Z","relation":"source_file","file_id":"6250"}],"day":"30","article_processing_charge":"No","has_accepted_license":"1","citation":{"short":"H. Watzinger, Ge Hut Wires - from Growth to Hole Spin Resonance, Institute of Science and Technology Austria, 2018.","mla":"Watzinger, Hannes. Ge Hut Wires - from Growth to Hole Spin Resonance. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:th_1033.","chicago":"Watzinger, Hannes. “Ge Hut Wires - from Growth to Hole Spin Resonance.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:th_1033.","ama":"Watzinger H. Ge hut wires - from growth to hole spin resonance. 2018. doi:10.15479/AT:ISTA:th_1033","ieee":"H. Watzinger, “Ge hut wires - from growth to hole spin resonance,” Institute of Science and Technology Austria, 2018.","apa":"Watzinger, H. (2018). Ge hut wires - from growth to hole spin resonance. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_1033","ista":"Watzinger H. 2018. Ge hut wires - from growth to hole spin resonance. Institute of Science and Technology Austria."},"page":"77","date_published":"2018-07-30T00:00:00Z"},{"oa":1,"language":[{"iso":"eng"}],"supervisor":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","first_name":"Herbert","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert"}],"degree_awarded":"PhD","doi":"10.15479/AT:ISTA:th_1026","publication_identifier":{"issn":["2663-337X"]},"month":"06","department":[{"_id":"HeEd"}],"publisher":"Institute of Science and Technology Austria","publication_status":"published","year":"2018","date_created":"2018-12-11T11:45:10Z","date_updated":"2023-09-07T12:25:32Z","author":[{"id":"41B58C0C-F248-11E8-B48F-1D18A9856A87","first_name":"Mabel","last_name":"Iglesias Ham","full_name":"Iglesias Ham, Mabel"}],"publist_id":"7712","file_date_updated":"2020-07-14T12:45:24Z","page":"171","citation":{"ista":"Iglesias Ham M. 2018. Multiple covers with balls. Institute of Science and Technology Austria.","ieee":"M. Iglesias Ham, “Multiple covers with balls,” Institute of Science and Technology Austria, 2018.","apa":"Iglesias Ham, M. (2018). Multiple covers with balls. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_1026","ama":"Iglesias Ham M. Multiple covers with balls. 2018. doi:10.15479/AT:ISTA:th_1026","chicago":"Iglesias Ham, Mabel. “Multiple Covers with Balls.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:th_1026.","mla":"Iglesias Ham, Mabel. Multiple Covers with Balls. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:th_1026.","short":"M. Iglesias Ham, Multiple Covers with Balls, Institute of Science and Technology Austria, 2018."},"date_published":"2018-06-11T00:00:00Z","has_accepted_license":"1","article_processing_charge":"No","day":"11","title":"Multiple covers with balls","ddc":["514","516"],"status":"public","_id":"201","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Published Version","file":[{"file_id":"5918","relation":"source_file","checksum":"dd699303623e96d1478a6ae07210dd05","date_created":"2019-02-05T07:43:31Z","date_updated":"2020-07-14T12:45:24Z","access_level":"closed","file_name":"IST-2018-1025-v2+5_ist-thesis-iglesias-11June2018(1).zip","creator":"kschuh","file_size":11827713,"content_type":"application/zip"},{"file_id":"5919","relation":"main_file","checksum":"ba163849a190d2b41d66fef0e4983294","date_updated":"2020-07-14T12:45:24Z","date_created":"2019-02-05T07:43:45Z","access_level":"open_access","file_name":"IST-2018-1025-v2+4_ThesisIglesiasFinal11June2018.pdf","creator":"kschuh","file_size":4783846,"content_type":"application/pdf"}],"pubrep_id":"1026","alternative_title":["ISTA Thesis"],"type":"dissertation","abstract":[{"lang":"eng","text":"We describe arrangements of three-dimensional spheres from a geometrical and topological point of view. Real data (fitting this setup) often consist of soft spheres which show certain degree of deformation while strongly packing against each other. In this context, we answer the following questions: If we model a soft packing of spheres by hard spheres that are allowed to overlap, can we measure the volume in the overlapped areas? Can we be more specific about the overlap volume, i.e. quantify how much volume is there covered exactly twice, three times, or k times? What would be a good optimization criteria that rule the arrangement of soft spheres while making a good use of the available space? Fixing a particular criterion, what would be the optimal sphere configuration? The first result of this thesis are short formulas for the computation of volumes covered by at least k of the balls. The formulas exploit information contained in the order-k Voronoi diagrams and its closely related Level-k complex. The used complexes lead to a natural generalization into poset diagrams, a theoretical formalism that contains the order-k and degree-k diagrams as special cases. In parallel, we define different criteria to determine what could be considered an optimal arrangement from a geometrical point of view. Fixing a criterion, we find optimal soft packing configurations in 2D and 3D where the ball centers lie on a lattice. As a last step, we use tools from computational topology on real physical data, to show the potentials of higher-order diagrams in the description of melting crystals. The results of the experiments leaves us with an open window to apply the theories developed in this thesis in real applications."}]},{"ddc":["004","519"],"title":"Learning from dependent data","status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"68","oa_version":"Published Version","file":[{"checksum":"e849dd40a915e4d6c5572b51b517f098","date_created":"2019-04-09T07:32:47Z","date_updated":"2020-07-14T12:47:40Z","relation":"main_file","file_id":"6253","file_size":1036137,"content_type":"application/pdf","creator":"dernst","access_level":"open_access","file_name":"2018_Thesis_Zimin.pdf"},{"checksum":"da092153cec55c97461bd53c45c5d139","date_created":"2019-04-09T07:32:47Z","date_updated":"2020-07-14T12:47:40Z","relation":"source_file","file_id":"6254","file_size":637490,"content_type":"application/zip","creator":"dernst","access_level":"closed","file_name":"2018_Thesis_Zimin_Source.zip"}],"pubrep_id":"1048","alternative_title":["ISTA Thesis"],"type":"dissertation","abstract":[{"lang":"eng","text":"The most common assumption made in statistical learning theory is the assumption of the independent and identically distributed (i.i.d.) data. While being very convenient mathematically, it is often very clearly violated in practice. This disparity between the machine learning theory and applications underlies a growing demand in the development of algorithms that learn from dependent data and theory that can provide generalization guarantees similar to the independent situations. This thesis is dedicated to two variants of dependencies that can arise in practice. One is a dependence on the level of samples in a single learning task. Another dependency type arises in the multi-task setting when the tasks are dependent on each other even though the data for them can be i.i.d. In both cases we model the data (samples or tasks) as stochastic processes and introduce new algorithms for both settings that take into account and exploit the resulting dependencies. We prove the theoretical guarantees on the performance of the introduced algorithms under different evaluation criteria and, in addition, we compliment the theoretical study by the empirical one, where we evaluate some of the algorithms on two real world datasets to highlight their practical applicability."}],"page":"92","citation":{"ista":"Zimin A. 2018. Learning from dependent data. Institute of Science and Technology Austria.","apa":"Zimin, A. (2018). Learning from dependent data. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:TH1048","ieee":"A. Zimin, “Learning from dependent data,” Institute of Science and Technology Austria, 2018.","ama":"Zimin A. Learning from dependent data. 2018. doi:10.15479/AT:ISTA:TH1048","chicago":"Zimin, Alexander. “Learning from Dependent Data.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:TH1048.","mla":"Zimin, Alexander. Learning from Dependent Data. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:TH1048.","short":"A. Zimin, Learning from Dependent Data, Institute of Science and Technology Austria, 2018."},"date_published":"2018-09-01T00:00:00Z","article_processing_charge":"No","has_accepted_license":"1","day":"01","department":[{"_id":"ChLa"}],"publisher":"Institute of Science and Technology Austria","publication_status":"published","year":"2018","date_created":"2018-12-11T11:44:27Z","date_updated":"2023-09-07T12:29:07Z","author":[{"full_name":"Zimin, Alexander","id":"37099E9C-F248-11E8-B48F-1D18A9856A87","first_name":"Alexander","last_name":"Zimin"}],"ec_funded":1,"publist_id":"7986","file_date_updated":"2020-07-14T12:47:40Z","project":[{"name":"Lifelong Learning of Visual Scene Understanding","call_identifier":"FP7","_id":"2532554C-B435-11E9-9278-68D0E5697425","grant_number":"308036"}],"oa":1,"language":[{"iso":"eng"}],"degree_awarded":"PhD","supervisor":[{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","first_name":"Christoph","last_name":"Lampert","full_name":"Lampert, Christoph"}],"doi":"10.15479/AT:ISTA:TH1048","publication_identifier":{"issn":["2663-337X"]},"month":"09"},{"year":"2018","publication_status":"published","department":[{"_id":"KrPi"}],"publisher":"Institute of Science and Technology Austria","author":[{"full_name":"Abusalah, Hamza M","id":"40297222-F248-11E8-B48F-1D18A9856A87","last_name":"Abusalah","first_name":"Hamza M"}],"related_material":{"record":[{"id":"1229","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"1235"},{"relation":"part_of_dissertation","status":"public","id":"1236"},{"id":"559","status":"public","relation":"part_of_dissertation"}]},"date_updated":"2023-09-07T12:30:23Z","date_created":"2018-12-11T11:44:32Z","file_date_updated":"2020-07-14T12:48:11Z","ec_funded":1,"publist_id":"7971","oa":1,"project":[{"grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425","name":"Provable Security for Physical Cryptography","call_identifier":"FP7"},{"grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Teaching Old Crypto New Tricks"}],"doi":"10.15479/AT:ISTA:TH_1046","degree_awarded":"PhD","supervisor":[{"full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","last_name":"Pietrzak"}],"language":[{"iso":"eng"}],"month":"09","publication_identifier":{"issn":["2663-337X"]},"_id":"83","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","ddc":["004"],"title":"Proof systems for sustainable decentralized cryptocurrencies","status":"public","pubrep_id":"1046","oa_version":"Published Version","file":[{"relation":"main_file","file_id":"6245","checksum":"c4b5f7d111755d1396787f41886fc674","date_updated":"2020-07-14T12:48:11Z","date_created":"2019-04-09T06:43:41Z","access_level":"open_access","file_name":"2018_Thesis_Abusalah.pdf","content_type":"application/pdf","file_size":876241,"creator":"dernst"},{"file_id":"6246","relation":"source_file","checksum":"0f382ac56b471c48fd907d63eb87dafe","date_created":"2019-04-09T06:43:41Z","date_updated":"2020-07-14T12:48:11Z","access_level":"closed","file_name":"2018_Thesis_Abusalah_source.tar.gz","creator":"dernst","content_type":"application/x-gzip","file_size":2029190}],"type":"dissertation","alternative_title":["ISTA Thesis"],"abstract":[{"lang":"eng","text":"A proof system is a protocol between a prover and a verifier over a common input in which an honest prover convinces the verifier of the validity of true statements. Motivated by the success of decentralized cryptocurrencies, exemplified by Bitcoin, the focus of this thesis will be on proof systems which found applications in some sustainable alternatives to Bitcoin, such as the Spacemint and Chia cryptocurrencies. In particular, we focus on proofs of space and proofs of sequential work.\r\nProofs of space (PoSpace) were suggested as more ecological, economical, and egalitarian alternative to the energy-wasteful proof-of-work mining of Bitcoin. However, the state-of-the-art constructions of PoSpace are based on sophisticated graph pebbling lower bounds, and are therefore complex. Moreover, when these PoSpace are used in cryptocurrencies like Spacemint, miners can only start mining after ensuring that a commitment to their space is already added in a special transaction to the blockchain. Proofs of sequential work (PoSW) are proof systems in which a prover, upon receiving a statement x and a time parameter T, computes a proof which convinces the verifier that T time units had passed since x was received. Whereas Spacemint assumes synchrony to retain some interesting Bitcoin dynamics, Chia requires PoSW with unique proofs, i.e., PoSW in which it is hard to come up with more than one accepting proof for any true statement. In this thesis we construct simple and practically-efficient PoSpace and PoSW. When using our PoSpace in cryptocurrencies, miners can start mining on the fly, like in Bitcoin, and unlike current constructions of PoSW, which either achieve efficient verification of sequential work, or faster-than-recomputing verification of correctness of proofs, but not both at the same time, ours achieve the best of these two worlds."}],"citation":{"ista":"Abusalah HM. 2018. Proof systems for sustainable decentralized cryptocurrencies. Institute of Science and Technology Austria.","apa":"Abusalah, H. M. (2018). Proof systems for sustainable decentralized cryptocurrencies. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:TH_1046","ieee":"H. M. Abusalah, “Proof systems for sustainable decentralized cryptocurrencies,” Institute of Science and Technology Austria, 2018.","ama":"Abusalah HM. Proof systems for sustainable decentralized cryptocurrencies. 2018. doi:10.15479/AT:ISTA:TH_1046","chicago":"Abusalah, Hamza M. “Proof Systems for Sustainable Decentralized Cryptocurrencies.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:TH_1046.","mla":"Abusalah, Hamza M. Proof Systems for Sustainable Decentralized Cryptocurrencies. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:TH_1046.","short":"H.M. Abusalah, Proof Systems for Sustainable Decentralized Cryptocurrencies, Institute of Science and Technology Austria, 2018."},"page":"59","date_published":"2018-09-05T00:00:00Z","day":"05","article_processing_charge":"No","has_accepted_license":"1"},{"has_accepted_license":"1","article_processing_charge":"No","day":"25","date_published":"2018-05-25T00:00:00Z","page":"113","citation":{"chicago":"Kolesnikov, Alexander. “Weakly-Supervised Segmentation and Unsupervised Modeling of Natural Images.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:th_1021.","short":"A. Kolesnikov, Weakly-Supervised Segmentation and Unsupervised Modeling of Natural Images, Institute of Science and Technology Austria, 2018.","mla":"Kolesnikov, Alexander. Weakly-Supervised Segmentation and Unsupervised Modeling of Natural Images. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:th_1021.","apa":"Kolesnikov, A. (2018). Weakly-Supervised Segmentation and Unsupervised Modeling of Natural Images. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_1021","ieee":"A. Kolesnikov, “Weakly-Supervised Segmentation and Unsupervised Modeling of Natural Images,” Institute of Science and Technology Austria, 2018.","ista":"Kolesnikov A. 2018. Weakly-Supervised Segmentation and Unsupervised Modeling of Natural Images. Institute of Science and Technology Austria.","ama":"Kolesnikov A. Weakly-Supervised Segmentation and Unsupervised Modeling of Natural Images. 2018. doi:10.15479/AT:ISTA:th_1021"},"abstract":[{"lang":"eng","text":"Modern computer vision systems heavily rely on statistical machine learning models, which typically require large amounts of labeled data to be learned reliably. Moreover, very recently computer vision research widely adopted techniques for representation learning, which further increase the demand for labeled data. However, for many important practical problems there is relatively small amount of labeled data available, so it is problematic to leverage full potential of the representation learning methods. One way to overcome this obstacle is to invest substantial resources into producing large labelled datasets. Unfortunately, this can be prohibitively expensive in practice. In this thesis we focus on the alternative way of tackling the aforementioned issue. We concentrate on methods, which make use of weakly-labeled or even unlabeled data. Specifically, the first half of the thesis is dedicated to the semantic image segmentation task. We develop a technique, which achieves competitive segmentation performance and only requires annotations in a form of global image-level labels instead of dense segmentation masks. Subsequently, we present a new methodology, which further improves segmentation performance by leveraging tiny additional feedback from a human annotator. By using our methods practitioners can greatly reduce the amount of data annotation effort, which is required to learn modern image segmentation models. In the second half of the thesis we focus on methods for learning from unlabeled visual data. We study a family of autoregressive models for modeling structure of natural images and discuss potential applications of these models. Moreover, we conduct in-depth study of one of these applications, where we develop the state-of-the-art model for the probabilistic image colorization task."}],"alternative_title":["ISTA Thesis"],"type":"dissertation","oa_version":"Published Version","file":[{"content_type":"application/pdf","file_size":12918758,"creator":"system","file_name":"IST-2018-1021-v1+1_thesis-unsigned-pdfa.pdf","access_level":"open_access","date_created":"2018-12-12T10:14:57Z","date_updated":"2020-07-14T12:45:22Z","checksum":"bc678e02468d8ebc39dc7267dfb0a1c4","relation":"main_file","file_id":"5113"},{"relation":"source_file","file_id":"6225","date_updated":"2020-07-14T12:45:22Z","date_created":"2019-04-05T09:34:49Z","checksum":"bc66973b086da5a043f1162dcfb1fde4","file_name":"2018_Thesis_Kolesnikov_source.zip","access_level":"closed","file_size":55973760,"content_type":"application/zip","creator":"dernst"}],"pubrep_id":"1021","status":"public","ddc":["004"],"title":"Weakly-Supervised Segmentation and Unsupervised Modeling of Natural Images","_id":"197","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publication_identifier":{"issn":["2663-337X"]},"month":"05","language":[{"iso":"eng"}],"degree_awarded":"PhD","supervisor":[{"full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","first_name":"Christoph"}],"doi":"10.15479/AT:ISTA:th_1021","project":[{"_id":"2532554C-B435-11E9-9278-68D0E5697425","grant_number":"308036","name":"Lifelong Learning of Visual Scene Understanding","call_identifier":"FP7"}],"oa":1,"ec_funded":1,"publist_id":"7718","file_date_updated":"2020-07-14T12:45:22Z","date_created":"2018-12-11T11:45:09Z","date_updated":"2023-09-07T12:51:46Z","author":[{"full_name":"Kolesnikov, Alexander","last_name":"Kolesnikov","first_name":"Alexander","id":"2D157DB6-F248-11E8-B48F-1D18A9856A87"}],"publisher":"Institute of Science and Technology Austria","department":[{"_id":"ChLa"}],"publication_status":"published","acknowledgement":"I also gratefully acknowledge the support of NVIDIA Corporation with the donation of the GPUs used for this research.","year":"2018"},{"abstract":[{"lang":"eng","text":"A central problem of algebraic topology is to understand the homotopy groups 𝜋𝑑(𝑋) of a topological space X. For the computational version of the problem, it is well known that there is no algorithm to decide whether the fundamental group 𝜋1(𝑋) of a given finite simplicial complex X is trivial. On the other hand, there are several algorithms that, given a finite simplicial complex X that is simply connected (i.e., with 𝜋1(𝑋) trivial), compute the higher homotopy group 𝜋𝑑(𝑋) for any given 𝑑≥2 . However, these algorithms come with a caveat: They compute the isomorphism type of 𝜋𝑑(𝑋) , 𝑑≥2 as an abstract finitely generated abelian group given by generators and relations, but they work with very implicit representations of the elements of 𝜋𝑑(𝑋) . Converting elements of this abstract group into explicit geometric maps from the d-dimensional sphere 𝑆𝑑 to X has been one of the main unsolved problems in the emerging field of computational homotopy theory. Here we present an algorithm that, given a simply connected space X, computes 𝜋𝑑(𝑋) and represents its elements as simplicial maps from a suitable triangulation of the d-sphere 𝑆𝑑 to X. For fixed d, the algorithm runs in time exponential in size(𝑋) , the number of simplices of X. Moreover, we prove that this is optimal: For every fixed 𝑑≥2 , we construct a family of simply connected spaces X such that for any simplicial map representing a generator of 𝜋𝑑(𝑋) , the size of the triangulation of 𝑆𝑑 on which the map is defined, is exponential in size(𝑋) ."}],"issue":"3-4","type":"journal_article","oa_version":"Published Version","file":[{"file_name":"2018_JourAppliedComputTopology_Filakovsky.pdf","access_level":"open_access","content_type":"application/pdf","file_size":1056278,"creator":"dernst","relation":"main_file","file_id":"6775","date_updated":"2020-07-14T12:47:40Z","date_created":"2019-08-08T06:55:21Z","checksum":"cf9e7fcd2a113dd4828774fc75cdb7e8"}],"_id":"6774","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["514"],"title":"Computing simplicial representatives of homotopy group elements","status":"public","intvolume":" 2","day":"01","has_accepted_license":"1","date_published":"2018-12-01T00:00:00Z","publication":"Journal of Applied and Computational Topology","citation":{"short":"M. Filakovský, P. Franek, U. Wagner, S.Y. Zhechev, Journal of Applied and Computational Topology 2 (2018) 177–231.","mla":"Filakovský, Marek, et al. “Computing Simplicial Representatives of Homotopy Group Elements.” Journal of Applied and Computational Topology, vol. 2, no. 3–4, Springer, 2018, pp. 177–231, doi:10.1007/s41468-018-0021-5.","chicago":"Filakovský, Marek, Peter Franek, Uli Wagner, and Stephan Y Zhechev. “Computing Simplicial Representatives of Homotopy Group Elements.” Journal of Applied and Computational Topology. Springer, 2018. https://doi.org/10.1007/s41468-018-0021-5.","ama":"Filakovský M, Franek P, Wagner U, Zhechev SY. Computing simplicial representatives of homotopy group elements. Journal of Applied and Computational Topology. 2018;2(3-4):177-231. doi:10.1007/s41468-018-0021-5","ieee":"M. Filakovský, P. Franek, U. Wagner, and S. Y. Zhechev, “Computing simplicial representatives of homotopy group elements,” Journal of Applied and Computational Topology, vol. 2, no. 3–4. Springer, pp. 177–231, 2018.","apa":"Filakovský, M., Franek, P., Wagner, U., & Zhechev, S. Y. (2018). Computing simplicial representatives of homotopy group elements. Journal of Applied and Computational Topology. Springer. https://doi.org/10.1007/s41468-018-0021-5","ista":"Filakovský M, Franek P, Wagner U, Zhechev SY. 2018. Computing simplicial representatives of homotopy group elements. Journal of Applied and Computational Topology. 2(3–4), 177–231."},"article_type":"original","page":"177-231","file_date_updated":"2020-07-14T12:47:40Z","author":[{"id":"3E8AF77E-F248-11E8-B48F-1D18A9856A87","first_name":"Marek","last_name":"Filakovský","full_name":"Filakovský, Marek"},{"full_name":"Franek, Peter","first_name":"Peter","last_name":"Franek","id":"473294AE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8878-8397"},{"orcid":"0000-0002-1494-0568","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner","first_name":"Uli","full_name":"Wagner, Uli"},{"last_name":"Zhechev","first_name":"Stephan Y","id":"3AA52972-F248-11E8-B48F-1D18A9856A87","full_name":"Zhechev, Stephan Y"}],"related_material":{"record":[{"id":"6681","relation":"dissertation_contains","status":"public"}]},"date_created":"2019-08-08T06:47:40Z","date_updated":"2023-09-07T13:10:36Z","volume":2,"year":"2018","publication_status":"published","publisher":"Springer","department":[{"_id":"UlWa"}],"month":"12","publication_identifier":{"issn":["2367-1726"],"eissn":["2367-1734"]},"doi":"10.1007/s41468-018-0021-5","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","project":[{"call_identifier":"FWF","name":"Robust invariants of Nonlinear Systems","grant_number":"M01980","_id":"25F8B9BC-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"FWF Open Access Fund","_id":"3AC91DDA-15DF-11EA-824D-93A3E7B544D1"}]},{"alternative_title":["LIPIcs"],"type":"conference","abstract":[{"lang":"eng","text":"Synchronous programs are easy to specify because the side effects of an operation are finished by the time the invocation of the operation returns to the caller. Asynchronous programs, on the other hand, are difficult to specify because there are side effects due to pending computation scheduled as a result of the invocation of an operation. They are also difficult to verify because of the large number of possible interleavings of concurrent computation threads. We present synchronization, a new proof rule that simplifies the verification of asynchronous programs by introducing the fiction, for proof purposes, that asynchronous operations complete synchronously. Synchronization summarizes an asynchronous computation as immediate atomic effect. Modular verification is enabled via pending asynchronous calls in atomic summaries, and a complementary proof rule that eliminates pending asynchronous calls when components and their specifications are composed. We evaluate synchronization in the context of a multi-layer refinement verification methodology on a collection of benchmark programs."}],"status":"public","title":"Synchronizing the asynchronous","ddc":["000"],"intvolume":" 118","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"133","file":[{"file_id":"5368","relation":"main_file","date_created":"2018-12-12T10:18:46Z","date_updated":"2020-07-14T12:44:44Z","checksum":"c90895f4c5fafc18ddc54d1c8848077e","file_name":"IST-2018-853-v2+2_concur2018.pdf","access_level":"open_access","creator":"system","file_size":745438,"content_type":"application/pdf"}],"oa_version":"Published Version","pubrep_id":"1039","scopus_import":1,"day":"13","has_accepted_license":"1","citation":{"mla":"Kragl, Bernhard, et al. Synchronizing the Asynchronous. Vol. 118, 21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPIcs.CONCUR.2018.21.","short":"B. Kragl, S. Qadeer, T.A. Henzinger, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.","chicago":"Kragl, Bernhard, Shaz Qadeer, and Thomas A Henzinger. “Synchronizing the Asynchronous,” Vol. 118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.CONCUR.2018.21.","ama":"Kragl B, Qadeer S, Henzinger TA. Synchronizing the asynchronous. In: Vol 118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPIcs.CONCUR.2018.21","ista":"Kragl B, Qadeer S, Henzinger TA. 2018. Synchronizing the asynchronous. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 118, 21.","apa":"Kragl, B., Qadeer, S., & Henzinger, T. A. (2018). Synchronizing the asynchronous (Vol. 118). Presented at the CONCUR: International Conference on Concurrency Theory, Beijing, China: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2018.21","ieee":"B. Kragl, S. Qadeer, and T. A. Henzinger, “Synchronizing the asynchronous,” presented at the CONCUR: International Conference on Concurrency Theory, Beijing, China, 2018, vol. 118."},"date_published":"2018-08-13T00:00:00Z","article_number":"21","file_date_updated":"2020-07-14T12:44:44Z","publist_id":"7790","publication_status":"published","department":[{"_id":"ToHe"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","year":"2018","date_updated":"2023-09-07T13:18:00Z","date_created":"2018-12-11T11:44:48Z","volume":118,"author":[{"orcid":"0000-0001-7745-9117","id":"320FC952-F248-11E8-B48F-1D18A9856A87","last_name":"Kragl","first_name":"Bernhard","full_name":"Kragl, Bernhard"},{"full_name":"Qadeer, Shaz","last_name":"Qadeer","first_name":"Shaz"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger"}],"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"6426"},{"id":"8332","relation":"dissertation_contains","status":"public"}]},"month":"08","publication_identifier":{"issn":["18688969"]},"quality_controlled":"1","project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23"},{"grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","name":"Moderne Concurrency Paradigms","call_identifier":"FWF"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"language":[{"iso":"eng"}],"conference":{"name":"CONCUR: International Conference on Concurrency Theory","end_date":"2018-09-07","location":"Beijing, China","start_date":"2018-09-04"},"doi":"10.4230/LIPIcs.CONCUR.2018.21"},{"scopus_import":1,"day":"11","has_accepted_license":"1","citation":{"short":"H. Edelsbrunner, G.F. Osang, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.","mla":"Edelsbrunner, Herbert, and Georg F. Osang. The Multi-Cover Persistence of Euclidean Balls. Vol. 99, 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPIcs.SoCG.2018.34.","chicago":"Edelsbrunner, Herbert, and Georg F Osang. “The Multi-Cover Persistence of Euclidean Balls,” Vol. 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.SoCG.2018.34.","ama":"Edelsbrunner H, Osang GF. The multi-cover persistence of Euclidean balls. In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPIcs.SoCG.2018.34","apa":"Edelsbrunner, H., & Osang, G. F. (2018). The multi-cover persistence of Euclidean balls (Vol. 99). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2018.34","ieee":"H. Edelsbrunner and G. F. Osang, “The multi-cover persistence of Euclidean balls,” presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99.","ista":"Edelsbrunner H, Osang GF. 2018. The multi-cover persistence of Euclidean balls. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 99, 34."},"date_published":"2018-06-11T00:00:00Z","alternative_title":["LIPIcs"],"type":"conference","abstract":[{"lang":"eng","text":"Given a locally finite X ⊆ ℝd and a radius r ≥ 0, the k-fold cover of X and r consists of all points in ℝd that have k or more points of X within distance r. We consider two filtrations - one in scale obtained by fixing k and increasing r, and the other in depth obtained by fixing r and decreasing k - and we compute the persistence diagrams of both. While standard methods suffice for the filtration in scale, we need novel geometric and topological concepts for the filtration in depth. In particular, we introduce a rhomboid tiling in ℝd+1 whose horizontal integer slices are the order-k Delaunay mosaics of X, and construct a zigzag module from Delaunay mosaics that is isomorphic to the persistence module of the multi-covers. "}],"title":"The multi-cover persistence of Euclidean balls","status":"public","ddc":["516"],"intvolume":" 99","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"187","file":[{"relation":"main_file","file_id":"5738","date_created":"2018-12-18T09:27:22Z","date_updated":"2020-07-14T12:45:19Z","checksum":"d8c0533ad0018eb4ed1077475eb8fc18","file_name":"2018_LIPIcs_Edelsbrunner_Osang.pdf","access_level":"open_access","file_size":528018,"content_type":"application/pdf","creator":"dernst"}],"oa_version":"Published Version","month":"06","quality_controlled":"1","project":[{"name":"Persistence and stability of geometric complexes","call_identifier":"FWF","grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"language":[{"iso":"eng"}],"conference":{"end_date":"2018-06-14","start_date":"2018-06-11","location":"Budapest, Hungary","name":"SoCG: Symposium on Computational Geometry"},"doi":"10.4230/LIPIcs.SoCG.2018.34","article_number":"34","file_date_updated":"2020-07-14T12:45:19Z","publist_id":"7732","publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"HeEd"}],"acknowledgement":"This work is partially supported by the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, through grant no. I02979-N35 of the Austrian Science Fund (FWF).","year":"2018","date_created":"2018-12-11T11:45:05Z","date_updated":"2023-09-07T13:29:00Z","volume":99,"author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","first_name":"Herbert","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert"},{"full_name":"Osang, Georg F","last_name":"Osang","first_name":"Georg F","orcid":"0000-0002-8882-5116","id":"464B40D6-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"status":"public","relation":"later_version","id":"9317"},{"id":"9056","relation":"dissertation_contains","status":"public"}]}},{"publication_status":"published","publisher":"Springer","department":[{"_id":"HeEd"}],"year":"2018","date_created":"2018-12-11T11:47:57Z","date_updated":"2023-09-08T11:40:29Z","volume":194,"author":[{"orcid":"0000-0002-2548-617X","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","last_name":"Akopyan","first_name":"Arseniy","full_name":"Akopyan, Arseniy"}],"file_date_updated":"2020-07-14T12:47:44Z","publist_id":"7014","ec_funded":1,"quality_controlled":"1","isi":1,"project":[{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000431418800004"]},"language":[{"iso":"eng"}],"doi":"10.1007/s10711-017-0265-6","month":"06","ddc":["510"],"title":"3-Webs generated by confocal conics and circles","status":"public","intvolume":" 194","_id":"692","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Published Version","file":[{"creator":"kschuh","file_size":1140860,"content_type":"application/pdf","file_name":"2018_Springer_Akopyan.pdf","access_level":"open_access","date_updated":"2020-07-14T12:47:44Z","date_created":"2020-01-03T11:35:08Z","checksum":"1febcfc1266486053a069e3425ea3713","file_id":"7222","relation":"main_file"}],"type":"journal_article","abstract":[{"lang":"eng","text":"We consider families of confocal conics and two pencils of Apollonian circles having the same foci. We will show that these families of curves generate trivial 3-webs and find the exact formulas describing them."}],"issue":"1","article_type":"original","page":"55 - 64","publication":"Geometriae Dedicata","citation":{"chicago":"Akopyan, Arseniy. “3-Webs Generated by Confocal Conics and Circles.” Geometriae Dedicata. Springer, 2018. https://doi.org/10.1007/s10711-017-0265-6.","short":"A. Akopyan, Geometriae Dedicata 194 (2018) 55–64.","mla":"Akopyan, Arseniy. “3-Webs Generated by Confocal Conics and Circles.” Geometriae Dedicata, vol. 194, no. 1, Springer, 2018, pp. 55–64, doi:10.1007/s10711-017-0265-6.","ieee":"A. Akopyan, “3-Webs generated by confocal conics and circles,” Geometriae Dedicata, vol. 194, no. 1. Springer, pp. 55–64, 2018.","apa":"Akopyan, A. (2018). 3-Webs generated by confocal conics and circles. Geometriae Dedicata. Springer. https://doi.org/10.1007/s10711-017-0265-6","ista":"Akopyan A. 2018. 3-Webs generated by confocal conics and circles. Geometriae Dedicata. 194(1), 55–64.","ama":"Akopyan A. 3-Webs generated by confocal conics and circles. Geometriae Dedicata. 2018;194(1):55-64. doi:10.1007/s10711-017-0265-6"},"date_published":"2018-06-01T00:00:00Z","scopus_import":"1","day":"01","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1"},{"publication_status":"published","department":[{"_id":"GeKa"}],"publisher":"Nature Publishing Group","year":"2018","date_created":"2018-12-11T11:44:30Z","date_updated":"2023-09-08T11:44:02Z","volume":9,"author":[{"last_name":"Watzinger","first_name":"Hannes","id":"35DF8E50-F248-11E8-B48F-1D18A9856A87","full_name":"Watzinger, Hannes"},{"first_name":"Josip","last_name":"Kukucka","id":"3F5D8856-F248-11E8-B48F-1D18A9856A87","full_name":"Kukucka, Josip"},{"last_name":"Vukusic","first_name":"Lada","orcid":"0000-0003-2424-8636","id":"31E9F056-F248-11E8-B48F-1D18A9856A87","full_name":"Vukusic, Lada"},{"first_name":"Fei","last_name":"Gao","full_name":"Gao, Fei"},{"full_name":"Wang, Ting","last_name":"Wang","first_name":"Ting"},{"full_name":"Schäffler, Friedrich","last_name":"Schäffler","first_name":"Friedrich"},{"last_name":"Zhang","first_name":"Jian","full_name":"Zhang, Jian"},{"full_name":"Katsaros, Georgios","orcid":"0000-0001-8342-202X","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","last_name":"Katsaros","first_name":"Georgios"}],"related_material":{"record":[{"relation":"popular_science","id":"7977"},{"relation":"dissertation_contains","status":"public","id":"7996"}]},"file_date_updated":"2020-07-14T12:48:02Z","ec_funded":1,"isi":1,"quality_controlled":"1","project":[{"call_identifier":"FP7","name":"Towards Spin qubits and Majorana fermions in Germanium selfassembled hut-wires","_id":"25517E86-B435-11E9-9278-68D0E5697425","grant_number":"335497"},{"grant_number":"Y00715","_id":"2552F888-B435-11E9-9278-68D0E5697425","name":"Loch Spin-Qubits und Majorana-Fermionen in Germanium","call_identifier":"FWF"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000445560800010"]},"oa":1,"acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"language":[{"iso":"eng"}],"doi":"10.1038/s41467-018-06418-4","month":"09","title":"A germanium hole spin qubit","status":"public","ddc":["530"],"intvolume":" 9","_id":"77","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Published Version","file":[{"file_id":"5687","relation":"main_file","date_updated":"2020-07-14T12:48:02Z","date_created":"2018-12-17T10:28:30Z","checksum":"e7148c10a64497e279c4de570b6cc544","file_name":"2018_NatureComm_Watzinger.pdf","access_level":"open_access","creator":"dernst","file_size":1063469,"content_type":"application/pdf"}],"type":"journal_article","abstract":[{"text":"Holes confined in quantum dots have gained considerable interest in the past few years due to their potential as spin qubits. Here we demonstrate two-axis control of a spin 3/2 qubit in natural Ge. The qubit is formed in a hut wire double quantum dot device. The Pauli spin blockade principle allowed us to demonstrate electric dipole spin resonance by applying a radio frequency electric field to one of the electrodes defining the double quantum dot. Coherent hole spin oscillations with Rabi frequencies reaching 140 MHz are demonstrated and dephasing times of 130 ns are measured. The reported results emphasize the potential of Ge as a platform for fast and electrically tunable hole spin qubit devices.","lang":"eng"}],"issue":"3902 ","article_type":"original","publication":"Nature Communications","citation":{"chicago":"Watzinger, Hannes, Josip Kukucka, Lada Vukušić, Fei Gao, Ting Wang, Friedrich Schäffler, Jian Zhang, and Georgios Katsaros. “A Germanium Hole Spin Qubit.” Nature Communications. Nature Publishing Group, 2018. https://doi.org/10.1038/s41467-018-06418-4.","short":"H. Watzinger, J. Kukucka, L. Vukušić, F. Gao, T. Wang, F. Schäffler, J. Zhang, G. Katsaros, Nature Communications 9 (2018).","mla":"Watzinger, Hannes, et al. “A Germanium Hole Spin Qubit.” Nature Communications, vol. 9, no. 3902, Nature Publishing Group, 2018, doi:10.1038/s41467-018-06418-4.","ieee":"H. Watzinger et al., “A germanium hole spin qubit,” Nature Communications, vol. 9, no. 3902. Nature Publishing Group, 2018.","apa":"Watzinger, H., Kukucka, J., Vukušić, L., Gao, F., Wang, T., Schäffler, F., … Katsaros, G. (2018). A germanium hole spin qubit. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/s41467-018-06418-4","ista":"Watzinger H, Kukucka J, Vukušić L, Gao F, Wang T, Schäffler F, Zhang J, Katsaros G. 2018. A germanium hole spin qubit. Nature Communications. 9(3902).","ama":"Watzinger H, Kukucka J, Vukušić L, et al. A germanium hole spin qubit. Nature Communications. 2018;9(3902). doi:10.1038/s41467-018-06418-4"},"date_published":"2018-09-25T00:00:00Z","scopus_import":"1","day":"25","has_accepted_license":"1","article_processing_charge":"Yes"},{"external_id":{"isi":["000428165400009"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"isi":1,"quality_controlled":"1","doi":"10.1038/s41467-018-03574-5","language":[{"iso":"eng"}],"month":"03","year":"2018","publication_status":"published","publisher":"Nature Publishing Group","department":[{"_id":"EdHa"}],"author":[{"first_name":"Xiang","last_name":"Qin","full_name":"Qin, Xiang"},{"orcid":"0000-0001-6005-1561","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87","last_name":"Hannezo","first_name":"Edouard B","full_name":"Hannezo, Edouard B"},{"first_name":"Thomas","last_name":"Mangeat","full_name":"Mangeat, Thomas"},{"full_name":"Liu, Chang","last_name":"Liu","first_name":"Chang"},{"full_name":"Majumder, Pralay","first_name":"Pralay","last_name":"Majumder"},{"full_name":"Liu, Jjiaying","first_name":"Jjiaying","last_name":"Liu"},{"first_name":"Valerie","last_name":"Choesmel Cadamuro","full_name":"Choesmel Cadamuro, Valerie"},{"full_name":"Mcdonald, Jocelyn","first_name":"Jocelyn","last_name":"Mcdonald"},{"first_name":"Yinyao","last_name":"Liu","full_name":"Liu, Yinyao"},{"last_name":"Yi","first_name":"Bin","full_name":"Yi, Bin"},{"first_name":"Xiaobo","last_name":"Wang","full_name":"Wang, Xiaobo"}],"date_updated":"2023-09-08T11:41:45Z","date_created":"2018-12-11T11:46:16Z","volume":9,"article_number":"1210","file_date_updated":"2020-07-14T12:46:22Z","publist_id":"7427","publication":"Nature Communications","citation":{"ista":"Qin X, Hannezo EB, Mangeat T, Liu C, Majumder P, Liu J, Choesmel Cadamuro V, Mcdonald J, Liu Y, Yi B, Wang X. 2018. A biochemical network controlling basal myosin oscillation. Nature Communications. 9(1), 1210.","apa":"Qin, X., Hannezo, E. B., Mangeat, T., Liu, C., Majumder, P., Liu, J., … Wang, X. (2018). A biochemical network controlling basal myosin oscillation. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/s41467-018-03574-5","ieee":"X. Qin et al., “A biochemical network controlling basal myosin oscillation,” Nature Communications, vol. 9, no. 1. Nature Publishing Group, 2018.","ama":"Qin X, Hannezo EB, Mangeat T, et al. A biochemical network controlling basal myosin oscillation. Nature Communications. 2018;9(1). doi:10.1038/s41467-018-03574-5","chicago":"Qin, Xiang, Edouard B Hannezo, Thomas Mangeat, Chang Liu, Pralay Majumder, Jjiaying Liu, Valerie Choesmel Cadamuro, et al. “A Biochemical Network Controlling Basal Myosin Oscillation.” Nature Communications. Nature Publishing Group, 2018. https://doi.org/10.1038/s41467-018-03574-5.","mla":"Qin, Xiang, et al. “A Biochemical Network Controlling Basal Myosin Oscillation.” Nature Communications, vol. 9, no. 1, 1210, Nature Publishing Group, 2018, doi:10.1038/s41467-018-03574-5.","short":"X. Qin, E.B. Hannezo, T. Mangeat, C. Liu, P. Majumder, J. Liu, V. Choesmel Cadamuro, J. Mcdonald, Y. Liu, B. Yi, X. Wang, Nature Communications 9 (2018)."},"date_published":"2018-03-23T00:00:00Z","scopus_import":"1","day":"23","article_processing_charge":"No","has_accepted_license":"1","_id":"401","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"A biochemical network controlling basal myosin oscillation","ddc":["539","570"],"status":"public","intvolume":" 9","pubrep_id":"996","file":[{"file_id":"4902","relation":"main_file","checksum":"87a427bc2e8724be3dd22a4efdd21a33","date_updated":"2020-07-14T12:46:22Z","date_created":"2018-12-12T10:11:45Z","access_level":"open_access","file_name":"IST-2018-996-v1+1_2018_Hannezo_A-biochemical.pdf","creator":"system","content_type":"application/pdf","file_size":3780491}],"oa_version":"Published Version","type":"journal_article","abstract":[{"lang":"eng","text":"The actomyosin cytoskeleton, a key stress-producing unit in epithelial cells, oscillates spontaneously in a wide variety of systems. Although much of the signal cascade regulating myosin activity has been characterized, the origin of such oscillatory behavior is still unclear. Here, we show that basal myosin II oscillation in Drosophila ovarian epithelium is not controlled by actomyosin cortical tension, but instead relies on a biochemical oscillator involving ROCK and myosin phosphatase. Key to this oscillation is a diffusive ROCK flow, linking junctional Rho1 to medial actomyosin cortex, and dynamically maintained by a self-activation loop reliant on ROCK kinase activity. In response to the resulting myosin II recruitment, myosin phosphatase is locally enriched and shuts off ROCK and myosin II signals. Coupling Drosophila genetics, live imaging, modeling, and optogenetics, we uncover an intrinsic biochemical oscillator at the core of myosin II regulatory network, shedding light on the spatio-temporal dynamics of force generation."}],"issue":"1"},{"publist_id":"7547","year":"2018","acknowledgement":"Short Survey","pmid":1,"publication_status":"published","department":[{"_id":"MiSi"}],"publisher":"Cell Press","author":[{"id":"3DBA3F4E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6009-6804","first_name":"Alessandra M","last_name":"Casano","full_name":"Casano, Alessandra M"},{"full_name":"Sixt, Michael K","last_name":"Sixt","first_name":"Michael K","orcid":"0000-0002-6620-9179","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2023-09-08T11:42:28Z","date_created":"2018-12-11T11:45:47Z","volume":44,"month":"02","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pubmed/29486189","open_access":"1"}],"oa":1,"external_id":{"isi":["000426150700002"],"pmid":["29486189"]},"isi":1,"quality_controlled":"1","doi":"10.1016/j.devcel.2018.02.009","language":[{"iso":"eng"}],"type":"journal_article","abstract":[{"text":"The insect’s fat body combines metabolic and immunological functions. In this issue of Developmental Cell, Franz et al. (2018) show that in Drosophila, cells of the fat body are not static, but can actively “swim” toward sites of epithelial injury, where they physically clog the wound and locally secrete antimicrobial peptides.","lang":"eng"}],"issue":"4","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"318","status":"public","title":"A fat lot of good for wound healing","intvolume":" 44","oa_version":"Published Version","scopus_import":"1","day":"26","article_processing_charge":"No","publication":"Developmental Cell","citation":{"ama":"Casano AM, Sixt MK. A fat lot of good for wound healing. Developmental Cell. 2018;44(4):405-406. doi:10.1016/j.devcel.2018.02.009","apa":"Casano, A. M., & Sixt, M. K. (2018). A fat lot of good for wound healing. Developmental Cell. Cell Press. https://doi.org/10.1016/j.devcel.2018.02.009","ieee":"A. M. Casano and M. K. Sixt, “A fat lot of good for wound healing,” Developmental Cell, vol. 44, no. 4. Cell Press, pp. 405–406, 2018.","ista":"Casano AM, Sixt MK. 2018. A fat lot of good for wound healing. Developmental Cell. 44(4), 405–406.","short":"A.M. Casano, M.K. Sixt, Developmental Cell 44 (2018) 405–406.","mla":"Casano, Alessandra M., and Michael K. Sixt. “A Fat Lot of Good for Wound Healing.” Developmental Cell, vol. 44, no. 4, Cell Press, 2018, pp. 405–06, doi:10.1016/j.devcel.2018.02.009.","chicago":"Casano, Alessandra M, and Michael K Sixt. “A Fat Lot of Good for Wound Healing.” Developmental Cell. Cell Press, 2018. https://doi.org/10.1016/j.devcel.2018.02.009."},"page":"405 - 406","date_published":"2018-02-26T00:00:00Z"},{"scopus_import":"1","day":"26","has_accepted_license":"1","article_processing_charge":"No","publication":"Scientific Reports","citation":{"mla":"Masís, Javier, et al. “A Micro-CT-Based Method for Quantitative Brain Lesion Characterization and Electrode Localization.” Scientific Reports, vol. 8, no. 1, 5184, Nature Publishing Group, 2018, doi:10.1038/s41598-018-23247-z.","short":"J. Masís, D. Mankus, S. Wolff, G. Guitchounts, M.A. Jösch, D. Cox, Scientific Reports 8 (2018).","chicago":"Masís, Javier, David Mankus, Steffen Wolff, Grigori Guitchounts, Maximilian A Jösch, and David Cox. “A Micro-CT-Based Method for Quantitative Brain Lesion Characterization and Electrode Localization.” Scientific Reports. Nature Publishing Group, 2018. https://doi.org/10.1038/s41598-018-23247-z.","ama":"Masís J, Mankus D, Wolff S, Guitchounts G, Jösch MA, Cox D. A micro-CT-based method for quantitative brain lesion characterization and electrode localization. Scientific Reports. 2018;8(1). doi:10.1038/s41598-018-23247-z","ista":"Masís J, Mankus D, Wolff S, Guitchounts G, Jösch MA, Cox D. 2018. A micro-CT-based method for quantitative brain lesion characterization and electrode localization. Scientific Reports. 8(1), 5184.","ieee":"J. Masís, D. Mankus, S. Wolff, G. Guitchounts, M. A. Jösch, and D. Cox, “A micro-CT-based method for quantitative brain lesion characterization and electrode localization,” Scientific Reports, vol. 8, no. 1. Nature Publishing Group, 2018.","apa":"Masís, J., Mankus, D., Wolff, S., Guitchounts, G., Jösch, M. A., & Cox, D. (2018). A micro-CT-based method for quantitative brain lesion characterization and electrode localization. Scientific Reports. Nature Publishing Group. https://doi.org/10.1038/s41598-018-23247-z"},"date_published":"2018-03-26T00:00:00Z","type":"journal_article","abstract":[{"text":"Lesion verification and quantification is traditionally done via histological examination of sectioned brains, a time-consuming process that relies heavily on manual estimation. Such methods are particularly problematic in posterior cortical regions (e.g. visual cortex), where sectioning leads to significant damage and distortion of tissue. Even more challenging is the post hoc localization of micro-electrodes, which relies on the same techniques, suffers from similar drawbacks and requires even higher precision. Here, we propose a new, simple method for quantitative lesion characterization and electrode localization that is less labor-intensive and yields more detailed results than conventional methods. We leverage staining techniques standard in electron microscopy with the use of commodity micro-CT imaging. We stain whole rat and zebra finch brains in osmium tetroxide, embed these in resin and scan entire brains in a micro-CT machine. The scans result in 3D reconstructions of the brains with section thickness dependent on sample size (12–15 and 5–6 microns for rat and zebra finch respectively) that can be segmented manually or automatically. Because the method captures the entire intact brain volume, comparisons within and across studies are more tractable, and the extent of lesions and electrodes may be studied with higher accuracy than with current methods.","lang":"eng"}],"issue":"1","_id":"410","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"A micro-CT-based method for quantitative brain lesion characterization and electrode localization","ddc":["571","572"],"status":"public","intvolume":" 8","pubrep_id":"994","oa_version":"Published Version","file":[{"date_updated":"2020-07-14T12:46:23Z","date_created":"2018-12-12T10:10:42Z","checksum":"653fcb852f899c75b00ceee2a670d738","relation":"main_file","file_id":"4831","file_size":2359430,"content_type":"application/pdf","creator":"system","file_name":"IST-2018-994-v1+1_2018_Joesch_A-micro-CT-based.pdf","access_level":"open_access"}],"month":"03","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000428234100005"]},"oa":1,"isi":1,"quality_controlled":"1","doi":"10.1038/s41598-018-23247-z","language":[{"iso":"eng"}],"article_number":"5184","file_date_updated":"2020-07-14T12:46:23Z","publist_id":"7419","year":"2018","publication_status":"published","publisher":"Nature Publishing Group","department":[{"_id":"MaJö"}],"author":[{"full_name":"Masís, Javier","first_name":"Javier","last_name":"Masís"},{"full_name":"Mankus, David","first_name":"David","last_name":"Mankus"},{"first_name":"Steffen","last_name":"Wolff","full_name":"Wolff, Steffen"},{"first_name":"Grigori","last_name":"Guitchounts","full_name":"Guitchounts, Grigori"},{"full_name":"Jösch, Maximilian A","orcid":"0000-0002-3937-1330","id":"2BD278E6-F248-11E8-B48F-1D18A9856A87","last_name":"Jösch","first_name":"Maximilian A"},{"last_name":"Cox","first_name":"David","full_name":"Cox, David"}],"date_created":"2018-12-11T11:46:19Z","date_updated":"2023-09-08T11:48:39Z","volume":8},{"date_published":"2018-06-12T00:00:00Z","publication":"Plant Molecular Biology","citation":{"chicago":"Dokládal, Ladislav, Eva Benková, David Honys, Nikoleta Dupláková, Lan Lee, Stanton Gelvin, and Eva Sýkorová. “An Armadillo-Domain Protein Participates in a Telomerase Interaction Network.” Plant Molecular Biology. Springer, 2018. https://doi.org/10.1007/s11103-018-0747-4.","mla":"Dokládal, Ladislav, et al. “An Armadillo-Domain Protein Participates in a Telomerase Interaction Network.” Plant Molecular Biology, vol. 97, no. 5, Springer, 2018, pp. 407–20, doi:10.1007/s11103-018-0747-4.","short":"L. Dokládal, E. Benková, D. Honys, N. Dupláková, L. Lee, S. Gelvin, E. Sýkorová, Plant Molecular Biology 97 (2018) 407–420.","ista":"Dokládal L, Benková E, Honys D, Dupláková N, Lee L, Gelvin S, Sýkorová E. 2018. An armadillo-domain protein participates in a telomerase interaction network. Plant Molecular Biology. 97(5), 407–420.","ieee":"L. Dokládal et al., “An armadillo-domain protein participates in a telomerase interaction network,” Plant Molecular Biology, vol. 97, no. 5. Springer, pp. 407–420, 2018.","apa":"Dokládal, L., Benková, E., Honys, D., Dupláková, N., Lee, L., Gelvin, S., & Sýkorová, E. (2018). An armadillo-domain protein participates in a telomerase interaction network. Plant Molecular Biology. Springer. https://doi.org/10.1007/s11103-018-0747-4","ama":"Dokládal L, Benková E, Honys D, et al. An armadillo-domain protein participates in a telomerase interaction network. Plant Molecular Biology. 2018;97(5):407-420. doi:10.1007/s11103-018-0747-4"},"article_type":"original","page":"407 - 420","day":"12","has_accepted_license":"1","article_processing_charge":"No","scopus_import":"1","oa_version":"Submitted Version","file":[{"checksum":"451ae47616e6af2533099f596b2a47fb","date_updated":"2020-07-14T12:45:45Z","date_created":"2020-05-14T12:23:08Z","file_id":"7834","relation":"main_file","creator":"dernst","file_size":1150679,"content_type":"application/pdf","access_level":"open_access","file_name":"2018_PlantMolecBio_Dokladal.pdf"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"277","ddc":["580"],"title":"An armadillo-domain protein participates in a telomerase interaction network","status":"public","intvolume":" 97","abstract":[{"text":"Arabidopsis and human ARM protein interact with telomerase. Deregulated mRNA levels of DNA repair and ribosomal protein genes in an Arabidopsis arm mutant suggest non-telomeric ARM function. The human homolog ARMC6 interacts with hTRF2. Abstract: Telomerase maintains telomeres and has proposed non-telomeric functions. We previously identified interaction of the C-terminal domain of Arabidopsis telomerase reverse transcriptase (AtTERT) with an armadillo/β-catenin-like repeat (ARM) containing protein. Here we explore protein–protein interactions of the ARM protein, AtTERT domains, POT1a, TRF-like family and SMH family proteins, and the chromatin remodeling protein CHR19 using bimolecular fluorescence complementation (BiFC), yeast two-hybrid (Y2H) analysis, and co-immunoprecipitation. The ARM protein interacts with both the N- and C-terminal domains of AtTERT in different cellular compartments. ARM interacts with CHR19 and TRF-like I family proteins that also bind AtTERT directly or through interaction with POT1a. The putative human ARM homolog co-precipitates telomerase activity and interacts with hTRF2 protein in vitro. Analysis of Arabidopsis arm mutants shows no obvious changes in telomere length or telomerase activity, suggesting that ARM is not essential for telomere maintenance. The observed interactions with telomerase and Myb-like domain proteins (TRF-like family I) may therefore reflect possible non-telomeric functions. Transcript levels of several DNA repair and ribosomal genes are affected in arm mutants, and ARM, likely in association with other proteins, suppressed expression of XRCC3 and RPSAA promoter constructs in luciferase reporter assays. In conclusion, ARM can participate in non-telomeric functions of telomerase, and can also perform its own telomerase-independent functions.","lang":"eng"}],"issue":"5","type":"journal_article","doi":"10.1007/s11103-018-0747-4","language":[{"iso":"eng"}],"external_id":{"isi":["000438981700009"]},"oa":1,"isi":1,"quality_controlled":"1","month":"06","author":[{"full_name":"Dokládal, Ladislav","first_name":"Ladislav","last_name":"Dokládal"},{"last_name":"Benková","first_name":"Eva","orcid":"0000-0002-8510-9739","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","full_name":"Benková, Eva"},{"full_name":"Honys, David","first_name":"David","last_name":"Honys"},{"first_name":"Nikoleta","last_name":"Dupláková","full_name":"Dupláková, Nikoleta"},{"full_name":"Lee, Lan","last_name":"Lee","first_name":"Lan"},{"last_name":"Gelvin","first_name":"Stanton","full_name":"Gelvin, Stanton"},{"full_name":"Sýkorová, Eva","last_name":"Sýkorová","first_name":"Eva"}],"date_created":"2018-12-11T11:45:34Z","date_updated":"2023-09-08T13:21:05Z","volume":97,"year":"2018","publication_status":"published","department":[{"_id":"EvBe"}],"publisher":"Springer","file_date_updated":"2020-07-14T12:45:45Z","publist_id":"7625"},{"scopus_import":"1","day":"14","has_accepted_license":"1","article_processing_charge":"No","page":"303 - 319","citation":{"short":"D. Nickovic, O. Lebeltel, O. Maler, T. Ferrere, D. Ulus, in:, D. Beyer, M. Huisman (Eds.), Springer, 2018, pp. 303–319.","mla":"Nickovic, Dejan, et al. AMT 2.0: Qualitative and Quantitative Trace Analysis with Extended Signal Temporal Logic. Edited by Dirk Beyer and Marieke Huisman, vol. 10806, Springer, 2018, pp. 303–19, doi:10.1007/978-3-319-89963-3_18.","chicago":"Nickovic, Dejan, Olivier Lebeltel, Oded Maler, Thomas Ferrere, and Dogan Ulus. “AMT 2.0: Qualitative and Quantitative Trace Analysis with Extended Signal Temporal Logic.” edited by Dirk Beyer and Marieke Huisman, 10806:303–19. Springer, 2018. https://doi.org/10.1007/978-3-319-89963-3_18.","ama":"Nickovic D, Lebeltel O, Maler O, Ferrere T, Ulus D. AMT 2.0: Qualitative and quantitative trace analysis with extended signal temporal logic. In: Beyer D, Huisman M, eds. Vol 10806. Springer; 2018:303-319. doi:10.1007/978-3-319-89963-3_18","apa":"Nickovic, D., Lebeltel, O., Maler, O., Ferrere, T., & Ulus, D. (2018). AMT 2.0: Qualitative and quantitative trace analysis with extended signal temporal logic. In D. Beyer & M. Huisman (Eds.) (Vol. 10806, pp. 303–319). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Thessaloniki, Greece: Springer. https://doi.org/10.1007/978-3-319-89963-3_18","ieee":"D. Nickovic, O. Lebeltel, O. Maler, T. Ferrere, and D. Ulus, “AMT 2.0: Qualitative and quantitative trace analysis with extended signal temporal logic,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Thessaloniki, Greece, 2018, vol. 10806, pp. 303–319.","ista":"Nickovic D, Lebeltel O, Maler O, Ferrere T, Ulus D. 2018. AMT 2.0: Qualitative and quantitative trace analysis with extended signal temporal logic. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 10806, 303–319."},"date_published":"2018-04-14T00:00:00Z","alternative_title":["LNCS"],"type":"conference","abstract":[{"text":"We introduce in this paper AMT 2.0 , a tool for qualitative and quantitative analysis of hybrid continuous and Boolean signals that combine numerical values and discrete events. The evaluation of the signals is based on rich temporal specifications expressed in extended Signal Temporal Logic (xSTL), which integrates Timed Regular Expressions (TRE) within Signal Temporal Logic (STL). The tool features qualitative monitoring (property satisfaction checking), trace diagnostics for explaining and justifying property violations and specification-driven measurement of quantitative features of the signal.","lang":"eng"}],"status":"public","title":"AMT 2.0: Qualitative and quantitative trace analysis with extended signal temporal logic","ddc":["000"],"intvolume":" 10806","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"299","file":[{"checksum":"e11db3b9c8e27a1c7d1c738cc5e4d25a","date_updated":"2020-07-14T12:45:58Z","date_created":"2019-02-06T07:33:05Z","file_id":"5928","relation":"main_file","creator":"dernst","content_type":"application/pdf","file_size":3267209,"access_level":"open_access","file_name":"2018_LNCS_Nickovic.pdf"}],"oa_version":"Published Version","month":"04","quality_controlled":"1","isi":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"isi":["00445822600018"]},"language":[{"iso":"eng"}],"conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","start_date":"2018-04-14","location":"Thessaloniki, Greece","end_date":"2018-04-20"},"doi":"10.1007/978-3-319-89963-3_18","file_date_updated":"2020-07-14T12:45:58Z","publist_id":"7582","publication_status":"published","editor":[{"first_name":"Dirk","last_name":"Beyer","full_name":"Beyer, Dirk"},{"first_name":"Marieke","last_name":"Huisman","full_name":"Huisman, Marieke"}],"department":[{"_id":"ToHe"}],"publisher":"Springer","year":"2018","date_updated":"2023-09-08T11:52:02Z","date_created":"2018-12-11T11:45:41Z","volume":10806,"author":[{"id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","first_name":"Dejan","last_name":"Nickovic","full_name":"Nickovic, Dejan"},{"full_name":"Lebeltel, Olivier","first_name":"Olivier","last_name":"Lebeltel"},{"last_name":"Maler","first_name":"Oded","full_name":"Maler, Oded"},{"id":"40960E6E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5199-3143","first_name":"Thomas","last_name":"Ferrere","full_name":"Ferrere, Thomas"},{"full_name":"Ulus, Dogan","first_name":"Dogan","last_name":"Ulus"}],"related_material":{"record":[{"status":"public","relation":"later_version","id":"10861"}]}},{"date_published":"2018-03-13T00:00:00Z","page":"2782 - 2787","publication":"PNAS","citation":{"ama":"Konrad M, Pull C, Metzler S, et al. Ants avoid superinfections by performing risk-adjusted sanitary care. PNAS. 2018;115(11):2782-2787. doi:10.1073/pnas.1713501115","ista":"Konrad M, Pull C, Metzler S, Seif K, Naderlinger E, Grasse AV, Cremer S. 2018. Ants avoid superinfections by performing risk-adjusted sanitary care. PNAS. 115(11), 2782–2787.","apa":"Konrad, M., Pull, C., Metzler, S., Seif, K., Naderlinger, E., Grasse, A. V., & Cremer, S. (2018). Ants avoid superinfections by performing risk-adjusted sanitary care. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1713501115","ieee":"M. Konrad et al., “Ants avoid superinfections by performing risk-adjusted sanitary care,” PNAS, vol. 115, no. 11. National Academy of Sciences, pp. 2782–2787, 2018.","mla":"Konrad, Matthias, et al. “Ants Avoid Superinfections by Performing Risk-Adjusted Sanitary Care.” PNAS, vol. 115, no. 11, National Academy of Sciences, 2018, pp. 2782–87, doi:10.1073/pnas.1713501115.","short":"M. Konrad, C. Pull, S. Metzler, K. Seif, E. Naderlinger, A.V. Grasse, S. Cremer, PNAS 115 (2018) 2782–2787.","chicago":"Konrad, Matthias, Christopher Pull, Sina Metzler, Katharina Seif, Elisabeth Naderlinger, Anna V Grasse, and Sylvia Cremer. “Ants Avoid Superinfections by Performing Risk-Adjusted Sanitary Care.” PNAS. National Academy of Sciences, 2018. https://doi.org/10.1073/pnas.1713501115."},"day":"13","article_processing_charge":"No","scopus_import":"1","oa_version":"Published Version","status":"public","title":"Ants avoid superinfections by performing risk-adjusted sanitary care","intvolume":" 115","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"413","abstract":[{"text":"Being cared for when sick is a benefit of sociality that can reduce disease and improve survival of group members. However, individuals providing care risk contracting infectious diseases themselves. If they contract a low pathogen dose, they may develop low-level infections that do not cause disease but still affect host immunity by either decreasing or increasing the host’s vulnerability to subsequent infections. Caring for contagious individuals can thus significantly alter the future disease susceptibility of caregivers. Using ants and their fungal pathogens as a model system, we tested if the altered disease susceptibility of experienced caregivers, in turn, affects their expression of sanitary care behavior. We found that low-level infections contracted during sanitary care had protective or neutral effects on secondary exposure to the same (homologous) pathogen but consistently caused high mortality on superinfection with a different (heterologous) pathogen. In response to this risk, the ants selectively adjusted the expression of their sanitary care. Specifically, the ants performed less grooming and more antimicrobial disinfection when caring for nestmates contaminated with heterologous pathogens compared with homologous ones. By modulating the components of sanitary care in this way the ants acquired less infectious particles of the heterologous pathogens, resulting in reduced superinfection. The performance of risk-adjusted sanitary care reveals the remarkable capacity of ants to react to changes in their disease susceptibility, according to their own infection history and to flexibly adjust collective care to individual risk.","lang":"eng"}],"issue":"11","type":"journal_article","language":[{"iso":"eng"}],"doi":"10.1073/pnas.1713501115","isi":1,"quality_controlled":"1","project":[{"name":"Social Vaccination in Ant Colonies: from Individual Mechanisms to Society Effects","call_identifier":"FP7","_id":"25DC711C-B435-11E9-9278-68D0E5697425","grant_number":"243071"}],"external_id":{"isi":["000427245400069"],"pmid":["29463746"]},"oa":1,"main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pubmed/29463746","open_access":"1"}],"month":"03","date_updated":"2023-09-08T13:22:21Z","date_created":"2018-12-11T11:46:20Z","volume":115,"author":[{"full_name":"Konrad, Matthias","first_name":"Matthias","last_name":"Konrad","id":"46528076-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Christopher","last_name":"Pull","id":"3C7F4840-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1122-3982","full_name":"Pull, Christopher"},{"id":"48204546-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9547-2494","first_name":"Sina","last_name":"Metzler","full_name":"Metzler, Sina"},{"full_name":"Seif, Katharina","first_name":"Katharina","last_name":"Seif","id":"90F7894A-02CF-11E9-976E-E38CFE5CBC1D"},{"full_name":"Naderlinger, Elisabeth","id":"31757262-F248-11E8-B48F-1D18A9856A87","first_name":"Elisabeth","last_name":"Naderlinger"},{"full_name":"Grasse, Anna V","id":"406F989C-F248-11E8-B48F-1D18A9856A87","first_name":"Anna V","last_name":"Grasse"},{"last_name":"Cremer","first_name":"Sylvia","orcid":"0000-0002-2193-3868","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","full_name":"Cremer, Sylvia"}],"related_material":{"link":[{"url":"https://ist.ac.at/en/news/helping-in-spite-of-risk-ants-perform-risk-averse-sanitary-care-of-infectious-nest-mates/","description":"News on IST Homepage","relation":"press_release"}]},"publication_status":"published","publisher":"National Academy of Sciences","department":[{"_id":"SyCr"}],"year":"2018","pmid":1,"ec_funded":1,"publist_id":"7416"},{"type":"journal_article","abstract":[{"text":"We demonstrate that identical impurities immersed in a two-dimensional many-particle bath can be viewed as flux-tube-charged-particle composites described by fractional statistics. In particular, we find that the bath manifests itself as an external magnetic flux tube with respect to the impurities, and hence the time-reversal symmetry is broken for the effective Hamiltonian describing the impurities. The emerging flux tube acts as a statistical gauge field after a certain critical coupling. This critical coupling corresponds to the intersection point between the quasiparticle state and the phonon wing, where the angular momentum is transferred from the impurity to the bath. This amounts to a novel configuration with emerging anyons. The proposed setup paves the way to realizing anyons using electrons interacting with superfluid helium or lattice phonons, as well as using atomic impurities in ultracold gases.","lang":"eng"}],"issue":"4","status":"public","title":"Anyonic statistics of quantum impurities in two dimensions","intvolume":" 98","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"195","oa_version":"Submitted Version","scopus_import":"1","day":"15","article_processing_charge":"No","publication":"Physical Review B - Condensed Matter and Materials Physics","citation":{"ama":"Yakaboylu E, Lemeshko M. Anyonic statistics of quantum impurities in two dimensions. Physical Review B - Condensed Matter and Materials Physics. 2018;98(4). doi:10.1103/PhysRevB.98.045402","ista":"Yakaboylu E, Lemeshko M. 2018. Anyonic statistics of quantum impurities in two dimensions. Physical Review B - Condensed Matter and Materials Physics. 98(4), 045402.","apa":"Yakaboylu, E., & Lemeshko, M. (2018). Anyonic statistics of quantum impurities in two dimensions. Physical Review B - Condensed Matter and Materials Physics. American Physical Society. https://doi.org/10.1103/PhysRevB.98.045402","ieee":"E. Yakaboylu and M. Lemeshko, “Anyonic statistics of quantum impurities in two dimensions,” Physical Review B - Condensed Matter and Materials Physics, vol. 98, no. 4. American Physical Society, 2018.","mla":"Yakaboylu, Enderalp, and Mikhail Lemeshko. “Anyonic Statistics of Quantum Impurities in Two Dimensions.” Physical Review B - Condensed Matter and Materials Physics, vol. 98, no. 4, 045402, American Physical Society, 2018, doi:10.1103/PhysRevB.98.045402.","short":"E. Yakaboylu, M. Lemeshko, Physical Review B - Condensed Matter and Materials Physics 98 (2018).","chicago":"Yakaboylu, Enderalp, and Mikhail Lemeshko. “Anyonic Statistics of Quantum Impurities in Two Dimensions.” Physical Review B - Condensed Matter and Materials Physics. American Physical Society, 2018. https://doi.org/10.1103/PhysRevB.98.045402."},"date_published":"2018-07-15T00:00:00Z","article_number":"045402","ec_funded":1,"publication_status":"published","publisher":"American Physical Society","department":[{"_id":"MiLe"}],"year":"2018","date_updated":"2023-09-08T13:22:57Z","date_created":"2018-12-11T11:45:08Z","volume":98,"author":[{"last_name":"Yakaboylu","first_name":"Enderalp","orcid":"0000-0001-5973-0874","id":"38CB71F6-F248-11E8-B48F-1D18A9856A87","full_name":"Yakaboylu, Enderalp"},{"full_name":"Lemeshko, Mikhail","first_name":"Mikhail","last_name":"Lemeshko","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6990-7802"}],"month":"07","quality_controlled":"1","isi":1,"project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"},{"grant_number":"P29902","_id":"26031614-B435-11E9-9278-68D0E5697425","name":"Quantum rotations in the presence of a many-body environment","call_identifier":"FWF"}],"oa":1,"external_id":{"arxiv":["1712.00308"],"isi":["000436939100007"]},"main_file_link":[{"url":"https://arxiv.org/abs/1712.00308","open_access":"1"}],"language":[{"iso":"eng"}],"doi":"10.1103/PhysRevB.98.045402"}]