--- OA_place: publisher _id: '20991' 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." 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)" alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Diego Fernando full_name: Garcia Castillo, Diego Fernando id: ae681a14-dc74-11ea-a0a7-c6ef18161701 last_name: Garcia Castillo citation: ama: Garcia Castillo DF. The genomic architecture of local adaptation in introduced populations. 2026. doi:10.15479/AT-ISTA-20991 apa: Garcia Castillo, D. F. (2026). The genomic architecture of local adaptation in introduced populations. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-20991 chicago: Garcia Castillo, Diego Fernando. “The Genomic Architecture of Local Adaptation in Introduced Populations.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-20991. ieee: D. F. Garcia Castillo, “The genomic architecture of local adaptation in introduced populations,” Institute of Science and Technology Austria, 2026. ista: Garcia Castillo DF. 2026. The genomic architecture of local adaptation in introduced populations. Institute of Science and Technology Austria. mla: Garcia Castillo, Diego Fernando. The Genomic Architecture of Local Adaptation in Introduced Populations. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-20991. short: D.F. Garcia Castillo, The Genomic Architecture of Local Adaptation in Introduced Populations, Institute of Science and Technology Austria, 2026. corr_author: '1' date_created: 2026-01-16T09:47:59Z date_published: 2026-01-16T00:00:00Z date_updated: 2026-04-16T12:20:37Z day: '16' ddc: - '576' degree_awarded: PhD department: - _id: GradSch - _id: NiBa doi: 10.15479/AT-ISTA-20991 file: - access_level: closed checksum: 841f1bc073d667125729b2a017f8c37a content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document creator: dgarciac date_created: 2026-01-16T12:25:13Z date_updated: 2026-01-16T12:25:13Z file_id: '20996' file_name: 2026_Garcia_Diego_Thesis.docx file_size: 22456421 relation: source_file - access_level: open_access checksum: a1f33d4f183ce7072eee42a6ccf5340b content_type: application/pdf creator: dgarciac date_created: 2026-01-16T12:25:13Z date_updated: 2026-01-16T12:25:13Z file_id: '20997' file_name: 2026_Garcia_Diego_Thesis.pdf file_size: 9556719 relation: main_file success: 1 - access_level: closed checksum: 98a80691067174c30fe53f38ce7344e6 content_type: application/x-compressed creator: dgarciac date_created: 2026-01-16T13:08:14Z date_updated: 2026-01-16T13:08:14Z 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' file_name: 2026_DiegoGarcia_LittorinaDB Source Code and Protocols.rar file_size: 54491433 relation: supplementary_material - access_level: open_access checksum: 99a3cab2fa36666b9a92eefc27d586da content_type: application/x-compressed creator: dgarciac date_created: 2026-01-16T13:08:14Z date_updated: 2026-01-16T13:08:14Z file_id: '20999' file_name: 2026_DiegoGarcia_Thesis-Supplementary_Material.rar file_size: 7982811 relation: supplementary_material - access_level: open_access checksum: 255fdf56b2932c46bf27c63aa6106a4f content_type: text/plain creator: dgarciac date_created: 2026-01-16T13:08:59Z date_updated: 2026-01-16T13:08:59Z file_id: '21000' file_name: README.txt file_size: 732 relation: supplementary_material file_date_updated: 2026-01-16T13:08:59Z has_accepted_license: '1' language: - iso: eng license: https://creativecommons.org/licenses/by-nc-sa/4.0/ month: '01' oa: 1 oa_version: Published Version page: '199' publication_identifier: isbn: - 978-3-99078-077-0 issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '18498' relation: research_data status: public - id: '18491' relation: part_of_dissertation status: public status: public supervisor: - first_name: Nicholas H full_name: Barton, Nicholas H id: 4880FE40-F248-11E8-B48F-1D18A9856A87 last_name: Barton orcid: 0000-0002-8548-5240 - first_name: Anja M full_name: Westram, Anja M id: 3C147470-F248-11E8-B48F-1D18A9856A87 last_name: Westram orcid: 0000-0003-1050-4969 title: The genomic architecture of local adaptation in introduced populations tmp: image: /images/cc_by_nc_sa.png legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) short: CC BY-NC-SA (4.0) type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2026' ... --- OA_place: publisher _id: '21651' 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." alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Mirza Ahad full_name: Baig, Mirza Ahad id: 3EDE6DE4-AA5A-11E9-986D-341CE6697425 last_name: Baig citation: ama: Baig MA. On secure chain selection rules from physical resources in a permissionless setting. 2026. doi:10.15479/AT-ISTA-21651 apa: Baig, M. A. (2026). On secure chain selection rules from physical resources in a permissionless setting. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-21651 chicago: Baig, Mirza Ahad. “On Secure Chain Selection Rules from Physical Resources in a Permissionless Setting.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-21651. ieee: M. A. Baig, “On secure chain selection rules from physical resources in a permissionless setting,” Institute of Science and Technology Austria, 2026. ista: Baig MA. 2026. On secure chain selection rules from physical resources in a permissionless setting. Institute of Science and Technology Austria. mla: Baig, Mirza Ahad. On Secure Chain Selection Rules from Physical Resources in a Permissionless Setting. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-21651. short: M.A. Baig, On Secure Chain Selection Rules from Physical Resources in a Permissionless Setting, Institute of Science and Technology Austria, 2026. corr_author: '1' date_created: 2026-04-02T09:31:34Z date_published: 2026-03-04T00:00:00Z date_updated: 2026-04-15T08:45:19Z day: '04' ddc: - '000' degree_awarded: PhD department: - _id: GradSch - _id: KrPi doi: 10.15479/AT-ISTA-21651 file: - access_level: closed checksum: c3986dba90653dac97adba662ebff238 content_type: application/x-zip-compressed creator: mbaig date_created: 2026-04-03T17:28:48Z date_updated: 2026-04-13T08:24:13Z file_id: '21655' file_name: PhD-Thesis-Mirza-Ahad-Baig - Library Submission.zip file_size: 139353434 relation: source_file - access_level: open_access checksum: 292a5989262521f7c145a109d1f348cb content_type: application/pdf creator: mbaig date_created: 2026-04-03T17:29:30Z date_updated: 2026-04-15T07:37:25Z file_id: '21656' file_name: 2026_Baig_Mirza_Ahad_Thesis.pdf file_size: 1942037 relation: main_file file_date_updated: 2026-04-15T07:37:25Z has_accepted_license: '1' language: - iso: eng month: '03' oa: 1 oa_version: Published Version publication_identifier: isbn: - 978-3-99078-078-7 issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '21134' relation: part_of_dissertation status: public - id: '20587' relation: part_of_dissertation status: public status: public supervisor: - first_name: Krzysztof Z full_name: Pietrzak, Krzysztof Z id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87 last_name: Pietrzak orcid: 0000-0002-9139-1654 title: On secure chain selection rules from physical resources in a permissionless setting tmp: image: /images/cc_by_nc_sa.png legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) short: CC BY-NC-SA (4.0) type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2026' ... --- OA_place: publisher _id: '21863' abstract: - lang: eng 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." acknowledged_ssus: - _id: M-Shop - _id: NanoFab - _id: LifeSc - _id: SSU 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" alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Thomas full_name: Werner, Thomas id: 1fcd8497-dba3-11ea-a45e-c6fbd715f7c7 last_name: Werner orcid: 0009-0001-2346-5236 citation: ama: Werner T. Interfacing superconducting qubits with optical photons. 2026. doi:10.15479/AT-ISTA-21863 apa: Werner, T. (2026). Interfacing superconducting qubits with optical photons. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-21863 chicago: Werner, Thomas. “Interfacing Superconducting Qubits with Optical Photons.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-21863. ieee: T. Werner, “Interfacing superconducting qubits with optical photons,” Institute of Science and Technology Austria, 2026. ista: Werner T. 2026. Interfacing superconducting qubits with optical photons. Institute of Science and Technology Austria. mla: Werner, Thomas. Interfacing Superconducting Qubits with Optical Photons. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-21863. short: T. Werner, Interfacing Superconducting Qubits with Optical Photons, Institute of Science and Technology Austria, 2026. corr_author: '1' date_created: 2026-05-12T09:04:02Z date_published: 2026-05-12T00:00:00Z date_updated: 2026-05-20T13:35:43Z day: '12' ddc: - '530' - '537' - '539' degree_awarded: PhD department: - _id: GradSch - _id: JoFi doi: 10.15479/AT-ISTA-21863 ec_funded: 1 file: - access_level: open_access checksum: a5b4d8dba83f96e955a3625c0eebee98 content_type: application/pdf creator: twerner date_created: 2026-05-15T15:53:57Z date_updated: 2026-05-15T15:53:57Z file_id: '21879' file_name: 2026_Werner_Thomas_Thesis.pdf file_size: 9330516 relation: main_file - access_level: closed checksum: b41282beaacfb32472769b9e3b1758d8 content_type: application/x-zip-compressed creator: twerner date_created: 2026-05-15T15:54:06Z date_updated: 2026-05-15T15:54:06Z file_id: '21880' file_name: 2026_Werner_Thomas_Thesis.zip file_size: 9370704 relation: source_file file_date_updated: 2026-05-15T15:54:06Z has_accepted_license: '1' keyword: - Superconducting qubits - Quantum optics - Single photons and quantum effects - Nonlinear optics language: - iso: eng license: https://creativecommons.org/licenses/by/4.0/ month: '05' oa: 1 oa_version: Published Version page: '97' project: - _id: bdadfa0d-d553-11ed-ba76-fb85edbd456a grant_number: '101089099' name: 'Cavity Quantum Electro Optics: Microwave photonics with nonclassical states' - _id: 9B868D20-BA93-11EA-9121-9846C619BF3A call_identifier: H2020 grant_number: '899354' name: Quantum Local Area Networks with Superconducting Qubits - _id: 26336814-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '758053' name: A Fiber Optic Transceiver for Superconducting Qubits - _id: 5b807754-ab3d-11f0-914f-ff8c34502cc9 grant_number: '101248662' name: Integrated optical coupling for low loss electro-optic interconnects - _id: 91aaf765-16d5-11f0-9cad-a8e7e44cccb7 grant_number: '101187231' name: 'Cavity-Integrated Electro-Optics: Measuring, Converting and Manipulating Microwaves with Light' - _id: bdb108fd-d553-11ed-ba76-83dc74a9864f grant_number: F07105 name: QUANTUM INFORMATION SYSTEMS BEYOND CLASSICAL CAPABILITIES / P5- Integration of Superconducting Quantum Circuits - _id: bdb7cfc1-d553-11ed-ba76-d2eaab167738 grant_number: '101080139' name: Open Superconducting Quantum Computers (OpenSuperQPlus) - _id: 9B861AAC-BA93-11EA-9121-9846C619BF3A name: NOMIS Fellowship Program publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '19073' relation: part_of_dissertation status: public - id: '21870' relation: part_of_dissertation status: public status: public supervisor: - first_name: Johannes M full_name: Fink, Johannes M id: 4B591CBA-F248-11E8-B48F-1D18A9856A87 last_name: Fink orcid: 0000-0001-8112-028X title: Interfacing superconducting qubits with optical photons tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2026' ... --- OA_place: publisher _id: '21918' acknowledged_ssus: - _id: ScienComp 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." alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Kseniia full_name: Khudiakova, Kseniia id: 4E6DC800-AE37-11E9-AC72-31CAE5697425 last_name: Khudiakova orcid: 0000-0002-6246-1465 citation: ama: Khudiakova K. How epistasis and purifying selection shape genetic diversity. 2026. doi:10.15479/AT-ISTA-21918 apa: Khudiakova, K. (2026). How epistasis and purifying selection shape genetic diversity. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-21918 chicago: Khudiakova, Kseniia. “How Epistasis and Purifying Selection Shape Genetic Diversity.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-21918. ieee: K. Khudiakova, “How epistasis and purifying selection shape genetic diversity,” Institute of Science and Technology Austria, 2026. ista: Khudiakova K. 2026. How epistasis and purifying selection shape genetic diversity. Institute of Science and Technology Austria. mla: Khudiakova, Kseniia. How Epistasis and Purifying Selection Shape Genetic Diversity. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-21918. short: K. Khudiakova, How Epistasis and Purifying Selection Shape Genetic Diversity, Institute of Science and Technology Austria, 2026. corr_author: '1' date_created: 2026-05-27T06:26:08Z date_published: 2026-06-07T00:00:00Z date_updated: 2026-06-12T12:43:35Z day: '07' ddc: - '576' degree_awarded: PhD department: - _id: GradSch - _id: NiBa - _id: JaMa doi: 10.15479/AT-ISTA-21918 ec_funded: 1 file: - access_level: closed checksum: 0cff64ae74f0f9f2d7011700c82f700a content_type: application/x-zip-compressed creator: kkhudiak date_created: 2026-06-09T08:34:38Z date_updated: 2026-06-09T08:40:48Z file_id: '21965' file_name: thesis.zip file_size: 20549813 relation: source_file - access_level: closed checksum: 547ae42de37cc86894af283f1664dbc8 content_type: application/pdf creator: kkhudiak date_created: 2026-06-09T12:28:51Z date_updated: 2026-06-11T12:14:53Z embargo: 2027-06-10 embargo_to: open_access file_id: '21969' file_name: 2026_Khudiakova_Ksenia_Thesis.pdf file_size: 9387029 relation: main_file file_date_updated: 2026-06-11T12:14:53Z has_accepted_license: '1' language: - iso: eng license: https://creativecommons.org/licenses/by-nc-nd/4.0/ month: '06' oa_version: Published Version page: '89' project: - _id: 256E75B8-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '716117' name: Optimal Transport and Stochastic Dynamics - _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 publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '11447' relation: part_of_dissertation status: public - id: '12513' relation: part_of_dissertation status: deleted - id: '21967' relation: part_of_dissertation status: public - id: '21968' relation: part_of_dissertation status: public status: public supervisor: - first_name: Nicholas H full_name: Barton, Nicholas H id: 4880FE40-F248-11E8-B48F-1D18A9856A87 last_name: Barton orcid: 0000-0002-8548-5240 - first_name: Jan full_name: Maas, Jan id: 4C5696CE-F248-11E8-B48F-1D18A9856A87 last_name: Maas orcid: 0000-0002-0845-1338 title: How epistasis and purifying selection shape genetic diversity 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) type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2026' ... --- OA_place: repository _id: '21423' acknowledged_ssus: - _id: ScienComp acknowledgement: "Finally, I gratefully acknowledge funding from the DOC Fellowship of the Austrian Academy\r\nof Sciences (OeAW): grant agreement 26360." alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Zuzana full_name: Dunajova, Zuzana id: 4B39F286-F248-11E8-B48F-1D18A9856A87 last_name: Dunajova citation: ama: Dunajova Z. Geometry-driven self-organization of migrating cells and chiral filaments. 2026. doi:10.15479/AT-ISTA-21423 apa: Dunajova, Z. (2026). Geometry-driven self-organization of migrating cells and chiral filaments. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-21423 chicago: Dunajova, Zuzana. “Geometry-Driven Self-Organization of Migrating Cells and Chiral Filaments.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-21423. ieee: Z. Dunajova, “Geometry-driven self-organization of migrating cells and chiral filaments,” Institute of Science and Technology Austria, 2026. ista: Dunajova Z. 2026. Geometry-driven self-organization of migrating cells and chiral filaments. Institute of Science and Technology Austria. mla: Dunajova, Zuzana. Geometry-Driven Self-Organization of Migrating Cells and Chiral Filaments. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-21423. short: Z. Dunajova, Geometry-Driven Self-Organization of Migrating Cells and Chiral Filaments, Institute of Science and Technology Austria, 2026. corr_author: '1' date_created: 2026-03-11T08:30:49Z date_published: 2026-03-11T00:00:00Z date_updated: 2026-07-06T12:38:16Z day: '11' ddc: - '539' - '570' degree_awarded: PhD department: - _id: GradSch - _id: EdHa doi: 10.15479/AT-ISTA-21423 file: - access_level: closed checksum: 47ce6a48a0c63f28eca6e64c9ffd2c84 content_type: application/pdf creator: zdunajov date_created: 2026-03-12T20:38:52Z date_updated: 2026-03-12T20:38:52Z embargo: 2026-09-11 embargo_to: open_access file_id: '21446' file_name: 2026_Dunajova_Zuzana_Thesis_pdfA.pdf file_size: 14662770 relation: main_file - access_level: closed checksum: 5dec5afdffd47c2b0b162d0fe1bed925 content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document creator: zdunajov date_created: 2026-03-12T20:40:18Z date_updated: 2026-03-13T11:19:21Z file_id: '21447' file_name: Thesis-Dunajova_source_file.docx file_size: 32961408 relation: source_file file_date_updated: 2026-03-13T11:19:21Z has_accepted_license: '1' language: - iso: eng month: '03' oa_version: Published Version page: '110' project: - _id: 34d75525-11ca-11ed-8bc3-89b6307fee9d grant_number: '26360' name: Motile active matter models of migrating cells and chiral filaments publication_identifier: isbn: - 978-3-99078-076-3 issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '13314' relation: part_of_dissertation status: public - id: '13116' relation: research_data status: public - id: '21439' relation: research_data status: public - id: '21427' relation: part_of_dissertation status: public status: public supervisor: - first_name: Edouard B full_name: Hannezo, Edouard B id: 3A9DB764-F248-11E8-B48F-1D18A9856A87 last_name: Hannezo orcid: 0000-0001-6005-1561 title: Geometry-driven self-organization of migrating cells and chiral filaments tmp: image: /images/cc_by_nc_sa.png legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) short: CC BY-NC-SA (4.0) type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2026' ... --- OA_place: publisher _id: '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" acknowledged_ssus: - _id: E-Lib - _id: CampIT acknowledgement: "The financial support of the ERC grant SPERIG #885707 is gratefully acknowledged.\r\n" alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Yunzhe full_name: Li, Yunzhe id: 41cb05d3-f128-11eb-9611-e4e2b3cfba31 last_name: Li citation: ama: Li Y. Spectral rigidity and nonrigidity of dynamical systems. 2026. doi:10.15479/AT-ISTA-22255 apa: Li, Y. (2026). Spectral rigidity and nonrigidity of dynamical systems. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-22255 chicago: Li, Yunzhe. “Spectral Rigidity and Nonrigidity of Dynamical Systems.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-22255. ieee: Y. Li, “Spectral rigidity and nonrigidity of dynamical systems,” Institute of Science and Technology Austria, 2026. ista: Li Y. 2026. Spectral rigidity and nonrigidity of dynamical systems. Institute of Science and Technology Austria. mla: Li, Yunzhe. Spectral Rigidity and Nonrigidity of Dynamical Systems. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-22255. short: Y. Li, Spectral Rigidity and Nonrigidity of Dynamical Systems, Institute of Science and Technology Austria, 2026. corr_author: '1' date_created: 2026-07-08T12:44:31Z date_published: 2026-07-11T00:00:00Z date_updated: 2026-07-20T14:58:23Z day: '11' ddc: - '515' degree_awarded: PhD department: - _id: GradSch - _id: VaKa doi: 10.15479/AT-ISTA-22255 doi_confirm: '1' ec_funded: 1 file: - access_level: open_access checksum: 8201cb5a427656a41828ecde8a85c04b content_type: application/pdf creator: yli date_created: 2026-07-14T10:48:45Z date_updated: 2026-07-14T10:48:45Z file_id: '22337' file_name: 2026_Li_Yunzhe_Thesis.pdf file_size: 1260717 relation: main_file - access_level: closed checksum: 19ee8461ed77f5b7980fc9461f778b6f content_type: application/x-zip-compressed creator: yli date_created: 2026-07-14T11:07:18Z date_updated: 2026-07-20T14:00:33Z file_id: '22339' file_name: 2026_Li_Yunzhe_Thesis.zip file_size: 418752 relation: source_file file_date_updated: 2026-07-20T14:00:33Z has_accepted_license: '1' language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: '131' project: - _id: 9B8B92DE-BA93-11EA-9121-9846C619BF3A call_identifier: H2020 grant_number: '885707' name: Spectral rigidity and integrability for billiards and geodesic flows publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '22340' relation: part_of_dissertation status: public - id: '22341' relation: part_of_dissertation status: public status: public supervisor: - first_name: Vadim full_name: Kaloshin, Vadim id: FE553552-CDE8-11E9-B324-C0EBE5697425 last_name: Kaloshin orcid: 0000-0002-6051-2628 title: Spectral rigidity and nonrigidity of dynamical systems tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2026' ... --- OA_place: publisher _id: '21198' 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." acknowledged_ssus: - _id: ScienComp 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)." alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Jonathan A full_name: Scott, Jonathan A id: e499926b-f6e0-11ea-865d-9c63db0031e8 last_name: Scott citation: ama: Scott JA. Data heterogeneity and personalization in federated learning. 2026. doi:10.15479/AT-ISTA-21198 apa: Scott, J. A. (2026). Data heterogeneity and personalization in federated learning. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-21198 chicago: Scott, Jonathan A. “Data Heterogeneity and Personalization in Federated Learning.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-21198. 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. mla: Scott, Jonathan A. Data Heterogeneity and Personalization in Federated Learning. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-21198. short: J.A. Scott, Data Heterogeneity and Personalization in Federated Learning, Institute of Science and Technology Austria, 2026. corr_author: '1' date_created: 2026-02-09T14:59:53Z date_published: 2026-02-09T00:00:00Z date_updated: 2026-07-22T06:34:27Z day: '09' ddc: - '005' degree_awarded: PhD department: - _id: GradSch - _id: ChLa doi: 10.15479/AT-ISTA-21198 file: - access_level: closed checksum: 121c1d968bd86f3630aa7e81d5bbbcb0 content_type: application/zip creator: jscott date_created: 2026-02-17T11:46:22Z date_updated: 2026-02-17T11:46:22Z file_id: '21298' file_name: 2026_Scott_Jonathan_Thesis_Source.zip file_size: 272379252 relation: source_file - access_level: open_access checksum: 6e3e08ba474bbee8511cc8a839ab2077 content_type: application/pdf creator: jscott date_created: 2026-02-27T10:25:41Z date_updated: 2026-02-27T10:25:41Z file_id: '21366' file_name: 2026_Jonathan_Scott_Thesis.pdf file_size: 15220298 relation: main_file success: 1 file_date_updated: 2026-02-27T10:25:41Z has_accepted_license: '1' language: - iso: eng month: '02' oa: 1 oa_version: Published Version page: '158' publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '20819' relation: part_of_dissertation status: public - id: '17411' relation: part_of_dissertation status: public - id: '18120' relation: part_of_dissertation status: public - id: '21207' relation: part_of_dissertation status: public status: public supervisor: - first_name: Christoph full_name: Lampert, Christoph id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 title: Data heterogeneity and personalization in federated learning type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2026' ... --- OA_place: publisher _id: '21021' 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. acknowledged_ssus: - _id: M-Shop - _id: ScienComp 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" alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Christopher D full_name: Fillmore, Christopher D id: 35638A5C-AAC7-11E9-B0BF-5503E6697425 last_name: Fillmore citation: ama: Fillmore CD. Braiding geometry and topology to study shapes and data. 2026. doi:10.15479/AT-ISTA-21021 apa: Fillmore, C. D. (2026). Braiding geometry and topology to study shapes and data. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-21021 chicago: Fillmore, Christopher D. “Braiding Geometry and Topology to Study Shapes and Data.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-21021. ieee: C. D. Fillmore, “Braiding geometry and topology to study shapes and data,” Institute of Science and Technology Austria, 2026. ista: Fillmore CD. 2026. Braiding geometry and topology to study shapes and data. Institute of Science and Technology Austria. mla: Fillmore, Christopher D. Braiding Geometry and Topology to Study Shapes and Data. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-21021. short: C.D. Fillmore, Braiding Geometry and Topology to Study Shapes and Data, Institute of Science and Technology Austria, 2026. corr_author: '1' date_created: 2026-01-20T21:38:40Z date_published: 2026-01-21T00:00:00Z date_updated: 2026-07-22T06:33:54Z day: '21' ddc: - '514' - '516' degree_awarded: PhD department: - _id: GradSch - _id: HeEd - _id: UlWa doi: 10.15479/AT-ISTA-21021 file: - access_level: open_access checksum: 4c0889130095c31d4e5088c5b8dfd607 content_type: application/pdf creator: cfillmor date_created: 2026-01-26T19:44:46Z date_updated: 2026-01-30T11:40:09Z file_id: '21046' file_name: 2025_Fillmore_Christopher_Thesis.pdf file_size: 55954297 relation: main_file - access_level: closed checksum: d69afb71d82ab98f856886126ee7303a content_type: application/x-zip-compressed creator: cfillmor date_created: 2026-01-26T19:46:20Z date_updated: 2026-01-26T19:46:20Z file_id: '21047' file_name: Thesis.zip file_size: 166080788 relation: source_file file_date_updated: 2026-01-30T11:40:09Z has_accepted_license: '1' language: - iso: eng month: '01' oa: 1 oa_version: Published Version page: '122' publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '20260' relation: part_of_dissertation status: public - id: '21051' relation: part_of_dissertation status: public - id: '21050' relation: part_of_dissertation status: public status: public supervisor: - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 - first_name: Uli full_name: Wagner, Uli id: 36690CA2-F248-11E8-B48F-1D18A9856A87 last_name: Wagner orcid: 0000-0002-1494-0568 title: Braiding geometry and topology to study shapes and data tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2026' ... --- OA_place: publisher _id: '22281' 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." 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" alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Antoine full_name: El-Hayek, Antoine id: 888a098e-fcac-11ee-aff7-d347be57b725 last_name: El-Hayek orcid: 0000-0003-4268-7368 citation: ama: 'El-Hayek A. Handling updates and failures: Dynamic graph algorithms and distributed computing on dynamic networks. 2026. doi:10.15479/AT-ISTA-22281' apa: 'El-Hayek, A. (2026). Handling updates and failures: Dynamic graph algorithms and distributed computing on dynamic networks. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-22281' chicago: 'El-Hayek, Antoine. “Handling Updates and Failures: Dynamic Graph Algorithms and Distributed Computing on Dynamic Networks.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-22281.' ieee: 'A. El-Hayek, “Handling updates and failures: Dynamic graph algorithms and distributed computing on dynamic networks,” Institute of Science and Technology Austria, 2026.' ista: 'El-Hayek A. 2026. Handling updates and failures: Dynamic graph algorithms and distributed computing on dynamic networks. Institute of Science and Technology Austria.' mla: 'El-Hayek, Antoine. Handling Updates and Failures: Dynamic Graph Algorithms and Distributed Computing on Dynamic Networks. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-22281.' short: 'A. El-Hayek, Handling Updates and Failures: Dynamic Graph Algorithms and Distributed Computing on Dynamic Networks, Institute of Science and Technology Austria, 2026.' corr_author: '1' date_created: 2026-07-13T09:39:59Z date_published: 2026-07-13T00:00:00Z date_updated: 2026-07-24T12:48:29Z day: '13' ddc: - '000' degree_awarded: PhD department: - _id: GradSch - _id: MoHe doi: 10.15479/AT-ISTA-22281 doi_confirm: '1' ec_funded: 1 file: - access_level: open_access checksum: 923e4ca769c9ef2f6b0b005444faf462 content_type: application/pdf creator: aelhayek date_created: 2026-07-17T11:39:47Z date_updated: 2026-07-17T11:39:47Z file_id: '22356' file_name: 2026_El-Hayek_Antoine_Thesis.pdf file_size: 5465973 relation: main_file success: 1 - access_level: closed checksum: 262689f9df27dd6c2c7c7861f1de7329 content_type: application/x-zip-compressed creator: aelhayek date_created: 2026-07-17T11:40:34Z date_updated: 2026-07-20T11:29:38Z file_id: '22357' file_name: 2026_El-Hayek_Antoine_Thesis.zip file_size: 9116107 relation: source_file file_date_updated: 2026-07-20T11:29:38Z has_accepted_license: '1' language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: '244' project: - _id: bd9ca328-d553-11ed-ba76-dc4f890cfe62 call_identifier: H2020 grant_number: '101019564' name: The design and evaluation of modern fully dynamic data structures - _id: bda196b2-d553-11ed-ba76-8e8ee6c21103 grant_number: I05982 name: Static and Dynamic Hierarchical Graph Decompositions - _id: bd9e3a2e-d553-11ed-ba76-8aa684ce17fe grant_number: P33775 name: Fast Algorithms for a Reactive Network Layer publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria publisher_comment: Sections 2.4 and 7.1 and chapter 6 are not CC-BY 4.0, they are All Rights Reserved. related_material: record: - id: '20051' relation: part_of_dissertation status: public - id: '18557' relation: part_of_dissertation status: public - id: '19982' relation: part_of_dissertation status: public - id: '21720' relation: part_of_dissertation status: public - id: '22374' relation: part_of_dissertation status: public - id: '22373' relation: part_of_dissertation status: public status: public supervisor: - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 title: 'Handling updates and failures: Dynamic graph algorithms and distributed computing on dynamic networks' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2026' ... --- OA_place: publisher _id: '21854' abstract: - lang: eng 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" acknowledged_ssus: - _id: ScienComp 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" alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Eugenia B full_name: Iofinova, Eugenia B id: f9a17499-f6e0-11ea-865d-fdf9a3f77117 last_name: Iofinova orcid: 0000-0002-7778-3221 citation: ama: Iofinova EB. On the utility and effects of efficiency in artificial neural networks. 2026. doi:10.15479/AT-ISTA-21854 apa: Iofinova, E. B. (2026). On the utility and effects of efficiency in artificial neural networks. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-21854 chicago: Iofinova, Eugenia B. “On the Utility and Effects of Efficiency in Artificial Neural Networks.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-21854. ieee: E. B. Iofinova, “On the utility and effects of efficiency in artificial neural networks,” Institute of Science and Technology Austria, 2026. ista: Iofinova EB. 2026. On the utility and effects of efficiency in artificial neural networks. Institute of Science and Technology Austria. mla: Iofinova, Eugenia B. On the Utility and Effects of Efficiency in Artificial Neural Networks. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-21854. short: E.B. Iofinova, On the Utility and Effects of Efficiency in Artificial Neural Networks, Institute of Science and Technology Austria, 2026. corr_author: '1' das_tickbox: '1' date_created: 2026-05-11T08:43:22Z date_published: 2026-05-11T00:00:00Z date_updated: 2026-07-27T12:50:04Z day: '11' ddc: - '000' degree_awarded: PhD department: - _id: GradSch - _id: DaAl doi: 10.15479/AT-ISTA-21854 doi_confirm: '1' file: - access_level: closed checksum: 2e148dad920e3f9b7c32796e0ba2e5f7 content_type: application/zip creator: eiofinov date_created: 2026-05-11T08:36:01Z date_updated: 2026-05-11T08:36:01Z file_id: '21856' file_name: EIofinova_thesis_FinalVersion.zip file_size: 28479571 relation: source_file - access_level: open_access checksum: b10c2933f386f532b2dbf28b19c5525c content_type: application/pdf creator: eiofinov date_created: 2026-05-13T13:10:48Z date_updated: 2026-05-13T13:10:48Z file_id: '21877' file_name: 2026_Iofinova_Eugenia_Thesis.pdf file_size: 18137757 relation: main_file success: 1 file_date_updated: 2026-05-13T13:10:48Z has_accepted_license: '1' language: - iso: eng month: '05' oa: 1 oa_version: Published Version page: '237' project: - _id: 9B9290DE-BA93-11EA-9121-9846C619BF3A grant_number: W1260-N35 name: Vienna Graduate School on Computational Optimization publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria 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. related_material: record: - id: '14771' relation: part_of_dissertation status: public - id: '18121' relation: part_of_dissertation status: public - id: '21858' relation: part_of_dissertation status: public - id: '21859' relation: part_of_dissertation status: public - id: '21857' relation: part_of_dissertation status: public status: public supervisor: - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X title: On the utility and effects of efficiency in artificial neural networks type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2026' ... --- OA_place: publisher _id: '21957' 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.' alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Jeferson full_name: Zapata, Jeferson id: 00223538-AF8F-11E9-A4C7-F729E6697425 last_name: Zapata citation: ama: 'Zapata J. Overcoming degeneracy and singularity: Techniques for semidefinite programs and homotopy continuation endgames. 2026. doi:10.15479/AT-ISTA-21957' apa: 'Zapata, J. (2026). Overcoming degeneracy and singularity: Techniques for semidefinite programs and homotopy continuation endgames. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-21957' chicago: 'Zapata, Jeferson. “Overcoming Degeneracy and Singularity: Techniques for Semidefinite Programs and Homotopy Continuation Endgames.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-21957.' 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.' mla: 'Zapata, Jeferson. Overcoming Degeneracy and Singularity: Techniques for Semidefinite Programs and Homotopy Continuation Endgames. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-21957.' short: 'J. Zapata, Overcoming Degeneracy and Singularity: Techniques for Semidefinite Programs and Homotopy Continuation Endgames, Institute of Science and Technology Austria, 2026.' corr_author: '1' das_tickbox: '1' date_created: 2026-06-08T13:29:52Z date_published: 2026-06-09T00:00:00Z date_updated: 2026-07-27T14:30:42Z day: '09' ddc: - '500' degree_awarded: PhD department: - _id: GradSch - _id: VlKo doi: 10.15479/AT-ISTA-21957 doi_confirm: '1' file: - access_level: closed checksum: b11a959e99d3dcf61040282b5c837141 content_type: application/zip creator: jzapata date_created: 2026-06-08T13:20:02Z date_updated: 2026-06-08T13:20:02Z file_id: '21958' file_name: istaustriathesis_JZapata.zip file_size: 40811933 relation: source_file - access_level: open_access checksum: edf1e5899b2e31505cd1aa3fe8bd4b7f content_type: application/pdf creator: jzapata date_created: 2026-06-10T13:33:25Z date_updated: 2026-06-10T13:33:25Z file_id: '21992' file_name: 4_Final_Thesis_JZapata_REX.pdf file_size: 2207892 relation: main_file success: 1 file_date_updated: 2026-06-10T13:33:25Z has_accepted_license: '1' language: - iso: eng month: '06' oa: 1 oa_version: Published Version page: '89' project: - _id: 9B9290DE-BA93-11EA-9121-9846C619BF3A grant_number: W1260-N35 name: Vienna Graduate School on Computational Optimization publication_identifier: isbn: - 978-3-99078-079-4 issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '21144' relation: part_of_dissertation status: public status: public supervisor: - first_name: Vladimir full_name: Kolmogorov, Vladimir id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87 last_name: Kolmogorov title: 'Overcoming degeneracy and singularity: Techniques for semidefinite programs and homotopy continuation endgames' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2026' ... --- OA_place: repository _id: '21360' acknowledged_ssus: - _id: LifeSc - _id: Bio 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). " alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Stefan full_name: Riegler, Stefan id: FF6018E0-D806-11E9-8E43-0B14E6697425 last_name: Riegler orcid: 0000-0003-3413-1343 citation: ama: 'Riegler S. Root system plasticity under nutrient limitation: Investigating hormonal and molecular drivers in Arabidopsis thaliana and Coffea  species. 2026. doi:10.15479/AT-ISTA-21360' apa: '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. https://doi.org/10.15479/AT-ISTA-21360' 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. https://doi.org/10.15479/AT-ISTA-21360.' 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.' 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. Root System Plasticity under Nutrient Limitation: Investigating Hormonal and Molecular Drivers in Arabidopsis Thaliana and Coffea  Species. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-21360.' 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.' corr_author: '1' das_tickbox: '1' date_created: 2026-02-27T09:08:14Z date_published: 2026-02-26T00:00:00Z date_updated: 2026-07-27T14:30:08Z day: '26' ddc: - '570' - '575' - '583' degree_awarded: PhD department: - _id: GradSch - _id: EvBe doi: 10.15479/AT-ISTA-21360 doi_confirm: '1' file: - access_level: closed checksum: 2f1f44e8536c2538f94a440217452c9f content_type: application/x-zip-compressed creator: sriegler date_created: 2026-03-02T10:59:50Z date_updated: 2026-03-02T10:59:50Z file_id: '21386' file_name: 2026_Riegler_Stefan_Thesis.zip file_size: 31430022 relation: source_file - access_level: closed checksum: 2e8dc39640bc26ae5684c944c619719b content_type: application/pdf creator: sriegler date_created: 2026-03-02T10:59:49Z date_updated: 2026-03-02T10:59:49Z embargo: 2027-02-27 embargo_to: open_access file_id: '21387' file_name: 2026_Riegler_Stefan_Thesis.pdf file_size: 11635090 relation: main_file file_date_updated: 2026-03-02T10:59:50Z has_accepted_license: '1' language: - iso: eng license: https://creativecommons.org/licenses/by-sa/4.0/ month: '02' oa_version: Published Version page: '185' project: - _id: 34afa094-11ca-11ed-8bc3-a375845a59fb grant_number: '101060393' name: Breeding for coffee and cocoa root resilience in low input farming systems based on improved rootstocks publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '21363' relation: research_data status: public status: public supervisor: - first_name: Eva full_name: Benková, Eva id: 38F4F166-F248-11E8-B48F-1D18A9856A87 last_name: Benková orcid: 0000-0002-8510-9739 title: 'Root system plasticity under nutrient limitation: Investigating hormonal and molecular drivers in Arabidopsis thaliana and Coffea species' 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) type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2026' ... --- OA_place: publisher _id: '22258' 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." acknowledged_ssus: - _id: ScienComp 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" alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Al full_name: Depope, Al id: 0b77531d-dbcd-11ea-9d1d-a8eee0bf3830 last_name: Depope citation: ama: 'Depope A. From sparse selection to risk prediction: Approximate message passing for proteomic survival models and large-scale genomics. 2026. doi:10.15479/AT-ISTA-22258' apa: '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. https://doi.org/10.15479/AT-ISTA-22258' 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. https://doi.org/10.15479/AT-ISTA-22258.' 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.' 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.' mla: '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, doi:10.15479/AT-ISTA-22258.' 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.' corr_author: '1' das_tickbox: '1' date_created: 2026-07-10T13:27:20Z date_published: 2026-07-11T00:00:00Z date_updated: 2026-07-28T07:08:15Z day: '11' ddc: - '576' - '610' - '006' degree_awarded: PhD department: - _id: GradSch - _id: MaRo - _id: MaMo doi: 10.15479/AT-ISTA-22258 doi_confirm: '1' file: - access_level: open_access checksum: 9ab386790515628d957a194f30a7ccb4 content_type: application/pdf creator: adepope date_created: 2026-07-13T14:52:19Z date_updated: 2026-07-13T14:52:19Z file_id: '22316' file_name: 2026_Depope_Al_Thesis.pdf file_size: 25109878 relation: main_file - access_level: closed checksum: 8ed8fb63f76a695d5b6fec35343f4b90 content_type: application/zip creator: adepope date_created: 2026-07-13T14:56:41Z date_updated: 2026-07-13T14:56:41Z file_id: '22317' file_name: 2026_Depope_Al_Thesis.zip file_size: 1203199939 relation: source_file file_date_updated: 2026-07-13T14:56:41Z has_accepted_license: '1' keyword: - Approximate Message Passing - GWAS - Genomics - Proteomics - Survival modeling language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: '169' project: - _id: 059876FA-7A3F-11EA-A408-12923DDC885E name: Prix Lopez-Loretta 2019 - Marco Mondelli - _id: 911e6d1f-16d5-11f0-9cad-c5c68c6a1cdf grant_number: '101161364' name: 'Inference in High Dimensions: Light-speed Algorithms and Information Limits' - _id: 9B8D11D6-BA93-11EA-9121-9846C619BF3A grant_number: PCEGP3_181181 name: Improving estimation and prediction of common complex disease risk publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '21488' relation: part_of_dissertation status: public status: public supervisor: - first_name: Matthew Richard full_name: Robinson, Matthew Richard id: E5D42276-F5DA-11E9-8E24-6303E6697425 last_name: Robinson orcid: 0000-0001-8982-8813 - first_name: Marco full_name: Mondelli, Marco id: 27EB676C-8706-11E9-9510-7717E6697425 last_name: Mondelli orcid: 0000-0002-3242-7020 title: 'From sparse selection to risk prediction: Approximate message passing for proteomic survival models and large-scale genomics' type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2026' ... --- OA_place: publisher _id: '22017' alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Tobias full_name: Kleinhanns, Tobias id: 8BD9DE16-AB3C-11E9-9C8C-2A03E6697425 last_name: Kleinhanns orcid: 0000-0003-1537-7436 citation: ama: Kleinhanns T. Unraveling the origin and evolution of defects to enable advanced thermoelectric performance. 2026. doi:10.15479/AT-ISTA-22017 apa: Kleinhanns, T. (2026). Unraveling the origin and evolution of defects to enable advanced thermoelectric performance. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-22017 chicago: Kleinhanns, Tobias. “Unraveling the Origin and Evolution of Defects to Enable Advanced Thermoelectric Performance.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-22017. ieee: T. Kleinhanns, “Unraveling the origin and evolution of defects to enable advanced thermoelectric performance,” Institute of Science and Technology Austria, 2026. ista: Kleinhanns T. 2026. Unraveling the origin and evolution of defects to enable advanced thermoelectric performance. Institute of Science and Technology Austria. mla: Kleinhanns, Tobias. Unraveling the Origin and Evolution of Defects to Enable Advanced Thermoelectric Performance. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-22017. short: T. Kleinhanns, Unraveling the Origin and Evolution of Defects to Enable Advanced Thermoelectric Performance, Institute of Science and Technology Austria, 2026. corr_author: '1' das_tickbox: '1' date_created: 2026-06-18T08:00:03Z date_published: 2026-06-18T00:00:00Z date_updated: 2026-07-28T09:55:13Z day: '18' ddc: - '546' - '530' degree_awarded: PhD department: - _id: GradSch - _id: MaIb doi: 10.15479/AT-ISTA-22017 doi_confirm: '1' file: - access_level: closed checksum: 3df7e865a7d1da8972ccd8acb8b4c16c content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document creator: tkleinha date_created: 2026-06-30T09:17:15Z date_updated: 2026-06-30T09:17:15Z file_id: '22226' file_name: 2026_Kleinhanns_Tobias_Thesis_Source_File.docx file_size: 15658266 relation: source_file - access_level: closed checksum: 40ec279272a963636ff29c964032dcba content_type: application/pdf creator: tkleinha date_created: 2026-07-01T07:35:17Z date_updated: 2026-07-01T07:35:17Z embargo: 2026-12-18 embargo_to: open_access file_id: '22232' file_name: 2026_Kleinhanns_Tobias_Thesis_Main_File_A4.pdf file_size: 9909375 relation: main_file file_date_updated: 2026-07-01T07:35:17Z has_accepted_license: '1' language: - iso: eng month: '06' oa_version: Published Version page: '59' project: - _id: 9B8F7476-BA93-11EA-9121-9846C619BF3A name: 'HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of Semiconductors for Waste Heat Recovery' publication_identifier: isbn: - 978-3-99078-081-7 issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '15182' relation: part_of_dissertation status: public - id: '12237' relation: part_of_dissertation status: public - id: '20326' relation: part_of_dissertation status: public status: public supervisor: - first_name: Maria full_name: Ibáñez, Maria id: 43C61214-F248-11E8-B48F-1D18A9856A87 last_name: Ibáñez orcid: 0000-0001-5013-2843 title: Unraveling the origin and evolution of defects to enable advanced thermoelectric performance type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2026' ... --- OA_place: repository _id: '21393' abstract: - lang: eng 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." alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Martin full_name: Dvorak, Martin id: 40ED02A8-C8B4-11E9-A9C0-453BE6697425 last_name: Dvorak orcid: 0000-0001-5293-214X citation: ama: 'Dvorak M. Pursuit of truth and beauty in Lean 4: Formally verified theory of grammars, optimization, matroids. 2026. doi:10.15479/AT-ISTA-21393' apa: 'Dvorak, M. (2026). Pursuit of truth and beauty in Lean 4: Formally verified theory of grammars, optimization, matroids. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-21393' 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. https://doi.org/10.15479/AT-ISTA-21393.' 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.' 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.' mla: 'Dvorak, Martin. Pursuit of Truth and Beauty in Lean 4: Formally Verified Theory of Grammars, Optimization, Matroids. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-21393.' 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.' corr_author: '1' date_created: 2026-03-04T09:26:46Z date_published: 2026-03-04T00:00:00Z date_updated: 2026-07-29T12:56:52Z day: '04' ddc: - '511' - '000' degree_awarded: PhD department: - _id: GradSch - _id: VlKo doi: 10.15479/AT-ISTA-21393 doi_confirm: '1' file: - access_level: open_access checksum: cface6dc18152680962b5361575f6e4f content_type: application/pdf creator: mdvorak date_created: 2026-03-04T08:56:15Z date_updated: 2026-03-04T08:56:15Z file_id: '21394' file_name: 2026_Dvorak_Martin_Thesis.pdf file_size: 1771231 relation: main_file success: 1 - access_level: closed checksum: 290ddfacfb7e07fb07e6f0b334e67c90 content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document creator: mdvorak date_created: 2026-03-04T09:03:37Z date_updated: 2026-03-04T09:03:37Z file_id: '21395' file_name: 2026_Dvorak_Martin_Thesis.docx file_size: 864585 relation: source_file file_date_updated: 2026-03-04T09:03:37Z has_accepted_license: '1' language: - iso: eng month: '03' oa: 1 oa_version: Published Version page: '160' publication_identifier: isbn: - 978-3-99078-074-9 issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: link: - description: Full version of all definitions, statements, and proofs for Chapter 3.1 (Linear duality) relation: software url: https://github.com/madvorak/duality/tree/v3.5.0 - description: Full version of all definitions, statements, and proofs for Chapter 3.2 (Valued Constraint Satisfaction Problems) relation: software url: https://github.com/madvorak/vcsp/tree/v8.2.0 - description: Full version of all definitions, statements, and proofs for Chapter 4 (Seymour project) relation: software url: https://github.com/Ivan-Sergeyev/seymour/tree/v1.2.0 - description: Full version of all definitions, statements, and proofs for Chapter 5 (Theory of grammars) relation: software url: https://github.com/madvorak/chomsky/tree/v1.2.0 - description: Old version (Lean 3) of the project about grammars relation: software url: https://github.com/madvorak/grammars - description: Demonstration of (minimal) requirements for selected algebraic classes used in my Ph.D. thesis relation: software url: https://github.com/madvorak/preliminaries/blob/main/Preliminaries.lean record: - id: '13120' relation: part_of_dissertation status: public - id: '20071' relation: part_of_dissertation status: public - id: '21398' relation: part_of_dissertation status: public status: public supervisor: - first_name: Vladimir full_name: Kolmogorov, Vladimir id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87 last_name: Kolmogorov - first_name: Jasmin full_name: Blanchette, Jasmin last_name: Blanchette title: 'Pursuit of truth and beauty in Lean 4: Formally verified theory of grammars, optimization, matroids' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2026' ... --- OA_place: publisher _id: '22334' 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" acknowledged_ssus: - _id: LifeSc - _id: NMR 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)." alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Lea Marie full_name: Becker, Lea Marie id: 36336939-eb97-11eb-a6c2-c83f1214ca79 last_name: Becker orcid: 0000-0002-6401-5151 citation: ama: Becker LM. Exploring protein dynamics using specific labeling approaches for solid-state MAS NMR. 2026. doi:10.15479/AT-ISTA-22334 apa: Becker, L. M. (2026). Exploring protein dynamics using specific labeling approaches for solid-state MAS NMR. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-22334 chicago: Becker, Lea Marie. “Exploring Protein Dynamics Using Specific Labeling Approaches for Solid-State MAS NMR.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-22334. ieee: L. M. Becker, “Exploring protein dynamics using specific labeling approaches for solid-state MAS NMR,” Institute of Science and Technology Austria, 2026. ista: Becker LM. 2026. Exploring protein dynamics using specific labeling approaches for solid-state MAS NMR. Institute of Science and Technology Austria. mla: Becker, Lea Marie. Exploring Protein Dynamics Using Specific Labeling Approaches for Solid-State MAS NMR. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-22334. short: L.M. Becker, Exploring Protein Dynamics Using Specific Labeling Approaches for Solid-State MAS NMR, Institute of Science and Technology Austria, 2026. corr_author: '1' das_tickbox: '1' date_created: 2026-07-14T08:08:51Z date_published: 2026-07-13T00:00:00Z date_updated: 2026-08-04T09:32:45Z day: '13' ddc: - '572' degree_awarded: PhD department: - _id: GradSch - _id: PaSc doi: 10.15479/AT-ISTA-22334 doi_confirm: '1' file: - access_level: closed checksum: 8b85114eff543916c0e1445cd2189555 content_type: application/zip creator: lbecker date_created: 2026-07-16T09:17:08Z date_updated: 2026-07-16T09:17:08Z file_id: '22346' file_name: 2026_Becker_Lea_source_files.zip file_size: 99472908 relation: source_file - access_level: open_access checksum: 6c526862bc6dbd1e4c80ecb34580bc58 content_type: application/pdf creator: lbecker date_created: 2026-07-16T09:17:05Z date_updated: 2026-07-16T09:17:05Z file_id: '22347' file_name: 2026_Becker_Lea_Thesis.pdf file_size: 74647289 relation: main_file success: 1 file_date_updated: 2026-07-16T09:17:08Z has_accepted_license: '1' language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: '205' project: - _id: 7be609c4-9f16-11ee-852c-85015ce2b9b0 grant_number: '26777' name: Exploring protein dynamics by solid-state MAS NMR through specific labeling approaches publication_identifier: isbn: - 978-3-99078-084-8 issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '12675' relation: part_of_dissertation status: public - id: '21777' relation: part_of_dissertation status: public - id: '12114' relation: part_of_dissertation status: public - id: '22105' relation: part_of_dissertation status: public status: public supervisor: - first_name: Paul full_name: Schanda, Paul id: 7B541462-FAF6-11E9-A490-E8DFE5697425 last_name: Schanda orcid: 0000-0002-9350-7606 title: Exploring protein dynamics using specific labeling approaches for solid-state MAS NMR 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) type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2026' ... --- OA_place: publisher _id: '22626' 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”.' alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Christine full_name: Fiedler, Christine id: bd3fceba-dc74-11ea-a0a7-c17f71817366 last_name: Fiedler citation: ama: Fiedler C. Mechanistic insight into solution-processed p-type tin chalcogenides as a basis for designing their n-type analogs. 2026. doi:10.15479/AT-ISTA-22626 apa: 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. https://doi.org/10.15479/AT-ISTA-22626 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. https://doi.org/10.15479/AT-ISTA-22626. 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. 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. mla: 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, doi:10.15479/AT-ISTA-22626. 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. corr_author: '1' date_created: 2026-08-03T07:55:16Z date_published: 2026-08-05T00:00:00Z date_updated: 2026-08-11T12:39:15Z day: '05' ddc: - '540' - '546' - '530' degree_awarded: PhD department: - _id: GradSch - _id: MaIb doi: 10.15479/AT-ISTA-22626 doi_confirm: '1' file: - access_level: closed checksum: 4f357f3c0f5ee3d679dd0395dbafc4bb content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document creator: cfiedler date_created: 2026-08-07T09:10:56Z date_updated: 2026-08-07T10:02:41Z file_id: '22659' file_name: 2026_Fiedler_Christine_Thesis.docx file_size: 625541367 relation: source_file - access_level: closed checksum: 69784d2e7b9ef3d3a0fbe134f3bba089 content_type: application/pdf creator: cfiedler date_created: 2026-08-07T09:10:45Z date_updated: 2026-08-07T10:16:07Z embargo: 2027-02-07 embargo_to: open_access file_id: '22660' file_name: 2026_Fiedler_Christine_Thesis.pdf file_size: 16646551 relation: main_file file_date_updated: 2026-08-07T10:16:07Z has_accepted_license: '1' language: - iso: eng month: '08' oa_version: Published Version page: '141' project: - _id: 9B8F7476-BA93-11EA-9121-9846C619BF3A name: 'HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of Semiconductors for Waste Heat Recovery' publication_identifier: isbn: - 978-3-99078-086-2 issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '12237' relation: part_of_dissertation status: public - id: '17124' relation: part_of_dissertation status: public - id: '17052' relation: part_of_dissertation status: public status: public supervisor: - first_name: Maria full_name: Ibáñez, Maria id: 43C61214-F248-11E8-B48F-1D18A9856A87 last_name: Ibáñez orcid: 0000-0001-5013-2843 title: Mechanistic insight into solution-processed p-type tin chalcogenides as a basis for designing their n-type analogs tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2026' ... --- OA_place: publisher _id: '22667' acknowledged_ssus: - _id: Bio - _id: LifeSc acknowledgement: "I am also grateful for the financial support that made this work possible, including the\r\nEuropean Research Council (ERC Starting Grant 101041551), the Austrian Science\r\nFund (FWF, Cluster of Excellence 10.55776/COE16), the GFF Lower Austria FTI\r\nStrategy Dissertation Fellowship (FTI21-D-046), and the FENS/IBRO-PERC\r\nExchange Fellowship. " alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: David full_name: Vijatovic, David id: cf391e77-ec3c-11ea-a124-d69323410b58 last_name: Vijatovic orcid: 0000-0002-5494-0941 citation: ama: Vijatovic D. Dissecting the molecular and functional basis of motor control in the frog Xenopus laevis. 2026. doi:10.15479/AT-ISTA-22667 apa: Vijatovic, D. (2026). Dissecting the molecular and functional basis of motor control in the frog Xenopus laevis. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-22667 chicago: Vijatovic, David. “Dissecting the Molecular and Functional Basis of Motor Control in the Frog Xenopus Laevis.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-22667. ieee: D. Vijatovic, “Dissecting the molecular and functional basis of motor control in the frog Xenopus laevis,” Institute of Science and Technology Austria, 2026. ista: Vijatovic D. 2026. Dissecting the molecular and functional basis of motor control in the frog Xenopus laevis. Institute of Science and Technology Austria. mla: Vijatovic, David. Dissecting the Molecular and Functional Basis of Motor Control in the Frog Xenopus Laevis. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-22667. short: D. Vijatovic, Dissecting the Molecular and Functional Basis of Motor Control in the Frog Xenopus Laevis, Institute of Science and Technology Austria, 2026. corr_author: '1' date_created: 2026-08-10T13:44:30Z date_published: 2026-08-10T00:00:00Z date_updated: 2026-08-20T14:45:18Z day: '10' ddc: - '573' degree_awarded: PhD department: - _id: GradSch - _id: LoSw doi: 10.15479/AT-ISTA-22667 doi_confirm: '1' file: - access_level: closed checksum: e3acfea4b1a3abf99e74224656740a15 content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document creator: dvijatov date_created: 2026-08-10T13:35:39Z date_updated: 2026-08-10T13:35:39Z file_id: '22669' file_name: 2026_Vijatovic_David_Thesis.docx file_size: 14322760 relation: source_file - access_level: closed checksum: dc8c78ae14f69e54faa41e65db5c6402 content_type: application/pdf creator: dvijatov date_created: 2026-08-12T13:44:36Z date_updated: 2026-08-12T13:44:36Z embargo: 2027-08-10 embargo_to: open_access file_id: '22695' file_name: 2026_Vijatovic_David_Thesis.pdf file_size: 116926375 relation: main_file file_date_updated: 2026-08-12T13:44:36Z has_accepted_license: '1' language: - iso: eng month: '08' oa_version: Published Version page: '172' project: - _id: ebb66355-77a9-11ec-83b8-b8ac210a4dae grant_number: '101041551' name: Development and Evolution of Tetrapod Motor Circuits - _id: bd73af52-d553-11ed-ba76-912049f0ac7a grant_number: FTI21-D-046 name: Development of V1 interneuron diversity during swim-to-walk transition of Xenopus metamorphosis - _id: 34a02c70-11ca-11ed-8bc3-fbfd2c86c88f grant_number: 3(GG016346-01) name: Development of Viral Vectors for Amphibian Gene Delivery and Manipulation publication_identifier: isbn: - 978-3-99078-082-4 issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '21746' relation: part_of_dissertation status: public - id: '15016' relation: part_of_dissertation status: public status: public supervisor: - first_name: Lora Beatrice Jaeger full_name: Sweeney, Lora Beatrice Jaeger id: 56BE8254-C4F0-11E9-8E45-0B23E6697425 last_name: Sweeney orcid: 0000-0001-9242-5601 title: Dissecting the molecular and functional basis of motor control in the frog Xenopus laevis type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2026' ... --- OA_place: publisher _id: '22664' abstract: - lang: eng text: "The widespread adoption of apps like Whatsapp and Signal has translated into billions of people all around the world communicating on a regular basis by making use of services that offer end-to-end encryption and even provide security guarantees when a user's device is compromised.\r\n\r\nThis was made possible by the introduction of the Double Ratchet Algorithm~\\cite{double_ratchet}, which was designed for a setting where communication takes place between two parties.\r\nHowever, in practice, many apps offer the possibility of creating groups.\r\nThe protocols they use to secure communication are inefficient for large group which has the undesireable consequence that the aforementioned apps have established limits on the group size of roughly 1000 users.\r\nThis has motivated the introduction of the Messaging Layer Security (MLS) standard~\\cite{rfc9420} by the IETF which is based on a primitive called Continuous Group Key Agreement (CGKA)~\\cite{C:ACDT20}.\r\n\r\nThis primitive allows a group of users to maintain a shared secret key that is frequently rotated by the group members in order to change group membership, achieve forward secrecy (FS) and post compromise security (PCS).\r\nMost protocols are based on binary trees where the nodes are associated to a pair formed by public key and a secret key.\r\nEach leaf corresponds to one of the group members and a user knows the secret keys associated to nodes along the path from their leaf to the root.\r\nWhen a user wants to update their key material they have to change $ \\log(N) $ many keys.\r\nThis requires uploading $ \\log(N) $ many ciphertexts to communicate the new keys to the rest of the group members in a way that respects the tree structure.\r\n\r\nIn this thesis we study how much communication between group members is required in order to add and remove users from a group as well as in order to provide PCS when we consider CGKAs built using standard cryptographic primitives like pseudo-random functions and public-key encryption. Furthermore, we also consider the case of MLS and provide the first lower bound showing that its communication complexity is much worse than previously believed, i.e., it is very far from $ \\log(N) $.\r\nFinally, we also propose a variant of MLS which provably achieves the same security properties with a much lower communication cost." alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Miguel full_name: Cueto Noval, Miguel id: ffc563a3-f6e0-11ea-865d-e3cce03d17cc last_name: Cueto Noval orcid: 0000-0002-2505-4246 citation: ama: Cueto Noval M. Towards efficient secure group messaging. 2026. doi:10.15479/AT-ISTA-22664 apa: Cueto Noval, M. (2026). Towards efficient secure group messaging. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-22664 chicago: Cueto Noval, Miguel. “Towards Efficient Secure Group Messaging.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-22664. ieee: M. Cueto Noval, “Towards efficient secure group messaging,” Institute of Science and Technology Austria, 2026. ista: Cueto Noval M. 2026. Towards efficient secure group messaging. Institute of Science and Technology Austria. mla: Cueto Noval, Miguel. Towards Efficient Secure Group Messaging. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-22664. short: M. Cueto Noval, Towards Efficient Secure Group Messaging, Institute of Science and Technology Austria, 2026. corr_author: '1' date_created: 2026-08-10T10:18:35Z date_published: 2026-08-10T00:00:00Z date_updated: 2026-08-21T10:53:17Z day: '10' ddc: - '000' degree_awarded: PhD department: - _id: GradSch - _id: KrPi doi: 10.15479/AT-ISTA-22664 doi_confirm: '1' file: - access_level: open_access checksum: d61beeb9a250a04396c2c61bbd0783aa content_type: application/pdf creator: mcuetono date_created: 2026-08-13T09:39:00Z date_updated: 2026-08-19T11:36:46Z file_id: '22702' file_name: 2026_CuetoNoval_Miguel_Thesis.pdf file_size: 1390255 relation: main_file - access_level: closed checksum: 4d6def422cc93a108faf5e5defc0f807 content_type: application/zip creator: mcuetono date_created: 2026-08-13T09:39:01Z date_updated: 2026-08-14T10:26:06Z file_id: '22703' file_name: 2026_CuetoNoval_Miguel_Thesis.zip file_size: 9923509 relation: source_file file_date_updated: 2026-08-19T11:36:46Z has_accepted_license: '1' language: - iso: eng month: '08' oa: 1 oa_version: Published Version page: '187' publication_identifier: isbn: - ' 978-3-99078-087-9' issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '14691' relation: part_of_dissertation status: public - id: '18702' relation: part_of_dissertation status: public - id: '21262' relation: part_of_dissertation status: public status: public supervisor: - first_name: Krzysztof Z full_name: Pietrzak, Krzysztof Z id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87 last_name: Pietrzak orcid: 0000-0002-9139-1654 title: Towards efficient secure group messaging tmp: image: /images/cc_by_nc_sa.png legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) short: CC BY-NC-SA (4.0) type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2026' ... --- OA_place: publisher _id: '18979' abstract: - lang: eng text: "Topological Data Analysis (TDA) is a discipline utilizing the mathematical field of topology to study data, most prominently collections of point sets. This thesis summarizes three projects related to computations in TDA.\r\n\r\nThe first one establishes a variant of TDA for chromatic point sets, where each point is given a color. For example, we are given positions of cells within a tumor microenvironment, and color the cancerous cells red, and the immune cells blue.\r\n\r\nThe aim is then to give a quantitative description of how the two or more sets of points spatially interact. Building on image, kernel and cokernel variants of persistent homology, we suggest six-packs of persistent diagrams as such a descriptor.\r\n\r\nWe describe a construction of a chromatic alpha complex, which enables efficient computation of several variants of the six-packs. We give topological descriptions of natural subcomplexes of the chromatic alpha complex, and show that the radii of the simplices form a discrete Morse function. Finally, we provide an implementation of the presented chromatic TDA pipeline.\r\n\r\nThe second part aims to translate a powerful tool of sheaf theory to elementary terms using labeled matrices. The goal is to enable their use in computational settings. We show that derived categories of sheaves over finite posets have, up to isomorphism, unique objects---minimal injective resolutions---and give a concrete algorithm to compute them. We further describe simple algorithms to compute derived pushforwards and pullbacks for monotonic maps, and their proper variants for inclusions, and demonstrate their tractability by providing an implementation. Finally, we suggest a discrete definition of microsupport and show desirable properties inspired by discrete Morse theory.\r\n\r\nIn the last part, we present a collection of observations about collapses. We give a characterization of collapsibility in terms of unitriangular submatrices of the boundary matrix, a cotree-tree decomposition, and the optimal solution to a variant of the Procrustes problem. We establish relation between dual collapses and relative Morse theory and pose several open questions. Finally, focusing on complexes embedded in the three-dimensional Euclidean space, we describe a relation between the collapsibility and the triviality of a polygonal knot." acknowledgement: "The research presented in this thesis was funded with the Wittgenstein Prize,\r\nAustrian Science Fund (FWF), grant no. Z 342-N31, and from the DFG Collaborative Research\r\nCenter TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF),\r\ngrant no. I 02979-N35.\r\n" alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Ondrej full_name: Draganov, Ondrej id: 2B23F01E-F248-11E8-B48F-1D18A9856A87 last_name: Draganov orcid: 0000-0003-0464-3823 citation: ama: Draganov O. Structures and computations in topological data analysis. 2025. doi:10.15479/at:ista:18979 apa: Draganov, O. (2025). Structures and computations in topological data analysis. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:18979 chicago: Draganov, Ondrej. “Structures and Computations in Topological Data Analysis.” Institute of Science and Technology Austria, 2025. https://doi.org/10.15479/at:ista:18979. ieee: O. Draganov, “Structures and computations in topological data analysis,” Institute of Science and Technology Austria, 2025. ista: Draganov O. 2025. Structures and computations in topological data analysis. Institute of Science and Technology Austria. mla: Draganov, Ondrej. Structures and Computations in Topological Data Analysis. Institute of Science and Technology Austria, 2025, doi:10.15479/at:ista:18979. short: O. Draganov, Structures and Computations in Topological Data Analysis, Institute of Science and Technology Austria, 2025. corr_author: '1' date_created: 2025-01-31T17:04:40Z date_published: 2025-02-03T00:00:00Z date_updated: 2026-04-07T11:47:30Z day: '03' ddc: - '514' - '004' degree_awarded: PhD department: - _id: GradSch - _id: HeEd doi: 10.15479/at:ista:18979 file: - access_level: closed checksum: af6567e5d35e5eb330b8925ae37f1998 content_type: application/zip creator: odragano date_created: 2025-01-31T16:58:30Z date_updated: 2025-01-31T16:58:30Z file_id: '18983' file_name: Thesis.zip file_size: 11899491 relation: source_file - access_level: open_access checksum: c3fef68e35b9dc2020b2ca6006da6343 content_type: application/pdf creator: odragano date_created: 2025-02-04T16:22:07Z date_updated: 2025-02-04T16:22:07Z file_id: '19000' file_name: Thesis.pdf file_size: 8857514 relation: main_file file_date_updated: 2025-02-04T16:22:07Z has_accepted_license: '1' keyword: - topological data analysis - chromatic point set - alpha complex - persistent homology - six pack - sheaf - microlocal discrete Morse - injective resolution - collapse - knot - discrete Morse theory language: - iso: eng month: '02' oa: 1 oa_version: Published Version page: '140' project: - _id: 2561EBF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: I02979-N35 name: Persistence and stability of geometric complexes - _id: 268116B8-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z00342 name: Mathematics, Computer Science publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '15091' relation: part_of_dissertation status: public - id: '18981' relation: part_of_dissertation status: public status: public supervisor: - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 title: Structures and computations in topological data analysis tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2025' ...