[{"publication_status":"published","alternative_title":["ISTA Master’s Thesis"],"language":[{"iso":"eng"}],"OA_place":"publisher","doi":"10.15479/AT-ISTA-20964","publication_identifier":{"issn":["2791-4585"]},"date_updated":"2026-04-07T11:41:44Z","date_published":"2026-01-14T00:00:00Z","title":"Armadillo repeat only proteins are master regulators of plant cyclic-nucleotide gated channels","corr_author":"1","date_created":"2026-01-09T09:22:48Z","page":"22","type":"dissertation","article_processing_charge":"No","_id":"20964","ddc":["570"],"department":[{"_id":"GradSch"},{"_id":"JiFr"}],"month":"01","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","citation":{"ista":"Vladimirtsev D. 2026. Armadillo repeat only proteins are master regulators of plant cyclic-nucleotide gated channels. Institute of Science and Technology Austria.","apa":"Vladimirtsev, D. (2026). <i>Armadillo repeat only proteins are master regulators of plant cyclic-nucleotide gated channels</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-20964\">https://doi.org/10.15479/AT-ISTA-20964</a>","chicago":"Vladimirtsev, Dmitrii. “Armadillo Repeat Only Proteins Are Master Regulators of Plant Cyclic-Nucleotide Gated Channels.” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-20964\">https://doi.org/10.15479/AT-ISTA-20964</a>.","ama":"Vladimirtsev D. Armadillo repeat only proteins are master regulators of plant cyclic-nucleotide gated channels. 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20964\">10.15479/AT-ISTA-20964</a>","ieee":"D. Vladimirtsev, “Armadillo repeat only proteins are master regulators of plant cyclic-nucleotide gated channels,” Institute of Science and Technology Austria, 2026.","short":"D. Vladimirtsev, Armadillo Repeat Only Proteins Are Master Regulators of Plant Cyclic-Nucleotide Gated Channels, Institute of Science and Technology Austria, 2026.","mla":"Vladimirtsev, Dmitrii. <i>Armadillo Repeat Only Proteins Are Master Regulators of Plant Cyclic-Nucleotide Gated Channels</i>. Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20964\">10.15479/AT-ISTA-20964</a>."},"degree_awarded":"MS","related_material":{"record":[{"status":"public","id":"20982","relation":"part_of_dissertation"}]},"publisher":"Institute of Science and Technology Austria","status":"public","file":[{"embargo_to":"open_access","creator":"dvladimi","file_name":"2026_Vladimirtsev_Dmitrii_Thesis.pdf","access_level":"closed","file_size":2867531,"file_id":"21033","checksum":"812857b2fbe3f6113bef22fd04bccd3e","date_created":"2026-01-21T14:12:13Z","content_type":"application/pdf","embargo":"2027-01-01","date_updated":"2026-01-21T14:12:13Z","relation":"main_file"},{"relation":"source_file","file_id":"21034","checksum":"2b969f97f8d7461bea3d255f48c2219c","access_level":"closed","file_size":25023066,"creator":"dvladimi","file_name":"Source Files.zip","date_updated":"2026-01-28T12:38:19Z","content_type":"application/x-zip-compressed","date_created":"2026-01-21T14:41:58Z"}],"has_accepted_license":"1","acknowledged_ssus":[{"_id":"LifeSc"},{"_id":"Bio"}],"day":"14","supervisor":[{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jiří","orcid":"0000-0002-8302-7596","first_name":"Jiří","last_name":"Friml"}],"year":"2026","file_date_updated":"2026-01-28T12:38:19Z","oa_version":"Published Version","author":[{"last_name":"Vladimirtsev","first_name":"Dmitrii","full_name":"Vladimirtsev, Dmitrii","id":"60466724-5355-11ee-ae5a-fa55e8f99c3d"}],"project":[{"_id":"8f347782-16d5-11f0-9cad-8c19706ee739","name":"Cyclic nucleotides as second messengers in plants","grant_number":"101142681"}]},{"author":[{"last_name":"Garcia Castillo","first_name":"Diego Fernando","full_name":"Garcia Castillo, Diego Fernando","id":"ae681a14-dc74-11ea-a0a7-c6ef18161701"}],"supervisor":[{"orcid":"0000-0002-8548-5240","first_name":"Nicholas H","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H"},{"id":"3C147470-F248-11E8-B48F-1D18A9856A87","full_name":"Westram, Anja M","first_name":"Anja M","orcid":"0000-0003-1050-4969","last_name":"Westram"}],"year":"2026","oa_version":"Published Version","file_date_updated":"2026-01-16T13:08:59Z","status":"public","file":[{"date_updated":"2026-01-16T12:25:13Z","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","date_created":"2026-01-16T12:25:13Z","checksum":"841f1bc073d667125729b2a017f8c37a","file_id":"20996","access_level":"closed","file_size":22456421,"file_name":"2026_Garcia_Diego_Thesis.docx","creator":"dgarciac","relation":"source_file"},{"creator":"dgarciac","file_name":"2026_Garcia_Diego_Thesis.pdf","checksum":"a1f33d4f183ce7072eee42a6ccf5340b","file_id":"20997","file_size":9556719,"access_level":"open_access","content_type":"application/pdf","date_created":"2026-01-16T12:25:13Z","date_updated":"2026-01-16T12:25:13Z","relation":"main_file","success":1},{"relation":"supplementary_material","creator":"dgarciac","file_name":"2026_DiegoGarcia_LittorinaDB Source Code and Protocols.rar","access_level":"closed","file_size":54491433,"description":"Source code of the PostgreSQL database, front-end and back-end of the LittorinaDB web application developed as a product of the 4th chapter of the thesis.","file_id":"20998","checksum":"98a80691067174c30fe53f38ce7344e6","date_created":"2026-01-16T13:08:14Z","content_type":"application/x-compressed","date_updated":"2026-01-16T13:08:14Z"},{"content_type":"application/x-compressed","date_created":"2026-01-16T13:08:14Z","date_updated":"2026-01-16T13:08:14Z","file_name":"2026_DiegoGarcia_Thesis-Supplementary_Material.rar","creator":"dgarciac","checksum":"99a3cab2fa36666b9a92eefc27d586da","file_id":"20999","file_size":7982811,"access_level":"open_access","relation":"supplementary_material"},{"content_type":"text/plain","date_created":"2026-01-16T13:08:59Z","date_updated":"2026-01-16T13:08:59Z","creator":"dgarciac","file_name":"README.txt","file_id":"21000","checksum":"255fdf56b2932c46bf27c63aa6106a4f","file_size":732,"access_level":"open_access","relation":"supplementary_material"}],"publisher":"Institute of Science and Technology Austria","tmp":{"short":"CC BY-NC-SA (4.0)","image":"/images/cc_by_nc_sa.png","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode"},"related_material":{"record":[{"id":"18498","relation":"research_data","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"18491"}]},"has_accepted_license":"1","day":"16","month":"01","department":[{"_id":"GradSch"},{"_id":"NiBa"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","citation":{"short":"D.F. Garcia Castillo, The Genomic Architecture of Local Adaptation in Introduced Populations, Institute of Science and Technology Austria, 2026.","mla":"Garcia Castillo, Diego Fernando. <i>The Genomic Architecture of Local Adaptation in Introduced Populations</i>. Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20991\">10.15479/AT-ISTA-20991</a>.","ista":"Garcia Castillo DF. 2026. The genomic architecture of local adaptation in introduced populations. Institute of Science and Technology Austria.","apa":"Garcia Castillo, D. F. (2026). <i>The genomic architecture of local adaptation in introduced populations</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-20991\">https://doi.org/10.15479/AT-ISTA-20991</a>","chicago":"Garcia Castillo, Diego Fernando. “The Genomic Architecture of Local Adaptation in Introduced Populations.” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-20991\">https://doi.org/10.15479/AT-ISTA-20991</a>.","ama":"Garcia Castillo DF. The genomic architecture of local adaptation in introduced populations. 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20991\">10.15479/AT-ISTA-20991</a>","ieee":"D. F. Garcia Castillo, “The genomic architecture of local adaptation in introduced populations,” Institute of Science and Technology Austria, 2026."},"degree_awarded":"PhD","page":"199","date_created":"2026-01-16T09:47:59Z","type":"dissertation","article_processing_charge":"No","ddc":["576"],"_id":"20991","corr_author":"1","publication_identifier":{"isbn":["978-3-99078-077-0"],"issn":["2663-337X"]},"doi":"10.15479/AT-ISTA-20991","date_updated":"2026-04-16T12:20:37Z","title":"The genomic architecture of local adaptation in introduced populations","date_published":"2026-01-16T00:00:00Z","abstract":[{"lang":"eng","text":"Rapid local adaptation to new environments is critical for species persistence, especially in introduced populations. The evolutionary success of these populations is fundamentally dictated by the organization of genetic variation—the genomic architecture—in the face of severe demographic constraints, such as the founder effects and genetic bottlenecks that frequently accompany colonization. A central question in evolutionary biology is whether rapid adaptation relies on major-effect loci, such as chromosomal inversions, or on many small-effect loci dispersed across the genome. Furthermore, the genomic architecture strongly influences the extent to which evolutionary outcomes are predictable. Using introduced populations of the marine snail, Littorina saxatilis, as a model, this thesis investigates how genetic variation and genomic structure drive adaptation following introduction. We employed a population genomics approach on experimentally and accidentally introduced populations to dissect the specific genomic features that underpin divergence in newly colonized environments.\r\n\r\nIn Chapter 2, we tested the predictability of local adaptation through an uncommon 30-year transplant experiment in nature. By distinguishing allele and chromosomal inversion frequency changes from neutral expectations, we found that evolutionary change was highly predictable at the macro-scale (phenotypes and chromosomal inversions), but less robust at the level of individual collinear loci. This result demonstrates that evolution can be predictable when a population possesses sufficient standing genetic variation (SGV), with chromosomal inversions acting as key integrated units that facilitate a rapid response to selection. Building on this, Chapter 3 applied whole-genome sequencing to three accidentally introduced populations (Venice, San Francisco, and Redwood City) to investigate their likely source and genomic patterns of divergence. We identified genomic regions of remarkable divergence potentially associated with local adaptation, and likely fuelled by SGV, while explicitly acknowledging the difficulty in disentangling selection signals from the genome-wide effects of demographic processes. Furthermore, we found that the divergence patterns relied extensively on the collinear genome in these introduced populations, and less clearly on the chromosomal inversions. This observation contrasts with local adaptation observed in the experimental system that relied on both collinear loci and highly selected chromosomal inversions, highlighting how demographic history and genomic architecture influence the detectable signature of local adaptation.\r\n\r\nA major limitation to conducting large-scale comparative evolutionary studies is the lack of data standardization, which prevents the integration of community knowledge and high-resolution environmental and genetic data. Chapter 4 addresses this by developing a community database for the Littorina system. This platform implements standardized protocols for the integration of diverse phenotypic and environmental data from multiple Littorina species. Likewise, the platform also centralizes the availability of associated genomic data through links to external repositories. This database represents a crucial tool to test complex, large-scale evolutionary hypotheses.\r\n\r\nCollectively, this thesis strongly reinforces the fundamental importance of SGV as the raw material for successful local adaptation, a conclusion supported by evidence in both experimental and accidental introductions. Furthermore, this work highlights the critical role of the genomic architecture—specifically chromosomal inversions—in driving the predictability and effectiveness of adaptive responses. Our findings underscore how the interplay between SGV and genomic architecture dictates the trajectory and detectability of evolution in colonizing populations, while simultaneously providing a necessary tool to advance comparative evolutionary genomics in emerging model organisms."}],"license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","acknowledgement":"I acknowledge the funding agencies 1Norwegian Research Council RCN project 315287.\r\n2The FIASCO project \"Illuminating range shifts through evolutionary FIASCO: contrasting\r\nFaIling And Successful ColOnizations in replicated wild populations\", funded by the\r\nEuropean Union - Next Generation EU (Piano Nazionale di Ripresa e Resilienza - MUR\r\ncode: P202229JBC, CUP: C53D23007100001). 3Ecotypic formation in Littorina saxatilis\r\nin the Western Atlantic and comparisons across the North Atlantic. University of\r\nGothenburg Research Travel Grant, Tjarno Marine Laboratory, Sweden. $3023 (2018).\r\n4JIN project (Young Researchers, Spanish Ministry of Science, RTI2018-101274-J-I00)","oa":1,"alternative_title":["ISTA Thesis"],"publication_status":"published","OA_place":"publisher","language":[{"iso":"eng"}]},{"degree_awarded":"MS","citation":{"mla":"Karimi, Mahyar. <i>Privacy-Preserving Runtime Verification</i>. Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21401\">10.15479/AT-ISTA-21401</a>.","short":"M. Karimi, Privacy-Preserving Runtime Verification, Institute of Science and Technology Austria, 2026.","ama":"Karimi M. Privacy-preserving runtime verification. 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21401\">10.15479/AT-ISTA-21401</a>","chicago":"Karimi, Mahyar. “Privacy-Preserving Runtime Verification.” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-21401\">https://doi.org/10.15479/AT-ISTA-21401</a>.","ieee":"M. Karimi, “Privacy-preserving runtime verification,” Institute of Science and Technology Austria, 2026.","apa":"Karimi, M. (2026). <i>Privacy-preserving runtime verification</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-21401\">https://doi.org/10.15479/AT-ISTA-21401</a>","ista":"Karimi M. 2026. Privacy-preserving runtime verification. Institute of Science and Technology Austria."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"month":"03","day":"05","has_accepted_license":"1","related_material":{"record":[{"id":"21020","relation":"part_of_dissertation","status":"public"}]},"ec_funded":1,"status":"public","publisher":"Institute of Science and Technology Austria","file":[{"relation":"main_file","content_type":"application/pdf","date_created":"2026-03-06T14:06:25Z","date_updated":"2026-03-10T15:20:09Z","file_name":"2026_Karimi_Mahyar_Thesis.pdf","creator":"mkarimi","checksum":"3f49f05c9d123e14d7adb73d3bc50fe2","file_id":"21404","file_size":766048,"access_level":"open_access"},{"date_created":"2026-03-06T14:06:25Z","content_type":"application/zip","date_updated":"2026-03-06T14:06:25Z","creator":"mkarimi","file_name":"2026_Karimi_Mahyar_Thesis_src.zip","file_size":1243394,"access_level":"closed","checksum":"8fb9db4b4187e26443369a993427a5ff","file_id":"21405","relation":"source_file"}],"file_date_updated":"2026-03-10T15:20:09Z","oa_version":"Published Version","year":"2026","supervisor":[{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"author":[{"orcid":"0009-0005-0820-1696","first_name":"Mahyar","last_name":"Karimi","id":"6e5417ba-5355-11ee-ae5a-94c2e510b26b","full_name":"Karimi, Mahyar"}],"project":[{"call_identifier":"H2020","grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"},{"_id":"34a4ce89-11ca-11ed-8bc3-8cc37fb6e11f","grant_number":"F8512","name":"Security and Privacy by Design for Complex Systems"}],"language":[{"iso":"eng"}],"OA_place":"repository","publication_status":"published","alternative_title":["ISTA Master’s Thesis"],"oa":1,"keyword":["Privacy-preserving verification","Runtime verification","Monitoring","Reactive functionalities","Cryptographic protocols"],"acknowledgement":"This work is part of the project VAMOS, which has received funding from the European\r\nResearch Council (ERC) under grant agreement No. 101020093, and the Austrian Science\r\nFund (FWF) SFB project SpyCoDe F8502.\r\n","abstract":[{"text":"Runtime verification offers scalable solutions to improve the safety and reliability of systems. However, systems that require verification or monitoring by a third party to ensure compliance with a specification might contain sensitive information, causing privacy concerns when usual runtime verification approaches are used. Privacy is compromised if protected information about the system, or sensitive data that is processed by the system, is revealed. In addition, revealing the specification being monitored may undermine the essence of third-party verification.\r\n\r\nIn this thesis, we propose a protocol for privacy-preserving runtime verification of systems against formal sequential specifications. We develop the protocol in two steps. In the first step, the monitor verifies whether the system satisfies the specification without learning anything else, though both parties are aware of the specification. In the second step, we extend the protocol to ensure that the system remains oblivious to the monitored specification, while the monitor learns only whether the system satisfies the specification and nothing more. Our protocol adapts and improves existing techniques used in cryptography, and more specifically, multi-party computation.\r\n\r\nThe sequential specification defines the observation step of the monitor, whose granularity depends on the situation (e.g., banks may be monitored on a daily basis). Our protocol exchanges a single message per observation step, after an initialization phase. This design minimizes communication overhead, enabling relatively lightweight privacy-preserving monitoring. We implement our approach for monitoring specifications described by register automata and evaluate it experimentally.\r\n","lang":"eng"}],"date_published":"2026-03-05T00:00:00Z","title":"Privacy-preserving runtime verification","date_updated":"2026-03-13T13:37:20Z","doi":"10.15479/AT-ISTA-21401","publication_identifier":{"issn":["2791-4585"]},"corr_author":"1","_id":"21401","ddc":["000"],"article_processing_charge":"No","type":"dissertation","date_created":"2026-03-05T15:20:47Z","page":"60"},{"oa":1,"alternative_title":["ISTA Thesis"],"publication_status":"published","OA_place":"publisher","language":[{"iso":"eng"}],"title":"On secure chain selection rules from physical resources in a permissionless setting","date_published":"2026-03-04T00:00:00Z","abstract":[{"lang":"eng","text":"Blockchains enable distributed consensus in permissionless settings, where participants\r\nare unknown, dynamically changing, and do not trust each other. While Bitcoin,\r\nbased on Proof-of-Work (PoW), was the first protocol in this model, significant\r\nresearch has focused on permissionless protocols using alternative physical resources,\r\nspecifically Proof-of-Space (PoSpace) and Verifiable Delay Functions (VDFs). This\r\nthesis investigates the theoretical limits and design space of longest-chain protocols in\r\nthe fully permissionless and dynamically available settings using these three resources.\r\nFirst, we address the feasibility of blockchains relying solely on storage as a resource.\r\nWe prove a fundamental impossibility result: there exists no secure longest-chain\r\nprotocol based exclusively on Proof-of-Space in the fully permissionless or dynamically\r\navailable settings. Further, we quantify the adversarial capabilities required to execute\r\na double-spend attack. Our result formally justifies the necessity of coupling PoSpace\r\nwith time-dependent primitives (such as VDFs) or to move to less permissive settings\r\n(quasi-permissionless or permissioned) to ensure security.\r\nSecond, we generalize Nakamoto-like heaviest chain consensus to protocols utilizing\r\ncombinations of multiple physical resources. We analyze chain selection rules governed\r\nby a weight function Γ(S, V,W), which assigns weight to blocks based on recorded\r\nSpace (S), VDF speed (V ), and Work (W). We provide a complete classification\r\nof secure weight functions, proving that a weight function is secure against private\r\ndouble-spend attacks if and only if it is homogeneous in the timed resources (V,W)\r\nand sub-homogeneous in S. This framework unifies existing protocols like Bitcoin and\r\nChia under a single theoretical model and provides a powerful tool for designing new\r\nlongest-chain blockchains from a mix of physical resources."}],"publication_identifier":{"isbn":["978-3-99078-078-7"],"issn":["2663-337X"]},"doi":"10.15479/AT-ISTA-21651","date_updated":"2026-04-15T08:45:19Z","corr_author":"1","article_processing_charge":"No","_id":"21651","ddc":["000"],"date_created":"2026-04-02T09:31:34Z","type":"dissertation","citation":{"short":"M.A. Baig, On Secure Chain Selection Rules from Physical Resources in a Permissionless Setting, Institute of Science and Technology Austria, 2026.","mla":"Baig, Mirza Ahad. <i>On Secure Chain Selection Rules from Physical Resources in a Permissionless Setting</i>. Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21651\">10.15479/AT-ISTA-21651</a>.","ista":"Baig MA. 2026. On secure chain selection rules from physical resources in a permissionless setting. Institute of Science and Technology Austria.","ieee":"M. A. Baig, “On secure chain selection rules from physical resources in a permissionless setting,” Institute of Science and Technology Austria, 2026.","ama":"Baig MA. On secure chain selection rules from physical resources in a permissionless setting. 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21651\">10.15479/AT-ISTA-21651</a>","chicago":"Baig, Mirza Ahad. “On Secure Chain Selection Rules from Physical Resources in a Permissionless Setting.” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-21651\">https://doi.org/10.15479/AT-ISTA-21651</a>.","apa":"Baig, M. A. (2026). <i>On secure chain selection rules from physical resources in a permissionless setting</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-21651\">https://doi.org/10.15479/AT-ISTA-21651</a>"},"degree_awarded":"PhD","month":"03","department":[{"_id":"GradSch"},{"_id":"KrPi"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","day":"04","status":"public","publisher":"Institute of Science and Technology Austria","file":[{"date_updated":"2026-04-13T08:24:13Z","content_type":"application/x-zip-compressed","date_created":"2026-04-03T17:28:48Z","file_id":"21655","checksum":"c3986dba90653dac97adba662ebff238","file_size":139353434,"access_level":"closed","file_name":"PhD-Thesis-Mirza-Ahad-Baig - Library Submission.zip","creator":"mbaig","relation":"source_file"},{"checksum":"292a5989262521f7c145a109d1f348cb","file_id":"21656","access_level":"open_access","file_size":1942037,"creator":"mbaig","file_name":"2026_Baig_Mirza_Ahad_Thesis.pdf","date_updated":"2026-04-15T07:37:25Z","content_type":"application/pdf","date_created":"2026-04-03T17:29:30Z","relation":"main_file"}],"tmp":{"short":"CC BY-NC-SA (4.0)","image":"/images/cc_by_nc_sa.png","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode"},"related_material":{"record":[{"status":"public","id":"21134","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"20587"}]},"has_accepted_license":"1","year":"2026","oa_version":"Published Version","file_date_updated":"2026-04-15T07:37:25Z","supervisor":[{"full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654"}],"author":[{"last_name":"Baig","first_name":"Mirza Ahad","full_name":"Baig, Mirza Ahad","id":"3EDE6DE4-AA5A-11E9-986D-341CE6697425"}]},{"title":"Interfacing superconducting qubits with optical photons","date_published":"2026-05-12T00:00:00Z","license":"https://creativecommons.org/licenses/by/4.0/","abstract":[{"text":"Atoms and photons, two things so different but yet so alike. The former, the building block of matter, something we learn about in school and imagine it as some tiny marbles encircled by other tinier marbles. The latter, an electromagnetic wave, a light particle or an excitation of the electromagnetic field. Quantum mechanics tells us about the properties of these two entities. And even if it sounds, looks and writes counter-intuitive, it has proven right for over a century now.\r\n\r\nIn this work, I elaborate on how we tested the laws of quantum mechanics and how we used them learn more about the tiny building blocks of nature and the fields they use to talk to each other. The atoms we use, are artificial. Superconducting qubits, small electrical circuits with quantized energy levels behave like electrons that transition between different orbitals in an atom. One of the qubits' advantages, is also a big disadvantage. We design the circuits' energy levels and fabricate them in a cleanroom. This allows for arbitrary spaced energy levels but in contrast to real atoms, prevents two superconducting qubits from being alike. Still, this qubit platform is one of the frontrunners for future quantum computing technology and testing fundamental physics due to their scalability.\r\n\r\nWe interface superconducting qubits, which operate in the GHz regime, with microwave photons. We use 3D aluminum cavities as mediators between qubits and photons. The cavities allow for non-destructive readout of the qubit state, they shield the qubits from noise at the qubit frequency and they give us an easy way to frequency-tune these joint systems.\r\n\r\nWe need to operate superconducting qubits and their cavities at millikelvin temperatures in dilution refrigerators. At higher temperatures, superconductivity suffers and even worse, the environment is filled with thermal noise photons. This poses a fundamental limitation on the scalability of superconducting qubit devices. Also connecting multiple devices in different fridges does not work over room temperature links because the microwave photons used for this purpose will be covered in noise and the quantum information they carry, will be unusable.\r\n\r\nInfrared photons do not suffer from this noise problem since there are close to zero thermal noise photons at their frequencies at room temperature. We cannot simply interface superconducting devices with optical photons due their frequency mismatch and the destructive effect of optical photons on superconductors. Therefore, we use microwave-to-optics transducers that allow to convert microwave photons into optical ones and vice-versa. The transducers that we use are macroscopic electro-optic transducers using the Pockels effect in a disk-shaped Lithium Niobate whispering gallery mode resonator. By using a strong optical pump, photons from the two frequency domains experience a beam-splitter interaction and get converted from one to the other.\r\n\r\nWe measure the generated optical photons using elaborate optical setups, optical heterodyning and single photon detectors to gain knowledge about the qubit state or the converted microwave photons. Bridging the microwave and the optical world allows us to take advantage of both of their strengths but it also requires deep knowledge about both of their working principles.\r\n\r\nIn this work, we describe two experiments that our group conducted to showcase the opportunities that arise from interfacing superconducting qubits with optical photons but also the pitfalls, one may encounter on the way.\r\n\r\nIn the first experiment, we managed to all-optically read out a superconducting qubit. We show that the assignment fidelity, the probability that a measurement of the qubit state matches the prepared state, is close to equal for all-optical, microwave-to-optics and conventional microwave readout. We show T1 and T2 measurements for all three readout types and give an analysis of the noise caused by the optics. Finally, we show that the infrared light does not affect the qubit performance in a negative way but that the heating it causes does. This is an important insight that we used in the next experiment.\r\n\r\nThe second experiment is the upconversion of itinerant single microwave photons to the optical domain. We show that we can generate single microwave photons from a qubit-cavity system. We upconvert these single photons, measure them with a single photon detector and reconstruct their shape. By conducting a single photon Rabi measurement, we show correlations between the microwave and the optical domain. And by thorough signal-to-noise measurements and noise analysis, we find that we can generate single infrared photons with high signal-to-noise ratio 5.1 and low transducer added noise (<0.012 quanta). We show that this measurement creates a path towards entanglement of a superconducting qubit and an optical photon and what parameters need to be improved to achieve it. Additionally, this experiment is a proof of principle for an on-demand infrared single photon source. More generally, it allows to link microwave quantum technology in general to the optical domain.","lang":"eng"}],"publication_identifier":{"issn":["2663-337X"]},"doi":"10.15479/AT-ISTA-21863","date_updated":"2026-05-20T13:35:43Z","alternative_title":["ISTA Thesis"],"oa":1,"publication_status":"published","OA_place":"publisher","language":[{"iso":"eng"}],"acknowledgement":"The author of this work was supported by the European Research Council under grant no.\r\n101089099 (ERC CoG cQEO) and the European Union’s Horizon 2020 research and innovation\r\nprogram under grant no. 899354 (FETopen SuperQuLAN).\r\nThis work was also supported by the European Research Council under grant nos. 758053\r\n(ERC StG QUNNECT), 101248662 (ERC POC CoupledEOT), and the European Innovation\r\nCouncil no. 101187231 (PathfinderOpen CIELO). This research was funded in whole or in part\r\nby the Austrian Science Fund (FWF) [10.55776/F71]. For open access purposes, the author\r\nhas applied a CC BY public copyright license to any author accepted manuscript version arising\r\nfrom this submission.\r\niii\r\nMy co-authors in the works mentioned later acknowledge generous support from the ISTFELLOW program, the NOMIS-ISTA fellowship, the Horizon Europe Program HORIZONCL4-2022-QUANTUM-01-SGA via Project No. 101113946 OpenSuperQPlus100 and a DOC fellowship of the Austrian Academy of Sciences at IST Austria.\r\n","keyword":["Superconducting qubits","Quantum optics","Single photons and quantum effects","Nonlinear optics"],"article_processing_charge":"No","ddc":["530","537","539"],"_id":"21863","page":"97","date_created":"2026-05-12T09:04:02Z","type":"dissertation","corr_author":"1","day":"12","ec_funded":1,"status":"public","file":[{"file_name":"2026_Werner_Thomas_Thesis.pdf","creator":"twerner","checksum":"a5b4d8dba83f96e955a3625c0eebee98","file_id":"21879","access_level":"open_access","file_size":9330516,"content_type":"application/pdf","date_created":"2026-05-15T15:53:57Z","date_updated":"2026-05-15T15:53:57Z","relation":"main_file"},{"relation":"source_file","date_updated":"2026-05-15T15:54:06Z","date_created":"2026-05-15T15:54:06Z","content_type":"application/x-zip-compressed","file_size":9370704,"access_level":"closed","checksum":"b41282beaacfb32472769b9e3b1758d8","file_id":"21880","creator":"twerner","file_name":"2026_Werner_Thomas_Thesis.zip"}],"publisher":"Institute of Science and Technology Austria","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"related_material":{"record":[{"relation":"part_of_dissertation","id":"19073","status":"public"},{"status":"public","id":"21870","relation":"part_of_dissertation"}]},"acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"},{"_id":"LifeSc"},{"_id":"SSU"}],"has_accepted_license":"1","citation":{"short":"T. Werner, Interfacing Superconducting Qubits with Optical Photons, Institute of Science and Technology Austria, 2026.","mla":"Werner, Thomas. <i>Interfacing Superconducting Qubits with Optical Photons</i>. Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21863\">10.15479/AT-ISTA-21863</a>.","ista":"Werner T. 2026. Interfacing superconducting qubits with optical photons. Institute of Science and Technology Austria.","apa":"Werner, T. (2026). <i>Interfacing superconducting qubits with optical photons</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-21863\">https://doi.org/10.15479/AT-ISTA-21863</a>","chicago":"Werner, Thomas. “Interfacing Superconducting Qubits with Optical Photons.” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-21863\">https://doi.org/10.15479/AT-ISTA-21863</a>.","ama":"Werner T. Interfacing superconducting qubits with optical photons. 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21863\">10.15479/AT-ISTA-21863</a>","ieee":"T. Werner, “Interfacing superconducting qubits with optical photons,” Institute of Science and Technology Austria, 2026."},"degree_awarded":"PhD","month":"05","department":[{"_id":"GradSch"},{"_id":"JoFi"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","author":[{"last_name":"Werner","first_name":"Thomas","orcid":"0009-0001-2346-5236","full_name":"Werner, Thomas","id":"1fcd8497-dba3-11ea-a45e-c6fbd715f7c7"}],"project":[{"_id":"bdadfa0d-d553-11ed-ba76-fb85edbd456a","grant_number":"101089099","name":"Cavity Quantum Electro Optics: Microwave photonics with nonclassical states"},{"call_identifier":"H2020","_id":"9B868D20-BA93-11EA-9121-9846C619BF3A","name":"Quantum Local Area Networks with Superconducting Qubits","grant_number":"899354"},{"call_identifier":"H2020","name":"A Fiber Optic Transceiver for Superconducting Qubits","grant_number":"758053","_id":"26336814-B435-11E9-9278-68D0E5697425"},{"_id":"5b807754-ab3d-11f0-914f-ff8c34502cc9","name":"Integrated optical coupling for low loss electro-optic interconnects","grant_number":"101248662"},{"grant_number":"101187231","name":"Cavity-Integrated Electro-Optics: Measuring, Converting and Manipulating Microwaves with Light","_id":"91aaf765-16d5-11f0-9cad-a8e7e44cccb7"},{"grant_number":"F07105","name":"QUANTUM INFORMATION SYSTEMS BEYOND CLASSICAL CAPABILITIES / P5- Integration of Superconducting Quantum Circuits","_id":"bdb108fd-d553-11ed-ba76-83dc74a9864f"},{"name":"Open Superconducting Quantum Computers (OpenSuperQPlus)","grant_number":"101080139","_id":"bdb7cfc1-d553-11ed-ba76-d2eaab167738"},{"_id":"9B861AAC-BA93-11EA-9121-9846C619BF3A","name":"NOMIS Fellowship Program"}],"year":"2026","oa_version":"Published Version","file_date_updated":"2026-05-15T15:54:06Z","supervisor":[{"last_name":"Fink","orcid":"0000-0001-8112-028X","first_name":"Johannes M","full_name":"Fink, Johannes M","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87"}]},{"OA_place":"publisher","language":[{"iso":"eng"}],"alternative_title":["ISTA Thesis"],"publication_status":"published","acknowledgement":"At different stages of my PhD, my work was supported by several grants: the\r\nDOC fellowship of the Austrian Academy of Sciences (26293, awarded to me),\r\nthe FWF-SFB grant (PT1032F06504 n. F65, awarded to Jan Maas), and the ERC\r\ngrant (PR1032ERC01 n. 716117, awarded to Jan Maas). I also appreciate the help\r\nfrom the Scientific Computing unit for their advice on the cluster usage.","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","title":"How epistasis and purifying selection shape genetic diversity","date_published":"2026-06-07T00:00:00Z","date_updated":"2026-06-12T12:43:35Z","publication_identifier":{"issn":["2663-337X"]},"doi":"10.15479/AT-ISTA-21918","corr_author":"1","ddc":["576"],"_id":"21918","article_processing_charge":"No","type":"dissertation","page":"89","date_created":"2026-05-27T06:26:08Z","degree_awarded":"PhD","citation":{"ama":"Khudiakova K. How epistasis and purifying selection shape genetic diversity. 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21918\">10.15479/AT-ISTA-21918</a>","chicago":"Khudiakova, Kseniia. “How Epistasis and Purifying Selection Shape Genetic Diversity.” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-21918\">https://doi.org/10.15479/AT-ISTA-21918</a>.","ieee":"K. Khudiakova, “How epistasis and purifying selection shape genetic diversity,” Institute of Science and Technology Austria, 2026.","apa":"Khudiakova, K. (2026). <i>How epistasis and purifying selection shape genetic diversity</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-21918\">https://doi.org/10.15479/AT-ISTA-21918</a>","ista":"Khudiakova K. 2026. How epistasis and purifying selection shape genetic diversity. Institute of Science and Technology Austria.","mla":"Khudiakova, Kseniia. <i>How Epistasis and Purifying Selection Shape Genetic Diversity</i>. Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21918\">10.15479/AT-ISTA-21918</a>.","short":"K. Khudiakova, How Epistasis and Purifying Selection Shape Genetic Diversity, Institute of Science and Technology Austria, 2026."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","month":"06","department":[{"_id":"GradSch"},{"_id":"NiBa"},{"_id":"JaMa"}],"day":"07","acknowledged_ssus":[{"_id":"ScienComp"}],"has_accepted_license":"1","file":[{"relation":"source_file","date_created":"2026-06-09T08:34:38Z","content_type":"application/x-zip-compressed","date_updated":"2026-06-09T08:40:48Z","file_name":"thesis.zip","creator":"kkhudiak","access_level":"closed","file_size":20549813,"file_id":"21965","checksum":"0cff64ae74f0f9f2d7011700c82f700a"},{"relation":"main_file","file_size":9387029,"access_level":"closed","checksum":"547ae42de37cc86894af283f1664dbc8","file_id":"21969","creator":"kkhudiak","file_name":"2026_Khudiakova_Ksenia_Thesis.pdf","embargo_to":"open_access","embargo":"2027-06-10","date_updated":"2026-06-11T12:14:53Z","date_created":"2026-06-09T12:28:51Z","content_type":"application/pdf"}],"publisher":"Institute of Science and Technology Austria","status":"public","ec_funded":1,"related_material":{"record":[{"relation":"part_of_dissertation","id":"11447","status":"public"},{"id":"12513","relation":"part_of_dissertation","status":"deleted"},{"status":"public","relation":"part_of_dissertation","id":"21967"},{"id":"21968","relation":"part_of_dissertation","status":"public"}]},"tmp":{"image":"/images/cc_by_nc_nd.png","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)"},"oa_version":"Published Version","file_date_updated":"2026-06-11T12:14:53Z","year":"2026","supervisor":[{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","first_name":"Nicholas H","last_name":"Barton"},{"full_name":"Maas, Jan","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","last_name":"Maas","orcid":"0000-0002-0845-1338","first_name":"Jan"}],"project":[{"_id":"256E75B8-B435-11E9-9278-68D0E5697425","name":"Optimal Transport and Stochastic Dynamics","grant_number":"716117","call_identifier":"H2020"},{"_id":"34d33d68-11ca-11ed-8bc3-ec13763c0ca8","grant_number":"26293","name":"The impact of deleterious mutations on small populations"},{"_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","grant_number":"F6504","name":"Taming Complexity in Partial Differential Systems"}],"author":[{"id":"4E6DC800-AE37-11E9-AC72-31CAE5697425","full_name":"Khudiakova, Kseniia","orcid":"0000-0002-6246-1465","first_name":"Kseniia","last_name":"Khudiakova"}]},{"oa_version":"Published Version","file_date_updated":"2026-03-13T11:19:21Z","year":"2026","supervisor":[{"last_name":"Hannezo","first_name":"Edouard B","orcid":"0000-0001-6005-1561","full_name":"Hannezo, Edouard B","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87"}],"author":[{"first_name":"Zuzana","last_name":"Dunajova","id":"4B39F286-F248-11E8-B48F-1D18A9856A87","full_name":"Dunajova, Zuzana"}],"project":[{"name":"Motile active matter models of migrating cells and chiral filaments","grant_number":"26360","_id":"34d75525-11ca-11ed-8bc3-89b6307fee9d"}],"degree_awarded":"PhD","citation":{"apa":"Dunajova, Z. (2026). <i>Geometry-driven self-organization of migrating cells and chiral filaments</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-21423\">https://doi.org/10.15479/AT-ISTA-21423</a>","ieee":"Z. Dunajova, “Geometry-driven self-organization of migrating cells and chiral filaments,” Institute of Science and Technology Austria, 2026.","chicago":"Dunajova, Zuzana. “Geometry-Driven Self-Organization of Migrating Cells and Chiral Filaments.” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-21423\">https://doi.org/10.15479/AT-ISTA-21423</a>.","ama":"Dunajova Z. Geometry-driven self-organization of migrating cells and chiral filaments. 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21423\">10.15479/AT-ISTA-21423</a>","ista":"Dunajova Z. 2026. Geometry-driven self-organization of migrating cells and chiral filaments. Institute of Science and Technology Austria.","mla":"Dunajova, Zuzana. <i>Geometry-Driven Self-Organization of Migrating Cells and Chiral Filaments</i>. Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21423\">10.15479/AT-ISTA-21423</a>.","short":"Z. Dunajova, Geometry-Driven Self-Organization of Migrating Cells and Chiral Filaments, Institute of Science and Technology Austria, 2026."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","month":"03","department":[{"_id":"GradSch"},{"_id":"EdHa"}],"day":"11","acknowledged_ssus":[{"_id":"ScienComp"}],"has_accepted_license":"1","status":"public","publisher":"Institute of Science and Technology Austria","file":[{"relation":"main_file","file_name":"2026_Dunajova_Zuzana_Thesis_pdfA.pdf","creator":"zdunajov","embargo_to":"open_access","access_level":"closed","file_size":14662770,"checksum":"47ce6a48a0c63f28eca6e64c9ffd2c84","file_id":"21446","date_created":"2026-03-12T20:38:52Z","content_type":"application/pdf","embargo":"2026-09-11","date_updated":"2026-03-12T20:38:52Z"},{"relation":"source_file","date_created":"2026-03-12T20:40:18Z","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","date_updated":"2026-03-13T11:19:21Z","creator":"zdunajov","file_name":"Thesis-Dunajova_source_file.docx","access_level":"closed","file_size":32961408,"checksum":"5dec5afdffd47c2b0b162d0fe1bed925","file_id":"21447"}],"related_material":{"record":[{"id":"13314","relation":"part_of_dissertation","status":"public"},{"status":"public","id":"13116","relation":"research_data"},{"relation":"research_data","id":"21439","status":"public"},{"relation":"part_of_dissertation","id":"21427","status":"public"}]},"tmp":{"short":"CC BY-NC-SA (4.0)","image":"/images/cc_by_nc_sa.png","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode"},"corr_author":"1","ddc":["539","570"],"_id":"21423","article_processing_charge":"No","type":"dissertation","page":"110","date_created":"2026-03-11T08:30:49Z","OA_place":"repository","language":[{"iso":"eng"}],"alternative_title":["ISTA Thesis"],"publication_status":"published","acknowledgement":"Finally, I gratefully acknowledge funding from the DOC Fellowship of the Austrian Academy\r\nof Sciences (OeAW): grant agreement 26360.","title":"Geometry-driven self-organization of migrating cells and chiral filaments","date_published":"2026-03-11T00:00:00Z","date_updated":"2026-07-06T12:38:16Z","publication_identifier":{"isbn":["978-3-99078-076-3"],"issn":["2663-337X"]},"doi":"10.15479/AT-ISTA-21423"},{"type":"dissertation","page":"131","date_created":"2026-07-08T12:44:31Z","_id":"22255","ddc":["515"],"article_processing_charge":"No","doi_confirm":"1","corr_author":"1","date_updated":"2026-07-20T14:58:23Z","publication_identifier":{"issn":["2663-337X"]},"doi":"10.15479/AT-ISTA-22255","abstract":[{"lang":"eng","text":"This thesis studies spectral rigidity and nonrigidity phenomena in dynamical systems. The central question is whether a dynamical system can be determined, up to a natural conjugacy, from its spectrum. We consider three related spectra: the length spectrum, the action spectrum, and the Lyapunov spectrum.\r\n\r\nThe first part of the thesis concerns Liouville metrics on the two-dimensional torus. It is a long-standing folklore conjecture that Liouville metrics are the only integrable metrics on the torus. We prove a length-spectral rigidity result for linear conformal deformations of Liouville metrics by exploiting the dynamical properties of the rational tori -- analogues of the resonant convex caustics in billiards. We also establish a complementary classification result showing that marked-length-isospectral Liouville metrics are characterized by rearrangements of the one-dimensional functions appearing in their conformal factors, generalizing a theorem of Abbondandolo-Mazzucchelli. In particular, the second result gives nonrigidity examples within the class of Liouville metrics.\r\n\r\nThe second part of the thesis studies the standard map from the viewpoint of action and Lyapunov spectra. We construct nontrivial deformations of the standard map which preserve the symplectic actions (respectively, the Lyapunov exponents) of infinitely many periodic orbits accumulating on an invariant curve. The proof combines a resonant normal form construction with Picard iteration schemes to obtain a sequence of periodic orbits accumulating on an invariant curve with a Liouville rotation number. Within the resonant normal forms we capture the dependence of these periodic orbits on the resonant Fourier coefficients of the dynamics on the invariant curve and, using the contraction mapping principle, obtain a suitable deformation achieving the prescribed spectral data associated with this sequence of orbits. The result can be viewed as a symplectic twist-map analogue of a length-spectral nonrigidity phenomenon for Riemannian manifolds and convex billiards, and it motivates the existence problem for similar 'partially length-isospectral' deformations of strictly convex billiard tables.\r\n"}],"title":"Spectral rigidity and nonrigidity of dynamical systems","date_published":"2026-07-11T00:00:00Z","acknowledgement":"The financial support of the ERC grant SPERIG #885707 is gratefully acknowledged.\r\n","OA_place":"publisher","language":[{"iso":"eng"}],"alternative_title":["ISTA Thesis"],"oa":1,"publication_status":"published","project":[{"call_identifier":"H2020","grant_number":"885707","name":"Spectral rigidity and integrability for billiards and geodesic flows","_id":"9B8B92DE-BA93-11EA-9121-9846C619BF3A"}],"author":[{"id":"41cb05d3-f128-11eb-9611-e4e2b3cfba31","full_name":"Li, Yunzhe","first_name":"Yunzhe","last_name":"Li"}],"supervisor":[{"id":"FE553552-CDE8-11E9-B324-C0EBE5697425","full_name":"Kaloshin, Vadim","first_name":"Vadim","orcid":"0000-0002-6051-2628","last_name":"Kaloshin"}],"oa_version":"Published Version","file_date_updated":"2026-07-20T14:00:33Z","year":"2026","acknowledged_ssus":[{"_id":"E-Lib"},{"_id":"CampIT"}],"has_accepted_license":"1","publisher":"Institute of Science and Technology Austria","ec_funded":1,"status":"public","file":[{"file_name":"2026_Li_Yunzhe_Thesis.pdf","creator":"yli","file_id":"22337","checksum":"8201cb5a427656a41828ecde8a85c04b","access_level":"open_access","file_size":1260717,"content_type":"application/pdf","date_created":"2026-07-14T10:48:45Z","date_updated":"2026-07-14T10:48:45Z","relation":"main_file"},{"relation":"source_file","file_name":"2026_Li_Yunzhe_Thesis.zip","creator":"yli","file_id":"22339","checksum":"19ee8461ed77f5b7980fc9461f778b6f","access_level":"closed","file_size":418752,"content_type":"application/x-zip-compressed","date_created":"2026-07-14T11:07:18Z","date_updated":"2026-07-20T14:00:33Z"}],"related_material":{"record":[{"relation":"part_of_dissertation","id":"22340","status":"public"},{"id":"22341","relation":"part_of_dissertation","status":"public"}]},"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"day":"11","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","month":"07","department":[{"_id":"GradSch"},{"_id":"VaKa"}],"degree_awarded":"PhD","citation":{"ista":"Li Y. 2026. Spectral rigidity and nonrigidity of dynamical systems. Institute of Science and Technology Austria.","chicago":"Li, Yunzhe. “Spectral Rigidity and Nonrigidity of Dynamical Systems.” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-22255\">https://doi.org/10.15479/AT-ISTA-22255</a>.","ama":"Li Y. Spectral rigidity and nonrigidity of dynamical systems. 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-22255\">10.15479/AT-ISTA-22255</a>","ieee":"Y. Li, “Spectral rigidity and nonrigidity of dynamical systems,” Institute of Science and Technology Austria, 2026.","apa":"Li, Y. (2026). <i>Spectral rigidity and nonrigidity of dynamical systems</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-22255\">https://doi.org/10.15479/AT-ISTA-22255</a>","short":"Y. Li, Spectral Rigidity and Nonrigidity of Dynamical Systems, Institute of Science and Technology Austria, 2026.","mla":"Li, Yunzhe. <i>Spectral Rigidity and Nonrigidity of Dynamical Systems</i>. Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-22255\">10.15479/AT-ISTA-22255</a>."}},{"author":[{"last_name":"Scott","first_name":"Jonathan A","full_name":"Scott, Jonathan A","id":"e499926b-f6e0-11ea-865d-9c63db0031e8"}],"oa_version":"Published Version","file_date_updated":"2026-02-27T10:25:41Z","year":"2026","supervisor":[{"orcid":"0000-0001-8622-7887","first_name":"Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph"}],"day":"09","has_accepted_license":"1","acknowledged_ssus":[{"_id":"ScienComp"}],"status":"public","publisher":"Institute of Science and Technology Austria","file":[{"date_created":"2026-02-17T11:46:22Z","content_type":"application/zip","date_updated":"2026-02-17T11:46:22Z","creator":"jscott","file_name":"2026_Scott_Jonathan_Thesis_Source.zip","access_level":"closed","file_size":272379252,"checksum":"121c1d968bd86f3630aa7e81d5bbbcb0","file_id":"21298","relation":"source_file"},{"relation":"main_file","success":1,"file_name":"2026_Jonathan_Scott_Thesis.pdf","creator":"jscott","checksum":"6e3e08ba474bbee8511cc8a839ab2077","file_id":"21366","file_size":15220298,"access_level":"open_access","content_type":"application/pdf","date_created":"2026-02-27T10:25:41Z","date_updated":"2026-02-27T10:25:41Z"}],"related_material":{"record":[{"relation":"part_of_dissertation","id":"20819","status":"public"},{"relation":"part_of_dissertation","id":"17411","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"18120"},{"id":"21207","relation":"part_of_dissertation","status":"public"}]},"degree_awarded":"PhD","citation":{"mla":"Scott, Jonathan A. <i>Data Heterogeneity and Personalization in Federated Learning</i>. Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21198\">10.15479/AT-ISTA-21198</a>.","short":"J.A. Scott, Data Heterogeneity and Personalization in Federated Learning, Institute of Science and Technology Austria, 2026.","apa":"Scott, J. A. (2026). <i>Data heterogeneity and personalization in federated learning</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-21198\">https://doi.org/10.15479/AT-ISTA-21198</a>","ama":"Scott JA. Data heterogeneity and personalization in federated learning. 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21198\">10.15479/AT-ISTA-21198</a>","chicago":"Scott, Jonathan A. “Data Heterogeneity and Personalization in Federated Learning.” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-21198\">https://doi.org/10.15479/AT-ISTA-21198</a>.","ieee":"J. A. Scott, “Data heterogeneity and personalization in federated learning,” Institute of Science and Technology Austria, 2026.","ista":"Scott JA. 2026. Data heterogeneity and personalization in federated learning. Institute of Science and Technology Austria."},"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","month":"02","department":[{"_id":"GradSch"},{"_id":"ChLa"}],"_id":"21198","ddc":["005"],"article_processing_charge":"No","type":"dissertation","page":"158","date_created":"2026-02-09T14:59:53Z","corr_author":"1","abstract":[{"lang":"eng","text":"In recent years there has been a massive increase in the amount of data generated in a\r\ndecentralized manner. Ever more powerful edge devices, such as smartphones, have become\r\nubiquitous in most societies on earth. Through text typed, photos taken and apps used,\r\nthese devices, which we refer to as clients, generate enormous amounts of high quality and\r\ncomplex data. Moreover, the nature of these devices means the data they generate is often\r\nsensitive and privacy concerns prevent it being gathered and stored in a central location. This\r\npresents a challenge to the modern machine learning paradigm that requires central access\r\nto large amounts of data. Federated learning (FL) has emerged as one of the answers to\r\nthis problem. Rather than bringing the data to the model, FL sends the model to the data.\r\nModel training takes place on device, with periodically synchronized updates, allowing data to\r\nremain locally stored. While this approach offers significant privacy advantages it comes with\r\nits own set of unique challenges. These include: data heterogeneity, the notion that different\r\ndevices generate data in distinct ways which can negatively impact training dynamics; systems\r\nheterogeneity, meaning that different devices may have differing hardware specifications; high\r\ncommunication costs, which are induced by the repeated transferring of models over the\r\nnetwork and low device computational power, which limits the use of larger models on device.\r\nIn this thesis we present a range of methods for federated learning. We focus primarily on\r\nthe challenge of data heterogeneity, though the methods presented are designed to be well\r\nadapted to the other challenges of a federated setting, such as the constraints of limited\r\ncompute and communication overhead. We first present a method for explicitly modeling client\r\ndata heterogeneity. The approach formulates clients as samples from a certain probability\r\ndistribution and infers the parameters of this distribution from the available training clients.\r\nThis learned distribution then represents the heterogeneity present among the clients and can\r\nbe sampled from in order to create new simulated clients that are similar to the real clients we\r\nhave observed so far. Following this we present two methods for directly dealing with data\r\nheterogeneity through personalization. Highly heterogeneous client data distributions can mean\r\nthat learning a single global model becomes suboptimal, and some form of personalization of\r\nmodels to each individual client is required. Our approaches are based around hypernetworks,\r\nwhich we use to generate personalized model parameters without the need for additional\r\ntraining or finetuning. In the first approach we focus on generating full parameterizations of\r\nclient models using learned embeddings of client data and labels, with a hypernetwork located\r\non the central server. In the second approach we address the more challenging scenario where\r\nwe want to generate a personalized model for a client without any label information. The\r\nhypernetwork is trained to generate a low dimensional representation of a client’s personalized\r\nmodel parameters, allowing it to be transferred to and run on the client devices. In our final\r\npresented method, we change our focus and rather than aim to directly address the challenge\r\nof data heterogeneity, we instead ensure we are unaffected by it. This is done in the context\r\nof k-means clustering and we present a method for federated clustering with a focus on added\r\nprivacy guarantees."}],"title":"Data heterogeneity and personalization in federated learning","date_published":"2026-02-09T00:00:00Z","date_updated":"2026-07-22T06:34:27Z","publication_identifier":{"issn":["2663-337X"]},"doi":"10.15479/AT-ISTA-21198","OA_place":"publisher","language":[{"iso":"eng"}],"oa":1,"alternative_title":["ISTA Thesis"],"publication_status":"published","acknowledgement":"This research was funded in part by the Austrian Science Fund (FWF)\r\n[10.55776/COE12]. Furthermore, the candidate acknowledges the support from the Scientific\r\nService Units (SSU) of ISTA through resources provided by Scientific Computing (SciComp)."},{"citation":{"ista":"Fillmore CD. 2026. Braiding geometry and topology to study shapes and data. Institute of Science and Technology Austria.","apa":"Fillmore, C. D. (2026). <i>Braiding geometry and topology to study shapes and data</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-21021\">https://doi.org/10.15479/AT-ISTA-21021</a>","ama":"Fillmore CD. Braiding geometry and topology to study shapes and data. 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21021\">10.15479/AT-ISTA-21021</a>","chicago":"Fillmore, Christopher D. “Braiding Geometry and Topology to Study Shapes and Data.” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-21021\">https://doi.org/10.15479/AT-ISTA-21021</a>.","ieee":"C. D. Fillmore, “Braiding geometry and topology to study shapes and data,” Institute of Science and Technology Austria, 2026.","short":"C.D. Fillmore, Braiding Geometry and Topology to Study Shapes and Data, Institute of Science and Technology Austria, 2026.","mla":"Fillmore, Christopher D. <i>Braiding Geometry and Topology to Study Shapes and Data</i>. Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21021\">10.15479/AT-ISTA-21021</a>."},"degree_awarded":"PhD","department":[{"_id":"GradSch"},{"_id":"HeEd"},{"_id":"UlWa"}],"month":"01","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","day":"21","related_material":{"record":[{"status":"public","id":"20260","relation":"part_of_dissertation"},{"id":"21051","relation":"part_of_dissertation","status":"public"},{"status":"public","id":"21050","relation":"part_of_dissertation"}]},"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"status":"public","file":[{"relation":"main_file","date_updated":"2026-01-30T11:40:09Z","date_created":"2026-01-26T19:44:46Z","content_type":"application/pdf","access_level":"open_access","file_size":55954297,"file_id":"21046","checksum":"4c0889130095c31d4e5088c5b8dfd607","file_name":"2025_Fillmore_Christopher_Thesis.pdf","creator":"cfillmor"},{"relation":"source_file","date_created":"2026-01-26T19:46:20Z","content_type":"application/x-zip-compressed","date_updated":"2026-01-26T19:46:20Z","file_name":"Thesis.zip","creator":"cfillmor","access_level":"closed","file_size":166080788,"file_id":"21047","checksum":"d69afb71d82ab98f856886126ee7303a"}],"publisher":"Institute of Science and Technology Austria","has_accepted_license":"1","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"ScienComp"}],"year":"2026","file_date_updated":"2026-01-30T11:40:09Z","oa_version":"Published Version","supervisor":[{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","first_name":"Herbert"},{"first_name":"Uli","orcid":"0000-0002-1494-0568","last_name":"Wagner","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","full_name":"Wagner, Uli"}],"author":[{"id":"35638A5C-AAC7-11E9-B0BF-5503E6697425","full_name":"Fillmore, Christopher D","first_name":"Christopher D","last_name":"Fillmore"}],"publication_status":"published","alternative_title":["ISTA Thesis"],"oa":1,"language":[{"iso":"eng"}],"OA_place":"publisher","acknowledgement":"The research presented in this thesis was funded by the DFG Collaborative Research\r\nCenter TRR 109, ‘Discretization in Geometry and Dynamics’.\r\n","date_published":"2026-01-21T00:00:00Z","title":"Braiding geometry and topology to study shapes and data","abstract":[{"lang":"eng","text":"This thesis examines how geometry and topology intersect in the representation, transformation, and analysis of complex shapes. It considers how continuous manifolds relate to their discrete analogues, how topological structures evolve in persistence vineyards, and how tools from topological data analysis can illuminate problems in mathematical physics. Central to this exploration is the question of how structure, both geometric and topological, persists or changes under approximation, sampling, or deformation. The work develops new approaches to skeletal and grid-based representations of surfaces, reveals the full expressive capacity of persistence vineyards, and applies topological methods to the longstanding problem of equilibria in electrostatic fields. These threads braid together into a broader understanding of how topology and geometry inform one another across theory, computation, and application."}],"doi":"10.15479/AT-ISTA-21021","publication_identifier":{"issn":["2663-337X"]},"date_updated":"2026-07-22T06:33:54Z","corr_author":"1","article_processing_charge":"No","ddc":["514","516"],"_id":"21021","date_created":"2026-01-20T21:38:40Z","page":"122","type":"dissertation"},{"citation":{"ista":"El-Hayek A. 2026. Handling updates and failures: Dynamic graph algorithms and distributed computing on dynamic networks. Institute of Science and Technology Austria.","chicago":"El-Hayek, Antoine. “Handling Updates and Failures: Dynamic Graph Algorithms and Distributed Computing on Dynamic Networks.” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-22281\">https://doi.org/10.15479/AT-ISTA-22281</a>.","ama":"El-Hayek A. Handling updates and failures: Dynamic graph algorithms and distributed computing on dynamic networks. 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-22281\">10.15479/AT-ISTA-22281</a>","ieee":"A. El-Hayek, “Handling updates and failures: Dynamic graph algorithms and distributed computing on dynamic networks,” Institute of Science and Technology Austria, 2026.","apa":"El-Hayek, A. (2026). <i>Handling updates and failures: Dynamic graph algorithms and distributed computing on dynamic networks</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-22281\">https://doi.org/10.15479/AT-ISTA-22281</a>","short":"A. El-Hayek, Handling Updates and Failures: Dynamic Graph Algorithms and Distributed Computing on Dynamic Networks, Institute of Science and Technology Austria, 2026.","mla":"El-Hayek, Antoine. <i>Handling Updates and Failures: Dynamic Graph Algorithms and Distributed Computing on Dynamic Networks</i>. Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-22281\">10.15479/AT-ISTA-22281</a>."},"degree_awarded":"PhD","department":[{"_id":"GradSch"},{"_id":"MoHe"}],"month":"07","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","day":"13","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"related_material":{"record":[{"status":"public","id":"20051","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"18557","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"19982"},{"status":"public","id":"21720","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"22374","status":"public"},{"status":"public","id":"22373","relation":"part_of_dissertation"}]},"status":"public","file":[{"success":1,"relation":"main_file","date_updated":"2026-07-17T11:39:47Z","date_created":"2026-07-17T11:39:47Z","content_type":"application/pdf","access_level":"open_access","file_size":5465973,"checksum":"923e4ca769c9ef2f6b0b005444faf462","file_id":"22356","file_name":"2026_El-Hayek_Antoine_Thesis.pdf","creator":"aelhayek"},{"creator":"aelhayek","file_name":"2026_El-Hayek_Antoine_Thesis.zip","access_level":"closed","file_size":9116107,"file_id":"22357","checksum":"262689f9df27dd6c2c7c7861f1de7329","date_created":"2026-07-17T11:40:34Z","content_type":"application/x-zip-compressed","date_updated":"2026-07-20T11:29:38Z","relation":"source_file"}],"publisher":"Institute of Science and Technology Austria","ec_funded":1,"has_accepted_license":"1","year":"2026","file_date_updated":"2026-07-20T11:29:38Z","oa_version":"Published Version","supervisor":[{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","first_name":"Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger"}],"project":[{"call_identifier":"H2020","name":"The design and evaluation of modern fully dynamic data structures","grant_number":"101019564","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62"},{"name":"Static and Dynamic Hierarchical Graph Decompositions","grant_number":"I05982","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103"},{"grant_number":"P33775","name":"Fast Algorithms for a Reactive Network Layer","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe"}],"author":[{"full_name":"El-Hayek, Antoine","id":"888a098e-fcac-11ee-aff7-d347be57b725","last_name":"El-Hayek","first_name":"Antoine","orcid":"0000-0003-4268-7368"}],"publisher_comment":"Sections 2.4 and 7.1 and chapter 6 are not CC-BY 4.0, they are All Rights Reserved.","publication_status":"published","alternative_title":["ISTA Thesis"],"oa":1,"language":[{"iso":"eng"}],"OA_place":"publisher","acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (MoDynStruct, No. 101019564)\r\n\"The Design and Evaluation of Modern Fully Dynamic Data Structures\" , from the\r\nAustrian Science Fund (FWF) grant DOI 10.55776/I5982 \"Static and Dynamic Hierarchical\r\nGraph Decompositions\", and from the Austrian Science Fund (FWF) and netIDEE SCIENCE\r\nproject P 33775-N, \"Fast Algorithms for a Reactive Network Layer\".\r\n","date_published":"2026-07-13T00:00:00Z","title":"Handling updates and failures: Dynamic graph algorithms and distributed computing on dynamic networks","abstract":[{"lang":"eng","text":"In this thesis, we took a look at networks, and more specifically, at networks that change over time, whether those are networks in the distributed algorithms sense of the word, or the graph algorithm sense. \r\n\r\nIn distributed algorithms, we looked at two main problems. First, the broadcast problem: given n agents, each agent is tasked to forward a (unique) message to every other agent. Agents collaborate and can copy and forward all messages they have received up until that point. Broadcast is achieved when one agent has successfully broadcast its message to everyone else. We studied the case where the communication network is controlled by an adversary, under the condition that the graph is rooted in every round of communication. We show that the adversary can delay broadcast for at most  l\r\n(1 + √\r\n2)n\r\nm\r\n rounds, improving on the $O(n\\log\\log n)$ previous upper bound~\\cite{fugger2020radius}, and asymptotically matching the $\\sim 1.5n$ lower bound~\\cite{schwarz2017linear}.\r\n\r\nWe then looked at the stochastic version of the problem: here, the adversary -- parametrized by $k$ where $k=0$ signifies that the adversary has no control,  and $k=n$ that the adversary has full control -- can choose parts of the graph, and the graph is then completed stochastically. Here, we are able to look at a stronger version of broadcast: instead of having $n$ messages trying to be broadcast in parallel, we can assume that only one message needs to be broadcasted. We show the bound $\\Theta(k+\\log n)$.\r\n\r\nThen, we looked at undecided states dynamics in population protocols: given a population of $n$ agents, where each initially holds an opinion among $k$ different ones. In each round, two agents are chosen uniformly at random, and can interact. If they have different opinions, they forget their opinions and become undecided. If one of them is undecided while the other has an opinion, they undecided agent copies they opinion of the decided one. The question is then, how many interactions does it take for the whole population to share the same opinion? We show a $\\Omega(kn\\log \\frac {\\sqrt n} {k \\log n})$ lower bound  for any $k = o\\left(\\frac {\\sqrt n}{\\log n}\\right)$.\r\nThis is tight for any $ k \\le n^{\\frac 1 2 - \\epsilon}$, where $\\epsilon >0$ can be any small constant, matching the known $O(kn\\log n)$ upper bound for $k = O\\left(\\frac {\\sqrt n} {\\log ^2 n}\\right)$~\\cite{DBLP:conf/podc/AmirABBHKL23}.\r\n\r\nFinally, in dynamic algorithms, we study the minimum cut problem: we are given a graph, whose vertex set we want to partition into two subsets such that the number of edges crossing from one subset to the other is minimized. Then, the graph can be updated via edge insertions or deletions, and we must update the solution without recomputing everything from scratch. We present an exact fully-dynamic minimum cut algorithm that runs in $n^{o(1)}$ deterministic update time when the minimum cut size is at most $2^{\\Theta(\\log^{3/4-c}n)}$ for any $c>0$, improving on the previous algorithm~\\cite{DBLP:conf/soda/JinST24} whose minimum cut size limit is $(\\log n)^{o(1)}$. Using sparsification and randomization techniques, we are able to extend this to all values of the minimum cut in weighted graphs, at the cost of a $(1+o(1))$-approximation ratio."}],"doi":"10.15479/AT-ISTA-22281","publication_identifier":{"issn":["2663-337X"]},"date_updated":"2026-07-24T12:48:29Z","corr_author":"1","doi_confirm":"1","article_processing_charge":"No","_id":"22281","ddc":["000"],"date_created":"2026-07-13T09:39:59Z","page":"244","type":"dissertation"},{"article_processing_charge":"No","ddc":["000"],"_id":"21854","das_tickbox":"1","page":"237","date_created":"2026-05-11T08:43:22Z","type":"dissertation","doi_confirm":"1","corr_author":"1","title":"On the utility and effects of efficiency in artificial neural networks","date_published":"2026-05-11T00:00:00Z","abstract":[{"text":"As neural-network-based models grow both in size and popularity, interest has grown in making the models smaller and more efficient to train. To that end, many methods have been proposed to prune models by reducing their number of nonzero parameters. Additionally, parameter-efficient fine-tuning, in which a much smaller number of parameters than the total contained in the model is updated during training, has become very popular, especially in the space of Large Language Models. At the same time, the increasingly routine deployment of machine learning in real-world applications has spurred a drive to make them more trustworthy - in the sense of, among other things, being unbiased, interpretable, and editable. In this thesis, we examine the interplay between efficiency and trustworthiness.\r\n\r\nFirst, we analyze the effects of model pruning on bias in computer vision models, demonstrating that increased sparsity leads to greater bias, largely as a function of increased model uncertainty in marginal cases. Based on this observation, we propose several bias mitigation techniques. Then, we demonstrate that example-specific model pruning can improve model interpretation methods while improving pruning efficiency to make example-specific model pruning feasible in real time. Then, we investigate the effectiveness of parameter-efficient and data-efficient model personalization via fine-tuning, demonstrating that it is highly feasible with very small computational and data resources. Finally, we consider efficiency in editing model knowledge using a custom synthetic data framework, demonstrating that parameter-efficient, low-rank fine-tuning frequently outperforms full-rank fine-tuning, and, additionally, that restricting which model blocks are fine-tuned frequently improves results. Together, the results in this thesis provide new insights and techniques for combining trustworthiness and efficiency during neural network inference and training.\r\n\r\n","lang":"eng"}],"publication_identifier":{"issn":["2663-337X"]},"doi":"10.15479/AT-ISTA-21854","date_updated":"2026-07-27T12:50:04Z","alternative_title":["ISTA Thesis"],"oa":1,"publication_status":"published","OA_place":"publisher","language":[{"iso":"eng"}],"acknowledgement":"The research in this Ph.D. was funded in whole\r\nor in part by the Austrian Science Fund (FWF) W1260-N35 (Vienna Graduate School for\r\nComputational Optimization). For open access purposes the author has applied a CC BY\r\npublic copyright license to any author accepted manuscript version arising from this submission\r\nwherever possible. Additionally, I am grateful to Alois Schlögl, Waleed Khalid, and the rest of\r\nthe ISTA Scientific Computing team for building and maintaining the infrastructure I used\r\nto run experiments. I’m also deeply grateful to the Alistarh group’s administrative assistant,\r\nChristine Francois, who always deals with our nonsense with common sense and a smile.\r\n","author":[{"id":"f9a17499-f6e0-11ea-865d-fdf9a3f77117","full_name":"Iofinova, Eugenia B","first_name":"Eugenia B","orcid":"0000-0002-7778-3221","last_name":"Iofinova"}],"project":[{"grant_number":"W1260-N35","name":"Vienna Graduate School on Computational Optimization","_id":"9B9290DE-BA93-11EA-9121-9846C619BF3A"}],"publisher_comment":"In reference to IEEE copyrighted material which is used with permission in this thesis, the IEEE does not endorse any of ISTA's products or services. Internal or personal use of this material is permitted. If interested in reprinting/republishing IEEE copyrighted material for advertising or promotional purposes or for creating new collective works for resale or redistribution, please go to http://www.ieee.org/publications_standards/publications/rights/rights_link.html to learn how to obtain a License from RightsLink. If applicable, University Microfilms and/or ProQuest Library, or the Archives of Canada may supply single copies of the dissertation.","year":"2026","oa_version":"Published Version","file_date_updated":"2026-05-13T13:10:48Z","supervisor":[{"full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X"}],"day":"11","publisher":"Institute of Science and Technology Austria","file":[{"relation":"source_file","content_type":"application/zip","date_created":"2026-05-11T08:36:01Z","date_updated":"2026-05-11T08:36:01Z","file_name":"EIofinova_thesis_FinalVersion.zip","creator":"eiofinov","file_id":"21856","checksum":"2e148dad920e3f9b7c32796e0ba2e5f7","file_size":28479571,"access_level":"closed"},{"success":1,"relation":"main_file","date_updated":"2026-05-13T13:10:48Z","date_created":"2026-05-13T13:10:48Z","content_type":"application/pdf","access_level":"open_access","file_size":18137757,"file_id":"21877","checksum":"b10c2933f386f532b2dbf28b19c5525c","creator":"eiofinov","file_name":"2026_Iofinova_Eugenia_Thesis.pdf"}],"status":"public","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"14771"},{"status":"public","relation":"part_of_dissertation","id":"18121"},{"relation":"part_of_dissertation","id":"21858","status":"public"},{"relation":"part_of_dissertation","id":"21859","status":"public"},{"id":"21857","relation":"part_of_dissertation","status":"public"}]},"has_accepted_license":"1","acknowledged_ssus":[{"_id":"ScienComp"}],"citation":{"ista":"Iofinova EB. 2026. On the utility and effects of efficiency in artificial neural networks. Institute of Science and Technology Austria.","apa":"Iofinova, E. B. (2026). <i>On the utility and effects of efficiency in artificial neural networks</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-21854\">https://doi.org/10.15479/AT-ISTA-21854</a>","chicago":"Iofinova, Eugenia B. “On the Utility and Effects of Efficiency in Artificial Neural Networks.” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-21854\">https://doi.org/10.15479/AT-ISTA-21854</a>.","ieee":"E. B. Iofinova, “On the utility and effects of efficiency in artificial neural networks,” Institute of Science and Technology Austria, 2026.","ama":"Iofinova EB. On the utility and effects of efficiency in artificial neural networks. 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21854\">10.15479/AT-ISTA-21854</a>","short":"E.B. Iofinova, On the Utility and Effects of Efficiency in Artificial Neural Networks, Institute of Science and Technology Austria, 2026.","mla":"Iofinova, Eugenia B. <i>On the Utility and Effects of Efficiency in Artificial Neural Networks</i>. Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21854\">10.15479/AT-ISTA-21854</a>."},"degree_awarded":"PhD","month":"05","department":[{"_id":"GradSch"},{"_id":"DaAl"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9"},{"doi":"10.15479/AT-ISTA-21957","publication_identifier":{"isbn":["978-3-99078-079-4"],"issn":["2663-337X"]},"date_updated":"2026-07-27T14:30:42Z","date_published":"2026-06-09T00:00:00Z","title":"Overcoming degeneracy and singularity: Techniques for semidefinite programs and homotopy continuation endgames","abstract":[{"lang":"eng","text":"This thesis investigates algorithmic certification and approximation methods for degenerate semidefinite programs (SDPs) and the singular roots of polynomial systems. In the first part, we present a hybrid symbolic-numeric algorithm for certifying the feasibility of weakly feasible, degenerate SDPs. By reformulating linear matrix inequalities (LMIs) into a structured polynomial system via facial reduction and incidence varieties, we guarantee the existence of an isolated exact solution. This algebraic reduction enables the certification of maximum-rank numerical approximations using methods from algebraic geometry.\r\n\r\nIn the second part, we address the severe ill-conditioning and loss of quadratic convergence that plague standard path-tracking methods near isolated singular roots. To overcome this, we propose tracking algorithms that achieve superlinear convergence without the computational bloat characteristic of classical deflation techniques. By modeling the solution path as a generalized fractional Puiseux series, our approach combines an explicitly derived algebraic predictor with a localized hyperplane desingularization phase during the corrector step. Furthermore, we introduce a continuous path-limit method and an extension of the geometric sequence rule to directly extract exact fractional exponents. This bypasses traditional heuristic trial-and-error methods and explicitly accommodates sparse series expansions. Numerical experiments confirm that our method significantly reduces the cumulative number of matrix inversions while achieving high-accuracy root approximations, even for heavily degenerate systems exhibiting higher coranks."}],"acknowledgement":"Funding: Vienna Graduate School on Computational Optimization (FWF), grant DOI: 10.55776/W1260.","publication_status":"published","oa":1,"alternative_title":["ISTA Thesis"],"language":[{"iso":"eng"}],"OA_place":"publisher","date_created":"2026-06-08T13:29:52Z","page":"89","type":"dissertation","article_processing_charge":"No","_id":"21957","das_tickbox":"1","ddc":["500"],"corr_author":"1","doi_confirm":"1","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"21144"}]},"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"publisher":"Institute of Science and Technology Austria","status":"public","file":[{"date_updated":"2026-06-08T13:20:02Z","date_created":"2026-06-08T13:20:02Z","content_type":"application/zip","access_level":"closed","file_size":40811933,"checksum":"b11a959e99d3dcf61040282b5c837141","file_id":"21958","creator":"jzapata","file_name":"istaustriathesis_JZapata.zip","relation":"source_file"},{"creator":"jzapata","file_name":"4_Final_Thesis_JZapata_REX.pdf","file_id":"21992","checksum":"edf1e5899b2e31505cd1aa3fe8bd4b7f","file_size":2207892,"access_level":"open_access","content_type":"application/pdf","date_created":"2026-06-10T13:33:25Z","date_updated":"2026-06-10T13:33:25Z","relation":"main_file","success":1}],"has_accepted_license":"1","day":"09","department":[{"_id":"GradSch"},{"_id":"VlKo"}],"month":"06","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"mla":"Zapata, Jeferson. <i>Overcoming Degeneracy and Singularity: Techniques for Semidefinite Programs and Homotopy Continuation Endgames</i>. Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21957\">10.15479/AT-ISTA-21957</a>.","short":"J. Zapata, Overcoming Degeneracy and Singularity: Techniques for Semidefinite Programs and Homotopy Continuation Endgames, Institute of Science and Technology Austria, 2026.","apa":"Zapata, J. (2026). <i>Overcoming degeneracy and singularity: Techniques for semidefinite programs and homotopy continuation endgames</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-21957\">https://doi.org/10.15479/AT-ISTA-21957</a>","chicago":"Zapata, Jeferson. “Overcoming Degeneracy and Singularity: Techniques for Semidefinite Programs and Homotopy Continuation Endgames.” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-21957\">https://doi.org/10.15479/AT-ISTA-21957</a>.","ama":"Zapata J. Overcoming degeneracy and singularity: Techniques for semidefinite programs and homotopy continuation endgames. 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21957\">10.15479/AT-ISTA-21957</a>","ieee":"J. Zapata, “Overcoming degeneracy and singularity: Techniques for semidefinite programs and homotopy continuation endgames,” Institute of Science and Technology Austria, 2026.","ista":"Zapata J. 2026. Overcoming degeneracy and singularity: Techniques for semidefinite programs and homotopy continuation endgames. Institute of Science and Technology Austria."},"degree_awarded":"PhD","project":[{"_id":"9B9290DE-BA93-11EA-9121-9846C619BF3A","name":"Vienna Graduate School on Computational Optimization","grant_number":"W1260-N35"}],"author":[{"id":"00223538-AF8F-11E9-A4C7-F729E6697425","full_name":"Zapata, Jeferson","first_name":"Jeferson","last_name":"Zapata"}],"supervisor":[{"first_name":"Vladimir","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir"}],"year":"2026","file_date_updated":"2026-06-10T13:33:25Z","oa_version":"Published Version"},{"project":[{"_id":"34afa094-11ca-11ed-8bc3-a375845a59fb","name":"Breeding for coffee and cocoa root resilience in low input farming systems based on improved rootstocks","grant_number":"101060393"}],"author":[{"orcid":"0000-0003-3413-1343","first_name":"Stefan","last_name":"Riegler","id":"FF6018E0-D806-11E9-8E43-0B14E6697425","full_name":"Riegler, Stefan"}],"supervisor":[{"first_name":"Eva","orcid":"0000-0002-8510-9739","last_name":"Benková","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","full_name":"Benková, Eva"}],"file_date_updated":"2026-03-02T10:59:50Z","oa_version":"Published Version","year":"2026","acknowledged_ssus":[{"_id":"LifeSc"},{"_id":"Bio"}],"has_accepted_license":"1","related_material":{"record":[{"status":"public","id":"21363","relation":"research_data"}]},"tmp":{"image":"/images/cc_by_sa.png","legal_code_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","name":"Creative Commons Attribution-ShareAlike 4.0 International Public License (CC BY-SA 4.0)","short":"CC BY-SA (4.0)"},"publisher":"Institute of Science and Technology Austria","status":"public","file":[{"relation":"source_file","file_name":"2026_Riegler_Stefan_Thesis.zip","creator":"sriegler","checksum":"2f1f44e8536c2538f94a440217452c9f","file_id":"21386","access_level":"closed","file_size":31430022,"content_type":"application/x-zip-compressed","date_created":"2026-03-02T10:59:50Z","date_updated":"2026-03-02T10:59:50Z"},{"date_created":"2026-03-02T10:59:49Z","content_type":"application/pdf","embargo":"2027-02-27","date_updated":"2026-03-02T10:59:49Z","embargo_to":"open_access","file_name":"2026_Riegler_Stefan_Thesis.pdf","creator":"sriegler","file_size":11635090,"access_level":"closed","checksum":"2e8dc39640bc26ae5684c944c619719b","file_id":"21387","relation":"main_file"}],"day":"26","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","department":[{"_id":"GradSch"},{"_id":"EvBe"}],"month":"02","degree_awarded":"PhD","citation":{"ieee":"S. Riegler, “Root system plasticity under nutrient limitation: Investigating hormonal and molecular drivers in Arabidopsis thaliana and Coffea  species,” Institute of Science and Technology Austria, 2026.","chicago":"Riegler, Stefan. “Root System Plasticity under Nutrient Limitation: Investigating Hormonal and Molecular Drivers in Arabidopsis Thaliana and Coffea  Species.” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-21360\">https://doi.org/10.15479/AT-ISTA-21360</a>.","ama":"Riegler S. Root system plasticity under nutrient limitation: Investigating hormonal and molecular drivers in Arabidopsis thaliana and Coffea  species. 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21360\">10.15479/AT-ISTA-21360</a>","apa":"Riegler, S. (2026). <i>Root system plasticity under nutrient limitation: Investigating hormonal and molecular drivers in Arabidopsis thaliana and Coffea  species</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-21360\">https://doi.org/10.15479/AT-ISTA-21360</a>","ista":"Riegler S. 2026. Root system plasticity under nutrient limitation: Investigating hormonal and molecular drivers in Arabidopsis thaliana and Coffea  species. Institute of Science and Technology Austria.","mla":"Riegler, Stefan. <i>Root System Plasticity under Nutrient Limitation: Investigating Hormonal and Molecular Drivers in Arabidopsis Thaliana and Coffea  Species</i>. Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21360\">10.15479/AT-ISTA-21360</a>.","short":"S. Riegler, Root System Plasticity under Nutrient Limitation: Investigating Hormonal and Molecular Drivers in Arabidopsis Thaliana and Coffea  Species, Institute of Science and Technology Austria, 2026."},"type":"dissertation","date_created":"2026-02-27T09:08:14Z","page":"185","das_tickbox":"1","_id":"21360","ddc":["570","575","583"],"article_processing_charge":"No","corr_author":"1","doi_confirm":"1","date_updated":"2026-07-27T14:30:08Z","doi":"10.15479/AT-ISTA-21360","publication_identifier":{"issn":["2663-337X"]},"license":"https://creativecommons.org/licenses/by-sa/4.0/","date_published":"2026-02-26T00:00:00Z","title":"Root system plasticity under nutrient limitation: Investigating hormonal and molecular drivers in Arabidopsis thaliana and Coffea  species","acknowledgement":"I would like to acknowledge the Austrian Academy of Sciences (ÖAW) and European\r\nResearch Executive Agency (REA) for funding my research (DOC ÖAW Fellowship\r\n26130, Horizon Europe BOLERO Project 101060393). ","language":[{"iso":"eng"}],"OA_place":"repository","publication_status":"published","alternative_title":["ISTA Thesis"]},{"type":"dissertation","date_created":"2026-07-10T13:27:20Z","page":"169","das_tickbox":"1","_id":"22258","ddc":["576","610","006"],"article_processing_charge":"No","corr_author":"1","doi_confirm":"1","date_updated":"2026-07-28T07:08:15Z","doi":"10.15479/AT-ISTA-22258","publication_identifier":{"issn":["2663-337X"]},"abstract":[{"lang":"eng","text":"Uncovering the genetic architecture of complex traits and pinpointing causal molecular drivers require the ability to distinguish true signals from noise within massive, high-dimensional omics datasets. To extract meaningful biological insights from these datasets, such as identifying causal genetic variants and proteins, scalable and accurate inference methods are essential. To this end, this thesis develops novel Bayesian inference frameworks based on Vector Approximate Message Passing and demonstrates their effectiveness in the modeling of disease onset times and quantitative physical and clinical measures.\r\n\r\nFirst, we introduce gVAMP, a Bayesian framework tailored for Genome-Wide Association Studies that enables the joint modeling of quantitative complex traits across millions of genetic variants. gVAMP demonstrates superior accuracy in variable selection and out-of-sample polygenic risk prediction compared to state-of-the-art approaches. We model human height using 17 million whole-genome sequence variants from the UK Biobank, incorporating a vast number of rare variants and revealing novel associations. gVAMP achieves a prediction accuracy of approximately 46% for human height, representing the highest reported performance for this trait to date. \r\n\r\nSecond, we present vampW, a Bayesian framework for survival analysis applied to proteomic data. By effectively handling right-censoring and complex protein dependencies within the UK Biobank Pharma Proteomics Project dataset, vampW identifies 219 protein associations across 24 disease outcomes, the majority of which are not among the top marginal discoveries. We further adjust protein levels for exponential age effects, yielding 1,308 associations and highlighting the sensitivity of the analysis to the chosen age-correction methodology. Finally, vampW improves upon the variable selection capabilities of the commonly used (penalized) variants of the Cox proportional hazards model and delivers state-of-the-art out-of-sample prediction of disease onset times.\r\n\r\nCollectively, these methods provide powerful tools for dissecting the genetic architecture of complex traits and the proteomic drivers of disease onset. Furthermore, by delivering accurate polygenic risk scores and precise predictions of onset times, this work advances the capabilities of personalized medicine and clinical risk stratification."}],"date_published":"2026-07-11T00:00:00Z","title":"From sparse selection to risk prediction: Approximate message passing for proteomic survival models and large-scale genomics","keyword":["Approximate Message Passing","GWAS","Genomics","Proteomics","Survival modeling"],"acknowledgement":"This work was supported in part by the Swiss National Science Foundation through the\r\nEccellenza Grant \"Improving estimation and prediction of common complex disease risk\"\r\n(grant number PCEGP3_181181); the European Research Council through the grant\r\n\"Inference in High Dimensions: Light-speed Algorithms and Information Limits\" (grant\r\nnumber 101161364); and the Fondation Jean-Jacques et Felicia Lopez-Loreta through the\r\nPrix Lopez-Loretta 2019.\r\n","language":[{"iso":"eng"}],"OA_place":"publisher","publication_status":"published","alternative_title":["ISTA Thesis"],"oa":1,"project":[{"name":"Prix Lopez-Loretta 2019 - Marco Mondelli","_id":"059876FA-7A3F-11EA-A408-12923DDC885E"},{"name":"Inference in High Dimensions: Light-speed Algorithms and Information Limits","grant_number":"101161364","_id":"911e6d1f-16d5-11f0-9cad-c5c68c6a1cdf"},{"_id":"9B8D11D6-BA93-11EA-9121-9846C619BF3A","grant_number":"PCEGP3_181181","name":"Improving estimation and prediction of common complex disease risk"}],"author":[{"full_name":"Depope, Al","id":"0b77531d-dbcd-11ea-9d1d-a8eee0bf3830","last_name":"Depope","first_name":"Al"}],"supervisor":[{"last_name":"Robinson","first_name":"Matthew Richard","orcid":"0000-0001-8982-8813","full_name":"Robinson, Matthew Richard","id":"E5D42276-F5DA-11E9-8E24-6303E6697425"},{"last_name":"Mondelli","first_name":"Marco","orcid":"0000-0002-3242-7020","full_name":"Mondelli, Marco","id":"27EB676C-8706-11E9-9510-7717E6697425"}],"file_date_updated":"2026-07-13T14:56:41Z","oa_version":"Published Version","year":"2026","acknowledged_ssus":[{"_id":"ScienComp"}],"has_accepted_license":"1","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"21488"}]},"file":[{"file_id":"22316","checksum":"9ab386790515628d957a194f30a7ccb4","file_size":25109878,"access_level":"open_access","file_name":"2026_Depope_Al_Thesis.pdf","creator":"adepope","date_updated":"2026-07-13T14:52:19Z","content_type":"application/pdf","date_created":"2026-07-13T14:52:19Z","relation":"main_file"},{"relation":"source_file","date_updated":"2026-07-13T14:56:41Z","content_type":"application/zip","date_created":"2026-07-13T14:56:41Z","checksum":"8ed8fb63f76a695d5b6fec35343f4b90","file_id":"22317","file_size":1203199939,"access_level":"closed","file_name":"2026_Depope_Al_Thesis.zip","creator":"adepope"}],"status":"public","publisher":"Institute of Science and Technology Austria","day":"11","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","department":[{"_id":"GradSch"},{"_id":"MaRo"},{"_id":"MaMo"}],"month":"07","degree_awarded":"PhD","citation":{"short":"A. Depope, From Sparse Selection to Risk Prediction: Approximate Message Passing for Proteomic Survival Models and Large-Scale Genomics, Institute of Science and Technology Austria, 2026.","mla":"Depope, Al. <i>From Sparse Selection to Risk Prediction: Approximate Message Passing for Proteomic Survival Models and Large-Scale Genomics</i>. Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-22258\">10.15479/AT-ISTA-22258</a>.","ista":"Depope A. 2026. From sparse selection to risk prediction: Approximate message passing for proteomic survival models and large-scale genomics. Institute of Science and Technology Austria.","apa":"Depope, A. (2026). <i>From sparse selection to risk prediction: Approximate message passing for proteomic survival models and large-scale genomics</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-22258\">https://doi.org/10.15479/AT-ISTA-22258</a>","chicago":"Depope, Al. “From Sparse Selection to Risk Prediction: Approximate Message Passing for Proteomic Survival Models and Large-Scale Genomics.” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-22258\">https://doi.org/10.15479/AT-ISTA-22258</a>.","ieee":"A. Depope, “From sparse selection to risk prediction: Approximate message passing for proteomic survival models and large-scale genomics,” Institute of Science and Technology Austria, 2026.","ama":"Depope A. From sparse selection to risk prediction: Approximate message passing for proteomic survival models and large-scale genomics. 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-22258\">10.15479/AT-ISTA-22258</a>"}},{"year":"2026","oa_version":"Published Version","file_date_updated":"2026-07-01T07:35:17Z","supervisor":[{"first_name":"Maria","orcid":"0000-0001-5013-2843","last_name":"Ibáñez","id":"43C61214-F248-11E8-B48F-1D18A9856A87","full_name":"Ibáñez, Maria"}],"author":[{"full_name":"Kleinhanns, Tobias","id":"8BD9DE16-AB3C-11E9-9C8C-2A03E6697425","last_name":"Kleinhanns","orcid":"0000-0003-1537-7436","first_name":"Tobias"}],"project":[{"name":"HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of Semiconductors for Waste Heat Recovery","_id":"9B8F7476-BA93-11EA-9121-9846C619BF3A"}],"citation":{"short":"T. Kleinhanns, Unraveling the Origin and Evolution of Defects to Enable Advanced Thermoelectric Performance, Institute of Science and Technology Austria, 2026.","mla":"Kleinhanns, Tobias. <i>Unraveling the Origin and Evolution of Defects to Enable Advanced Thermoelectric Performance</i>. Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-22017\">10.15479/AT-ISTA-22017</a>.","ista":"Kleinhanns T. 2026. Unraveling the origin and evolution of defects to enable advanced thermoelectric performance. Institute of Science and Technology Austria.","chicago":"Kleinhanns, Tobias. “Unraveling the Origin and Evolution of Defects to Enable Advanced Thermoelectric Performance.” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-22017\">https://doi.org/10.15479/AT-ISTA-22017</a>.","ama":"Kleinhanns T. Unraveling the origin and evolution of defects to enable advanced thermoelectric performance. 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-22017\">10.15479/AT-ISTA-22017</a>","ieee":"T. Kleinhanns, “Unraveling the origin and evolution of defects to enable advanced thermoelectric performance,” Institute of Science and Technology Austria, 2026.","apa":"Kleinhanns, T. (2026). <i>Unraveling the origin and evolution of defects to enable advanced thermoelectric performance</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-22017\">https://doi.org/10.15479/AT-ISTA-22017</a>"},"degree_awarded":"PhD","month":"06","department":[{"_id":"GradSch"},{"_id":"MaIb"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","day":"18","status":"public","file":[{"date_updated":"2026-06-30T09:17:15Z","date_created":"2026-06-30T09:17:15Z","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_size":15658266,"access_level":"closed","file_id":"22226","checksum":"3df7e865a7d1da8972ccd8acb8b4c16c","creator":"tkleinha","file_name":"2026_Kleinhanns_Tobias_Thesis_Source_File.docx","relation":"source_file"},{"relation":"main_file","date_updated":"2026-07-01T07:35:17Z","embargo":"2026-12-18","content_type":"application/pdf","date_created":"2026-07-01T07:35:17Z","file_id":"22232","checksum":"40ec279272a963636ff29c964032dcba","access_level":"closed","file_size":9909375,"file_name":"2026_Kleinhanns_Tobias_Thesis_Main_File_A4.pdf","creator":"tkleinha","embargo_to":"open_access"}],"publisher":"Institute of Science and Technology Austria","related_material":{"record":[{"id":"15182","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","id":"12237","status":"public"},{"relation":"part_of_dissertation","id":"20326","status":"public"}]},"has_accepted_license":"1","doi_confirm":"1","corr_author":"1","article_processing_charge":"No","das_tickbox":"1","_id":"22017","ddc":["546","530"],"page":"59","date_created":"2026-06-18T08:00:03Z","type":"dissertation","alternative_title":["ISTA Thesis"],"publication_status":"published","OA_place":"publisher","language":[{"iso":"eng"}],"title":"Unraveling the origin and evolution of defects to enable advanced thermoelectric performance","date_published":"2026-06-18T00:00:00Z","publication_identifier":{"isbn":["978-3-99078-081-7"],"issn":["2663-337X"]},"doi":"10.15479/AT-ISTA-22017","date_updated":"2026-07-28T09:55:13Z"},{"publication_status":"published","oa":1,"alternative_title":["ISTA Thesis"],"language":[{"iso":"eng"}],"OA_place":"repository","doi":"10.15479/AT-ISTA-21393","publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-074-9"]},"date_updated":"2026-07-29T12:56:52Z","date_published":"2026-03-04T00:00:00Z","title":"Pursuit of truth and beauty in Lean 4: Formally verified theory of grammars, optimization, matroids","abstract":[{"text":"This thesis documents a voyage towards truth and beauty via formal verification of theorems. To this end, we develop libraries in Lean 4 that present definitions and results from diverse areas of MathematiCS (i.e., Mathematics and Computer Science). The aim is to create code that is understandable, believable, useful, and elegant. The code should stand for itself as much as possible without a need for documentation; however, this text redundantly documents our code artifacts and provides additional context that isn’t present in the code. This thesis is written for readers who know Lean 4 but are not familiar with any of the topics presented. We manifest truth and beauty in three formalized areas of MathematiCS.\r\n\r\nWe formalize general grammars in Lean 4 and use grammars to show closure of the class of type-0 languages under four operations; union, reversal, concatenation, and the Kleene star.\r\n\r\nOur second stop is the theory of optimization. Farkas established that a system of linear inequalities has a solution if and only if we cannot obtain a contradiction by taking a linear combination of the inequalities. We state and formally prove several Farkas-like theorems over linearly ordered fields in Lean 4. Furthermore, we extend duality theory to the case when some coefficients are allowed to take “infinite values”. Additionally, we develop the basics of the theory of optimization in terms of the framework called General-Valued Constraint Satisfaction Problems, and we prove that, if a Rational-Valued Constraint Satisfaction Problem template has symmetric fractional polymorphisms of all arities, then its basic LP relaxation is tight.\r\n\r\nOur third stop is matroid theory. Seymour’s decomposition theorem is a hallmark result in matroid theory, presenting a structural characterization of the class of regular matroids. We aim to formally verify Seymour’s theorem in Lean 4. First, we build a library for working with totally unimodular matrices. We define binary matroids and their standard representations, and we prove that they form a matroid in the sense how Mathlib defines matroids. We define regular matroids to be matroids for which there exists a full representation rational matrix that is totally unimodular, and we prove that all regular matroids are binary. We define 1-sum, 2-sum, and 3 sum of binary matroids as specific ways to compose their standard representation matrices. We prove that the 1-sum, the 2-sum, and the 3-sum of regular matroids are a regular matroid, which concludes the composition direction of the Seymour’s theorem. The (more difficult) decomposition direction remains unproved.\r\n\r\nIn the pursuit of truth, we focus on identifying the trusted code in each project and presenting it faithfully. We emphasize the readability and believability of definitions rather than choosing definitions that are easier to work with. In search for beauty, we focus on the philosophical framework of Roger Scruton, who emphasizes that beauty is not a mere decoration but, most importantly, beauty is the means for shaping our place in the world and a source of redemption, where it can be viewed as a substitute for religion.","lang":"eng"}],"corr_author":"1","doi_confirm":"1","date_created":"2026-03-04T09:26:46Z","page":"160","type":"dissertation","article_processing_charge":"No","ddc":["511","000"],"_id":"21393","department":[{"_id":"GradSch"},{"_id":"VlKo"}],"month":"03","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"ista":"Dvorak M. 2026. Pursuit of truth and beauty in Lean 4: Formally verified theory of grammars, optimization, matroids. Institute of Science and Technology Austria.","ieee":"M. Dvorak, “Pursuit of truth and beauty in Lean 4: Formally verified theory of grammars, optimization, matroids,” Institute of Science and Technology Austria, 2026.","chicago":"Dvorak, Martin. “Pursuit of Truth and Beauty in Lean 4: Formally Verified Theory of Grammars, Optimization, Matroids.” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-21393\">https://doi.org/10.15479/AT-ISTA-21393</a>.","ama":"Dvorak M. Pursuit of truth and beauty in Lean 4: Formally verified theory of grammars, optimization, matroids. 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21393\">10.15479/AT-ISTA-21393</a>","apa":"Dvorak, M. (2026). <i>Pursuit of truth and beauty in Lean 4: Formally verified theory of grammars, optimization, matroids</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-21393\">https://doi.org/10.15479/AT-ISTA-21393</a>","short":"M. Dvorak, Pursuit of Truth and Beauty in Lean 4: Formally Verified Theory of Grammars, Optimization, Matroids, Institute of Science and Technology Austria, 2026.","mla":"Dvorak, Martin. <i>Pursuit of Truth and Beauty in Lean 4: Formally Verified Theory of Grammars, Optimization, Matroids</i>. Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21393\">10.15479/AT-ISTA-21393</a>."},"degree_awarded":"PhD","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"related_material":{"record":[{"status":"public","id":"13120","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"20071","status":"public"},{"relation":"part_of_dissertation","id":"21398","status":"public"}],"link":[{"url":"https://github.com/madvorak/duality/tree/v3.5.0","description":"Full version of all definitions, statements, and proofs for Chapter 3.1 (Linear duality)","relation":"software"},{"relation":"software","description":"Full version of all definitions, statements, and proofs for Chapter 3.2 (Valued Constraint Satisfaction Problems)","url":"https://github.com/madvorak/vcsp/tree/v8.2.0"},{"relation":"software","url":"https://github.com/Ivan-Sergeyev/seymour/tree/v1.2.0","description":"Full version of all definitions, statements, and proofs for Chapter 4 (Seymour project)"},{"description":"Full version of all definitions, statements, and proofs for Chapter 5 (Theory of grammars)","url":"https://github.com/madvorak/chomsky/tree/v1.2.0","relation":"software"},{"relation":"software","url":"https://github.com/madvorak/grammars","description":"Old version (Lean 3) of the project about grammars"},{"description":"Demonstration of (minimal) requirements for selected algebraic classes used in my Ph.D. thesis","url":"https://github.com/madvorak/preliminaries/blob/main/Preliminaries.lean","relation":"software"}]},"status":"public","publisher":"Institute of Science and Technology Austria","file":[{"file_name":"2026_Dvorak_Martin_Thesis.pdf","creator":"mdvorak","checksum":"cface6dc18152680962b5361575f6e4f","file_id":"21394","access_level":"open_access","file_size":1771231,"content_type":"application/pdf","date_created":"2026-03-04T08:56:15Z","date_updated":"2026-03-04T08:56:15Z","relation":"main_file","success":1},{"creator":"mdvorak","file_name":"2026_Dvorak_Martin_Thesis.docx","file_size":864585,"access_level":"closed","checksum":"290ddfacfb7e07fb07e6f0b334e67c90","file_id":"21395","date_created":"2026-03-04T09:03:37Z","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","date_updated":"2026-03-04T09:03:37Z","relation":"source_file"}],"has_accepted_license":"1","day":"04","supervisor":[{"first_name":"Vladimir","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir"},{"full_name":"Blanchette, Jasmin","first_name":"Jasmin","last_name":"Blanchette"}],"year":"2026","file_date_updated":"2026-03-04T09:03:37Z","oa_version":"Published Version","author":[{"orcid":"0000-0001-5293-214X","first_name":"Martin","last_name":"Dvorak","id":"40ED02A8-C8B4-11E9-A9C0-453BE6697425","full_name":"Dvorak, Martin"}]},{"language":[{"iso":"eng"}],"OA_place":"publisher","publication_status":"published","oa":1,"alternative_title":["ISTA Master’s Thesis"],"date_updated":"2026-07-31T10:52:08Z","doi":"10.15479/AT-ISTA-22399","publication_identifier":{"issn":["2791-4585"]},"abstract":[{"text":"Gaining an understanding of how biological regulation evolves is a fundamental research \r\nquestion in both evolutionary biology and molecular genetics. In order to gain more insight \r\ninto this topic, we focus on studying the simple gene regulatory system of the lac operon in \r\nE. coli. We show that simple population genetic models can shed light on evolution \r\nexperiments and that this combined approach of modelling the experimental system gives \r\ninsight to better understand the causes of evolutionary change in the experiment. We also \r\nstudy the natural diversity in the lac operon from 308 publicly available E. coli genomes that \r\ncome from various host species and different regions of the world. Evidence that selection is \r\ngenerally maintaining the function of the lac operon across the sample regardless of host \r\nspecies is provided and we show that different protein coding genes in the operon are under \r\ndifferent selective constraints on protein sequence preservation. A similar frameshift \r\nmutation found in experimental evolution studies is shown to be present in the sample we \r\nanalyzed, indicating that selectively relevant variants in evolution experiments are also \r\npresent in natural populations. We show that there is no simple phylogenetic relationship \r\nbetween host species, geographical location and the lac operon sequence. Finally, we argue \r\nthat a combined approach of comparative genomics, experimental evolution and theoretical \r\nmodelling contributes to a more complete understanding of molecular evolution. ","lang":"eng"}],"date_published":"2026-07-27T00:00:00Z","title":"Studying the evolutionary systems biology of the lac operon","corr_author":"1","doi_confirm":"1","type":"dissertation","date_created":"2026-07-25T13:08:32Z","page":"32","_id":"22399","das_tickbox":"0","ddc":["576"],"article_processing_charge":"No","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","department":[{"_id":"GradSch"},{"_id":"GaTk"},{"_id":"CaGu"}],"month":"07","degree_awarded":"MS","citation":{"ista":"Spasić A. 2026. Studying the evolutionary systems biology of the lac operon. Institute of Science and Technology Austria.","ama":"Spasić A. Studying the evolutionary systems biology of the lac operon. 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-22399\">10.15479/AT-ISTA-22399</a>","chicago":"Spasić, Aleksa. “Studying the Evolutionary Systems Biology of the Lac Operon.” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-22399\">https://doi.org/10.15479/AT-ISTA-22399</a>.","ieee":"A. Spasić, “Studying the evolutionary systems biology of the lac operon,” Institute of Science and Technology Austria, 2026.","apa":"Spasić, A. (2026). <i>Studying the evolutionary systems biology of the lac operon</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-22399\">https://doi.org/10.15479/AT-ISTA-22399</a>","short":"A. Spasić, Studying the Evolutionary Systems Biology of the Lac Operon, Institute of Science and Technology Austria, 2026.","mla":"Spasić, Aleksa. <i>Studying the Evolutionary Systems Biology of the Lac Operon</i>. Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-22399\">10.15479/AT-ISTA-22399</a>."},"has_accepted_license":"1","status":"public","publisher":"Institute of Science and Technology Austria","file":[{"relation":"main_file","success":1,"file_id":"22588","checksum":"c29880dd71fcc37f23ac6e2843066ede","file_size":1986078,"access_level":"open_access","creator":"aspasic","file_name":"Aleksa_Spasic_Thesis_final.pdf","date_updated":"2026-07-27T13:00:07Z","content_type":"application/pdf","date_created":"2026-07-27T13:00:07Z"},{"date_updated":"2026-07-27T13:07:23Z","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","date_created":"2026-07-27T13:00:22Z","file_id":"22589","checksum":"4ebe3bd2d833d913c0756343cca5e5f0","file_size":1868853,"access_level":"closed","creator":"aspasic","file_name":"Thesis_final.docx","relation":"source_file"}],"day":"27","supervisor":[{"last_name":"Guet","orcid":"0000-0001-6220-2052","first_name":"Calin C","full_name":"Guet, Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Tkačik","orcid":"0000-0002-6699-1455","first_name":"Gašper","full_name":"Tkačik, Gašper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87"}],"file_date_updated":"2026-07-27T13:07:23Z","oa_version":"Published Version","year":"2026","author":[{"id":"ecee9d38-4040-11ef-8843-b941efb445d6","full_name":"Spasić, Aleksa","first_name":"Aleksa","last_name":"Spasić"}]},{"related_material":{"record":[{"relation":"part_of_dissertation","id":"12675","status":"public"},{"id":"21777","relation":"part_of_dissertation","status":"public"},{"status":"public","id":"12114","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"22105"}]},"tmp":{"image":"/images/cc_by_nc_nd.png","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)"},"status":"public","publisher":"Institute of Science and Technology Austria","file":[{"content_type":"application/zip","date_created":"2026-07-16T09:17:08Z","date_updated":"2026-07-16T09:17:08Z","file_name":"2026_Becker_Lea_source_files.zip","creator":"lbecker","file_id":"22346","checksum":"8b85114eff543916c0e1445cd2189555","file_size":99472908,"access_level":"closed","relation":"source_file"},{"checksum":"6c526862bc6dbd1e4c80ecb34580bc58","file_id":"22347","access_level":"open_access","file_size":74647289,"file_name":"2026_Becker_Lea_Thesis.pdf","creator":"lbecker","date_updated":"2026-07-16T09:17:05Z","content_type":"application/pdf","date_created":"2026-07-16T09:17:05Z","relation":"main_file","success":1}],"acknowledged_ssus":[{"_id":"LifeSc"},{"_id":"NMR"}],"has_accepted_license":"1","day":"13","department":[{"_id":"GradSch"},{"_id":"PaSc"}],"month":"07","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"short":"L.M. Becker, Exploring Protein Dynamics Using Specific Labeling Approaches for Solid-State MAS NMR, Institute of Science and Technology Austria, 2026.","mla":"Becker, Lea Marie. <i>Exploring Protein Dynamics Using Specific Labeling Approaches for Solid-State MAS NMR</i>. Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-22334\">10.15479/AT-ISTA-22334</a>.","ista":"Becker LM. 2026. Exploring protein dynamics using specific labeling approaches for solid-state MAS NMR. Institute of Science and Technology Austria.","ama":"Becker LM. Exploring protein dynamics using specific labeling approaches for solid-state MAS NMR. 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-22334\">10.15479/AT-ISTA-22334</a>","ieee":"L. M. Becker, “Exploring protein dynamics using specific labeling approaches for solid-state MAS NMR,” Institute of Science and Technology Austria, 2026.","chicago":"Becker, Lea Marie. “Exploring Protein Dynamics Using Specific Labeling Approaches for Solid-State MAS NMR.” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-22334\">https://doi.org/10.15479/AT-ISTA-22334</a>.","apa":"Becker, L. M. (2026). <i>Exploring protein dynamics using specific labeling approaches for solid-state MAS NMR</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-22334\">https://doi.org/10.15479/AT-ISTA-22334</a>"},"degree_awarded":"PhD","author":[{"orcid":"0000-0002-6401-5151","first_name":"Lea Marie","last_name":"Becker","id":"36336939-eb97-11eb-a6c2-c83f1214ca79","full_name":"Becker, Lea Marie"}],"project":[{"grant_number":"26777","name":"Exploring protein dynamics by solid-state MAS NMR through specific labeling approaches","_id":"7be609c4-9f16-11ee-852c-85015ce2b9b0"}],"supervisor":[{"orcid":"0000-0002-9350-7606","first_name":"Paul","last_name":"Schanda","id":"7B541462-FAF6-11E9-A490-E8DFE5697425","full_name":"Schanda, Paul"}],"year":"2026","file_date_updated":"2026-07-16T09:17:08Z","oa_version":"Published Version","doi":"10.15479/AT-ISTA-22334","publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-084-8"]},"date_updated":"2026-08-04T09:32:45Z","date_published":"2026-07-13T00:00:00Z","title":"Exploring protein dynamics using specific labeling approaches for solid-state MAS NMR","abstract":[{"lang":"eng","text":"Characterizing protein dynamics at the atomic level is essential for our understanding of biological mechanisms. Whether it is to facilitate metabolite transport, catalyze reactions, transmit signals, or regulate metabolism – proteins are constantly in motion and sample multiple conformational states to fulfill their function. Nuclear magnetic resonance (NMR) spectroscopy is particularly well suited to elucidate the dynamics of biomolecules on their complex free-energy landscape. In particular, solid-state magic-angle spinning (MAS) NMR enables the study of large molecular assemblies, protein crystals, or insoluble proteins at atomic resolution without an inherent molecular size limitation. MAS NMR experiments to probe protein dynamics are extremely versatile and sensitive to motional timescales from picoseconds to seconds. Over the past decades, technological advances, developments in experimental design, and new isotope-labeling approaches have further expanded the possibilities of this technique and significantly improved the accuracy of the determined motional parameters.\r\nFunctionally important sites of proteins often contain aromatic residues. Their side-chain motions have therefore long served as valuable indicators of mechanistically relevant dynamics in NMR studies. In this thesis, site-specifically labeled aromatic residues act as sensitive reporters for MAS NMR studies of protein dynamics. The first part addresses how different environments impact side-chain motion by probing ring flips of phenylalanines and tyrosines in crystalline proteins and amyloid fibrils. It provides important insights for the analysis of dynamics obtained in non-native protein environments and emphasizes the complex factors that determine the timescale of internal dynamics. In the second part, the focus shifts towards methodological questions regarding the investigation of protein dynamics by 19F MAS NMR. The fluorine nucleus exhibits promising characteristics for NMR studies but also presents significant challenges, which is why the full methodological potential of 19F MAS NMR has not been fully realized yet. This work demonstrates that paramagnetic doping can considerably reduce the measurement time and improve the sensitivity of fluorinated samples. Finally, 19F MAS NMR is evaluated as a tool for studying protein side-chain dynamics on the example of tryptophans. The results illustrate the challenges in analyzing such experiments and lay the foundation for further development of 19F MAS NMR relaxation studies.\r\nTaken together, this thesis highlights the potential of combining specific isotope labeling, MAS NMR, and complementary methods such as crystallography and computational simulations to elucidate internal protein dynamics. The further development of such integrative approaches will be crucial to improving our understanding of complex mechanisms and protein function.\r\n"}],"acknowledgement":"During the work on this thesis, I was the recipient of a DOC Fellowship of the Austrian\r\nAcademy of Sciences at the Institute of Science and Technology Austria (grant no. PR10660EAW01).","publication_status":"published","oa":1,"alternative_title":["ISTA Thesis"],"language":[{"iso":"eng"}],"OA_place":"publisher","date_created":"2026-07-14T08:08:51Z","page":"205","type":"dissertation","article_processing_charge":"No","ddc":["572"],"_id":"22334","das_tickbox":"1","corr_author":"1","doi_confirm":"1"},{"has_accepted_license":"1","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"related_material":{"record":[{"id":"12237","relation":"part_of_dissertation","status":"public"},{"id":"17124","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"17052"}]},"publisher":"Institute of Science and Technology Austria","status":"public","file":[{"relation":"source_file","file_name":"2026_Fiedler_Christine_Thesis.docx","creator":"cfiedler","file_id":"22659","checksum":"4f357f3c0f5ee3d679dd0395dbafc4bb","access_level":"closed","file_size":625541367,"content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","date_created":"2026-08-07T09:10:56Z","date_updated":"2026-08-07T10:02:41Z"},{"relation":"main_file","date_created":"2026-08-07T09:10:45Z","content_type":"application/pdf","embargo":"2027-02-07","date_updated":"2026-08-07T10:16:07Z","creator":"cfiedler","file_name":"2026_Fiedler_Christine_Thesis.pdf","embargo_to":"open_access","file_size":16646551,"access_level":"closed","file_id":"22660","checksum":"69784d2e7b9ef3d3a0fbe134f3bba089"}],"day":"05","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","department":[{"_id":"GradSch"},{"_id":"MaIb"}],"month":"08","degree_awarded":"PhD","citation":{"ista":"Fiedler C. 2026. Mechanistic insight into solution-processed p-type tin chalcogenides as a basis for designing their n-type analogs. Institute of Science and Technology Austria.","ama":"Fiedler C. Mechanistic insight into solution-processed p-type tin chalcogenides as a basis for designing their n-type analogs. 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-22626\">10.15479/AT-ISTA-22626</a>","ieee":"C. Fiedler, “Mechanistic insight into solution-processed p-type tin chalcogenides as a basis for designing their n-type analogs,” Institute of Science and Technology Austria, 2026.","chicago":"Fiedler, Christine. “Mechanistic Insight into Solution-Processed p-Type Tin Chalcogenides as a Basis for Designing Their n-Type Analogs.” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-22626\">https://doi.org/10.15479/AT-ISTA-22626</a>.","apa":"Fiedler, C. (2026). <i>Mechanistic insight into solution-processed p-type tin chalcogenides as a basis for designing their n-type analogs</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-22626\">https://doi.org/10.15479/AT-ISTA-22626</a>","short":"C. Fiedler, Mechanistic Insight into Solution-Processed p-Type Tin Chalcogenides as a Basis for Designing Their n-Type Analogs, Institute of Science and Technology Austria, 2026.","mla":"Fiedler, Christine. <i>Mechanistic Insight into Solution-Processed p-Type Tin Chalcogenides as a Basis for Designing Their n-Type Analogs</i>. Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-22626\">10.15479/AT-ISTA-22626</a>."},"project":[{"_id":"9B8F7476-BA93-11EA-9121-9846C619BF3A","name":"HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of Semiconductors for Waste Heat Recovery"}],"author":[{"id":"bd3fceba-dc74-11ea-a0a7-c17f71817366","full_name":"Fiedler, Christine","first_name":"Christine","last_name":"Fiedler"}],"supervisor":[{"first_name":"Maria","orcid":"0000-0001-5013-2843","last_name":"Ibáñez","id":"43C61214-F248-11E8-B48F-1D18A9856A87","full_name":"Ibáñez, Maria"}],"file_date_updated":"2026-08-07T10:16:07Z","oa_version":"Published Version","year":"2026","date_updated":"2026-08-11T12:39:15Z","doi":"10.15479/AT-ISTA-22626","publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-086-2"]},"date_published":"2026-08-05T00:00:00Z","title":"Mechanistic insight into solution-processed p-type tin chalcogenides as a basis for designing their n-type analogs","acknowledgement":"This thesis and the publications within, were financially supported by the Institute of Science and Technology Austria and the Werner Siemens Foundation under the project “High Thermoelectric Materials: The Werner Siemens Laboratory for the High Throughput Discovery of Semiconductors for Waste Heat Recovery”.","language":[{"iso":"eng"}],"OA_place":"publisher","publication_status":"published","alternative_title":["ISTA Thesis"],"type":"dissertation","date_created":"2026-08-03T07:55:16Z","page":"141","ddc":["540","546","530"],"_id":"22626","article_processing_charge":"No","corr_author":"1","doi_confirm":"1"}]