[{"author":[{"last_name":"Kragl","full_name":"Kragl, Bernhard","orcid":"0000-0001-7745-9117","id":"320FC952-F248-11E8-B48F-1D18A9856A87","first_name":"Bernhard"}],"month":"09","department":[{"_id":"ToHe"}],"degree_awarded":"PhD","doi":"10.15479/AT:ISTA:8332","oa":1,"related_material":{"record":[{"status":"public","id":"8012","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"8195","status":"public"},{"status":"public","id":"133","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"160","status":"public"}]},"corr_author":"1","article_processing_charge":"No","publisher":"Institute of Science and Technology Austria","file":[{"checksum":"26fe261550f691280bda4c454bf015c7","file_name":"kragl-thesis.pdf","creator":"bkragl","date_updated":"2020-09-04T12:17:47Z","relation":"main_file","file_id":"8333","access_level":"open_access","content_type":"application/pdf","file_size":1348815,"date_created":"2020-09-04T12:17:47Z"},{"content_type":"application/zip","file_size":372312,"date_created":"2020-09-04T13:00:17Z","access_level":"closed","date_updated":"2020-09-04T13:00:17Z","file_id":"8335","relation":"source_file","creator":"bkragl","checksum":"b9694ce092b7c55557122adba8337ebc","file_name":"kragl-thesis.zip"}],"supervisor":[{"orcid":"0000-0002-2985-7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A"}],"publication_status":"published","alternative_title":["ISTA Thesis"],"date_created":"2020-09-04T12:24:12Z","title":"Verifying concurrent programs: Refinement, synchronization, sequentialization","oa_version":"Published Version","publication_identifier":{"issn":["2663-337X"]},"date_updated":"2026-04-08T07:23:53Z","file_date_updated":"2020-09-04T13:00:17Z","status":"public","page":"120","has_accepted_license":"1","citation":{"chicago":"Kragl, Bernhard. “Verifying Concurrent Programs: Refinement, Synchronization, Sequentialization.” Institute of Science and Technology Austria, 2020. <a href=\"https://doi.org/10.15479/AT:ISTA:8332\">https://doi.org/10.15479/AT:ISTA:8332</a>.","ama":"Kragl B. Verifying concurrent programs: Refinement, synchronization, sequentialization. 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8332\">10.15479/AT:ISTA:8332</a>","ista":"Kragl B. 2020. Verifying concurrent programs: Refinement, synchronization, sequentialization. Institute of Science and Technology Austria.","apa":"Kragl, B. (2020). <i>Verifying concurrent programs: Refinement, synchronization, sequentialization</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:8332\">https://doi.org/10.15479/AT:ISTA:8332</a>","mla":"Kragl, Bernhard. <i>Verifying Concurrent Programs: Refinement, Synchronization, Sequentialization</i>. Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8332\">10.15479/AT:ISTA:8332</a>.","short":"B. Kragl, Verifying Concurrent Programs: Refinement, Synchronization, Sequentialization, Institute of Science and Technology Austria, 2020.","ieee":"B. Kragl, “Verifying concurrent programs: Refinement, synchronization, sequentialization,” Institute of Science and Technology Austria, 2020."},"day":"03","abstract":[{"text":"Designing and verifying concurrent programs is a notoriously challenging, time consuming, and error prone task, even for experts. This is due to the sheer number of possible interleavings of a concurrent program, all of which have to be tracked and accounted for in a formal proof. Inventing an inductive invariant that captures all interleavings of a low-level implementation is theoretically possible, but practically intractable. We develop a refinement-based verification framework that provides mechanisms to simplify proof construction by decomposing the verification task into smaller subtasks.\r\n\r\nIn a first line of work, we present a foundation for refinement reasoning over structured concurrent programs. We introduce layered concurrent programs as a compact notation to represent multi-layer refinement proofs. 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. Each program in this sequence is expressed as structured concurrent program, i.e., a program over (potentially recursive) procedures, imperative control flow, gated atomic actions, structured parallelism, and asynchronous concurrency. This is in contrast to existing refinement-based verifiers, which represent concurrent systems as flat transition relations. We present a powerful refinement proof rule that decomposes refinement checking over structured programs into modular verification conditions. Refinement checking is supported by a new form of modular, parameterized invariants, called yield invariants, and a linear permission system to enhance local reasoning.\r\n\r\nIn a second line of work, we present two new reduction-based program transformations that target asynchronous programs. These transformations reduce the number of interleavings that need to be considered, thus reducing the complexity of invariants. Synchronization 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. Inductive sequentialization establishes sequential reductions 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.\r\n\r\nOur approach is implemented the CIVL verifier, which has been successfully used for the verification of several complex concurrent programs. In our methodology, the overall correctness of a program is established piecemeal by focusing on the invariant required for each refinement step separately. While the programmer does the creative work of specifying the chain of programs and the inductive invariant justifying each link in the chain, the tool automatically constructs the verification conditions underlying each refinement step.","lang":"eng"}],"_id":"8332","language":[{"iso":"eng"}],"type":"dissertation","date_published":"2020-09-03T00:00:00Z","OA_place":"publisher","year":"2020","ddc":["000"],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd"},{"scopus_import":"1","license":"https://creativecommons.org/licenses/by/4.0/","status":"public","isi":1,"acknowledged_ssus":[{"_id":"EM-Fac"},{"_id":"LifeSc"}],"date_updated":"2026-04-08T07:23:36Z","publication":"eLife","file_date_updated":"2020-08-24T13:31:53Z","date_published":"2020-07-31T00:00:00Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","ddc":["570"],"year":"2020","intvolume":"         9","article_number":"e59407","citation":{"short":"J. Steiner, L.A. Sazanov, ELife 9 (2020).","ieee":"J. Steiner and L. A. Sazanov, “Structure and mechanism of the Mrp complex, an ancient cation/proton antiporter,” <i>eLife</i>, vol. 9. eLife Sciences Publications, 2020.","mla":"Steiner, Julia, and Leonid A. Sazanov. “Structure and Mechanism of the Mrp Complex, an Ancient Cation/Proton Antiporter.” <i>ELife</i>, vol. 9, e59407, eLife Sciences Publications, 2020, doi:<a href=\"https://doi.org/10.7554/eLife.59407\">10.7554/eLife.59407</a>.","apa":"Steiner, J., &#38; Sazanov, L. A. (2020). Structure and mechanism of the Mrp complex, an ancient cation/proton antiporter. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/eLife.59407\">https://doi.org/10.7554/eLife.59407</a>","ista":"Steiner J, Sazanov LA. 2020. Structure and mechanism of the Mrp complex, an ancient cation/proton antiporter. eLife. 9, e59407.","ama":"Steiner J, Sazanov LA. Structure and mechanism of the Mrp complex, an ancient cation/proton antiporter. <i>eLife</i>. 2020;9. doi:<a href=\"https://doi.org/10.7554/eLife.59407\">10.7554/eLife.59407</a>","chicago":"Steiner, Julia, and Leonid A Sazanov. “Structure and Mechanism of the Mrp Complex, an Ancient Cation/Proton Antiporter.” <i>ELife</i>. eLife Sciences Publications, 2020. <a href=\"https://doi.org/10.7554/eLife.59407\">https://doi.org/10.7554/eLife.59407</a>."},"day":"31","has_accepted_license":"1","quality_controlled":"1","type":"journal_article","external_id":{"pmid":["32735215"],"isi":["000562123600001"]},"_id":"8284","abstract":[{"lang":"eng","text":"Multiple resistance and pH adaptation (Mrp) antiporters are multi-subunit Na+ (or K+)/H+ exchangers representing an ancestor of many essential redox-driven proton pumps, such as respiratory complex I. The mechanism of coupling between ion or electron transfer and proton translocation in this large protein family is unknown. Here, we present the structure of the Mrp complex from Anoxybacillus flavithermus solved by cryo-EM at 3.0 Å resolution. It is a dimer of seven-subunit protomers with 50 trans-membrane helices each. Surface charge distribution within each monomer is remarkably asymmetric, revealing probable proton and sodium translocation pathways. On the basis of the structure we propose a mechanism where the coupling between sodium and proton translocation is facilitated by a series of electrostatic interactions between a cation and key charged residues. This mechanism is likely to be applicable to the entire family of redox proton pumps, where electron transfer to substrates replaces cation movements."}],"language":[{"iso":"eng"}],"related_material":{"link":[{"url":"https://ist.ac.at/en/news/mystery-of-giant-proton-pump-solved/","relation":"press_release","description":"News on IST Homepage"}],"record":[{"status":"public","id":"8353","relation":"dissertation_contains"}]},"pmid":1,"publisher":"eLife Sciences Publications","article_processing_charge":"No","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"month":"07","department":[{"_id":"LeSa"}],"article_type":"original","project":[{"grant_number":"24741","_id":"26169496-B435-11E9-9278-68D0E5697425","name":"Revealing the functional mechanism of Mrp antiporter, an ancestor of complex I"}],"volume":9,"author":[{"orcid":"0000-0003-0493-3775","first_name":"Julia","id":"3BB67EB0-F248-11E8-B48F-1D18A9856A87","full_name":"Steiner, Julia","last_name":"Steiner"},{"orcid":"0000-0002-0977-7989","id":"338D39FE-F248-11E8-B48F-1D18A9856A87","first_name":"Leonid A","last_name":"Sazanov","full_name":"Sazanov, Leonid A"}],"doi":"10.7554/eLife.59407","oa":1,"acknowledgement":"This research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by the Electron Microscopy Facility (EMF), the Life Science Facility (LSF) and the IST high-performance computing cluster. We thank Dr Victor-Valentin Hodirnau and Daniel Johann Gütl from IST Austria for assistance with collecting cryo-EM data. We thank Prof. Masahiro Ito (Graduate School of Life Sciences, Toyo University, Japan) for a kind provision of plasmid DNA encoding Mrp from A. flavithermus WK1. JS is a recipient of a DOC Fellowship of the Austrian Academy of Sciences at the Institute of Science and Technology, Austria.","oa_version":"Published Version","date_created":"2020-08-24T06:24:04Z","title":"Structure and mechanism of the Mrp complex, an ancient cation/proton antiporter","publication_identifier":{"eissn":["2050-084X"]},"file":[{"access_level":"open_access","success":1,"content_type":"application/pdf","date_created":"2020-08-24T13:31:53Z","file_size":7320493,"checksum":"b3656d14d5ddbb9d26e3074eea2d0c15","file_name":"2020_eLife_Steiner.pdf","file_id":"8289","relation":"main_file","creator":"cziletti","date_updated":"2020-08-24T13:31:53Z"}],"publication_status":"published"},{"date_published":"2020-02-10T00:00:00Z","OA_place":"publisher","year":"2020","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","ddc":["514"],"has_accepted_license":"1","day":"10","citation":{"chicago":"Ölsböck, Katharina. “The Hole System of Triangulated Shapes.” Institute of Science and Technology Austria, 2020. <a href=\"https://doi.org/10.15479/AT:ISTA:7460\">https://doi.org/10.15479/AT:ISTA:7460</a>.","ista":"Ölsböck K. 2020. The hole system of triangulated shapes. Institute of Science and Technology Austria.","ama":"Ölsböck K. The hole system of triangulated shapes. 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:7460\">10.15479/AT:ISTA:7460</a>","apa":"Ölsböck, K. (2020). <i>The hole system of triangulated shapes</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:7460\">https://doi.org/10.15479/AT:ISTA:7460</a>","short":"K. Ölsböck, The Hole System of Triangulated Shapes, Institute of Science and Technology Austria, 2020.","ieee":"K. Ölsböck, “The hole system of triangulated shapes,” Institute of Science and Technology Austria, 2020.","mla":"Ölsböck, Katharina. <i>The Hole System of Triangulated Shapes</i>. Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:7460\">10.15479/AT:ISTA:7460</a>."},"type":"dissertation","_id":"7460","abstract":[{"lang":"eng","text":"Many methods for the reconstruction of shapes from sets of points produce ordered simplicial complexes, which are collections of vertices, edges, triangles, and their higher-dimensional analogues, called simplices, in which every simplex gets assigned a real value measuring its size. This thesis studies ordered simplicial complexes, with a focus on their topology, which reflects the connectedness of the represented shapes and the presence of holes. We are interested both in understanding better the structure of these complexes, as well as in developing algorithms for applications.\r\n\r\nFor the Delaunay triangulation, the most popular measure for a simplex is the radius of the smallest empty circumsphere. Based on it, we revisit Alpha and Wrap complexes and experimentally determine their probabilistic properties for random data. Also, we prove the existence of tri-partitions, propose algorithms to open and close holes, and extend the concepts from Euclidean to Bregman geometries."}],"language":[{"iso":"eng"}],"license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","status":"public","page":"155","date_updated":"2026-04-08T07:23:21Z","file_date_updated":"2020-07-14T12:47:58Z","oa_version":"Published Version","title":"The hole system of triangulated shapes","date_created":"2020-02-06T14:56:53Z","alternative_title":["ISTA Thesis"],"publication_identifier":{"issn":["2663-337X"]},"keyword":["shape reconstruction","hole manipulation","ordered complexes","Alpha complex","Wrap complex","computational topology","Bregman geometry"],"file":[{"creator":"koelsboe","date_updated":"2020-07-14T12:47:58Z","relation":"main_file","file_id":"7461","checksum":"1df9f8c530b443c0e63a3f2e4fde412e","file_name":"thesis_ist-final_noack.pdf","content_type":"application/pdf","date_created":"2020-02-06T14:43:54Z","file_size":76195184,"access_level":"open_access"},{"creator":"koelsboe","date_updated":"2020-07-14T12:47:58Z","relation":"source_file","file_id":"7462","checksum":"7a52383c812b0be64d3826546509e5a4","file_name":"latex-files.zip","content_type":"application/x-zip-compressed","file_size":122103715,"date_created":"2020-02-06T14:52:45Z","access_level":"closed","description":"latex source files, figures"}],"publication_status":"published","supervisor":[{"last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833"}],"related_material":{"record":[{"relation":"part_of_dissertation","id":"6608","status":"public"}]},"publisher":"Institute of Science and Technology Austria","tmp":{"short":"CC BY-NC-SA (4.0)","image":"/images/cc_by_nc_sa.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)"},"corr_author":"1","article_processing_charge":"No","department":[{"_id":"HeEd"},{"_id":"GradSch"}],"month":"02","author":[{"full_name":"Ölsböck, Katharina","last_name":"Ölsböck","first_name":"Katharina","id":"4D4AA390-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4672-8297"}],"degree_awarded":"PhD","doi":"10.15479/AT:ISTA:7460","oa":1},{"oa":1,"doi":"10.1007/978-3-030-53288-8_14","acknowledgement":"Bernhard Kragl and Thomas A. Henzinger were supported by\r\nthe Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","month":"07","department":[{"_id":"ToHe"}],"project":[{"grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems"}],"volume":12224,"author":[{"full_name":"Kragl, Bernhard","last_name":"Kragl","id":"320FC952-F248-11E8-B48F-1D18A9856A87","first_name":"Bernhard","orcid":"0000-0001-7745-9117"},{"first_name":"Shaz","full_name":"Qadeer, Shaz","last_name":"Qadeer"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A"}],"publisher":"Springer Nature","article_processing_charge":"No","corr_author":"1","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"related_material":{"record":[{"id":"8332","status":"public","relation":"dissertation_contains"}]},"publication_status":"published","file":[{"access_level":"open_access","file_size":804237,"date_created":"2020-08-06T08:14:54Z","content_type":"application/pdf","success":1,"file_name":"2020_LNCS_Kragl.pdf","relation":"main_file","creator":"dernst","date_updated":"2020-08-06T08:14:54Z","file_id":"8201"}],"publication_identifier":{"eisbn":["9783030532888"],"isbn":["9783030532871"],"eissn":["1611-3349"],"issn":["0302-9743"]},"oa_version":"Published Version","title":"Refinement for structured concurrent programs","alternative_title":["LNCS"],"date_created":"2020-08-03T11:45:35Z","file_date_updated":"2020-08-06T08:14:54Z","isi":1,"publication":"Computer Aided Verification","date_updated":"2026-04-08T07:23:52Z","page":"275-298","status":"public","scopus_import":"1","quality_controlled":"1","type":"conference","external_id":{"isi":["000695276000014"]},"_id":"8195","language":[{"iso":"eng"}],"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."}],"citation":{"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: <i>Computer Aided Verification</i>. Vol 12224. Springer Nature; 2020:275-298. doi:<a href=\"https://doi.org/10.1007/978-3-030-53288-8_14\">10.1007/978-3-030-53288-8_14</a>","chicago":"Kragl, Bernhard, Shaz Qadeer, and Thomas A Henzinger. “Refinement for Structured Concurrent Programs.” In <i>Computer Aided Verification</i>, 12224:275–98. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-030-53288-8_14\">https://doi.org/10.1007/978-3-030-53288-8_14</a>.","ieee":"B. Kragl, S. Qadeer, and T. A. Henzinger, “Refinement for structured concurrent programs,” in <i>Computer Aided Verification</i>, 2020, vol. 12224, pp. 275–298.","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.” <i>Computer Aided Verification</i>, vol. 12224, Springer Nature, 2020, pp. 275–98, doi:<a href=\"https://doi.org/10.1007/978-3-030-53288-8_14\">10.1007/978-3-030-53288-8_14</a>.","apa":"Kragl, B., Qadeer, S., &#38; Henzinger, T. A. (2020). Refinement for structured concurrent programs. In <i>Computer Aided Verification</i> (Vol. 12224, pp. 275–298). Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-53288-8_14\">https://doi.org/10.1007/978-3-030-53288-8_14</a>"},"day":"14","has_accepted_license":"1","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","ddc":["000"],"year":"2020","intvolume":"     12224","date_published":"2020-07-14T00:00:00Z"},{"scopus_import":"1","page":"227-242","status":"public","publication":"Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation","date_updated":"2026-04-08T07:23:52Z","isi":1,"date_published":"2020-06-01T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1145/3385412.3385980"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","year":"2020","day":"01","citation":{"apa":"Kragl, B., Enea, C., Henzinger, T. A., Mutluergil, S. O., &#38; Qadeer, S. (2020). Inductive sequentialization of asynchronous programs. In <i>Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation</i> (pp. 227–242). London, United Kingdom: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3385412.3385980\">https://doi.org/10.1145/3385412.3385980</a>","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.","ieee":"B. Kragl, C. Enea, T. A. Henzinger, S. O. Mutluergil, and S. Qadeer, “Inductive sequentialization of asynchronous programs,” in <i>Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation</i>, London, United Kingdom, 2020, pp. 227–242.","mla":"Kragl, Bernhard, et al. “Inductive Sequentialization of Asynchronous Programs.” <i>Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation</i>, Association for Computing Machinery, 2020, pp. 227–42, doi:<a href=\"https://doi.org/10.1145/3385412.3385980\">10.1145/3385412.3385980</a>.","chicago":"Kragl, Bernhard, Constantin Enea, Thomas A Henzinger, Suha Orhun Mutluergil, and Shaz Qadeer. “Inductive Sequentialization of Asynchronous Programs.” In <i>Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation</i>, 227–42. Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3385412.3385980\">https://doi.org/10.1145/3385412.3385980</a>.","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.","ama":"Kragl B, Enea C, Henzinger TA, Mutluergil SO, Qadeer S. Inductive sequentialization of asynchronous programs. In: <i>Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation</i>. Association for Computing Machinery; 2020:227-242. doi:<a href=\"https://doi.org/10.1145/3385412.3385980\">10.1145/3385412.3385980</a>"},"external_id":{"isi":["000614622300016"]},"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"}],"_id":"8012","language":[{"iso":"eng"}],"quality_controlled":"1","type":"conference","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"8332"}]},"article_processing_charge":"No","publisher":"Association for Computing Machinery","author":[{"first_name":"Bernhard","id":"320FC952-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7745-9117","full_name":"Kragl, Bernhard","last_name":"Kragl"},{"full_name":"Enea, Constantin","last_name":"Enea","first_name":"Constantin"},{"orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"full_name":"Mutluergil, Suha Orhun","last_name":"Mutluergil","first_name":"Suha Orhun"},{"last_name":"Qadeer","full_name":"Qadeer, Shaz","first_name":"Shaz"}],"month":"06","department":[{"_id":"ToHe"}],"project":[{"name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"oa":1,"doi":"10.1145/3385412.3385980","title":"Inductive sequentialization of asynchronous programs","date_created":"2020-06-25T11:40:16Z","oa_version":"Published Version","publication_identifier":{"isbn":["9781450376136"]},"conference":{"location":"London, United Kingdom","end_date":"2020-06-20","start_date":"2020-06-15","name":"PLDI: Programming Language Design and Implementation"},"publication_status":"published"},{"ec_funded":1,"status":"public","page":"126","date_updated":"2026-04-08T07:24:42Z","file_date_updated":"2020-07-14T12:48:04Z","date_published":"2020-05-25T00:00:00Z","OA_place":"publisher","year":"2020","ddc":["000"],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","has_accepted_license":"1","citation":{"chicago":"Kamath Hosdurg, Chethan. “On the Average-Case Hardness of Total Search Problems.” Institute of Science and Technology Austria, 2020. <a href=\"https://doi.org/10.15479/AT:ISTA:7896\">https://doi.org/10.15479/AT:ISTA:7896</a>.","ista":"Kamath Hosdurg C. 2020. On the average-case hardness of total search problems. Institute of Science and Technology Austria.","ama":"Kamath Hosdurg C. On the average-case hardness of total search problems. 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:7896\">10.15479/AT:ISTA:7896</a>","apa":"Kamath Hosdurg, C. (2020). <i>On the average-case hardness of total search problems</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:7896\">https://doi.org/10.15479/AT:ISTA:7896</a>","ieee":"C. Kamath Hosdurg, “On the average-case hardness of total search problems,” Institute of Science and Technology Austria, 2020.","short":"C. Kamath Hosdurg, On the Average-Case Hardness of Total Search Problems, Institute of Science and Technology Austria, 2020.","mla":"Kamath Hosdurg, Chethan. <i>On the Average-Case Hardness of Total Search Problems</i>. Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:7896\">10.15479/AT:ISTA:7896</a>."},"day":"25","abstract":[{"text":"A search problem lies in the complexity class FNP if a solution to the given instance of the problem can be verified efficiently. The complexity class TFNP consists of all search problems in FNP that are total in the sense that a solution is guaranteed to exist. TFNP contains a host of interesting problems from fields such as algorithmic game theory, computational topology, number theory and combinatorics. Since TFNP is a semantic class, it is unlikely to have a complete problem. Instead, one studies its syntactic subclasses which are defined based on the combinatorial principle used to argue totality. Of particular interest is the subclass PPAD, which contains important problems\r\nlike computing Nash equilibrium for bimatrix games and computational counterparts of several fixed-point theorems as complete. In the thesis, we undertake the study of averagecase hardness of TFNP, and in particular its subclass PPAD.\r\nAlmost nothing was known about average-case hardness of PPAD before a series of recent results showed how to achieve it using a cryptographic primitive called program obfuscation.\r\nHowever, it is currently not known how to construct program obfuscation from standard cryptographic assumptions. Therefore, it is desirable to relax the assumption under which average-case hardness of PPAD can be shown. In the thesis we take a step in this direction. First, we show that assuming the (average-case) hardness of a numbertheoretic\r\nproblem related to factoring of integers, which we call Iterated-Squaring, PPAD is hard-on-average in the random-oracle model. Then we strengthen this result to show that the average-case hardness of PPAD reduces to the (adaptive) soundness of the Fiat-Shamir Transform, a well-known technique used to compile a public-coin interactive protocol into a non-interactive one. As a corollary, we obtain average-case hardness for PPAD in the random-oracle model assuming the worst-case hardness of #SAT. Moreover, the above results can all be strengthened to obtain average-case hardness for the class CLS ⊆ PPAD.\r\nOur main technical contribution is constructing incrementally-verifiable procedures for computing Iterated-Squaring and #SAT. By incrementally-verifiable, we mean that every intermediate state of the computation includes a proof of its correctness, and the proof can be updated and verified in polynomial time. Previous constructions of such procedures relied on strong, non-standard assumptions. Instead, we introduce a technique called recursive proof-merging to obtain the same from weaker assumptions. ","lang":"eng"}],"_id":"7896","language":[{"iso":"eng"}],"type":"dissertation","related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"6677"}]},"corr_author":"1","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"article_processing_charge":"No","publisher":"Institute of Science and Technology Austria","author":[{"full_name":"Kamath Hosdurg, Chethan","last_name":"Kamath Hosdurg","orcid":"0009-0006-6812-7317","first_name":"Chethan","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87"}],"project":[{"_id":"258C570E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"259668","name":"Provable Security for Physical Cryptography"},{"name":"Teaching Old Crypto New Tricks","grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"department":[{"_id":"KrPi"}],"month":"05","degree_awarded":"PhD","oa":1,"doi":"10.15479/AT:ISTA:7896","title":"On the average-case hardness of total search problems","date_created":"2020-05-26T14:08:55Z","alternative_title":["ISTA Thesis"],"oa_version":"Published Version","publication_identifier":{"issn":["2663-337X"]},"file":[{"access_level":"open_access","date_created":"2020-05-26T14:08:13Z","file_size":1622742,"content_type":"application/pdf","file_name":"2020_Thesis_Kamath.pdf","checksum":"b39e2e1c376f5819b823fb7077491c64","date_updated":"2020-07-14T12:48:04Z","creator":"dernst","relation":"main_file","file_id":"7897"},{"checksum":"8b26ba729c1a85ac6bea775f5d73cdc7","file_name":"Thesis_Kamath.zip","file_id":"7898","date_updated":"2020-07-14T12:48:04Z","creator":"dernst","relation":"source_file","access_level":"closed","content_type":"application/x-zip-compressed","file_size":15301529,"date_created":"2020-05-26T14:08:23Z"}],"supervisor":[{"full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z"}],"publication_status":"published"},{"oa_version":"Published Version","alternative_title":["ISTA Thesis"],"title":"Novel insights into PIN polarity regulation during Arabidopsis development","date_created":"2020-09-30T14:50:51Z","publication_identifier":{"issn":["2663-337X"]},"file":[{"date_created":"2020-09-30T14:50:20Z","file_size":49198118,"content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","access_level":"closed","relation":"source_file","date_updated":"2020-09-30T14:50:20Z","creator":"dernst","file_id":"8590","file_name":"2020_Han_Thesis.docx","checksum":"c4bda1947d4c09c428ac9ce667b02327"},{"checksum":"3f4f5d1718c2230adf30639ecaf8a00b","file_name":"2020_Han_Thesis.pdf","relation":"main_file","file_id":"8591","date_updated":"2021-10-01T13:33:02Z","creator":"dernst","access_level":"open_access","content_type":"application/pdf","file_size":15513963,"date_created":"2020-09-30T14:49:59Z"}],"publication_status":"published","supervisor":[{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jiří","orcid":"0000-0002-8302-7596","last_name":"Friml","full_name":"Friml, Jiří"}],"related_material":{"record":[{"relation":"part_of_dissertation","id":"7643","status":"public"}]},"publisher":"Institute of Science and Technology Austria","corr_author":"1","article_processing_charge":"No","department":[{"_id":"JiFr"}],"month":"09","author":[{"first_name":"Huibin","id":"31435098-F248-11E8-B48F-1D18A9856A87","last_name":"Han","full_name":"Han, Huibin"}],"degree_awarded":"PhD","acknowledgement":"I also want to thank the China Scholarship Council for supporting my study during the year from 2015 to 2019. I also want to thank IST facilities – the Bioimaging facility, the media kitchen, the plant facility and all of the campus services, for their support.","oa":1,"doi":"10.15479/AT:ISTA:8589","date_published":"2020-09-30T00:00:00Z","OA_place":"publisher","year":"2020","ddc":["580"],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","has_accepted_license":"1","day":"30","citation":{"apa":"Han, H. (2020). <i>Novel insights into PIN polarity regulation during Arabidopsis development</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:8589\">https://doi.org/10.15479/AT:ISTA:8589</a>","short":"H. Han, Novel Insights into PIN Polarity Regulation during Arabidopsis Development, Institute of Science and Technology Austria, 2020.","ieee":"H. Han, “Novel insights into PIN polarity regulation during Arabidopsis development,” Institute of Science and Technology Austria, 2020.","mla":"Han, Huibin. <i>Novel Insights into PIN Polarity Regulation during Arabidopsis Development</i>. Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8589\">10.15479/AT:ISTA:8589</a>.","chicago":"Han, Huibin. “Novel Insights into PIN Polarity Regulation during Arabidopsis Development.” Institute of Science and Technology Austria, 2020. <a href=\"https://doi.org/10.15479/AT:ISTA:8589\">https://doi.org/10.15479/AT:ISTA:8589</a>.","ista":"Han H. 2020. Novel insights into PIN polarity regulation during Arabidopsis development. Institute of Science and Technology Austria.","ama":"Han H. Novel insights into PIN polarity regulation during Arabidopsis development. 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8589\">10.15479/AT:ISTA:8589</a>"},"type":"dissertation","language":[{"iso":"eng"}],"_id":"8589","abstract":[{"lang":"eng","text":"The plant hormone auxin plays indispensable roles in plant growth and development. An essential level of regulation in auxin action is the directional auxin transport within cells. The establishment of auxin gradient in plant tissue has been attributed to local auxin biosynthesis and directional intercellular auxin transport, which both are controlled by various environmental and developmental signals. It is well established that asymmetric auxin distribution in cells is achieved by polarly localized PIN-FORMED (PIN) auxin efflux transporters. Despite the initial insights into cellular mechanisms of PIN polarization obtained from the last decades, the molecular mechanism and specific regulators mediating PIN polarization remains elusive. In this thesis, we aim to find novel players in PIN subcellular polarity regulation during Arabidopsis development. We first characterize the physiological effect of piperonylic acid (PA) on Arabidopsis hypocotyl gravitropic bending and PIN polarization. Secondly, we reveal the importance of SCFTIR1/AFB auxin signaling pathway in shoot gravitropism bending termination. In addition, we also explore the role of myosin XI complex, and actin cytoskeleton in auxin feedback regulation on PIN polarity. In Chapter 1, we give an overview of the current knowledge about PIN-mediated auxin fluxes in various plant tropic responses. In Chapter 2, we study the physiological effect of PA on shoot gravitropic bending. Our results show that PA treatment inhibits auxin-mediated PIN3 repolarization by interfering with PINOID and PIN3 phosphorylation status, ultimately leading to hyperbending hypocotyls. In Chapter 3, we provide evidence to show that the SCFTIR1/AFB nuclear auxin signaling pathway is crucial and required for auxin-mediated PIN3 repolarization and shoot gravitropic bending termination. In Chapter 4, we perform a phosphoproteomics approach and identify the motor protein Myosin XI and its binding protein, the MadB2 family, as an essential regulator of PIN polarity for auxin-canalization related developmental processes. In Chapter 5, we demonstrate the vital role of actin cytoskeleton in auxin feedback on PIN polarity by regulating PIN subcellular trafficking. Overall, the data presented in this PhD thesis brings novel insights into the PIN polar localization regulation that resulted in the (re)establishment of the polar auxin flow and gradient in response to environmental stimuli during plant development."}],"page":"164","status":"public","acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"}],"date_updated":"2026-04-08T07:24:28Z","file_date_updated":"2021-10-01T13:33:02Z"},{"doi":"10.1104/pp.20.00212","oa":1,"acknowledgement":"This work was supported by the European Research Council under the European Union’s Horizon 2020 research and innovation Programme (ERC grant agreement number 742985), and the Austrian Science Fund (FWF, grant number I 3630-B25) to JF. HH is supported by the China Scholarship Council (CSC scholarship). ","author":[{"first_name":"Huibin","id":"31435098-F248-11E8-B48F-1D18A9856A87","last_name":"Han","full_name":"Han, Huibin"},{"id":"4CAAA450-78D2-11EA-8E57-B40A396E08BA","first_name":"Hana","full_name":"Rakusova, Hana","last_name":"Rakusova"},{"last_name":"Verstraeten","full_name":"Verstraeten, Inge","orcid":"0000-0001-7241-2328","id":"362BF7FE-F248-11E8-B48F-1D18A9856A87","first_name":"Inge"},{"first_name":"Yuzhou","id":"3B6137F2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2627-6956","full_name":"Zhang, Yuzhou","last_name":"Zhang"},{"first_name":"Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","full_name":"Friml, Jiří","last_name":"Friml"}],"volume":183,"month":"05","department":[{"_id":"JiFr"}],"project":[{"name":"Tracing Evolution of Auxin Transport and Polarity in Plants","_id":"261099A6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"742985"},{"call_identifier":"FWF","_id":"26538374-B435-11E9-9278-68D0E5697425","grant_number":"I03630","name":"Molecular mechanisms of endocytic cargo recognition in plants"}],"article_type":"letter_note","article_processing_charge":"No","corr_author":"1","publisher":"American Society of Plant Biologists","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"8589"}]},"pmid":1,"publication_status":"published","publication_identifier":{"eissn":["1532-2548"],"issn":["0032-0889"]},"title":"SCF TIR1/AFB auxin signaling for bending termination during shoot gravitropism","date_created":"2020-04-06T10:06:40Z","oa_version":"Published Version","date_updated":"2026-04-08T07:24:27Z","publication":"Plant Physiology","isi":1,"status":"public","page":"37-40","ec_funded":1,"issue":"5","scopus_import":"1","external_id":{"pmid":["32107280"],"isi":["000536641800018"]},"_id":"7643","language":[{"iso":"eng"}],"quality_controlled":"1","type":"journal_article","day":"08","citation":{"ista":"Han H, Rakusova H, Verstraeten I, Zhang Y, Friml J. 2020. SCF TIR1/AFB auxin signaling for bending termination during shoot gravitropism. Plant Physiology. 183(5), 37–40.","ama":"Han H, Rakusova H, Verstraeten I, Zhang Y, Friml J. SCF TIR1/AFB auxin signaling for bending termination during shoot gravitropism. <i>Plant Physiology</i>. 2020;183(5):37-40. doi:<a href=\"https://doi.org/10.1104/pp.20.00212\">10.1104/pp.20.00212</a>","chicago":"Han, Huibin, Hana Rakusova, Inge Verstraeten, Yuzhou Zhang, and Jiří Friml. “SCF TIR1/AFB Auxin Signaling for Bending Termination during Shoot Gravitropism.” <i>Plant Physiology</i>. American Society of Plant Biologists, 2020. <a href=\"https://doi.org/10.1104/pp.20.00212\">https://doi.org/10.1104/pp.20.00212</a>.","short":"H. Han, H. Rakusova, I. Verstraeten, Y. Zhang, J. Friml, Plant Physiology 183 (2020) 37–40.","ieee":"H. Han, H. Rakusova, I. Verstraeten, Y. Zhang, and J. Friml, “SCF TIR1/AFB auxin signaling for bending termination during shoot gravitropism,” <i>Plant Physiology</i>, vol. 183, no. 5. American Society of Plant Biologists, pp. 37–40, 2020.","mla":"Han, Huibin, et al. “SCF TIR1/AFB Auxin Signaling for Bending Termination during Shoot Gravitropism.” <i>Plant Physiology</i>, vol. 183, no. 5, American Society of Plant Biologists, 2020, pp. 37–40, doi:<a href=\"https://doi.org/10.1104/pp.20.00212\">10.1104/pp.20.00212</a>.","apa":"Han, H., Rakusova, H., Verstraeten, I., Zhang, Y., &#38; Friml, J. (2020). SCF TIR1/AFB auxin signaling for bending termination during shoot gravitropism. <i>Plant Physiology</i>. American Society of Plant Biologists. <a href=\"https://doi.org/10.1104/pp.20.00212\">https://doi.org/10.1104/pp.20.00212</a>"},"intvolume":"       183","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","year":"2020","date_published":"2020-05-08T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1104/pp.20.00212"}]},{"language":[{"iso":"eng"}],"_id":"7569","abstract":[{"text":"Genes differ in the frequency at which they are expressed and in the form of regulation used to control their activity. In particular, positive or negative regulation can lead to activation of a gene in response to an external signal. Previous works proposed that the form of regulation of a gene correlates with its frequency of usage: positive regulation when the gene is frequently expressed and negative regulation when infrequently expressed. Such network design means that, in the absence of their regulators, the genes are found in their least required activity state, hence regulatory intervention is often necessary. Due to the multitude of genes and regulators, spurious binding and unbinding events, called “crosstalk”, could occur. To determine how the form of regulation affects the global crosstalk in the network, we used a mathematical model that includes multiple regulators and multiple target genes. We found that crosstalk depends non-monotonically on the availability of regulators. Our analysis showed that excess use of regulation entailed by the formerly suggested network design caused high crosstalk levels in a large part of the parameter space. We therefore considered the opposite ‘idle’ design, where the default unregulated state of genes is their frequently required activity state. We found, that ‘idle’ design minimized the use of regulation and thus minimized crosstalk. In addition, we estimated global crosstalk of S. cerevisiae using transcription factors binding data. We demonstrated that even partial network data could suffice to estimate its global crosstalk, suggesting its applicability to additional organisms. We found that S. cerevisiae estimated crosstalk is lower than that of a random network, suggesting that natural selection reduces crosstalk. In summary, our study highlights a new type of protein production cost which is typically overlooked: that of regulatory interference caused by the presence of excess regulators in the cell. It demonstrates the importance of whole-network descriptions, which could show effects missed by single-gene models.","lang":"eng"}],"external_id":{"pmid":["32097416"],"isi":["000526725200019"]},"type":"journal_article","quality_controlled":"1","has_accepted_license":"1","citation":{"ista":"Grah R, Friedlander T. 2020. The relation between crosstalk and gene regulation form revisited. PLOS Computational Biology. 16(2), e1007642.","ama":"Grah R, Friedlander T. The relation between crosstalk and gene regulation form revisited. <i>PLOS Computational Biology</i>. 2020;16(2). doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1007642\">10.1371/journal.pcbi.1007642</a>","chicago":"Grah, Rok, and Tamar Friedlander. “The Relation between Crosstalk and Gene Regulation Form Revisited.” <i>PLOS Computational Biology</i>. Public Library of Science, 2020. <a href=\"https://doi.org/10.1371/journal.pcbi.1007642\">https://doi.org/10.1371/journal.pcbi.1007642</a>.","ieee":"R. Grah and T. Friedlander, “The relation between crosstalk and gene regulation form revisited,” <i>PLOS Computational Biology</i>, vol. 16, no. 2. Public Library of Science, 2020.","short":"R. Grah, T. Friedlander, PLOS Computational Biology 16 (2020).","mla":"Grah, Rok, and Tamar Friedlander. “The Relation between Crosstalk and Gene Regulation Form Revisited.” <i>PLOS Computational Biology</i>, vol. 16, no. 2, e1007642, Public Library of Science, 2020, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1007642\">10.1371/journal.pcbi.1007642</a>.","apa":"Grah, R., &#38; Friedlander, T. (2020). The relation between crosstalk and gene regulation form revisited. <i>PLOS Computational Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1007642\">https://doi.org/10.1371/journal.pcbi.1007642</a>"},"day":"25","intvolume":"        16","article_number":"e1007642","year":"2020","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000","570"],"date_published":"2020-02-25T00:00:00Z","file_date_updated":"2020-07-14T12:48:00Z","date_updated":"2026-04-08T07:25:08Z","publication":"PLOS Computational Biology","isi":1,"status":"public","issue":"2","scopus_import":"1","publication_status":"published","file":[{"checksum":"5239dd134dc6e1c71fe7b3ce2953da37","file_name":"2020_PlosCompBio_Grah.pdf","date_updated":"2020-07-14T12:48:00Z","creator":"dernst","relation":"main_file","file_id":"7579","access_level":"open_access","content_type":"application/pdf","file_size":2209325,"date_created":"2020-03-09T15:12:21Z"}],"publication_identifier":{"issn":["1553-7358"]},"title":"The relation between crosstalk and gene regulation form revisited","date_created":"2020-03-06T07:39:38Z","oa_version":"Published Version","oa":1,"doi":"10.1371/journal.pcbi.1007642","volume":16,"author":[{"last_name":"Grah","full_name":"Grah, Rok","first_name":"Rok","id":"483E70DE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2539-3560"},{"last_name":"Friedlander","full_name":"Friedlander, Tamar","first_name":"Tamar"}],"article_type":"original","month":"02","department":[{"_id":"CaGu"},{"_id":"GaTk"}],"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"article_processing_charge":"No","publisher":"Public Library of Science","pmid":1,"related_material":{"record":[{"relation":"research_data","id":"9716","status":"deleted"},{"status":"public","id":"9776","relation":"research_data"},{"relation":"research_data","id":"9779","status":"public"},{"relation":"research_data","status":"public","id":"9777"},{"id":"8155","status":"public","relation":"dissertation_contains"}]}},{"page":"215","status":"public","file_date_updated":"2021-09-16T12:49:12Z","acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"},{"_id":"NanoFab"}],"date_updated":"2026-04-08T07:24:56Z","ddc":["570"],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","year":"2020","OA_place":"publisher","date_published":"2020-09-08T00:00:00Z","type":"dissertation","_id":"8341","abstract":[{"text":"One of the most striking hallmarks of the eukaryotic cell is the presence of intracellular vesicles and organelles. Each of these membrane-enclosed compartments has a distinct composition of lipids and proteins, which is essential for accurate membrane traffic and homeostasis. Interestingly, their biochemical identities are achieved with the help\r\nof small GTPases of the Rab family, which cycle between GDP- and GTP-bound forms on the selected membrane surface. While this activity switch is well understood for an individual protein, how Rab GTPases collectively transition between states to generate decisive signal propagation in space and time is unclear. In my PhD thesis, I present\r\nin vitro reconstitution experiments with theoretical modeling to systematically study a minimal Rab5 activation network from bottom-up. We find that positive feedback based on known molecular interactions gives rise to bistable GTPase activity switching on system’s scale. Furthermore, we determine that collective transition near the critical\r\npoint is intrinsically stochastic and provide evidence that the inactive Rab5 abundance on the membrane can shape the network response. Finally, we demonstrate that collective switching can spread on the lipid bilayer as a traveling activation wave, representing a possible emergent activity pattern in endosomal maturation. Together, our\r\nfindings reveal new insights into the self-organization properties of signaling networks away from chemical equilibrium. Our work highlights the importance of systematic characterization of biochemical systems in well-defined physiological conditions. This way, we were able to answer long-standing open questions in the field and close the gap between regulatory processes on a molecular scale and emergent responses on system’s level.","lang":"eng"}],"language":[{"iso":"eng"}],"day":"08","citation":{"apa":"Bezeljak, U. (2020). <i>In vitro reconstitution of a Rab activation switch</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:8341\">https://doi.org/10.15479/AT:ISTA:8341</a>","ieee":"U. Bezeljak, “In vitro reconstitution of a Rab activation switch,” Institute of Science and Technology Austria, 2020.","short":"U. Bezeljak, In Vitro Reconstitution of a Rab Activation Switch, Institute of Science and Technology Austria, 2020.","mla":"Bezeljak, Urban. <i>In Vitro Reconstitution of a Rab Activation Switch</i>. Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8341\">10.15479/AT:ISTA:8341</a>.","chicago":"Bezeljak, Urban. “In Vitro Reconstitution of a Rab Activation Switch.” Institute of Science and Technology Austria, 2020. <a href=\"https://doi.org/10.15479/AT:ISTA:8341\">https://doi.org/10.15479/AT:ISTA:8341</a>.","ista":"Bezeljak U. 2020. In vitro reconstitution of a Rab activation switch. Institute of Science and Technology Austria.","ama":"Bezeljak U. In vitro reconstitution of a Rab activation switch. 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8341\">10.15479/AT:ISTA:8341</a>"},"has_accepted_license":"1","publisher":"Institute of Science and Technology Austria","article_processing_charge":"No","tmp":{"short":"CC BY-NC-SA (4.0)","image":"/images/cc_by_nc_sa.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)"},"corr_author":"1","related_material":{"record":[{"relation":"part_of_dissertation","id":"7580","status":"public"}]},"oa":1,"doi":"10.15479/AT:ISTA:8341","acknowledgement":"My thanks goes to the Loose lab members, BioImaging, Life Science and Nanofabrication Facilities and the wonderful international community at IST for sharing this experience with me.","degree_awarded":"PhD","month":"09","department":[{"_id":"MaLo"}],"author":[{"last_name":"Bezeljak","full_name":"Bezeljak, Urban","first_name":"Urban","id":"2A58201A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1365-5631"}],"publication_identifier":{"issn":["2663-337X"]},"oa_version":"Published Version","title":"In vitro reconstitution of a Rab activation switch","date_created":"2020-09-08T08:53:53Z","alternative_title":["ISTA Thesis"],"publication_status":"published","supervisor":[{"last_name":"Loose","full_name":"Loose, Martin","orcid":"0000-0001-7309-9724","id":"462D4284-F248-11E8-B48F-1D18A9856A87","first_name":"Martin"}],"file":[{"content_type":"application/x-zip-compressed","file_size":65246782,"date_created":"2020-09-08T09:00:29Z","access_level":"closed","relation":"source_file","creator":"dernst","date_updated":"2021-09-16T12:49:12Z","file_id":"8342","checksum":"70871b335a595252a66c6bbf0824fb02","file_name":"2020_Urban_Bezeljak_Thesis_TeX.zip"},{"access_level":"open_access","date_created":"2020-09-08T09:00:27Z","file_size":31259058,"content_type":"application/pdf","file_name":"2020_Urban_Bezeljak_Thesis.pdf","checksum":"59a62275088b00b7241e6ff4136434c7","creator":"dernst","file_id":"8343","relation":"main_file","date_updated":"2021-09-16T12:49:12Z"}]},{"file":[{"access_level":"open_access","date_created":"2020-07-27T12:00:07Z","file_size":16638998,"content_type":"application/pdf","success":1,"file_name":"Thesis_RokGrah_200727_convertedNew.pdf","file_id":"8176","relation":"main_file","creator":"rgrah","date_updated":"2020-07-27T12:00:07Z"},{"file_name":"Thesis_new.zip","date_updated":"2020-07-30T13:04:55Z","relation":"main_file","creator":"rgrah","file_id":"8177","access_level":"closed","file_size":347459978,"date_created":"2020-07-27T12:02:23Z","content_type":"application/zip"}],"publication_status":"published","supervisor":[{"last_name":"Guet","full_name":"Guet, Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","first_name":"Calin C","orcid":"0000-0001-6220-2052"},{"first_name":"Gašper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6699-1455","full_name":"Tkačik, Gašper","last_name":"Tkačik"}],"oa_version":"Published Version","date_created":"2020-07-23T09:51:28Z","title":"Gene regulation across scales – how biophysical constraints shape evolution","alternative_title":["ISTA Thesis"],"publication_identifier":{"issn":["2663-337X"]},"project":[{"_id":"267C84F4-B435-11E9-9278-68D0E5697425","name":"Biophysically realistic genotype-phenotype maps for regulatory networks"}],"department":[{"_id":"CaGu"},{"_id":"GaTk"}],"month":"07","author":[{"orcid":"0000-0003-2539-3560","id":"483E70DE-F248-11E8-B48F-1D18A9856A87","first_name":"Rok","full_name":"Grah, Rok","last_name":"Grah"}],"degree_awarded":"PhD","acknowledgement":"For the duration of his PhD, Rok was a recipient of a DOC fellowship of the Austrian Academy of Sciences.","doi":"10.15479/AT:ISTA:8155","oa":1,"related_material":{"record":[{"relation":"part_of_dissertation","id":"7675","status":"public"},{"id":"7569","status":"public","relation":"part_of_dissertation"},{"status":"public","id":"7652","relation":"part_of_dissertation"}]},"publisher":"Institute of Science and Technology Austria","corr_author":"1","article_processing_charge":"No","has_accepted_license":"1","citation":{"chicago":"Grah, Rok. “Gene Regulation across Scales – How Biophysical Constraints Shape Evolution.” Institute of Science and Technology Austria, 2020. <a href=\"https://doi.org/10.15479/AT:ISTA:8155\">https://doi.org/10.15479/AT:ISTA:8155</a>.","ama":"Grah R. Gene regulation across scales – how biophysical constraints shape evolution. 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8155\">10.15479/AT:ISTA:8155</a>","ista":"Grah R. 2020. Gene regulation across scales – how biophysical constraints shape evolution. Institute of Science and Technology Austria.","apa":"Grah, R. (2020). <i>Gene regulation across scales – how biophysical constraints shape evolution</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:8155\">https://doi.org/10.15479/AT:ISTA:8155</a>","mla":"Grah, Rok. <i>Gene Regulation across Scales – How Biophysical Constraints Shape Evolution</i>. Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8155\">10.15479/AT:ISTA:8155</a>.","short":"R. Grah, Gene Regulation across Scales – How Biophysical Constraints Shape Evolution, Institute of Science and Technology Austria, 2020.","ieee":"R. Grah, “Gene regulation across scales – how biophysical constraints shape evolution,” Institute of Science and Technology Austria, 2020."},"day":"24","type":"dissertation","_id":"8155","abstract":[{"text":"In the thesis we focus on the interplay of the biophysics and evolution of gene regulation. We start by addressing how the type of prokaryotic gene regulation – activation and repression – affects spurious binding to DNA, also known as\r\ntranscriptional crosstalk. We propose that regulatory interference caused by excess regulatory proteins in the dense cellular medium – global crosstalk – could be a factor in determining which type of gene regulatory network is evolutionarily preferred. Next,we use a normative approach in eukaryotic gene regulation to describe minimal\r\nnon-equilibrium enhancer models that optimize so-called regulatory phenotypes. We find a class of models that differ from standard thermodynamic equilibrium models by a single parameter that notably increases the regulatory performance. Next chapter addresses the question of genotype-phenotype-fitness maps of higher dimensional phenotypes. We show that our biophysically realistic approach allows us to understand how the mechanisms of promoter function constrain genotypephenotype maps, and how they affect the evolutionary trajectories of promoters.\r\nIn the last chapter we ask whether the intrinsic instability of gene duplication and amplification provides a generic alternative to canonical gene regulation. Using mathematical modeling, we show that amplifications can tune gene expression in many environments, including those where transcription factor-based schemes are\r\nhard to evolve or maintain. ","lang":"eng"}],"language":[{"iso":"eng"}],"date_published":"2020-07-24T00:00:00Z","OA_place":"publisher","year":"2020","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","ddc":["530","570"],"date_updated":"2026-04-08T07:25:09Z","file_date_updated":"2020-07-30T13:04:55Z","page":"310","status":"public"},{"oa":1,"doi":"10.1073/pnas.1921027117","department":[{"_id":"MaLo"},{"_id":"CaBe"}],"month":"03","article_type":"original","project":[{"grant_number":"RGY0083/2016","_id":"2599F062-B435-11E9-9278-68D0E5697425","name":"Reconstitution of cell polarity and axis determination in a cell-free system"}],"volume":117,"author":[{"orcid":"0000-0003-1365-5631","id":"2A58201A-F248-11E8-B48F-1D18A9856A87","first_name":"Urban","last_name":"Bezeljak","full_name":"Bezeljak, Urban"},{"first_name":"Hrushikesh","last_name":"Loya","full_name":"Loya, Hrushikesh"},{"last_name":"Kaczmarek","full_name":"Kaczmarek, Beata M","id":"36FA4AFA-F248-11E8-B48F-1D18A9856A87","first_name":"Beata M"},{"first_name":"Timothy E.","full_name":"Saunders, Timothy E.","last_name":"Saunders"},{"id":"462D4284-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","orcid":"0000-0001-7309-9724","full_name":"Loose, Martin","last_name":"Loose"}],"publisher":"National Academy of Sciences","article_processing_charge":"No","related_material":{"record":[{"id":"8341","status":"public","relation":"dissertation_contains"}],"link":[{"url":"https://ist.ac.at/en/news/proteins-as-molecular-switches/","description":"News on IST Homepage","relation":"press_release"}]},"pmid":1,"publication_status":"published","publication_identifier":{"eissn":["1091-6490"],"issn":["0027-8424"]},"oa_version":"Preprint","title":"Stochastic activation and bistability in a Rab GTPase regulatory network","date_created":"2020-03-12T05:32:26Z","isi":1,"acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"}],"date_updated":"2026-04-08T07:24:55Z","publication":"Proceedings of the National Academy of Sciences of the United States of America","status":"public","page":"6504-6549","scopus_import":"1","issue":"12","quality_controlled":"1","type":"journal_article","external_id":{"pmid":["32161136"],"isi":["000521821800040"]},"abstract":[{"text":"The eukaryotic endomembrane system is controlled by small GTPases of the Rab family, which are activated at defined times and locations in a switch-like manner. While this switch is well understood for an individual protein, how regulatory networks produce intracellular activity patterns is currently not known. Here, we combine in vitro reconstitution experiments with computational modeling to study a minimal Rab5 activation network. We find that the molecular interactions in this system give rise to a positive feedback and bistable collective switching of Rab5. Furthermore, we find that switching near the critical point is intrinsically stochastic and provide evidence that controlling the inactive population of Rab5 on the membrane can shape the network response. Notably, we demonstrate that collective switching can spread on the membrane surface as a traveling wave of Rab5 activation. Together, our findings reveal how biochemical signaling networks control vesicle trafficking pathways and how their nonequilibrium properties define the spatiotemporal organization of the cell.","lang":"eng"}],"_id":"7580","language":[{"iso":"eng"}],"citation":{"ista":"Bezeljak U, Loya H, Kaczmarek BM, Saunders TE, Loose M. 2020. Stochastic activation and bistability in a Rab GTPase regulatory network. Proceedings of the National Academy of Sciences of the United States of America. 117(12), 6504–6549.","ama":"Bezeljak U, Loya H, Kaczmarek BM, Saunders TE, Loose M. Stochastic activation and bistability in a Rab GTPase regulatory network. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. 2020;117(12):6504-6549. doi:<a href=\"https://doi.org/10.1073/pnas.1921027117\">10.1073/pnas.1921027117</a>","chicago":"Bezeljak, Urban, Hrushikesh Loya, Beata M Kaczmarek, Timothy E. Saunders, and Martin Loose. “Stochastic Activation and Bistability in a Rab GTPase Regulatory Network.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>. National Academy of Sciences, 2020. <a href=\"https://doi.org/10.1073/pnas.1921027117\">https://doi.org/10.1073/pnas.1921027117</a>.","ieee":"U. Bezeljak, H. Loya, B. M. Kaczmarek, T. E. Saunders, and M. Loose, “Stochastic activation and bistability in a Rab GTPase regulatory network,” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 117, no. 12. National Academy of Sciences, pp. 6504–6549, 2020.","short":"U. Bezeljak, H. Loya, B.M. Kaczmarek, T.E. Saunders, M. Loose, Proceedings of the National Academy of Sciences of the United States of America 117 (2020) 6504–6549.","mla":"Bezeljak, Urban, et al. “Stochastic Activation and Bistability in a Rab GTPase Regulatory Network.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 117, no. 12, National Academy of Sciences, 2020, pp. 6504–49, doi:<a href=\"https://doi.org/10.1073/pnas.1921027117\">10.1073/pnas.1921027117</a>.","apa":"Bezeljak, U., Loya, H., Kaczmarek, B. M., Saunders, T. E., &#38; Loose, M. (2020). Stochastic activation and bistability in a Rab GTPase regulatory network. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1921027117\">https://doi.org/10.1073/pnas.1921027117</a>"},"day":"24","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2020","intvolume":"       117","main_file_link":[{"url":"https://doi.org/10.1101/776567","open_access":"1"}],"date_published":"2020-03-24T00:00:00Z"},{"language":[{"iso":"eng"}],"_id":"7675","abstract":[{"text":"In prokaryotes, thermodynamic models of gene regulation provide a highly quantitative mapping from promoter sequences to gene expression levels that is compatible with in vivo and in vitro bio-physical measurements. Such concordance has not been achieved for models of enhancer function in eukaryotes. In equilibrium models, it is difficult to reconcile the reported short transcription factor (TF) residence times on the DNA with the high specificity of regulation. In non-equilibrium models, progress is difficult due to an explosion in the number of parameters. Here, we navigate this complexity by looking for minimal non-equilibrium enhancer models that yield desired regulatory phenotypes: low TF residence time, high specificity and tunable cooperativity. We find that a single extra parameter, interpretable as the “linking rate” by which bound TFs interact with Mediator components, enables our models to escape equilibrium bounds and access optimal regulatory phenotypes, while remaining consistent with the reported phenomenology and simple enough to be inferred from upcoming experiments. We further find that high specificity in non-equilibrium models is in a tradeoff with gene expression noise, predicting bursty dynamics — an experimentally-observed hallmark of eukaryotic transcription. By drastically reducing the vast parameter space to a much smaller subspace that optimally realizes biological function prior to inference from data, our normative approach holds promise for mathematical models in systems biology.","lang":"eng"}],"type":"preprint","publication_status":"published","citation":{"mla":"Grah, Rok, et al. “Normative Models of Enhancer Function.” <i>BioRxiv</i>, Cold Spring Harbor Laboratory, 2020, doi:<a href=\"https://doi.org/10.1101/2020.04.08.029405\">10.1101/2020.04.08.029405</a>.","ieee":"R. Grah, B. Zoller, and G. Tkačik, “Normative models of enhancer function,” <i>bioRxiv</i>. Cold Spring Harbor Laboratory, 2020.","short":"R. Grah, B. Zoller, G. Tkačik, BioRxiv (2020).","apa":"Grah, R., Zoller, B., &#38; Tkačik, G. (2020). Normative models of enhancer function. <i>bioRxiv</i>. Cold Spring Harbor Laboratory. <a href=\"https://doi.org/10.1101/2020.04.08.029405\">https://doi.org/10.1101/2020.04.08.029405</a>","ama":"Grah R, Zoller B, Tkačik G. Normative models of enhancer function. <i>bioRxiv</i>. 2020. doi:<a href=\"https://doi.org/10.1101/2020.04.08.029405\">10.1101/2020.04.08.029405</a>","ista":"Grah R, Zoller B, Tkačik G. 2020. Normative models of enhancer function. bioRxiv, <a href=\"https://doi.org/10.1101/2020.04.08.029405\">10.1101/2020.04.08.029405</a>.","chicago":"Grah, Rok, Benjamin Zoller, and Gašper Tkačik. “Normative Models of Enhancer Function.” <i>BioRxiv</i>. Cold Spring Harbor Laboratory, 2020. <a href=\"https://doi.org/10.1101/2020.04.08.029405\">https://doi.org/10.1101/2020.04.08.029405</a>."},"day":"09","year":"2020","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2020-04-09T00:00:00Z","title":"Normative models of enhancer function","date_created":"2020-04-23T10:12:51Z","oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1101/2020.04.08.029405 "}],"doi":"10.1101/2020.04.08.029405","oa":1,"date_updated":"2026-04-08T07:25:08Z","publication":"bioRxiv","author":[{"full_name":"Grah, Rok","last_name":"Grah","first_name":"Rok","id":"483E70DE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2539-3560"},{"last_name":"Zoller","full_name":"Zoller, Benjamin","first_name":"Benjamin"},{"id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","first_name":"Gašper","orcid":"0000-0002-6699-1455","full_name":"Tkačik, Gašper","last_name":"Tkačik"}],"project":[{"_id":"2665AAFE-B435-11E9-9278-68D0E5697425","grant_number":"RGP0034/2018","name":"Can evolution minimize spurious signaling crosstalk to reach optimal performance?"},{"name":"Biophysically realistic genotype-phenotype maps for regulatory networks","_id":"267C84F4-B435-11E9-9278-68D0E5697425"}],"month":"04","department":[{"_id":"CaGu"},{"_id":"GaTk"}],"corr_author":"1","article_processing_charge":"No","publisher":"Cold Spring Harbor Laboratory","status":"public","related_material":{"record":[{"status":"public","id":"8155","relation":"dissertation_contains"}]}},{"author":[{"last_name":"Guseinov","full_name":"Guseinov, Ruslan","orcid":"0000-0001-9819-5077","id":"3AB45EE2-F248-11E8-B48F-1D18A9856A87","first_name":"Ruslan"}],"month":"09","department":[{"_id":"BeBi"}],"project":[{"name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","grant_number":"715767","call_identifier":"H2020","_id":"24F9549A-B435-11E9-9278-68D0E5697425"}],"oa":1,"doi":"10.15479/AT:ISTA:8366","acknowledgement":"During the work on this thesis, I received substantial support from IST Austria’s scientific service units. A big thank you to Todor Asenov and other Miba Machine Shop team members for their help with fabrication of experimental prototypes. In addition, I would like to thank Scientific Computing team for the support with high performance computing.\r\nFinancial support was provided by the European Research Council (ERC) under grant agreement No 715767 - MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling, which I gratefully acknowledge.","degree_awarded":"PhD","related_material":{"record":[{"status":"public","id":"8562","relation":"part_of_dissertation"},{"id":"8375","status":"public","relation":"research_data"},{"relation":"research_data","id":"7151","status":"deleted"},{"status":"public","id":"1001","relation":"part_of_dissertation"},{"id":"7262","status":"public","relation":"part_of_dissertation"}]},"article_processing_charge":"No","corr_author":"1","publisher":"Institute of Science and Technology Austria","file":[{"checksum":"f8da89553da36037296b0a80f14ebf50","file_name":"thesis_rguseinov.pdf","date_updated":"2020-09-10T16:11:49Z","relation":"main_file","creator":"rguseino","file_id":"8367","access_level":"open_access","content_type":"application/pdf","success":1,"file_size":70950442,"date_created":"2020-09-10T16:11:49Z"},{"access_level":"closed","date_created":"2020-09-11T09:39:48Z","file_size":76207597,"content_type":"application/x-zip-compressed","file_name":"thesis_source.zip","checksum":"e8fd944c960c20e0e27e6548af69121d","date_updated":"2020-09-16T15:11:01Z","relation":"source_file","creator":"rguseino","file_id":"8374"}],"supervisor":[{"first_name":"Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","last_name":"Bickel","full_name":"Bickel, Bernd"}],"publication_status":"published","date_created":"2020-09-10T16:19:55Z","alternative_title":["ISTA Thesis"],"title":"Computational design of curved thin shells: From glass façades to programmable matter","oa_version":"Published Version","keyword":["computer-aided design","shape modeling","self-morphing","mechanical engineering"],"publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-010-7"]},"date_updated":"2026-04-08T07:25:22Z","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"ScienComp"}],"file_date_updated":"2020-09-16T15:11:01Z","ec_funded":1,"status":"public","page":"118","day":"21","citation":{"chicago":"Guseinov, Ruslan. “Computational Design of Curved Thin Shells: From Glass Façades to Programmable Matter.” Institute of Science and Technology Austria, 2020. <a href=\"https://doi.org/10.15479/AT:ISTA:8366\">https://doi.org/10.15479/AT:ISTA:8366</a>.","ama":"Guseinov R. Computational design of curved thin shells: From glass façades to programmable matter. 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8366\">10.15479/AT:ISTA:8366</a>","ista":"Guseinov R. 2020. Computational design of curved thin shells: From glass façades to programmable matter. Institute of Science and Technology Austria.","apa":"Guseinov, R. (2020). <i>Computational design of curved thin shells: From glass façades to programmable matter</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:8366\">https://doi.org/10.15479/AT:ISTA:8366</a>","mla":"Guseinov, Ruslan. <i>Computational Design of Curved Thin Shells: From Glass Façades to Programmable Matter</i>. Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8366\">10.15479/AT:ISTA:8366</a>.","ieee":"R. Guseinov, “Computational design of curved thin shells: From glass façades to programmable matter,” Institute of Science and Technology Austria, 2020.","short":"R. Guseinov, Computational Design of Curved Thin Shells: From Glass Façades to Programmable Matter, Institute of Science and Technology Austria, 2020."},"has_accepted_license":"1","language":[{"iso":"eng"}],"_id":"8366","abstract":[{"lang":"eng","text":"Fabrication of curved shells plays an important role in modern design, industry, and science. Among their remarkable properties are, for example, aesthetics of organic shapes, ability to evenly distribute loads, or efficient flow separation. They find applications across vast length scales ranging from sky-scraper architecture to microscopic devices. But, at\r\nthe same time, the design of curved shells and their manufacturing process pose a variety of challenges. In this thesis, they are addressed from several perspectives. In particular, this thesis presents approaches based on the transformation of initially flat sheets into the target curved surfaces. This involves problems of interactive design of shells with nontrivial mechanical constraints, inverse design of complex structural materials, and data-driven modeling of delicate and time-dependent physical properties. At the same time, two newly-developed self-morphing mechanisms targeting flat-to-curved transformation are presented.\r\nIn architecture, doubly curved surfaces can be realized as cold bent glass panelizations. Originally flat glass panels are bent into frames and remain stressed. This is a cost-efficient fabrication approach compared to hot bending, when glass panels are shaped plastically. However such constructions are prone to breaking during bending, and it is highly\r\nnontrivial to navigate the design space, keeping the panels fabricable and aesthetically pleasing at the same time. We introduce an interactive design system for cold bent glass façades, while previously even offline optimization for such scenarios has not been sufficiently developed. Our method is based on a deep learning approach providing quick\r\nand high precision estimation of glass panel shape and stress while handling the shape\r\nmultimodality.\r\nFabrication of smaller objects of scales below 1 m, can also greatly benefit from shaping originally flat sheets. In this respect, we designed new self-morphing shell mechanisms transforming from an initial flat state to a doubly curved state with high precision and detail. Our so-called CurveUps demonstrate the encodement of the geometric information\r\ninto the shell. Furthermore, we explored the frontiers of programmable materials and showed how temporal information can additionally be encoded into a flat shell. This allows prescribing deformation sequences for doubly curved surfaces and, thus, facilitates self-collision avoidance enabling complex shapes and functionalities otherwise impossible.\r\nBoth of these methods include inverse design tools keeping the user in the design loop."}],"type":"dissertation","OA_place":"publisher","date_published":"2020-09-21T00:00:00Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","ddc":["000"],"year":"2020"},{"file_date_updated":"2023-05-23T20:54:43Z","date_updated":"2026-04-08T07:25:22Z","publication":"ACM Transactions on Graphics","acknowledged_ssus":[{"_id":"ScienComp"}],"isi":1,"status":"public","ec_funded":1,"issue":"6","scopus_import":"1","_id":"8562","language":[{"iso":"eng"}],"abstract":[{"text":"Cold bent glass is a promising and cost-efficient method for realizing doubly curved glass facades. They are produced by attaching planar glass sheets to curved frames and require keeping the occurring stress within safe limits.\r\nHowever, it is very challenging to navigate the design space of cold bent glass panels due to the fragility of the material, which impedes the form-finding for practically feasible and aesthetically pleasing cold bent glass facades. We propose an interactive, data-driven approach for designing cold bent glass facades that can be seamlessly integrated into a typical architectural design pipeline. Our method allows non-expert users to interactively edit a parametric surface while providing real-time feedback on the deformed shape and maximum stress of cold bent glass panels. Designs are automatically refined to minimize several fairness criteria while maximal stresses are kept within glass limits. We achieve interactive frame rates by using a differentiable Mixture Density Network trained from more than a million simulations. Given a curved boundary, our regression model is capable of handling multistable\r\nconfigurations and accurately predicting the equilibrium shape of the panel and its corresponding maximal stress. We show predictions are highly accurate and validate our results with a physical realization of a cold bent glass surface.","lang":"eng"}],"external_id":{"isi":["000595589100048"],"arxiv":["2009.03667"]},"type":"journal_article","quality_controlled":"1","has_accepted_license":"1","citation":{"mla":"Gavriil, Konstantinos, et al. “Computational Design of Cold Bent Glass Façades.” <i>ACM Transactions on Graphics</i>, vol. 39, no. 6, 208, Association for Computing Machinery, 2020, doi:<a href=\"https://doi.org/10.1145/3414685.3417843\">10.1145/3414685.3417843</a>.","ieee":"K. Gavriil <i>et al.</i>, “Computational design of cold bent glass façades,” <i>ACM Transactions on Graphics</i>, vol. 39, no. 6. Association for Computing Machinery, 2020.","short":"K. Gavriil, R. Guseinov, J. Perez Rodriguez, D. Pellis, P.M. Henderson, F. Rist, H. Pottmann, B. Bickel, ACM Transactions on Graphics 39 (2020).","apa":"Gavriil, K., Guseinov, R., Perez Rodriguez, J., Pellis, D., Henderson, P. M., Rist, F., … Bickel, B. (2020). Computational design of cold bent glass façades. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3414685.3417843\">https://doi.org/10.1145/3414685.3417843</a>","ama":"Gavriil K, Guseinov R, Perez Rodriguez J, et al. Computational design of cold bent glass façades. <i>ACM Transactions on Graphics</i>. 2020;39(6). doi:<a href=\"https://doi.org/10.1145/3414685.3417843\">10.1145/3414685.3417843</a>","ista":"Gavriil K, Guseinov R, Perez Rodriguez J, Pellis D, Henderson PM, Rist F, Pottmann H, Bickel B. 2020. Computational design of cold bent glass façades. ACM Transactions on Graphics. 39(6), 208.","chicago":"Gavriil, Konstantinos, Ruslan Guseinov, Jesus Perez Rodriguez, Davide Pellis, Paul M Henderson, Florian Rist, Helmut Pottmann, and Bernd Bickel. “Computational Design of Cold Bent Glass Façades.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3414685.3417843\">https://doi.org/10.1145/3414685.3417843</a>."},"day":"26","article_number":"208","intvolume":"        39","year":"2020","ddc":["000"],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_published":"2020-11-26T00:00:00Z","acknowledgement":"We thank IST Austria’s Scientific Computing team for their support, Corinna Datsiou and Sophie Pennetier for their expert input on the practical applications of cold bent glass, and Zaha Hadid Architects and Waagner Biro for providing the architectural datasets. Photo of Fondation Louis Vuitton by Francisco Anzola / CC BY 2.0 / cropped.\r\nPhoto of Opus by Danica O. Kus. This project has received funding from the European Union’s\r\nHorizon 2020 research and innovation program under grant agreement No 675789 - Algebraic Representations in Computer-Aided Design for complEx Shapes (ARCADES), from the European Research Council (ERC) under grant agreement No 715767 - MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling, and SFB-Transregio “Discretization in Geometry and Dynamics” through grant I 2978 of the Austrian Science Fund (FWF). F. Rist and K. Gavriil have been partially supported by KAUST baseline funding.","oa":1,"doi":"10.1145/3414685.3417843","volume":39,"author":[{"full_name":"Gavriil, Konstantinos","last_name":"Gavriil","first_name":"Konstantinos"},{"first_name":"Ruslan","id":"3AB45EE2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9819-5077","full_name":"Guseinov, Ruslan","last_name":"Guseinov"},{"last_name":"Perez Rodriguez","full_name":"Perez Rodriguez, Jesus","id":"2DC83906-F248-11E8-B48F-1D18A9856A87","first_name":"Jesus"},{"last_name":"Pellis","full_name":"Pellis, Davide","first_name":"Davide"},{"first_name":"Paul M","id":"13C09E74-18D9-11E9-8878-32CFE5697425","orcid":"0000-0002-5198-7445","last_name":"Henderson","full_name":"Henderson, Paul M"},{"full_name":"Rist, Florian","last_name":"Rist","first_name":"Florian"},{"first_name":"Helmut","full_name":"Pottmann, Helmut","last_name":"Pottmann"},{"last_name":"Bickel","full_name":"Bickel, Bernd","first_name":"Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385"}],"article_type":"original","project":[{"name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","call_identifier":"H2020","_id":"24F9549A-B435-11E9-9278-68D0E5697425","grant_number":"715767"}],"department":[{"_id":"BeBi"}],"month":"11","corr_author":"1","article_processing_charge":"No","publisher":"Association for Computing Machinery","related_material":{"record":[{"relation":"research_data","status":"public","id":"8761"},{"status":"public","id":"8366","relation":"dissertation_contains"}],"link":[{"url":"https://ist.ac.at/en/news/bend-dont-break/","relation":"press_release","description":"News on IST Homepage"}]},"publication_status":"published","file":[{"file_name":"coldglass.pdf","checksum":"c7f67717ad74e670b7daeae732abe151","creator":"bbickel","relation":"main_file","file_id":"13084","date_updated":"2023-05-23T20:54:43Z","access_level":"open_access","file_size":28964641,"date_created":"2023-05-23T20:54:43Z","success":1,"content_type":"application/pdf"}],"publication_identifier":{"issn":["0730-0301"],"eissn":["1557-7368"]},"arxiv":1,"title":"Computational design of cold bent glass façades","date_created":"2020-09-23T11:30:02Z","oa_version":"Submitted Version"},{"keyword":["Design","Synthesis and processing","Mechanical engineering","Polymers"],"publication_identifier":{"issn":["2041-1723"]},"oa_version":"Published Version","date_created":"2020-01-13T16:54:26Z","title":"Programming temporal morphing of self-actuated shells","publication_status":"published","file":[{"creator":"rguseino","relation":"main_file","file_id":"7336","date_updated":"2020-07-14T12:47:55Z","checksum":"7db23fef2f4cda712f17f1004116ddff","file_name":"2020_NatureComm_Guseinov.pdf","content_type":"application/pdf","file_size":1315270,"date_created":"2020-01-15T14:35:34Z","access_level":"open_access"}],"publisher":"Springer Nature","article_processing_charge":"No","corr_author":"1","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"related_material":{"link":[{"description":"News on IST Homepage","relation":"press_release","url":"https://ist.ac.at/en/news/geometry-meets-time/"}],"record":[{"relation":"research_data","status":"public","id":"7154"},{"id":"8366","status":"public","relation":"dissertation_contains"}]},"pmid":1,"doi":"10.1038/s41467-019-14015-2","oa":1,"department":[{"_id":"BeBi"}],"month":"01","project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships"},{"name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","grant_number":"715767","call_identifier":"H2020","_id":"24F9549A-B435-11E9-9278-68D0E5697425"}],"article_type":"original","author":[{"first_name":"Ruslan","id":"3AB45EE2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9819-5077","full_name":"Guseinov, Ruslan","last_name":"Guseinov"},{"full_name":"McMahan, Connor","last_name":"McMahan","first_name":"Connor"},{"last_name":"Perez Rodriguez","full_name":"Perez Rodriguez, Jesus","id":"2DC83906-F248-11E8-B48F-1D18A9856A87","first_name":"Jesus"},{"first_name":"Chiara","last_name":"Daraio","full_name":"Daraio, Chiara"},{"full_name":"Bickel, Bernd","last_name":"Bickel","first_name":"Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385"}],"volume":11,"ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2020","article_number":"237","intvolume":"        11","date_published":"2020-01-13T00:00:00Z","quality_controlled":"1","type":"journal_article","external_id":{"isi":["000511916800015"],"pmid":["31932589"]},"_id":"7262","language":[{"iso":"eng"}],"abstract":[{"text":"Advances in shape-morphing materials, such as hydrogels, shape-memory polymers and light-responsive polymers have enabled prescribing self-directed deformations of initially flat geometries. However, most proposed solutions evolve towards a target geometry without considering time-dependent actuation paths. To achieve more complex geometries and avoid self-collisions, it is critical to encode a spatial and temporal shape evolution within the initially flat shell. Recent realizations of time-dependent morphing are limited to the actuation of few, discrete hinges and cannot form doubly curved surfaces. Here, we demonstrate a method for encoding temporal shape evolution in architected shells that assume complex shapes and doubly curved geometries. The shells are non-periodic tessellations of pre-stressed contractile unit cells that soften in water at rates prescribed locally by mesostructure geometry. The ensuing midplane contraction is coupled to the formation of encoded curvatures. We propose an inverse design tool based on a data-driven model for unit cells’ temporal responses.","lang":"eng"}],"day":"13","citation":{"mla":"Guseinov, Ruslan, et al. “Programming Temporal Morphing of Self-Actuated Shells.” <i>Nature Communications</i>, vol. 11, 237, Springer Nature, 2020, doi:<a href=\"https://doi.org/10.1038/s41467-019-14015-2\">10.1038/s41467-019-14015-2</a>.","ieee":"R. Guseinov, C. McMahan, J. Perez Rodriguez, C. Daraio, and B. Bickel, “Programming temporal morphing of self-actuated shells,” <i>Nature Communications</i>, vol. 11. Springer Nature, 2020.","short":"R. Guseinov, C. McMahan, J. Perez Rodriguez, C. Daraio, B. Bickel, Nature Communications 11 (2020).","apa":"Guseinov, R., McMahan, C., Perez Rodriguez, J., Daraio, C., &#38; Bickel, B. (2020). Programming temporal morphing of self-actuated shells. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-019-14015-2\">https://doi.org/10.1038/s41467-019-14015-2</a>","ama":"Guseinov R, McMahan C, Perez Rodriguez J, Daraio C, Bickel B. Programming temporal morphing of self-actuated shells. <i>Nature Communications</i>. 2020;11. doi:<a href=\"https://doi.org/10.1038/s41467-019-14015-2\">10.1038/s41467-019-14015-2</a>","ista":"Guseinov R, McMahan C, Perez Rodriguez J, Daraio C, Bickel B. 2020. Programming temporal morphing of self-actuated shells. Nature Communications. 11, 237.","chicago":"Guseinov, Ruslan, Connor McMahan, Jesus Perez Rodriguez, Chiara Daraio, and Bernd Bickel. “Programming Temporal Morphing of Self-Actuated Shells.” <i>Nature Communications</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1038/s41467-019-14015-2\">https://doi.org/10.1038/s41467-019-14015-2</a>."},"has_accepted_license":"1","status":"public","scopus_import":"1","ec_funded":1,"file_date_updated":"2020-07-14T12:47:55Z","isi":1,"date_updated":"2026-04-08T07:25:22Z","publication":"Nature Communications"},{"author":[{"full_name":"Mayer, Simon","last_name":"Mayer","first_name":"Simon","id":"30C4630A-F248-11E8-B48F-1D18A9856A87"}],"department":[{"_id":"RoSe"},{"_id":"GradSch"}],"month":"02","project":[{"name":"Analysis of quantum many-body systems","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"694227"}],"doi":"10.15479/AT:ISTA:7514","oa":1,"degree_awarded":"PhD","related_material":{"record":[{"status":"public","id":"7524","relation":"part_of_dissertation"}]},"article_processing_charge":"No","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"corr_author":"1","publisher":"Institute of Science and Technology Austria","file":[{"relation":"main_file","date_updated":"2020-07-14T12:47:59Z","creator":"dernst","file_id":"7515","checksum":"b4de7579ddc1dbdd44ff3f17c48395f6","file_name":"thesis.pdf","content_type":"application/pdf","file_size":1563429,"date_created":"2020-02-24T09:15:06Z","access_level":"open_access"},{"checksum":"ad7425867b52d7d9e72296e87bc9cb67","file_name":"thesis_source.zip","creator":"dernst","file_id":"7516","date_updated":"2020-07-14T12:47:59Z","relation":"source_file","access_level":"closed","content_type":"application/x-zip-compressed","date_created":"2020-02-24T09:15:16Z","file_size":2028038}],"supervisor":[{"id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert","orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert","last_name":"Seiringer"}],"publication_status":"published","date_created":"2020-02-24T09:17:27Z","alternative_title":["ISTA Thesis"],"title":"The free energy of a dilute two-dimensional Bose gas","oa_version":"Published Version","publication_identifier":{"issn":["2663-337X"]},"date_updated":"2026-04-08T07:25:40Z","file_date_updated":"2020-07-14T12:47:59Z","ec_funded":1,"status":"public","page":"148","day":"24","citation":{"mla":"Mayer, Simon. <i>The Free Energy of a Dilute Two-Dimensional Bose Gas</i>. Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:7514\">10.15479/AT:ISTA:7514</a>.","ieee":"S. Mayer, “The free energy of a dilute two-dimensional Bose gas,” Institute of Science and Technology Austria, 2020.","short":"S. Mayer, The Free Energy of a Dilute Two-Dimensional Bose Gas, Institute of Science and Technology Austria, 2020.","apa":"Mayer, S. (2020). <i>The free energy of a dilute two-dimensional Bose gas</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:7514\">https://doi.org/10.15479/AT:ISTA:7514</a>","ama":"Mayer S. The free energy of a dilute two-dimensional Bose gas. 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:7514\">10.15479/AT:ISTA:7514</a>","ista":"Mayer S. 2020. The free energy of a dilute two-dimensional Bose gas. Institute of Science and Technology Austria.","chicago":"Mayer, Simon. “The Free Energy of a Dilute Two-Dimensional Bose Gas.” Institute of Science and Technology Austria, 2020. <a href=\"https://doi.org/10.15479/AT:ISTA:7514\">https://doi.org/10.15479/AT:ISTA:7514</a>."},"has_accepted_license":"1","_id":"7514","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"We study the interacting homogeneous Bose gas in two spatial dimensions in the thermodynamic limit at fixed density. We shall be concerned with some mathematical aspects of this complicated problem in many-body quantum mechanics. More specifically, we consider the dilute limit where the scattering length of the interaction potential, which is a measure for the effective range of the potential, is small compared to the average distance between the particles. We are interested in a setting with positive (i.e., non-zero) temperature. After giving a survey of the relevant literature in the field, we provide some facts and examples to set expectations for the two-dimensional system. The crucial difference to the three-dimensional system is that there is no Bose–Einstein condensate at positive temperature due to the Hohenberg–Mermin–Wagner theorem. However, it turns out that an asymptotic formula for the free energy holds similarly to the three-dimensional case.\r\nWe motivate this formula by considering a toy model with δ interaction potential. By restricting this model Hamiltonian to certain trial states with a quasi-condensate we obtain an upper bound for the free energy that still has the quasi-condensate fraction as a free parameter. When minimizing over the quasi-condensate fraction, we obtain the Berezinskii–Kosterlitz–Thouless critical temperature for superfluidity, which plays an important role in our rigorous contribution. The mathematically rigorous result that we prove concerns the specific free energy in the dilute limit. We give upper and lower bounds on the free energy in terms of the free energy of the non-interacting system and a correction term coming from the interaction. Both bounds match and thus we obtain the leading term of an asymptotic approximation in the dilute limit, provided the thermal wavelength of the particles is of the same order (or larger) than the average distance between the particles. The remarkable feature of this result is its generality: the correction term depends on the interaction potential only through its scattering length and it holds for all nonnegative interaction potentials with finite scattering length that are measurable. In particular, this allows to model an interaction of hard disks."}],"type":"dissertation","OA_place":"publisher","date_published":"2020-02-24T00:00:00Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","ddc":["510"],"year":"2020"},{"file_date_updated":"2020-09-11T09:52:36Z","doi":"10.15479/AT:ISTA:8375","oa":1,"month":"09","department":[{"_id":"BeBi"}],"project":[{"name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","_id":"24F9549A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"715767"}],"author":[{"last_name":"Guseinov","full_name":"Guseinov, Ruslan","orcid":"0000-0001-9819-5077","id":"3AB45EE2-F248-11E8-B48F-1D18A9856A87","first_name":"Ruslan"}],"date_updated":"2026-04-08T07:25:22Z","status":"public","publisher":"Institute of Science and Technology Austria","article_processing_charge":"No","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"corr_author":"1","related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"8366"}]},"ec_funded":1,"type":"research_data","contributor":[{"id":"3AB45EE2-F248-11E8-B48F-1D18A9856A87","first_name":"Ruslan","orcid":"0000-0001-9819-5077","last_name":"Guseinov","contributor_type":"researcher"},{"first_name":"Connor","contributor_type":"researcher","last_name":"McMahan"},{"last_name":"Perez Rodriguez","contributor_type":"researcher","first_name":"Jesus","id":"2DC83906-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Chiara","last_name":"Daraio","contributor_type":"researcher"},{"orcid":"0000-0001-6511-9385","id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd","contributor_type":"researcher","last_name":"Bickel"}],"_id":"8375","abstract":[{"text":"Supplementary movies showing the following sequences for spatio-temporarily programmed shells: input geometry and actuation time landscape; comparison of morphing processes from a camera recording and a simulation; final actuated shape.","lang":"eng"}],"file":[{"relation":"main_file","creator":"rguseino","file_id":"8376","date_updated":"2020-09-11T09:45:21Z","file_name":"supplementary_movie_1.mp4","checksum":"4029ffd65fb82ef2366b2fc2a4908e16","file_size":29214988,"date_created":"2020-09-11T09:45:21Z","success":1,"content_type":"video/mp4","access_level":"open_access"},{"checksum":"8ed03b04d80f1a4e622cb22e6100afd8","file_name":"supplementary_movie_2.mp4","relation":"main_file","date_updated":"2020-09-11T09:45:25Z","creator":"rguseino","file_id":"8377","access_level":"open_access","content_type":"video/mp4","success":1,"date_created":"2020-09-11T09:45:25Z","file_size":28449475},{"creator":"rguseino","date_updated":"2020-09-11T09:45:28Z","relation":"main_file","file_id":"8378","checksum":"ad6864afb5e694e5c52a88fba4e02eea","file_name":"supplementary_movie_3.mp4","success":1,"content_type":"video/mp4","file_size":26315853,"date_created":"2020-09-11T09:45:28Z","access_level":"open_access"},{"date_created":"2020-09-11T09:45:33Z","file_size":25198755,"success":1,"content_type":"video/mp4","access_level":"open_access","creator":"rguseino","file_id":"8379","relation":"main_file","date_updated":"2020-09-11T09:45:33Z","file_name":"supplementary_movie_4.mp4","checksum":"b079cef7871fe1afb69af0e2b099f3b1"},{"date_updated":"2020-09-11T09:45:36Z","creator":"rguseino","relation":"main_file","file_id":"8380","checksum":"9d1d48a8ed5c109a999c51b044ee523d","file_name":"supplementary_movie_5.mp4","content_type":"video/mp4","success":1,"date_created":"2020-09-11T09:45:36Z","file_size":29011354,"access_level":"open_access"},{"relation":"main_file","date_updated":"2020-09-11T09:52:36Z","file_id":"8381","creator":"rguseino","checksum":"d414d0059e982d752d218756b3c3ce05","file_name":"readme.txt","success":1,"content_type":"text/plain","date_created":"2020-09-11T09:52:36Z","file_size":586,"access_level":"open_access"}],"citation":{"apa":"Guseinov, R. (2020). Supplementary data for “Computational design of curved thin shells: from glass façades to programmable matter.” Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:8375\">https://doi.org/10.15479/AT:ISTA:8375</a>","mla":"Guseinov, Ruslan. <i>Supplementary Data for “Computational Design of Curved Thin Shells: From Glass Façades to Programmable Matter.”</i> Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8375\">10.15479/AT:ISTA:8375</a>.","short":"R. Guseinov, (2020).","ieee":"R. Guseinov, “Supplementary data for ‘Computational design of curved thin shells: from glass façades to programmable matter.’” Institute of Science and Technology Austria, 2020.","chicago":"Guseinov, Ruslan. “Supplementary Data for ‘Computational Design of Curved Thin Shells: From Glass Façades to Programmable Matter.’” Institute of Science and Technology Austria, 2020. <a href=\"https://doi.org/10.15479/AT:ISTA:8375\">https://doi.org/10.15479/AT:ISTA:8375</a>.","ama":"Guseinov R. Supplementary data for “Computational design of curved thin shells: from glass façades to programmable matter.” 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8375\">10.15479/AT:ISTA:8375</a>","ista":"Guseinov R. 2020. Supplementary data for ‘Computational design of curved thin shells: from glass façades to programmable matter’, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:8375\">10.15479/AT:ISTA:8375</a>."},"day":"21","has_accepted_license":"1","ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2020","oa_version":"Published Version","title":"Supplementary data for \"Computational design of curved thin shells: from glass façades to programmable matter\"","date_created":"2020-09-11T09:52:54Z","date_published":"2020-09-21T00:00:00Z"},{"file_date_updated":"2020-07-27T12:46:53Z","date_updated":"2026-04-08T07:25:54Z","status":"public","page":"119","type":"dissertation","language":[{"iso":"eng"}],"_id":"8156","abstract":[{"lang":"eng","text":"We present solutions to several problems originating from geometry and discrete mathematics: existence of equipartitions, maps without Tverberg multiple points, and inscribing quadrilaterals. Equivariant obstruction theory is the natural topological approach to these type of questions. However, for the specific problems we consider it had yielded only partial or no results. We get our results by complementing equivariant obstruction theory with other techniques from topology and geometry."}],"citation":{"apa":"Avvakumov, S. (2020). <i>Topological methods in geometry and discrete mathematics</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:8156\">https://doi.org/10.15479/AT:ISTA:8156</a>","short":"S. Avvakumov, Topological Methods in Geometry and Discrete Mathematics, Institute of Science and Technology Austria, 2020.","ieee":"S. Avvakumov, “Topological methods in geometry and discrete mathematics,” Institute of Science and Technology Austria, 2020.","mla":"Avvakumov, Sergey. <i>Topological Methods in Geometry and Discrete Mathematics</i>. Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8156\">10.15479/AT:ISTA:8156</a>.","chicago":"Avvakumov, Sergey. “Topological Methods in Geometry and Discrete Mathematics.” Institute of Science and Technology Austria, 2020. <a href=\"https://doi.org/10.15479/AT:ISTA:8156\">https://doi.org/10.15479/AT:ISTA:8156</a>.","ista":"Avvakumov S. 2020. Topological methods in geometry and discrete mathematics. Institute of Science and Technology Austria.","ama":"Avvakumov S. Topological methods in geometry and discrete mathematics. 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8156\">10.15479/AT:ISTA:8156</a>"},"day":"24","has_accepted_license":"1","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","ddc":["514"],"year":"2020","OA_place":"publisher","date_published":"2020-07-24T00:00:00Z","doi":"10.15479/AT:ISTA:8156","oa":1,"degree_awarded":"PhD","department":[{"_id":"UlWa"}],"month":"07","author":[{"orcid":"0000-0002-7840-5062","first_name":"Sergey","id":"3827DAC8-F248-11E8-B48F-1D18A9856A87","full_name":"Avvakumov, Sergey","last_name":"Avvakumov"}],"publisher":"Institute of Science and Technology Austria","article_processing_charge":"No","corr_author":"1","related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"8182"},{"status":"public","id":"8184","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"8185","status":"public"},{"relation":"part_of_dissertation","id":"6355","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"75"},{"relation":"part_of_dissertation","status":"public","id":"8183"}]},"publication_status":"published","supervisor":[{"full_name":"Wagner, Uli","last_name":"Wagner","orcid":"0000-0002-1494-0568","first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87"}],"file":[{"access_level":"closed","file_size":1061740,"date_created":"2020-07-27T12:44:51Z","content_type":"application/zip","file_name":"source.zip","file_id":"8178","relation":"source_file","creator":"savvakum","date_updated":"2020-07-27T12:44:51Z"},{"date_updated":"2020-07-27T12:46:53Z","relation":"main_file","creator":"savvakum","file_id":"8179","file_name":"thesis_pdfa.pdf","date_created":"2020-07-27T12:46:53Z","file_size":1336501,"success":1,"content_type":"application/pdf","access_level":"open_access"}],"publication_identifier":{"issn":["2663-337X"]},"oa_version":"Published Version","date_created":"2020-07-23T09:51:29Z","title":"Topological methods in geometry and discrete mathematics","alternative_title":["ISTA Thesis"]},{"publisher":"Institute of Science and Technology Austria","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"corr_author":"1","article_processing_charge":"No","related_material":{"record":[{"status":"public","id":"7197","relation":"part_of_dissertation"},{"relation":"dissertation_contains","id":"7572","status":"public"}]},"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.","degree_awarded":"PhD","doi":"10.15479/AT:ISTA:8358","oa":1,"department":[{"_id":"MaLo"}],"month":"09","author":[{"full_name":"Dos Santos Caldas, Paulo R","last_name":"Dos Santos Caldas","orcid":"0000-0001-6730-4461","id":"38FCDB4C-F248-11E8-B48F-1D18A9856A87","first_name":"Paulo R"}],"publication_identifier":{"isbn":["978-3-99078-009-1"],"issn":["2663-337X"]},"oa_version":"Published Version","date_created":"2020-09-10T09:26:49Z","alternative_title":["ISTA Thesis"],"title":"Organization and dynamics of treadmilling filaments in cytoskeletal networks of FtsZ and its crosslinkers","publication_status":"published","supervisor":[{"full_name":"Loose, Martin","last_name":"Loose","id":"462D4284-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","orcid":"0000-0001-7309-9724"}],"file":[{"access_level":"open_access","content_type":"application/pdf","success":1,"file_size":141602462,"date_created":"2020-09-10T12:11:29Z","checksum":"882f93fe9c351962120e2669b84bf088","file_name":"phd_thesis_pcaldas.pdf","date_updated":"2020-09-10T12:11:29Z","relation":"main_file","file_id":"8364","creator":"pcaldas"},{"access_level":"closed","date_created":"2020-09-10T12:18:17Z","file_size":450437458,"content_type":"application/x-zip-compressed","file_name":"phd_thesis_latex_pcaldas.zip","checksum":"70cc9e399c4e41e6e6ac445ae55e8558","date_updated":"2020-09-11T07:48:10Z","creator":"pcaldas","relation":"source_file","file_id":"8365"}],"page":"135","status":"public","file_date_updated":"2020-09-11T07:48:10Z","acknowledged_ssus":[{"_id":"Bio"}],"date_updated":"2026-04-08T07:26:30Z","year":"2020","ddc":["572"],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_published":"2020-09-10T00:00:00Z","OA_place":"publisher","type":"dissertation","abstract":[{"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","lang":"eng"}],"_id":"8358","language":[{"iso":"eng"}],"has_accepted_license":"1","citation":{"ama":"Dos Santos Caldas PR. Organization and dynamics of treadmilling filaments in cytoskeletal networks of FtsZ and its crosslinkers. 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8358\">10.15479/AT:ISTA:8358</a>","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.","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. <a href=\"https://doi.org/10.15479/AT:ISTA:8358\">https://doi.org/10.15479/AT:ISTA:8358</a>.","mla":"Dos Santos Caldas, Paulo R. <i>Organization and Dynamics of Treadmilling Filaments in Cytoskeletal Networks of FtsZ and Its Crosslinkers</i>. Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8358\">10.15479/AT:ISTA:8358</a>.","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.","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.","apa":"Dos Santos Caldas, P. R. (2020). <i>Organization and dynamics of treadmilling filaments in cytoskeletal networks of FtsZ and its crosslinkers</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:8358\">https://doi.org/10.15479/AT:ISTA:8358</a>"},"day":"10"}]