[{"title":"Elucidating the structural determinants of the poxvirus core using multi-modal cryo-EM","author":[{"first_name":"Julia","full_name":"Datler, Julia","last_name":"Datler","orcid":"0000-0002-3616-8580","id":"3B12E2E6-F248-11E8-B48F-1D18A9856A87"}],"alternative_title":["ISTA thesis"],"oa_version":"Published Version","doi":"10.15479/at:ista:18766","page":"106","oa":1,"publisher":"Institute of Science and Technology Austria","has_accepted_license":"1","publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-049-7"]},"acknowledged_ssus":[{"_id":"EM-Fac"},{"_id":"LifeSc"},{"_id":"ScienComp"}],"file":[{"file_name":"PhD_thesis_Julia_Datler.docx","checksum":"3e51cab327c754045c3d29c1a50cc9a9","date_created":"2025-01-07T12:15:11Z","date_updated":"2025-01-07T12:15:11Z","relation":"source_file","file_id":"18769","file_size":38814932,"content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","access_level":"closed","creator":"jstanger"},{"creator":"jstanger","access_level":"open_access","success":1,"file_size":12044865,"content_type":"application/pdf","date_updated":"2025-01-07T12:15:14Z","relation":"main_file","file_id":"18770","date_created":"2025-01-07T12:15:14Z","checksum":"22fabe5b97950bf852212f6edb555173","file_name":"PhD_thesis_Julia_Datler.pdf"}],"supervisor":[{"last_name":"Schur","id":"48AD8942-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4790-8078","first_name":"Florian KM","full_name":"Schur, Florian KM"}],"year":"2024","month":"12","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"degree_awarded":"PhD","date_created":"2025-01-07T10:23:12Z","keyword":["cryo-EM","cryo-ET","cryo-SPA","Structural Virology","Poxvirus","Vaccinia Virus","Structural Biology"],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_updated":"2026-04-07T12:59:44Z","corr_author":"1","citation":{"apa":"Datler, J. (2024). <i>Elucidating the structural determinants of the poxvirus core using multi-modal cryo-EM</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:18766\">https://doi.org/10.15479/at:ista:18766</a>","ista":"Datler J. 2024. Elucidating the structural determinants of the poxvirus core using multi-modal cryo-EM. Institute of Science and Technology Austria.","ama":"Datler J. Elucidating the structural determinants of the poxvirus core using multi-modal cryo-EM. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:18766\">10.15479/at:ista:18766</a>","ieee":"J. Datler, “Elucidating the structural determinants of the poxvirus core using multi-modal cryo-EM,” Institute of Science and Technology Austria, 2024.","chicago":"Datler, Julia. “Elucidating the Structural Determinants of the Poxvirus Core Using Multi-Modal Cryo-EM.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:18766\">https://doi.org/10.15479/at:ista:18766</a>.","short":"J. Datler, Elucidating the Structural Determinants of the Poxvirus Core Using Multi-Modal Cryo-EM, Institute of Science and Technology Austria, 2024.","mla":"Datler, Julia. <i>Elucidating the Structural Determinants of the Poxvirus Core Using Multi-Modal Cryo-EM</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:18766\">10.15479/at:ista:18766</a>."},"acknowledgement":"This work was funded by the Austrian Science Fund (FWF) grant P31445 and ISTA. I\r\nwould like to express my gratitude to the Scientific Service Units, particularly the Lab\r\nSupport Facility, the Scientific Computing Facility and the Electron Microscopy Facility\r\nfor their tremendous support. I want to especially thank Alois for assisting me with the\r\ninstallation of countless new software and for troubleshooting cluster issues. A special\r\nthanks goes to Valentin for his outstanding support in cryo-EM data acquisition and\r\nhis ongoing help in improving the process to ensure that I obtained the best possible\r\ndata from my sample.","status":"public","day":"30","date_published":"2024-12-30T00:00:00Z","type":"dissertation","OA_place":"publisher","project":[{"name":"Structural conservation and diversity in retroviral capsid","_id":"26736D6A-B435-11E9-9278-68D0E5697425","grant_number":"P31445","call_identifier":"FWF"}],"_id":"18766","related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"12334"},{"id":"14979","status":"public","relation":"part_of_dissertation"}]},"article_processing_charge":"No","publication_status":"published","language":[{"iso":"eng"}],"ddc":["570"],"department":[{"_id":"GradSch"},{"_id":"FlSc"}],"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":[{"lang":"eng","text":"Poxviruses are large pleomorphic double-stranded DNA viruses that include well known members such as variola virus, the causative agent of smallpox, Mpox virus, as well as Vaccinia virus (VACV), which serves as a vaccination strain for formerly mentioned viruses. VACV is a valuable model for studying large pleomorphic DNA viruses in general and poxviruses specifically, as many features, such as core morphology and structural proteins, are well conserved within this family. Despite decades of research, our understanding of the structural components and proteins that comprise the poxvirus core in mature virions remains limited. Although major core proteins were identified via indirect experimental evidence, the core's complexity, with its large size, structure and number of involved proteins, has hindered efforts to achieve high-resolution insights and to define the roles of the individual proteins. The specific protein composition of the core's individual layers, including the palisade layer and the inner core wall, has remained unclear. In this study, we have merged multiple approaches, including single particle cryo electron microscopy of purified virus cores, cryo-electron tomography and subtomogram averaging of mature virions and molecular modeling to elucidate the structural determinants of the VACV core. Due to the lack of experimentally derived structures, either in situ or reconstituted in vitro, we used Alphafold to predict models of the putative major core protein candidates, A10, 23k, A3, A4, and L4. Our results show that the VACV core is composed of several layers with varying local symmetries, forming more intricate interactions than observed previously. This allowed us to identify several molecular building blocks forming the viral core lattice. In particular, we identified trimers of protein A10 as a major core structure that forms the palisade layer of the viral core. Additionally, we revealed that six petals of a flower shaped core pore within the core wall are composed of A10 trimers. Furthermore, we obtained a cryo-EM density for the inner core wall that could potentially accommodate an A3 dimer. Integrating descriptions of protein interactions from previous studies enabled us to provide a detailed structural model of the poxvirus core wall, and our findings indicate that the interactions within A10 trimers are likely consistent across orthopox- and parapoxviruses. This combined application of cryo-SPA and cryo-ET can help overcome obstacles in studying complex virus structures in the future, including their key assembly proteins, interactions, and the formation into a core lattice. Our work provides important fundamental new insights into poxvirus core architecture, also considering the recent re-emergence of poxviruses."}],"file_date_updated":"2025-01-07T12:15:14Z"},{"month":"07","year":"2024","article_type":"original","publication_identifier":{"issn":["1545-9993"],"eissn":["1545-9985"]},"has_accepted_license":"1","acknowledged_ssus":[{"_id":"ScienComp"},{"_id":"LifeSc"},{"_id":"EM-Fac"}],"file":[{"file_size":17485494,"content_type":"application/pdf","access_level":"open_access","success":1,"creator":"dernst","file_name":"2024_NatureStrucBio_Datler.pdf","checksum":"bda7bf65d81455480efaed8ca293b0db","date_created":"2024-07-22T11:27:22Z","date_updated":"2024-07-22T11:27:22Z","file_id":"17307","relation":"main_file"}],"date_updated":"2026-04-07T12:59:44Z","corr_author":"1","keyword":["Molecular Biology","Structural Biology"],"date_created":"2024-02-12T09:59:45Z","OA_type":"hybrid","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"page":"1114-1123","doi":"10.1038/s41594-023-01201-6","oa_version":"Published Version","title":"Multi-modal cryo-EM reveals trimers of protein A10 to form the palisade layer in poxvirus cores","author":[{"first_name":"Julia","full_name":"Datler, Julia","last_name":"Datler","id":"3B12E2E6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3616-8580"},{"full_name":"Hansen, Jesse","first_name":"Jesse","id":"1063c618-6f9b-11ec-9123-f912fccded63","orcid":"0000-0001-7967-2085","last_name":"Hansen"},{"first_name":"Andreas","full_name":"Thader, Andreas","last_name":"Thader","id":"3A18A7B8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Schlögl","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5621-8100","first_name":"Alois","full_name":"Schlögl, Alois"},{"id":"0c894dcf-897b-11ed-a09c-8186353224b0","last_name":"Bauer","full_name":"Bauer, Lukas W","first_name":"Lukas W"},{"full_name":"Hodirnau, Victor-Valentin","first_name":"Victor-Valentin","orcid":"0000-0003-3904-947X","id":"3661B498-F248-11E8-B48F-1D18A9856A87","last_name":"Hodirnau"},{"last_name":"Schur","id":"48AD8942-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4790-8078","first_name":"Florian KM","full_name":"Schur, Florian KM"}],"publisher":"Springer Nature","oa":1,"publication":"Nature Structural & Molecular Biology","publication_status":"published","article_processing_charge":"Yes (in subscription journal)","_id":"14979","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"18766"}],"link":[{"url":"https://ista.ac.at/en/news/down-to-the-core-of-poxviruses/","relation":"press_release","description":"News on ISTA Website"}]},"project":[{"grant_number":"P31445","_id":"26736D6A-B435-11E9-9278-68D0E5697425","name":"Structural conservation and diversity in retroviral capsid","call_identifier":"FWF"}],"OA_place":"publisher","isi":1,"license":"https://creativecommons.org/licenses/by/4.0/","abstract":[{"text":"Poxviruses are among the largest double-stranded DNA viruses, with members such as variola virus, monkeypox virus and the vaccination strain vaccinia virus (VACV). Knowledge about the structural proteins that form the viral core has remained sparse. While major core proteins have been annotated via indirect experimental evidence, their structures have remained elusive and they could not be assigned to individual core features. Hence, which proteins constitute which layers of the core, such as the palisade layer and the inner core wall, has remained enigmatic. Here we show, using a multi-modal cryo-electron microscopy (cryo-EM) approach in combination with AlphaFold molecular modeling, that trimers formed by the cleavage product of VACV protein A10 are the key component of the palisade layer. This allows us to place previously obtained descriptions of protein interactions within the core wall into perspective and to provide a detailed model of poxvirus core architecture. Importantly, we show that interactions within A10 trimers are likely generalizable over members of orthopox- and parapoxviruses.","lang":"eng"}],"volume":31,"file_date_updated":"2024-07-22T11:27:22Z","pmid":1,"ddc":["570"],"department":[{"_id":"FlSc"},{"_id":"ScienComp"},{"_id":"EM-Fac"}],"language":[{"iso":"eng"}],"quality_controlled":"1","scopus_import":"1","external_id":{"isi":["001158144600002"],"pmid":["38316877"]},"day":"01","APC_amount":"11700 EUR","date_published":"2024-07-01T00:00:00Z","status":"public","citation":{"ista":"Datler J, Hansen J, Thader A, Schlögl A, Bauer LW, Hodirnau V-V, Schur FK. 2024. Multi-modal cryo-EM reveals trimers of protein A10 to form the palisade layer in poxvirus cores. Nature Structural &#38; Molecular Biology. 31, 1114–1123.","apa":"Datler, J., Hansen, J., Thader, A., Schlögl, A., Bauer, L. W., Hodirnau, V.-V., &#38; Schur, F. K. (2024). Multi-modal cryo-EM reveals trimers of protein A10 to form the palisade layer in poxvirus cores. <i>Nature Structural &#38; Molecular Biology</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41594-023-01201-6\">https://doi.org/10.1038/s41594-023-01201-6</a>","chicago":"Datler, Julia, Jesse Hansen, Andreas Thader, Alois Schlögl, Lukas W Bauer, Victor-Valentin Hodirnau, and Florian KM Schur. “Multi-Modal Cryo-EM Reveals Trimers of Protein A10 to Form the Palisade Layer in Poxvirus Cores.” <i>Nature Structural &#38; Molecular Biology</i>. Springer Nature, 2024. <a href=\"https://doi.org/10.1038/s41594-023-01201-6\">https://doi.org/10.1038/s41594-023-01201-6</a>.","short":"J. Datler, J. Hansen, A. Thader, A. Schlögl, L.W. Bauer, V.-V. Hodirnau, F.K. Schur, Nature Structural &#38; Molecular Biology 31 (2024) 1114–1123.","mla":"Datler, Julia, et al. “Multi-Modal Cryo-EM Reveals Trimers of Protein A10 to Form the Palisade Layer in Poxvirus Cores.” <i>Nature Structural &#38; Molecular Biology</i>, vol. 31, Springer Nature, 2024, pp. 1114–23, doi:<a href=\"https://doi.org/10.1038/s41594-023-01201-6\">10.1038/s41594-023-01201-6</a>.","ama":"Datler J, Hansen J, Thader A, et al. Multi-modal cryo-EM reveals trimers of protein A10 to form the palisade layer in poxvirus cores. <i>Nature Structural &#38; Molecular Biology</i>. 2024;31:1114-1123. doi:<a href=\"https://doi.org/10.1038/s41594-023-01201-6\">10.1038/s41594-023-01201-6</a>","ieee":"J. Datler <i>et al.</i>, “Multi-modal cryo-EM reveals trimers of protein A10 to form the palisade layer in poxvirus cores,” <i>Nature Structural &#38; Molecular Biology</i>, vol. 31. Springer Nature, pp. 1114–1123, 2024."},"acknowledgement":"We thank A. Bergthaler (Research Center for Molecular Medicine of the Austrian Academy of Sciences) for providing VACV WR. We thank A. Nicholas and his team at the ISTA proteomics facility, and S. Elefante at the ISTA Scientific Computing facility for their support. We also thank F. Fäßler, D. Porley, T. Muthspiel and other members of the Schur group for support and helpful discussions. We also thank D. Castaño-Díez for support with Dynamo. We thank D. Farrell for his help optimizing the Rosetta protocol to refine the atomic model into the cryo-EM map with symmetry.\r\n\r\nF.K.M.S. acknowledges support from ISTA and EMBO. F.K.M.S. also received support from the Austrian Science Fund (FWF) grant P31445. This publication has been made possible in part by CZI grant DAF2021-234754 and grant https://doi.org/10.37921/812628ebpcwg from the Chan Zuckerberg Initiative DAF, an advised fund of Silicon Valley Community Foundation (funder https://doi.org/10.13039/100014989) awarded to F.K.M.S.\r\n\r\nThis research was also supported by the Scientific Service Units (SSUs) of ISTA through resources provided by Scientific Computing (SciComp), the Life Science Facility (LSF), and the Electron Microscopy Facility (EMF). We also acknowledge the use of COSMIC45 and Colabfold46.","intvolume":"        31","type":"journal_article"},{"month":"02","supervisor":[{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","last_name":"Barton","full_name":"Barton, Nicholas H","first_name":"Nicholas H"},{"last_name":"Tkačik","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6699-1455","first_name":"Gašper","full_name":"Tkačik, Gašper"}],"year":"2024","has_accepted_license":"1","publication_identifier":{"issn":["2663-337X"]},"acknowledged_ssus":[{"_id":"ScienComp"}],"file":[{"checksum":"b2d3da47c98d481577a4baf68944fe41","file_name":"hledik thesis pdfa 2b.pdf","date_updated":"2024-02-23T13:50:53Z","file_id":"15021","relation":"main_file","date_created":"2024-02-23T13:50:53Z","access_level":"open_access","success":1,"file_size":7102089,"content_type":"application/pdf","creator":"mhledik"},{"file_name":"hledik thesis source.zip","checksum":"eda9b9430da2610fee7ce1c1419a479a","date_created":"2024-02-23T13:50:54Z","date_updated":"2024-02-23T14:20:16Z","file_id":"15022","relation":"source_file","file_size":14014790,"content_type":"application/zip","access_level":"closed","creator":"mhledik"}],"date_updated":"2026-04-07T12:59:25Z","corr_author":"1","keyword":["Theoretical biology","Optimality","Evolution","Information"],"date_created":"2024-02-23T14:02:04Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","degree_awarded":"PhD","page":"158","doi":"10.15479/at:ista:15020","alternative_title":["ISTA Thesis"],"oa_version":"Published Version","title":"Genetic information and biological optimization","author":[{"first_name":"Michal","full_name":"Hledik, Michal","last_name":"Hledik","id":"4171253A-F248-11E8-B48F-1D18A9856A87"}],"oa":1,"publisher":"Institute of Science and Technology Austria","publication_status":"published","article_processing_charge":"No","_id":"15020","related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"7606"},{"status":"public","relation":"part_of_dissertation","id":"12081"},{"status":"public","relation":"part_of_dissertation","id":"7553"}]},"OA_place":"publisher","project":[{"call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","name":"International IST Doctoral Program"},{"name":"Can evolution minimize spurious signaling crosstalk to reach optimal performance?","grant_number":"RGP0034/2018","_id":"2665AAFE-B435-11E9-9278-68D0E5697425"},{"name":"Understanding the evolution of continuous genomes","_id":"bd6958e0-d553-11ed-ba76-86eba6a76c00","grant_number":"101055327"}],"abstract":[{"text":"This thesis consists of four distinct pieces of work within theoretical biology, with two themes in common: the concept of optimization in biological systems, and the use of information-theoretic tools to quantify biological stochasticity and statistical uncertainty.\r\nChapter 2 develops a statistical framework for studying biological systems which we believe to be optimized for a particular utility function, such as retinal neurons conveying information about visual stimuli. We formalize such beliefs as maximum-entropy Bayesian priors, constrained by the expected utility. We explore how such priors aid inference of system parameters with limited data and enable optimality hypothesis testing: is the utility higher than by chance?\r\nChapter 3 examines the ultimate biological optimization process: evolution by natural selection. As some individuals survive and reproduce more successfully than others, populations evolve towards fitter genotypes and phenotypes. We formalize this as accumulation of genetic information, and use population genetics theory to study how much such information can be accumulated per generation and maintained in the face of random mutation and genetic drift. We identify the population size and fitness variance as the key quantities that control information accumulation and maintenance.\r\nChapter 4 reuses the concept of genetic information from Chapter 3, but from a different perspective: we ask how much genetic information organisms actually need, in particular in the context of gene regulation. For example, how much information is needed to bind transcription factors at correct locations within the genome? Population genetics provides us with a refined answer: with an increasing population size, populations achieve higher fitness by maintaining more genetic information. Moreover, regulatory parameters experience selection pressure to optimize the fitness-information trade-off, i.e. minimize the information needed for a given fitness. This provides an evolutionary derivation of the optimization priors introduced in Chapter 2.\r\nChapter 5 proves an upper bound on mutual information between a signal and a communication channel output (such as neural activity). Mutual information is an important utility measure for biological systems, but its practical use can be difficult due to the large dimensionality of many biological channels. Sometimes, a lower bound on mutual information is computed by replacing the high-dimensional channel outputs with decodes (signal estimates). Our result provides a corresponding upper bound, provided that the decodes are the maximum posterior estimates of the signal.","lang":"eng"}],"file_date_updated":"2024-02-23T14:20:16Z","ddc":["576","519"],"department":[{"_id":"GradSch"},{"_id":"NiBa"},{"_id":"GaTk"}],"language":[{"iso":"eng"}],"day":"23","date_published":"2024-02-23T00:00:00Z","status":"public","citation":{"chicago":"Hledik, Michal. “Genetic Information and Biological Optimization.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:15020\">https://doi.org/10.15479/at:ista:15020</a>.","short":"M. Hledik, Genetic Information and Biological Optimization, Institute of Science and Technology Austria, 2024.","mla":"Hledik, Michal. <i>Genetic Information and Biological Optimization</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:15020\">10.15479/at:ista:15020</a>.","ama":"Hledik M. Genetic information and biological optimization. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:15020\">10.15479/at:ista:15020</a>","ieee":"M. Hledik, “Genetic information and biological optimization,” Institute of Science and Technology Austria, 2024.","ista":"Hledik M. 2024. Genetic information and biological optimization. Institute of Science and Technology Austria.","apa":"Hledik, M. (2024). <i>Genetic information and biological optimization</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:15020\">https://doi.org/10.15479/at:ista:15020</a>"},"ec_funded":1,"type":"dissertation"},{"type":"dissertation","ec_funded":1,"status":"public","day":"20","date_published":"2024-11-20T00:00:00Z","acknowledgement":"I am incredibly thankful for the outstanding support provided by ISTA, especially the Machine Shop team, who made conducting research much easier and more efficient. I am also grateful for the funding provided by European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie programme (665385) and The German Research Foundation grant DFG (SPP2205) “Evolutionary optimization of neuronal processing”.","citation":{"ieee":"R. K. Satapathy, “Mechanisms of visual integration and competition in innate behaviours in Drosophila melanogaster,” Institute of Science and Technology Austria, 2024.","ama":"Satapathy RK. Mechanisms of visual integration and competition in innate behaviours in Drosophila melanogaster. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:18568\">10.15479/at:ista:18568</a>","mla":"Satapathy, Roshan K. <i>Mechanisms of Visual Integration and Competition in Innate Behaviours in Drosophila Melanogaster</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:18568\">10.15479/at:ista:18568</a>.","short":"R.K. Satapathy, Mechanisms of Visual Integration and Competition in Innate Behaviours in Drosophila Melanogaster, Institute of Science and Technology Austria, 2024.","chicago":"Satapathy, Roshan K. “Mechanisms of Visual Integration and Competition in Innate Behaviours in Drosophila Melanogaster.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:18568\">https://doi.org/10.15479/at:ista:18568</a>.","apa":"Satapathy, R. K. (2024). <i>Mechanisms of visual integration and competition in innate behaviours in Drosophila melanogaster</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:18568\">https://doi.org/10.15479/at:ista:18568</a>","ista":"Satapathy RK. 2024. Mechanisms of visual integration and competition in innate behaviours in Drosophila melanogaster. Institute of Science and Technology Austria."},"department":[{"_id":"GradSch"},{"_id":"MaJö"}],"ddc":["573"],"abstract":[{"lang":"eng","text":"Locomotion is ubiquitous in the animal kingdom because an animal's survival depends on its ability to navigate its environment to find food, avoid predators and locate potential mates. These behaviours require control mechanisms that can extract information from the environment, particularly visual cues. Selective evolutionary pressures have thus refined such visuomotor transformations in a species-specific manner to meet the specific ecological and ethological challenges of each organism. However, a common challenge across organisms as visual information processing\r\nbecomes increasingly detailed is the mechanisms required to synthesise disparate pieces of information into a coherent percept or unified picture of the world. In this thesis, I investigate how disparate visual information is combined in the brain of Drosophila melanogaster to effectively guide locomotion.\r\nFor this, I first designed and built a behavioural setup to record locomotion and present visual stimuli to freely-walking fruit flies in a closed-loop manner. This setup allowed the investigation of innate visually-guided behaviours, including the optomotor reflex and courtship.\r\nSecond, taking advantage of my system I investigated the optomotor response, a reflexive visual stabilisation behaviour in which flies turn in the direction of global motion to minimise retinal slip. This behaviour is thought to be mediated by Lobula plate tangential cells (LPTCs); a complex network of optic-flow-sensitive neurons essential for self-motion estimation. Using a novel genetic mutant, I demonstrate that electrical coupling between two LPTC subtypes, contralateral HS and H2 neurons, regulates the balance between smooth optomotor turning and saccadic anti-optomotor responses. These findings underscore the critical role of binocular motion cue integration in guiding course control. Finally, I developed a novel behavioural paradigm in which a sexually aroused male fruit fly is presented with an optomotor distractor. This setup creates competition between two visual behaviours, courtship tracking and the  optomotor response, enabling me to explore how the visual system resolves this conflict. In this setting, males\r\nengaged in courtship selectively suppress their optomotor response based on the female's location. Furthermore, when this experiment is replicated with an “artificial female”, optogenetically aroused males alternate between tracking and optomotor responses. The probability and dynamics of this switching are determined by the relative strengths of the two competing stimuli. In summary, the results presented in this thesis explore two mechanisms – integration and competition - through which visual information is combined in the brain of the fruit fly to drive locomotion."}],"license":"https://creativecommons.org/licenses/by-sa/4.0/","file_date_updated":"2024-12-13T10:27:25Z","language":[{"iso":"eng"}],"article_processing_charge":"No","publication_status":"published","project":[{"call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","name":"International IST Doctoral Program"}],"OA_place":"publisher","_id":"18568","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"18444"}]},"oa":1,"publisher":"Institute of Science and Technology Austria","doi":"10.15479/at:ista:18568","page":"114","title":"Mechanisms of visual integration and competition in innate behaviours in Drosophila melanogaster","author":[{"full_name":"Satapathy, Roshan K","first_name":"Roshan K","id":"46046B7A-F248-11E8-B48F-1D18A9856A87","orcid":"0009-0006-2974-5075","last_name":"Satapathy"}],"alternative_title":["ISTA Thesis"],"oa_version":"Published Version","date_created":"2024-11-19T12:34:30Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_updated":"2026-04-07T13:00:36Z","corr_author":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","short":"CC BY-SA (4.0)","image":"/images/cc_by_sa.png","name":"Creative Commons Attribution-ShareAlike 4.0 International Public License (CC BY-SA 4.0)"},"degree_awarded":"PhD","month":"11","has_accepted_license":"1","publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-047-3"]},"acknowledged_ssus":[{"_id":"M-Shop"}],"file":[{"creator":"rsatapat","content_type":"application/pdf","file_size":10960975,"success":1,"access_level":"open_access","date_created":"2024-11-19T12:39:55Z","relation":"main_file","file_id":"18570","date_updated":"2024-11-19T12:39:55Z","file_name":"Roshan PhD thesis-Final.pdf","checksum":"340f2bfe882c8a85e11ec0687ca15f5e"},{"file_size":36695917,"content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","access_level":"closed","creator":"rsatapat","file_name":"Roshan PhD thesis-Final.docx","checksum":"0f846fce60d6ea511e07f77eff59a6a1","date_created":"2024-11-19T12:46:47Z","date_updated":"2024-12-13T10:27:25Z","relation":"source_file","file_id":"18571"}],"supervisor":[{"full_name":"Jösch, Maximilian A","first_name":"Maximilian A","orcid":"0000-0002-3937-1330","id":"2BD278E6-F248-11E8-B48F-1D18A9856A87","last_name":"Jösch"}],"year":"2024"},{"article_processing_charge":"Yes","publication_status":"published","publication":"Nature Communications","isi":1,"project":[{"_id":"9B767A34-BA93-11EA-9121-9846C619BF3A","grant_number":"429960716","name":"Evolution of Sensorimotor Transformation Across Diptera"}],"OA_place":"publisher","related_material":{"record":[{"id":"17488","relation":"research_data","status":"public"},{"id":"18568","relation":"dissertation_contains","status":"public"}]},"_id":"18444","ddc":["570"],"department":[{"_id":"MaJö"}],"pmid":1,"file_date_updated":"2024-10-21T12:11:10Z","volume":15,"abstract":[{"lang":"eng","text":"Animals rely on compensatory actions to maintain stability and navigate their environment efficiently. These actions depend on global visual motion cues known as optic-flow. While the optomotor response has been the traditional focus for studying optic-flow compensation in insects, its simplicity has been insufficient to determine the role of the intricate optic-flow processing network involved in visual course control. Here, we reveal a series of course control behaviours in Drosophila and link them to specific neural circuits. We show that bilateral electrical coupling of optic-flow-sensitive neurons in the fly’s lobula plate are required for a proper course control. This electrical interaction works alongside chemical synapses within the HS-H2 network to control the dynamics and direction of turning behaviours. Our findings reveal how insects use bilateral motion cues for navigation, assigning a new functional significance to the HS-H2 network and suggesting a previously unknown role for gap junctions in non-linear operations."}],"scopus_import":"1","external_id":{"isi":["001336422500001"],"pmid":["39396050"]},"quality_controlled":"1","language":[{"iso":"eng"}],"status":"public","date_published":"2024-10-12T00:00:00Z","APC_amount":"6828 EUR","article_number":"8830","day":"12","citation":{"ama":"Pokusaeva V, Satapathy RK, Symonova O, Jösch MA. Bilateral interactions of optic-flow sensitive neurons coordinate course control in flies. <i>Nature Communications</i>. 2024;15. doi:<a href=\"https://doi.org/10.1038/s41467-024-53173-w\">10.1038/s41467-024-53173-w</a>","ieee":"V. Pokusaeva, R. K. Satapathy, O. Symonova, and M. A. Jösch, “Bilateral interactions of optic-flow sensitive neurons coordinate course control in flies,” <i>Nature Communications</i>, vol. 15. Springer Nature, 2024.","chicago":"Pokusaeva, Victoria, Roshan K Satapathy, Olga Symonova, and Maximilian A Jösch. “Bilateral Interactions of Optic-Flow Sensitive Neurons Coordinate Course Control in Flies.” <i>Nature Communications</i>. Springer Nature, 2024. <a href=\"https://doi.org/10.1038/s41467-024-53173-w\">https://doi.org/10.1038/s41467-024-53173-w</a>.","mla":"Pokusaeva, Victoria, et al. “Bilateral Interactions of Optic-Flow Sensitive Neurons Coordinate Course Control in Flies.” <i>Nature Communications</i>, vol. 15, 8830, Springer Nature, 2024, doi:<a href=\"https://doi.org/10.1038/s41467-024-53173-w\">10.1038/s41467-024-53173-w</a>.","short":"V. Pokusaeva, R.K. Satapathy, O. Symonova, M.A. Jösch, Nature Communications 15 (2024).","apa":"Pokusaeva, V., Satapathy, R. K., Symonova, O., &#38; Jösch, M. A. (2024). Bilateral interactions of optic-flow sensitive neurons coordinate course control in flies. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-024-53173-w\">https://doi.org/10.1038/s41467-024-53173-w</a>","ista":"Pokusaeva V, Satapathy RK, Symonova O, Jösch MA. 2024. Bilateral interactions of optic-flow sensitive neurons coordinate course control in flies. Nature Communications. 15, 8830."},"acknowledgement":"We thank Georg Ammer and Alexander Borst for sharing anti-ShakB serum antibodies. We thank Nélia Varela and Eugenia Chiappe for the w1118;+;10XUAS-IVS-eGFPKir2.1/TM6B fly line, Augustin Hrvoje for the shakB[2] line, as well as Jesse Isaacman-Beck and Thomas R Clandinin for the gift of y1,w*;20XUAS-IVS-PhiC31;+ fly line. We also thank Armel Nicolas and Tomas Masson for the proteomic analysis, Ece Sönmez for help with fly crosses and dissections for protein analysis, and Lisa Hofer for assistance with the reconstruction experiments. We would also like to thank Laura Burnett for drawing scientific illustrations used in the figures. We are particularly grateful to members of the Siekhaus, the Kondrashov, and the Chiappe group for providing material support and technical advice. We are grateful to Daria Siekhaus, Eugenia Chiappe, Alexander Borst, Ben deBivort, and all the members of the Joesch laboratory for valuable discussions and comments on the manuscript. Stocks from the Bloomington Drosophila Stock Center (NIH P40OD018537) and the Vienna Drosophila Resource Center were used in this study. The Scientific Service Units of ISTA supported the project through resources provided by the Imaging and Optics Facility, MIBA Machine Shop, and the Lab Support Facility, as well as Vienna Drosophila Research Centre. This work was funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) as part of the SPP 2205 – 429960716 (M.J.).","intvolume":"        15","type":"journal_article","month":"10","file":[{"file_name":"2024_NatureComm_Pokusaeva.pdf","checksum":"2af4d6e7364329107aa94d072d594ce0","date_created":"2024-10-21T12:11:10Z","date_updated":"2024-10-21T12:11:10Z","relation":"main_file","file_id":"18459","file_size":8276667,"content_type":"application/pdf","access_level":"open_access","success":1,"creator":"dernst"}],"article_type":"original","acknowledged_ssus":[{"_id":"Bio"},{"_id":"M-Shop"},{"_id":"LifeSc"}],"publication_identifier":{"eissn":["2041-1723"]},"has_accepted_license":"1","DOAJ_listed":"1","year":"2024","OA_type":"gold","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2024-10-20T22:02:05Z","corr_author":"1","date_updated":"2026-04-07T13:00:35Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"doi":"10.1038/s41467-024-53173-w","author":[{"orcid":"0000-0001-7660-444X","id":"3184041C-F248-11E8-B48F-1D18A9856A87","last_name":"Pokusaeva","full_name":"Pokusaeva, Victoria","first_name":"Victoria"},{"last_name":"Satapathy","orcid":"0009-0006-2974-5075","id":"46046B7A-F248-11E8-B48F-1D18A9856A87","first_name":"Roshan K","full_name":"Satapathy, Roshan K"},{"orcid":"0000-0003-2012-9947","id":"3C0C7BC6-F248-11E8-B48F-1D18A9856A87","last_name":"Symonova","full_name":"Symonova, Olga","first_name":"Olga"},{"last_name":"Jösch","id":"2BD278E6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3937-1330","first_name":"Maximilian A","full_name":"Jösch, Maximilian A"}],"title":"Bilateral interactions of optic-flow sensitive neurons coordinate course control in flies","oa_version":"Published Version","publisher":"Springer Nature","oa":1},{"ec_funded":1,"type":"dissertation","citation":{"ieee":"F. Pedrotti, “Functional inequalities and convergence of stochastic processes,” Institute of Science and Technology Austria, 2024.","ama":"Pedrotti F. Functional inequalities and convergence of stochastic processes. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:17336\">10.15479/at:ista:17336</a>","mla":"Pedrotti, Francesco. <i>Functional Inequalities and Convergence of Stochastic Processes</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:17336\">10.15479/at:ista:17336</a>.","short":"F. Pedrotti, Functional Inequalities and Convergence of Stochastic Processes, Institute of Science and Technology Austria, 2024.","chicago":"Pedrotti, Francesco. “Functional Inequalities and Convergence of Stochastic Processes.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:17336\">https://doi.org/10.15479/at:ista:17336</a>.","apa":"Pedrotti, F. (2024). <i>Functional inequalities and convergence of stochastic processes</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:17336\">https://doi.org/10.15479/at:ista:17336</a>","ista":"Pedrotti F. 2024. Functional inequalities and convergence of stochastic processes. Institute of Science and Technology Austria."},"date_published":"2024-07-31T00:00:00Z","day":"31","status":"public","language":[{"iso":"eng"}],"file_date_updated":"2024-08-02T09:27:15Z","abstract":[{"lang":"eng","text":"This thesis deals with the study of stochastic processes and their ergodicity properties. The\r\nvariety of problems encountered calls for a set of different approaches, ranging from classical to\r\nmodern ones: a special place is held by probabilistic methods based on couplings, by functional\r\ninequalities, and by the theory of gradient flows in the space of measures.\r\n\r\nThe material is organized as follows. Chapter 1 contains the introduction to this thesis, starting\r\nwith a general presentation of some of the relevant topics. Section 1.1 is dedicated to the\r\ntheory of gradient flows in metric spaces, and introduces the first contribution of this thesis\r\n[DSMP24], which is presented in detail in Chapter 2. Section 1.2 moves to the topic of\r\ncurvature of Markov chains, concluding with a brief description of our second contribution\r\n[Ped23], which is included in Chapter 3. Section 1.3 discusses applications of stochastic\r\nprocesses to the theory of sampling, in particular the recent framework of score-based diffusion\r\nmodels, and our contribution [PMM24], which is contained in Chapter 4. Section 1.4 discusses\r\nsome related problems, concerning the regularization properties of the heat flow. It serves\r\nas a motivation for the work [BP24], which we report in Chapter 5. Finally, Section 1.5\r\ndiscusses the last contribution of this thesis, which can be found in Chapter 6. It deals with\r\nthe convergence to equilibrium of a particular stochastic model from quantitative genetics:\r\nthis is established via some functional inequalities, which we prove with probabilistic arguments\r\nbased on couplings.\r\n"}],"department":[{"_id":"GradSch"},{"_id":"JaMa"}],"ddc":["500","510","515","519"],"related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"17351"},{"id":"17353","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"17350"},{"id":"17352","status":"public","relation":"part_of_dissertation"},{"id":"17143","status":"public","relation":"part_of_dissertation"}]},"_id":"17336","project":[{"name":"Optimal Transport and Stochastic Dynamics","grant_number":"716117","_id":"256E75B8-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","grant_number":"F6504","name":"Taming Complexity in Partial Differential Systems"}],"OA_place":"publisher","publication_status":"published","article_processing_charge":"No","oa":1,"publisher":"Institute of Science and Technology Austria","oa_version":"Published Version","alternative_title":["ISTA Thesis"],"author":[{"id":"d3ac8ac6-dc8d-11ea-abe3-e2a9628c4c3c","last_name":"Pedrotti","full_name":"Pedrotti, Francesco","first_name":"Francesco"}],"title":"Functional inequalities and convergence of stochastic processes","page":"183","doi":"10.15479/at:ista:17336","degree_awarded":"PhD","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"corr_author":"1","date_updated":"2026-04-07T13:00:03Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_created":"2024-07-29T09:14:14Z","year":"2024","supervisor":[{"first_name":"Jan","full_name":"Maas, Jan","last_name":"Maas","orcid":"0000-0002-0845-1338","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87"}],"file":[{"file_name":"thesis_final.pdf","checksum":"11650bab714ef85ad43a287060850523","date_created":"2024-08-02T09:23:26Z","date_updated":"2024-08-02T09:23:26Z","relation":"main_file","file_id":"17366","file_size":2941599,"content_type":"application/pdf","access_level":"open_access","success":1,"creator":"fpedrott"},{"date_created":"2024-08-02T09:27:15Z","relation":"source_file","file_id":"17367","date_updated":"2024-08-02T09:27:15Z","file_name":"thesis_final_source.zip","checksum":"c30ba5611941226cf1bfc867c25b1e80","creator":"fpedrott","content_type":"application/x-zip-compressed","file_size":6293375,"access_level":"closed"}],"publication_identifier":{"issn":["2663-337X"]},"has_accepted_license":"1","month":"07"},{"author":[{"last_name":"Dello Schiavo","id":"ECEBF480-9E4F-11EA-B557-B0823DDC885E","orcid":"0000-0002-9881-6870","first_name":"Lorenzo","full_name":"Dello Schiavo, Lorenzo"},{"full_name":"Maas, Jan","first_name":"Jan","orcid":"0000-0002-0845-1338","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","last_name":"Maas"},{"last_name":"Pedrotti","id":"d3ac8ac6-dc8d-11ea-abe3-e2a9628c4c3c","first_name":"Francesco","full_name":"Pedrotti, Francesco"}],"title":"Local conditions for global convergence of gradient flows and proximal point sequences in metric spaces","oa_version":"Preprint","doi":"10.1090/tran/9156","page":"3779-3804","oa":1,"publisher":"American Mathematical Society","article_type":"original","publication_identifier":{"issn":["0002-9947"],"eissn":["1088-6850"]},"year":"2024","month":"06","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2024-06-16T22:01:06Z","date_updated":"2026-04-07T13:00:02Z","citation":{"chicago":"Dello Schiavo, Lorenzo, Jan Maas, and Francesco Pedrotti. “Local Conditions for Global Convergence of Gradient Flows and Proximal Point Sequences in Metric Spaces.” <i>Transactions of the American Mathematical Society</i>. American Mathematical Society, 2024. <a href=\"https://doi.org/10.1090/tran/9156\">https://doi.org/10.1090/tran/9156</a>.","short":"L. Dello Schiavo, J. Maas, F. Pedrotti, Transactions of the American Mathematical Society 377 (2024) 3779–3804.","mla":"Dello Schiavo, Lorenzo, et al. “Local Conditions for Global Convergence of Gradient Flows and Proximal Point Sequences in Metric Spaces.” <i>Transactions of the American Mathematical Society</i>, vol. 377, no. 6, American Mathematical Society, 2024, pp. 3779–804, doi:<a href=\"https://doi.org/10.1090/tran/9156\">10.1090/tran/9156</a>.","ama":"Dello Schiavo L, Maas J, Pedrotti F. Local conditions for global convergence of gradient flows and proximal point sequences in metric spaces. <i>Transactions of the American Mathematical Society</i>. 2024;377(6):3779-3804. doi:<a href=\"https://doi.org/10.1090/tran/9156\">10.1090/tran/9156</a>","ieee":"L. Dello Schiavo, J. Maas, and F. Pedrotti, “Local conditions for global convergence of gradient flows and proximal point sequences in metric spaces,” <i>Transactions of the American Mathematical Society</i>, vol. 377, no. 6. American Mathematical Society, pp. 3779–3804, 2024.","ista":"Dello Schiavo L, Maas J, Pedrotti F. 2024. Local conditions for global convergence of gradient flows and proximal point sequences in metric spaces. Transactions of the American Mathematical Society. 377(6), 3779–3804.","apa":"Dello Schiavo, L., Maas, J., &#38; Pedrotti, F. (2024). Local conditions for global convergence of gradient flows and proximal point sequences in metric spaces. <i>Transactions of the American Mathematical Society</i>. American Mathematical Society. <a href=\"https://doi.org/10.1090/tran/9156\">https://doi.org/10.1090/tran/9156</a>"},"acknowledgement":"The authors gratefully acknowledges support by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No. 716117). This research was funded in part by the Austrian Science Fund (FWF) project 10.55776/ESP208. This research was funded in part by the Austrian Science Fund (FWF) project 10.55776/F65","arxiv":1,"status":"public","date_published":"2024-06-01T00:00:00Z","day":"01","type":"journal_article","ec_funded":1,"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2304.05239","open_access":"1"}],"intvolume":"       377","isi":1,"project":[{"call_identifier":"H2020","grant_number":"716117","_id":"256E75B8-B435-11E9-9278-68D0E5697425","name":"Optimal Transport and Stochastic Dynamics"},{"grant_number":"F6504","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","name":"Taming Complexity in Partial Differential Systems"},{"_id":"34dbf174-11ca-11ed-8bc3-afe9d43d4b9c","grant_number":"E208","name":"Configuration Spaces over Non-Smooth Spaces"}],"related_material":{"record":[{"id":"17336","status":"public","relation":"dissertation_contains"}]},"_id":"17143","issue":"6","article_processing_charge":"No","publication_status":"published","publication":"Transactions of the American Mathematical Society","scopus_import":"1","external_id":{"isi":["001203273300001"],"arxiv":["2304.05239"]},"quality_controlled":"1","language":[{"iso":"eng"}],"department":[{"_id":"JaMa"}],"volume":377,"abstract":[{"text":"This paper deals with local criteria for the convergence to a global minimiser for gradient flow trajectories and their discretisations. To obtain quantitative estimates on the speed of convergence, we consider variations on the classical Kurdyka–Łojasiewicz inequality for a large class of parameter functions. Our assumptions are given in terms of the initial data, without any reference to an equilibrium point. The main results are convergence statements for gradient flow curves and proximal point sequences to a global minimiser, together with sharp quantitative estimates on the speed of convergence. These convergence results apply in the general setting of lower semicontinuous functionals on complete metric spaces, generalising recent results for smooth functionals on Rn. While the non-smooth setting covers very general spaces, it is also useful for (non)-smooth functionals on Rn.\r\n.","lang":"eng"}]},{"oa_version":"Preprint","citation":{"ama":"Pedrotti F, Maas J, Mondelli M. Improved convergence of score-based diffusion models via prediction-correction. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2305.14164\">10.48550/arXiv.2305.14164</a>","ieee":"F. Pedrotti, J. Maas, and M. Mondelli, “Improved convergence of score-based diffusion models via prediction-correction,” <i>arXiv</i>. .","chicago":"Pedrotti, Francesco, Jan Maas, and Marco Mondelli. “Improved Convergence of Score-Based Diffusion Models via Prediction-Correction.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2305.14164\">https://doi.org/10.48550/arXiv.2305.14164</a>.","mla":"Pedrotti, Francesco, et al. “Improved Convergence of Score-Based Diffusion Models via Prediction-Correction.” <i>ArXiv</i>, doi:<a href=\"https://doi.org/10.48550/arXiv.2305.14164\">10.48550/arXiv.2305.14164</a>.","short":"F. Pedrotti, J. Maas, M. Mondelli, ArXiv (n.d.).","apa":"Pedrotti, F., Maas, J., &#38; Mondelli, M. (n.d.). Improved convergence of score-based diffusion models via prediction-correction. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2305.14164\">https://doi.org/10.48550/arXiv.2305.14164</a>","ista":"Pedrotti F, Maas J, Mondelli M. Improved convergence of score-based diffusion models via prediction-correction. arXiv, <a href=\"https://doi.org/10.48550/arXiv.2305.14164\">10.48550/arXiv.2305.14164</a>."},"title":"Improved convergence of score-based diffusion models via prediction-correction","author":[{"id":"d3ac8ac6-dc8d-11ea-abe3-e2a9628c4c3c","last_name":"Pedrotti","full_name":"Pedrotti, Francesco","first_name":"Francesco"},{"last_name":"Maas","orcid":"0000-0002-0845-1338","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","full_name":"Maas, Jan"},{"last_name":"Mondelli","orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco","full_name":"Mondelli, Marco"}],"day":"06","date_published":"2024-06-06T00:00:00Z","status":"public","arxiv":1,"doi":"10.48550/arXiv.2305.14164","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2305.14164"}],"type":"preprint","oa":1,"_id":"17350","year":"2024","related_material":{"record":[{"id":"18897","relation":"later_version","status":"public"},{"id":"17336","status":"public","relation":"dissertation_contains"}]},"OA_place":"repository","project":[{"grant_number":"F6504","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","name":"Taming Complexity in Partial Differential Systems"},{"name":"Prix Lopez-Loretta 2019 - Marco Mondelli","_id":"059876FA-7A3F-11EA-A408-12923DDC885E"}],"publication":"arXiv","publication_status":"draft","article_processing_charge":"No","month":"06","language":[{"iso":"eng"}],"external_id":{"arxiv":["2305.14164"]},"abstract":[{"lang":"eng","text":"Score-based generative models (SGMs) are powerful tools to sample from\r\ncomplex data distributions. Their underlying idea is to (i) run a forward\r\nprocess for time $T_1$ by adding noise to the data, (ii) estimate its score\r\nfunction, and (iii) use such estimate to run a reverse process. As the reverse\r\nprocess is initialized with the stationary distribution of the forward one, the\r\nexisting analysis paradigm requires $T_1\\to\\infty$. This is however\r\nproblematic: from a theoretical viewpoint, for a given precision of the score\r\napproximation, the convergence guarantee fails as $T_1$ diverges; from a\r\npractical viewpoint, a large $T_1$ increases computational costs and leads to\r\nerror propagation. This paper addresses the issue by considering a version of\r\nthe popular predictor-corrector scheme: after running the forward process, we\r\nfirst estimate the final distribution via an inexact Langevin dynamics and then\r\nrevert the process. Our key technical contribution is to provide convergence\r\nguarantees which require to run the forward process only for a fixed finite\r\ntime $T_1$. Our bounds exhibit a mild logarithmic dependence on the input\r\ndimension and the subgaussian norm of the target distribution, have minimal\r\nassumptions on the data, and require only to control the $L^2$ loss on the\r\nscore approximation, which is the quantity minimized in practice."}],"date_updated":"2026-04-07T13:00:02Z","corr_author":"1","date_created":"2024-07-31T07:56:40Z","department":[{"_id":"JaMa"},{"_id":"MaMo"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"JaMa"}],"date_created":"2024-07-31T08:07:40Z","corr_author":"1","abstract":[{"lang":"eng","text":"We prove upper bounds on the $L^\\infty$-Wasserstein distance from optimal\r\ntransport between strongly log-concave probability densities and log-Lipschitz\r\nperturbations. In the simplest setting, such a bound amounts to a\r\ntransport-information inequality involving the $L^\\infty$-Wasserstein metric\r\nand the relative $L^\\infty$-Fisher information. We show that this inequality\r\ncan be sharpened significantly in situations where the involved densities are\r\nanisotropic. Our proof is based on probabilistic techniques using Langevin\r\ndynamics. As an application of these results, we obtain sharp exponential rates\r\nof convergence in Fisher's infinitesimal model from quantitative genetics,\r\ngeneralising recent results by Calvez, Poyato, and Santambrogio in dimension 1\r\nto arbitrary dimensions."}],"date_updated":"2026-04-07T13:00:02Z","external_id":{"arxiv":["2402.04151"]},"language":[{"iso":"eng"}],"month":"02","article_processing_charge":"No","publication":"arXiv","publication_status":"draft","project":[{"name":"Taming Complexity in Partial Differential Systems","grant_number":"F6504","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2"},{"_id":"34d33d68-11ca-11ed-8bc3-ec13763c0ca8","grant_number":"26293","name":"The impact of deleterious mutations on small populations"}],"OA_place":"repository","related_material":{"record":[{"relation":"later_version","status":"public","id":"20050"},{"id":"17336","relation":"dissertation_contains","status":"public"}]},"year":"2024","_id":"17352","oa":1,"type":"preprint","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2402.04151"}],"doi":"10.48550/arXiv.2402.04151","arxiv":1,"status":"public","date_published":"2024-02-07T00:00:00Z","article_number":"2402.04151","day":"07","author":[{"first_name":"Kseniia","full_name":"Khudiakova, Kseniia","last_name":"Khudiakova","id":"4E6DC800-AE37-11E9-AC72-31CAE5697425","orcid":"0000-0002-6246-1465"},{"first_name":"Jan","full_name":"Maas, Jan","last_name":"Maas","orcid":"0000-0002-0845-1338","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Pedrotti","id":"d3ac8ac6-dc8d-11ea-abe3-e2a9628c4c3c","first_name":"Francesco","full_name":"Pedrotti, Francesco"}],"title":"L∞-optimal transport of anisotropic log-concave measures and exponential convergence in Fisher's infinitesimal model","oa_version":"Preprint","citation":{"apa":"Khudiakova, K., Maas, J., &#38; Pedrotti, F. (n.d.). L∞-optimal transport of anisotropic log-concave measures and exponential convergence in Fisher’s infinitesimal model. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2402.04151\">https://doi.org/10.48550/arXiv.2402.04151</a>","ista":"Khudiakova K, Maas J, Pedrotti F. L∞-optimal transport of anisotropic log-concave measures and exponential convergence in Fisher’s infinitesimal model. arXiv, 2402.04151.","ama":"Khudiakova K, Maas J, Pedrotti F. L∞-optimal transport of anisotropic log-concave measures and exponential convergence in Fisher’s infinitesimal model. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2402.04151\">10.48550/arXiv.2402.04151</a>","ieee":"K. Khudiakova, J. Maas, and F. Pedrotti, “L∞-optimal transport of anisotropic log-concave measures and exponential convergence in Fisher’s infinitesimal model,” <i>arXiv</i>. .","chicago":"Khudiakova, Kseniia, Jan Maas, and Francesco Pedrotti. “L∞-Optimal Transport of Anisotropic Log-Concave Measures and Exponential Convergence in Fisher’s Infinitesimal Model.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2402.04151\">https://doi.org/10.48550/arXiv.2402.04151</a>.","mla":"Khudiakova, Kseniia, et al. “L∞-Optimal Transport of Anisotropic Log-Concave Measures and Exponential Convergence in Fisher’s Infinitesimal Model.” <i>ArXiv</i>, 2402.04151, doi:<a href=\"https://doi.org/10.48550/arXiv.2402.04151\">10.48550/arXiv.2402.04151</a>.","short":"K. Khudiakova, J. Maas, F. Pedrotti, ArXiv (n.d.)."}},{"article_processing_charge":"No","month":"05","publication":"arXiv","publication_status":"draft","OA_place":"repository","_id":"17353","related_material":{"record":[{"id":"20591","status":"public","relation":"later_version"},{"id":"17336","status":"public","relation":"dissertation_contains"}]},"year":"2024","date_created":"2024-07-31T08:17:14Z","department":[{"_id":"JaMa"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"In this paper we derive estimates for the Hessian of the logarithm\r\n(log-Hessian) for solutions to the heat equation. For initial data in the form\r\nof log-Lipschitz perturbation of strongly log-concave measures, the log-Hessian\r\nadmits an explicit, uniform (in space) lower bound. This yields a new estimate\r\nfor the Lipschitz constant of a transport map pushing forward the standard\r\nGaussian to a measure in this class. Further connections are discussed with\r\nscore-based diffusion models and improved Gaussian logarithmic Sobolev\r\ninequalities. Finally, we show that assuming only fast decay of the tails of\r\nthe initial datum does not suffice to guarantee uniform log-Hessian upper\r\nbounds.","lang":"eng"}],"date_updated":"2026-04-07T13:00:02Z","corr_author":"1","external_id":{"arxiv":["2404.15205"]},"language":[{"iso":"eng"}],"status":"public","arxiv":1,"doi":"10.48550/arXiv.2404.15205","day":"08","article_number":"2404.15205","date_published":"2024-05-08T00:00:00Z","title":"Heat flow, log-concavity, and Lipschitz transport maps","author":[{"full_name":"Brigati, Giovanni","first_name":"Giovanni","id":"63ff57e8-1fbb-11ee-88f2-f558ffc59cf1","last_name":"Brigati"},{"first_name":"Francesco","full_name":"Pedrotti, Francesco","last_name":"Pedrotti","id":"d3ac8ac6-dc8d-11ea-abe3-e2a9628c4c3c"}],"citation":{"ama":"Brigati G, Pedrotti F. Heat flow, log-concavity, and Lipschitz transport maps. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2404.15205\">10.48550/arXiv.2404.15205</a>","ieee":"G. Brigati and F. Pedrotti, “Heat flow, log-concavity, and Lipschitz transport maps,” <i>arXiv</i>. .","chicago":"Brigati, Giovanni, and Francesco Pedrotti. “Heat Flow, Log-Concavity, and Lipschitz Transport Maps.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2404.15205\">https://doi.org/10.48550/arXiv.2404.15205</a>.","short":"G. Brigati, F. Pedrotti, ArXiv (n.d.).","mla":"Brigati, Giovanni, and Francesco Pedrotti. “Heat Flow, Log-Concavity, and Lipschitz Transport Maps.” <i>ArXiv</i>, 2404.15205, doi:<a href=\"https://doi.org/10.48550/arXiv.2404.15205\">10.48550/arXiv.2404.15205</a>.","apa":"Brigati, G., &#38; Pedrotti, F. (n.d.). Heat flow, log-concavity, and Lipschitz transport maps. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2404.15205\">https://doi.org/10.48550/arXiv.2404.15205</a>","ista":"Brigati G, Pedrotti F. Heat flow, log-concavity, and Lipschitz transport maps. arXiv, 2404.15205."},"oa_version":"Preprint","type":"preprint","oa":1,"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2404.15205","open_access":"1"}]},{"_id":"18088","related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"10408"},{"id":"11476","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"18086"},{"relation":"part_of_dissertation","status":"public","id":"10049"}]},"OA_place":"publisher","project":[{"call_identifier":"H2020","name":"International IST Doctoral Program","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","article_processing_charge":"No","language":[{"iso":"eng"}],"license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":[{"text":"Instant messaging applications like Whatsapp, Signal or Telegram have become ubiquitous in today's society.\r\nMany of them provide not only end-to-end encryption, but also security guarantees even when the key material gets compromised.\r\nThese are achieved through frequent key update performed by users.\r\nIn particular, the compromise of a group key should preserve confidentiality of previously exchanged messages (forward secrecy), and a subsequent key update will ensure security for future ones (post-compromise security).\r\nThough great protocols for one-on-one communication have been known for some time, the design of ones that scale efficiently for larger groups while achieving akin security guarantees is a hard problem.\r\nA great deal of research has been aimed at this topic, much of it under the umbrella of the Messaging Layer Security (MLS) working group at the IETF. \r\nStarted in 2018, this joint effort by academics and industry culminated in 2023 with the publication of the first standard for secure group messaging [IETF, RFC9420].\r\n\r\nAt the core of secure group messaging is a cryptographic primitive termed Continuous Group Key Agreement, or CGKA [Alwen et al. 2021], that essentially allows a changing group of users to agree on a common key with the added functionality security against compromises is achieved by users asynchronously issuing a key update. In this thesis we contribute to the understanding of CGKA across different angles.\r\nFirst, we present a new technique to effect dynamic operations in groups, i.e., add or remove members, that can be more efficient that the one employed by MLS in certain settings.\r\nConsidering the setting of users belonging to multiple overlapping groups, we then show lowerbounds on the communication cost of constructions that leverage said overlap, at the same time showing protocols that are asymptotically optimal and efficient for practical settings, respectively. Along the way, we show that the communication cost of key updates in MLS is average-cost optimal.\r\nAn important feature in CGKA protocols, particularly for big groups, is the possibility of executing several group operations concurrently. While later versions of MLS support this, they do at the cost of worsening the communication efficiency of future group operations.\r\nIn this thesis we introduce two new protocols that permit concurrency without any negative effect on efficiency. Our protocols circumvent previously existing lower bounds by satisfying a new notion of post-compromise security that only asks for security to be re-established after a certain number of key updates have taken place. While this can be slower than MLS in terms of rounds of communication, we show that it leads to more efficient overall communication. \r\nAdditionally, we introduce a new technique that allows group members to decrease the information they need to store and download, which makes one of our protocols enjoy much lower download cost than any other existing CGKA constructions. ","lang":"eng"}],"file_date_updated":"2024-09-19T12:36:08Z","department":[{"_id":"KrPi"},{"_id":"GradSch"}],"ddc":["000"],"citation":{"ieee":"G. Pascual Perez, “On the efficiency and security of secure group messaging,” Institute of Science and Technology Austria, 2024.","ama":"Pascual Perez G. On the efficiency and security of secure group messaging. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:18088\">10.15479/at:ista:18088</a>","short":"G. Pascual Perez, On the Efficiency and Security of Secure Group Messaging, Institute of Science and Technology Austria, 2024.","mla":"Pascual Perez, Guillermo. <i>On the Efficiency and Security of Secure Group Messaging</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:18088\">10.15479/at:ista:18088</a>.","chicago":"Pascual Perez, Guillermo. “On the Efficiency and Security of Secure Group Messaging.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:18088\">https://doi.org/10.15479/at:ista:18088</a>.","apa":"Pascual Perez, G. (2024). <i>On the efficiency and security of secure group messaging</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:18088\">https://doi.org/10.15479/at:ista:18088</a>","ista":"Pascual Perez G. 2024. On the efficiency and security of secure group messaging. Institute of Science and Technology Austria."},"day":"18","date_published":"2024-09-18T00:00:00Z","status":"public","ec_funded":1,"type":"dissertation","supervisor":[{"full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak"}],"year":"2024","has_accepted_license":"1","publication_identifier":{"issn":["2663-337X"]},"file":[{"checksum":"ce0dca715b3df48e52e2e891b6ac1bc5","file_name":"thesis_bundle.zip","file_id":"18099","relation":"source_file","date_updated":"2024-09-19T12:35:38Z","date_created":"2024-09-19T12:35:38Z","access_level":"closed","content_type":"application/x-zip-compressed","file_size":11917734,"creator":"gpascual"},{"creator":"gpascual","access_level":"open_access","file_size":2729427,"content_type":"application/pdf","date_updated":"2024-09-19T12:36:08Z","file_id":"18100","relation":"main_file","date_created":"2024-09-19T12:36:08Z","checksum":"4a2c72e90f1a0ef2a13cff800f8d1265","file_name":"thesis_gpasper.pdf"}],"month":"09","degree_awarded":"PhD","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","image":"/images/cc_by_nc_sa.png","short":"CC BY-NC-SA (4.0)"},"date_updated":"2026-04-07T13:01:26Z","corr_author":"1","date_created":"2024-09-18T12:59:49Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","alternative_title":["ISTA Thesis"],"oa_version":"Published Version","title":"On the efficiency and security of secure group messaging","author":[{"full_name":"Pascual Perez, Guillermo","first_name":"Guillermo","orcid":"0000-0001-8630-415X","id":"2D7ABD02-F248-11E8-B48F-1D18A9856A87","last_name":"Pascual Perez"}],"page":"239","doi":"10.15479/at:ista:18088","oa":1,"publisher":"Institute of Science and Technology Austria"},{"status":"public","day":"04","date_published":"2024-09-04T00:00:00Z","citation":{"short":"I. Markov, Communication-Efficient Distributed Training of Deep Neural Networks : An Algorithms and Systems Perspective, Institute of Science and Technology Austria, 2024.","mla":"Markov, Ilia. <i>Communication-Efficient Distributed Training of Deep Neural Networks : An Algorithms and Systems Perspective</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:17490\">10.15479/at:ista:17490</a>.","chicago":"Markov, Ilia. “Communication-Efficient Distributed Training of Deep Neural Networks : An Algorithms and Systems Perspective.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:17490\">https://doi.org/10.15479/at:ista:17490</a>.","ieee":"I. Markov, “Communication-efficient distributed training of deep neural networks : An algorithms and systems perspective,” Institute of Science and Technology Austria, 2024.","ama":"Markov I. Communication-efficient distributed training of deep neural networks : An algorithms and systems perspective. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:17490\">10.15479/at:ista:17490</a>","ista":"Markov I. 2024. Communication-efficient distributed training of deep neural networks : An algorithms and systems perspective. Institute of Science and Technology Austria.","apa":"Markov, I. (2024). <i>Communication-efficient distributed training of deep neural networks : An algorithms and systems perspective</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:17490\">https://doi.org/10.15479/at:ista:17490</a>"},"type":"dissertation","ec_funded":1,"article_processing_charge":"No","publication_status":"published","project":[{"name":"Elastic Coordination for Scalable Machine Learning","_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223","call_identifier":"H2020"}],"OA_place":"publisher","_id":"17490","related_material":{"record":[{"id":"17456","relation":"part_of_dissertation","status":"public"},{"id":"14461","relation":"part_of_dissertation","status":"public"},{"id":"12780","relation":"part_of_dissertation","status":"public"}]},"ddc":["000"],"department":[{"_id":"GradSch"},{"_id":"DaAl"}],"abstract":[{"text":"Deep learning is essential in numerous applications nowadays, with many recent advancements made possible by training very large models. Despite their broad applicability, training neural networks is often time-intensive, and it is usually impractical to manage large models and datasets on a single machine. To address these issues, distributed deep learning training has become increasingly important. However, distributed training requires synchronization among nodes, and the mini-batch stochastic gradient descent algorithm places a significant load on network connections. A possible solution to tackle the synchronization bottleneck is to reduce a message size by lossy compression.\r\n\r\nIn this thesis, we investigate systems and algorithmic approaches to communication compression during training. From the systems perspective, we demonstrate that a common approach of expensive hardware overprovisioning can be replaced through a thorough system design. We introduce a framework that introduces efficient software support for compressed communication in machine learning applications, applicable to both multi-GPU single-node training and larger-scale multi-node training. Our framework integrates with popular ML frameworks, providing up to 3x speedups for multi-GPU nodes based on commodity hardware and order-of-magnitude improvements in the multi-node setting, with negligible impact on accuracy.\r\n\r\nAlso, we consider an application of our framework to different communication schemes, such as Fully Sharded Data Parallel. We provide strong convergence guarantees for the compression in such a setup. Empirical validation shows that our method preserves model accuracy for GPT-family models with up to 1.3 billion parameters, while completely removing the communication bottlenecks of non-compressed alternatives, providing up to 2.2x speedups end-to-end.\r\n\r\nFrom the algorithmic side, we propose a general framework that dynamically adjusts the degree of compression across a model's layers during training. This approach enhances overall compression and results in significant speedups without compromising accuracy. Our algorithm utilizes an adaptive algorithm that automatically selects the optimal compression parameters for model layers, ensuring the best compression ratio while adhering to an error constraint. Our method is effective across all existing families of compression methods. It achieves up to 2.5x faster training and up to a 5x improvement in compression compared to efficient implementations of current approaches. Additionally, LGreCo can complement existing adaptive algorithms.\r\n","lang":"eng"}],"file_date_updated":"2024-09-04T08:36:06Z","language":[{"iso":"eng"}],"doi":"10.15479/at:ista:17490","page":"102","title":"Communication-efficient distributed training of deep neural networks : An algorithms and systems perspective","author":[{"full_name":"Markov, Ilia","first_name":"Ilia","id":"D0CF4148-C985-11E9-8066-0BDEE5697425","last_name":"Markov"}],"alternative_title":["ISTA Thesis"],"oa_version":"Published Version","publisher":"Institute of Science and Technology Austria","oa":1,"month":"09","has_accepted_license":"1","acknowledged_ssus":[{"_id":"ScienComp"}],"publication_identifier":{"issn":["2663-337X"]},"file":[{"date_updated":"2024-09-04T08:35:35Z","relation":"source_file","file_id":"17491","date_created":"2024-09-04T08:35:35Z","checksum":"77609f4835d2730e46fa0d42d9134ed9","file_name":"Thesis.zip","creator":"imarkov","access_level":"closed","file_size":43327753,"content_type":"application/x-zip-compressed"},{"creator":"imarkov","access_level":"open_access","success":1,"file_size":2756082,"content_type":"application/pdf","date_updated":"2024-09-04T08:36:06Z","file_id":"17492","relation":"main_file","date_created":"2024-09-04T08:36:06Z","checksum":"9e68f7217570f756ceb8f70b980938cd","file_name":"Thesis_final_version_pdfa2.pdf"}],"supervisor":[{"first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"}],"year":"2024","date_created":"2024-09-04T08:51:11Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_updated":"2026-04-07T13:00:54Z","corr_author":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","image":"/images/cc_by_nc_sa.png","short":"CC BY-NC-SA (4.0)"},"degree_awarded":"PhD"},{"place":"Cham","publisher":"Springer Nature","doi":"10.1007/978-3-031-71073-5_14","page":"294–313","author":[{"last_name":"Alwen","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","first_name":"Joel F","full_name":"Alwen, Joel F"},{"id":"D33D2B18-E445-11E9-ABB7-15F4E5697425","orcid":"0000-0002-7553-6606","last_name":"Auerbach","full_name":"Auerbach, Benedikt","first_name":"Benedikt"},{"first_name":"Miguel","full_name":"Cueto Noval, Miguel","last_name":"Cueto Noval","id":"ffc563a3-f6e0-11ea-865d-e3cce03d17cc","orcid":"0000-0002-2505-4246"},{"id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","last_name":"Klein","full_name":"Klein, Karen","first_name":"Karen"},{"orcid":"0000-0001-8630-415X","id":"2D7ABD02-F248-11E8-B48F-1D18A9856A87","last_name":"Pascual Perez","full_name":"Pascual Perez, Guillermo","first_name":"Guillermo"},{"first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"}],"title":"DeCAF: Decentralizable CGKA with fast healing","oa_version":"None","editor":[{"last_name":"Galdi","first_name":"Clemente","full_name":"Galdi, Clemente"},{"full_name":"Phan, Duong Hieu","first_name":"Duong Hieu","last_name":"Phan"}],"alternative_title":["LNCS"],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2024-09-18T11:35:14Z","corr_author":"1","date_updated":"2026-04-07T13:01:26Z","month":"09","publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783031710728"],"eisbn":["9783031710735"]},"year":"2024","intvolume":"     14974","type":"conference","status":"public","date_published":"2024-09-10T00:00:00Z","day":"10","citation":{"chicago":"Alwen, Joel F, Benedikt Auerbach, Miguel Cueto Noval, Karen Klein, Guillermo Pascual Perez, and Krzysztof Z Pietrzak. “DeCAF: Decentralizable CGKA with Fast Healing.” In <i>Security and Cryptography for Networks: 14th International Conference</i>, edited by Clemente Galdi and Duong Hieu Phan, 14974:294–313. Cham: Springer Nature, 2024. <a href=\"https://doi.org/10.1007/978-3-031-71073-5_14\">https://doi.org/10.1007/978-3-031-71073-5_14</a>.","mla":"Alwen, Joel F., et al. “DeCAF: Decentralizable CGKA with Fast Healing.” <i>Security and Cryptography for Networks: 14th International Conference</i>, edited by Clemente Galdi and Duong Hieu Phan, vol. 14974, Springer Nature, 2024, pp. 294–313, doi:<a href=\"https://doi.org/10.1007/978-3-031-71073-5_14\">10.1007/978-3-031-71073-5_14</a>.","short":"J.F. Alwen, B. Auerbach, M. Cueto Noval, K. Klein, G. Pascual Perez, K.Z. Pietrzak, in:, C. Galdi, D.H. Phan (Eds.), Security and Cryptography for Networks: 14th International Conference, Springer Nature, Cham, 2024, pp. 294–313.","ama":"Alwen JF, Auerbach B, Cueto Noval M, Klein K, Pascual Perez G, Pietrzak KZ. DeCAF: Decentralizable CGKA with fast healing. In: Galdi C, Phan DH, eds. <i>Security and Cryptography for Networks: 14th International Conference</i>. Vol 14974. Cham: Springer Nature; 2024:294–313. doi:<a href=\"https://doi.org/10.1007/978-3-031-71073-5_14\">10.1007/978-3-031-71073-5_14</a>","ieee":"J. F. Alwen, B. Auerbach, M. Cueto Noval, K. Klein, G. Pascual Perez, and K. Z. Pietrzak, “DeCAF: Decentralizable CGKA with fast healing,” in <i>Security and Cryptography for Networks: 14th International Conference</i>, Amalfi, Italy, 2024, vol. 14974, pp. 294–313.","ista":"Alwen JF, Auerbach B, Cueto Noval M, Klein K, Pascual Perez G, Pietrzak KZ. 2024. DeCAF: Decentralizable CGKA with fast healing. Security and Cryptography for Networks: 14th International Conference. SCN: Security and Cryptography for Networks, LNCS, vol. 14974, 294–313.","apa":"Alwen, J. F., Auerbach, B., Cueto Noval, M., Klein, K., Pascual Perez, G., &#38; Pietrzak, K. Z. (2024). DeCAF: Decentralizable CGKA with fast healing. In C. Galdi &#38; D. H. Phan (Eds.), <i>Security and Cryptography for Networks: 14th International Conference</i> (Vol. 14974, pp. 294–313). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-71073-5_14\">https://doi.org/10.1007/978-3-031-71073-5_14</a>"},"department":[{"_id":"GradSch"},{"_id":"KrPi"}],"volume":14974,"abstract":[{"lang":"eng","text":"Abstract. Continuous group key agreement (CGKA) allows a group of\r\nusers to maintain a continuously updated shared key in an asynchronous\r\nsetting where parties only come online sporadically and their messages\r\nare relayed by an untrusted server. CGKA captures the basic primitive\r\nunderlying group messaging schemes.\r\nCurrent solutions including TreeKEM (“Messaging Layer Security”\r\n(MLS) IETF RFC 9420) cannot handle concurrent requests while retaining low communication complexity. The exception being CoCoA, which\r\nis concurrent while having extremely low communication complexity (in\r\ngroups of size n and for m concurrent updates the communication per\r\nuser is log(n), i.e., independent of m). The main downside of CoCoA\r\nis that in groups of size n, users might have to do up to log(n) update\r\nrequests to the server to ensure their (potentially corrupted) key material has been refreshed.\r\nIn this work we present a “fast healing” concurrent CGKA protocol,\r\nnamed DeCAF, where users will heal after at most log(t) requests, with\r\nt being the number of corrupted users. While also suitable for the standard central-server setting, our protocol is particularly interesting for\r\nrealizing decentralized group messaging, where protocol messages (add,\r\nremove, update) are being posted on some append-only data structure\r\nrather than sent to a server. In this setting, concurrency is crucial once\r\nthe rate of requests exceeds, say, the rate at which new blocks are added\r\nto a blockchain.\r\nIn the central-server setting, CoCoA (the only alternative with concurrency, sub-linear communication and basic post-compromise security)\r\nenjoys much lower download communication. However, in the decentralized setting – where there is no server which can craft specific messages\r\nfor different users to reduce their download communication – our protocol\r\nsignificantly outperforms CoCoA. DeCAF heals in fewer epochs (log(t)\r\nvs. log(n)) while incurring a similar per epoch per user communication\r\ncost."}],"external_id":{"isi":["001330408000014"]},"quality_controlled":"1","language":[{"iso":"eng"}],"article_processing_charge":"No","publication":"Security and Cryptography for Networks: 14th International Conference","publication_status":"published","conference":{"end_date":"2024-09-13","start_date":"2024-09-11","location":"Amalfi, Italy","name":"SCN: Security and Cryptography for Networks"},"isi":1,"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"18088"}]},"_id":"18086"},{"editor":[{"first_name":"P.","full_name":"Gibbons, P.","last_name":"Gibbons"},{"last_name":"Pekhimenko","full_name":"Pekhimenko, G.","first_name":"G."},{"last_name":"De Sa","full_name":"De Sa, C.","first_name":"C."}],"oa_version":"Published Version","author":[{"first_name":"Ilia","full_name":"Markov, Ilia","last_name":"Markov","id":"D0CF4148-C985-11E9-8066-0BDEE5697425"},{"full_name":"Alimohammadi, Kaveh","first_name":"Kaveh","last_name":"Alimohammadi"},{"last_name":"Frantar","id":"09a8f98d-ec99-11ea-ae11-c063a7b7fe5f","first_name":"Elias","full_name":"Frantar, Elias"},{"orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian"}],"title":"L-GreCo: Layerwise-adaptive gradient compression for efficient data-parallel deep learning","publisher":"Association for Computing Machinery","oa":1,"year":"2024","month":"04","corr_author":"1","date_updated":"2026-04-07T13:00:54Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_created":"2024-08-22T08:29:25Z","citation":{"ama":"Markov I, Alimohammadi K, Frantar E, Alistarh D-A. L-GreCo: Layerwise-adaptive gradient compression for efficient data-parallel deep learning. In: Gibbons P, Pekhimenko G, De Sa C, eds. <i>Proceedings of Machine Learning and Systems </i>. Vol 6. Association for Computing Machinery; 2024.","ieee":"I. Markov, K. Alimohammadi, E. Frantar, and D.-A. Alistarh, “L-GreCo: Layerwise-adaptive gradient compression for efficient data-parallel deep learning,” in <i>Proceedings of Machine Learning and Systems </i>, Athens, Greece, 2024, vol. 6.","chicago":"Markov, Ilia, Kaveh Alimohammadi, Elias Frantar, and Dan-Adrian Alistarh. “L-GreCo: Layerwise-Adaptive Gradient Compression for Efficient Data-Parallel Deep Learning.” In <i>Proceedings of Machine Learning and Systems </i>, edited by P. Gibbons, G. Pekhimenko, and C. De Sa, Vol. 6. Association for Computing Machinery, 2024.","mla":"Markov, Ilia, et al. “L-GreCo: Layerwise-Adaptive Gradient Compression for Efficient Data-Parallel Deep Learning.” <i>Proceedings of Machine Learning and Systems </i>, edited by P. Gibbons et al., vol. 6, Association for Computing Machinery, 2024.","short":"I. Markov, K. Alimohammadi, E. Frantar, D.-A. Alistarh, in:, P. Gibbons, G. Pekhimenko, C. De Sa (Eds.), Proceedings of Machine Learning and Systems , Association for Computing Machinery, 2024.","apa":"Markov, I., Alimohammadi, K., Frantar, E., &#38; Alistarh, D.-A. (2024). L-GreCo: Layerwise-adaptive gradient compression for efficient data-parallel deep learning. In P. Gibbons, G. Pekhimenko, &#38; C. De Sa (Eds.), <i>Proceedings of Machine Learning and Systems </i> (Vol. 6). Athens, Greece: Association for Computing Machinery.","ista":"Markov I, Alimohammadi K, Frantar E, Alistarh D-A. 2024. L-GreCo: Layerwise-adaptive gradient compression for efficient data-parallel deep learning. Proceedings of Machine Learning and Systems . MLSys: Machine Learning and Systems vol. 6."},"date_published":"2024-04-01T00:00:00Z","day":"01","arxiv":1,"status":"public","main_file_link":[{"open_access":"1","url":"https://proceedings.mlsys.org/paper_files/paper/2024/hash/9069a8976ff06f6443e7f4172990a580-Abstract-Conference.html"}],"type":"conference","intvolume":"         6","related_material":{"record":[{"id":"17490","relation":"dissertation_contains","status":"public"}]},"_id":"17456","conference":{"name":"MLSys: Machine Learning and Systems","location":"Athens, Greece","end_date":"2024-04-22","start_date":"2024-04-22"},"publication":"Proceedings of Machine Learning and Systems ","publication_status":"published","article_processing_charge":"No","quality_controlled":"1","language":[{"iso":"eng"}],"external_id":{"arxiv":["2210.17357"]},"volume":6,"abstract":[{"lang":"eng","text":"Data-parallel distributed training of deep neural networks (DNN) has gained very widespread adoption, but can still experience communication bottlenecks. To address this issue, entire families of compression mechanisms have been developed, including quantization, sparsification, and low-rank approximation, some of which are seeing significant practical adoption. Despite this progress, almost all known compression schemes apply compression uniformly across DNN layers, although layers are heterogeneous in terms of parameter count and their impact on model accuracy.In this work, we provide a general framework for adapting the degree of compression across the model's layers dynamically during training, improving the overall compression, while leading to substantial speedups, without sacrificing accuracy. Our framework, called L-GreCo, is based on an adaptive algorithm, which automatically picks the optimal compression parameters for model layers guaranteeing the best compression ratio while satisfying an error constraint. Extensive experiments over image classification and language modeling tasks shows that L-GreCo is effective across all existing families of compression methods, and achieves up to 2.5\r\n×\r\n training speedup and up to 5\r\n×\r\n compression improvement over efficient implementations of existing approaches, while recovering full accuracy. Moreover, L-GreCo is complementary to existing adaptive algorithms, improving their compression ratio by 50\\% and practical throughput by 66\\%. An anonymized implementation is available at https://github.com/LGrCo/L-GreCo."}],"department":[{"_id":"DaAl"}]},{"doi":"10.1142/s0129055x2360005x","author":[{"full_name":"Henheik, Sven Joscha","first_name":"Sven Joscha","orcid":"0000-0003-1106-327X","id":"31d731d7-d235-11ea-ad11-b50331c8d7fb","last_name":"Henheik"},{"full_name":"Lauritsen, Asbjørn Bækgaard","first_name":"Asbjørn Bækgaard","id":"e1a2682f-dc8d-11ea-abe3-81da9ac728f1","orcid":"0000-0003-4476-2288","last_name":"Lauritsen"},{"first_name":"Barbara","full_name":"Roos, Barbara","last_name":"Roos","id":"5DA90512-D80F-11E9-8994-2E2EE6697425","orcid":"0000-0002-9071-5880"}],"title":"Universality in low-dimensional BCS theory","oa_version":"Published Version","publisher":"World Scientific Publishing","oa":1,"month":"10","file":[{"success":1,"access_level":"open_access","content_type":"application/pdf","file_size":503910,"creator":"dernst","checksum":"2b053a4223b4db14b90520999ec56054","file_name":"2024_ReviewsmathPhysics_Henheik.pdf","file_id":"18786","relation":"main_file","date_updated":"2025-01-09T07:56:28Z","date_created":"2025-01-09T07:56:28Z"}],"article_type":"original","has_accepted_license":"1","publication_identifier":{"issn":["0129-055X"],"eissn":["1793-6659"]},"year":"2024","OA_type":"hybrid","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2023-11-15T23:48:14Z","corr_author":"1","date_updated":"2026-04-07T13:01:40Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"arxiv":1,"status":"public","date_published":"2024-10-01T00:00:00Z","article_number":"2360005 ","day":"01","acknowledgement":"We thank Robert Seiringer for comments on the paper. J. H. gratefully acknowledges  partial  financial  support  by  the  ERC  Advanced  Grant  “RMTBeyond”No. 101020331.This research was funded in part by the Austrian Science Fund (FWF) grantnumber I6427.","citation":{"ista":"Henheik SJ, Lauritsen AB, Roos B. 2024. Universality in low-dimensional BCS theory. Reviews in Mathematical Physics. 36(9), 2360005.","apa":"Henheik, S. J., Lauritsen, A. B., &#38; Roos, B. (2024). Universality in low-dimensional BCS theory. <i>Reviews in Mathematical Physics</i>. World Scientific Publishing. <a href=\"https://doi.org/10.1142/s0129055x2360005x\">https://doi.org/10.1142/s0129055x2360005x</a>","mla":"Henheik, Sven Joscha, et al. “Universality in Low-Dimensional BCS Theory.” <i>Reviews in Mathematical Physics</i>, vol. 36, no. 9, 2360005, World Scientific Publishing, 2024, doi:<a href=\"https://doi.org/10.1142/s0129055x2360005x\">10.1142/s0129055x2360005x</a>.","short":"S.J. Henheik, A.B. Lauritsen, B. Roos, Reviews in Mathematical Physics 36 (2024).","chicago":"Henheik, Sven Joscha, Asbjørn Bækgaard Lauritsen, and Barbara Roos. “Universality in Low-Dimensional BCS Theory.” <i>Reviews in Mathematical Physics</i>. World Scientific Publishing, 2024. <a href=\"https://doi.org/10.1142/s0129055x2360005x\">https://doi.org/10.1142/s0129055x2360005x</a>.","ieee":"S. J. Henheik, A. B. Lauritsen, and B. Roos, “Universality in low-dimensional BCS theory,” <i>Reviews in Mathematical Physics</i>, vol. 36, no. 9. World Scientific Publishing, 2024.","ama":"Henheik SJ, Lauritsen AB, Roos B. Universality in low-dimensional BCS theory. <i>Reviews in Mathematical Physics</i>. 2024;36(9). doi:<a href=\"https://doi.org/10.1142/s0129055x2360005x\">10.1142/s0129055x2360005x</a>"},"intvolume":"        36","type":"journal_article","ec_funded":1,"issue":"9","article_processing_charge":"Yes (in subscription journal)","publication_status":"published","publication":"Reviews in Mathematical Physics","isi":1,"project":[{"call_identifier":"H2020","name":"Random matrices beyond Wigner-Dyson-Mehta","grant_number":"101020331","_id":"62796744-2b32-11ec-9570-940b20777f1d"},{"name":"Mathematical Challenges in BCS Theory of Superconductivity","grant_number":"I06427","_id":"bda63fe5-d553-11ed-ba76-a16e3d2f256b"}],"OA_place":"publisher","related_material":{"record":[{"id":"19540","relation":"dissertation_contains","status":"public"},{"id":"18135","status":"public","relation":"dissertation_contains"}]},"_id":"14542","department":[{"_id":"GradSch"},{"_id":"LaEr"},{"_id":"RoSe"}],"ddc":["510"],"volume":36,"file_date_updated":"2025-01-09T07:56:28Z","abstract":[{"text":"It is a remarkable property of BCS theory that the ratio of the energy gap at zero temperature Ξ\r\n and the critical temperature Tc is (approximately) given by a universal constant, independent of the microscopic details of the fermionic interaction. This universality has rigorously been proven quite recently in three spatial dimensions and three different limiting regimes: weak coupling, low density and high density. The goal of this short note is to extend the universal behavior to lower dimensions d=1,2 and give an exemplary proof in the weak coupling limit.","lang":"eng"}],"scopus_import":"1","external_id":{"isi":["001099640300002"],"arxiv":["2301.05621"]},"quality_controlled":"1","language":[{"iso":"eng"}]},{"article_processing_charge":"Yes","publication":"Forum of Mathematics, Sigma","publication_status":"published","isi":1,"project":[{"name":"Mathematical Challenges in BCS Theory of Superconductivity","_id":"bda63fe5-d553-11ed-ba76-a16e3d2f256b","grant_number":"I06427"}],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"18135"}]},"_id":"18107","department":[{"_id":"GradSch"},{"_id":"RoSe"}],"ddc":["510"],"file_date_updated":"2024-09-23T09:56:17Z","volume":12,"abstract":[{"lang":"eng","text":"We consider a dilute fully spin-polarized Fermi gas at positive temperature in dimensions  d∈{1,2,3} . We show that the pressure of the interacting gas is bounded from below by that of the free gas plus, to leading order, an explicit term of order  adρ2+2/d, where a is the p-wave scattering length of the repulsive interaction and  ρ  is the particle density. The results are valid for a wide range of repulsive interactions, including that of a hard core, and uniform in temperatures at most of the order of the Fermi temperature. A central ingredient in the proof is a rigorous implementation of the fermionic cluster expansion of Gaudin, Gillespie and Ripka (Nucl. Phys. A, 176.2 (1971), pp. 237–260)."}],"external_id":{"isi":["001307817400001"],"arxiv":["2407.05990"]},"scopus_import":"1","quality_controlled":"1","language":[{"iso":"eng"}],"arxiv":1,"status":"public","date_published":"2024-09-09T00:00:00Z","article_number":"e78","day":"09","acknowledgement":"Financial support by the Austrian Science Fund (FWF) through grant DOI: 10.55776/I6427 (as part of the SFB/TRR 352) is gratefully acknowledged.","citation":{"short":"A.B. Lauritsen, R. Seiringer, Forum of Mathematics, Sigma 12 (2024).","mla":"Lauritsen, Asbjørn Bækgaard, and Robert Seiringer. “Pressure of a Dilute Spin-Polarized Fermi Gas: Lower Bound.” <i>Forum of Mathematics, Sigma</i>, vol. 12, e78, Cambridge University Press, 2024, doi:<a href=\"https://doi.org/10.1017/fms.2024.56\">10.1017/fms.2024.56</a>.","chicago":"Lauritsen, Asbjørn Bækgaard, and Robert Seiringer. “Pressure of a Dilute Spin-Polarized Fermi Gas: Lower Bound.” <i>Forum of Mathematics, Sigma</i>. Cambridge University Press, 2024. <a href=\"https://doi.org/10.1017/fms.2024.56\">https://doi.org/10.1017/fms.2024.56</a>.","ieee":"A. B. Lauritsen and R. Seiringer, “Pressure of a dilute spin-polarized Fermi gas: Lower bound,” <i>Forum of Mathematics, Sigma</i>, vol. 12. Cambridge University Press, 2024.","ama":"Lauritsen AB, Seiringer R. Pressure of a dilute spin-polarized Fermi gas: Lower bound. <i>Forum of Mathematics, Sigma</i>. 2024;12. doi:<a href=\"https://doi.org/10.1017/fms.2024.56\">10.1017/fms.2024.56</a>","ista":"Lauritsen AB, Seiringer R. 2024. Pressure of a dilute spin-polarized Fermi gas: Lower bound. Forum of Mathematics, Sigma. 12, e78.","apa":"Lauritsen, A. B., &#38; Seiringer, R. (2024). Pressure of a dilute spin-polarized Fermi gas: Lower bound. <i>Forum of Mathematics, Sigma</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/fms.2024.56\">https://doi.org/10.1017/fms.2024.56</a>"},"intvolume":"        12","type":"journal_article","month":"09","file":[{"creator":"dernst","access_level":"open_access","success":1,"file_size":599886,"content_type":"application/pdf","date_updated":"2024-09-23T09:56:17Z","relation":"main_file","file_id":"18126","date_created":"2024-09-23T09:56:17Z","checksum":"330b881240013213a8e08538fec13d29","file_name":"2024_ForumMath_Lauritsen.pdf"}],"has_accepted_license":"1","publication_identifier":{"issn":["2050-5094"]},"article_type":"original","year":"2024","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2024-09-20T12:25:25Z","corr_author":"1","date_updated":"2026-04-07T13:01:40Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"doi":"10.1017/fms.2024.56","author":[{"full_name":"Lauritsen, Asbjørn Bækgaard","first_name":"Asbjørn Bækgaard","orcid":"0000-0003-4476-2288","id":"e1a2682f-dc8d-11ea-abe3-81da9ac728f1","last_name":"Lauritsen"},{"full_name":"Seiringer, Robert","first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521","last_name":"Seiringer"}],"title":"Pressure of a dilute spin-polarized Fermi gas: Lower bound","oa_version":"Published Version","oa":1,"publisher":"Cambridge University Press"},{"doi":"10.15479/at:ista:17164","page":"206","author":[{"id":"e796e4f9-dc8d-11ea-abe3-97e26a0323e9","last_name":"Reker","full_name":"Reker, Jana","first_name":"Jana"}],"title":"Central limit theorems for random matrices: From resolvents to free probability","oa_version":"Published Version","alternative_title":["ISTA Thesis"],"publisher":"Institute of Science and Technology Austria","oa":1,"month":"06","file":[{"file_name":"ISTA_Thesis_JReker.pdf","checksum":"fb16d86e1f2753dc3a9e14d2bdfd84cd","date_created":"2024-06-26T12:39:36Z","relation":"main_file","file_id":"17176","date_updated":"2024-06-26T12:44:53Z","content_type":"application/pdf","file_size":2783027,"access_level":"open_access","creator":"jreker"},{"date_updated":"2024-06-26T12:44:53Z","relation":"source_file","file_id":"17177","date_created":"2024-06-26T12:39:42Z","checksum":"cb1e54009d47c1dcf5b866c4566fa27f","file_name":"ISTA_Thesis_JReker_SourceFiles.zip","creator":"jreker","access_level":"closed","file_size":3054878,"content_type":"application/zip"}],"publication_identifier":{"issn":["2663-337X"]},"has_accepted_license":"1","year":"2024","supervisor":[{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603","last_name":"Erdös","full_name":"Erdös, László","first_name":"László"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","keyword":["Random Matrices","Spectrum","Central Limit Theorem","Resolvent","Free Probability"],"date_created":"2024-06-24T11:23:29Z","corr_author":"1","date_updated":"2026-04-07T13:02:13Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","image":"/images/cc_by_nc_sa.png","short":"CC BY-NC-SA (4.0)"},"degree_awarded":"PhD","status":"public","date_published":"2024-06-26T00:00:00Z","day":"26","citation":{"chicago":"Reker, Jana. “Central Limit Theorems for Random Matrices: From Resolvents to Free Probability.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:17164\">https://doi.org/10.15479/at:ista:17164</a>.","short":"J. Reker, Central Limit Theorems for Random Matrices: From Resolvents to Free Probability, Institute of Science and Technology Austria, 2024.","mla":"Reker, Jana. <i>Central Limit Theorems for Random Matrices: From Resolvents to Free Probability</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:17164\">10.15479/at:ista:17164</a>.","ama":"Reker J. Central limit theorems for random matrices: From resolvents to free probability. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:17164\">10.15479/at:ista:17164</a>","ieee":"J. Reker, “Central limit theorems for random matrices: From resolvents to free probability,” Institute of Science and Technology Austria, 2024.","ista":"Reker J. 2024. Central limit theorems for random matrices: From resolvents to free probability. Institute of Science and Technology Austria.","apa":"Reker, J. (2024). <i>Central limit theorems for random matrices: From resolvents to free probability</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:17164\">https://doi.org/10.15479/at:ista:17164</a>"},"type":"dissertation","ec_funded":1,"article_processing_charge":"No","publication_status":"published","project":[{"call_identifier":"H2020","name":"Random matrices beyond Wigner-Dyson-Mehta","_id":"62796744-2b32-11ec-9570-940b20777f1d","grant_number":"101020331"}],"OA_place":"publisher","related_material":{"record":[{"id":"17173","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"11135"},{"id":"17047","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"17154"},{"id":"17174","status":"public","relation":"part_of_dissertation"}]},"_id":"17164","department":[{"_id":"GradSch"},{"_id":"LaEr"}],"ddc":["519"],"file_date_updated":"2024-06-26T12:44:53Z","abstract":[{"text":"This thesis is structured into two parts. In the first part, we consider the random\r\nvariable X := Tr(f1(W)A1 . . . fk(W)Ak) where W is an N × N Hermitian Wigner matrix, k ∈ N, and we choose (possibly N-dependent) regular functions f1, . . . , fk as well as\r\nbounded deterministic matrices A1, . . . , Ak. In this context, we prove a functional central\r\nlimit theorem on macroscopic and mesoscopic scales, showing that the fluctuations of X\r\naround its expectation are Gaussian and that the limiting covariance structure is given\r\nby a deterministic recursion. We further give explicit error bounds in terms of the scaling\r\nof f1, . . . , fk and the number of traceless matrices among A1, . . . , Ak, thus extending\r\nthe results of Cipolloni, Erdős and Schröder [40] to products of arbitrary length k ≥ 2.\r\nAnalyzing the underlying combinatorics leads to a non-recursive formula for the variance\r\nof X as well as the covariance of X and Y := Tr(fk+1(W)Ak+1 . . . fk+ℓ(W)Ak+ℓ) of similar\r\nbuild. When restricted to polynomials, these formulas reproduce recent results of Male,\r\nMingo, Peché, and Speicher [107], showing that the underlying combinatorics of noncrossing partitions and annular non-crossing permutations continue to stay valid beyond\r\nthe setting of second-order free probability theory. As an application, we consider the\r\nfluctuation of Tr(eitW A1e\r\n−itW A2)/N around its thermal value Tr(A1) Tr(A2)/N2 when t\r\nis large and give an explicit formula for the variance.\r\nThe second part of the thesis collects three smaller projects focusing on different random\r\nmatrix models. In the first project, we show that a class of weakly perturbed Hamiltonians\r\nof the form Hλ = H0 + λW, where W is a Wigner matrix, exhibits prethermalization.\r\nThat is, the time evolution generated by Hλ relaxes to its ultimate thermal state via an\r\nintermediate prethermal state with a lifetime of order λ\r\n−2\r\n. As the main result, we obtain\r\na general relaxation formula, expressing the perturbed dynamics via the unperturbed\r\ndynamics and the ultimate thermal state. The proof relies on a two-resolvent global law\r\nfor the deformed Wigner matrix Hλ.\r\nThe second project focuses on correlated random matrices, more precisely on a correlated N × N Hermitian random matrix with a polynomially decaying metric correlation\r\nstructure. A trivial a priori bound shows that the operator norm of this model is stochastically dominated by √\r\nN. However, by calculating the trace of the moments of the matrix\r\nand using the summable decay of the cumulants, the norm estimate can be improved to a\r\nbound of order one.\r\nIn the third project, we consider a multiplicative perturbation of the form UA(t) where U\r\nis a unitary random matrix and A = diag(t, 1, ..., 1). This so-called UA model was\r\nfirst introduced by Fyodorov [73] for its applications in scattering theory. We give a\r\ngeneral description of the eigenvalue trajectories obtained by varying the parameter t and\r\nintroduce a flow of deterministic domains that separates the outlier resulting from the\r\nrank-one perturbation from the typical eigenvalues for all sub-critical timescales. The\r\nresults are obtained under generic assumptions on U that hold for various unitary random\r\nmatrices, including the circular unitary ensemble (CUE) in the original formulation of\r\nthe model.","lang":"eng"}],"language":[{"iso":"eng"}]},{"type":"journal_article","intvolume":"        43","citation":{"apa":"Synak, P., Kalinov, A., Strugaru, I.-M., Etemadi, A., Yang, H., &#38; Wojtan, C. (2024). Multi-material mesh-based surface tracking with implicit topology changes. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3658223\">https://doi.org/10.1145/3658223</a>","ista":"Synak P, Kalinov A, Strugaru I-M, Etemadi A, Yang H, Wojtan C. 2024. Multi-material mesh-based surface tracking with implicit topology changes. ACM Transactions on Graphics. 43(4), 54.","ieee":"P. Synak, A. Kalinov, I.-M. Strugaru, A. Etemadi, H. Yang, and C. Wojtan, “Multi-material mesh-based surface tracking with implicit topology changes,” <i>ACM Transactions on Graphics</i>, vol. 43, no. 4. Association for Computing Machinery, 2024.","ama":"Synak P, Kalinov A, Strugaru I-M, Etemadi A, Yang H, Wojtan C. Multi-material mesh-based surface tracking with implicit topology changes. <i>ACM Transactions on Graphics</i>. 2024;43(4). doi:<a href=\"https://doi.org/10.1145/3658223\">10.1145/3658223</a>","short":"P. Synak, A. Kalinov, I.-M. Strugaru, A. Etemadi, H. Yang, C. Wojtan, ACM Transactions on Graphics 43 (2024).","mla":"Synak, Peter, et al. “Multi-Material Mesh-Based Surface Tracking with Implicit Topology Changes.” <i>ACM Transactions on Graphics</i>, vol. 43, no. 4, 54, Association for Computing Machinery, 2024, doi:<a href=\"https://doi.org/10.1145/3658223\">10.1145/3658223</a>.","chicago":"Synak, Peter, Aleksei Kalinov, Irina-Malina Strugaru, Arian Etemadi, Huidong Yang, and Chris Wojtan. “Multi-Material Mesh-Based Surface Tracking with Implicit Topology Changes.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2024. <a href=\"https://doi.org/10.1145/3658223\">https://doi.org/10.1145/3658223</a>."},"acknowledgement":"Peter Heiss-Synak helped conceive the project, helped formulate the algorithm structure, contributed ideas and code to Sections 6 & 8, the mesh data structure, algorithm robustness and benchmarks, helped write the paper, and provided supervision and conceptual solutions throughout the project. Aleksei Kalinov contributed ideas and code to Sections 7, 8.5, and 5, the sparse grid data structure, algorithm robustness and benchmarks, optimized the performance, produced all results, most figures, and the supplementary video, helped write the text, and provided conceptual solutions throughout the project. Malina Strugaru helped implement the mesh data structure and designed re-meshing operations for non-manifold triangle meshes. Arian Etemadi developed early prototypes for ideas in Sections 8.1 and 8.3 and helped write the paper. Huidong Yang developed early prototypes for isosurface extraction and visualization. Chris Wojtan helped conceive the project, helped write the paper, and provided supervision, prototype grid data structure code, and conceptual solutions throughout the project. We thank the anonymous reviewers for their helpful comments, the members of the Visual Computing Group at ISTA for their feedback, Christopher Batty for discussions about LosTopos, and SideFX for the Houdini Education software licenses.  This research was funded in part by the European Union (ERC-2021-COG 101045083 CoDiNA).","article_number":"54","day":"01","date_published":"2024-07-01T00:00:00Z","status":"public","language":[{"iso":"eng"}],"quality_controlled":"1","scopus_import":"1","external_id":{"isi":["001289270900021"]},"abstract":[{"text":"We introduce a multi-material non-manifold mesh-based surface tracking algorithm that converts self-intersections into topological changes. Our algorithm generalizes prior work on manifold surface tracking with topological changes: it preserves surface features like mesh-based methods, and it robustly handles topological changes like level set methods. Our method also offers improved efficiency and robustness over the state of the art. We demonstrate the effectiveness of the approach on a range of examples, including complex soap film simulations with thousands of interacting bubbles, and boolean unions of non-manifold meshes consisting of millions of triangles.","lang":"eng"}],"file_date_updated":"2025-11-11T09:50:52Z","volume":43,"ddc":["004"],"department":[{"_id":"GradSch"},{"_id":"ChWo"}],"_id":"17219","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"19630"},{"relation":"dissertation_contains","status":"public","id":"18301"}]},"OA_place":"publisher","project":[{"name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena","_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088","grant_number":"101045083"}],"isi":1,"publication":"ACM Transactions on Graphics","publication_status":"published","article_processing_charge":"Yes (via OA deal)","issue":"4","publisher":"Association for Computing Machinery","oa":1,"oa_version":"Published Version","title":"Multi-material mesh-based surface tracking with implicit topology changes","author":[{"full_name":"Synak, Peter","first_name":"Peter","id":"331776E2-F248-11E8-B48F-1D18A9856A87","last_name":"Synak"},{"full_name":"Kalinov, Aleksei","first_name":"Aleksei","id":"44b7120e-eb97-11eb-a6c2-e1557aa81d02","orcid":"0000-0003-2189-3904","last_name":"Kalinov"},{"full_name":"Strugaru, Irina-Malina","first_name":"Irina-Malina","id":"2afc607f-f128-11eb-9611-8f2a0dfcf074","last_name":"Strugaru"},{"last_name":"Etemadihaghighi","id":"36cea3aa-f38e-11ec-8ae0-c65ae6f6098f","first_name":"Arian","full_name":"Etemadihaghighi, Arian"},{"first_name":"Huidong","full_name":"Yang, Huidong","last_name":"Yang"},{"id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6646-5546","last_name":"Wojtan","full_name":"Wojtan, Christopher J","first_name":"Christopher J"}],"doi":"10.1145/3658223","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","image":"/images/cc_by_nc_sa.png","short":"CC BY-NC-SA (4.0)"},"date_updated":"2026-04-07T13:02:36Z","corr_author":"1","date_created":"2024-07-10T12:24:00Z","keyword":["surface tracking","topology change","non- manifold meshes","multi-material flows","solid modeling"],"OA_type":"hybrid","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2024","has_accepted_license":"1","article_type":"original","publication_identifier":{"issn":["0730-0301"],"eissn":["1557-7368"]},"file":[{"date_updated":"2024-07-23T06:35:15Z","relation":"main_file","file_id":"17317","date_created":"2024-07-23T06:35:15Z","checksum":"1917067d4b52d7729019b03560004e43","file_name":"2024_ACMToG_HeissSynak.pdf","creator":"dernst","access_level":"open_access","success":1,"file_size":48763368,"content_type":"application/pdf"},{"access_level":"open_access","success":1,"file_size":48021463,"content_type":"video/mp4","creator":"akalinov","checksum":"a4f0e293184bfa034c0c585848806b17","file_name":"sdtopofixer_final.mp4","date_updated":"2024-07-10T12:23:44Z","relation":"main_file","file_id":"17221","date_created":"2024-07-10T12:23:44Z"},{"creator":"akalinov","access_level":"open_access","content_type":"application/pdf","file_size":48639581,"title":"Authors' version of the text","relation":"preprint","file_id":"20633","date_updated":"2025-11-11T09:50:52Z","date_created":"2025-11-11T09:50:52Z","checksum":"18fc310a78ec91651148c45a8b89fa44","file_name":"SuperDuperTopoFixer.pdf"}],"month":"07"},{"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2024-06-21T09:31:17Z","date_updated":"2026-04-07T13:02:12Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"month":"06","file":[{"creator":"cchlebak","content_type":"application/pdf","file_size":1327596,"success":1,"access_level":"open_access","date_created":"2024-06-26T11:26:42Z","file_id":"17175","relation":"main_file","date_updated":"2024-06-26T11:26:42Z","file_name":"2024_MathPhysAnaGeo_Reker.pdf","checksum":"7d04318d66f765621bdcb648378d458e"}],"article_type":"original","has_accepted_license":"1","publication_identifier":{"issn":["1385-0172"],"eissn":["1572-9656"]},"year":"2024","publisher":"Springer Nature","oa":1,"doi":"10.1007/s11040-024-09483-y","author":[{"last_name":"Reker","id":"e796e4f9-dc8d-11ea-abe3-97e26a0323e9","first_name":"Jana","full_name":"Reker, Jana"}],"title":"Fluctuation moments for regular functions of Wigner Matrices","oa_version":"Published Version","department":[{"_id":"LaEr"}],"ddc":["519"],"file_date_updated":"2024-06-26T11:26:42Z","volume":27,"abstract":[{"text":"We compute the deterministic approximation for mixed fluctuation moments of products of deterministic matrices and general Sobolev functions of Wigner matrices. Restricting to polynomials, our formulas reproduce recent results of Male et al. (Random Matrices Theory Appl. 11(2):2250015, 2022), showing that the underlying combinatorics of non-crossing partitions and annular non-crossing permutations continue to stay valid beyond the setting of second-order free probability theory. The formulas obtained further characterize the variance in the functional central limit theorem given in the recent companion paper (Reker in Preprint, arXiv:2204.03419, 2023). and thus allow identifying the fluctuation around the thermal value in certain thermalization problems.","lang":"eng"}],"external_id":{"isi":["001251464300001"],"arxiv":["2307.11029"]},"scopus_import":"1","quality_controlled":"1","language":[{"iso":"eng"}],"issue":"3","article_processing_charge":"Yes (via OA deal)","publication_status":"published","publication":"Mathematical Physics, Analysis and Geometry","isi":1,"project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"},{"call_identifier":"H2020","_id":"62796744-2b32-11ec-9570-940b20777f1d","grant_number":"101020331","name":"Random matrices beyond Wigner-Dyson-Mehta"}],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"17164"}]},"_id":"17154","intvolume":"        27","type":"journal_article","ec_funded":1,"arxiv":1,"status":"public","date_published":"2024-06-20T00:00:00Z","article_number":"10","day":"20","citation":{"ista":"Reker J. 2024. Fluctuation moments for regular functions of Wigner Matrices. Mathematical Physics, Analysis and Geometry. 27(3), 10.","apa":"Reker, J. (2024). Fluctuation moments for regular functions of Wigner Matrices. <i>Mathematical Physics, Analysis and Geometry</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s11040-024-09483-y\">https://doi.org/10.1007/s11040-024-09483-y</a>","chicago":"Reker, Jana. “Fluctuation Moments for Regular Functions of Wigner Matrices.” <i>Mathematical Physics, Analysis and Geometry</i>. Springer Nature, 2024. <a href=\"https://doi.org/10.1007/s11040-024-09483-y\">https://doi.org/10.1007/s11040-024-09483-y</a>.","mla":"Reker, Jana. “Fluctuation Moments for Regular Functions of Wigner Matrices.” <i>Mathematical Physics, Analysis and Geometry</i>, vol. 27, no. 3, 10, Springer Nature, 2024, doi:<a href=\"https://doi.org/10.1007/s11040-024-09483-y\">10.1007/s11040-024-09483-y</a>.","short":"J. Reker, Mathematical Physics, Analysis and Geometry 27 (2024).","ama":"Reker J. Fluctuation moments for regular functions of Wigner Matrices. <i>Mathematical Physics, Analysis and Geometry</i>. 2024;27(3). doi:<a href=\"https://doi.org/10.1007/s11040-024-09483-y\">10.1007/s11040-024-09483-y</a>","ieee":"J. Reker, “Fluctuation moments for regular functions of Wigner Matrices,” <i>Mathematical Physics, Analysis and Geometry</i>, vol. 27, no. 3. Springer Nature, 2024."}},{"degree_awarded":"MS","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","short":"CC BY-SA (4.0)","image":"/images/cc_by_sa.png","name":"Creative Commons Attribution-ShareAlike 4.0 International Public License (CC BY-SA 4.0)"},"corr_author":"1","date_updated":"2026-04-07T13:02:36Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","keyword":["surface tracking","non-manifold","hole-filling","topology change","multi-material","solid-modeling"],"date_created":"2024-10-11T19:52:20Z","year":"2024","supervisor":[{"last_name":"Wojtan","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6646-5546","first_name":"Christopher J","full_name":"Wojtan, Christopher J"}],"file":[{"file_id":"18469","relation":"main_file","date_updated":"2024-10-24T14:34:42Z","date_created":"2024-10-24T14:34:42Z","checksum":"80fb7923e229ad9d39253d7c8a8083d0","file_name":"thesis-arian-etemadi.pdf","creator":"aetemadi","success":1,"access_level":"open_access","content_type":"application/pdf","file_size":8914218},{"date_created":"2024-10-24T14:34:54Z","file_id":"18470","relation":"source_file","date_updated":"2024-10-24T14:34:54Z","file_name":"thesis-arian-etemadi-latex-source.zip","checksum":"1c02586ed7d441d5ec441867650568d1","creator":"aetemadi","content_type":"application/x-zip-compressed","file_size":9802650,"access_level":"closed"}],"publication_identifier":{"issn":["2791-4585"]},"has_accepted_license":"1","month":"10","publisher":"Institute of Science and Technology Austria","oa":1,"oa_version":"Published Version","alternative_title":["ISTA Master's Thesis"],"author":[{"id":"36cea3aa-f38e-11ec-8ae0-c65ae6f6098f","last_name":"Etemadihaghighi","full_name":"Etemadihaghighi, Arian","first_name":"Arian"}],"title":"Filling the holes of non-manifold self-intersecting meshes for implicit topology changes in surface tracking","page":"39","doi":"10.15479/at:ista:18301","language":[{"iso":"eng"}],"file_date_updated":"2024-10-24T14:34:54Z","abstract":[{"text":"Physics simulation in computer graphics can bring triangle meshes into topologically invalid states. The method in this thesis contributed to Heiss-Synak* and Kalinov* et al. [2024] who devised a non-manifold hybrid surface tracker—a surface tracker that repairs explicit non-manifold triangle meshes with the help of the implicit domain. Specifically, this thesis provides an algorithm for filling the holes that are left after removing problematic parts of the mesh.","lang":"eng"}],"ddc":["000"],"department":[{"_id":"GradSch"},{"_id":"ChWo"}],"related_material":{"record":[{"id":"17219","status":"public","relation":"part_of_dissertation"}]},"_id":"18301","OA_place":"publisher","publication_status":"published","article_processing_charge":"No","type":"dissertation","citation":{"ista":"Etemadi A. 2024. Filling the holes of non-manifold self-intersecting meshes for implicit topology changes in surface tracking. Institute of Science and Technology Austria.","apa":"Etemadi, A. (2024). <i>Filling the holes of non-manifold self-intersecting meshes for implicit topology changes in surface tracking</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:18301\">https://doi.org/10.15479/at:ista:18301</a>","chicago":"Etemadi, Arian. “Filling the Holes of Non-Manifold Self-Intersecting Meshes for Implicit Topology Changes in Surface Tracking.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:18301\">https://doi.org/10.15479/at:ista:18301</a>.","short":"A. Etemadi, Filling the Holes of Non-Manifold Self-Intersecting Meshes for Implicit Topology Changes in Surface Tracking, Institute of Science and Technology Austria, 2024.","mla":"Etemadi, Arian. <i>Filling the Holes of Non-Manifold Self-Intersecting Meshes for Implicit Topology Changes in Surface Tracking</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:18301\">10.15479/at:ista:18301</a>.","ama":"Etemadi A. Filling the holes of non-manifold self-intersecting meshes for implicit topology changes in surface tracking. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:18301\">10.15479/at:ista:18301</a>","ieee":"A. Etemadi, “Filling the holes of non-manifold self-intersecting meshes for implicit topology changes in surface tracking,” Institute of Science and Technology Austria, 2024."},"date_published":"2024-10-15T00:00:00Z","day":"15","status":"public"}]