[{"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"},"language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"E-Lib"},{"_id":"CampIT"}],"degree_awarded":"PhD","supervisor":[{"last_name":"Wagner","first_name":"Uli","orcid":"0000-0002-1494-0568","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","full_name":"Wagner, Uli"},{"first_name":"Jonathan","last_name":"Spreer","full_name":"Spreer, Jonathan"}],"doi":"10.15479/AT:ISTA:8032","publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-006-0"]},"month":"06","publisher":"Institute of Science and Technology Austria","department":[{"_id":"UlWa"}],"publication_status":"published","year":"2020","date_created":"2020-06-26T10:00:36Z","date_updated":"2023-09-07T13:18:27Z","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"6556"},{"relation":"dissertation_contains","status":"public","id":"7093"}]},"author":[{"full_name":"Huszár, Kristóf","first_name":"Kristóf","last_name":"Huszár","id":"33C26278-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5445-5057"}],"file_date_updated":"2020-07-14T12:48:08Z","page":"xviii+120","citation":{"ista":"Huszár K. 2020. Combinatorial width parameters for 3-dimensional manifolds. Institute of Science and Technology Austria.","ieee":"K. Huszár, “Combinatorial width parameters for 3-dimensional manifolds,” Institute of Science and Technology Austria, 2020.","apa":"Huszár, K. (2020). Combinatorial width parameters for 3-dimensional manifolds. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8032","ama":"Huszár K. Combinatorial width parameters for 3-dimensional manifolds. 2020. doi:10.15479/AT:ISTA:8032","chicago":"Huszár, Kristóf. “Combinatorial Width Parameters for 3-Dimensional Manifolds.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8032.","mla":"Huszár, Kristóf. Combinatorial Width Parameters for 3-Dimensional Manifolds. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8032.","short":"K. Huszár, Combinatorial Width Parameters for 3-Dimensional Manifolds, Institute of Science and Technology Austria, 2020."},"date_published":"2020-06-26T00:00:00Z","article_processing_charge":"No","has_accepted_license":"1","day":"26","title":"Combinatorial width parameters for 3-dimensional manifolds","ddc":["514"],"status":"public","_id":"8032","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","file":[{"creator":"khuszar","content_type":"application/pdf","file_size":2637562,"file_name":"Kristof_Huszar-Thesis.pdf","access_level":"open_access","date_created":"2020-06-26T10:03:58Z","date_updated":"2020-07-14T12:48:08Z","checksum":"bd8be6e4f1addc863dfcc0fad29ee9c3","file_id":"8034","relation":"main_file"},{"date_updated":"2020-07-14T12:48:08Z","date_created":"2020-06-26T10:10:06Z","checksum":"d5f8456202b32f4a77552ef47a2837d1","relation":"source_file","file_id":"8035","file_size":7163491,"content_type":"application/x-zip-compressed","creator":"khuszar","file_name":"Kristof_Huszar-Thesis-source.zip","access_level":"closed"}],"oa_version":"Published Version","alternative_title":["ISTA Thesis"],"type":"dissertation","abstract":[{"lang":"eng","text":"Algorithms in computational 3-manifold topology typically take a triangulation as an input and return topological information about the underlying 3-manifold. However, extracting the desired information from a triangulation (e.g., evaluating an invariant) is often computationally very expensive. In recent years this complexity barrier has been successfully tackled in some cases by importing ideas from the theory of parameterized algorithms into the realm of 3-manifolds. Various computationally hard problems were shown to be efficiently solvable for input triangulations that are sufficiently “tree-like.”\r\nIn this thesis we focus on the key combinatorial parameter in the above context: we consider the treewidth of a compact, orientable 3-manifold, i.e., the smallest treewidth of the dual graph of any triangulation thereof. By building on the work of Scharlemann–Thompson and Scharlemann–Schultens–Saito on generalized Heegaard splittings, and on the work of Jaco–Rubinstein on layered triangulations, we establish quantitative relations between the treewidth and classical topological invariants of a 3-manifold. In particular, among other results, we show that the treewidth of a closed, orientable, irreducible, non-Haken 3-manifold is always within a constant factor of its Heegaard genus."}]},{"ddc":["000"],"status":"public","title":"Refinement for structured concurrent programs","intvolume":" 12224","_id":"8195","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Published Version","file":[{"date_created":"2020-08-06T08:14:54Z","date_updated":"2020-08-06T08:14:54Z","success":1,"relation":"main_file","file_id":"8201","file_size":804237,"content_type":"application/pdf","creator":"dernst","file_name":"2020_LNCS_Kragl.pdf","access_level":"open_access"}],"alternative_title":["LNCS"],"type":"conference","abstract":[{"lang":"eng","text":"This paper presents a foundation for refining concurrent programs with structured control flow. The verification problem is decomposed into subproblems that aid interactive program development, proof reuse, and automation. The formalization in this paper is the basis of a new design and implementation of the Civl verifier."}],"page":"275-298","publication":"Computer Aided Verification","citation":{"apa":"Kragl, B., Qadeer, S., & Henzinger, T. A. (2020). Refinement for structured concurrent programs. In Computer Aided Verification (Vol. 12224, pp. 275–298). Springer Nature. https://doi.org/10.1007/978-3-030-53288-8_14","ieee":"B. Kragl, S. Qadeer, and T. A. Henzinger, “Refinement for structured concurrent programs,” in Computer Aided Verification, 2020, vol. 12224, pp. 275–298.","ista":"Kragl B, Qadeer S, Henzinger TA. 2020. Refinement for structured concurrent programs. Computer Aided Verification. , LNCS, vol. 12224, 275–298.","ama":"Kragl B, Qadeer S, Henzinger TA. Refinement for structured concurrent programs. In: Computer Aided Verification. Vol 12224. Springer Nature; 2020:275-298. doi:10.1007/978-3-030-53288-8_14","chicago":"Kragl, Bernhard, Shaz Qadeer, and Thomas A Henzinger. “Refinement for Structured Concurrent Programs.” In Computer Aided Verification, 12224:275–98. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-53288-8_14.","short":"B. Kragl, S. Qadeer, T.A. Henzinger, in:, Computer Aided Verification, Springer Nature, 2020, pp. 275–298.","mla":"Kragl, Bernhard, et al. “Refinement for Structured Concurrent Programs.” Computer Aided Verification, vol. 12224, Springer Nature, 2020, pp. 275–98, doi:10.1007/978-3-030-53288-8_14."},"date_published":"2020-07-14T00:00:00Z","scopus_import":"1","day":"14","article_processing_charge":"No","has_accepted_license":"1","publication_status":"published","department":[{"_id":"ToHe"}],"publisher":"Springer Nature","acknowledgement":"Bernhard Kragl and Thomas A. Henzinger were supported by\r\nthe Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","year":"2020","date_created":"2020-08-03T11:45:35Z","date_updated":"2023-09-07T13:18:00Z","volume":12224,"author":[{"last_name":"Kragl","first_name":"Bernhard","orcid":"0000-0001-7745-9117","id":"320FC952-F248-11E8-B48F-1D18A9856A87","full_name":"Kragl, Bernhard"},{"last_name":"Qadeer","first_name":"Shaz","full_name":"Qadeer, Shaz"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"id":"8332","status":"public","relation":"dissertation_contains"}]},"file_date_updated":"2020-08-06T08:14:54Z","quality_controlled":"1","isi":1,"project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF"}],"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":["000695276000014"]},"language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-53288-8_14","month":"07","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783030532871"],"issn":["0302-9743"],"eisbn":["9783030532888"]}},{"year":"2020","department":[{"_id":"ToHe"}],"publisher":"Association for Computing Machinery","publication_status":"published","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"8332"}]},"author":[{"full_name":"Kragl, Bernhard","id":"320FC952-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7745-9117","first_name":"Bernhard","last_name":"Kragl"},{"last_name":"Enea","first_name":"Constantin","full_name":"Enea, Constantin"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Mutluergil, Suha Orhun","first_name":"Suha Orhun","last_name":"Mutluergil"},{"full_name":"Qadeer, Shaz","first_name":"Shaz","last_name":"Qadeer"}],"date_created":"2020-06-25T11:40:16Z","date_updated":"2023-09-07T13:18:00Z","oa":1,"external_id":{"isi":["000614622300016"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1145/3385412.3385980"}],"project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF"}],"isi":1,"quality_controlled":"1","doi":"10.1145/3385412.3385980","conference":{"name":"PLDI: Programming Language Design and Implementation","end_date":"2020-06-20","location":"London, United Kingdom","start_date":"2020-06-15"},"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9781450376136"]},"month":"06","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"8012","title":"Inductive sequentialization of asynchronous programs","status":"public","oa_version":"Published Version","type":"conference","abstract":[{"text":"Asynchronous programs are notoriously difficult to reason about because they spawn computation tasks which take effect asynchronously in a nondeterministic way. Devising inductive invariants for such programs requires understanding and stating complex relationships between an unbounded number of computation tasks in arbitrarily long executions. In this paper, we introduce inductive sequentialization, a new proof rule that sidesteps this complexity via a sequential reduction, a sequential program that captures every behavior of the original program up to reordering of coarse-grained commutative actions. A sequential reduction of a concurrent program is easy to reason about since it corresponds to a simple execution of the program in an idealized synchronous environment, where processes act in a fixed order and at the same speed. We have implemented and integrated our proof rule in the CIVL verifier, allowing us to provably derive fine-grained implementations of asynchronous programs. We have successfully applied our proof rule to a diverse set of message-passing protocols, including leader election protocols, two-phase commit, and Paxos.","lang":"eng"}],"citation":{"chicago":"Kragl, Bernhard, Constantin Enea, Thomas A Henzinger, Suha Orhun Mutluergil, and Shaz Qadeer. “Inductive Sequentialization of Asynchronous Programs.” In Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, 227–42. Association for Computing Machinery, 2020. https://doi.org/10.1145/3385412.3385980.","mla":"Kragl, Bernhard, et al. “Inductive Sequentialization of Asynchronous Programs.” Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2020, pp. 227–42, doi:10.1145/3385412.3385980.","short":"B. Kragl, C. Enea, T.A. Henzinger, S.O. Mutluergil, S. Qadeer, in:, Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2020, pp. 227–242.","ista":"Kragl B, Enea C, Henzinger TA, Mutluergil SO, Qadeer S. 2020. Inductive sequentialization of asynchronous programs. Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI: Programming Language Design and Implementation, 227–242.","apa":"Kragl, B., Enea, C., Henzinger, T. A., Mutluergil, S. O., & Qadeer, S. (2020). Inductive sequentialization of asynchronous programs. In Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation (pp. 227–242). London, United Kingdom: Association for Computing Machinery. https://doi.org/10.1145/3385412.3385980","ieee":"B. Kragl, C. Enea, T. A. Henzinger, S. O. Mutluergil, and S. Qadeer, “Inductive sequentialization of asynchronous programs,” in Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, London, United Kingdom, 2020, pp. 227–242.","ama":"Kragl B, Enea C, Henzinger TA, Mutluergil SO, Qadeer S. Inductive sequentialization of asynchronous programs. In: Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation. Association for Computing Machinery; 2020:227-242. doi:10.1145/3385412.3385980"},"publication":"Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation","page":"227-242","date_published":"2020-06-01T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"01"},{"abstract":[{"lang":"eng","text":"During bacterial cell division, the tubulin-homolog FtsZ forms a ring-like structure at the center of the cell. This so-called Z-ring acts as a scaffold recruiting several division-related proteins to mid-cell and plays a key role in distributing proteins at the division site, a feature driven by the treadmilling motion of FtsZ filaments around the septum. What regulates the architecture, dynamics and stability of the Z-ring is still poorly understood, but FtsZ-associated proteins (Zaps) are known to play an important role. \r\nAdvances in fluorescence microscopy and in vitro reconstitution experiments have helped to shed light into some of the dynamic properties of these complex systems, but methods that allow to collect and analyze large quantitative data sets of the underlying polymer dynamics are still missing.\r\nHere, using an in vitro reconstitution approach, we studied how different Zaps affect FtsZ filament dynamics and organization into large-scale patterns, giving special emphasis to the role of the well-conserved protein ZapA. For this purpose, we use high-resolution fluorescence microscopy combined with novel image analysis workfows to study pattern organization and polymerization dynamics of active filaments. We quantified the influence of Zaps on FtsZ on three diferent spatial scales: the large-scale organization of the membrane-bound filament network, the underlying\r\npolymerization dynamics and the behavior of single molecules.\r\nWe found that ZapA cooperatively increases the spatial order of the filament network, binds only transiently to FtsZ filaments and has no effect on filament length and treadmilling velocity. Our data provides a model for how FtsZ-associated proteins can increase the precision and stability of the bacterial cell division machinery in a\r\nswitch-like manner, without compromising filament dynamics. Furthermore, we believe that our automated quantitative methods can be used to analyze a large variety of dynamic cytoskeletal systems, using standard time-lapse\r\nmovies of homogeneously labeled proteins obtained from experiments in vitro or even inside the living cell.\r\n"}],"type":"dissertation","alternative_title":["ISTA Thesis"],"file":[{"file_id":"8364","relation":"main_file","success":1,"checksum":"882f93fe9c351962120e2669b84bf088","date_created":"2020-09-10T12:11:29Z","date_updated":"2020-09-10T12:11:29Z","access_level":"open_access","file_name":"phd_thesis_pcaldas.pdf","creator":"pcaldas","file_size":141602462,"content_type":"application/pdf"},{"date_updated":"2020-09-11T07:48:10Z","date_created":"2020-09-10T12:18:17Z","checksum":"70cc9e399c4e41e6e6ac445ae55e8558","relation":"source_file","file_id":"8365","file_size":450437458,"content_type":"application/x-zip-compressed","creator":"pcaldas","file_name":"phd_thesis_latex_pcaldas.zip","access_level":"closed"}],"oa_version":"Published Version","_id":"8358","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"Organization and dynamics of treadmilling filaments in cytoskeletal networks of FtsZ and its crosslinkers","ddc":["572"],"status":"public","day":"10","has_accepted_license":"1","article_processing_charge":"No","date_published":"2020-09-10T00:00:00Z","citation":{"apa":"Dos Santos Caldas, P. R. (2020). Organization and dynamics of treadmilling filaments in cytoskeletal networks of FtsZ and its crosslinkers. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8358","ieee":"P. R. Dos Santos Caldas, “Organization and dynamics of treadmilling filaments in cytoskeletal networks of FtsZ and its crosslinkers,” Institute of Science and Technology Austria, 2020.","ista":"Dos Santos Caldas PR. 2020. Organization and dynamics of treadmilling filaments in cytoskeletal networks of FtsZ and its crosslinkers. Institute of Science and Technology Austria.","ama":"Dos Santos Caldas PR. Organization and dynamics of treadmilling filaments in cytoskeletal networks of FtsZ and its crosslinkers. 2020. doi:10.15479/AT:ISTA:8358","chicago":"Dos Santos Caldas, Paulo R. “Organization and Dynamics of Treadmilling Filaments in Cytoskeletal Networks of FtsZ and Its Crosslinkers.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8358.","short":"P.R. Dos Santos Caldas, Organization and Dynamics of Treadmilling Filaments in Cytoskeletal Networks of FtsZ and Its Crosslinkers, Institute of Science and Technology Austria, 2020.","mla":"Dos Santos Caldas, Paulo R. Organization and Dynamics of Treadmilling Filaments in Cytoskeletal Networks of FtsZ and Its Crosslinkers. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8358."},"page":"135","file_date_updated":"2020-09-11T07:48:10Z","author":[{"full_name":"Dos Santos Caldas, Paulo R","orcid":"0000-0001-6730-4461","id":"38FCDB4C-F248-11E8-B48F-1D18A9856A87","last_name":"Dos Santos Caldas","first_name":"Paulo R"}],"related_material":{"record":[{"id":"7572","status":"public","relation":"dissertation_contains"},{"id":"7197","relation":"part_of_dissertation","status":"public"}]},"date_created":"2020-09-10T09:26:49Z","date_updated":"2023-09-07T13:18:51Z","year":"2020","acknowledgement":"I should also express my gratitude to the bioimaging facility at IST Austria, for their assistance with the TIRF setup over the years, and especially to Christoph Sommer, who gave me a lot of input when I was starting to dive into programming.","publication_status":"published","department":[{"_id":"MaLo"}],"publisher":"Institute of Science and Technology Austria","month":"09","publication_identifier":{"isbn":["978-3-99078-009-1"],"issn":["2663-337X"]},"doi":"10.15479/AT:ISTA:8358","supervisor":[{"full_name":"Loose, Martin","last_name":"Loose","first_name":"Martin","orcid":"0000-0001-7309-9724","id":"462D4284-F248-11E8-B48F-1D18A9856A87"}],"degree_awarded":"PhD","acknowledged_ssus":[{"_id":"Bio"}],"language":[{"iso":"eng"}],"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"}},{"day":"26","has_accepted_license":"1","article_processing_charge":"No","scopus_import":"1","date_published":"2020-08-26T00:00:00Z","publication":"28th Annual European Symposium on Algorithms","citation":{"ieee":"G. F. Osang, M. Rouxel-Labbé, and M. Teillaud, “Generalizing CGAL periodic Delaunay triangulations,” in 28th Annual European Symposium on Algorithms, Virtual, Online; Pisa, Italy, 2020, vol. 173.","apa":"Osang, G. F., Rouxel-Labbé, M., & Teillaud, M. (2020). Generalizing CGAL periodic Delaunay triangulations. In 28th Annual European Symposium on Algorithms (Vol. 173). Virtual, Online; Pisa, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2020.75","ista":"Osang GF, Rouxel-Labbé M, Teillaud M. 2020. Generalizing CGAL periodic Delaunay triangulations. 28th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 173, 75.","ama":"Osang GF, Rouxel-Labbé M, Teillaud M. Generalizing CGAL periodic Delaunay triangulations. In: 28th Annual European Symposium on Algorithms. Vol 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.ESA.2020.75","chicago":"Osang, Georg F, Mael Rouxel-Labbé, and Monique Teillaud. “Generalizing CGAL Periodic Delaunay Triangulations.” In 28th Annual European Symposium on Algorithms, Vol. 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.ESA.2020.75.","short":"G.F. Osang, M. Rouxel-Labbé, M. Teillaud, in:, 28th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","mla":"Osang, Georg F., et al. “Generalizing CGAL Periodic Delaunay Triangulations.” 28th Annual European Symposium on Algorithms, vol. 173, 75, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.ESA.2020.75."},"abstract":[{"lang":"eng","text":"Even though Delaunay originally introduced his famous triangulations in the case of infinite point sets with translational periodicity, a software that computes such triangulations in the general case is not yet available, to the best of our knowledge. Combining and generalizing previous work, we present a practical algorithm for computing such triangulations. The algorithm has been implemented and experiments show that its performance is as good as the one of the CGAL package, which is restricted to cubic periodicity. "}],"type":"conference","alternative_title":["LIPIcs"],"oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"2020_LIPIcs_Osang.pdf","creator":"cziletti","file_size":733291,"content_type":"application/pdf","file_id":"8712","relation":"main_file","success":1,"checksum":"fe0f7c49a99ed870c671b911e10d5496","date_created":"2020-10-27T14:31:52Z","date_updated":"2020-10-27T14:31:52Z"}],"_id":"8703","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Generalizing CGAL periodic Delaunay triangulations","status":"public","ddc":["000"],"intvolume":" 173","month":"08","publication_identifier":{"isbn":["9783959771627"],"issn":["18688969"]},"conference":{"name":"ESA: Annual European Symposium on Algorithms","location":"Virtual, Online; Pisa, Italy","start_date":"2020-09-07","end_date":"2020-09-09"},"doi":"10.4230/LIPIcs.ESA.2020.75","language":[{"iso":"eng"}],"oa":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","short":"CC BY (3.0)","image":"/images/cc_by.png"},"quality_controlled":"1","project":[{"call_identifier":"H2020","name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","grant_number":"788183"}],"file_date_updated":"2020-10-27T14:31:52Z","ec_funded":1,"license":"https://creativecommons.org/licenses/by/3.0/","article_number":"75","author":[{"last_name":"Osang","first_name":"Georg F","orcid":"0000-0002-8882-5116","id":"464B40D6-F248-11E8-B48F-1D18A9856A87","full_name":"Osang, Georg F"},{"first_name":"Mael","last_name":"Rouxel-Labbé","full_name":"Rouxel-Labbé, Mael"},{"full_name":"Teillaud, Monique","last_name":"Teillaud","first_name":"Monique"}],"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"9056"}]},"date_created":"2020-10-25T23:01:18Z","date_updated":"2023-09-07T13:29:00Z","volume":173,"year":"2020","publication_status":"published","department":[{"_id":"HeEd"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik"},{"has_accepted_license":"1","article_processing_charge":"No","day":"26","month":"04","quality_controlled":"1","citation":{"mla":"Phuong, Mary, and Christoph Lampert. “Functional vs. Parametric Equivalence of ReLU Networks.” 8th International Conference on Learning Representations, 2020.","short":"M. Phuong, C. Lampert, in:, 8th International Conference on Learning Representations, 2020.","chicago":"Phuong, Mary, and Christoph Lampert. “Functional vs. Parametric Equivalence of ReLU Networks.” In 8th International Conference on Learning Representations, 2020.","ama":"Phuong M, Lampert C. Functional vs. parametric equivalence of ReLU networks. In: 8th International Conference on Learning Representations. ; 2020.","ista":"Phuong M, Lampert C. 2020. Functional vs. parametric equivalence of ReLU networks. 8th International Conference on Learning Representations. ICLR: International Conference on Learning Representations.","apa":"Phuong, M., & Lampert, C. (2020). Functional vs. parametric equivalence of ReLU networks. In 8th International Conference on Learning Representations. Online.","ieee":"M. Phuong and C. Lampert, “Functional vs. parametric equivalence of ReLU networks,” in 8th International Conference on Learning Representations, Online, 2020."},"oa":1,"publication":"8th International Conference on Learning Representations","language":[{"iso":"eng"}],"date_published":"2020-04-26T00:00:00Z","conference":{"name":"ICLR: International Conference on Learning Representations","end_date":"2020-04-30","location":"Online","start_date":"2020-04-27"},"type":"conference","abstract":[{"lang":"eng","text":"We address the following question: How redundant is the parameterisation of ReLU networks? Specifically, we consider transformations of the weight space which leave the function implemented by the network intact. Two such transformations are known for feed-forward architectures: permutation of neurons within a layer, and positive scaling of all incoming weights of a neuron coupled with inverse scaling of its outgoing weights. In this work, we show for architectures with non-increasing widths that permutation and scaling are in fact the only function-preserving weight transformations. For any eligible architecture we give an explicit construction of a neural network such that any other network that implements the same function can be obtained from the original one by the application of permutations and rescaling. The proof relies on a geometric understanding of boundaries between linear regions of ReLU networks, and we hope the developed mathematical tools are of independent interest."}],"file_date_updated":"2020-07-14T12:47:59Z","department":[{"_id":"ChLa"}],"status":"public","ddc":["000"],"title":"Functional vs. parametric equivalence of ReLU networks","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7481","year":"2020","oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"main.pdf","file_size":405469,"content_type":"application/pdf","creator":"bphuong","relation":"main_file","file_id":"7482","checksum":"8d372ea5defd8cb8fdc430111ed754a9","date_updated":"2020-07-14T12:47:59Z","date_created":"2020-02-11T09:07:27Z"}],"date_created":"2020-02-11T09:07:37Z","date_updated":"2023-09-07T13:29:50Z","related_material":{"link":[{"relation":"supplementary_material","url":"https://iclr.cc/virtual_2020/poster_Bylx-TNKvH.html"}],"record":[{"id":"9418","status":"public","relation":"dissertation_contains"}]},"author":[{"last_name":"Bui Thi Mai","first_name":"Phuong","id":"3EC6EE64-F248-11E8-B48F-1D18A9856A87","full_name":"Bui Thi Mai, Phuong"},{"first_name":"Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph"}]},{"article_processing_charge":"No","has_accepted_license":"1","day":"12","keyword":["Applied Mathematics","Computational Mathematics","Analysis"],"scopus_import":"1","date_published":"2020-02-12T00:00:00Z","page":"605-622","article_type":"original","citation":{"mla":"Feliciangeli, Dario, and Robert Seiringer. “Uniqueness and Nondegeneracy of Minimizers of the Pekar Functional on a Ball.” SIAM Journal on Mathematical Analysis, vol. 52, no. 1, Society for Industrial & Applied Mathematics , 2020, pp. 605–22, doi:10.1137/19m126284x.","short":"D. Feliciangeli, R. Seiringer, SIAM Journal on Mathematical Analysis 52 (2020) 605–622.","chicago":"Feliciangeli, Dario, and Robert Seiringer. “Uniqueness and Nondegeneracy of Minimizers of the Pekar Functional on a Ball.” SIAM Journal on Mathematical Analysis. Society for Industrial & Applied Mathematics , 2020. https://doi.org/10.1137/19m126284x.","ama":"Feliciangeli D, Seiringer R. Uniqueness and nondegeneracy of minimizers of the Pekar functional on a ball. SIAM Journal on Mathematical Analysis. 2020;52(1):605-622. doi:10.1137/19m126284x","ista":"Feliciangeli D, Seiringer R. 2020. Uniqueness and nondegeneracy of minimizers of the Pekar functional on a ball. SIAM Journal on Mathematical Analysis. 52(1), 605–622.","ieee":"D. Feliciangeli and R. Seiringer, “Uniqueness and nondegeneracy of minimizers of the Pekar functional on a ball,” SIAM Journal on Mathematical Analysis, vol. 52, no. 1. Society for Industrial & Applied Mathematics , pp. 605–622, 2020.","apa":"Feliciangeli, D., & Seiringer, R. (2020). Uniqueness and nondegeneracy of minimizers of the Pekar functional on a ball. SIAM Journal on Mathematical Analysis. Society for Industrial & Applied Mathematics . https://doi.org/10.1137/19m126284x"},"publication":"SIAM Journal on Mathematical Analysis","issue":"1","abstract":[{"text":"We consider the Pekar functional on a ball in ℝ3. We prove uniqueness of minimizers, and a quadratic lower bound in terms of the distance to the minimizer. The latter follows from nondegeneracy of the Hessian at the minimum.","lang":"eng"}],"type":"journal_article","oa_version":"Preprint","intvolume":" 52","ddc":["510"],"title":"Uniqueness and nondegeneracy of minimizers of the Pekar functional on a ball","status":"public","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"9781","publication_identifier":{"issn":["0036-1410"],"eissn":["1095-7154"]},"month":"02","language":[{"iso":"eng"}],"doi":"10.1137/19m126284x","project":[{"grant_number":"694227","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Analysis of quantum many-body systems"}],"quality_controlled":"1","isi":1,"oa":1,"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1904.08647"}],"external_id":{"arxiv":["1904.08647 "],"isi":["000546967700022"]},"ec_funded":1,"volume":52,"date_updated":"2023-09-07T13:30:11Z","date_created":"2021-08-06T07:34:16Z","related_material":{"record":[{"id":"9733","relation":"dissertation_contains","status":"public"}]},"author":[{"last_name":"Feliciangeli","first_name":"Dario","orcid":"0000-0003-0754-8530","id":"41A639AA-F248-11E8-B48F-1D18A9856A87","full_name":"Feliciangeli, Dario"},{"full_name":"Seiringer, Robert","first_name":"Robert","last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521"}],"publisher":"Society for Industrial & Applied Mathematics ","department":[{"_id":"RoSe"}],"publication_status":"published","year":"2020","acknowledgement":"We are grateful for the hospitality at the Mittag-Leffler Institute, where part of this work has been done. The work of the authors was supported by the European Research Council (ERC)under the European Union's Horizon 2020 research and innovation programme grant 694227."},{"publication_identifier":{"eissn":["14320673"],"issn":["00039527"]},"month":"05","external_id":{"isi":["000511060200001"]},"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,"project":[{"call_identifier":"H2020","name":"International IST Doctoral Program","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"},{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"quality_controlled":"1","isi":1,"doi":"10.1007/s00205-019-01486-2","language":[{"iso":"eng"}],"ec_funded":1,"file_date_updated":"2020-11-20T09:14:22Z","year":"2020","publisher":"Springer Nature","department":[{"_id":"JuFi"}],"publication_status":"published","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"10007"}]},"author":[{"id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0479-558X","first_name":"Julian L","last_name":"Fischer","full_name":"Fischer, Julian L"},{"orcid":"0000-0001-7252-8072","id":"4D23B7DA-F248-11E8-B48F-1D18A9856A87","last_name":"Hensel","first_name":"Sebastian","full_name":"Hensel, Sebastian"}],"volume":236,"date_updated":"2023-09-07T13:30:45Z","date_created":"2020-02-16T23:00:50Z","scopus_import":"1","has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","day":"01","citation":{"ama":"Fischer JL, Hensel S. Weak–strong uniqueness for the Navier–Stokes equation for two fluids with surface tension. Archive for Rational Mechanics and Analysis. 2020;236:967-1087. doi:10.1007/s00205-019-01486-2","ista":"Fischer JL, Hensel S. 2020. Weak–strong uniqueness for the Navier–Stokes equation for two fluids with surface tension. Archive for Rational Mechanics and Analysis. 236, 967–1087.","ieee":"J. L. Fischer and S. Hensel, “Weak–strong uniqueness for the Navier–Stokes equation for two fluids with surface tension,” Archive for Rational Mechanics and Analysis, vol. 236. Springer Nature, pp. 967–1087, 2020.","apa":"Fischer, J. L., & Hensel, S. (2020). Weak–strong uniqueness for the Navier–Stokes equation for two fluids with surface tension. Archive for Rational Mechanics and Analysis. Springer Nature. https://doi.org/10.1007/s00205-019-01486-2","mla":"Fischer, Julian L., and Sebastian Hensel. “Weak–Strong Uniqueness for the Navier–Stokes Equation for Two Fluids with Surface Tension.” Archive for Rational Mechanics and Analysis, vol. 236, Springer Nature, 2020, pp. 967–1087, doi:10.1007/s00205-019-01486-2.","short":"J.L. Fischer, S. Hensel, Archive for Rational Mechanics and Analysis 236 (2020) 967–1087.","chicago":"Fischer, Julian L, and Sebastian Hensel. “Weak–Strong Uniqueness for the Navier–Stokes Equation for Two Fluids with Surface Tension.” Archive for Rational Mechanics and Analysis. Springer Nature, 2020. https://doi.org/10.1007/s00205-019-01486-2."},"publication":"Archive for Rational Mechanics and Analysis","page":"967-1087","article_type":"original","date_published":"2020-05-01T00:00:00Z","type":"journal_article","abstract":[{"text":"In the present work, we consider the evolution of two fluids separated by a sharp interface in the presence of surface tension—like, for example, the evolution of oil bubbles in water. Our main result is a weak–strong uniqueness principle for the corresponding free boundary problem for the incompressible Navier–Stokes equation: as long as a strong solution exists, any varifold solution must coincide with it. In particular, in the absence of physical singularities, the concept of varifold solutions—whose global in time existence has been shown by Abels (Interfaces Free Bound 9(1):31–65, 2007) for general initial data—does not introduce a mechanism for non-uniqueness. The key ingredient of our approach is the construction of a relative entropy functional capable of controlling the interface error. If the viscosities of the two fluids do not coincide, even for classical (strong) solutions the gradient of the velocity field becomes discontinuous at the interface, introducing the need for a careful additional adaption of the relative entropy.","lang":"eng"}],"_id":"7489","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","intvolume":" 236","ddc":["530","532"],"status":"public","title":"Weak–strong uniqueness for the Navier–Stokes equation for two fluids with surface tension","oa_version":"Published Version","file":[{"relation":"main_file","file_id":"8779","date_created":"2020-11-20T09:14:22Z","date_updated":"2020-11-20T09:14:22Z","checksum":"f107e21b58f5930876f47144be37cf6c","success":1,"file_name":"2020_ArchRatMechAn_Fischer.pdf","access_level":"open_access","file_size":1897571,"content_type":"application/pdf","creator":"dernst"}]},{"department":[{"_id":"JuFi"}],"status":"public","publication_status":"submitted","title":"The local structure of the energy landscape in multiphase mean curvature flow: weak-strong uniqueness and stability of evolutions","_id":"10012","year":"2020","acknowledgement":"Parts of the paper were written during the visit of the authors to the Hausdorff Research Institute for Mathematics (HIM), University of Bonn, in the framework of the trimester program “Evolution of Interfaces”. The support and the hospitality of HIM are gratefully acknowledged. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie Grant Agreement No. 665385.","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","oa_version":"Preprint","date_updated":"2023-09-07T13:30:45Z","date_created":"2021-09-13T12:17:11Z","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"10007"}]},"author":[{"first_name":"Julian L","last_name":"Fischer","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0479-558X","full_name":"Fischer, Julian L"},{"full_name":"Hensel, Sebastian","id":"4D23B7DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7252-8072","first_name":"Sebastian","last_name":"Hensel"},{"first_name":"Tim","last_name":"Laux","full_name":"Laux, Tim"},{"last_name":"Simon","first_name":"Thilo","full_name":"Simon, Thilo"}],"type":"preprint","article_number":"2003.05478","ec_funded":1,"abstract":[{"lang":"eng","text":"We prove that in the absence of topological changes, the notion of BV solutions to planar multiphase mean curvature flow does not allow for a mechanism for (unphysical) non-uniqueness. Our approach is based on the local structure of the energy landscape near a classical evolution by mean curvature. Mean curvature flow being the gradient flow of the surface energy functional, we develop a gradient-flow analogue of the notion of calibrations. Just like the existence of a calibration guarantees that one has reached a global minimum in the energy landscape, the existence of a \"gradient flow calibration\" ensures that the route of steepest descent in the energy landscape is unique and stable."}],"project":[{"name":"International IST Doctoral Program","call_identifier":"H2020","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"citation":{"mla":"Fischer, Julian L., et al. “The Local Structure of the Energy Landscape in Multiphase Mean Curvature Flow: Weak-Strong Uniqueness and Stability of Evolutions.” ArXiv, 2003.05478.","short":"J.L. Fischer, S. Hensel, T. Laux, T. Simon, ArXiv (n.d.).","chicago":"Fischer, Julian L, Sebastian Hensel, Tim Laux, and Thilo Simon. “The Local Structure of the Energy Landscape in Multiphase Mean Curvature Flow: Weak-Strong Uniqueness and Stability of Evolutions.” ArXiv, n.d.","ama":"Fischer JL, Hensel S, Laux T, Simon T. The local structure of the energy landscape in multiphase mean curvature flow: weak-strong uniqueness and stability of evolutions. arXiv.","ista":"Fischer JL, Hensel S, Laux T, Simon T. The local structure of the energy landscape in multiphase mean curvature flow: weak-strong uniqueness and stability of evolutions. arXiv, 2003.05478.","ieee":"J. L. Fischer, S. Hensel, T. Laux, and T. Simon, “The local structure of the energy landscape in multiphase mean curvature flow: weak-strong uniqueness and stability of evolutions,” arXiv. .","apa":"Fischer, J. L., Hensel, S., Laux, T., & Simon, T. (n.d.). The local structure of the energy landscape in multiphase mean curvature flow: weak-strong uniqueness and stability of evolutions. arXiv."},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2003.05478"}],"external_id":{"arxiv":["2003.05478"]},"oa":1,"publication":"arXiv","language":[{"iso":"eng"}],"date_published":"2020-03-11T00:00:00Z","article_processing_charge":"No","month":"03","day":"11"},{"project":[{"name":"Integrating superconducting quantum circuits","call_identifier":"FWF","_id":"26927A52-B435-11E9-9278-68D0E5697425","grant_number":"F07105"},{"name":"Hybrid Optomechanical Technologies","call_identifier":"H2020","grant_number":"732894","_id":"257EB838-B435-11E9-9278-68D0E5697425"},{"name":"Quantum readout techniques and technologies","call_identifier":"H2020","_id":"237CBA6C-32DE-11EA-91FC-C7463DDC885E","grant_number":"862644"},{"name":"A Fiber Optic Transceiver for Superconducting Qubits","call_identifier":"H2020","_id":"26336814-B435-11E9-9278-68D0E5697425","grant_number":"758053"}],"isi":1,"quality_controlled":"1","oa":1,"external_id":{"arxiv":["2007.01644"],"isi":["000582797300003"]},"language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"NanoFab"}],"doi":"10.1103/PhysRevApplied.14.044055","publication_identifier":{"eissn":["23317019"]},"month":"10","department":[{"_id":"JoFi"}],"publisher":"American Physical Society","publication_status":"published","acknowledgement":"The authors acknowledge the support from I. Prieto and the IST Nanofabrication Facility. This work was supported by IST Austria and a NOMIS foundation research grant and the Austrian Science Fund (FWF) through BeyondC (F71). MP is the recipient of a P¨ottinger scholarship at IST Austria. JMF acknowledges support from the European Union’s Horizon 2020 research and innovation programs under grant agreement No 732894 (FET Proactive HOT), 862644 (FET Open QUARTET), and the European Research Council under grant agreement\r\nnumber 758053 (ERC StG QUNNECT). ","year":"2020","volume":14,"date_updated":"2023-09-07T13:31:22Z","date_created":"2020-11-15T23:01:17Z","related_material":{"record":[{"id":"13070","relation":"research_data","status":"public"},{"relation":"dissertation_contains","status":"public","id":"9920"}]},"author":[{"full_name":"Peruzzo, Matilda","id":"3F920B30-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3415-4628","first_name":"Matilda","last_name":"Peruzzo"},{"full_name":"Trioni, Andrea","first_name":"Andrea","last_name":"Trioni","id":"42F71B44-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Hassani, Farid","first_name":"Farid","last_name":"Hassani","id":"2AED110C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6937-5773"},{"id":"2DCF8DE6-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","last_name":"Zemlicka","full_name":"Zemlicka, Martin"},{"full_name":"Fink, Johannes M","last_name":"Fink","first_name":"Johannes M","orcid":"0000-0001-8112-028X","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87"}],"article_number":"044055","ec_funded":1,"file_date_updated":"2021-03-29T11:43:20Z","article_type":"original","citation":{"ista":"Peruzzo M, Trioni A, Hassani F, Zemlicka M, Fink JM. 2020. Surpassing the resistance quantum with a geometric superinductor. Physical Review Applied. 14(4), 044055.","ieee":"M. Peruzzo, A. Trioni, F. Hassani, M. Zemlicka, and J. M. Fink, “Surpassing the resistance quantum with a geometric superinductor,” Physical Review Applied, vol. 14, no. 4. American Physical Society, 2020.","apa":"Peruzzo, M., Trioni, A., Hassani, F., Zemlicka, M., & Fink, J. M. (2020). Surpassing the resistance quantum with a geometric superinductor. Physical Review Applied. American Physical Society. https://doi.org/10.1103/PhysRevApplied.14.044055","ama":"Peruzzo M, Trioni A, Hassani F, Zemlicka M, Fink JM. Surpassing the resistance quantum with a geometric superinductor. Physical Review Applied. 2020;14(4). doi:10.1103/PhysRevApplied.14.044055","chicago":"Peruzzo, Matilda, Andrea Trioni, Farid Hassani, Martin Zemlicka, and Johannes M Fink. “Surpassing the Resistance Quantum with a Geometric Superinductor.” Physical Review Applied. American Physical Society, 2020. https://doi.org/10.1103/PhysRevApplied.14.044055.","mla":"Peruzzo, Matilda, et al. “Surpassing the Resistance Quantum with a Geometric Superinductor.” Physical Review Applied, vol. 14, no. 4, 044055, American Physical Society, 2020, doi:10.1103/PhysRevApplied.14.044055.","short":"M. Peruzzo, A. Trioni, F. Hassani, M. Zemlicka, J.M. Fink, Physical Review Applied 14 (2020)."},"publication":"Physical Review Applied","date_published":"2020-10-29T00:00:00Z","scopus_import":"1","article_processing_charge":"No","has_accepted_license":"1","day":"29","intvolume":" 14","ddc":["530"],"status":"public","title":"Surpassing the resistance quantum with a geometric superinductor","_id":"8755","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Published Version","file":[{"file_size":2607823,"content_type":"application/pdf","creator":"dernst","access_level":"open_access","file_name":"2020_PhysReviewApplied_Peruzzo.pdf","checksum":"2a634abe75251ae7628cd54c8a4ce2e8","success":1,"date_updated":"2021-03-29T11:43:20Z","date_created":"2021-03-29T11:43:20Z","relation":"main_file","file_id":"9300"}],"type":"journal_article","issue":"4","abstract":[{"text":"The superconducting circuit community has recently discovered the promising potential of superinductors. These circuit elements have a characteristic impedance exceeding the resistance quantum RQ ≈ 6.45 kΩ which leads to a suppression of ground state charge fluctuations. Applications include the realization of hardware protected qubits for fault tolerant quantum computing, improved coupling to small dipole moment objects and defining a new quantum metrology standard for the ampere. In this work we refute the widespread notion that superinductors can only be implemented based on kinetic inductance, i.e. using disordered superconductors or Josephson junction arrays. We present modeling, fabrication and characterization of 104 planar aluminum coil resonators with a characteristic impedance up to 30.9 kΩ at 5.6 GHz and a capacitance down to ≤ 1 fF, with lowloss and a power handling reaching 108 intra-cavity photons. Geometric superinductors are free of uncontrolled tunneling events and offer high reproducibility, linearity and the ability to couple magnetically - properties that significantly broaden the scope of future quantum circuits. ","lang":"eng"}]}]