[{"type":"journal_article","publisher":"eLife Sciences Publications","day":"11","status":"public","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","has_accepted_license":"1","project":[{"grant_number":"724373","_id":"25FE9508-B435-11E9-9278-68D0E5697425","name":"Cellular Navigation Along Spatial Gradients","call_identifier":"H2020"}],"date_published":"2020-05-11T00:00:00Z","year":"2020","oa_version":"Published Version","date_updated":"2026-04-02T14:32:12Z","article_processing_charge":"No","citation":{"apa":"Damiano-Guercio, J., Kurzawa, L., Müller, J., Dimchev, G. A., Schaks, M., Nemethova, M., … Faix, J. (2020). Loss of Ena/VASP interferes with lamellipodium architecture, motility and integrin-dependent adhesion. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/eLife.55351\">https://doi.org/10.7554/eLife.55351</a>","ama":"Damiano-Guercio J, Kurzawa L, Müller J, et al. Loss of Ena/VASP interferes with lamellipodium architecture, motility and integrin-dependent adhesion. <i>eLife</i>. 2020;9. doi:<a href=\"https://doi.org/10.7554/eLife.55351\">10.7554/eLife.55351</a>","ista":"Damiano-Guercio J, Kurzawa L, Müller J, Dimchev GA, Schaks M, Nemethova M, Pokrant T, Brühmann S, Linkner J, Blanchoin L, Sixt MK, Rottner K, Faix J. 2020. Loss of Ena/VASP interferes with lamellipodium architecture, motility and integrin-dependent adhesion. eLife. 9, e55351.","chicago":"Damiano-Guercio, Julia, Laëtitia Kurzawa, Jan Müller, Georgi A Dimchev, Matthias Schaks, Maria Nemethova, Thomas Pokrant, et al. “Loss of Ena/VASP Interferes with Lamellipodium Architecture, Motility and Integrin-Dependent Adhesion.” <i>ELife</i>. eLife Sciences Publications, 2020. <a href=\"https://doi.org/10.7554/eLife.55351\">https://doi.org/10.7554/eLife.55351</a>.","short":"J. Damiano-Guercio, L. Kurzawa, J. Müller, G.A. Dimchev, M. Schaks, M. Nemethova, T. Pokrant, S. Brühmann, J. Linkner, L. Blanchoin, M.K. Sixt, K. Rottner, J. Faix, ELife 9 (2020).","mla":"Damiano-Guercio, Julia, et al. “Loss of Ena/VASP Interferes with Lamellipodium Architecture, Motility and Integrin-Dependent Adhesion.” <i>ELife</i>, vol. 9, e55351, eLife Sciences Publications, 2020, doi:<a href=\"https://doi.org/10.7554/eLife.55351\">10.7554/eLife.55351</a>.","ieee":"J. Damiano-Guercio <i>et al.</i>, “Loss of Ena/VASP interferes with lamellipodium architecture, motility and integrin-dependent adhesion,” <i>eLife</i>, vol. 9. eLife Sciences Publications, 2020."},"_id":"7909","title":"Loss of Ena/VASP interferes with lamellipodium architecture, motility and integrin-dependent adhesion","month":"05","doi":"10.7554/eLife.55351","article_type":"original","ddc":["570"],"file":[{"date_updated":"2020-07-14T12:48:05Z","checksum":"d33bd4441b9a0195718ce1ba5d2c48a6","content_type":"application/pdf","file_size":10535713,"date_created":"2020-06-02T10:35:37Z","file_id":"7914","creator":"dernst","file_name":"2020_eLife_Damiano_Guercio.pdf","relation":"main_file","access_level":"open_access"}],"pmid":1,"oa":1,"publication_identifier":{"eissn":["2050-084X"]},"author":[{"last_name":"Damiano-Guercio","full_name":"Damiano-Guercio, Julia","first_name":"Julia"},{"full_name":"Kurzawa, Laëtitia","last_name":"Kurzawa","first_name":"Laëtitia"},{"first_name":"Jan","id":"AD07FDB4-0F61-11EA-8158-C4CC64CEAA8D","full_name":"Müller, Jan","last_name":"Müller"},{"orcid":"0000-0001-8370-6161","first_name":"Georgi A","id":"38C393BE-F248-11E8-B48F-1D18A9856A87","last_name":"Dimchev","full_name":"Dimchev, Georgi A"},{"first_name":"Matthias","full_name":"Schaks, Matthias","last_name":"Schaks"},{"first_name":"Maria","id":"34E27F1C-F248-11E8-B48F-1D18A9856A87","last_name":"Nemethova","full_name":"Nemethova, Maria"},{"full_name":"Pokrant, Thomas","last_name":"Pokrant","first_name":"Thomas"},{"first_name":"Stefan","last_name":"Brühmann","full_name":"Brühmann, Stefan"},{"first_name":"Joern","last_name":"Linkner","full_name":"Linkner, Joern"},{"full_name":"Blanchoin, Laurent","last_name":"Blanchoin","first_name":"Laurent"},{"orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K","last_name":"Sixt","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","first_name":"Michael K"},{"last_name":"Rottner","full_name":"Rottner, Klemens","first_name":"Klemens"},{"full_name":"Faix, Jan","last_name":"Faix","first_name":"Jan"}],"publication":"eLife","file_date_updated":"2020-07-14T12:48:05Z","scopus_import":"1","ec_funded":1,"isi":1,"intvolume":"         9","abstract":[{"lang":"eng","text":"Cell migration entails networks and bundles of actin filaments termed lamellipodia and microspikes or filopodia, respectively, as well as focal adhesions, all of which recruit Ena/VASP family members hitherto thought to antagonize efficient cell motility. However, we find these proteins to act as positive regulators of migration in different murine cell lines. CRISPR/Cas9-mediated loss of Ena/VASP proteins reduced lamellipodial actin assembly and perturbed lamellipodial architecture, as evidenced by changed network geometry as well as reduction of filament length and number that was accompanied by abnormal Arp2/3 complex and heterodimeric capping protein accumulation. Loss of Ena/VASP function also abolished the formation of microspikes normally embedded in lamellipodia, but not of filopodia capable of emanating without lamellipodia. Ena/VASP-deficiency also impaired integrin-mediated adhesion accompanied by reduced traction forces exerted through these structures. Our data thus uncover novel Ena/VASP functions of these actin polymerases that are fully consistent with their promotion of cell migration."}],"license":"https://creativecommons.org/licenses/by/4.0/","article_number":"e55351","volume":9,"quality_controlled":"1","department":[{"_id":"MiSi"}],"external_id":{"pmid":["32391788"],"isi":["000537208000001"]},"date_created":"2020-05-31T22:00:49Z","language":[{"iso":"eng"}],"publication_status":"published"},{"intvolume":"        11","isi":1,"publication":"Nature Communications","author":[{"first_name":"Magdalena K.","full_name":"Sznurkowska, Magdalena K.","last_name":"Sznurkowska"},{"last_name":"Hannezo","full_name":"Hannezo, Edouard B","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87","first_name":"Edouard B","orcid":"0000-0001-6005-1561"},{"first_name":"Roberta","full_name":"Azzarelli, Roberta","last_name":"Azzarelli"},{"last_name":"Chatzeli","full_name":"Chatzeli, Lemonia","first_name":"Lemonia"},{"first_name":"Tatsuro","last_name":"Ikeda","full_name":"Ikeda, Tatsuro"},{"last_name":"Yoshida","full_name":"Yoshida, Shosei","first_name":"Shosei"},{"full_name":"Philpott, Anna","last_name":"Philpott","first_name":"Anna"},{"first_name":"Benjamin D","last_name":"Simons","full_name":"Simons, Benjamin D"}],"file_date_updated":"2020-10-19T11:27:46Z","scopus_import":"1","publication_identifier":{"eissn":["2041-1723"]},"oa":1,"pmid":1,"file":[{"file_size":5540540,"date_created":"2020-10-19T11:27:46Z","file_id":"8677","creator":"dernst","file_name":"2020_NatureComm_Sznurkowska.pdf","date_updated":"2020-10-19T11:27:46Z","checksum":"0ecc0eab72d2d50694852579611a6624","content_type":"application/pdf","success":1,"relation":"main_file","access_level":"open_access"}],"language":[{"iso":"eng"}],"date_created":"2020-10-18T22:01:35Z","external_id":{"pmid":["33028844"],"isi":["000577244600003"]},"department":[{"_id":"EdHa"}],"publication_status":"published","article_number":"5037","abstract":[{"text":"Pancreatic islets play an essential role in regulating blood glucose level. Although the molecular pathways underlying islet cell differentiation are beginning to be resolved, the cellular basis of islet morphogenesis and fate allocation remain unclear. By combining unbiased and targeted lineage tracing, we address the events leading to islet formation in the mouse. From the statistical analysis of clones induced at multiple embryonic timepoints, here we show that, during the secondary transition, islet formation involves the aggregation of multiple equipotent endocrine progenitors that transition from a phase of stochastic amplification by cell division into a phase of sublineage restriction and limited islet fission. Together, these results explain quantitatively the heterogeneous size distribution and degree of polyclonality of maturing islets, as well as dispersion of progenitors within and between islets. Further, our results show that, during the secondary transition, α- and β-cells are generated in a contemporary manner. Together, these findings provide insight into the cellular basis of islet development.","lang":"eng"}],"quality_controlled":"1","volume":11,"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_updated":"2026-04-02T14:29:58Z","oa_version":"Published Version","year":"2020","has_accepted_license":"1","date_published":"2020-10-07T00:00:00Z","type":"journal_article","day":"07","publisher":"Springer Nature","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"status":"public","article_type":"original","doi":"10.1038/s41467-020-18837-3","ddc":["570"],"citation":{"ieee":"M. K. Sznurkowska <i>et al.</i>, “Tracing the cellular basis of islet specification in mouse pancreas,” <i>Nature Communications</i>, vol. 11. Springer Nature, 2020.","mla":"Sznurkowska, Magdalena K., et al. “Tracing the Cellular Basis of Islet Specification in Mouse Pancreas.” <i>Nature Communications</i>, vol. 11, 5037, Springer Nature, 2020, doi:<a href=\"https://doi.org/10.1038/s41467-020-18837-3\">10.1038/s41467-020-18837-3</a>.","short":"M.K. Sznurkowska, E.B. Hannezo, R. Azzarelli, L. Chatzeli, T. Ikeda, S. Yoshida, A. Philpott, B.D. Simons, Nature Communications 11 (2020).","chicago":"Sznurkowska, Magdalena K., Edouard B Hannezo, Roberta Azzarelli, Lemonia Chatzeli, Tatsuro Ikeda, Shosei Yoshida, Anna Philpott, and Benjamin D Simons. “Tracing the Cellular Basis of Islet Specification in Mouse Pancreas.” <i>Nature Communications</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1038/s41467-020-18837-3\">https://doi.org/10.1038/s41467-020-18837-3</a>.","ista":"Sznurkowska MK, Hannezo EB, Azzarelli R, Chatzeli L, Ikeda T, Yoshida S, Philpott A, Simons BD. 2020. Tracing the cellular basis of islet specification in mouse pancreas. Nature Communications. 11, 5037.","ama":"Sznurkowska MK, Hannezo EB, Azzarelli R, et al. Tracing the cellular basis of islet specification in mouse pancreas. <i>Nature Communications</i>. 2020;11. doi:<a href=\"https://doi.org/10.1038/s41467-020-18837-3\">10.1038/s41467-020-18837-3</a>","apa":"Sznurkowska, M. K., Hannezo, E. B., Azzarelli, R., Chatzeli, L., Ikeda, T., Yoshida, S., … Simons, B. D. (2020). Tracing the cellular basis of islet specification in mouse pancreas. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-020-18837-3\">https://doi.org/10.1038/s41467-020-18837-3</a>"},"article_processing_charge":"No","month":"10","title":"Tracing the cellular basis of islet specification in mouse pancreas","_id":"8669"},{"citation":{"ieee":"A. Pavlogiannis, N. Schaumberger, U. Schmid, and K. Chatterjee, “Precedence-aware automated competitive analysis of real-time scheduling,” <i>IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems</i>, vol. 39, no. 11. IEEE, pp. 3981–3992, 2020.","mla":"Pavlogiannis, Andreas, et al. “Precedence-Aware Automated Competitive Analysis of Real-Time Scheduling.” <i>IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems</i>, vol. 39, no. 11, IEEE, 2020, pp. 3981–92, doi:<a href=\"https://doi.org/10.1109/TCAD.2020.3012803\">10.1109/TCAD.2020.3012803</a>.","short":"A. Pavlogiannis, N. Schaumberger, U. Schmid, K. Chatterjee, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 39 (2020) 3981–3992.","chicago":"Pavlogiannis, Andreas, Nico Schaumberger, Ulrich Schmid, and Krishnendu Chatterjee. “Precedence-Aware Automated Competitive Analysis of Real-Time Scheduling.” <i>IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems</i>. IEEE, 2020. <a href=\"https://doi.org/10.1109/TCAD.2020.3012803\">https://doi.org/10.1109/TCAD.2020.3012803</a>.","ista":"Pavlogiannis A, Schaumberger N, Schmid U, Chatterjee K. 2020. Precedence-aware automated competitive analysis of real-time scheduling. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 39(11), 3981–3992.","ama":"Pavlogiannis A, Schaumberger N, Schmid U, Chatterjee K. Precedence-aware automated competitive analysis of real-time scheduling. <i>IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems</i>. 2020;39(11):3981-3992. doi:<a href=\"https://doi.org/10.1109/TCAD.2020.3012803\">10.1109/TCAD.2020.3012803</a>","apa":"Pavlogiannis, A., Schaumberger, N., Schmid, U., &#38; Chatterjee, K. (2020). Precedence-aware automated competitive analysis of real-time scheduling. <i>IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems</i>. IEEE. <a href=\"https://doi.org/10.1109/TCAD.2020.3012803\">https://doi.org/10.1109/TCAD.2020.3012803</a>"},"article_processing_charge":"No","title":"Precedence-aware automated competitive analysis of real-time scheduling","month":"11","_id":"8788","doi":"10.1109/TCAD.2020.3012803","article_type":"original","type":"journal_article","publisher":"IEEE","day":"01","issue":"11","status":"public","page":"3981-3992","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","year":"2020","oa_version":"None","date_updated":"2026-04-02T14:37:50Z","project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407"}],"date_published":"2020-11-01T00:00:00Z","abstract":[{"lang":"eng","text":"We consider a real-time setting where an environment releases sequences of firm-deadline tasks, and an online scheduler chooses on-the-fly the ones to execute on a single processor so as to maximize cumulated utility. The competitive ratio is a well-known performance measure for the scheduler: it gives the worst-case ratio, among all possible choices for the environment, of the cumulated utility of the online scheduler versus an offline scheduler that knows these choices in advance. Traditionally, competitive analysis is performed by hand, while automated techniques are rare and only handle static environments with independent tasks. We present a quantitative-verification framework for precedence-aware competitive analysis, where task releases may depend on preceding scheduling choices, i.e., the environment can respond to scheduling decisions dynamically . We consider two general classes of precedences: 1) follower precedences force the release of a dependent task upon the completion of a set of precursor tasks, while and 2) pairing precedences modify the characteristics of a dependent task provided the completion of a set of precursor tasks. Precedences make competitive analysis challenging, as the online and offline schedulers operate on diverging sequences. We make a formal presentation of our framework, and use a GPU-based implementation to analyze ten well-known schedulers on precedence-based application examples taken from the existing literature: 1) a handshake protocol (HP); 2) network packet-switching; 3) query scheduling (QS); and 4) a sporadic-interrupt setting. Our experimental results show that precedences and task parameters can vary drastically the best scheduler. Our framework thus supports application designers in choosing the best scheduler among a given set automatically."}],"quality_controlled":"1","volume":39,"language":[{"iso":"eng"}],"department":[{"_id":"KrCh"}],"external_id":{"isi":["000587712700069"]},"date_created":"2020-11-22T23:01:24Z","publication_status":"published","publication_identifier":{"eissn":["1937-4151"],"issn":["0278-0070"]},"acknowledgement":"This work was supported by the Austrian Science Foundation (FWF) under the NFN RiSE/SHiNE under Grant S11405 and Grant S11407. This article was presented in the International Conference on Embedded Software 2020 and appears as part of the ESWEEK-TCAD special issue. ","intvolume":"        39","isi":1,"author":[{"orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis","full_name":"Pavlogiannis, Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas"},{"full_name":"Schaumberger, Nico","last_name":"Schaumberger","first_name":"Nico"},{"first_name":"Ulrich","last_name":"Schmid","full_name":"Schmid, Ulrich"},{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"}],"publication":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","scopus_import":"1"},{"date_published":"2020-03-03T00:00:00Z","date_updated":"2026-04-07T11:47:05Z","oa_version":"Published Version","year":"2020","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","status":"public","issue":"3","type":"journal_article","publisher":"AIP Publishing","day":"03","arxiv":1,"article_type":"original","doi":"10.1063/1.5122969","_id":"7563","month":"03","title":"Inferring symbolic dynamics of chaotic flows from persistence","article_processing_charge":"No","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"19684"}]},"citation":{"mla":"Yalniz, Gökhan, and Nazmi B. Budanur. “Inferring Symbolic Dynamics of Chaotic Flows from Persistence.” <i>Chaos</i>, vol. 30, no. 3, 033109, AIP Publishing, 2020, doi:<a href=\"https://doi.org/10.1063/1.5122969\">10.1063/1.5122969</a>.","short":"G. Yalniz, N.B. Budanur, Chaos 30 (2020).","ieee":"G. Yalniz and N. B. Budanur, “Inferring symbolic dynamics of chaotic flows from persistence,” <i>Chaos</i>, vol. 30, no. 3. AIP Publishing, 2020.","apa":"Yalniz, G., &#38; Budanur, N. B. (2020). Inferring symbolic dynamics of chaotic flows from persistence. <i>Chaos</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/1.5122969\">https://doi.org/10.1063/1.5122969</a>","ama":"Yalniz G, Budanur NB. Inferring symbolic dynamics of chaotic flows from persistence. <i>Chaos</i>. 2020;30(3). doi:<a href=\"https://doi.org/10.1063/1.5122969\">10.1063/1.5122969</a>","ista":"Yalniz G, Budanur NB. 2020. Inferring symbolic dynamics of chaotic flows from persistence. Chaos. 30(3), 033109.","chicago":"Yalniz, Gökhan, and Nazmi B Budanur. “Inferring Symbolic Dynamics of Chaotic Flows from Persistence.” <i>Chaos</i>. AIP Publishing, 2020. <a href=\"https://doi.org/10.1063/1.5122969\">https://doi.org/10.1063/1.5122969</a>."},"publication":"Chaos","author":[{"orcid":"0000-0002-8490-9312","full_name":"Yalniz, Gökhan","last_name":"Yalniz","first_name":"Gökhan","id":"66E74FA2-D8BF-11E9-8249-8DE2E5697425"},{"first_name":"Nazmi B","id":"3EA1010E-F248-11E8-B48F-1D18A9856A87","full_name":"Budanur, Nazmi B","last_name":"Budanur","orcid":"0000-0003-0423-5010"}],"scopus_import":"1","isi":1,"intvolume":"        30","publication_identifier":{"eissn":["1089-7682"],"issn":["1054-1500"]},"oa":1,"main_file_link":[{"url":"https://doi.org/10.1063/1.5122969","open_access":"1"}],"publication_status":"published","date_created":"2020-03-04T08:06:25Z","department":[{"_id":"BjHo"}],"external_id":{"isi":["000519254800002"],"arxiv":["1910.04584"]},"corr_author":"1","language":[{"iso":"eng"}],"volume":30,"quality_controlled":"1","article_number":"033109","abstract":[{"text":"We introduce “state space persistence analysis” for deducing the symbolic dynamics of time series data obtained from high-dimensional chaotic attractors. To this end, we adapt a topological data analysis technique known as persistent homology for the characterization of state space projections of chaotic trajectories and periodic orbits. By comparing the shapes along a chaotic trajectory to those of the periodic orbits, state space persistence analysis quantifies the shape similarity of chaotic trajectory segments and periodic orbits. We demonstrate the method by applying it to the three-dimensional Rössler system and a 30-dimensional discretization of the Kuramoto–Sivashinsky partial differential equation in (1+1) dimensions.\r\nOne way of studying chaotic attractors systematically is through their symbolic dynamics, in which one partitions the state space into qualitatively different regions and assigns a symbol to each such region.1–3 This yields a “coarse-grained” state space of the system, which can then be reduced to a Markov chain encoding all possible transitions between the states of the system. While it is possible to obtain the symbolic dynamics of low-dimensional chaotic systems with standard tools such as Poincaré maps, when applied to high-dimensional systems such as turbulent flows, these tools alone are not sufficient to determine symbolic dynamics.4,5 In this paper, we develop “state space persistence analysis” and demonstrate that it can be utilized to infer the symbolic dynamics in very high-dimensional settings.","lang":"eng"}]},{"ddc":["510"],"doi":"10.1007/978-3-030-43408-3_8","alternative_title":["Abel Symposia"],"_id":"8135","title":"Radius functions on Poisson–Delaunay mosaics and related complexes experimentally","month":"06","article_processing_charge":"No","citation":{"chicago":"Edelsbrunner, Herbert, Anton Nikitenko, Katharina Ölsböck, and Peter Synak. “Radius Functions on Poisson–Delaunay Mosaics and Related Complexes Experimentally.” In <i>Topological Data Analysis</i>, 15:181–218. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-030-43408-3_8\">https://doi.org/10.1007/978-3-030-43408-3_8</a>.","ista":"Edelsbrunner H, Nikitenko A, Ölsböck K, Synak P. 2020. Radius functions on Poisson–Delaunay mosaics and related complexes experimentally. Topological Data Analysis. , Abel Symposia, vol. 15, 181–218.","ama":"Edelsbrunner H, Nikitenko A, Ölsböck K, Synak P. Radius functions on Poisson–Delaunay mosaics and related complexes experimentally. In: <i>Topological Data Analysis</i>. Vol 15. Springer Nature; 2020:181-218. doi:<a href=\"https://doi.org/10.1007/978-3-030-43408-3_8\">10.1007/978-3-030-43408-3_8</a>","apa":"Edelsbrunner, H., Nikitenko, A., Ölsböck, K., &#38; Synak, P. (2020). Radius functions on Poisson–Delaunay mosaics and related complexes experimentally. In <i>Topological Data Analysis</i> (Vol. 15, pp. 181–218). Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-43408-3_8\">https://doi.org/10.1007/978-3-030-43408-3_8</a>","ieee":"H. Edelsbrunner, A. Nikitenko, K. Ölsböck, and P. Synak, “Radius functions on Poisson–Delaunay mosaics and related complexes experimentally,” in <i>Topological Data Analysis</i>, 2020, vol. 15, pp. 181–218.","mla":"Edelsbrunner, Herbert, et al. “Radius Functions on Poisson–Delaunay Mosaics and Related Complexes Experimentally.” <i>Topological Data Analysis</i>, vol. 15, Springer Nature, 2020, pp. 181–218, doi:<a href=\"https://doi.org/10.1007/978-3-030-43408-3_8\">10.1007/978-3-030-43408-3_8</a>.","short":"H. Edelsbrunner, A. Nikitenko, K. Ölsböck, P. Synak, in:, Topological Data Analysis, Springer Nature, 2020, pp. 181–218."},"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"19630"}]},"date_published":"2020-06-22T00:00:00Z","project":[{"_id":"266A2E9E-B435-11E9-9278-68D0E5697425","grant_number":"788183","name":"Alpha Shape Theory Extended","call_identifier":"H2020"},{"call_identifier":"H2020","name":"Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large Scales","grant_number":"638176","_id":"2533E772-B435-11E9-9278-68D0E5697425"},{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes","call_identifier":"FWF"}],"has_accepted_license":"1","year":"2020","oa_version":"Submitted Version","date_updated":"2026-04-07T12:35:47Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","page":"181-218","status":"public","publisher":"Springer Nature","day":"22","type":"conference","publication_status":"published","department":[{"_id":"HeEd"}],"external_id":{"isi":["001321861000008"]},"date_created":"2020-07-19T22:00:59Z","language":[{"iso":"eng"}],"volume":15,"quality_controlled":"1","abstract":[{"lang":"eng","text":"Discrete Morse theory has recently lead to new developments in the theory of random geometric complexes. This article surveys the methods and results obtained with this new approach, and discusses some of its shortcomings. It uses simulations to illustrate the results and to form conjectures, getting numerical estimates for combinatorial, topological, and geometric properties of weighted and unweighted Delaunay mosaics, their dual Voronoi tessellations, and the Alpha and Wrap complexes contained in the mosaics."}],"file_date_updated":"2020-10-08T08:56:14Z","author":[{"last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833"},{"id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87","first_name":"Anton","last_name":"Nikitenko","full_name":"Nikitenko, Anton","orcid":"0000-0002-0659-3201"},{"first_name":"Katharina","id":"4D4AA390-F248-11E8-B48F-1D18A9856A87","last_name":"Ölsböck","full_name":"Ölsböck, Katharina","orcid":"0000-0002-4672-8297"},{"last_name":"Synak","full_name":"Synak, Peter","first_name":"Peter","id":"331776E2-F248-11E8-B48F-1D18A9856A87"}],"publication":"Topological Data Analysis","scopus_import":"1","ec_funded":1,"intvolume":"        15","isi":1,"acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreements No 78818 Alpha and No 638176). It is also partially supported by the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, through grant no. I02979-N35 of the Austrian Science Fund (FWF).","file":[{"success":1,"relation":"main_file","access_level":"open_access","date_created":"2020-10-08T08:56:14Z","file_id":"8628","file_name":"2020-B-01-PoissonExperimentalSurvey.pdf","creator":"dernst","file_size":2207071,"content_type":"application/pdf","checksum":"7b5e0de10675d787a2ddb2091370b8d8","date_updated":"2020-10-08T08:56:14Z"}],"publication_identifier":{"isbn":["9783030434076"],"eissn":["2197-8549"],"issn":["2193-2808"]},"oa":1},{"oa":1,"publication_identifier":{"issn":["1424-0637"]},"file":[{"file_size":469831,"date_created":"2020-10-27T12:49:04Z","file_id":"8711","file_name":"2020_Annales_Mysliwy.pdf","creator":"cziletti","date_updated":"2020-10-27T12:49:04Z","content_type":"application/pdf","checksum":"c12c9c1e6f08def245e42f3cb1d83827","success":1,"relation":"main_file","access_level":"open_access"}],"acknowledgement":"Financial support through the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme Grant agreement No. 694227 (R.S.) and the Maria Skłodowska-Curie Grant agreement No. 665386 (K.M.) is gratefully acknowledged. Funding Open access funding provided by Institute of Science and Technology (IST Austria)","ec_funded":1,"isi":1,"intvolume":"        21","author":[{"id":"316457FC-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof","last_name":"Mysliwy","full_name":"Mysliwy, Krzysztof"},{"orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert","last_name":"Seiringer","first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"}],"file_date_updated":"2020-10-27T12:49:04Z","publication":"Annales Henri Poincare","scopus_import":"1","quality_controlled":"1","volume":21,"abstract":[{"text":"We consider the quantum mechanical many-body problem of a single impurity particle immersed in a weakly interacting Bose gas. The impurity interacts with the bosons via a two-body potential. We study the Hamiltonian of this system in the mean-field limit and rigorously show that, at low energies, the problem is well described by the Fröhlich polaron model.","lang":"eng"}],"publication_status":"published","language":[{"iso":"eng"}],"corr_author":"1","department":[{"_id":"RoSe"}],"external_id":{"arxiv":["2003.12371"],"isi":["000578111800002"]},"date_created":"2020-10-25T23:01:19Z","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"status":"public","type":"journal_article","publisher":"Springer Nature","day":"01","issue":"12","year":"2020","oa_version":"Published Version","date_updated":"2026-04-07T14:14:51Z","date_published":"2020-12-01T00:00:00Z","project":[{"grant_number":"694227","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","name":"Analysis of quantum many-body systems","call_identifier":"H2020"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"},{"name":"International IST Doctoral Program","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385"}],"has_accepted_license":"1","page":"4003-4025","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","title":"Microscopic derivation of the Fröhlich Hamiltonian for the Bose polaron in the mean-field limit","month":"12","_id":"8705","citation":{"ista":"Mysliwy K, Seiringer R. 2020. Microscopic derivation of the Fröhlich Hamiltonian for the Bose polaron in the mean-field limit. Annales Henri Poincare. 21(12), 4003–4025.","chicago":"Mysliwy, Krzysztof, and Robert Seiringer. “Microscopic Derivation of the Fröhlich Hamiltonian for the Bose Polaron in the Mean-Field Limit.” <i>Annales Henri Poincare</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/s00023-020-00969-3\">https://doi.org/10.1007/s00023-020-00969-3</a>.","apa":"Mysliwy, K., &#38; Seiringer, R. (2020). Microscopic derivation of the Fröhlich Hamiltonian for the Bose polaron in the mean-field limit. <i>Annales Henri Poincare</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00023-020-00969-3\">https://doi.org/10.1007/s00023-020-00969-3</a>","ama":"Mysliwy K, Seiringer R. Microscopic derivation of the Fröhlich Hamiltonian for the Bose polaron in the mean-field limit. <i>Annales Henri Poincare</i>. 2020;21(12):4003-4025. doi:<a href=\"https://doi.org/10.1007/s00023-020-00969-3\">10.1007/s00023-020-00969-3</a>","ieee":"K. Mysliwy and R. Seiringer, “Microscopic derivation of the Fröhlich Hamiltonian for the Bose polaron in the mean-field limit,” <i>Annales Henri Poincare</i>, vol. 21, no. 12. Springer Nature, pp. 4003–4025, 2020.","mla":"Mysliwy, Krzysztof, and Robert Seiringer. “Microscopic Derivation of the Fröhlich Hamiltonian for the Bose Polaron in the Mean-Field Limit.” <i>Annales Henri Poincare</i>, vol. 21, no. 12, Springer Nature, 2020, pp. 4003–25, doi:<a href=\"https://doi.org/10.1007/s00023-020-00969-3\">10.1007/s00023-020-00969-3</a>.","short":"K. Mysliwy, R. Seiringer, Annales Henri Poincare 21 (2020) 4003–4025."},"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"11473"}]},"article_processing_charge":"Yes (via OA deal)","arxiv":1,"ddc":["530"],"doi":"10.1007/s00023-020-00969-3","article_type":"original"},{"publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-005-3"]},"oa":1,"file":[{"relation":"main_file","access_level":"open_access","date_updated":"2020-07-14T12:48:05Z","content_type":"application/pdf","checksum":"df688bc5a82b50baee0b99d25fc7b7f0","file_size":13661779,"date_created":"2020-06-08T00:34:00Z","file_id":"7945","creator":"zmasarov","file_name":"THESIS_Zuzka_Masarova.pdf"},{"content_type":"application/zip","checksum":"45341a35b8f5529c74010b7af43ac188","date_updated":"2020-07-14T12:48:05Z","date_created":"2020-06-08T00:35:30Z","file_id":"7946","file_name":"THESIS_Zuzka_Masarova_SOURCE_FILES.zip","creator":"zmasarov","file_size":32184006,"relation":"source_file","access_level":"closed"}],"keyword":["reconfiguration","reconfiguration graph","triangulations","flip","constrained triangulations","shellability","piecewise-linear balls","token swapping","trees","coloured weighted token swapping"],"file_date_updated":"2020-07-14T12:48:05Z","author":[{"last_name":"Masárová","full_name":"Masárová, Zuzana","id":"45CFE238-F248-11E8-B48F-1D18A9856A87","first_name":"Zuzana","orcid":"0000-0002-6660-1322"}],"abstract":[{"text":"This thesis considers two examples of reconfiguration problems: flipping edges in edge-labelled triangulations of planar point sets and swapping labelled tokens placed on vertices of a graph. In both cases the studied structures – all the triangulations of a given point set or all token placements on a given graph – can be thought of as vertices of the so-called reconfiguration graph, in which two vertices are adjacent if the corresponding structures differ by a single elementary operation – by a flip of a diagonal in a triangulation or by a swap of tokens on adjacent vertices, respectively. We study the reconfiguration of one instance of a structure into another via (shortest) paths in the reconfiguration graph.\r\n\r\nFor triangulations of point sets in which each edge has a unique label and a flip transfers the label from the removed edge to the new edge, we prove a polynomial-time testable condition, called the Orbit Theorem, that characterizes when two triangulations of the same point set lie in the same connected component of the reconfiguration graph. The condition was first conjectured by Bose, Lubiw, Pathak and Verdonschot. We additionally provide a polynomial time algorithm that computes a reconfiguring flip sequence, if it exists. Our proof of the Orbit Theorem uses topological properties of a certain high-dimensional cell complex that has the usual reconfiguration graph as its 1-skeleton.\r\n\r\nIn the context of token swapping on a tree graph, we make partial progress on the problem of finding shortest reconfiguration sequences. We disprove the so-called Happy Leaf Conjecture and demonstrate the importance of swapping tokens that are already placed at the correct vertices. We also prove that a generalization of the problem to weighted coloured token swapping is NP-hard on trees but solvable in polynomial time on paths and stars.","lang":"eng"}],"license":"https://creativecommons.org/licenses/by-sa/4.0/","supervisor":[{"first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","full_name":"Wagner, Uli","last_name":"Wagner","orcid":"0000-0002-1494-0568"},{"full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833"}],"corr_author":"1","language":[{"iso":"eng"}],"department":[{"_id":"HeEd"},{"_id":"UlWa"}],"date_created":"2020-06-08T00:49:46Z","publication_status":"published","degree_awarded":"PhD","type":"dissertation","publisher":"Institute of Science and Technology Austria","day":"09","tmp":{"short":"CC BY-SA (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","name":"Creative Commons Attribution-ShareAlike 4.0 International Public License (CC BY-SA 4.0)","image":"/images/cc_by_sa.png"},"status":"public","page":"160","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","oa_version":"Published Version","year":"2020","date_updated":"2026-04-08T07:23:01Z","date_published":"2020-06-09T00:00:00Z","has_accepted_license":"1","citation":{"short":"Z. Masárová, Reconfiguration Problems, Institute of Science and Technology Austria, 2020.","mla":"Masárová, Zuzana. <i>Reconfiguration Problems</i>. Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:7944\">10.15479/AT:ISTA:7944</a>.","ieee":"Z. Masárová, “Reconfiguration problems,” Institute of Science and Technology Austria, 2020.","apa":"Masárová, Z. (2020). <i>Reconfiguration problems</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:7944\">https://doi.org/10.15479/AT:ISTA:7944</a>","ama":"Masárová Z. Reconfiguration problems. 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:7944\">10.15479/AT:ISTA:7944</a>","ista":"Masárová Z. 2020. Reconfiguration problems. Institute of Science and Technology Austria.","chicago":"Masárová, Zuzana. “Reconfiguration Problems.” Institute of Science and Technology Austria, 2020. <a href=\"https://doi.org/10.15479/AT:ISTA:7944\">https://doi.org/10.15479/AT:ISTA:7944</a>."},"related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"7950"},{"id":"5986","relation":"part_of_dissertation","status":"public"}]},"article_processing_charge":"No","title":"Reconfiguration problems","month":"06","_id":"7944","OA_place":"publisher","doi":"10.15479/AT:ISTA:7944","alternative_title":["ISTA Thesis"],"ddc":["516","514"]},{"supervisor":[{"orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","last_name":"Barton","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"abstract":[{"text":"This thesis concerns itself with the interactions of evolutionary and ecological forces and the consequences on genetic diversity and the ultimate survival of populations. It is important to understand what signals processes \r\nleave on the genome and what we can infer from such data, which is usually abundant but noisy. Furthermore, understanding how and when populations adapt or go extinct is important for practical purposes,  such as the genetic management of populations, as well as for theoretical questions, since local adaptation can be the first step toward speciation. \r\nIn Chapter 2, we introduce the method of maximum entropy to approximate the demographic changes of a population in a simple setting, namely the logistic growth model with immigration. We show that this method is not only a powerful \r\ntool in physics but can be gainfully applied in an ecological framework. We investigate how well it approximates the real \r\nbehavior of the system, and find that is does so, even in unexpected situations. Finally, we illustrate how it can model changing environments.\r\nIn Chapter 3, we analyze the co-evolution of allele frequencies and population sizes in an infinite island model.\r\nWe give conditions under which polygenic adaptation to a rare habitat is possible. The model we use is based on the diffusion approximation, considers eco-evolutionary feedback mechanisms (hard selection), and treats both \r\ndrift and environmental fluctuations explicitly. We also look at limiting scenarios, for which we derive analytical expressions. \r\nIn Chapter 4, we present a coalescent based simulation tool to obtain patterns of diversity in a spatially explicit subdivided population, in which the demographic history of each subpopulation can be specified. We compare \r\nthe results to existing predictions, and explore the relative importance of time and space under a variety of spatial arrangements and demographic histories, such as expansion and extinction. \r\nIn the last chapter, we give a brief outlook to further research. ","lang":"eng"}],"degree_awarded":"PhD","publication_status":"published","date_created":"2020-09-28T07:33:38Z","department":[{"_id":"NiBa"}],"corr_author":"1","language":[{"iso":"eng"}],"file":[{"file_size":6354833,"file_name":"thesis_EnikoSzep_final.pdf","creator":"dernst","date_created":"2020-09-28T07:25:35Z","file_id":"8575","date_updated":"2020-09-28T07:25:35Z","content_type":"application/pdf","checksum":"20e71f015fbbd78fea708893ad634ed0","success":1,"access_level":"open_access","relation":"main_file"},{"content_type":"application/x-zip-compressed","checksum":"a8de2c14a1bb4e53c857787efbb289e1","date_updated":"2020-09-28T07:25:37Z","date_created":"2020-09-28T07:25:37Z","file_id":"8576","creator":"dernst","file_name":"thesisFiles_EnikoSzep.zip","file_size":23020401,"relation":"source_file","access_level":"closed"}],"publication_identifier":{"eissn":["2663-337X"]},"oa":1,"author":[{"last_name":"Szep","full_name":"Szep, Eniko","id":"485BB5A4-F248-11E8-B48F-1D18A9856A87","first_name":"Eniko"}],"file_date_updated":"2020-09-28T07:25:37Z","_id":"8574","month":"09","title":"Local adaptation in metapopulations","article_processing_charge":"No","citation":{"mla":"Szep, Eniko. <i>Local Adaptation in Metapopulations</i>. Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8574\">10.15479/AT:ISTA:8574</a>.","short":"E. Szep, Local Adaptation in Metapopulations, Institute of Science and Technology Austria, 2020.","ieee":"E. Szep, “Local adaptation in metapopulations,” Institute of Science and Technology Austria, 2020.","ama":"Szep E. Local adaptation in metapopulations. 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8574\">10.15479/AT:ISTA:8574</a>","apa":"Szep, E. (2020). <i>Local adaptation in metapopulations</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:8574\">https://doi.org/10.15479/AT:ISTA:8574</a>","chicago":"Szep, Eniko. “Local Adaptation in Metapopulations.” Institute of Science and Technology Austria, 2020. <a href=\"https://doi.org/10.15479/AT:ISTA:8574\">https://doi.org/10.15479/AT:ISTA:8574</a>.","ista":"Szep E. 2020. Local adaptation in metapopulations. Institute of Science and Technology Austria."},"ddc":["570"],"alternative_title":["ISTA Thesis"],"OA_place":"publisher","doi":"10.15479/AT:ISTA:8574","status":"public","type":"dissertation","day":"20","publisher":"Institute of Science and Technology Austria","has_accepted_license":"1","date_published":"2020-09-20T00:00:00Z","date_updated":"2026-04-08T07:21:44Z","oa_version":"Published Version","year":"2020","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","page":"158"},{"page":"xviii+120","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_updated":"2026-04-08T07:21:28Z","oa_version":"Published Version","year":"2020","has_accepted_license":"1","date_published":"2020-06-26T00:00:00Z","type":"dissertation","day":"26","publisher":"Institute of Science and Technology Austria","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"status":"public","alternative_title":["ISTA Thesis"],"doi":"10.15479/AT:ISTA:8032","OA_place":"publisher","ddc":["514"],"related_material":{"record":[{"id":"6556","status":"public","relation":"dissertation_contains"},{"status":"public","relation":"dissertation_contains","id":"7093"}]},"citation":{"apa":"Huszár, K. (2020). <i>Combinatorial width parameters for 3-dimensional manifolds</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:8032\">https://doi.org/10.15479/AT:ISTA:8032</a>","ama":"Huszár K. Combinatorial width parameters for 3-dimensional manifolds. 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8032\">10.15479/AT:ISTA:8032</a>","ista":"Huszár K. 2020. Combinatorial width parameters for 3-dimensional manifolds. Institute of Science and Technology Austria.","chicago":"Huszár, Kristóf. “Combinatorial Width Parameters for 3-Dimensional Manifolds.” Institute of Science and Technology Austria, 2020. <a href=\"https://doi.org/10.15479/AT:ISTA:8032\">https://doi.org/10.15479/AT:ISTA:8032</a>.","mla":"Huszár, Kristóf. <i>Combinatorial Width Parameters for 3-Dimensional Manifolds</i>. Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8032\">10.15479/AT:ISTA:8032</a>.","short":"K. Huszár, Combinatorial Width Parameters for 3-Dimensional Manifolds, Institute of Science and Technology Austria, 2020.","ieee":"K. Huszár, “Combinatorial width parameters for 3-dimensional manifolds,” Institute of Science and Technology Austria, 2020."},"article_processing_charge":"No","month":"06","title":"Combinatorial width parameters for 3-dimensional manifolds","_id":"8032","author":[{"orcid":"0000-0002-5445-5057","last_name":"Huszár","full_name":"Huszár, Kristóf","first_name":"Kristóf","id":"33C26278-F248-11E8-B48F-1D18A9856A87"}],"file_date_updated":"2020-07-14T12:48:08Z","publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-006-0"]},"oa":1,"file":[{"relation":"main_file","access_level":"open_access","file_id":"8034","date_created":"2020-06-26T10:03:58Z","file_name":"Kristof_Huszar-Thesis.pdf","creator":"khuszar","file_size":2637562,"content_type":"application/pdf","checksum":"bd8be6e4f1addc863dfcc0fad29ee9c3","date_updated":"2020-07-14T12:48:08Z"},{"access_level":"closed","relation":"source_file","checksum":"d5f8456202b32f4a77552ef47a2837d1","content_type":"application/x-zip-compressed","date_updated":"2020-07-14T12:48:08Z","creator":"khuszar","file_name":"Kristof_Huszar-Thesis-source.zip","date_created":"2020-06-26T10:10:06Z","file_id":"8035","file_size":7163491}],"corr_author":"1","language":[{"iso":"eng"}],"date_created":"2020-06-26T10:00:36Z","department":[{"_id":"UlWa"}],"publication_status":"published","degree_awarded":"PhD","acknowledged_ssus":[{"_id":"E-Lib"},{"_id":"CampIT"}],"supervisor":[{"last_name":"Wagner","full_name":"Wagner, Uli","first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1494-0568"},{"last_name":"Spreer","full_name":"Spreer, Jonathan","first_name":"Jonathan"}],"abstract":[{"text":"Algorithms in computational 3-manifold topology typically take a triangulation as an input and return topological information about the underlying 3-manifold. However, extracting the desired information from a triangulation (e.g., evaluating an invariant) is often computationally very expensive. In recent years this complexity barrier has been successfully tackled in some cases by importing ideas from the theory of parameterized algorithms into the realm of 3-manifolds. Various computationally hard problems were shown to be efficiently solvable for input triangulations that are sufficiently “tree-like.”\r\nIn this thesis we focus on the key combinatorial parameter in the above context: we consider the treewidth of a compact, orientable 3-manifold, i.e., the smallest treewidth of the dual graph of any triangulation thereof. By building on the work of Scharlemann–Thompson and Scharlemann–Schultens–Saito on generalized Heegaard splittings, and on the work of Jaco–Rubinstein on layered triangulations, we establish quantitative relations between the treewidth and classical topological invariants of a 3-manifold. In particular, among other results, we show that the treewidth of a closed, orientable, irreducible, non-Haken 3-manifold is always within a constant factor of its Heegaard genus.","lang":"eng"}]},{"publication":"Computer Aided Verification","file_date_updated":"2020-08-06T08:14:54Z","author":[{"orcid":"0000-0001-7745-9117","last_name":"Kragl","full_name":"Kragl, Bernhard","id":"320FC952-F248-11E8-B48F-1D18A9856A87","first_name":"Bernhard"},{"last_name":"Qadeer","full_name":"Qadeer, Shaz","first_name":"Shaz"},{"orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"}],"scopus_import":"1","isi":1,"intvolume":"     12224","file":[{"access_level":"open_access","relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2020-08-06T08:14:54Z","creator":"dernst","file_name":"2020_LNCS_Kragl.pdf","date_created":"2020-08-06T08:14:54Z","file_id":"8201","file_size":804237}],"acknowledgement":"Bernhard Kragl and Thomas A. Henzinger were supported by\r\nthe Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","publication_identifier":{"eisbn":["9783030532888"],"isbn":["9783030532871"],"eissn":["1611-3349"],"issn":["0302-9743"]},"oa":1,"publication_status":"published","external_id":{"isi":["000695276000014"]},"department":[{"_id":"ToHe"}],"date_created":"2020-08-03T11:45:35Z","corr_author":"1","language":[{"iso":"eng"}],"volume":12224,"quality_controlled":"1","abstract":[{"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.","lang":"eng"}],"date_published":"2020-07-14T00:00:00Z","has_accepted_license":"1","project":[{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF"}],"oa_version":"Published Version","year":"2020","date_updated":"2026-04-08T07:23:52Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","page":"275-298","status":"public","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"publisher":"Springer Nature","day":"14","type":"conference","ddc":["000"],"doi":"10.1007/978-3-030-53288-8_14","alternative_title":["LNCS"],"_id":"8195","title":"Refinement for structured concurrent programs","month":"07","article_processing_charge":"No","citation":{"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>","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>","ista":"Kragl B, Qadeer S, Henzinger TA. 2020. Refinement for structured concurrent programs. Computer Aided Verification. , LNCS, vol. 12224, 275–298.","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>.","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>.","short":"B. Kragl, S. Qadeer, T.A. Henzinger, in:, Computer Aided Verification, Springer Nature, 2020, pp. 275–298.","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."},"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"8332"}]}},{"acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"}],"abstract":[{"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.","lang":"eng"}],"supervisor":[{"orcid":"0000-0002-8302-7596","last_name":"Friml","full_name":"Friml, Jiří","first_name":"Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","degree_awarded":"PhD","corr_author":"1","language":[{"iso":"eng"}],"department":[{"_id":"JiFr"}],"date_created":"2020-09-30T14:50:51Z","publication_identifier":{"issn":["2663-337X"]},"oa":1,"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.","file":[{"date_created":"2020-09-30T14:50:20Z","file_id":"8590","file_name":"2020_Han_Thesis.docx","creator":"dernst","file_size":49198118,"checksum":"c4bda1947d4c09c428ac9ce667b02327","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","date_updated":"2020-09-30T14:50:20Z","relation":"source_file","access_level":"closed"},{"creator":"dernst","file_name":"2020_Han_Thesis.pdf","file_id":"8591","date_created":"2020-09-30T14:49:59Z","file_size":15513963,"content_type":"application/pdf","checksum":"3f4f5d1718c2230adf30639ecaf8a00b","date_updated":"2021-10-01T13:33:02Z","access_level":"open_access","relation":"main_file"}],"file_date_updated":"2021-10-01T13:33:02Z","author":[{"id":"31435098-F248-11E8-B48F-1D18A9856A87","first_name":"Huibin","last_name":"Han","full_name":"Han, Huibin"}],"title":"Novel insights into PIN polarity regulation during Arabidopsis development","month":"09","_id":"8589","citation":{"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>.","short":"H. Han, Novel Insights into PIN Polarity Regulation during Arabidopsis Development, Institute of Science and Technology Austria, 2020.","ista":"Han H. 2020. Novel insights into PIN polarity regulation during Arabidopsis development. Institute of Science and Technology Austria.","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>.","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>","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>"},"related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"7643"}]},"article_processing_charge":"No","ddc":["580"],"doi":"10.15479/AT:ISTA:8589","OA_place":"publisher","alternative_title":["ISTA Thesis"],"status":"public","type":"dissertation","publisher":"Institute of Science and Technology Austria","day":"30","oa_version":"Published Version","year":"2020","date_updated":"2026-04-08T07:24:28Z","date_published":"2020-09-30T00:00:00Z","has_accepted_license":"1","page":"164","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd"},{"_id":"8366","title":"Computational design of curved thin shells: From glass façades to programmable matter","month":"09","article_processing_charge":"No","citation":{"ista":"Guseinov R. 2020. Computational design of curved thin shells: From glass façades to programmable matter. Institute of Science and Technology Austria.","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>.","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>","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>","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.","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>."},"related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"8562"},{"status":"public","relation":"research_data","id":"8375"},{"id":"7151","status":"deleted","relation":"research_data"},{"id":"1001","relation":"part_of_dissertation","status":"public"},{"id":"7262","status":"public","relation":"part_of_dissertation"}]},"ddc":["000"],"OA_place":"publisher","doi":"10.15479/AT:ISTA:8366","alternative_title":["ISTA Thesis"],"status":"public","type":"dissertation","day":"21","publisher":"Institute of Science and Technology Austria","has_accepted_license":"1","date_published":"2020-09-21T00:00:00Z","project":[{"grant_number":"715767","_id":"24F9549A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling"}],"year":"2020","oa_version":"Published Version","date_updated":"2026-04-08T07:25:22Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","page":"118","abstract":[{"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.","lang":"eng"}],"supervisor":[{"last_name":"Bickel","full_name":"Bickel, Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd","orcid":"0000-0001-6511-9385"}],"acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"ScienComp"}],"degree_awarded":"PhD","publication_status":"published","department":[{"_id":"BeBi"}],"date_created":"2020-09-10T16:19:55Z","language":[{"iso":"eng"}],"corr_author":"1","file":[{"relation":"main_file","access_level":"open_access","success":1,"date_updated":"2020-09-10T16:11:49Z","content_type":"application/pdf","checksum":"f8da89553da36037296b0a80f14ebf50","file_size":70950442,"file_id":"8367","date_created":"2020-09-10T16:11:49Z","file_name":"thesis_rguseinov.pdf","creator":"rguseino"},{"content_type":"application/x-zip-compressed","checksum":"e8fd944c960c20e0e27e6548af69121d","date_updated":"2020-09-16T15:11:01Z","file_id":"8374","date_created":"2020-09-11T09:39:48Z","file_name":"thesis_source.zip","creator":"rguseino","file_size":76207597,"relation":"source_file","access_level":"closed"}],"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.","publication_identifier":{"isbn":["978-3-99078-010-7"],"issn":["2663-337X"]},"oa":1,"author":[{"orcid":"0000-0001-9819-5077","full_name":"Guseinov, Ruslan","last_name":"Guseinov","id":"3AB45EE2-F248-11E8-B48F-1D18A9856A87","first_name":"Ruslan"}],"file_date_updated":"2020-09-16T15:11:01Z","keyword":["computer-aided design","shape modeling","self-morphing","mechanical engineering"],"ec_funded":1},{"language":[{"iso":"eng"}],"corr_author":"1","date_created":"2020-09-10T09:26:49Z","department":[{"_id":"MaLo"}],"publication_status":"published","degree_awarded":"PhD","acknowledged_ssus":[{"_id":"Bio"}],"supervisor":[{"orcid":"0000-0001-7309-9724","first_name":"Martin","id":"462D4284-F248-11E8-B48F-1D18A9856A87","last_name":"Loose","full_name":"Loose, Martin"}],"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"}],"author":[{"full_name":"Dos Santos Caldas, Paulo R","last_name":"Dos Santos Caldas","first_name":"Paulo R","id":"38FCDB4C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6730-4461"}],"file_date_updated":"2020-09-11T07:48:10Z","publication_identifier":{"isbn":["978-3-99078-009-1"],"issn":["2663-337X"]},"oa":1,"file":[{"relation":"main_file","access_level":"open_access","success":1,"date_updated":"2020-09-10T12:11:29Z","checksum":"882f93fe9c351962120e2669b84bf088","content_type":"application/pdf","file_size":141602462,"date_created":"2020-09-10T12:11:29Z","file_id":"8364","file_name":"phd_thesis_pcaldas.pdf","creator":"pcaldas"},{"relation":"source_file","access_level":"closed","date_created":"2020-09-10T12:18:17Z","file_id":"8365","creator":"pcaldas","file_name":"phd_thesis_latex_pcaldas.zip","file_size":450437458,"checksum":"70cc9e399c4e41e6e6ac445ae55e8558","content_type":"application/x-zip-compressed","date_updated":"2020-09-11T07:48:10Z"}],"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.","alternative_title":["ISTA Thesis"],"OA_place":"publisher","doi":"10.15479/AT:ISTA:8358","ddc":["572"],"related_material":{"record":[{"id":"7197","status":"public","relation":"part_of_dissertation"},{"id":"7572","status":"public","relation":"dissertation_contains"}]},"citation":{"short":"P.R. Dos Santos Caldas, Organization and Dynamics of Treadmilling Filaments in Cytoskeletal Networks of FtsZ and Its Crosslinkers, Institute of Science and Technology Austria, 2020.","mla":"Dos Santos Caldas, Paulo R. <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.","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>","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>."},"article_processing_charge":"No","month":"09","title":"Organization and dynamics of treadmilling filaments in cytoskeletal networks of FtsZ and its crosslinkers","_id":"8358","page":"135","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_updated":"2026-04-08T07:26:30Z","year":"2020","oa_version":"Published Version","has_accepted_license":"1","date_published":"2020-09-10T00:00:00Z","publisher":"Institute of Science and Technology Austria","day":"10","type":"dissertation","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"status":"public"},{"acknowledged_ssus":[{"_id":"CampIT"},{"_id":"ScienComp"}],"license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":[{"lang":"eng","text":"Deep neural networks have established a new standard for data-dependent feature extraction pipelines in the Computer Vision literature. Despite their remarkable performance in the standard supervised learning scenario, i.e. when models are trained with labeled data and tested on samples that follow a similar distribution, neural networks have been shown to struggle with more advanced generalization abilities, such as transferring knowledge across visually different domains, or generalizing to new unseen combinations of known concepts. In this thesis we argue that, in contrast to the usual black-box behavior of neural networks, leveraging more structured internal representations is a promising direction\r\nfor tackling such problems. In particular, we focus on two forms of structure. First, we tackle modularity: We show that (i) compositional architectures are a natural tool for modeling reasoning tasks, in that they efficiently capture their combinatorial nature, which is key for generalizing beyond the compositions seen during training. We investigate how to to learn such models, both formally and experimentally, for the task of abstract visual reasoning. Then, we show that (ii) in some settings, modularity allows us to efficiently break down complex tasks into smaller, easier, modules, thereby improving computational efficiency; We study this behavior in the context of generative models for colorization, as well as for small objects detection. Secondly, we investigate the inherently layered structure of representations learned by neural networks, and analyze its role in the context of transfer learning and domain adaptation across visually\r\ndissimilar domains. "}],"supervisor":[{"orcid":"0000-0001-8622-7887","last_name":"Lampert","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph"}],"publication_status":"published","degree_awarded":"PhD","corr_author":"1","language":[{"iso":"eng"}],"department":[{"_id":"ChLa"}],"date_created":"2020-09-14T13:42:09Z","oa":1,"publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-007-7"]},"file":[{"date_updated":"2020-09-14T13:39:14Z","checksum":"c914d2f88846032f3d8507734861b6ee","content_type":"application/pdf","file_size":30224591,"creator":"dernst","file_name":"2020_Thesis_Royer.pdf","file_id":"8391","date_created":"2020-09-14T13:39:14Z","access_level":"open_access","relation":"main_file","success":1},{"relation":"main_file","access_level":"closed","content_type":"application/x-zip-compressed","checksum":"ae98fb35d912cff84a89035ae5794d3c","date_updated":"2020-09-14T13:39:17Z","date_created":"2020-09-14T13:39:17Z","file_id":"8392","file_name":"thesis_sources.zip","creator":"dernst","file_size":74227627}],"acknowledgement":"Last but not least, I would like to acknowledge the support of the IST IT and scientific computing team for helping provide a great work environment.","author":[{"first_name":"Amélie","id":"3811D890-F248-11E8-B48F-1D18A9856A87","full_name":"Royer, Amélie","last_name":"Royer","orcid":"0000-0002-8407-0705"}],"file_date_updated":"2020-09-14T13:39:17Z","title":"Leveraging structure in Computer Vision tasks for flexible Deep Learning models","month":"09","_id":"8390","citation":{"apa":"Royer, A. (2020). <i>Leveraging structure in Computer Vision tasks for flexible Deep Learning models</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:8390\">https://doi.org/10.15479/AT:ISTA:8390</a>","ama":"Royer A. Leveraging structure in Computer Vision tasks for flexible Deep Learning models. 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8390\">10.15479/AT:ISTA:8390</a>","ista":"Royer A. 2020. Leveraging structure in Computer Vision tasks for flexible Deep Learning models. Institute of Science and Technology Austria.","chicago":"Royer, Amélie. “Leveraging Structure in Computer Vision Tasks for Flexible Deep Learning Models.” Institute of Science and Technology Austria, 2020. <a href=\"https://doi.org/10.15479/AT:ISTA:8390\">https://doi.org/10.15479/AT:ISTA:8390</a>.","mla":"Royer, Amélie. <i>Leveraging Structure in Computer Vision Tasks for Flexible Deep Learning Models</i>. Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8390\">10.15479/AT:ISTA:8390</a>.","short":"A. Royer, Leveraging Structure in Computer Vision Tasks for Flexible Deep Learning Models, Institute of Science and Technology Austria, 2020.","ieee":"A. Royer, “Leveraging structure in Computer Vision tasks for flexible Deep Learning models,” Institute of Science and Technology Austria, 2020."},"related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"7936"},{"id":"8092","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"911"},{"id":"8193","relation":"part_of_dissertation","status":"public"},{"id":"7937","relation":"part_of_dissertation","status":"public"}]},"article_processing_charge":"No","ddc":["000"],"OA_place":"publisher","doi":"10.15479/AT:ISTA:8390","alternative_title":["ISTA Thesis"],"tmp":{"image":"/images/cc_by_nc_sa.png","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","short":"CC BY-NC-SA (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode"},"status":"public","day":"14","publisher":"Institute of Science and Technology Austria","type":"dissertation","oa_version":"Published Version","year":"2020","date_updated":"2026-04-08T07:26:44Z","has_accepted_license":"1","date_published":"2020-09-14T00:00:00Z","page":"197","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd"},{"_id":"8092","month":"01","title":"XGAN: Unsupervised image-to-image translation for many-to-many mappings","article_processing_charge":"No","related_material":{"record":[{"status":"deleted","relation":"dissertation_contains","id":"8331"},{"id":"8390","status":"public","relation":"dissertation_contains"}]},"citation":{"chicago":"Royer, Amélie, Konstantinos Bousmalis, Stephan Gouws, Fred Bertsch, Inbar Mosseri, Forrester Cole, and Kevin Murphy. “XGAN: Unsupervised Image-to-Image Translation for Many-to-Many Mappings.” In <i>Domain Adaptation for Visual Understanding</i>, edited by Richa Singh, Mayank Vatsa, Vishal M. Patel, and Nalini Ratha, 33–49. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-030-30671-7_3\">https://doi.org/10.1007/978-3-030-30671-7_3</a>.","ista":"Royer A, Bousmalis K, Gouws S, Bertsch F, Mosseri I, Cole F, Murphy K. 2020.XGAN: Unsupervised image-to-image translation for many-to-many mappings. In: Domain Adaptation for Visual Understanding. , 33–49.","ama":"Royer A, Bousmalis K, Gouws S, et al. XGAN: Unsupervised image-to-image translation for many-to-many mappings. In: Singh R, Vatsa M, Patel VM, Ratha N, eds. <i>Domain Adaptation for Visual Understanding</i>. Springer Nature; 2020:33-49. doi:<a href=\"https://doi.org/10.1007/978-3-030-30671-7_3\">10.1007/978-3-030-30671-7_3</a>","apa":"Royer, A., Bousmalis, K., Gouws, S., Bertsch, F., Mosseri, I., Cole, F., &#38; Murphy, K. (2020). XGAN: Unsupervised image-to-image translation for many-to-many mappings. In R. Singh, M. Vatsa, V. M. Patel, &#38; N. Ratha (Eds.), <i>Domain Adaptation for Visual Understanding</i> (pp. 33–49). Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-30671-7_3\">https://doi.org/10.1007/978-3-030-30671-7_3</a>","ieee":"A. Royer <i>et al.</i>, “XGAN: Unsupervised image-to-image translation for many-to-many mappings,” in <i>Domain Adaptation for Visual Understanding</i>, R. Singh, M. Vatsa, V. M. Patel, and N. Ratha, Eds. Springer Nature, 2020, pp. 33–49.","short":"A. Royer, K. Bousmalis, S. Gouws, F. Bertsch, I. Mosseri, F. Cole, K. Murphy, in:, R. Singh, M. Vatsa, V.M. Patel, N. Ratha (Eds.), Domain Adaptation for Visual Understanding, Springer Nature, 2020, pp. 33–49.","mla":"Royer, Amélie, et al. “XGAN: Unsupervised Image-to-Image Translation for Many-to-Many Mappings.” <i>Domain Adaptation for Visual Understanding</i>, edited by Richa Singh et al., Springer Nature, 2020, pp. 33–49, doi:<a href=\"https://doi.org/10.1007/978-3-030-30671-7_3\">10.1007/978-3-030-30671-7_3</a>."},"arxiv":1,"doi":"10.1007/978-3-030-30671-7_3","status":"public","type":"book_chapter","publisher":"Springer Nature","day":"08","date_published":"2020-01-08T00:00:00Z","date_updated":"2026-04-08T07:26:44Z","year":"2020","oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"33-49","quality_controlled":"1","abstract":[{"lang":"eng","text":"Image translation refers to the task of mapping images from a visual domain to another. Given two unpaired collections of images, we aim to learn a mapping between the corpus-level style of each collection, while preserving semantic content shared across the two domains. We introduce xgan, a dual adversarial auto-encoder, which captures a shared representation of the common domain semantic content in an unsupervised way, while jointly learning the domain-to-domain image translations in both directions. We exploit ideas from the domain adaptation literature and define a semantic consistency loss which encourages the learned embedding to preserve semantics shared across domains. We report promising qualitative results for the task of face-to-cartoon translation. The cartoon dataset we collected for this purpose, “CartoonSet”, is also publicly available as a new benchmark for semantic style transfer at https://google.github.io/cartoonset/index.html."}],"editor":[{"first_name":"Richa","last_name":"Singh","full_name":"Singh, Richa"},{"full_name":"Vatsa, Mayank","last_name":"Vatsa","first_name":"Mayank"},{"first_name":"Vishal M.","full_name":"Patel, Vishal M.","last_name":"Patel"},{"full_name":"Ratha, Nalini","last_name":"Ratha","first_name":"Nalini"}],"publication_status":"published","date_created":"2020-07-05T22:00:46Z","external_id":{"arxiv":["1711.05139"]},"department":[{"_id":"ChLa"}],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9783030306717"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1711.05139"}],"scopus_import":"1","author":[{"orcid":"0000-0002-8407-0705","id":"3811D890-F248-11E8-B48F-1D18A9856A87","first_name":"Amélie","last_name":"Royer","full_name":"Royer, Amélie"},{"last_name":"Bousmalis","full_name":"Bousmalis, Konstantinos","first_name":"Konstantinos"},{"last_name":"Gouws","full_name":"Gouws, Stephan","first_name":"Stephan"},{"last_name":"Bertsch","full_name":"Bertsch, Fred","first_name":"Fred"},{"first_name":"Inbar","last_name":"Mosseri","full_name":"Mosseri, Inbar"},{"full_name":"Cole, Forrester","last_name":"Cole","first_name":"Forrester"},{"first_name":"Kevin","last_name":"Murphy","full_name":"Murphy, Kevin"}],"publication":"Domain Adaptation for Visual Understanding"},{"publication_status":"published","date_created":"2020-08-16T22:00:58Z","department":[{"_id":"KrCh"}],"external_id":{"arxiv":["2005.04018"],"isi":["000695272500021"]},"language":[{"iso":"eng"}],"volume":12225,"quality_controlled":"1","abstract":[{"text":"We study turn-based stochastic zero-sum games with lexicographic preferences over reachability and safety objectives. Stochastic games are standard models in control, verification, and synthesis of stochastic reactive systems that exhibit both randomness as well as angelic and demonic non-determinism. Lexicographic order allows to consider multiple objectives with a strict preference order over the satisfaction of the objectives. To the best of our knowledge, stochastic games with lexicographic objectives have not been studied before. We establish determinacy of such games and present strategy and computational complexity results. For strategy complexity, we show that lexicographically optimal strategies exist that are deterministic and memory is only required to remember the already satisfied and violated objectives. For a constant number of objectives, we show that the relevant decision problem is in   NP∩coNP , matching the current known bound for single objectives; and in general the decision problem is   PSPACE -hard and can be solved in   NEXPTIME∩coNEXPTIME . We present an algorithm that computes the lexicographically optimal strategies via a reduction to computation of optimal strategies in a sequence of single-objectives games. We have implemented our algorithm and report experimental results on various case studies.","lang":"eng"}],"author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Joost P","id":"4524F760-F248-11E8-B48F-1D18A9856A87","full_name":"Katoen, Joost P","last_name":"Katoen","orcid":"0000-0002-6143-1926"},{"first_name":"Maximilian","last_name":"Weininger","full_name":"Weininger, Maximilian"},{"first_name":"Tobias","last_name":"Winkler","full_name":"Winkler, Tobias"}],"file_date_updated":"2020-08-17T11:32:44Z","scopus_import":"1","publication":"International Conference on Computer Aided Verification","isi":1,"intvolume":"     12225","ec_funded":1,"file":[{"file_size":625056,"date_created":"2020-08-17T11:32:44Z","file_id":"8276","creator":"dernst","file_name":"2020_LNCS_CAV_Chatterjee.pdf","date_updated":"2020-08-17T11:32:44Z","content_type":"application/pdf","checksum":"093d4788d7d5b2ce0ffe64fbe7820043","success":1,"relation":"main_file","access_level":"open_access"}],"oa":1,"publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783030532901"]},"ddc":["000"],"arxiv":1,"alternative_title":["LNCS"],"doi":"10.1007/978-3-030-53291-8_21","_id":"8272","month":"07","title":"Stochastic games with lexicographic reachability-safety objectives","conference":{"name":"CAV: Computer Aided Verification"},"article_processing_charge":"No","related_material":{"record":[{"relation":"later_version","status":"public","id":"12738"}]},"citation":{"apa":"Chatterjee, K., Katoen, J. P., Weininger, M., &#38; Winkler, T. (2020). Stochastic games with lexicographic reachability-safety objectives. In <i>International Conference on Computer Aided Verification</i> (Vol. 12225, pp. 398–420). Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-53291-8_21\">https://doi.org/10.1007/978-3-030-53291-8_21</a>","ama":"Chatterjee K, Katoen JP, Weininger M, Winkler T. Stochastic games with lexicographic reachability-safety objectives. In: <i>International Conference on Computer Aided Verification</i>. Vol 12225. Springer Nature; 2020:398-420. doi:<a href=\"https://doi.org/10.1007/978-3-030-53291-8_21\">10.1007/978-3-030-53291-8_21</a>","ista":"Chatterjee K, Katoen JP, Weininger M, Winkler T. 2020. Stochastic games with lexicographic reachability-safety objectives. International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 12225, 398–420.","chicago":"Chatterjee, Krishnendu, Joost P Katoen, Maximilian Weininger, and Tobias Winkler. “Stochastic Games with Lexicographic Reachability-Safety Objectives.” In <i>International Conference on Computer Aided Verification</i>, 12225:398–420. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-030-53291-8_21\">https://doi.org/10.1007/978-3-030-53291-8_21</a>.","mla":"Chatterjee, Krishnendu, et al. “Stochastic Games with Lexicographic Reachability-Safety Objectives.” <i>International Conference on Computer Aided Verification</i>, vol. 12225, Springer Nature, 2020, pp. 398–420, doi:<a href=\"https://doi.org/10.1007/978-3-030-53291-8_21\">10.1007/978-3-030-53291-8_21</a>.","short":"K. Chatterjee, J.P. Katoen, M. Weininger, T. Winkler, in:, International Conference on Computer Aided Verification, Springer Nature, 2020, pp. 398–420.","ieee":"K. Chatterjee, J. P. Katoen, M. Weininger, and T. Winkler, “Stochastic games with lexicographic reachability-safety objectives,” in <i>International Conference on Computer Aided Verification</i>, 2020, vol. 12225, pp. 398–420."},"project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"},{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"}],"date_published":"2020-07-14T00:00:00Z","has_accepted_license":"1","date_updated":"2026-04-16T09:31:14Z","oa_version":"Published Version","year":"2020","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","page":"398-420","status":"public","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"type":"conference","publisher":"Springer Nature","day":"14"},{"oa_version":"Preprint","year":"2020","date_updated":"2026-04-16T09:32:27Z","date_published":"2020-05-15T00:00:00Z","project":[{"call_identifier":"H2020","name":"Teaching Old Crypto New Tricks","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815"}],"page":"623-651","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","status":"public","publisher":"Springer Nature","day":"15","type":"conference","doi":"10.1007/978-3-030-45374-9_21","alternative_title":["LNCS"],"title":"Improved discrete Gaussian and subgaussian analysis for lattice cryptography","month":"05","_id":"8339","citation":{"mla":"Genise, Nicholas, et al. “Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography.” <i>23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography</i>, vol. 12110, Springer Nature, 2020, pp. 623–51, doi:<a href=\"https://doi.org/10.1007/978-3-030-45374-9_21\">10.1007/978-3-030-45374-9_21</a>.","short":"N. Genise, D. Micciancio, C. Peikert, M. Walter, in:, 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography, Springer Nature, 2020, pp. 623–651.","ieee":"N. Genise, D. Micciancio, C. Peikert, and M. Walter, “Improved discrete Gaussian and subgaussian analysis for lattice cryptography,” in <i>23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography</i>, Edinburgh, United Kingdom, 2020, vol. 12110, pp. 623–651.","ama":"Genise N, Micciancio D, Peikert C, Walter M. Improved discrete Gaussian and subgaussian analysis for lattice cryptography. In: <i>23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography</i>. Vol 12110. Springer Nature; 2020:623-651. doi:<a href=\"https://doi.org/10.1007/978-3-030-45374-9_21\">10.1007/978-3-030-45374-9_21</a>","apa":"Genise, N., Micciancio, D., Peikert, C., &#38; Walter, M. (2020). Improved discrete Gaussian and subgaussian analysis for lattice cryptography. In <i>23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography</i> (Vol. 12110, pp. 623–651). Edinburgh, United Kingdom: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-45374-9_21\">https://doi.org/10.1007/978-3-030-45374-9_21</a>","chicago":"Genise, Nicholas, Daniele Micciancio, Chris Peikert, and Michael Walter. “Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography.” In <i>23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography</i>, 12110:623–51. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-030-45374-9_21\">https://doi.org/10.1007/978-3-030-45374-9_21</a>.","ista":"Genise N, Micciancio D, Peikert C, Walter M. 2020. Improved discrete Gaussian and subgaussian analysis for lattice cryptography. 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography. PKC: Public-Key Cryptography, LNCS, vol. 12110, 623–651."},"article_processing_charge":"No","conference":{"end_date":"2020-05-07","location":"Edinburgh, United Kingdom","start_date":"2020-05-04","name":"PKC: Public-Key Cryptography"},"ec_funded":1,"isi":1,"intvolume":"     12110","scopus_import":"1","publication":"23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography","author":[{"first_name":"Nicholas","last_name":"Genise","full_name":"Genise, Nicholas"},{"first_name":"Daniele","last_name":"Micciancio","full_name":"Micciancio, Daniele"},{"last_name":"Peikert","full_name":"Peikert, Chris","first_name":"Chris"},{"orcid":"0000-0003-3186-2482","first_name":"Michael","id":"488F98B0-F248-11E8-B48F-1D18A9856A87","last_name":"Walter","full_name":"Walter, Michael"}],"oa":1,"publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9783030453732"]},"main_file_link":[{"url":"https://eprint.iacr.org/2020/337","open_access":"1"}],"publication_status":"published","language":[{"iso":"eng"}],"external_id":{"isi":["001299210200021"]},"department":[{"_id":"KrPi"}],"date_created":"2020-09-06T22:01:13Z","quality_controlled":"1","volume":12110,"abstract":[{"text":"Discrete Gaussian distributions over lattices are central to lattice-based cryptography, and to the computational and mathematical aspects of lattices more broadly. The literature contains a wealth of useful theorems about the behavior of discrete Gaussians under convolutions and related operations. Yet despite their structural similarities, most of these theorems are formally incomparable, and their proofs tend to be monolithic and written nearly “from scratch,” making them unnecessarily hard to verify, understand, and extend.\r\nIn this work we present a modular framework for analyzing linear operations on discrete Gaussian distributions. The framework abstracts away the particulars of Gaussians, and usually reduces proofs to the choice of appropriate linear transformations and elementary linear algebra. To showcase the approach, we establish several general properties of discrete Gaussians, and show how to obtain all prior convolution theorems (along with some new ones) as straightforward corollaries. As another application, we describe a self-reduction for Learning With Errors (LWE) that uses a fixed number of samples to generate an unlimited number of additional ones (having somewhat larger error). The distinguishing features of our reduction are its simple analysis in our framework, and its exclusive use of discrete Gaussians without any loss in parameters relative to a prior mixed discrete-and-continuous approach.\r\nAs a contribution of independent interest, for subgaussian random matrices we prove a singular value concentration bound with explicitly stated constants, and we give tighter heuristics for specific distributions that are commonly used for generating lattice trapdoors. These bounds yield improvements in the concrete bit-security estimates for trapdoor lattice cryptosystems.","lang":"eng"}]},{"day":"08","type":"conference","publisher":"Springer Nature","status":"public","page":"3-15","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_updated":"2026-04-16T09:33:26Z","oa_version":"Preprint","year":"2020","date_published":"2020-12-08T00:00:00Z","project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020"}],"citation":{"ista":"Pietrzak KZ. 2020. Delayed authentication: Preventing replay and relay attacks in private contact tracing. Progress in Cryptology. INDOCRYPT: International Conference on Cryptology in IndiaLNCS vol. 12578, 3–15.","chicago":"Pietrzak, Krzysztof Z. “Delayed Authentication: Preventing Replay and Relay Attacks in Private Contact Tracing.” In <i>Progress in Cryptology</i>, 12578:3–15. LNCS. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-030-65277-7_1\">https://doi.org/10.1007/978-3-030-65277-7_1</a>.","apa":"Pietrzak, K. Z. (2020). Delayed authentication: Preventing replay and relay attacks in private contact tracing. In <i>Progress in Cryptology</i> (Vol. 12578, pp. 3–15). Bangalore, India: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-65277-7_1\">https://doi.org/10.1007/978-3-030-65277-7_1</a>","ama":"Pietrzak KZ. Delayed authentication: Preventing replay and relay attacks in private contact tracing. In: <i>Progress in Cryptology</i>. Vol 12578. LNCS. Springer Nature; 2020:3-15. doi:<a href=\"https://doi.org/10.1007/978-3-030-65277-7_1\">10.1007/978-3-030-65277-7_1</a>","ieee":"K. Z. Pietrzak, “Delayed authentication: Preventing replay and relay attacks in private contact tracing,” in <i>Progress in Cryptology</i>, Bangalore, India, 2020, vol. 12578, pp. 3–15.","short":"K.Z. Pietrzak, in:, Progress in Cryptology, Springer Nature, 2020, pp. 3–15.","mla":"Pietrzak, Krzysztof Z. “Delayed Authentication: Preventing Replay and Relay Attacks in Private Contact Tracing.” <i>Progress in Cryptology</i>, vol. 12578, Springer Nature, 2020, pp. 3–15, doi:<a href=\"https://doi.org/10.1007/978-3-030-65277-7_1\">10.1007/978-3-030-65277-7_1</a>."},"conference":{"location":"Bangalore, India","end_date":"2020-12-16","name":"INDOCRYPT: International Conference on Cryptology in India","start_date":"2020-12-13"},"article_processing_charge":"No","month":"12","title":"Delayed authentication: Preventing replay and relay attacks in private contact tracing","_id":"8987","doi":"10.1007/978-3-030-65277-7_1","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2020/418"}],"publication_identifier":{"isbn":["9783030652760"],"issn":["0302-9743"],"eissn":["1611-3349"]},"series_title":"LNCS","oa":1,"intvolume":"     12578","isi":1,"ec_funded":1,"scopus_import":"1","author":[{"full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654"}],"publication":"Progress in Cryptology","abstract":[{"text":"Currently several projects aim at designing and implementing protocols for privacy preserving automated contact tracing to help fight the current pandemic. Those proposal are quite similar, and in their most basic form basically propose an app for mobile phones which broadcasts frequently changing pseudorandom identifiers via (low energy) Bluetooth, and at the same time, the app stores IDs broadcast by phones in its proximity. Only if a user is tested positive, they upload either the beacons they did broadcast (which is the case in decentralized proposals as DP-3T, east and west coast PACT or Covid watch) or received (as in Popp-PT or ROBERT) during the last two weeks or so.\r\n\r\nVaudenay [eprint 2020/399] observes that this basic scheme (he considers the DP-3T proposal) succumbs to relay and even replay attacks, and proposes more complex interactive schemes which prevent those attacks without giving up too many privacy aspects. Unfortunately interaction is problematic for this application for efficiency and security reasons. The countermeasures that have been suggested so far are either not practical or give up on key privacy aspects. We propose a simple non-interactive variant of the basic protocol that\r\n(security) Provably prevents replay and (if location data is available) relay attacks.\r\n(privacy) The data of all parties (even jointly) reveals no information on the location or time where encounters happened.\r\n(efficiency) The broadcasted message can fit into 128 bits and uses only basic crypto (commitments and secret key authentication).\r\n\r\nTowards this end we introduce the concept of “delayed authentication”, which basically is a message authentication code where verification can be done in two steps, where the first doesn’t require the key, and the second doesn’t require the message.","lang":"eng"}],"quality_controlled":"1","volume":12578,"language":[{"iso":"eng"}],"date_created":"2021-01-03T23:01:23Z","external_id":{"isi":["000927592800001"]},"department":[{"_id":"KrPi"}],"publication_status":"published"},{"publication_status":"published","date_created":"2020-08-30T22:01:12Z","external_id":{"isi":["001415325700026"]},"department":[{"_id":"KrPi"}],"language":[{"iso":"eng"}],"volume":12171,"quality_controlled":"1","abstract":[{"lang":"eng","text":"Reverse firewalls were introduced at Eurocrypt 2015 by Miro-nov and Stephens-Davidowitz, as a method for protecting cryptographic protocols against attacks on the devices of the honest parties. In a nutshell: a reverse firewall is placed outside of a device and its goal is to “sanitize” the messages sent by it, in such a way that a malicious device cannot leak its secrets to the outside world. It is typically assumed that the cryptographic devices are attacked in a “functionality-preserving way” (i.e. informally speaking, the functionality of the protocol remains unchanged under this attacks). In their paper, Mironov and Stephens-Davidowitz construct a protocol for passively-secure two-party computations with firewalls, leaving extension of this result to stronger models as an open question.\r\nIn this paper, we address this problem by constructing a protocol for secure computation with firewalls that has two main advantages over the original protocol from Eurocrypt 2015. Firstly, it is a multiparty computation protocol (i.e. it works for an arbitrary number n of the parties, and not just for 2). Secondly, it is secure in much stronger corruption settings, namely in the active corruption model. More precisely: we consider an adversary that can fully corrupt up to 𝑛−1 parties, while the remaining parties are corrupt in a functionality-preserving way.\r\nOur core techniques are: malleable commitments and malleable non-interactive zero-knowledge, which in particular allow us to create a novel protocol for multiparty augmented coin-tossing into the well with reverse firewalls (that is based on a protocol of Lindell from Crypto 2001)."}],"author":[{"id":"B9CD0494-D033-11E9-B219-A439E6697425","first_name":"Suvradip","full_name":"Chakraborty, Suvradip","last_name":"Chakraborty"},{"first_name":"Stefan","last_name":"Dziembowski","full_name":"Dziembowski, Stefan"},{"last_name":"Nielsen","full_name":"Nielsen, Jesper Buus","first_name":"Jesper Buus"}],"scopus_import":"1","publication":"Advances in Cryptology – CRYPTO 2020","intvolume":"     12171","isi":1,"ec_funded":1,"acknowledgement":"We would like to thank the anonymous reviewers for their helpful comments and suggestions. The work was initiated while the first author was in IIT Madras, India. Part of this work was done while the author was visiting the University of Warsaw. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (682815 - TOCNeT) and from the Foundation for Polish Science under grant TEAM/2016-1/4 founded within the UE 2014–2020 Smart Growth Operational Program. The last author was supported by the Independent Research Fund Denmark project BETHE and the Concordium Blockchain Research Center, Aarhus University, Denmark.","publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9783030568795"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2019/1317"}],"alternative_title":["LNCS"],"doi":"10.1007/978-3-030-56880-1_26","_id":"8322","month":"08","title":"Reverse firewalls for actively secure MPCs","conference":{"name":"CRYPTO: Annual International Cryptology Conference","start_date":"2020-08-17","location":"Santa Barbara, CA, United States","end_date":"2020-08-21"},"article_processing_charge":"No","citation":{"apa":"Chakraborty, S., Dziembowski, S., &#38; Nielsen, J. B. (2020). Reverse firewalls for actively secure MPCs. In <i>Advances in Cryptology – CRYPTO 2020</i> (Vol. 12171, pp. 732–762). Santa Barbara, CA, United States: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-56880-1_26\">https://doi.org/10.1007/978-3-030-56880-1_26</a>","ama":"Chakraborty S, Dziembowski S, Nielsen JB. Reverse firewalls for actively secure MPCs. In: <i>Advances in Cryptology – CRYPTO 2020</i>. Vol 12171. Springer Nature; 2020:732-762. doi:<a href=\"https://doi.org/10.1007/978-3-030-56880-1_26\">10.1007/978-3-030-56880-1_26</a>","ista":"Chakraborty S, Dziembowski S, Nielsen JB. 2020. Reverse firewalls for actively secure MPCs. Advances in Cryptology – CRYPTO 2020. CRYPTO: Annual International Cryptology Conference, LNCS, vol. 12171, 732–762.","chicago":"Chakraborty, Suvradip, Stefan Dziembowski, and Jesper Buus Nielsen. “Reverse Firewalls for Actively Secure MPCs.” In <i>Advances in Cryptology – CRYPTO 2020</i>, 12171:732–62. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-030-56880-1_26\">https://doi.org/10.1007/978-3-030-56880-1_26</a>.","short":"S. Chakraborty, S. Dziembowski, J.B. Nielsen, in:, Advances in Cryptology – CRYPTO 2020, Springer Nature, 2020, pp. 732–762.","mla":"Chakraborty, Suvradip, et al. “Reverse Firewalls for Actively Secure MPCs.” <i>Advances in Cryptology – CRYPTO 2020</i>, vol. 12171, Springer Nature, 2020, pp. 732–62, doi:<a href=\"https://doi.org/10.1007/978-3-030-56880-1_26\">10.1007/978-3-030-56880-1_26</a>.","ieee":"S. Chakraborty, S. Dziembowski, and J. B. Nielsen, “Reverse firewalls for actively secure MPCs,” in <i>Advances in Cryptology – CRYPTO 2020</i>, Santa Barbara, CA, United States, 2020, vol. 12171, pp. 732–762."},"date_published":"2020-08-10T00:00:00Z","project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020"}],"date_updated":"2026-04-16T09:31:34Z","oa_version":"Preprint","year":"2020","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","page":"732-762","status":"public","publisher":"Springer Nature","day":"10","type":"conference"},{"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","page":"13-31","date_published":"2020-06-24T00:00:00Z","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF"}],"date_updated":"2026-04-16T09:29:42Z","oa_version":"Published Version","year":"2020","publisher":"Springer Nature","day":"24","type":"conference","status":"public","alternative_title":["LNCS"],"doi":"10.1007/978-3-030-51074-9_2","conference":{"name":"IJCAR: International Joint Conference on Automated Reasoning","start_date":"2020-07-01","location":"Paris, France","end_date":"2020-07-04"},"article_processing_charge":"No","citation":{"apa":"Baranowski, M., He, S., Lechner, M., Nguyen, T. S., &#38; Rakamarić, Z. (2020). An SMT theory of fixed-point arithmetic. In <i>Automated Reasoning</i> (Vol. 12166, pp. 13–31). Paris, France: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-51074-9_2\">https://doi.org/10.1007/978-3-030-51074-9_2</a>","ama":"Baranowski M, He S, Lechner M, Nguyen TS, Rakamarić Z. An SMT theory of fixed-point arithmetic. In: <i>Automated Reasoning</i>. Vol 12166. Springer Nature; 2020:13-31. doi:<a href=\"https://doi.org/10.1007/978-3-030-51074-9_2\">10.1007/978-3-030-51074-9_2</a>","ista":"Baranowski M, He S, Lechner M, Nguyen TS, Rakamarić Z. 2020. An SMT theory of fixed-point arithmetic. Automated Reasoning. IJCAR: International Joint Conference on Automated Reasoning, LNCS, vol. 12166, 13–31.","chicago":"Baranowski, Marek, Shaobo He, Mathias Lechner, Thanh Son Nguyen, and Zvonimir Rakamarić. “An SMT Theory of Fixed-Point Arithmetic.” In <i>Automated Reasoning</i>, 12166:13–31. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-030-51074-9_2\">https://doi.org/10.1007/978-3-030-51074-9_2</a>.","short":"M. Baranowski, S. He, M. Lechner, T.S. Nguyen, Z. Rakamarić, in:, Automated Reasoning, Springer Nature, 2020, pp. 13–31.","mla":"Baranowski, Marek, et al. “An SMT Theory of Fixed-Point Arithmetic.” <i>Automated Reasoning</i>, vol. 12166, Springer Nature, 2020, pp. 13–31, doi:<a href=\"https://doi.org/10.1007/978-3-030-51074-9_2\">10.1007/978-3-030-51074-9_2</a>.","ieee":"M. Baranowski, S. He, M. Lechner, T. S. Nguyen, and Z. Rakamarić, “An SMT theory of fixed-point arithmetic,” in <i>Automated Reasoning</i>, Paris, France, 2020, vol. 12166, pp. 13–31."},"_id":"8194","month":"06","title":"An SMT theory of fixed-point arithmetic","author":[{"first_name":"Marek","full_name":"Baranowski, Marek","last_name":"Baranowski"},{"full_name":"He, Shaobo","last_name":"He","first_name":"Shaobo"},{"first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner","full_name":"Lechner, Mathias"},{"first_name":"Thanh Son","last_name":"Nguyen","full_name":"Nguyen, Thanh Son"},{"first_name":"Zvonimir","full_name":"Rakamarić, Zvonimir","last_name":"Rakamarić"}],"scopus_import":"1","publication":"Automated Reasoning","isi":1,"intvolume":"     12166","main_file_link":[{"url":"https://doi.org/10.1007/978-3-030-51074-9_2","open_access":"1"}],"publication_identifier":{"isbn":["9783030510732"],"eissn":["1611-3349"],"issn":["0302-9743"]},"oa":1,"date_created":"2020-08-02T22:00:59Z","external_id":{"isi":["000884318000002"]},"department":[{"_id":"ToHe"}],"language":[{"iso":"eng"}],"publication_status":"published","abstract":[{"lang":"eng","text":"Fixed-point arithmetic is a popular alternative to floating-point arithmetic on embedded systems. Existing work on the verification of fixed-point programs relies on custom formalizations of fixed-point arithmetic, which makes it hard to compare the described techniques or reuse the implementations. In this paper, we address this issue by proposing and formalizing an SMT theory of fixed-point arithmetic. We present an intuitive yet comprehensive syntax of the fixed-point theory, and provide formal semantics for it based on rational arithmetic. We also describe two decision procedures for this theory: one based on the theory of bit-vectors and the other on the theory of reals. We implement the two decision procedures, and evaluate our implementations using existing mature SMT solvers on a benchmark suite we created. Finally, we perform a case study of using the theory we propose to verify properties of quantized neural networks."}],"volume":12166,"quality_controlled":"1"}]