[{"issue":"10","external_id":{"arxiv":["1711.09904"],"isi":["000427517200065"]},"status":"public","language":[{"iso":"eng"}],"project":[{"grant_number":"P29902","_id":"26031614-B435-11E9-9278-68D0E5697425","name":"Quantum rotations in the presence of a many-body environment","call_identifier":"FWF"},{"call_identifier":"H2020","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program"}],"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"10759"}]},"intvolume":" 148","arxiv":1,"article_number":"104307","date_created":"2018-12-11T11:46:21Z","date_updated":"2026-04-07T14:20:12Z","publist_id":"7408","oa":1,"citation":{"apa":"Rzadkowski, W., & Lemeshko, M. (2018). Effect of a magnetic field on molecule–solvent angular momentum transfer. The Journal of Chemical Physics. AIP Publishing. https://doi.org/10.1063/1.5017591","chicago":"Rzadkowski, Wojciech, and Mikhail Lemeshko. “Effect of a Magnetic Field on Molecule–Solvent Angular Momentum Transfer.” The Journal of Chemical Physics. AIP Publishing, 2018. https://doi.org/10.1063/1.5017591.","ama":"Rzadkowski W, Lemeshko M. Effect of a magnetic field on molecule–solvent angular momentum transfer. The Journal of Chemical Physics. 2018;148(10). doi:10.1063/1.5017591","ieee":"W. Rzadkowski and M. Lemeshko, “Effect of a magnetic field on molecule–solvent angular momentum transfer,” The Journal of Chemical Physics, vol. 148, no. 10. AIP Publishing, 2018.","mla":"Rzadkowski, Wojciech, and Mikhail Lemeshko. “Effect of a Magnetic Field on Molecule–Solvent Angular Momentum Transfer.” The Journal of Chemical Physics, vol. 148, no. 10, 104307, AIP Publishing, 2018, doi:10.1063/1.5017591.","ista":"Rzadkowski W, Lemeshko M. 2018. Effect of a magnetic field on molecule–solvent angular momentum transfer. The Journal of Chemical Physics. 148(10), 104307.","short":"W. Rzadkowski, M. Lemeshko, The Journal of Chemical Physics 148 (2018)."},"article_processing_charge":"No","date_published":"2018-03-14T00:00:00Z","_id":"415","year":"2018","isi":1,"article_type":"original","author":[{"orcid":"0000-0002-1106-4419","full_name":"Rzadkowski, Wojciech","first_name":"Wojciech","id":"48C55298-F248-11E8-B48F-1D18A9856A87","last_name":"Rzadkowski"},{"first_name":"Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","last_name":"Lemeshko","orcid":"0000-0002-6990-7802","full_name":"Lemeshko, Mikhail"}],"publisher":"AIP Publishing","oa_version":"Preprint","month":"03","abstract":[{"text":"Recently it was shown that a molecule rotating in a quantum solvent can be described in terms of the “angulon” quasiparticle [M. Lemeshko, Phys. Rev. Lett. 118, 095301 (2017)]. Here we extend the angulon theory to the case of molecules possessing an additional spin-1/2 degree of freedom and study the behavior of the system in the presence of a static magnetic field. We show that exchange of angular momentum between the molecule and the solvent can be altered by the field, even though the solvent itself is non-magnetic. In particular, we demonstrate a possibility to control resonant emission of phonons with a given angular momentum using a magnetic field.","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1711.09904"}],"scopus_import":"1","type":"journal_article","quality_controlled":"1","volume":148,"department":[{"_id":"MiLe"}],"ec_funded":1,"doi":"10.1063/1.5017591","day":"14","acknowledgement":"We acknowledge insightful discussions with Giacomo Bighin, Igor Cherepanov, Johan Mentink, and Enderalp Yakaboylu. This work was supported by the Austrian Science Fund (FWF), Project No. P29902-N27. W.R. was supported by the Polish Ministry of Science and Higher Education Grant No. MNISW/2016/DIR/285/NN and by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.\r\n","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"The Journal of Chemical Physics","title":"Effect of a magnetic field on molecule–solvent angular momentum transfer"},{"volume":10982,"scopus_import":"1","quality_controlled":"1","type":"conference","has_accepted_license":"1","abstract":[{"lang":"eng","text":"Given a model and a specification, the fundamental model-checking problem asks for algorithmic verification of whether the model satisfies the specification. We consider graphs and Markov decision processes (MDPs), which are fundamental models for reactive systems. One of the very basic specifications that arise in verification of reactive systems is the strong fairness (aka Streett) objective. Given different types of requests and corresponding grants, the objective requires that for each type, if the request event happens infinitely often, then the corresponding grant event must also happen infinitely often. All ω -regular objectives can be expressed as Streett objectives and hence they are canonical in verification. To handle the state-space explosion, symbolic algorithms are required that operate on a succinct implicit representation of the system rather than explicitly accessing the system. While explicit algorithms for graphs and MDPs with Streett objectives have been widely studied, there has been no improvement of the basic symbolic algorithms. The worst-case numbers of symbolic steps required for the basic symbolic algorithms are as follows: quadratic for graphs and cubic for MDPs. In this work we present the first sub-quadratic symbolic algorithm for graphs with Streett objectives, and our algorithm is sub-quadratic even for MDPs. Based on our algorithmic insights we present an implementation of the new symbolic approach and show that it improves the existing approach on several academic benchmark examples."}],"title":"Symbolic algorithms for graphs and Markov decision processes with fairness objectives","ddc":["000"],"publication_status":"published","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"18","acknowledgement":"Acknowledgements. K. C. and M. H. are partially supported by the Vienna Science and Technology Fund (WWTF) grant ICT15-003. K. C. is partially supported by the Austrian Science Fund (FWF): S11407-N23 (RiSE/SHiNE), and an ERC Start Grant (279307: Graph Games). V. T. is partially supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie Grant Agreement No. 665385.","file_date_updated":"2020-07-14T12:44:53Z","doi":"10.1007/978-3-319-96142-2_13","ec_funded":1,"file":[{"relation":"main_file","file_id":"5737","file_size":675606,"access_level":"open_access","checksum":"1a6ffa4febe8bb8ac28be3adb3eafebc","content_type":"application/pdf","date_updated":"2020-07-14T12:44:53Z","date_created":"2018-12-18T08:52:38Z","file_name":"2018_LNCS_Chatterjee.pdf","creator":"dernst"}],"department":[{"_id":"KrCh"}],"intvolume":" 10982","project":[{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"H2020","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385"}],"related_material":{"record":[{"id":"10199","relation":"dissertation_contains","status":"public"}]},"page":"178-197","alternative_title":["LNCS"],"status":"public","language":[{"iso":"eng"}],"external_id":{"isi":["000491469700013"]},"publisher":"Springer","oa_version":"Published Version","month":"07","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","last_name":"Henzinger"},{"first_name":"Veronika","last_name":"Loitzenbauer","full_name":"Loitzenbauer, Veronika"},{"full_name":"Oraee, Simin","last_name":"Oraee","first_name":"Simin"},{"orcid":"0000-0001-9036-063X","full_name":"Toman, Viktor","first_name":"Viktor","id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87","last_name":"Toman"}],"conference":{"name":"CAV: Computer Aided Verification","location":"Oxford, United Kingdom","end_date":"2018-07-17","start_date":"2018-07-14"},"isi":1,"year":"2018","date_published":"2018-07-18T00:00:00Z","_id":"141","citation":{"short":"K. Chatterjee, M. Henzinger, V. Loitzenbauer, S. Oraee, V. Toman, in:, Springer, 2018, pp. 178–197.","ista":"Chatterjee K, Henzinger M, Loitzenbauer V, Oraee S, Toman V. 2018. Symbolic algorithms for graphs and Markov decision processes with fairness objectives. CAV: Computer Aided Verification, LNCS, vol. 10982, 178–197.","mla":"Chatterjee, Krishnendu, et al. Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives. Vol. 10982, Springer, 2018, pp. 178–97, doi:10.1007/978-3-319-96142-2_13.","ieee":"K. Chatterjee, M. Henzinger, V. Loitzenbauer, S. Oraee, and V. Toman, “Symbolic algorithms for graphs and Markov decision processes with fairness objectives,” presented at the CAV: Computer Aided Verification, Oxford, United Kingdom, 2018, vol. 10982, pp. 178–197.","ama":"Chatterjee K, Henzinger M, Loitzenbauer V, Oraee S, Toman V. Symbolic algorithms for graphs and Markov decision processes with fairness objectives. In: Vol 10982. Springer; 2018:178-197. doi:10.1007/978-3-319-96142-2_13","chicago":"Chatterjee, Krishnendu, Monika Henzinger, Veronika Loitzenbauer, Simin Oraee, and Viktor Toman. “Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives,” 10982:178–97. Springer, 2018. https://doi.org/10.1007/978-3-319-96142-2_13.","apa":"Chatterjee, K., Henzinger, M., Loitzenbauer, V., Oraee, S., & Toman, V. (2018). Symbolic algorithms for graphs and Markov decision processes with fairness objectives (Vol. 10982, pp. 178–197). Presented at the CAV: Computer Aided Verification, Oxford, United Kingdom: Springer. https://doi.org/10.1007/978-3-319-96142-2_13"},"article_processing_charge":"No","date_created":"2018-12-11T11:44:51Z","publist_id":"7782","date_updated":"2026-04-08T07:00:31Z","oa":1},{"title":"Distributionally linearizable data structures","publication":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA '18","day":"16","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1145/3210377.3210411","department":[{"_id":"DaAl"}],"scopus_import":"1","quality_controlled":"1","type":"conference","abstract":[{"text":"Relaxed concurrent data structures have become increasingly popular, due to their scalability in graph processing and machine learning applications (\\citeNguyen13, gonzalez2012powergraph ). Despite considerable interest, there exist families of natural, high performing randomized relaxed concurrent data structures, such as the popular MultiQueue~\\citeMQ pattern for implementing relaxed priority queue data structures, for which no guarantees are known in the concurrent setting~\\citeAKLN17. Our main contribution is in showing for the first time that, under a set of analytic assumptions, a family of relaxed concurrent data structures, including variants of MultiQueues, but also a new approximate counting algorithm we call the MultiCounter, provides strong probabilistic guarantees on the degree of relaxation with respect to the sequential specification, in arbitrary concurrent executions. We formalize these guarantees via a new correctness condition called distributional linearizability, tailored to concurrent implementations with randomized relaxations. Our result is based on a new analysis of an asynchronous variant of the classic power-of-two-choices load balancing algorithm, in which placement choices can be based on inconsistent, outdated information (this result may be of independent interest). We validate our results empirically, showing that the MultiCounter algorithm can implement scalable relaxed timestamps.","lang":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1804.01018","open_access":"1"}],"author":[{"orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh"},{"first_name":"Trevor A","id":"3569F0A0-F248-11E8-B48F-1D18A9856A87","last_name":"Brown","full_name":"Brown, Trevor A"},{"full_name":"Kopinsky, Justin","last_name":"Kopinsky","first_name":"Justin"},{"last_name":"Li","first_name":"Jerry Z.","full_name":"Li, Jerry Z."},{"full_name":"Nadiradze, Giorgi","first_name":"Giorgi","last_name":"Nadiradze"}],"month":"07","publisher":"ACM","oa_version":"Preprint","conference":{"name":"SPAA: Symposium on Parallelism in Algorithms and Architectures","location":"Vienna, Austria","start_date":"2018-07-16","end_date":"2018-07-18"},"isi":1,"year":"2018","article_processing_charge":"No","citation":{"apa":"Alistarh, D.-A., Brown, T. A., Kopinsky, J., Li, J. Z., & Nadiradze, G. (2018). Distributionally linearizable data structures. In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18 (pp. 133–142). Vienna, Austria: ACM. https://doi.org/10.1145/3210377.3210411","chicago":"Alistarh, Dan-Adrian, Trevor A Brown, Justin Kopinsky, Jerry Z. Li, and Giorgi Nadiradze. “Distributionally Linearizable Data Structures.” In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, 133–42. ACM, 2018. https://doi.org/10.1145/3210377.3210411.","ama":"Alistarh D-A, Brown TA, Kopinsky J, Li JZ, Nadiradze G. Distributionally linearizable data structures. In: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18. ACM; 2018:133-142. doi:10.1145/3210377.3210411","mla":"Alistarh, Dan-Adrian, et al. “Distributionally Linearizable Data Structures.” Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, ACM, 2018, pp. 133–42, doi:10.1145/3210377.3210411.","ieee":"D.-A. Alistarh, T. A. Brown, J. Kopinsky, J. Z. Li, and G. Nadiradze, “Distributionally linearizable data structures,” in Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, Vienna, Austria, 2018, pp. 133–142.","ista":"Alistarh D-A, Brown TA, Kopinsky J, Li JZ, Nadiradze G. 2018. Distributionally linearizable data structures. Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18. SPAA: Symposium on Parallelism in Algorithms and Architectures, 133–142.","short":"D.-A. Alistarh, T.A. Brown, J. Kopinsky, J.Z. Li, G. Nadiradze, in:, Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, ACM, 2018, pp. 133–142."},"date_published":"2018-07-16T00:00:00Z","_id":"5965","date_created":"2019-02-13T10:17:19Z","date_updated":"2026-04-08T07:00:45Z","oa":1,"arxiv":1,"page":"133-142","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"10429"}]},"publication_identifier":{"isbn":["9781450357999"]},"status":"public","language":[{"iso":"eng"}],"external_id":{"isi":["000545269600016"],"arxiv":["1804.01018"]}},{"year":"2018","conference":{"location":"Budapest, Hungary","name":"SoCG: Symposium on Computational Geometry","start_date":"2018-06-11","end_date":"2018-06-14"},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa_version":"Published Version","month":"06","author":[{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"},{"full_name":"Osang, Georg F","orcid":"0000-0002-8882-5116","last_name":"Osang","id":"464B40D6-F248-11E8-B48F-1D18A9856A87","first_name":"Georg F"}],"oa":1,"publist_id":"7732","date_created":"2018-12-11T11:45:05Z","date_updated":"2026-04-08T07:01:29Z","_id":"187","date_published":"2018-06-11T00:00:00Z","citation":{"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","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","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.","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.","ista":"Edelsbrunner H, Osang GF. 2018. The multi-cover persistence of Euclidean balls. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 99, 34.","short":"H. Edelsbrunner, G.F. Osang, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018."},"related_material":{"record":[{"status":"public","id":"9317","relation":"later_version"},{"status":"public","id":"9056","relation":"dissertation_contains"}]},"project":[{"call_identifier":"FWF","name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425"}],"alternative_title":["LIPIcs"],"article_number":"34","intvolume":" 99","language":[{"iso":"eng"}],"status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","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).","day":"11","title":"The multi-cover persistence of Euclidean balls","ddc":["516"],"file":[{"creator":"dernst","access_level":"open_access","date_created":"2018-12-18T09:27:22Z","file_name":"2018_LIPIcs_Edelsbrunner_Osang.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:45:19Z","checksum":"d8c0533ad0018eb4ed1077475eb8fc18","file_size":528018,"relation":"main_file","file_id":"5738"}],"department":[{"_id":"HeEd"}],"file_date_updated":"2020-07-14T12:45:19Z","doi":"10.4230/LIPIcs.SoCG.2018.34","volume":99,"type":"conference","quality_controlled":"1","scopus_import":1,"abstract":[{"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. ","lang":"eng"}],"has_accepted_license":"1"},{"has_accepted_license":"1","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."}],"scopus_import":"1","type":"conference","quality_controlled":"1","volume":118,"OA_place":"publisher","department":[{"_id":"ToHe"}],"file":[{"file_size":745438,"relation":"main_file","file_id":"5368","creator":"system","access_level":"open_access","date_created":"2018-12-12T10:18:46Z","checksum":"c90895f4c5fafc18ddc54d1c8848077e","content_type":"application/pdf","date_updated":"2020-07-14T12:44:44Z","file_name":"IST-2018-853-v2+2_concur2018.pdf"}],"pubrep_id":"1039","doi":"10.4230/LIPIcs.CONCUR.2018.21","file_date_updated":"2020-07-14T12:44:44Z","OA_type":"gold","day":"13","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"title":"Synchronizing the asynchronous","extern":"1","ddc":["000"],"publication_identifier":{"issn":["1868-8969"]},"status":"public","language":[{"iso":"eng"}],"alternative_title":["LIPIcs"],"project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S11402-N23","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","name":"Moderne Concurrency Paradigms"}],"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"6426"},{"status":"public","id":"8332","relation":"dissertation_contains"}]},"intvolume":" 118","article_number":"21","publist_id":"7790","date_updated":"2026-04-08T07:23:52Z","date_created":"2018-12-11T11:44:48Z","oa":1,"article_processing_charge":"No","citation":{"ista":"Kragl B, Qadeer S, Henzinger TA. 2018. Synchronizing the asynchronous. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 118, 21.","short":"B. Kragl, S. Qadeer, T.A. Henzinger, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.","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","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","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.","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","_id":"133","conference":{"name":"CONCUR: International Conference on Concurrency Theory","location":"Beijing, China","end_date":"2018-09-07","start_date":"2018-09-04"},"year":"2018","author":[{"orcid":"0000-0001-7745-9117","full_name":"Kragl, Bernhard","last_name":"Kragl","first_name":"Bernhard","id":"320FC952-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Qadeer, Shaz","last_name":"Qadeer","first_name":"Shaz"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"oa_version":"Published Version","month":"08","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik"},{"intvolume":" 10981","project":[{"name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"}],"page":"79 - 102","related_material":{"record":[{"relation":"dissertation_contains","id":"8332","status":"public"}]},"alternative_title":["LNCS"],"status":"public","language":[{"iso":"eng"}],"external_id":{"isi":["000491481600005"]},"month":"07","publisher":"Springer","oa_version":"Published Version","author":[{"orcid":"0000-0001-7745-9117","full_name":"Kragl, Bernhard","last_name":"Kragl","first_name":"Bernhard","id":"320FC952-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Qadeer, Shaz","first_name":"Shaz","last_name":"Qadeer"}],"conference":{"end_date":"2018-07-17","start_date":"2018-07-14","location":"Oxford, UK","name":"CAV: Computer Aided Verification"},"isi":1,"year":"2018","date_published":"2018-07-18T00:00:00Z","_id":"160","citation":{"short":"B. Kragl, S. Qadeer, in:, Springer, 2018, pp. 79–102.","ista":"Kragl B, Qadeer S. 2018. Layered Concurrent Programs. CAV: Computer Aided Verification, LNCS, vol. 10981, 79–102.","mla":"Kragl, Bernhard, and Shaz Qadeer. Layered Concurrent Programs. Vol. 10981, Springer, 2018, pp. 79–102, doi:10.1007/978-3-319-96145-3_5.","ieee":"B. Kragl and S. Qadeer, “Layered Concurrent Programs,” presented at the CAV: Computer Aided Verification, Oxford, UK, 2018, vol. 10981, pp. 79–102.","ama":"Kragl B, Qadeer S. Layered Concurrent Programs. In: Vol 10981. Springer; 2018:79-102. doi:10.1007/978-3-319-96145-3_5","chicago":"Kragl, Bernhard, and Shaz Qadeer. “Layered Concurrent Programs,” 10981:79–102. Springer, 2018. https://doi.org/10.1007/978-3-319-96145-3_5.","apa":"Kragl, B., & Qadeer, S. (2018). Layered Concurrent Programs (Vol. 10981, pp. 79–102). Presented at the CAV: Computer Aided Verification, Oxford, UK: Springer. https://doi.org/10.1007/978-3-319-96145-3_5"},"article_processing_charge":"No","publist_id":"7761","date_created":"2018-12-11T11:44:57Z","date_updated":"2026-04-08T07:23:52Z","oa":1,"volume":10981,"scopus_import":"1","type":"conference","quality_controlled":"1","has_accepted_license":"1","abstract":[{"lang":"eng","text":"We present layered concurrent programs, a compact and expressive notation for specifying refinement proofs of concurrent programs. A layered concurrent program specifies a sequence of connected concurrent programs, from most concrete to most abstract, such that common parts of different programs are written exactly once. These programs are expressed in the ordinary syntax of imperative concurrent programs using gated atomic actions, sequencing, choice, and (recursive) procedure calls. Each concurrent program is automatically extracted from the layered program. We reduce refinement to the safety of a sequence of concurrent checker programs, one each to justify the connection between every two consecutive concurrent programs. These checker programs are also automatically extracted from the layered program. Layered concurrent programs have been implemented in the CIVL verifier which has been successfully used for the verification of several complex concurrent programs."}],"ddc":["000"],"title":"Layered Concurrent Programs","publication_status":"published","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"day":"18","file_date_updated":"2020-07-14T12:45:04Z","doi":"10.1007/978-3-319-96145-3_5","file":[{"date_updated":"2020-07-14T12:45:04Z","file_name":"2018_LNCS_Kragl.pdf","date_created":"2018-12-17T12:52:12Z","checksum":"c64fff560fe5a7532ec10626ad1c215e","content_type":"application/pdf","access_level":"open_access","creator":"dernst","file_id":"5705","relation":"main_file","file_size":1603844}],"department":[{"_id":"ToHe"}]},{"abstract":[{"lang":"eng","text":"Because of the intrinsic randomness of the evolutionary process, a mutant with a fitness advantage has some chance to be selected but no certainty. Any experiment that searches for advantageous mutants will lose many of them due to random drift. It is therefore of great interest to find population structures that improve the odds of advantageous mutants. Such structures are called amplifiers of natural selection: they increase the probability that advantageous mutants are selected. Arbitrarily strong amplifiers guarantee the selection of advantageous mutants, even for very small fitness advantage. Despite intensive research over the past decade, arbitrarily strong amplifiers have remained rare. Here we show how to construct a large variety of them. Our amplifiers are so simple that they could be useful in biotechnology, when optimizing biological molecules, or as a diagnostic tool, when searching for faster dividing cells or viruses. They could also occur in natural population structures."}],"has_accepted_license":"1","volume":1,"type":"journal_article","quality_controlled":"1","scopus_import":"1","ec_funded":1,"file":[{"file_size":1804194,"relation":"main_file","file_id":"5752","creator":"dernst","access_level":"open_access","date_updated":"2020-07-14T12:47:10Z","file_name":"2018_CommBiology_Pavlogiannis.pdf","date_created":"2018-12-18T13:37:04Z","content_type":"application/pdf","checksum":"a9db825fa3b64a51ff3de035ec973b3e"}],"department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:47:10Z","doi":"10.1038/s42003-018-0078-7","pubrep_id":"1045","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publication_status":"published","day":"14","ddc":["004","519","576"],"publication":"Communications Biology","title":"Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory","external_id":{"isi":["000461126500071"]},"issue":"1","language":[{"iso":"eng"}],"publication_identifier":{"issn":["2399-3642"]},"status":"public","related_material":{"record":[{"status":"public","id":"5559","relation":"popular_science"},{"status":"public","relation":"part_of_dissertation","id":"7196"}]},"project":[{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7"},{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"article_number":"71","intvolume":" 1","oa":1,"date_created":"2018-12-18T13:22:58Z","date_updated":"2026-04-08T07:24:11Z","_id":"5751","date_published":"2018-06-14T00:00:00Z","citation":{"short":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M.A. Nowak, Communications Biology 1 (2018).","ista":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak MA. 2018. Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory. Communications Biology. 1(1), 71.","ieee":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. A. Nowak, “Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory,” Communications Biology, vol. 1, no. 1. Springer Nature, 2018.","mla":"Pavlogiannis, Andreas, et al. “Construction of Arbitrarily Strong Amplifiers of Natural Selection Using Evolutionary Graph Theory.” Communications Biology, vol. 1, no. 1, 71, Springer Nature, 2018, doi:10.1038/s42003-018-0078-7.","ama":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak MA. Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory. Communications Biology. 2018;1(1). doi:10.1038/s42003-018-0078-7","chicago":"Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin A. Nowak. “Construction of Arbitrarily Strong Amplifiers of Natural Selection Using Evolutionary Graph Theory.” Communications Biology. Springer Nature, 2018. https://doi.org/10.1038/s42003-018-0078-7.","apa":"Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. A. (2018). Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory. Communications Biology. Springer Nature. https://doi.org/10.1038/s42003-018-0078-7"},"article_processing_charge":"No","year":"2018","isi":1,"publisher":"Springer Nature","oa_version":"Published Version","month":"06","author":[{"last_name":"Pavlogiannis","first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas"},{"full_name":"Tkadlec, Josef","orcid":"0000-0002-1097-9684","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","first_name":"Josef","last_name":"Tkadlec"},{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Nowak, Martin A.","first_name":"Martin A.","last_name":"Nowak"}]},{"isi":1,"year":"2018","publisher":"Cambridge University Press","month":"05","oa_version":"Published Version","author":[{"orcid":"0000-0002-2548-617X","full_name":"Akopyan, Arseniy","first_name":"Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","last_name":"Akopyan"},{"last_name":"Avvakumov","id":"3827DAC8-F248-11E8-B48F-1D18A9856A87","first_name":"Sergey","full_name":"Avvakumov, Sergey","orcid":"0000-0002-7840-5062"}],"oa":1,"date_created":"2019-04-30T06:09:57Z","date_updated":"2026-04-08T07:25:54Z","_id":"6355","date_published":"2018-05-31T00:00:00Z","citation":{"ama":"Akopyan A, Avvakumov S. Any cyclic quadrilateral can be inscribed in any closed convex smooth curve. Forum of Mathematics, Sigma. 2018;6. doi:10.1017/fms.2018.7","ieee":"A. Akopyan and S. Avvakumov, “Any cyclic quadrilateral can be inscribed in any closed convex smooth curve,” Forum of Mathematics, Sigma, vol. 6. Cambridge University Press, 2018.","mla":"Akopyan, Arseniy, and Sergey Avvakumov. “Any Cyclic Quadrilateral Can Be Inscribed in Any Closed Convex Smooth Curve.” Forum of Mathematics, Sigma, vol. 6, e7, Cambridge University Press, 2018, doi:10.1017/fms.2018.7.","apa":"Akopyan, A., & Avvakumov, S. (2018). Any cyclic quadrilateral can be inscribed in any closed convex smooth curve. Forum of Mathematics, Sigma. Cambridge University Press. https://doi.org/10.1017/fms.2018.7","chicago":"Akopyan, Arseniy, and Sergey Avvakumov. “Any Cyclic Quadrilateral Can Be Inscribed in Any Closed Convex Smooth Curve.” Forum of Mathematics, Sigma. Cambridge University Press, 2018. https://doi.org/10.1017/fms.2018.7.","short":"A. Akopyan, S. Avvakumov, Forum of Mathematics, Sigma 6 (2018).","ista":"Akopyan A, Avvakumov S. 2018. Any cyclic quadrilateral can be inscribed in any closed convex smooth curve. Forum of Mathematics, Sigma. 6, e7."},"article_processing_charge":"No","related_material":{"record":[{"status":"public","id":"8156","relation":"dissertation_contains"}]},"project":[{"grant_number":"716117","_id":"256E75B8-B435-11E9-9278-68D0E5697425","name":"Optimal Transport and Stochastic Dynamics","call_identifier":"H2020"}],"arxiv":1,"article_number":"e7","intvolume":" 6","external_id":{"isi":["000433915500001"],"arxiv":["1712.10205"]},"language":[{"iso":"eng"}],"status":"public","publication_identifier":{"issn":["2050-5094"]},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publication_status":"published","day":"31","title":"Any cyclic quadrilateral can be inscribed in any closed convex smooth curve","publication":"Forum of Mathematics, Sigma","ddc":["510"],"file":[{"file_size":249246,"relation":"main_file","file_id":"6356","creator":"dernst","access_level":"open_access","file_name":"2018_ForumMahtematics_Akopyan.pdf","date_created":"2019-04-30T06:14:58Z","checksum":"5a71b24ba712a3eb2e46165a38fbc30a","date_updated":"2020-07-14T12:47:28Z","content_type":"application/pdf"}],"ec_funded":1,"department":[{"_id":"UlWa"},{"_id":"HeEd"},{"_id":"JaMa"}],"file_date_updated":"2020-07-14T12:47:28Z","doi":"10.1017/fms.2018.7","volume":6,"type":"journal_article","quality_controlled":"1","abstract":[{"text":"We prove that any cyclic quadrilateral can be inscribed in any closed convex C1-curve. The smoothness condition is not required if the quadrilateral is a rectangle.","lang":"eng"}],"has_accepted_license":"1","corr_author":"1"},{"arxiv":1,"article_number":"1804.03057","project":[{"name":"Optimal Transport and Stochastic Dynamics","grant_number":"716117","_id":"256E75B8-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"8156"}]},"type":"preprint","status":"public","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1804.03057","open_access":"1"}],"corr_author":"1","abstract":[{"text":"We prove that any convex body in the plane can be partitioned into m convex parts of equal areas and perimeters for any integer m≥2; this result was previously known for prime powers m=pk. We also give a higher-dimensional generalization.","lang":"eng"}],"external_id":{"arxiv":["1804.03057"]},"oa_version":"Preprint","month":"09","publisher":"arXiv","title":"Convex fair partitions into arbitrary number of pieces","author":[{"last_name":"Akopyan","first_name":"Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2548-617X","full_name":"Akopyan, Arseniy"},{"id":"3827DAC8-F248-11E8-B48F-1D18A9856A87","first_name":"Sergey","last_name":"Avvakumov","full_name":"Avvakumov, Sergey","orcid":"0000-0002-7840-5062"},{"first_name":"Roman","last_name":"Karasev","full_name":"Karasev, Roman"}],"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"13","year":"2018","date_published":"2018-09-13T00:00:00Z","_id":"75","citation":{"short":"A. Akopyan, S. Avvakumov, R. Karasev, (2018).","ista":"Akopyan A, Avvakumov S, Karasev R. 2018. Convex fair partitions into arbitrary number of pieces. 1804.03057.","ama":"Akopyan A, Avvakumov S, Karasev R. Convex fair partitions into arbitrary number of pieces. 2018. doi:10.48550/arXiv.1804.03057","ieee":"A. Akopyan, S. Avvakumov, and R. Karasev, “Convex fair partitions into arbitrary number of pieces.” arXiv, 2018.","mla":"Akopyan, Arseniy, et al. Convex Fair Partitions into Arbitrary Number of Pieces. 1804.03057, arXiv, 2018, doi:10.48550/arXiv.1804.03057.","apa":"Akopyan, A., Avvakumov, S., & Karasev, R. (2018). Convex fair partitions into arbitrary number of pieces. arXiv. https://doi.org/10.48550/arXiv.1804.03057","chicago":"Akopyan, Arseniy, Sergey Avvakumov, and Roman Karasev. “Convex Fair Partitions into Arbitrary Number of Pieces.” arXiv, 2018. https://doi.org/10.48550/arXiv.1804.03057."},"doi":"10.48550/arXiv.1804.03057","article_processing_charge":"No","ec_funded":1,"date_updated":"2026-04-08T07:25:54Z","department":[{"_id":"HeEd"},{"_id":"JaMa"}],"date_created":"2018-12-11T11:44:30Z","oa":1},{"language":[{"iso":"eng"}],"status":"public","external_id":{"isi":["000445560800010"]},"issue":"3902 ","intvolume":" 9","related_material":{"record":[{"relation":"popular_science","id":"7977"},{"id":"7996","relation":"dissertation_contains","status":"public"}]},"project":[{"call_identifier":"FP7","name":"Towards Spin qubits and Majorana fermions in Germanium self assembled 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"}],"_id":"77","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"date_published":"2018-09-25T00:00:00Z","article_processing_charge":"Yes","citation":{"short":"H. Watzinger, J. Kukucka, L. Vukušić, F. Gao, T. Wang, F. Schäffler, J. Zhang, G. Katsaros, Nature Communications 9 (2018).","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).","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.","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","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.","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"},"oa":1,"date_updated":"2026-04-08T07:27:13Z","date_created":"2018-12-11T11:44:30Z","oa_version":"Published Version","month":"09","publisher":"Nature Publishing Group","author":[{"last_name":"Watzinger","id":"35DF8E50-F248-11E8-B48F-1D18A9856A87","first_name":"Hannes","full_name":"Watzinger, Hannes"},{"id":"3F5D8856-F248-11E8-B48F-1D18A9856A87","first_name":"Josip","last_name":"Kukucka","full_name":"Kukucka, Josip"},{"id":"31E9F056-F248-11E8-B48F-1D18A9856A87","first_name":"Lada","last_name":"Vukusic","full_name":"Vukusic, Lada","orcid":"0000-0003-2424-8636"},{"first_name":"Fei","last_name":"Gao","full_name":"Gao, Fei"},{"last_name":"Wang","first_name":"Ting","full_name":"Wang, Ting"},{"last_name":"Schäffler","first_name":"Friedrich","full_name":"Schäffler, Friedrich"},{"first_name":"Jian","last_name":"Zhang","full_name":"Zhang, Jian"},{"last_name":"Katsaros","first_name":"Georgios","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8342-202X","full_name":"Katsaros, Georgios"}],"article_type":"original","year":"2018","isi":1,"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"}],"has_accepted_license":"1","volume":9,"quality_controlled":"1","type":"journal_article","scopus_import":"1","file_date_updated":"2020-07-14T12:48:02Z","doi":"10.1038/s41467-018-06418-4","file":[{"creator":"dernst","content_type":"application/pdf","checksum":"e7148c10a64497e279c4de570b6cc544","date_created":"2018-12-17T10:28:30Z","date_updated":"2020-07-14T12:48:02Z","file_name":"2018_NatureComm_Watzinger.pdf","access_level":"open_access","file_size":1063469,"file_id":"5687","relation":"main_file"}],"ec_funded":1,"department":[{"_id":"GeKa"}],"ddc":["530"],"title":"A germanium hole spin qubit","publication":"Nature Communications","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publication_status":"published","day":"25"},{"scopus_import":"1","quality_controlled":"1","type":"journal_article","volume":2018,"abstract":[{"lang":"eng","text":"We prove a new central limit theorem (CLT) for the difference of linear eigenvalue statistics of a Wigner random matrix H and its minor H and find that the fluctuation is much smaller than the fluctuations of the individual linear statistics, as a consequence of the strong correlation between the eigenvalues of H and H. In particular, our theorem identifies the fluctuation of Kerov's rectangular Young diagrams, defined by the interlacing eigenvalues ofH and H, around their asymptotic shape, the Vershik'Kerov'Logan'Shepp curve. Young diagrams equipped with the Plancherel measure follow the same limiting shape. For this, algebraically motivated, ensemble a CLT has been obtained in Ivanov and Olshanski [20] which is structurally similar to our result but the variance is different, indicating that the analogy between the two models has its limitations. Moreover, our theorem shows that Borodin's result [7] on the convergence of the spectral distribution of Wigner matrices to a Gaussian free field also holds in derivative sense."}],"main_file_link":[{"url":"https://arxiv.org/abs/1608.05163","open_access":"1"}],"publication":"International Mathematics Research Notices","title":"Fluctuations of rectangular young diagrams of interlacing wigner eigenvalues","day":"18","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1093/imrn/rnw330","department":[{"_id":"LaEr"}],"ec_funded":1,"intvolume":" 2018","arxiv":1,"project":[{"grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7"}],"related_material":{"record":[{"relation":"dissertation_contains","id":"6179","status":"public"}]},"page":"3255-3298","publication_identifier":{"issn":["1073-7928"]},"status":"public","language":[{"iso":"eng"}],"issue":"10","external_id":{"arxiv":["1608.05163"],"isi":["000441668300009"]},"author":[{"full_name":"Erdös, László","orcid":"0000-0001-5366-9603","last_name":"Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László"},{"orcid":"0000-0002-2904-1856","full_name":"Schröder, Dominik J","last_name":"Schröder","first_name":"Dominik J","id":"408ED176-F248-11E8-B48F-1D18A9856A87"}],"oa_version":"Preprint","month":"05","publisher":"Oxford University Press","isi":1,"year":"2018","article_processing_charge":"No","citation":{"chicago":"Erdös, László, and Dominik J Schröder. “Fluctuations of Rectangular Young Diagrams of Interlacing Wigner Eigenvalues.” International Mathematics Research Notices. Oxford University Press, 2018. https://doi.org/10.1093/imrn/rnw330.","apa":"Erdös, L., & Schröder, D. J. (2018). Fluctuations of rectangular young diagrams of interlacing wigner eigenvalues. International Mathematics Research Notices. Oxford University Press. https://doi.org/10.1093/imrn/rnw330","ieee":"L. Erdös and D. J. Schröder, “Fluctuations of rectangular young diagrams of interlacing wigner eigenvalues,” International Mathematics Research Notices, vol. 2018, no. 10. Oxford University Press, pp. 3255–3298, 2018.","mla":"Erdös, László, and Dominik J. Schröder. “Fluctuations of Rectangular Young Diagrams of Interlacing Wigner Eigenvalues.” International Mathematics Research Notices, vol. 2018, no. 10, Oxford University Press, 2018, pp. 3255–98, doi:10.1093/imrn/rnw330.","ama":"Erdös L, Schröder DJ. Fluctuations of rectangular young diagrams of interlacing wigner eigenvalues. International Mathematics Research Notices. 2018;2018(10):3255-3298. doi:10.1093/imrn/rnw330","ista":"Erdös L, Schröder DJ. 2018. Fluctuations of rectangular young diagrams of interlacing wigner eigenvalues. International Mathematics Research Notices. 2018(10), 3255–3298.","short":"L. Erdös, D.J. Schröder, International Mathematics Research Notices 2018 (2018) 3255–3298."},"date_published":"2018-05-18T00:00:00Z","_id":"1012","date_updated":"2026-04-08T13:55:03Z","publist_id":"6383","date_created":"2018-12-11T11:49:41Z","oa":1},{"quality_controlled":"1","type":"journal_article","scopus_import":"1","volume":115,"abstract":[{"text":"Although cells respond specifically to environments, how environmental identity is encoded intracellularly is not understood. Here, we study this organization of information in budding yeast by estimating the mutual information between environmental transitions and the dynamics of nuclear translocation for 10 transcription factors. Our method of estimation is general, scalable, and based on decoding from single cells. The dynamics of the transcription factors are necessary to encode the highest amounts of extracellular information, and we show that information is transduced through two channels: Generalists (Msn2/4, Tod6 and Dot6, Maf1, and Sfp1) can encode the nature of multiple stresses, but only if stress is high; specialists (Hog1, Yap1, and Mig1/2) encode one particular stress, but do so more quickly and for a wider range of magnitudes. In particular, Dot6 encodes almost as much information as Msn2, the master regulator of the environmental stress response. Each transcription factor reports differently, and it is only their collective behavior that distinguishes between multiple environmental states. Changes in the dynamics of the localization of transcription factors thus constitute a precise, distributed internal representation of extracellular change. We predict that such multidimensional representations are common in cellular decision-making.","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"https://www.biorxiv.org/content/early/2017/09/21/192039"}],"publication":"PNAS","title":"Distributed and dynamic intracellular organization of extracellular information","day":"05","acknowledgement":"This work was supported by the Biotechnology and Biological Sciences Research Council (J.M.J.P., I.F., and P.S.S.), the Engineering and Physical Sciences Research Council (EPSRC) (A.A.G.), and Austrian Science Fund Grant FWF P28844 (to G.T.).","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publication_status":"published","doi":"10.1073/pnas.1716659115","pmid":1,"department":[{"_id":"GaTk"}],"intvolume":" 115","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"6473"}]},"page":"6088 - 6093","project":[{"call_identifier":"FWF","grant_number":"P28844-B27","_id":"254E9036-B435-11E9-9278-68D0E5697425","name":"Biophysics of information processing in gene regulation"}],"language":[{"iso":"eng"}],"status":"public","external_id":{"isi":["000434114900071"],"pmid":["29784812"]},"issue":"23","author":[{"first_name":"Alejandro","last_name":"Granados","full_name":"Granados, Alejandro"},{"full_name":"Pietsch, Julian","last_name":"Pietsch","first_name":"Julian"},{"full_name":"Cepeda Humerez, Sarah A","last_name":"Cepeda Humerez","first_name":"Sarah A","id":"3DEE19A4-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Farquhar, Isebail","first_name":"Isebail","last_name":"Farquhar"},{"first_name":"Gasper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","last_name":"Tkacik","orcid":"0000-0002-6699-1455","full_name":"Tkacik, Gasper"},{"last_name":"Swain","first_name":"Peter","full_name":"Swain, Peter"}],"publisher":"National Academy of Sciences","oa_version":"Preprint","month":"06","isi":1,"year":"2018","article_type":"original","article_processing_charge":"No","citation":{"short":"A. Granados, J. Pietsch, S.A. Cepeda Humerez, I. Farquhar, G. Tkačik, P. Swain, PNAS 115 (2018) 6088–6093.","ista":"Granados A, Pietsch J, Cepeda Humerez SA, Farquhar I, Tkačik G, Swain P. 2018. Distributed and dynamic intracellular organization of extracellular information. PNAS. 115(23), 6088–6093.","mla":"Granados, Alejandro, et al. “Distributed and Dynamic Intracellular Organization of Extracellular Information.” PNAS, vol. 115, no. 23, National Academy of Sciences, 2018, pp. 6088–93, doi:10.1073/pnas.1716659115.","ieee":"A. Granados, J. Pietsch, S. A. Cepeda Humerez, I. Farquhar, G. Tkačik, and P. Swain, “Distributed and dynamic intracellular organization of extracellular information,” PNAS, vol. 115, no. 23. National Academy of Sciences, pp. 6088–6093, 2018.","ama":"Granados A, Pietsch J, Cepeda Humerez SA, Farquhar I, Tkačik G, Swain P. Distributed and dynamic intracellular organization of extracellular information. PNAS. 2018;115(23):6088-6093. doi:10.1073/pnas.1716659115","chicago":"Granados, Alejandro, Julian Pietsch, Sarah A Cepeda Humerez, Isebail Farquhar, Gašper Tkačik, and Peter Swain. “Distributed and Dynamic Intracellular Organization of Extracellular Information.” PNAS. National Academy of Sciences, 2018. https://doi.org/10.1073/pnas.1716659115.","apa":"Granados, A., Pietsch, J., Cepeda Humerez, S. A., Farquhar, I., Tkačik, G., & Swain, P. (2018). Distributed and dynamic intracellular organization of extracellular information. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1716659115"},"_id":"281","date_published":"2018-06-05T00:00:00Z","oa":1,"date_updated":"2026-04-08T13:55:45Z","date_created":"2018-12-11T11:45:35Z","publist_id":"7618"},{"related_material":{"record":[{"id":"278","relation":"part_of_dissertation","status":"public"}]},"type":"research_data","status":"public","keyword":["Publication analysis","Bibliography","Open Access"],"datarep_id":"89","abstract":[{"text":"Data on Austrian open access publication output at Emerald from 2013-2017 including data analysis.","lang":"ger"}],"has_accepted_license":"1","month":"01","oa_version":"Submitted Version","publisher":"Institute of Science and Technology Austria","ddc":["020"],"author":[{"last_name":"Villányi","id":"3FFCCD3A-F248-11E8-B48F-1D18A9856A87","first_name":"Márton","full_name":"Villányi, Márton","orcid":"0000-0001-8126-0426"}],"title":"Emerald Austrian Publications 2013-2017","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"name":"Creative Commons Public Domain Dedication (CC0 1.0)","short":"CC0 (1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","image":"/images/cc_0.png"},"year":"2018","day":"16","_id":"5577","file_date_updated":"2020-07-14T12:47:06Z","date_published":"2018-01-16T00:00:00Z","article_processing_charge":"No","doi":"10.15479/AT:ISTA:89","citation":{"short":"M. Villányi, (2018).","ista":"Villányi M. 2018. Emerald Austrian Publications 2013-2017, Institute of Science and Technology Austria, 10.15479/AT:ISTA:89.","ama":"Villányi M. Emerald Austrian Publications 2013-2017. 2018. doi:10.15479/AT:ISTA:89","ieee":"M. Villányi, “Emerald Austrian Publications 2013-2017.” Institute of Science and Technology Austria, 2018.","mla":"Villányi, Márton. Emerald Austrian Publications 2013-2017. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:89.","apa":"Villányi, M. (2018). Emerald Austrian Publications 2013-2017. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:89","chicago":"Villányi, Márton. “Emerald Austrian Publications 2013-2017.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:89."},"license":"https://creativecommons.org/publicdomain/zero/1.0/","file":[{"creator":"system","file_name":"IST-2018-89-v1+1_Emerald_Austrian_Publications_2013-2017.zip","checksum":"786b599abfae6c355dee87835f414549","date_created":"2018-12-12T13:02:39Z","date_updated":"2020-07-14T12:47:06Z","content_type":"application/zip","access_level":"open_access","file_size":222011,"file_id":"5604","relation":"main_file"}],"oa":1,"date_updated":"2026-04-08T14:02:27Z","date_created":"2018-12-12T12:31:37Z","department":[{"_id":"E-Lib"}]},{"has_accepted_license":"1","abstract":[{"lang":"ger","text":"Data on Austrian open access publication output at IOP from 2012-2015 including data analysis."}],"datarep_id":"90","keyword":["Publication analysis","Bibliography","Open Access"],"status":"public","type":"research_data","related_material":{"record":[{"status":"public","id":"278","relation":"part_of_dissertation"}]},"doi":"10.15479/AT:ISTA:90","article_processing_charge":"No","citation":{"chicago":"Villányi, Márton. “IOP Austrian Publications 2012-2015.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:90.","apa":"Villányi, M. (2018). IOP Austrian Publications 2012-2015. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:90","ieee":"M. Villányi, “IOP Austrian Publications 2012-2015.” Institute of Science and Technology Austria, 2018.","mla":"Villányi, Márton. IOP Austrian Publications 2012-2015. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:90.","ama":"Villányi M. IOP Austrian Publications 2012-2015. 2018. doi:10.15479/AT:ISTA:90","ista":"Villányi M. 2018. IOP Austrian Publications 2012-2015, Institute of Science and Technology Austria, 10.15479/AT:ISTA:90.","short":"M. Villányi, (2018)."},"date_published":"2018-01-16T00:00:00Z","_id":"5578","file_date_updated":"2020-07-14T12:47:06Z","date_updated":"2026-04-08T14:02:27Z","date_created":"2018-12-12T12:31:38Z","department":[{"_id":"E-Lib"}],"oa":1,"file":[{"creator":"system","checksum":"a4f1bf041ccd4c35912e2d595b0c2883","content_type":"application/zip","date_created":"2018-12-12T13:03:06Z","date_updated":"2020-07-14T12:47:06Z","file_name":"IST-2018-90-v1+1_IOP_Austrian_Publications_2012-2015.zip","access_level":"open_access","file_size":237067,"file_id":"5624","relation":"main_file"}],"title":"IOP Austrian Publications 2012-2015","author":[{"orcid":"0000-0001-8126-0426","full_name":"Villányi, Márton","last_name":"Villányi","first_name":"Márton","id":"3FFCCD3A-F248-11E8-B48F-1D18A9856A87"}],"ddc":["020"],"publisher":"Institute of Science and Technology Austria","oa_version":"Submitted Version","month":"01","year":"2018","day":"16","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"name":"Creative Commons Public Domain Dedication (CC0 1.0)","short":"CC0 (1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","image":"/images/cc_0.png"}},{"ddc":["020"],"title":"Data Check IOP Scopus vs. Publisher","author":[{"last_name":"Villányi","id":"3FFCCD3A-F248-11E8-B48F-1D18A9856A87","first_name":"Márton","full_name":"Villányi, Márton","orcid":"0000-0001-8126-0426"}],"month":"01","publisher":"Institute of Science and Technology Austria","oa_version":"Submitted Version","year":"2018","day":"16","tmp":{"name":"Creative Commons Public Domain Dedication (CC0 1.0)","short":"CC0 (1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","image":"/images/cc_0.png"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.15479/AT:ISTA:86","citation":{"short":"M. Villányi, (2018).","ista":"Villányi M. 2018. Data Check IOP Scopus vs. Publisher, Institute of Science and Technology Austria, 10.15479/AT:ISTA:86.","ama":"Villányi M. Data Check IOP Scopus vs. Publisher. 2018. doi:10.15479/AT:ISTA:86","ieee":"M. Villányi, “Data Check IOP Scopus vs. Publisher.” Institute of Science and Technology Austria, 2018.","mla":"Villányi, Márton. Data Check IOP Scopus vs. Publisher. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:86.","apa":"Villányi, M. (2018). Data Check IOP Scopus vs. Publisher. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:86","chicago":"Villányi, Márton. “Data Check IOP Scopus vs. Publisher.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:86."},"article_processing_charge":"No","_id":"5574","file_date_updated":"2020-07-14T12:47:05Z","date_published":"2018-01-16T00:00:00Z","oa":1,"department":[{"_id":"E-Lib"}],"date_created":"2018-12-12T12:31:37Z","date_updated":"2026-04-08T14:02:27Z","file":[{"file_size":12283857,"file_id":"5642","relation":"main_file","creator":"system","date_updated":"2020-07-14T12:47:05Z","content_type":"application/zip","checksum":"c7a61147bd15cb4ae45878d270628c06","file_name":"IST-2018-86-v1+1_Data_Check_IOP_Scopus_vs._Publisher.zip","date_created":"2018-12-12T13:05:14Z","access_level":"open_access"}],"type":"research_data","related_material":{"record":[{"relation":"part_of_dissertation","id":"278","status":"public"}]},"datarep_id":"86","abstract":[{"lang":"ger","text":"Comparison of Scopus' and publisher's data on Austrian publication output at IOP. "}],"has_accepted_license":"1","status":"public","keyword":["Publication analysis","Bibliography","Open Access"]},{"status":"public","keyword":["Publication analysis","Bibliography","Open Access"],"abstract":[{"lang":"eng","text":"Data on Austrian open access publication output at RSC from 2013-2017 including data analysis."}],"datarep_id":"91","has_accepted_license":"1","related_material":{"record":[{"relation":"part_of_dissertation","id":"278","status":"public"}]},"type":"research_data","file":[{"file_id":"5605","relation":"main_file","file_size":791408,"date_updated":"2020-07-14T12:47:06Z","file_name":"IST-2018-91-v1+1_RSC_Austrian__Publications_2013-2017.zip","date_created":"2018-12-12T13:02:40Z","content_type":"application/zip","checksum":"2a73efc5f94f8deb00e2b08c3dff8547","access_level":"open_access","creator":"system"}],"oa":1,"date_updated":"2026-04-08T14:02:27Z","date_created":"2018-12-12T12:31:38Z","department":[{"_id":"E-Lib"}],"file_date_updated":"2020-07-14T12:47:06Z","_id":"5579","date_published":"2018-01-16T00:00:00Z","citation":{"ista":"Villányi M. 2018. RSC Austrian Publications 2013-2017, Institute of Science and Technology Austria, 10.15479/AT:ISTA:91.","short":"M. Villányi, (2018).","chicago":"Villányi, Márton. “RSC Austrian Publications 2013-2017.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:91.","apa":"Villányi, M. (2018). RSC Austrian Publications 2013-2017. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:91","mla":"Villányi, Márton. RSC Austrian Publications 2013-2017. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:91.","ieee":"M. Villányi, “RSC Austrian Publications 2013-2017.” Institute of Science and Technology Austria, 2018.","ama":"Villányi M. RSC Austrian Publications 2013-2017. 2018. doi:10.15479/AT:ISTA:91"},"doi":"10.15479/AT:ISTA:91","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"name":"Creative Commons Public Domain Dedication (CC0 1.0)","short":"CC0 (1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","image":"/images/cc_0.png"},"day":"16","year":"2018","oa_version":"Submitted Version","publisher":"Institute of Science and Technology Austria","month":"01","author":[{"full_name":"Villányi, Márton","orcid":"0000-0001-8126-0426","id":"3FFCCD3A-F248-11E8-B48F-1D18A9856A87","first_name":"Márton","last_name":"Villányi"}],"title":"RSC Austrian Publications 2013-2017","ddc":["020"]},{"title":"Weakly-Supervised Segmentation and Unsupervised Modeling of Natural Images","ddc":["004"],"acknowledgement":"I also gratefully acknowledge the support of NVIDIA Corporation with the donation of the GPUs used for this research.","day":"25","publication_status":"published","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","pubrep_id":"1021","doi":"10.15479/AT:ISTA:th_1021","file_date_updated":"2020-07-14T12:45:22Z","department":[{"_id":"ChLa"}],"OA_place":"publisher","ec_funded":1,"file":[{"file_size":12918758,"file_id":"5113","relation":"main_file","creator":"system","checksum":"bc678e02468d8ebc39dc7267dfb0a1c4","content_type":"application/pdf","file_name":"IST-2018-1021-v1+1_thesis-unsigned-pdfa.pdf","date_updated":"2020-07-14T12:45:22Z","date_created":"2018-12-12T10:14:57Z","access_level":"open_access"},{"file_size":55973760,"relation":"source_file","file_id":"6225","creator":"dernst","access_level":"closed","file_name":"2018_Thesis_Kolesnikov_source.zip","date_created":"2019-04-05T09:34:49Z","date_updated":"2020-07-14T12:45:22Z","content_type":"application/zip","checksum":"bc66973b086da5a043f1162dcfb1fde4"}],"degree_awarded":"PhD","type":"dissertation","has_accepted_license":"1","corr_author":"1","abstract":[{"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.","lang":"eng"}],"author":[{"last_name":"Kolesnikov","first_name":"Alexander","id":"2D157DB6-F248-11E8-B48F-1D18A9856A87","full_name":"Kolesnikov, Alexander"}],"month":"05","oa_version":"Published Version","publisher":"Institute of Science and Technology Austria","year":"2018","citation":{"short":"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.","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.","ieee":"A. Kolesnikov, “Weakly-Supervised Segmentation and Unsupervised Modeling of Natural Images,” Institute of Science and Technology Austria, 2018.","ama":"Kolesnikov A. Weakly-Supervised Segmentation and Unsupervised Modeling of Natural Images. 2018. doi:10.15479/AT:ISTA:th_1021","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.","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"},"article_processing_charge":"No","date_published":"2018-05-25T00:00:00Z","_id":"197","date_updated":"2026-04-08T14:05:16Z","date_created":"2018-12-11T11:45:09Z","publist_id":"7718","oa":1,"supervisor":[{"last_name":"Lampert","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph"}],"alternative_title":["ISTA Thesis"],"project":[{"call_identifier":"FP7","_id":"2532554C-B435-11E9-9278-68D0E5697425","grant_number":"308036","name":"Lifelong Learning of Visual Scene Understanding"}],"page":"113","publication_identifier":{"issn":["2663-337X"]},"status":"public","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"status":"public","publication_identifier":{"issn":["2663-337X"]},"alternative_title":["ISTA Thesis"],"page":"77","oa":1,"publist_id":"8005","date_created":"2018-12-11T11:44:21Z","date_updated":"2026-04-08T14:02:40Z","supervisor":[{"full_name":"Katsaros, Georgios","orcid":"0000-0001-8342-202X","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","first_name":"Georgios","last_name":"Katsaros"}],"article_processing_charge":"No","citation":{"short":"H. Watzinger, Ge Hut Wires - from Growth to Hole Spin Resonance, Institute of Science and Technology Austria, 2018.","ista":"Watzinger H. 2018. Ge hut wires - from growth to hole spin resonance. Institute of Science and Technology Austria.","ieee":"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.","ama":"Watzinger H. Ge hut wires - from growth to hole spin resonance. 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.","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"},"_id":"49","date_published":"2018-07-30T00:00:00Z","year":"2018","author":[{"full_name":"Watzinger, Hannes","last_name":"Watzinger","first_name":"Hannes","id":"35DF8E50-F248-11E8-B48F-1D18A9856A87"}],"publisher":"Institute of Science and Technology Austria","month":"07","oa_version":"Published Version","abstract":[{"lang":"eng","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."}],"has_accepted_license":"1","corr_author":"1","type":"dissertation","degree_awarded":"PhD","department":[{"_id":"GeKa"}],"OA_place":"publisher","file":[{"relation":"main_file","file_id":"6249","file_size":85539748,"access_level":"open_access","content_type":"application/pdf","checksum":"b653b5216251f938ddbeafd1de88667c","date_updated":"2020-07-14T12:46:35Z","file_name":"2018_Thesis_Watzinger.pdf","date_created":"2019-04-09T07:13:28Z","creator":"dernst"},{"access_level":"closed","content_type":"application/zip","date_updated":"2020-07-14T12:46:35Z","file_name":"2018_Thesis_Watzinger_source.zip","checksum":"39bcf8de7ac5b1bb516b11ce2f966785","date_created":"2019-04-09T07:13:27Z","creator":"dernst","relation":"source_file","file_id":"6250","file_size":21830697}],"doi":"10.15479/AT:ISTA:th_1033","pubrep_id":"1033","file_date_updated":"2020-07-14T12:46:35Z","day":"30","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"publication_status":"published","title":"Ge hut wires - from growth to hole spin resonance","ddc":["530"]},{"corr_author":"1","has_accepted_license":"1","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."}],"degree_awarded":"PhD","type":"dissertation","pubrep_id":"1026","doi":"10.15479/AT:ISTA:th_1026","file_date_updated":"2020-07-14T12:45:24Z","OA_place":"publisher","department":[{"_id":"HeEd"}],"file":[{"file_id":"5918","relation":"source_file","file_size":11827713,"date_created":"2019-02-05T07:43:31Z","date_updated":"2020-07-14T12:45:24Z","file_name":"IST-2018-1025-v2+5_ist-thesis-iglesias-11June2018(1).zip","checksum":"dd699303623e96d1478a6ae07210dd05","content_type":"application/zip","access_level":"closed","creator":"kschuh"},{"file_size":4783846,"relation":"main_file","file_id":"5919","creator":"kschuh","access_level":"open_access","date_created":"2019-02-05T07:43:45Z","date_updated":"2020-07-14T12:45:24Z","file_name":"IST-2018-1025-v2+4_ThesisIglesiasFinal11June2018.pdf","content_type":"application/pdf","checksum":"ba163849a190d2b41d66fef0e4983294"}],"title":"Multiple covers with balls","ddc":["514","516"],"day":"11","publication_status":"published","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","status":"public","publication_identifier":{"issn":["2663-337X"]},"language":[{"iso":"eng"}],"alternative_title":["ISTA Thesis"],"page":"171","article_processing_charge":"No","citation":{"ieee":"M. Iglesias Ham, “Multiple covers with balls,” Institute of Science and Technology Austria, 2018.","mla":"Iglesias Ham, Mabel. Multiple Covers with Balls. Institute of Science and Technology Austria, 2018, doi: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.","apa":"Iglesias Ham, M. (2018). Multiple covers with balls. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_1026","short":"M. Iglesias Ham, Multiple Covers with Balls, Institute of Science and Technology Austria, 2018.","ista":"Iglesias Ham M. 2018. Multiple covers with balls. Institute of Science and Technology Austria."},"date_published":"2018-06-11T00:00:00Z","_id":"201","publist_id":"7712","date_updated":"2026-04-08T14:04:03Z","date_created":"2018-12-11T11:45:10Z","oa":1,"supervisor":[{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"}],"author":[{"first_name":"Mabel","id":"41B58C0C-F248-11E8-B48F-1D18A9856A87","last_name":"Iglesias Ham","full_name":"Iglesias Ham, Mabel"}],"oa_version":"Published Version","publisher":"Institute of Science and Technology Austria","month":"06","year":"2018"},{"supervisor":[{"last_name":"Kromp","first_name":"Brigitte","full_name":"Kromp, Brigitte"}],"publist_id":"7624","department":[{"_id":"E-Lib"}],"date_created":"2018-12-11T11:45:34Z","OA_place":"publisher","date_updated":"2026-04-08T14:02:28Z","oa":1,"date_published":"2018-04-06T00:00:00Z","_id":"278","citation":{"chicago":"Villányi, Márton. “Lizenzverträge mit Open-Access-Komponenten an österreichischen Bibliotheken.” Universität Wien, 2018.","apa":"Villányi, M. (2018). Lizenzverträge mit Open-Access-Komponenten an österreichischen Bibliotheken. Universität Wien.","mla":"Villányi, Márton. Lizenzverträge mit Open-Access-Komponenten an österreichischen Bibliotheken. Universität Wien, 2018.","ieee":"M. Villányi, “Lizenzverträge mit Open-Access-Komponenten an österreichischen Bibliotheken,” Universität Wien, 2018.","ama":"Villányi M. Lizenzverträge mit Open-Access-Komponenten an österreichischen Bibliotheken. 2018.","ista":"Villányi M. 2018. Lizenzverträge mit Open-Access-Komponenten an österreichischen Bibliotheken. Universität Wien.","short":"M. Villányi, Lizenzverträge mit Open-Access-Komponenten an österreichischen Bibliotheken, Universität Wien, 2018."},"article_processing_charge":"No","publication_status":"published","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","year":"2018","day":"06","oa_version":"Published Version","publisher":"Universität Wien","month":"04","author":[{"full_name":"Villányi, Márton","orcid":"0000-0001-8126-0426","id":"3FFCCD3A-F248-11E8-B48F-1D18A9856A87","first_name":"Márton","last_name":"Villányi"}],"title":"Lizenzverträge mit Open-Access-Komponenten an österreichischen Bibliotheken","status":"public","main_file_link":[{"url":"http://othes.univie.ac.at/51113/","open_access":"1"}],"language":[{"iso":"ger"}],"abstract":[{"text":"Consortial subscription contracts regulate the digital access to publications between publishers and scientific libraries. However, since a couple of years the tendency towards a freely accessible publishing (Open Access) intensifies. As a consequence of this trend the contractual relationship between licensor and licensee is gradually changing as well: More and more contracts exercise influence on open access publishing. The present study attempts to compare Austrian examples of consortial licence contracts, which include components of open access. It describes the difference between pure subscription contracts and differing innovative deals including open access components. Thereby it becomes obvious that for the evaluation of this licence contracts new methods are needed. An essential new element of such analyses is the evaluation of the open access publication numbers. So this study tries to carry out such publication analyses for Austrian open access deals focusing on quantitative questions: How does the number of publications evolve? How does the open access share change? Publications reports of the publishers and database queries from Scopus form the data basis. The analysis of the data points out that differing approaches of contracts result in highly divergent results: Particular deals can prioritize a saving in costs or else the increase of the open access rate. It is to be assumed that within the following years further numerous open access deals will be negotiated. The finding of this study shall provide guidance.","lang":"eng"}],"page":"94","related_material":{"record":[{"relation":"dissertation_contains","id":"5577","status":"public"},{"id":"5574","relation":"dissertation_contains","status":"public"},{"status":"public","id":"5578","relation":"dissertation_contains"},{"id":"5579","relation":"dissertation_contains","status":"public"},{"status":"public","relation":"dissertation_contains","id":"5576"},{"status":"public","relation":"dissertation_contains","id":"5575"},{"relation":"dissertation_contains","id":"5582","status":"public"},{"status":"public","id":"5581","relation":"dissertation_contains"},{"relation":"dissertation_contains","id":"5580","status":"public"}]},"type":"dissertation"}]