--- OA_place: publisher _id: '20964' acknowledged_ssus: - _id: LifeSc - _id: Bio alternative_title: - ISTA Master’s Thesis article_processing_charge: No author: - first_name: Dmitrii full_name: Vladimirtsev, Dmitrii id: 60466724-5355-11ee-ae5a-fa55e8f99c3d last_name: Vladimirtsev citation: ama: Vladimirtsev D. Armadillo repeat only proteins are master regulators of plant cyclic-nucleotide gated channels. 2026. doi:10.15479/AT-ISTA-20964 apa: Vladimirtsev, D. (2026). Armadillo repeat only proteins are master regulators of plant cyclic-nucleotide gated channels. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-20964 chicago: Vladimirtsev, Dmitrii. “Armadillo Repeat Only Proteins Are Master Regulators of Plant Cyclic-Nucleotide Gated Channels.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-20964. ieee: D. Vladimirtsev, “Armadillo repeat only proteins are master regulators of plant cyclic-nucleotide gated channels,” Institute of Science and Technology Austria, 2026. ista: Vladimirtsev D. 2026. Armadillo repeat only proteins are master regulators of plant cyclic-nucleotide gated channels. Institute of Science and Technology Austria. mla: Vladimirtsev, Dmitrii. Armadillo Repeat Only Proteins Are Master Regulators of Plant Cyclic-Nucleotide Gated Channels. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-20964. short: D. Vladimirtsev, Armadillo Repeat Only Proteins Are Master Regulators of Plant Cyclic-Nucleotide Gated Channels, Institute of Science and Technology Austria, 2026. corr_author: '1' date_created: 2026-01-09T09:22:48Z date_published: 2026-01-14T00:00:00Z date_updated: 2026-04-07T11:41:44Z day: '14' ddc: - '570' degree_awarded: MS department: - _id: GradSch - _id: JiFr doi: 10.15479/AT-ISTA-20964 file: - access_level: closed checksum: 812857b2fbe3f6113bef22fd04bccd3e content_type: application/pdf creator: dvladimi date_created: 2026-01-21T14:12:13Z date_updated: 2026-01-21T14:12:13Z embargo: 2027-01-01 embargo_to: open_access file_id: '21033' file_name: 2026_Vladimirtsev_Dmitrii_Thesis.pdf file_size: 2867531 relation: main_file - access_level: closed checksum: 2b969f97f8d7461bea3d255f48c2219c content_type: application/x-zip-compressed creator: dvladimi date_created: 2026-01-21T14:41:58Z date_updated: 2026-01-28T12:38:19Z file_id: '21034' file_name: Source Files.zip file_size: 25023066 relation: source_file file_date_updated: 2026-01-28T12:38:19Z fulldoi: https://doi.org/10.15479/AT-ISTA-20964 has_accepted_license: '1' language: - iso: eng month: '01' oa_version: Published Version page: '22' project: - _id: 8f347782-16d5-11f0-9cad-8c19706ee739 grant_number: '101142681' name: Cyclic nucleotides as second messengers in plants publication_identifier: issn: - 2791-4585 publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '20982' relation: part_of_dissertation status: public status: public supervisor: - first_name: Jiří full_name: Friml, Jiří id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 title: Armadillo repeat only proteins are master regulators of plant cyclic-nucleotide gated channels type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2026' ... --- OA_place: repository _id: '21401' abstract: - lang: eng text: "Runtime verification offers scalable solutions to improve the safety and reliability of systems. However, systems that require verification or monitoring by a third party to ensure compliance with a specification might contain sensitive information, causing privacy concerns when usual runtime verification approaches are used. Privacy is compromised if protected information about the system, or sensitive data that is processed by the system, is revealed. In addition, revealing the specification being monitored may undermine the essence of third-party verification.\r\n\r\nIn this thesis, we propose a protocol for privacy-preserving runtime verification of systems against formal sequential specifications. We develop the protocol in two steps. In the first step, the monitor verifies whether the system satisfies the specification without learning anything else, though both parties are aware of the specification. In the second step, we extend the protocol to ensure that the system remains oblivious to the monitored specification, while the monitor learns only whether the system satisfies the specification and nothing more. Our protocol adapts and improves existing techniques used in cryptography, and more specifically, multi-party computation.\r\n\r\nThe sequential specification defines the observation step of the monitor, whose granularity depends on the situation (e.g., banks may be monitored on a daily basis). Our protocol exchanges a single message per observation step, after an initialization phase. This design minimizes communication overhead, enabling relatively lightweight privacy-preserving monitoring. We implement our approach for monitoring specifications described by register automata and evaluate it experimentally.\r\n" acknowledgement: "This work is part of the project VAMOS, which has received funding from the European\r\nResearch Council (ERC) under grant agreement No. 101020093, and the Austrian Science\r\nFund (FWF) SFB project SpyCoDe F8502.\r\n" alternative_title: - ISTA Master’s Thesis article_processing_charge: No author: - first_name: Mahyar full_name: Karimi, Mahyar id: 6e5417ba-5355-11ee-ae5a-94c2e510b26b last_name: Karimi orcid: 0009-0005-0820-1696 citation: ama: Karimi M. Privacy-preserving runtime verification. 2026. doi:10.15479/AT-ISTA-21401 apa: Karimi, M. (2026). Privacy-preserving runtime verification. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-21401 chicago: Karimi, Mahyar. “Privacy-Preserving Runtime Verification.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-21401. ieee: M. Karimi, “Privacy-preserving runtime verification,” Institute of Science and Technology Austria, 2026. ista: Karimi M. 2026. Privacy-preserving runtime verification. Institute of Science and Technology Austria. mla: Karimi, Mahyar. Privacy-Preserving Runtime Verification. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-21401. short: M. Karimi, Privacy-Preserving Runtime Verification, Institute of Science and Technology Austria, 2026. corr_author: '1' date_created: 2026-03-05T15:20:47Z date_published: 2026-03-05T00:00:00Z date_updated: 2026-03-13T13:37:20Z day: '05' ddc: - '000' degree_awarded: MS department: - _id: GradSch - _id: ToHe doi: 10.15479/AT-ISTA-21401 ec_funded: 1 file: - access_level: open_access checksum: 3f49f05c9d123e14d7adb73d3bc50fe2 content_type: application/pdf creator: mkarimi date_created: 2026-03-06T14:06:25Z date_updated: 2026-03-10T15:20:09Z file_id: '21404' file_name: 2026_Karimi_Mahyar_Thesis.pdf file_size: 766048 relation: main_file - access_level: closed checksum: 8fb9db4b4187e26443369a993427a5ff content_type: application/zip creator: mkarimi date_created: 2026-03-06T14:06:25Z date_updated: 2026-03-06T14:06:25Z file_id: '21405' file_name: 2026_Karimi_Mahyar_Thesis_src.zip file_size: 1243394 relation: source_file file_date_updated: 2026-03-10T15:20:09Z fulldoi: https://doi.org/10.15479/AT-ISTA-21401 has_accepted_license: '1' keyword: - Privacy-preserving verification - Runtime verification - Monitoring - Reactive functionalities - Cryptographic protocols language: - iso: eng month: '03' oa: 1 oa_version: Published Version page: '60' project: - _id: 62781420-2b32-11ec-9570-8d9b63373d4d call_identifier: H2020 grant_number: '101020093' name: Vigilant Algorithmic Monitoring of Software - _id: 34a4ce89-11ca-11ed-8bc3-8cc37fb6e11f grant_number: F8512 name: Security and Privacy by Design for Complex Systems publication_identifier: issn: - 2791-4585 publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '21020' relation: part_of_dissertation status: public status: public supervisor: - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000-0002-2985-7724 title: Privacy-preserving runtime verification type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 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 fulldoi: https://doi.org/10.15479/AT-ISTA-21651 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: '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 fulldoi: https://doi.org/10.15479/AT-ISTA-21918 has_accepted_license: '1' language: - iso: eng 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: 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 fulldoi: https://doi.org/10.15479/AT-ISTA-22255 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: '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 fulldoi: https://doi.org/10.15479/AT-ISTA-21021 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: '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 fulldoi: https://doi.org/10.15479/AT-ISTA-21957 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 fulldoi: https://doi.org/10.15479/AT-ISTA-21360 has_accepted_license: '1' language: - iso: eng 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: 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 fulldoi: https://doi.org/10.15479/AT-ISTA-21393 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 fulldoi: https://doi.org/10.15479/AT-ISTA-22334 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: '22694' abstract: - lang: eng text: "We develop and employ techniques from equivariant algebraic K-theory and related invariants\r\nin the context of geometric representation theory, in both arithmetic and topological situations.\r\nWe showcase the use of such techniques on the affine Grassmannian Gr, a space of fundamental\r\ninterest in the geometric Langlands program.\r\n\r\nIt is a deep development of mathematics of the last century that many concrete, yet combina-\r\ntorially complex algebraic problems may be effectively studied through the lens of algebraic\r\ngeometry. The objects of interest can be often realized as cohomological invariants of algebraic\r\nvarieties, and good understanding of their geometry sheds light into the original questions.\r\nSuch techniques have seen immense applications in the Langlands program, where they go\r\nunder the label of geometric representation theory.\r\n\r\nOne source of powerful invariants in algebraic geometry comes from algebraic K-theory,\r\nHochschild homology, and their relatives. These localizing invariants contain large amount\r\nof information, but are quite hard to compute. For this reason, their usage in geometric\r\nrepresentation theory has been limited.\r\n\r\nThe aim of this thesis is to showcase how to control such invariants in the situations of\r\ninterest and use them to obtain new insights. We start by reinterpreting equivariant Hochschild\r\nhomology in terms of functions on certain fixed-point schemes, which are of independent\r\ninterest. We compare it to equivariant K-theory via the trace map. We give new computations\r\nand comparisons of such invariants of affine Schubert varieties in Gr, including arithmetic\r\nsituations. We show that they behave much better than expected.\r\n\r\nWe finally utilize this circle of ideas in a purely topological setting. We describe the varying\r\nfixed points of the extended torus action on the affine Grassmannian, and use it to compute\r\nits equivariant topological K-theory ring. The answer is nontrivial and verifies an outstanding\r\nconjecture in the subject.\r\n\r\nWe compare, partly conjecturally, the resulting K-theory ring to the completed center of an\r\nintegral even hybrid quantum group and its deformed quantum category O. This gives a\r\ngenuine application of our computations in pure representation theory." acknowledgement: "It was funded by a DOC Fellowship of the Austrian Academy of Sciences entitled Arithmetic,\r\ngeometry, topology and representation theory arising from the affine Grassmannian. It was\r\nfurther funded by the Austrian Science Fund FWF 10.55776/P35847, and an Erasmus+ staff\r\nmobility training. \r\n" alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Jakub full_name: Löwit, Jakub id: e3b80ae2-eb8e-11eb-b029-9aef4a9108a0 last_name: Löwit citation: ama: Löwit J. Equivariant K-theory of affine Grassmannians in representation theory and arithmetic. 2026. doi:10.15479/AT-ISTA-22694 apa: Löwit, J. (2026). Equivariant K-theory of affine Grassmannians in representation theory and arithmetic. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-22694 chicago: Löwit, Jakub. “Equivariant K-Theory of Affine Grassmannians in Representation Theory and Arithmetic.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-22694. ieee: J. Löwit, “Equivariant K-theory of affine Grassmannians in representation theory and arithmetic,” Institute of Science and Technology Austria, 2026. ista: Löwit J. 2026. Equivariant K-theory of affine Grassmannians in representation theory and arithmetic. Institute of Science and Technology Austria. mla: Löwit, Jakub. Equivariant K-Theory of Affine Grassmannians in Representation Theory and Arithmetic. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-22694. short: J. Löwit, Equivariant K-Theory of Affine Grassmannians in Representation Theory and Arithmetic, Institute of Science and Technology Austria, 2026. corr_author: '1' date_created: 2026-08-12T14:05:36Z date_published: 2026-08-05T00:00:00Z date_updated: 2026-08-26T06:53:55Z day: '05' ddc: - '510' - '516' - '512' - '514' - '513' degree_awarded: PhD department: - _id: GradSch - _id: TaHa doi: 10.15479/AT-ISTA-22694 doi_confirm: '1' file: - access_level: open_access checksum: 2d0be77791dc296621c6c0f76be9d0d7 content_type: application/pdf creator: jloewit date_created: 2026-08-14T11:42:31Z date_updated: 2026-08-14T11:42:31Z file_id: '22709' file_name: 2026_Löwit_Jakub_Thesis.pdf file_size: 1574709 relation: main_file - access_level: closed checksum: 61bde4b58c1e6c7baeb561e41f82659b content_type: application/zip creator: jloewit date_created: 2026-08-14T11:42:42Z date_updated: 2026-08-14T11:42:42Z file_id: '22710' file_name: 2026_Löwit_Jakub_Source_files.zip file_size: 1085118 relation: source_file file_date_updated: 2026-08-14T11:42:42Z fulldoi: https://doi.org/10.15479/AT-ISTA-22694 has_accepted_license: '1' language: - iso: eng month: '08' oa: 1 oa_version: Published Version page: '185' project: - _id: 901e2a43-16d5-11f0-9cad-9cead34748d6 grant_number: '27004' name: Arithmetic, geometry, topology and representation theory arising from the affine Grassmannian - _id: 34b2c9cb-11ca-11ed-8bc3-a50ba74ca4a3 grant_number: P35847 name: Geometry of the tip of the global nilpotent cone publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria publisher_comment: "For open access purposes, the author has applied a CC BY public copyright\r\nlicense to any author-accepted manuscript version arising from this submission." related_material: record: - id: '21751' relation: part_of_dissertation status: public - id: '22693' relation: part_of_dissertation status: public status: public supervisor: - first_name: Tamás full_name: Hausel, Tamás id: 4A0666D8-F248-11E8-B48F-1D18A9856A87 last_name: Hausel orcid: 0000-0002-9582-2634 title: Equivariant K-theory of affine Grassmannians in representation theory and arithmetic 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: '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-09-14T07:08:54Z 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 fulldoi: https://doi.org/10.15479/AT-ISTA-21863 has_accepted_license: '1' keyword: - Superconducting qubits - Quantum optics - Single photons and quantum effects - Nonlinear optics language: - iso: eng 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: '22745' acknowledgement: "This research was supported by the Scientific Service Units of Institute of Science and\r\nTechnology Austria through resources provided by the Lab Support Facility and Electron\r\nMicroscopy Facility at ISTA. Monoclonal Antibody Facility at Max Perutz laboratories are\r\nacknowledged for raising anti-pSer1022 MDA5 antibody. Proteomics core facility CEITEC MUNI\r\nBrno, namely David Pospíšil, are acknowledged for their help with measuring MS data as well\r\nas help with interpreting them and the introduction into MS data analysis. CIISB, Instruct-CZ\r\nCentre of Instruct-ERIC EU consortium, funded by MEYS CR infrastructure project LM2023042,\r\nis gratefully acknowledged for the financial support of the measurements at the CEITEC\r\nProteomics Core Facility. Computational resources were provided by the e-INFRA CZ project\r\n(ID:90254), supported by MEYS CR.\r\nThis work was supported by the Austrian Science Fund (FWF) grant F8003-B RNA-DECO:\r\nDecorating RNA for a purpose (10.55776/F80)." alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: David full_name: Michalik, David id: B9577E20-AA38-11E9-AC9A-0930E6697425 last_name: Michalik citation: ama: Michalik D. Mechanistic insights into MDA5 selectivity and regulation. 2026. doi:10.15479/AT-ISTA-22745 apa: Michalik, D. (2026). Mechanistic insights into MDA5 selectivity and regulation. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-22745 chicago: Michalik, David. “Mechanistic Insights into MDA5 Selectivity and Regulation.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-22745. ieee: D. Michalik, “Mechanistic insights into MDA5 selectivity and regulation,” Institute of Science and Technology Austria, 2026. ista: Michalik D. 2026. Mechanistic insights into MDA5 selectivity and regulation. Institute of Science and Technology Austria. mla: Michalik, David. Mechanistic Insights into MDA5 Selectivity and Regulation. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-22745. short: D. Michalik, Mechanistic Insights into MDA5 Selectivity and Regulation, Institute of Science and Technology Austria, 2026. corr_author: '1' date_created: 2026-08-21T09:29:34Z date_published: 2026-08-21T00:00:00Z date_updated: 2026-09-14T06:54:50Z day: '21' ddc: - '572' degree_awarded: PhD department: - _id: CaBe - _id: GradSch doi: 10.15479/AT-ISTA-22745 doi_confirm: '1' file: - access_level: closed checksum: cd80d2076a5155ab6a12ec0b05adbee5 content_type: application/pdf creator: cchlebak date_created: 2026-08-26T08:46:02Z date_updated: 2026-08-26T08:46:02Z embargo: 2027-08-26 embargo_to: open_access file_id: '22763' file_name: 2026_Michalik_David_Thesis.pdf file_size: 13624837 relation: main_file - access_level: closed checksum: 16ae6cd206ba0eb04ce8a7198042f24f content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document creator: cchlebak date_created: 2026-08-26T08:46:35Z date_updated: 2026-08-26T08:46:35Z file_id: '22764' file_name: 2026_Michalik_David_Thesis.docx file_size: 20499216 relation: source_file file_date_updated: 2026-08-26T08:46:35Z fulldoi: https://doi.org/10.15479/AT-ISTA-22745 has_accepted_license: '1' language: - iso: eng month: '08' oa_version: Published Version page: '182' project: - _id: 8dc144d4-16d5-11f0-9cad-9d9e86aea1f7 grant_number: F8003 name: 'RNAdeco: decorating RNA for a purpose/ P03- Roles of A-to-I editing in dsRNA recognition' publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria status: public supervisor: - first_name: Carrie A full_name: Bernecky, Carrie A id: 2CB9DFE2-F248-11E8-B48F-1D18A9856A87 last_name: Bernecky orcid: 0000-0003-0893-7036 title: Mechanistic insights into MDA5 selectivity and regulation 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: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2026' ... --- OA_place: publisher _id: '22735' acknowledged_ssus: - _id: M-Shop - _id: PreCl - _id: Bio acknowledgement: "This project was supported by the following funding agencies: ERC under the European\r\nUnion's Horizon 2020 research and innovation program (ERC Advanced Grants No 692692\r\n“GIANTSYN” and 101199096 “CA3-SYNGRAM” to P.J.), the Fonds zur Förderung der\r\nwissenschaftlichen Forschung (P 36232-B, stand-alone grant, PAT 4178023, principal\r\ninvestigator project, and 10.55776/CoE 16 “GABA neurons” to P.J.), and the European Union’s\r\nHorizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant\r\nagreement (No 101034413, to K.L.)." alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Peipeng full_name: Lin, Peipeng id: 7E3060D0-A92C-11E9-A326-26C8E5697425 last_name: Lin citation: ama: 'Lin P. Calibrating the teacher synapse: Mechanisms and functional significance of presynaptic inhibition at hippocampal mossy fiber synapses. 2026. doi:10.15479/AT-ISTA-22735' apa: 'Lin, P. (2026). Calibrating the teacher synapse: Mechanisms and functional significance of presynaptic inhibition at hippocampal mossy fiber synapses. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-22735' chicago: 'Lin, Peipeng. “Calibrating the Teacher Synapse: Mechanisms and Functional Significance of Presynaptic Inhibition at Hippocampal Mossy Fiber Synapses.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-22735.' ieee: 'P. Lin, “Calibrating the teacher synapse: Mechanisms and functional significance of presynaptic inhibition at hippocampal mossy fiber synapses,” Institute of Science and Technology Austria, 2026.' ista: 'Lin P. 2026. Calibrating the teacher synapse: Mechanisms and functional significance of presynaptic inhibition at hippocampal mossy fiber synapses. Institute of Science and Technology Austria.' mla: 'Lin, Peipeng. Calibrating the Teacher Synapse: Mechanisms and Functional Significance of Presynaptic Inhibition at Hippocampal Mossy Fiber Synapses. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-22735.' short: 'P. Lin, Calibrating the Teacher Synapse: Mechanisms and Functional Significance of Presynaptic Inhibition at Hippocampal Mossy Fiber Synapses, Institute of Science and Technology Austria, 2026.' corr_author: '1' das_tickbox: '0' date_created: 2026-08-18T15:23:41Z date_published: 2026-08-25T00:00:00Z date_updated: 2026-09-16T07:39:42Z day: '25' ddc: - '571' - '573' degree_awarded: PhD department: - _id: GradSch - _id: PeJo doi: 10.15479/AT-ISTA-22735 doi_confirm: '1' ec_funded: 1 file: - access_level: closed checksum: 13cc7ead72aad90a134f310b531c73cd content_type: application/pdf creator: plin date_created: 2026-08-26T10:09:48Z date_updated: 2026-08-26T10:09:48Z embargo: 2027-09-01 embargo_to: open_access file_id: '22765' file_name: 2026_Lin_Peipeng_Thesis.pdf file_size: 6376229 relation: main_file - access_level: closed checksum: 8c9c1445a7df284377be1a8c9dadd7c5 content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document creator: plin date_created: 2026-08-26T10:09:53Z date_updated: 2026-08-26T10:09:53Z file_id: '22766' file_name: 2026_Lin_Peipeng_Thesis.docx file_size: 17681883 relation: source_file file_date_updated: 2026-08-26T10:09:53Z fulldoi: https://doi.org/10.15479/AT-ISTA-22735 has_accepted_license: '1' language: - iso: eng month: '08' oa_version: Published Version page: '88' project: - _id: 25B7EB9E-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '692692' name: Biophysics and circuit function of a giant cortical glutamatergic synapse - _id: e62b56fe-ab3c-11f0-94c7-d181dd352b3b grant_number: '101199096' name: Synaptic mechanisms of engram storage and retrieval in CA3 hippocampal microcircuits - _id: bd88be38-d553-11ed-ba76-81d5a70a6ef5 grant_number: P36232 name: Mechanisms of GABA release in hippocampal circuits - _id: 8d9195e9-16d5-11f0-9cad-d075be887a1e grant_number: PAT 4178023 name: Synaptic networks of human brain - _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c call_identifier: H2020 grant_number: '101034413' name: 'IST-BRIDGE: International postdoctoral program' - _id: 0a6c8641-b036-11f1-bacf-e4eec62b5bb4 grant_number: COE16 name: Neuronal circuits in health and disease (Jonas) publication_identifier: isbn: - 978-3-99078-088-6 issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria researchdata_availability: upon request status: public supervisor: - first_name: Peter M full_name: Jonas, Peter M id: 353C1B58-F248-11E8-B48F-1D18A9856A87 last_name: Jonas orcid: 0000-0001-5001-4804 supplementarymaterial: yes title: 'Calibrating the teacher synapse: Mechanisms and functional significance of presynaptic inhibition at hippocampal mossy fiber synapses' 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: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2026' ... --- OA_embargo: '18' OA_place: publisher _id: '22775' acknowledged_ssus: - _id: Bio - _id: PreCl - _id: M-Shop - _id: LifeSc alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Silvia full_name: Jamrichova, Silvia id: F0EA6804-AA27-11E9-8613-C0F7E5697425 last_name: Jamrichova orcid: 0009-0003-9929-8221 citation: ama: Jamrichova S. Timing and strength of synaptic transmission at hippocampal mossy fiber synapses in mice and humans. 2026. doi:10.15479/AT-ISTA-22775 apa: Jamrichova, S. (2026). Timing and strength of synaptic transmission at hippocampal mossy fiber synapses in mice and humans. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-22775 chicago: Jamrichova, Silvia. “Timing and Strength of Synaptic Transmission at Hippocampal Mossy Fiber Synapses in Mice and Humans.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-22775. ieee: S. Jamrichova, “Timing and strength of synaptic transmission at hippocampal mossy fiber synapses in mice and humans,” Institute of Science and Technology Austria, 2026. ista: Jamrichova S. 2026. Timing and strength of synaptic transmission at hippocampal mossy fiber synapses in mice and humans. Institute of Science and Technology Austria. mla: Jamrichova, Silvia. Timing and Strength of Synaptic Transmission at Hippocampal Mossy Fiber Synapses in Mice and Humans. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-22775. short: S. Jamrichova, Timing and Strength of Synaptic Transmission at Hippocampal Mossy Fiber Synapses in Mice and Humans, Institute of Science and Technology Austria, 2026. corr_author: '1' date_created: 2026-09-03T08:06:58Z date_published: 2026-09-03T00:00:00Z date_updated: 2026-09-16T08:13:41Z day: '03' ddc: - '570' degree_awarded: PhD department: - _id: GradSch - _id: PeJo doi: 10.15479/AT-ISTA-22775 doi_confirm: '1' ec_funded: 1 file: - access_level: closed checksum: d9a6fd39a0b6343c4473901f9323f127 content_type: application/pdf creator: cchlebak date_created: 2026-09-08T09:01:22Z date_updated: 2026-09-08T09:01:22Z embargo: 2028-03-08 embargo_to: open_access file_id: '22850' file_name: 2026_Jamrichova_Silvia_Thesis.pdf file_size: 8968078 relation: main_file - access_level: closed checksum: 02b728c9157f88e392b69e94877889f0 content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document creator: cchlebak date_created: 2026-09-08T09:02:52Z date_updated: 2026-09-08T09:02:52Z file_id: '22851' file_name: 2026_Jamrichova_Silvia_Thesis.docx file_size: 17338630 relation: source_file file_date_updated: 2026-09-08T09:02:52Z fulldoi: https://doi.org/10.15479/AT-ISTA-22775 has_accepted_license: '1' language: - iso: eng month: '09' oa_version: Published Version page: '153' project: - _id: 25B7EB9E-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '692692' name: Biophysics and circuit function of a giant cortical glutamatergic synapse - _id: e62b56fe-ab3c-11f0-94c7-d181dd352b3b grant_number: '101199096' name: Synaptic mechanisms of engram storage and retrieval in CA3 hippocampal microcircuits - _id: bd88be38-d553-11ed-ba76-81d5a70a6ef5 grant_number: P36232 name: Mechanisms of GABA release in hippocampal circuits - _id: 8d9195e9-16d5-11f0-9cad-d075be887a1e grant_number: PAT 4178023 name: Synaptic networks of human brain - _id: 25C5A090-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z00312 name: Synaptic communication in neuronal microcircuits - _id: 0a6c8641-b036-11f1-bacf-e4eec62b5bb4 grant_number: COE16 name: Neuronal circuits in health and disease (Jonas) publication_identifier: isbn: - 978-3-99078-085-5 issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria researchdata_availability: upon request status: public supervisor: - first_name: Peter M full_name: Jonas, Peter M id: 353C1B58-F248-11E8-B48F-1D18A9856A87 last_name: Jonas orcid: 0000-0001-5001-4804 supplementarymaterial: no title: Timing and strength of synaptic transmission at hippocampal mossy fiber synapses in mice and humans 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: '22808' abstract: - lang: eng text: "As automated decision-makers have become ubiquitous in many domains of life,\r\ntheir decisions have become increasingly consequential. Recent years have shown\r\nthat such systems can exhibit discriminatory behaviour against individuals and\r\nsocial groups alike, thereby amplifying existing biases and entrenching\r\nsocio-economic disparities over time. Algorithmic fairness addresses this\r\nproblem by developing methods to quantify and mitigate unfair behaviour.\r\nHowever, much of the existing literature studies fairness in a static\r\npre-deployment setting and, therefore, neglects that automated decision-makers are\r\noften deployed in dynamic environments, where their behaviour and the\r\npopulations they affect may change over time.\r\n\r\nThis thesis addresses this gap through the lens of runtime verification.\r\nInstead of treating fairness as a property of a classifier together with a fixed\r\ninput distribution, it reframes fairness as a property of the interaction trace\r\nbetween the decision-maker and its deployment environment. To evaluate such\r\nsequential fairness properties, the thesis develops runtime monitors that\r\nobserve the evolving interaction between the system and the environment and\r\nissue verdicts after each new observation. Because, these monitors are designed to detect\r\nunfair behaviour during deployment, they complement fair training,\r\nauditing, verification, and enforcement by providing an additional layer of mathematically rigorous fairness assurance.\r\n\r\nIn summary, the thesis develops quantitative, trace-based analogues of\r\nclassical group and individual fairness measures and constructs monitors for\r\nthem. This includes monitors for long-run group fairness over Markovian traces,\r\nfor the time-varying welfare of a changing population in a dynamical system, and\r\nfor the individual fairness of an arbitrary system generating a trace of inputs\r\nand outputs. To achieve this, the monitors combine ideas from runtime\r\nverification, sequential statistics, and nearest-neighbour search. In the\r\ngroup-fairness settings, monitoring is primarily a sequential statistical\r\nestimation problem: the monitor must construct statistically sound interval\r\nestimates of fairness values from dependent and partially observed interactions.\r\nIn the individual-fairness setting, the main challenge is computational\r\nefficiency: the monitor must detect individual fairness violations by efficiently comparing the\r\ncurrent decision with all previously observed decisions.\r\n" acknowledgement: "This work was supported in part by the ERC-2020-AdG 101020093 (VAMOS).\r\n" alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Konstantin full_name: Kueffner, Konstantin id: 8121a2d0-dc85-11ea-9058-af578f3b4515 last_name: Kueffner orcid: 0000-0001-8974-2542 citation: ama: Kueffner K. Monitoring algorithmic fairness in sequential decision making. 2026. doi:10.15479/AT-ISTA-22808 apa: Kueffner, K. (2026). Monitoring algorithmic fairness in sequential decision making. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-22808 chicago: Kueffner, Konstantin. “Monitoring Algorithmic Fairness in Sequential Decision Making.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-22808. ieee: K. Kueffner, “Monitoring algorithmic fairness in sequential decision making,” Institute of Science and Technology Austria, 2026. ista: Kueffner K. 2026. Monitoring algorithmic fairness in sequential decision making. Institute of Science and Technology Austria. mla: Kueffner, Konstantin. Monitoring Algorithmic Fairness in Sequential Decision Making. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-22808. short: K. Kueffner, Monitoring Algorithmic Fairness in Sequential Decision Making, Institute of Science and Technology Austria, 2026. corr_author: '1' date_created: 2026-09-05T15:59:19Z date_published: 2026-09-07T00:00:00Z date_updated: 2026-09-18T07:41:29Z day: '07' ddc: - '000' degree_awarded: PhD department: - _id: GradSch - _id: ToHe doi: 10.15479/AT-ISTA-22808 doi_confirm: '1' ec_funded: 1 file: - access_level: closed checksum: 716ce44a6ed9a727f231bdebdeecc741 content_type: application/zip creator: kkueffne date_created: 2026-09-11T07:32:13Z date_updated: 2026-09-11T07:32:13Z file_id: '22903' file_name: Thesis_Konstantin_Kueffner-3.zip file_size: 26356903 relation: source_file - access_level: open_access checksum: 77082e90b8330fb46f585843840c5d5c content_type: application/pdf creator: kkueffne date_created: 2026-09-11T07:32:17Z date_updated: 2026-09-11T07:32:17Z file_id: '22904' file_name: Thesis_Konstantin_Kueffner-2.pdf file_size: 10051715 relation: main_file file_date_updated: 2026-09-11T07:32:17Z fulldoi: https://doi.org/10.15479/AT-ISTA-22808 has_accepted_license: '1' language: - iso: eng month: '09' oa: 1 oa_version: Published Version page: '183' project: - _id: 62781420-2b32-11ec-9570-8d9b63373d4d call_identifier: H2020 grant_number: '101020093' name: Vigilant Algorithmic Monitoring of Software publication_identifier: isbn: - 978-3-99078-089-3 issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '13310' relation: part_of_dissertation status: public - id: '14454' relation: part_of_dissertation status: public - id: '20292' relation: part_of_dissertation status: public - id: '21090' relation: part_of_dissertation status: public - id: '13228' relation: part_of_dissertation status: public status: public supervisor: - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000-0002-2985-7724 title: Monitoring algorithmic fairness in sequential decision making 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: '22873' acknowledged_ssus: - _id: ScienComp - _id: CampIT acknowledgement: I acknowledge funding by the Austrian Science Fund (FWF) [10.55776/PAT8537123]. alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Andreas full_name: Ehrmann, Andreas id: eaa689ed-f6e0-11ea-865d-bd98cbcf83c2 last_name: Ehrmann orcid: 0000-0002-0997-5678 citation: ama: 'Ehrmann A. Biological functionality without biochemistry: Designing nanomachines for target behavior. 2026. doi:10.15479/AT-ISTA-22873' apa: 'Ehrmann, A. (2026). Biological functionality without biochemistry: Designing nanomachines for target behavior. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-22873' chicago: 'Ehrmann, Andreas. “Biological Functionality without Biochemistry: Designing Nanomachines for Target Behavior.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-22873.' ieee: 'A. Ehrmann, “Biological functionality without biochemistry: Designing nanomachines for target behavior,” Institute of Science and Technology Austria, 2026.' ista: 'Ehrmann A. 2026. Biological functionality without biochemistry: Designing nanomachines for target behavior. Institute of Science and Technology Austria.' mla: 'Ehrmann, Andreas. Biological Functionality without Biochemistry: Designing Nanomachines for Target Behavior. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-22873.' short: 'A. Ehrmann, Biological Functionality without Biochemistry: Designing Nanomachines for Target Behavior, Institute of Science and Technology Austria, 2026.' corr_author: '1' das_tickbox: '0' date_created: 2026-09-09T12:18:24Z date_published: 2026-09-04T00:00:00Z date_updated: 2026-09-18T11:28:29Z day: '04' ddc: - '530' - '600' - '621' - '004' - '005' degree_awarded: PhD department: - _id: GradSch - _id: CaGo - _id: EdHa doi: 10.15479/AT-ISTA-22873 doi_confirm: '1' file: - access_level: closed checksum: a5e3d79e0e5f3f4fb3c414e48116dc9e content_type: application/pdf creator: aehrmann date_created: 2026-09-11T07:23:57Z date_updated: 2026-09-17T08:59:39Z embargo: 2027-01-15 embargo_to: open_access file_id: '22901' file_name: 2026_Ehrmann_Andreas_Thesis.pdf file_size: 14782662 relation: main_file - access_level: closed checksum: 0235b9c52fee0c97f402f1c3d4efc1eb content_type: application/zip creator: aehrmann date_created: 2026-09-11T07:24:14Z date_updated: 2026-09-11T07:24:14Z description: All LaTeX files to compile my PhD Thesis. file_id: '22902' file_name: thesis_latex_files.zip file_size: 155228 relation: source_file file_date_updated: 2026-09-17T08:59:39Z fulldoi: https://doi.org/10.15479/AT-ISTA-22873 has_accepted_license: '1' keyword: - PhD Thesis - functional nanomachines - biological functionality - nanotechnology - energy delivery - target behavior - dynamics - design principles - optimization - differentiable statistical physics - machine learning language: - iso: eng month: '09' oa_version: Published Version page: '168' project: - _id: 90a98bb5-16d5-11f0-9cad-9675f3f8015d grant_number: PAT 8537123 name: Functional bio-inspired nanomachines from sticky colloids publication_identifier: isbn: - 978-3-99078-092-3 issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '22893' relation: part_of_dissertation status: public - id: '22892' relation: part_of_dissertation status: public researchdata_availability: upon request status: public supervisor: - first_name: Carl Peter full_name: Goodrich, Carl Peter id: EB352CD2-F68A-11E9-89C5-A432E6697425 last_name: Goodrich orcid: 0000-0002-1307-5074 - first_name: Edouard B full_name: Hannezo, Edouard B id: 3A9DB764-F248-11E8-B48F-1D18A9856A87 last_name: Hannezo orcid: 0000-0001-6005-1561 supplementarymaterial: not applicable title: 'Biological functionality without biochemistry: Designing nanomachines for target behavior' 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: '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-10-01T09:29:03Z day: '09' ddc: - '005' degree_awarded: PhD department: - _id: GradSch - _id: ChLa doi: 10.15479/AT-ISTA-21198 doi_confirm: '1' 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 fulldoi: https://doi.org/10.15479/AT-ISTA-21198 has_accepted_license: '1' language: - iso: eng month: '02' oa: 1 oa_version: Published Version page: '158' project: - _id: d8f03aaa-b035-11f1-8588-d5147fa879e0 grant_number: COE12 name: Bilateral Artificial Intelligence (Lampert) publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '21207' relation: part_of_dissertation status: public - id: '20819' relation: part_of_dissertation status: public - id: '17411' relation: part_of_dissertation status: public - id: '18120' 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: 2DF688A6-F248-11E8-B48F-1D18A9856A87 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-10-01T09:32:47Z 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 fulldoi: https://doi.org/10.15479/AT-ISTA-21854 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: '21858' relation: part_of_dissertation status: public - id: '21859' relation: part_of_dissertation status: public - id: '21857' relation: part_of_dissertation status: public - id: '18121' 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: '23005' abstract: - lang: eng text: When a Leidenfrost droplet floats on its own vapor layer, the interplay between vapor pressure, surface tension, and gravity determines its shape, and in the stable regime the underside of the droplet exhibits curvature inversion. Using interferometric imaging, we observe a different behavior for a levitated hydrogel sphere. Curvature inversion appears briefly after deposition, but the continuous vaporization process removes this feature, leading first to an oscillatory regime and eventually to a steady state without curvature inversion. We demonstrate the essential role of vaporization in shaping the hydrogel underbelly, where direct mass loss has a stronger influence than the balance between vapor pressure and elastic forces. acknowledged_ssus: - _id: M-Shop alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Vicente L full_name: Diaz Melian, Vicente L id: b6798902-eea0-11ea-9cbc-a8e14286c631 last_name: Diaz Melian citation: ama: Diaz Melian VL. The morphology underneath a levitated hydrogel sphere. 2026. doi:10.15479/AT-ISTA-23005 apa: Diaz Melian, V. L. (2026). The morphology underneath a levitated hydrogel sphere. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-23005 chicago: Diaz Melian, Vicente L. “The Morphology underneath a Levitated Hydrogel Sphere.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-23005. ieee: V. L. Diaz Melian, “The morphology underneath a levitated hydrogel sphere,” Institute of Science and Technology Austria, 2026. ista: Diaz Melian VL. 2026. The morphology underneath a levitated hydrogel sphere. Institute of Science and Technology Austria. mla: Diaz Melian, Vicente L. The Morphology underneath a Levitated Hydrogel Sphere. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-23005. short: V.L. Diaz Melian, The Morphology underneath a Levitated Hydrogel Sphere, Institute of Science and Technology Austria, 2026. corr_author: '1' date_created: 2026-09-28T17:40:23Z date_published: 2026-09-29T00:00:00Z date_updated: 2026-10-02T08:44:47Z day: '29' ddc: - '530' - '530' - '530' degree_awarded: PhD department: - _id: GradSch - _id: ScWa doi: 10.15479/AT-ISTA-23005 doi_confirm: '1' file: - access_level: open_access checksum: f339bdee0a6925573687de928ca525dc content_type: application/pdf creator: vdiazmel date_created: 2026-09-29T09:22:27Z date_updated: 2026-09-29T09:56:46Z file_id: '23007' file_name: 2026_diaz-melian_vicente_Thesis.pdf file_size: 8463804 relation: main_file - access_level: closed checksum: 5b17122895fc419bfb620e23bfe7780a content_type: application/zip creator: vdiazmel date_created: 2026-09-29T09:49:32Z date_updated: 2026-09-29T09:56:46Z file_id: '23008' file_name: 2026_diaz-melian_vicente_Thesis.zip file_size: 4028974886 relation: source_file file_date_updated: 2026-09-29T09:56:46Z fulldoi: https://doi.org/10.15479/AT-ISTA-23005 has_accepted_license: '1' language: - iso: eng month: '09' oa: 1 oa_version: Published Version page: '114' publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '14514' relation: part_of_dissertation status: public - id: '21982' relation: part_of_dissertation status: public researchdata_availability: yes status: public supervisor: - first_name: Scott R full_name: Waitukaitis, Scott R id: 3A1FFC16-F248-11E8-B48F-1D18A9856A87 last_name: Waitukaitis orcid: 0000-0002-2299-3176 supplementarymaterial: yes title: The morphology underneath a levitated hydrogel sphere 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' ...