[{"ddc":["570"],"year":"2026","publication_status":"published","article_processing_charge":"No","date_published":"2026-01-14T00:00:00Z","alternative_title":["ISTA Master’s Thesis"],"file_date_updated":"2026-01-28T12:38:19Z","has_accepted_license":"1","acknowledged_ssus":[{"_id":"LifeSc"},{"_id":"Bio"}],"fulldoi":"https://doi.org/10.15479/AT-ISTA-20964","degree_awarded":"MS","corr_author":"1","day":"14","month":"01","department":[{"_id":"GradSch"},{"_id":"JiFr"}],"publisher":"Institute of Science and Technology Austria","file":[{"relation":"main_file","creator":"dvladimi","access_level":"closed","date_created":"2026-01-21T14:12:13Z","checksum":"812857b2fbe3f6113bef22fd04bccd3e","file_size":2867531,"file_name":"2026_Vladimirtsev_Dmitrii_Thesis.pdf","content_type":"application/pdf","embargo":"2027-01-01","date_updated":"2026-01-21T14:12:13Z","file_id":"21033","embargo_to":"open_access"},{"file_id":"21034","file_size":25023066,"file_name":"Source Files.zip","content_type":"application/x-zip-compressed","date_updated":"2026-01-28T12:38:19Z","date_created":"2026-01-21T14:41:58Z","checksum":"2b969f97f8d7461bea3d255f48c2219c","creator":"dvladimi","relation":"source_file","access_level":"closed"}],"doi":"10.15479/AT-ISTA-20964","date_created":"2026-01-09T09:22:48Z","status":"public","author":[{"full_name":"Vladimirtsev, Dmitrii","first_name":"Dmitrii","last_name":"Vladimirtsev","id":"60466724-5355-11ee-ae5a-fa55e8f99c3d"}],"_id":"20964","title":"Armadillo repeat only proteins are master regulators of plant cyclic-nucleotide gated channels","oa_version":"Published Version","type":"dissertation","supervisor":[{"last_name":"Friml","first_name":"Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jiří","orcid":"0000-0002-8302-7596"}],"project":[{"grant_number":"101142681","_id":"8f347782-16d5-11f0-9cad-8c19706ee739","name":"Cyclic nucleotides as second messengers in plants"}],"page":"22","citation":{"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.","ama":"Vladimirtsev D. Armadillo repeat only proteins are master regulators of plant cyclic-nucleotide gated channels. 2026. doi: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.","short":"D. Vladimirtsev, Armadillo Repeat Only Proteins Are Master Regulators of Plant Cyclic-Nucleotide Gated Channels, Institute of Science and Technology Austria, 2026.","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.","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"},"related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"20982"}]},"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_updated":"2026-04-07T11:41:44Z","publication_identifier":{"issn":["2791-4585"]},"OA_place":"publisher","language":[{"iso":"eng"}]},{"publication_identifier":{"issn":["2791-4585"]},"ec_funded":1,"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","OA_place":"repository","language":[{"iso":"eng"}],"date_created":"2026-03-05T15:20:47Z","author":[{"orcid":"0009-0005-0820-1696","full_name":"Karimi, Mahyar","last_name":"Karimi","first_name":"Mahyar","id":"6e5417ba-5355-11ee-ae5a-94c2e510b26b"}],"status":"public","title":"Privacy-preserving runtime verification","_id":"21401","abstract":[{"text":"Runtime verification offers scalable solutions to improve the safety and reliability of systems. However, systems that require verification or monitoring by a third party to ensure compliance with a specification might contain sensitive information, causing privacy concerns when usual runtime verification approaches are used. Privacy is compromised if protected information about the system, or sensitive data that is processed by the system, is revealed. In addition, revealing the specification being monitored may undermine the essence of third-party verification.\r\n\r\nIn this thesis, we propose a protocol for privacy-preserving runtime verification of systems against formal sequential specifications. We develop the protocol in two steps. In the first step, the monitor verifies whether the system satisfies the specification without learning anything else, though both parties are aware of the specification. In the second step, we extend the protocol to ensure that the system remains oblivious to the monitored specification, while the monitor learns only whether the system satisfies the specification and nothing more. Our protocol adapts and improves existing techniques used in cryptography, and more specifically, multi-party computation.\r\n\r\nThe sequential specification defines the observation step of the monitor, whose granularity depends on the situation (e.g., banks may be monitored on a daily basis). Our protocol exchanges a single message per observation step, after an initialization phase. This design minimizes communication overhead, enabling relatively lightweight privacy-preserving monitoring. We implement our approach for monitoring specifications described by register automata and evaluate it experimentally.\r\n","lang":"eng"}],"oa_version":"Published Version","type":"dissertation","supervisor":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A"}],"citation":{"ista":"Karimi M. 2026. Privacy-preserving runtime verification. Institute of Science and Technology Austria.","short":"M. Karimi, Privacy-Preserving Runtime Verification, Institute of Science and Technology Austria, 2026.","ieee":"M. Karimi, “Privacy-preserving runtime verification,” Institute of Science and Technology Austria, 2026.","mla":"Karimi, Mahyar. Privacy-Preserving Runtime Verification. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-21401.","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."},"page":"60","project":[{"grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"},{"name":"Security and Privacy by Design for Complex Systems","_id":"34a4ce89-11ca-11ed-8bc3-8cc37fb6e11f","grant_number":"F8512"}],"related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"21020"}]},"date_updated":"2026-03-13T13:37:20Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","corr_author":"1","oa":1,"day":"05","publisher":"Institute of Science and Technology Austria","month":"03","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"doi":"10.15479/AT-ISTA-21401","file":[{"access_level":"open_access","relation":"main_file","creator":"mkarimi","checksum":"3f49f05c9d123e14d7adb73d3bc50fe2","date_created":"2026-03-06T14:06:25Z","file_name":"2026_Karimi_Mahyar_Thesis.pdf","date_updated":"2026-03-10T15:20:09Z","content_type":"application/pdf","file_size":766048,"file_id":"21404"},{"access_level":"closed","relation":"source_file","creator":"mkarimi","date_created":"2026-03-06T14:06:25Z","checksum":"8fb9db4b4187e26443369a993427a5ff","file_name":"2026_Karimi_Mahyar_Thesis_src.zip","content_type":"application/zip","date_updated":"2026-03-06T14:06:25Z","file_size":1243394,"file_id":"21405"}],"ddc":["000"],"publication_status":"published","year":"2026","article_processing_charge":"No","keyword":["Privacy-preserving verification","Runtime verification","Monitoring","Reactive functionalities","Cryptographic protocols"],"has_accepted_license":"1","file_date_updated":"2026-03-10T15:20:09Z","alternative_title":["ISTA Master’s Thesis"],"date_published":"2026-03-05T00:00:00Z","degree_awarded":"MS","fulldoi":"https://doi.org/10.15479/AT-ISTA-21401"},{"degree_awarded":"PhD","fulldoi":"https://doi.org/10.15479/AT-ISTA-21651","article_processing_charge":"No","has_accepted_license":"1","alternative_title":["ISTA Thesis"],"file_date_updated":"2026-04-15T07:37:25Z","date_published":"2026-03-04T00:00:00Z","publication_status":"published","year":"2026","ddc":["000"],"tmp":{"image":"/images/cc_by_nc_sa.png","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","short":"CC BY-NC-SA (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode"},"doi":"10.15479/AT-ISTA-21651","file":[{"creator":"mbaig","relation":"source_file","access_level":"closed","date_created":"2026-04-03T17:28:48Z","checksum":"c3986dba90653dac97adba662ebff238","file_size":139353434,"file_name":"PhD-Thesis-Mirza-Ahad-Baig - Library Submission.zip","content_type":"application/x-zip-compressed","date_updated":"2026-04-13T08:24:13Z","file_id":"21655"},{"file_id":"21656","content_type":"application/pdf","date_updated":"2026-04-15T07:37:25Z","file_name":"2026_Baig_Mirza_Ahad_Thesis.pdf","file_size":1942037,"checksum":"292a5989262521f7c145a109d1f348cb","date_created":"2026-04-03T17:29:30Z","access_level":"open_access","creator":"mbaig","relation":"main_file"}],"publisher":"Institute of Science and Technology Austria","month":"03","department":[{"_id":"GradSch"},{"_id":"KrPi"}],"oa":1,"corr_author":"1","day":"04","date_updated":"2026-04-15T08:45:19Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"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.","short":"M.A. Baig, On Secure Chain Selection Rules from Physical Resources in a Permissionless Setting, Institute of Science and Technology Austria, 2026.","ama":"Baig MA. On secure chain selection rules from physical resources in a permissionless setting. 2026. doi:10.15479/AT-ISTA-21651","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."},"license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","related_material":{"record":[{"id":"21134","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"20587"}]},"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."}],"type":"dissertation","oa_version":"Published Version","supervisor":[{"full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"}],"author":[{"id":"3EDE6DE4-AA5A-11E9-986D-341CE6697425","first_name":"Mirza Ahad","last_name":"Baig","full_name":"Baig, Mirza Ahad"}],"date_created":"2026-04-02T09:31:34Z","status":"public","title":"On secure chain selection rules from physical resources in a permissionless setting","_id":"21651","language":[{"iso":"eng"}],"OA_place":"publisher","publication_identifier":{"isbn":["978-3-99078-078-7"],"issn":["2663-337X"]}},{"date_updated":"2026-06-12T12:43:35Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"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.","short":"K. Khudiakova, How Epistasis and Purifying Selection Shape Genetic Diversity, Institute of Science and Technology Austria, 2026.","mla":"Khudiakova, Kseniia. How Epistasis and Purifying Selection Shape Genetic Diversity. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-21918.","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."},"page":"89","project":[{"_id":"256E75B8-B435-11E9-9278-68D0E5697425","name":"Optimal Transport and Stochastic Dynamics","call_identifier":"H2020","grant_number":"716117"},{"name":"The impact of deleterious mutations on small populations","_id":"34d33d68-11ca-11ed-8bc3-ec13763c0ca8","grant_number":"26293"},{"name":"Taming Complexity in Partial Differential Systems","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","grant_number":"F6504"}],"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","related_material":{"record":[{"relation":"part_of_dissertation","id":"11447","status":"public"},{"id":"12513","relation":"part_of_dissertation","status":"deleted"},{"status":"public","relation":"part_of_dissertation","id":"21967"},{"status":"public","relation":"part_of_dissertation","id":"21968"}]},"supervisor":[{"full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","last_name":"Barton"},{"orcid":"0000-0002-0845-1338","full_name":"Maas, Jan","first_name":"Jan","last_name":"Maas","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87"}],"type":"dissertation","oa_version":"Published Version","author":[{"first_name":"Kseniia","last_name":"Khudiakova","id":"4E6DC800-AE37-11E9-AC72-31CAE5697425","orcid":"0000-0002-6246-1465","full_name":"Khudiakova, Kseniia"}],"status":"public","date_created":"2026-05-27T06:26:08Z","title":"How epistasis and purifying selection shape genetic diversity","_id":"21918","language":[{"iso":"eng"}],"OA_place":"publisher","ec_funded":1,"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.","publication_identifier":{"issn":["2663-337X"]},"acknowledged_ssus":[{"_id":"ScienComp"}],"degree_awarded":"PhD","fulldoi":"https://doi.org/10.15479/AT-ISTA-21918","article_processing_charge":"No","has_accepted_license":"1","date_published":"2026-06-07T00:00:00Z","file_date_updated":"2026-06-11T12:14:53Z","alternative_title":["ISTA Thesis"],"publication_status":"published","year":"2026","tmp":{"image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"ddc":["576"],"doi":"10.15479/AT-ISTA-21918","file":[{"checksum":"0cff64ae74f0f9f2d7011700c82f700a","date_created":"2026-06-09T08:34:38Z","access_level":"closed","creator":"kkhudiak","relation":"source_file","file_id":"21965","file_name":"thesis.zip","content_type":"application/x-zip-compressed","date_updated":"2026-06-09T08:40:48Z","file_size":20549813},{"file_name":"2026_Khudiakova_Ksenia_Thesis.pdf","content_type":"application/pdf","date_updated":"2026-06-11T12:14:53Z","embargo":"2027-06-10","file_size":9387029,"file_id":"21969","embargo_to":"open_access","access_level":"closed","creator":"kkhudiak","relation":"main_file","date_created":"2026-06-09T12:28:51Z","checksum":"547ae42de37cc86894af283f1664dbc8"}],"publisher":"Institute of Science and Technology Austria","department":[{"_id":"GradSch"},{"_id":"NiBa"},{"_id":"JaMa"}],"month":"06","corr_author":"1","day":"07"},{"file":[{"file_name":"2026_Li_Yunzhe_Thesis.pdf","date_updated":"2026-07-14T10:48:45Z","content_type":"application/pdf","file_size":1260717,"file_id":"22337","access_level":"open_access","relation":"main_file","creator":"yli","date_created":"2026-07-14T10:48:45Z","checksum":"8201cb5a427656a41828ecde8a85c04b"},{"checksum":"19ee8461ed77f5b7980fc9461f778b6f","date_created":"2026-07-14T11:07:18Z","creator":"yli","relation":"source_file","access_level":"closed","file_id":"22339","file_size":418752,"content_type":"application/x-zip-compressed","date_updated":"2026-07-20T14:00:33Z","file_name":"2026_Li_Yunzhe_Thesis.zip"}],"doi":"10.15479/AT-ISTA-22255","month":"07","department":[{"_id":"GradSch"},{"_id":"VaKa"}],"publisher":"Institute of Science and Technology Austria","doi_confirm":"1","oa":1,"corr_author":"1","day":"11","acknowledged_ssus":[{"_id":"E-Lib"},{"_id":"CampIT"}],"fulldoi":"https://doi.org/10.15479/AT-ISTA-22255","degree_awarded":"PhD","article_processing_charge":"No","alternative_title":["ISTA Thesis"],"date_published":"2026-07-11T00:00:00Z","file_date_updated":"2026-07-20T14:00:33Z","has_accepted_license":"1","year":"2026","publication_status":"published","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"ddc":["515"],"language":[{"iso":"eng"}],"OA_place":"publisher","ec_funded":1,"publication_identifier":{"issn":["2663-337X"]},"acknowledgement":"The financial support of the ERC grant SPERIG #885707 is gratefully acknowledged.\r\n","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_updated":"2026-07-20T14:58:23Z","project":[{"grant_number":"885707","name":"Spectral rigidity and integrability for billiards and geodesic flows","call_identifier":"H2020","_id":"9B8B92DE-BA93-11EA-9121-9846C619BF3A"}],"page":"131","citation":{"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.","short":"Y. Li, Spectral Rigidity and Nonrigidity of Dynamical Systems, Institute of Science and Technology Austria, 2026.","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.","ama":"Li Y. Spectral rigidity and nonrigidity of dynamical systems. 2026. doi:10.15479/AT-ISTA-22255"},"related_material":{"record":[{"id":"22340","relation":"part_of_dissertation","status":"public"},{"status":"public","id":"22341","relation":"part_of_dissertation"}]},"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"}],"supervisor":[{"orcid":"0000-0002-6051-2628","full_name":"Kaloshin, Vadim","first_name":"Vadim","last_name":"Kaloshin","id":"FE553552-CDE8-11E9-B324-C0EBE5697425"}],"oa_version":"Published Version","type":"dissertation","date_created":"2026-07-08T12:44:31Z","status":"public","author":[{"id":"41cb05d3-f128-11eb-9611-e4e2b3cfba31","last_name":"Li","first_name":"Yunzhe","full_name":"Li, Yunzhe"}],"_id":"22255","title":"Spectral rigidity and nonrigidity of dynamical systems"},{"language":[{"iso":"eng"}],"OA_place":"publisher","acknowledgement":"The research presented in this thesis was funded by the DFG Collaborative Research\r\nCenter TRR 109, ‘Discretization in Geometry and Dynamics’.\r\n","publication_identifier":{"issn":["2663-337X"]},"date_updated":"2026-07-22T06:33:54Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"20260"},{"relation":"part_of_dissertation","id":"21051","status":"public"},{"status":"public","id":"21050","relation":"part_of_dissertation"}]},"page":"122","citation":{"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.","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","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.","ama":"Fillmore CD. Braiding geometry and topology to study shapes and data. 2026. doi: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.","short":"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."},"supervisor":[{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Wagner","first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1494-0568","full_name":"Wagner, Uli"}],"oa_version":"Published Version","type":"dissertation","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."}],"title":"Braiding geometry and topology to study shapes and data","_id":"21021","status":"public","author":[{"last_name":"Fillmore","first_name":"Christopher D","id":"35638A5C-AAC7-11E9-B0BF-5503E6697425","full_name":"Fillmore, Christopher D"}],"date_created":"2026-01-20T21:38:40Z","doi":"10.15479/AT-ISTA-21021","file":[{"file_id":"21046","file_size":55954297,"file_name":"2025_Fillmore_Christopher_Thesis.pdf","date_updated":"2026-01-30T11:40:09Z","content_type":"application/pdf","date_created":"2026-01-26T19:44:46Z","checksum":"4c0889130095c31d4e5088c5b8dfd607","creator":"cfillmor","relation":"main_file","access_level":"open_access"},{"file_size":166080788,"file_name":"Thesis.zip","content_type":"application/x-zip-compressed","date_updated":"2026-01-26T19:46:20Z","file_id":"21047","creator":"cfillmor","relation":"source_file","access_level":"closed","checksum":"d69afb71d82ab98f856886126ee7303a","date_created":"2026-01-26T19:46:20Z"}],"publisher":"Institute of Science and Technology Austria","month":"01","department":[{"_id":"GradSch"},{"_id":"HeEd"},{"_id":"UlWa"}],"day":"21","corr_author":"1","oa":1,"degree_awarded":"PhD","fulldoi":"https://doi.org/10.15479/AT-ISTA-21021","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"ScienComp"}],"has_accepted_license":"1","date_published":"2026-01-21T00:00:00Z","file_date_updated":"2026-01-30T11:40:09Z","alternative_title":["ISTA Thesis"],"article_processing_charge":"No","publication_status":"published","year":"2026","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"ddc":["514","516"]},{"OA_place":"publisher","language":[{"iso":"eng"}],"publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-079-4"]},"acknowledgement":"Funding: Vienna Graduate School on Computational Optimization (FWF), grant DOI: 10.55776/W1260.","related_material":{"record":[{"id":"21144","relation":"part_of_dissertation","status":"public"}]},"citation":{"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.","short":"J. Zapata, Overcoming Degeneracy and Singularity: Techniques for Semidefinite Programs and Homotopy Continuation Endgames, Institute of Science and Technology Austria, 2026.","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.","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."},"page":"89","project":[{"grant_number":"W1260-N35","name":"Vienna Graduate School on Computational Optimization","_id":"9B9290DE-BA93-11EA-9121-9846C619BF3A"}],"date_updated":"2026-07-27T14:30:42Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","title":"Overcoming degeneracy and singularity: Techniques for semidefinite programs and homotopy continuation endgames","_id":"21957","date_created":"2026-06-08T13:29:52Z","status":"public","author":[{"full_name":"Zapata, Jeferson","first_name":"Jeferson","last_name":"Zapata","id":"00223538-AF8F-11E9-A4C7-F729E6697425"}],"supervisor":[{"full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"}],"type":"dissertation","oa_version":"Published Version","abstract":[{"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.","lang":"eng"}],"doi":"10.15479/AT-ISTA-21957","file":[{"file_id":"21958","file_size":40811933,"file_name":"istaustriathesis_JZapata.zip","date_updated":"2026-06-08T13:20:02Z","content_type":"application/zip","checksum":"b11a959e99d3dcf61040282b5c837141","date_created":"2026-06-08T13:20:02Z","creator":"jzapata","relation":"source_file","access_level":"closed"},{"file_id":"21992","file_name":"4_Final_Thesis_JZapata_REX.pdf","date_updated":"2026-06-10T13:33:25Z","content_type":"application/pdf","file_size":2207892,"success":1,"checksum":"edf1e5899b2e31505cd1aa3fe8bd4b7f","date_created":"2026-06-10T13:33:25Z","access_level":"open_access","creator":"jzapata","relation":"main_file"}],"day":"09","corr_author":"1","oa":1,"doi_confirm":"1","publisher":"Institute of Science and Technology Austria","month":"06","department":[{"_id":"GradSch"},{"_id":"VlKo"}],"has_accepted_license":"1","file_date_updated":"2026-06-10T13:33:25Z","alternative_title":["ISTA Thesis"],"date_published":"2026-06-09T00:00:00Z","article_processing_charge":"No","das_tickbox":"1","degree_awarded":"PhD","fulldoi":"https://doi.org/10.15479/AT-ISTA-21957","ddc":["500"],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"publication_status":"published","year":"2026"},{"day":"26","corr_author":"1","doi_confirm":"1","publisher":"Institute of Science and Technology Austria","department":[{"_id":"GradSch"},{"_id":"EvBe"}],"month":"02","doi":"10.15479/AT-ISTA-21360","file":[{"content_type":"application/x-zip-compressed","date_updated":"2026-03-02T10:59:50Z","file_name":"2026_Riegler_Stefan_Thesis.zip","file_size":31430022,"file_id":"21386","access_level":"closed","relation":"source_file","creator":"sriegler","checksum":"2f1f44e8536c2538f94a440217452c9f","date_created":"2026-03-02T10:59:50Z"},{"date_created":"2026-03-02T10:59:49Z","checksum":"2e8dc39640bc26ae5684c944c619719b","creator":"sriegler","relation":"main_file","access_level":"closed","file_id":"21387","embargo_to":"open_access","file_size":11635090,"file_name":"2026_Riegler_Stefan_Thesis.pdf","embargo":"2027-02-27","date_updated":"2026-03-02T10:59:49Z","content_type":"application/pdf"}],"tmp":{"image":"/images/cc_by_sa.png","short":"CC BY-SA (4.0)","name":"Creative Commons Attribution-ShareAlike 4.0 International Public License (CC BY-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode"},"ddc":["570","575","583"],"publication_status":"published","year":"2026","has_accepted_license":"1","date_published":"2026-02-26T00:00:00Z","alternative_title":["ISTA Thesis"],"file_date_updated":"2026-03-02T10:59:50Z","article_processing_charge":"No","degree_awarded":"PhD","das_tickbox":"1","fulldoi":"https://doi.org/10.15479/AT-ISTA-21360","acknowledged_ssus":[{"_id":"LifeSc"},{"_id":"Bio"}],"publication_identifier":{"issn":["2663-337X"]},"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). ","OA_place":"repository","language":[{"iso":"eng"}],"title":"Root system plasticity under nutrient limitation: Investigating hormonal and molecular drivers in Arabidopsis thaliana and Coffea species","_id":"21360","status":"public","author":[{"id":"FF6018E0-D806-11E9-8E43-0B14E6697425","first_name":"Stefan","last_name":"Riegler","full_name":"Riegler, Stefan","orcid":"0000-0003-3413-1343"}],"date_created":"2026-02-27T09:08:14Z","supervisor":[{"first_name":"Eva","last_name":"Benková","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8510-9739","full_name":"Benková, Eva"}],"type":"dissertation","oa_version":"Published Version","license":"https://creativecommons.org/licenses/by-sa/4.0/","related_material":{"record":[{"status":"public","relation":"research_data","id":"21363"}]},"page":"185","citation":{"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.","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","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.","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.","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.","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"},"project":[{"name":"Breeding for coffee and cocoa root resilience in low input farming systems based on improved rootstocks","_id":"34afa094-11ca-11ed-8bc3-a375845a59fb","grant_number":"101060393"}],"date_updated":"2026-07-27T14:30:08Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9"},{"language":[{"iso":"eng"}],"OA_place":"repository","publication_identifier":{"isbn":["978-3-99078-074-9"],"issn":["2663-337X"]},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_updated":"2026-07-29T12:56:52Z","citation":{"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.","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.","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.","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"},"page":"160","related_material":{"link":[{"url":"https://github.com/madvorak/duality/tree/v3.5.0","relation":"software","description":"Full version of all definitions, statements, and proofs for Chapter 3.1 (Linear duality)"},{"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"},{"url":"https://github.com/Ivan-Sergeyev/seymour/tree/v1.2.0","description":"Full version of all definitions, statements, and proofs for Chapter 4 (Seymour project)","relation":"software"},{"relation":"software","description":"Full version of all definitions, statements, and proofs for Chapter 5 (Theory of grammars)","url":"https://github.com/madvorak/chomsky/tree/v1.2.0"},{"url":"https://github.com/madvorak/grammars","relation":"software","description":"Old version (Lean 3) of the project about grammars"},{"relation":"software","description":"Demonstration of (minimal) requirements for selected algebraic classes used in my Ph.D. thesis","url":"https://github.com/madvorak/preliminaries/blob/main/Preliminaries.lean"}],"record":[{"status":"public","id":"13120","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"20071"},{"id":"21398","relation":"part_of_dissertation","status":"public"}]},"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."}],"type":"dissertation","supervisor":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir"},{"full_name":"Blanchette, Jasmin","last_name":"Blanchette","first_name":"Jasmin"}],"oa_version":"Published Version","status":"public","date_created":"2026-03-04T09:26:46Z","author":[{"last_name":"Dvorak","first_name":"Martin","id":"40ED02A8-C8B4-11E9-A9C0-453BE6697425","full_name":"Dvorak, Martin","orcid":"0000-0001-5293-214X"}],"_id":"21393","title":"Pursuit of truth and beauty in Lean 4: Formally verified theory of grammars, optimization, matroids","file":[{"access_level":"open_access","relation":"main_file","creator":"mdvorak","success":1,"date_created":"2026-03-04T08:56:15Z","checksum":"cface6dc18152680962b5361575f6e4f","file_name":"2026_Dvorak_Martin_Thesis.pdf","content_type":"application/pdf","date_updated":"2026-03-04T08:56:15Z","file_size":1771231,"file_id":"21394"},{"date_updated":"2026-03-04T09:03:37Z","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_name":"2026_Dvorak_Martin_Thesis.docx","file_size":864585,"file_id":"21395","access_level":"closed","relation":"source_file","creator":"mdvorak","checksum":"290ddfacfb7e07fb07e6f0b334e67c90","date_created":"2026-03-04T09:03:37Z"}],"doi":"10.15479/AT-ISTA-21393","month":"03","department":[{"_id":"GradSch"},{"_id":"VlKo"}],"publisher":"Institute of Science and Technology Austria","doi_confirm":"1","corr_author":"1","oa":1,"day":"04","fulldoi":"https://doi.org/10.15479/AT-ISTA-21393","degree_awarded":"PhD","article_processing_charge":"No","file_date_updated":"2026-03-04T09:03:37Z","date_published":"2026-03-04T00:00:00Z","alternative_title":["ISTA Thesis"],"has_accepted_license":"1","year":"2026","publication_status":"published","ddc":["511","000"],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"}},{"acknowledged_ssus":[{"_id":"LifeSc"},{"_id":"NMR"}],"das_tickbox":"1","degree_awarded":"PhD","fulldoi":"https://doi.org/10.15479/AT-ISTA-22334","article_processing_charge":"No","has_accepted_license":"1","file_date_updated":"2026-07-16T09:17:08Z","alternative_title":["ISTA Thesis"],"date_published":"2026-07-13T00:00:00Z","publication_status":"published","year":"2026","tmp":{"image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"ddc":["572"],"doi":"10.15479/AT-ISTA-22334","file":[{"content_type":"application/zip","date_updated":"2026-07-16T09:17:08Z","file_name":"2026_Becker_Lea_source_files.zip","file_size":99472908,"file_id":"22346","access_level":"closed","relation":"source_file","creator":"lbecker","checksum":"8b85114eff543916c0e1445cd2189555","date_created":"2026-07-16T09:17:08Z"},{"file_id":"22347","file_size":74647289,"file_name":"2026_Becker_Lea_Thesis.pdf","date_updated":"2026-07-16T09:17:05Z","content_type":"application/pdf","date_created":"2026-07-16T09:17:05Z","checksum":"6c526862bc6dbd1e4c80ecb34580bc58","success":1,"creator":"lbecker","relation":"main_file","access_level":"open_access"}],"publisher":"Institute of Science and Technology Austria","department":[{"_id":"GradSch"},{"_id":"PaSc"}],"month":"07","doi_confirm":"1","oa":1,"corr_author":"1","day":"13","date_updated":"2026-08-04T09:32:45Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"short":"L.M. Becker, Exploring Protein Dynamics Using Specific Labeling Approaches for Solid-State MAS NMR, Institute of Science and Technology Austria, 2026.","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.","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."},"page":"205","project":[{"grant_number":"26777","name":"Exploring protein dynamics by solid-state MAS NMR through specific labeling approaches","_id":"7be609c4-9f16-11ee-852c-85015ce2b9b0"}],"related_material":{"record":[{"relation":"part_of_dissertation","id":"12675","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"21777"},{"id":"12114","relation":"part_of_dissertation","status":"public"},{"status":"public","id":"22105","relation":"part_of_dissertation"}]},"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"}],"type":"dissertation","supervisor":[{"id":"7B541462-FAF6-11E9-A490-E8DFE5697425","last_name":"Schanda","first_name":"Paul","full_name":"Schanda, Paul","orcid":"0000-0002-9350-7606"}],"oa_version":"Published Version","author":[{"orcid":"0000-0002-6401-5151","full_name":"Becker, Lea Marie","last_name":"Becker","first_name":"Lea Marie","id":"36336939-eb97-11eb-a6c2-c83f1214ca79"}],"status":"public","date_created":"2026-07-14T08:08:51Z","title":"Exploring protein dynamics using specific labeling approaches for solid-state MAS NMR","_id":"22334","language":[{"iso":"eng"}],"OA_place":"publisher","acknowledgement":"During the work on this thesis, I was the recipient of a DOC Fellowship of the Austrian\r\nAcademy of Sciences at the Institute of Science and Technology Austria (grant no. PR10660EAW01).","publication_identifier":{"isbn":["978-3-99078-084-8"],"issn":["2663-337X"]}},{"publication_identifier":{"issn":["2663-337X"]},"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","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.","language":[{"iso":"eng"}],"OA_place":"publisher","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."}],"oa_version":"Published Version","type":"dissertation","supervisor":[{"orcid":"0000-0002-9582-2634","full_name":"Hausel, Tamás","last_name":"Hausel","first_name":"Tamás","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2026-08-12T14:05:36Z","author":[{"id":"e3b80ae2-eb8e-11eb-b029-9aef4a9108a0","last_name":"Löwit","first_name":"Jakub","full_name":"Löwit, Jakub"}],"status":"public","title":"Equivariant K-theory of affine Grassmannians in representation theory and arithmetic","_id":"22694","date_updated":"2026-08-26T06:53:55Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","page":"185","citation":{"short":"J. Löwit, Equivariant K-Theory of Affine Grassmannians in Representation Theory and Arithmetic, Institute of Science and Technology Austria, 2026.","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.","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."},"project":[{"grant_number":"27004","name":"Arithmetic, geometry, topology and representation theory arising from the affine Grassmannian","_id":"901e2a43-16d5-11f0-9cad-9cead34748d6"},{"name":"Geometry of the tip of the global nilpotent cone","_id":"34b2c9cb-11ca-11ed-8bc3-a50ba74ca4a3","grant_number":"P35847"}],"related_material":{"record":[{"relation":"part_of_dissertation","id":"21751","status":"public"},{"relation":"part_of_dissertation","id":"22693","status":"public"}]},"publisher":"Institute of Science and Technology Austria","month":"08","department":[{"_id":"GradSch"},{"_id":"TaHa"}],"doi_confirm":"1","oa":1,"corr_author":"1","day":"05","doi":"10.15479/AT-ISTA-22694","file":[{"relation":"main_file","creator":"jloewit","access_level":"open_access","date_created":"2026-08-14T11:42:31Z","checksum":"2d0be77791dc296621c6c0f76be9d0d7","file_size":1574709,"file_name":"2026_Löwit_Jakub_Thesis.pdf","date_updated":"2026-08-14T11:42:31Z","content_type":"application/pdf","file_id":"22709"},{"file_id":"22710","file_size":1085118,"date_updated":"2026-08-14T11:42:42Z","content_type":"application/zip","file_name":"2026_Löwit_Jakub_Source_files.zip","date_created":"2026-08-14T11:42:42Z","checksum":"61bde4b58c1e6c7baeb561e41f82659b","relation":"source_file","creator":"jloewit","access_level":"closed"}],"publication_status":"published","year":"2026","ddc":["510","516","512","514","513"],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"degree_awarded":"PhD","fulldoi":"https://doi.org/10.15479/AT-ISTA-22694","article_processing_charge":"No","has_accepted_license":"1","file_date_updated":"2026-08-14T11:42:42Z","alternative_title":["ISTA Thesis"],"date_published":"2026-08-05T00:00:00Z"},{"date_updated":"2026-09-14T07:08:54Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","related_material":{"record":[{"status":"public","id":"19073","relation":"part_of_dissertation"},{"id":"21870","relation":"part_of_dissertation","status":"public"}]},"citation":{"chicago":"Werner, Thomas. “Interfacing Superconducting Qubits with Optical Photons.” Institute of Science and Technology Austria, 2026. https://doi.org/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","mla":"Werner, Thomas. Interfacing Superconducting Qubits with Optical Photons. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-21863.","ama":"Werner T. Interfacing superconducting qubits with optical photons. 2026. doi:10.15479/AT-ISTA-21863","short":"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.","ieee":"T. Werner, “Interfacing superconducting qubits with optical photons,” Institute of Science and Technology Austria, 2026."},"page":"97","project":[{"name":"Cavity Quantum Electro Optics: Microwave photonics with nonclassical states","_id":"bdadfa0d-d553-11ed-ba76-fb85edbd456a","grant_number":"101089099"},{"call_identifier":"H2020","name":"Quantum Local Area Networks with Superconducting Qubits","_id":"9B868D20-BA93-11EA-9121-9846C619BF3A","grant_number":"899354"},{"grant_number":"758053","_id":"26336814-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"A Fiber Optic Transceiver for Superconducting Qubits"},{"grant_number":"101248662","name":"Integrated optical coupling for low loss electro-optic interconnects","_id":"5b807754-ab3d-11f0-914f-ff8c34502cc9"},{"name":"Cavity-Integrated Electro-Optics: Measuring, Converting and Manipulating Microwaves with Light","_id":"91aaf765-16d5-11f0-9cad-a8e7e44cccb7","grant_number":"101187231"},{"grant_number":"F07105","name":"QUANTUM INFORMATION SYSTEMS BEYOND CLASSICAL CAPABILITIES / P5- Integration of Superconducting Quantum Circuits","_id":"bdb108fd-d553-11ed-ba76-83dc74a9864f"},{"_id":"bdb7cfc1-d553-11ed-ba76-d2eaab167738","name":"Open Superconducting Quantum Computers (OpenSuperQPlus)","grant_number":"101080139"},{"_id":"9B861AAC-BA93-11EA-9121-9846C619BF3A","name":"NOMIS Fellowship Program"}],"oa_version":"Published Version","type":"dissertation","supervisor":[{"id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","last_name":"Fink","first_name":"Johannes M","orcid":"0000-0001-8112-028X","full_name":"Fink, Johannes M"}],"abstract":[{"text":"Atoms and photons, two things so different but yet so alike. The former, the building block of matter, something we learn about in school and imagine it as some tiny marbles encircled by other tinier marbles. The latter, an electromagnetic wave, a light particle or an excitation of the electromagnetic field. Quantum mechanics tells us about the properties of these two entities. And even if it sounds, looks and writes counter-intuitive, it has proven right for over a century now.\r\n\r\nIn this work, I elaborate on how we tested the laws of quantum mechanics and how we used them learn more about the tiny building blocks of nature and the fields they use to talk to each other. The atoms we use, are artificial. Superconducting qubits, small electrical circuits with quantized energy levels behave like electrons that transition between different orbitals in an atom. One of the qubits' advantages, is also a big disadvantage. We design the circuits' energy levels and fabricate them in a cleanroom. This allows for arbitrary spaced energy levels but in contrast to real atoms, prevents two superconducting qubits from being alike. Still, this qubit platform is one of the frontrunners for future quantum computing technology and testing fundamental physics due to their scalability.\r\n\r\nWe interface superconducting qubits, which operate in the GHz regime, with microwave photons. We use 3D aluminum cavities as mediators between qubits and photons. The cavities allow for non-destructive readout of the qubit state, they shield the qubits from noise at the qubit frequency and they give us an easy way to frequency-tune these joint systems.\r\n\r\nWe need to operate superconducting qubits and their cavities at millikelvin temperatures in dilution refrigerators. At higher temperatures, superconductivity suffers and even worse, the environment is filled with thermal noise photons. This poses a fundamental limitation on the scalability of superconducting qubit devices. Also connecting multiple devices in different fridges does not work over room temperature links because the microwave photons used for this purpose will be covered in noise and the quantum information they carry, will be unusable.\r\n\r\nInfrared photons do not suffer from this noise problem since there are close to zero thermal noise photons at their frequencies at room temperature. We cannot simply interface superconducting devices with optical photons due their frequency mismatch and the destructive effect of optical photons on superconductors. Therefore, we use microwave-to-optics transducers that allow to convert microwave photons into optical ones and vice-versa. The transducers that we use are macroscopic electro-optic transducers using the Pockels effect in a disk-shaped Lithium Niobate whispering gallery mode resonator. By using a strong optical pump, photons from the two frequency domains experience a beam-splitter interaction and get converted from one to the other.\r\n\r\nWe measure the generated optical photons using elaborate optical setups, optical heterodyning and single photon detectors to gain knowledge about the qubit state or the converted microwave photons. Bridging the microwave and the optical world allows us to take advantage of both of their strengths but it also requires deep knowledge about both of their working principles.\r\n\r\nIn this work, we describe two experiments that our group conducted to showcase the opportunities that arise from interfacing superconducting qubits with optical photons but also the pitfalls, one may encounter on the way.\r\n\r\nIn the first experiment, we managed to all-optically read out a superconducting qubit. We show that the assignment fidelity, the probability that a measurement of the qubit state matches the prepared state, is close to equal for all-optical, microwave-to-optics and conventional microwave readout. We show T1 and T2 measurements for all three readout types and give an analysis of the noise caused by the optics. Finally, we show that the infrared light does not affect the qubit performance in a negative way but that the heating it causes does. This is an important insight that we used in the next experiment.\r\n\r\nThe second experiment is the upconversion of itinerant single microwave photons to the optical domain. We show that we can generate single microwave photons from a qubit-cavity system. We upconvert these single photons, measure them with a single photon detector and reconstruct their shape. By conducting a single photon Rabi measurement, we show correlations between the microwave and the optical domain. And by thorough signal-to-noise measurements and noise analysis, we find that we can generate single infrared photons with high signal-to-noise ratio 5.1 and low transducer added noise (<0.012 quanta). We show that this measurement creates a path towards entanglement of a superconducting qubit and an optical photon and what parameters need to be improved to achieve it. Additionally, this experiment is a proof of principle for an on-demand infrared single photon source. More generally, it allows to link microwave quantum technology in general to the optical domain.","lang":"eng"}],"title":"Interfacing superconducting qubits with optical photons","_id":"21863","author":[{"first_name":"Thomas","last_name":"Werner","id":"1fcd8497-dba3-11ea-a45e-c6fbd715f7c7","orcid":"0009-0001-2346-5236","full_name":"Werner, Thomas"}],"status":"public","date_created":"2026-05-12T09:04:02Z","language":[{"iso":"eng"}],"OA_place":"publisher","publication_identifier":{"issn":["2663-337X"]},"ec_funded":1,"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","degree_awarded":"PhD","fulldoi":"https://doi.org/10.15479/AT-ISTA-21863","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"},{"_id":"LifeSc"},{"_id":"SSU"}],"has_accepted_license":"1","file_date_updated":"2026-05-15T15:54:06Z","date_published":"2026-05-12T00:00:00Z","alternative_title":["ISTA Thesis"],"article_processing_charge":"No","keyword":["Superconducting qubits","Quantum optics","Single photons and quantum effects","Nonlinear optics"],"publication_status":"published","year":"2026","ddc":["530","537","539"],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"doi":"10.15479/AT-ISTA-21863","file":[{"checksum":"a5b4d8dba83f96e955a3625c0eebee98","date_created":"2026-05-15T15:53:57Z","creator":"twerner","relation":"main_file","access_level":"open_access","file_id":"21879","file_size":9330516,"content_type":"application/pdf","date_updated":"2026-05-15T15:53:57Z","file_name":"2026_Werner_Thomas_Thesis.pdf"},{"file_id":"21880","date_updated":"2026-05-15T15:54:06Z","content_type":"application/x-zip-compressed","file_name":"2026_Werner_Thomas_Thesis.zip","file_size":9370704,"checksum":"b41282beaacfb32472769b9e3b1758d8","date_created":"2026-05-15T15:54:06Z","access_level":"closed","relation":"source_file","creator":"twerner"}],"publisher":"Institute of Science and Technology Austria","department":[{"_id":"GradSch"},{"_id":"JoFi"}],"month":"05","day":"12","corr_author":"1","oa":1},{"day":"21","corr_author":"1","doi_confirm":"1","publisher":"Institute of Science and Technology Austria","month":"08","department":[{"_id":"CaBe"},{"_id":"GradSch"}],"doi":"10.15479/AT-ISTA-22745","file":[{"embargo_to":"open_access","file_id":"22763","embargo":"2027-08-26","date_updated":"2026-08-26T08:46:02Z","content_type":"application/pdf","file_name":"2026_Michalik_David_Thesis.pdf","file_size":13624837,"checksum":"cd80d2076a5155ab6a12ec0b05adbee5","date_created":"2026-08-26T08:46:02Z","access_level":"closed","creator":"cchlebak","relation":"main_file"},{"content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","date_updated":"2026-08-26T08:46:35Z","file_name":"2026_Michalik_David_Thesis.docx","file_size":20499216,"file_id":"22764","access_level":"closed","creator":"cchlebak","relation":"source_file","checksum":"16ae6cd206ba0eb04ce8a7198042f24f","date_created":"2026-08-26T08:46:35Z"}],"ddc":["572"],"tmp":{"image":"/images/cc_by_sa.png","short":"CC BY-SA (4.0)","name":"Creative Commons Attribution-ShareAlike 4.0 International Public License (CC BY-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode"},"publication_status":"published","year":"2026","has_accepted_license":"1","date_published":"2026-08-21T00:00:00Z","file_date_updated":"2026-08-26T08:46:35Z","alternative_title":["ISTA Thesis"],"article_processing_charge":"No","degree_awarded":"PhD","fulldoi":"https://doi.org/10.15479/AT-ISTA-22745","publication_identifier":{"issn":["2663-337X"]},"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).","OA_place":"publisher","language":[{"iso":"eng"}],"title":"Mechanistic insights into MDA5 selectivity and regulation","_id":"22745","date_created":"2026-08-21T09:29:34Z","status":"public","author":[{"full_name":"Michalik, David","first_name":"David","last_name":"Michalik","id":"B9577E20-AA38-11E9-AC9A-0930E6697425"}],"type":"dissertation","oa_version":"Published Version","supervisor":[{"full_name":"Bernecky, Carrie A","orcid":"0000-0003-0893-7036","id":"2CB9DFE2-F248-11E8-B48F-1D18A9856A87","last_name":"Bernecky","first_name":"Carrie A"}],"page":"182","citation":{"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.","ista":"Michalik D. 2026. Mechanistic insights into MDA5 selectivity and regulation. Institute of Science and Technology Austria.","ieee":"D. Michalik, “Mechanistic insights into MDA5 selectivity and regulation,” Institute of Science and Technology Austria, 2026.","short":"D. Michalik, Mechanistic Insights into MDA5 Selectivity and Regulation, Institute of Science and Technology Austria, 2026.","ama":"Michalik D. Mechanistic insights into MDA5 selectivity and regulation. 2026. doi:10.15479/AT-ISTA-22745","mla":"Michalik, David. Mechanistic Insights into MDA5 Selectivity and Regulation. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-22745."},"project":[{"grant_number":"F8003","name":"RNAdeco: decorating RNA for a purpose/ P03- Roles of A-to-I editing in dsRNA recognition","_id":"8dc144d4-16d5-11f0-9cad-9d9e86aea1f7"}],"date_updated":"2026-09-14T06:54:50Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"page":"88","citation":{"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.","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.","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.","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.","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.","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"},"project":[{"_id":"25B7EB9E-B435-11E9-9278-68D0E5697425","name":"Biophysics and circuit function of a giant cortical glutamatergic synapse","call_identifier":"H2020","grant_number":"692692"},{"grant_number":"101199096","name":"Synaptic mechanisms of engram storage and retrieval in CA3 hippocampal microcircuits","_id":"e62b56fe-ab3c-11f0-94c7-d181dd352b3b"},{"grant_number":"P36232","name":"Mechanisms of GABA release in hippocampal circuits","_id":"bd88be38-d553-11ed-ba76-81d5a70a6ef5"},{"grant_number":"PAT 4178023","name":"Synaptic networks of human brain","_id":"8d9195e9-16d5-11f0-9cad-d075be887a1e"},{"_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","call_identifier":"H2020","name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413"},{"grant_number":"COE16","_id":"0a6c8641-b036-11f1-bacf-e4eec62b5bb4","name":"Neuronal circuits in health and disease (Jonas)"}],"date_updated":"2026-09-16T07:39:42Z","supplementarymaterial":"yes","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","date_created":"2026-08-18T15:23:41Z","author":[{"full_name":"Lin, Peipeng","last_name":"Lin","first_name":"Peipeng","id":"7E3060D0-A92C-11E9-A326-26C8E5697425"}],"title":"Calibrating the teacher synapse: Mechanisms and functional significance of presynaptic inhibition at hippocampal mossy fiber synapses","_id":"22735","type":"dissertation","supervisor":[{"orcid":"0000-0001-5001-4804","full_name":"Jonas, Peter M","first_name":"Peter M","last_name":"Jonas","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"}],"oa_version":"Published Version","OA_place":"publisher","language":[{"iso":"eng"}],"ec_funded":1,"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.).","publication_identifier":{"isbn":["978-3-99078-088-6"],"issn":["2663-337X"]},"article_processing_charge":"No","has_accepted_license":"1","date_published":"2026-08-25T00:00:00Z","file_date_updated":"2026-08-26T10:09:53Z","alternative_title":["ISTA Thesis"],"acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"PreCl"},{"_id":"Bio"}],"das_tickbox":"0","degree_awarded":"PhD","fulldoi":"https://doi.org/10.15479/AT-ISTA-22735","ddc":["571","573"],"tmp":{"image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"publication_status":"published","year":"2026","doi":"10.15479/AT-ISTA-22735","researchdata_availability":"upon request","file":[{"relation":"main_file","creator":"plin","access_level":"closed","checksum":"13cc7ead72aad90a134f310b531c73cd","date_created":"2026-08-26T10:09:48Z","file_size":6376229,"file_name":"2026_Lin_Peipeng_Thesis.pdf","date_updated":"2026-08-26T10:09:48Z","embargo":"2027-09-01","content_type":"application/pdf","file_id":"22765","embargo_to":"open_access"},{"creator":"plin","relation":"source_file","access_level":"closed","checksum":"8c9c1445a7df284377be1a8c9dadd7c5","date_created":"2026-08-26T10:09:53Z","file_size":17681883,"file_name":"2026_Lin_Peipeng_Thesis.docx","date_updated":"2026-08-26T10:09:53Z","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_id":"22766"}],"corr_author":"1","day":"25","publisher":"Institute of Science and Technology Austria","department":[{"_id":"GradSch"},{"_id":"PeJo"}],"month":"08","doi_confirm":"1"},{"file":[{"file_id":"22850","embargo_to":"open_access","file_size":8968078,"file_name":"2026_Jamrichova_Silvia_Thesis.pdf","embargo":"2028-03-08","date_updated":"2026-09-08T09:01:22Z","content_type":"application/pdf","date_created":"2026-09-08T09:01:22Z","checksum":"d9a6fd39a0b6343c4473901f9323f127","creator":"cchlebak","relation":"main_file","access_level":"closed"},{"access_level":"closed","relation":"source_file","creator":"cchlebak","date_created":"2026-09-08T09:02:52Z","checksum":"02b728c9157f88e392b69e94877889f0","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","date_updated":"2026-09-08T09:02:52Z","file_name":"2026_Jamrichova_Silvia_Thesis.docx","file_size":17338630,"file_id":"22851"}],"researchdata_availability":"upon request","doi":"10.15479/AT-ISTA-22775","day":"03","OA_embargo":"18","corr_author":"1","doi_confirm":"1","department":[{"_id":"GradSch"},{"_id":"PeJo"}],"month":"09","publisher":"Institute of Science and Technology Austria","file_date_updated":"2026-09-08T09:02:52Z","date_published":"2026-09-03T00:00:00Z","alternative_title":["ISTA Thesis"],"has_accepted_license":"1","article_processing_charge":"No","fulldoi":"https://doi.org/10.15479/AT-ISTA-22775","degree_awarded":"PhD","acknowledged_ssus":[{"_id":"Bio"},{"_id":"PreCl"},{"_id":"M-Shop"},{"_id":"LifeSc"}],"ddc":["570"],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"year":"2026","publication_status":"published","OA_place":"publisher","language":[{"iso":"eng"}],"publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-085-5"]},"ec_funded":1,"project":[{"call_identifier":"H2020","name":"Biophysics and circuit function of a giant cortical glutamatergic synapse","_id":"25B7EB9E-B435-11E9-9278-68D0E5697425","grant_number":"692692"},{"grant_number":"101199096","_id":"e62b56fe-ab3c-11f0-94c7-d181dd352b3b","name":"Synaptic mechanisms of engram storage and retrieval in CA3 hippocampal microcircuits"},{"grant_number":"P36232","name":"Mechanisms of GABA release in hippocampal circuits","_id":"bd88be38-d553-11ed-ba76-81d5a70a6ef5"},{"grant_number":"PAT 4178023","name":"Synaptic networks of human brain","_id":"8d9195e9-16d5-11f0-9cad-d075be887a1e"},{"grant_number":"Z00312","name":"Synaptic communication in neuronal microcircuits","call_identifier":"FWF","_id":"25C5A090-B435-11E9-9278-68D0E5697425"},{"_id":"0a6c8641-b036-11f1-bacf-e4eec62b5bb4","name":"Neuronal circuits in health and disease (Jonas)","grant_number":"COE16"}],"citation":{"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.","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.","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.","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","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.","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."},"page":"153","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","supplementarymaterial":"no","date_updated":"2026-09-16T08:13:41Z","_id":"22775","title":"Timing and strength of synaptic transmission at hippocampal mossy fiber synapses in mice and humans","date_created":"2026-09-03T08:06:58Z","status":"public","author":[{"full_name":"Jamrichova, Silvia","orcid":"0009-0003-9929-8221","id":"F0EA6804-AA27-11E9-8613-C0F7E5697425","first_name":"Silvia","last_name":"Jamrichova"}],"type":"dissertation","oa_version":"Published Version","supervisor":[{"last_name":"Jonas","first_name":"Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5001-4804","full_name":"Jonas, Peter M"}]},{"doi_confirm":"1","month":"09","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"publisher":"Institute of Science and Technology Austria","day":"07","corr_author":"1","oa":1,"file":[{"access_level":"closed","creator":"kkueffne","relation":"source_file","checksum":"716ce44a6ed9a727f231bdebdeecc741","date_created":"2026-09-11T07:32:13Z","file_name":"Thesis_Konstantin_Kueffner-3.zip","content_type":"application/zip","date_updated":"2026-09-11T07:32:13Z","file_size":26356903,"file_id":"22903"},{"relation":"main_file","creator":"kkueffne","access_level":"open_access","checksum":"77082e90b8330fb46f585843840c5d5c","date_created":"2026-09-11T07:32:17Z","file_size":10051715,"date_updated":"2026-09-11T07:32:17Z","content_type":"application/pdf","file_name":"Thesis_Konstantin_Kueffner-2.pdf","file_id":"22904"}],"doi":"10.15479/AT-ISTA-22808","year":"2026","publication_status":"published","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"ddc":["000"],"fulldoi":"https://doi.org/10.15479/AT-ISTA-22808","degree_awarded":"PhD","date_published":"2026-09-07T00:00:00Z","file_date_updated":"2026-09-11T07:32:17Z","alternative_title":["ISTA Thesis"],"has_accepted_license":"1","article_processing_charge":"No","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093 (VAMOS).\r\n","ec_funded":1,"publication_identifier":{"isbn":["978-3-99078-089-3"],"issn":["2663-337X"]},"language":[{"iso":"eng"}],"OA_place":"publisher","type":"dissertation","supervisor":[{"full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger"}],"oa_version":"Published Version","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"}],"_id":"22808","title":"Monitoring algorithmic fairness in sequential decision making","author":[{"orcid":"0000-0001-8974-2542","full_name":"Kueffner, Konstantin","first_name":"Konstantin","last_name":"Kueffner","id":"8121a2d0-dc85-11ea-9058-af578f3b4515"}],"date_created":"2026-09-05T15:59:19Z","status":"public","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_updated":"2026-09-18T07:41:29Z","related_material":{"record":[{"relation":"part_of_dissertation","id":"13310","status":"public"},{"relation":"part_of_dissertation","id":"14454","status":"public"},{"status":"public","id":"20292","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"21090"},{"id":"13228","relation":"part_of_dissertation","status":"public"}]},"project":[{"name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093"}],"page":"183","citation":{"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.","short":"K. Kueffner, Monitoring Algorithmic Fairness in Sequential Decision Making, Institute of Science and Technology Austria, 2026.","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.","ama":"Kueffner K. Monitoring algorithmic fairness in sequential decision making. 2026. doi:10.15479/AT-ISTA-22808","mla":"Kueffner, Konstantin. Monitoring Algorithmic Fairness in Sequential Decision Making. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-22808."}},{"researchdata_availability":"upon request","doi":"10.15479/AT-ISTA-22873","file":[{"relation":"main_file","creator":"aehrmann","access_level":"closed","date_created":"2026-09-11T07:23:57Z","checksum":"a5e3d79e0e5f3f4fb3c414e48116dc9e","file_size":14782662,"embargo":"2027-01-15","content_type":"application/pdf","date_updated":"2026-09-17T08:59:39Z","file_name":"2026_Ehrmann_Andreas_Thesis.pdf","embargo_to":"open_access","file_id":"22901"},{"file_id":"22902","file_name":"thesis_latex_files.zip","date_updated":"2026-09-11T07:24:14Z","content_type":"application/zip","file_size":155228,"checksum":"0235b9c52fee0c97f402f1c3d4efc1eb","date_created":"2026-09-11T07:24:14Z","access_level":"closed","creator":"aehrmann","relation":"source_file","description":"All LaTeX files to compile my PhD Thesis."}],"corr_author":"1","day":"04","publisher":"Institute of Science and Technology Austria","department":[{"_id":"GradSch"},{"_id":"CaGo"},{"_id":"EdHa"}],"month":"09","doi_confirm":"1","article_processing_charge":"No","keyword":["PhD Thesis","functional nanomachines","biological functionality","nanotechnology","energy delivery","target behavior","dynamics","design principles","optimization","differentiable statistical physics","machine learning"],"has_accepted_license":"1","date_published":"2026-09-04T00:00:00Z","alternative_title":["ISTA Thesis"],"file_date_updated":"2026-09-17T08:59:39Z","acknowledged_ssus":[{"_id":"ScienComp"},{"_id":"CampIT"}],"degree_awarded":"PhD","das_tickbox":"0","fulldoi":"https://doi.org/10.15479/AT-ISTA-22873","ddc":["530","600","621","004","005"],"tmp":{"image":"/images/cc_by_nc_sa.png","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","short":"CC BY-NC-SA (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode"},"publication_status":"published","year":"2026","OA_place":"publisher","language":[{"iso":"eng"}],"acknowledgement":"I acknowledge funding by the Austrian Science Fund (FWF) [10.55776/PAT8537123].","publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-092-3"]},"page":"168","citation":{"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.","short":"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.","ieee":"A. Ehrmann, “Biological functionality without biochemistry: Designing nanomachines for target behavior,” Institute of Science and Technology Austria, 2026.","ama":"Ehrmann A. Biological functionality without biochemistry: Designing nanomachines for target behavior. 2026. doi:10.15479/AT-ISTA-22873","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."},"project":[{"grant_number":"PAT 8537123","_id":"90a98bb5-16d5-11f0-9cad-9675f3f8015d","name":"Functional bio-inspired nanomachines from sticky colloids"}],"related_material":{"record":[{"relation":"part_of_dissertation","id":"22893","status":"public"},{"relation":"part_of_dissertation","id":"22892","status":"public"}]},"date_updated":"2026-09-18T11:28:29Z","supplementarymaterial":"not applicable","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","author":[{"orcid":"0000-0002-0997-5678","full_name":"Ehrmann, Andreas","first_name":"Andreas","last_name":"Ehrmann","id":"eaa689ed-f6e0-11ea-865d-bd98cbcf83c2"}],"date_created":"2026-09-09T12:18:24Z","status":"public","title":"Biological functionality without biochemistry: Designing nanomachines for target behavior","_id":"22873","oa_version":"Published Version","supervisor":[{"full_name":"Goodrich, Carl Peter","orcid":"0000-0002-1307-5074","id":"EB352CD2-F68A-11E9-89C5-A432E6697425","first_name":"Carl Peter","last_name":"Goodrich"},{"full_name":"Hannezo, Edouard B","orcid":"0000-0001-6005-1561","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87","last_name":"Hannezo","first_name":"Edouard B"}],"type":"dissertation"},{"day":"09","corr_author":"1","oa":1,"doi_confirm":"1","month":"02","department":[{"_id":"GradSch"},{"_id":"ChLa"}],"publisher":"Institute of Science and Technology Austria","file":[{"access_level":"closed","creator":"jscott","relation":"source_file","date_created":"2026-02-17T11:46:22Z","checksum":"121c1d968bd86f3630aa7e81d5bbbcb0","content_type":"application/zip","date_updated":"2026-02-17T11:46:22Z","file_name":"2026_Scott_Jonathan_Thesis_Source.zip","file_size":272379252,"file_id":"21298"},{"file_name":"2026_Jonathan_Scott_Thesis.pdf","content_type":"application/pdf","date_updated":"2026-02-27T10:25:41Z","file_size":15220298,"file_id":"21366","access_level":"open_access","creator":"jscott","relation":"main_file","success":1,"date_created":"2026-02-27T10:25:41Z","checksum":"6e3e08ba474bbee8511cc8a839ab2077"}],"doi":"10.15479/AT-ISTA-21198","ddc":["005"],"year":"2026","publication_status":"published","alternative_title":["ISTA Thesis"],"file_date_updated":"2026-02-27T10:25:41Z","date_published":"2026-02-09T00:00:00Z","has_accepted_license":"1","article_processing_charge":"No","fulldoi":"https://doi.org/10.15479/AT-ISTA-21198","degree_awarded":"PhD","acknowledged_ssus":[{"_id":"ScienComp"}],"publication_identifier":{"issn":["2663-337X"]},"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).","OA_place":"publisher","language":[{"iso":"eng"}],"_id":"21198","title":"Data heterogeneity and personalization in federated learning","status":"public","date_created":"2026-02-09T14:59:53Z","author":[{"last_name":"Scott","first_name":"Jonathan A","id":"e499926b-f6e0-11ea-865d-9c63db0031e8","full_name":"Scott, Jonathan A"}],"oa_version":"Published Version","supervisor":[{"orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","last_name":"Lampert"}],"type":"dissertation","abstract":[{"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.","lang":"eng"}],"related_material":{"record":[{"id":"21207","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","id":"20819","status":"public"},{"id":"17411","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"18120"}]},"project":[{"_id":"d8f03aaa-b035-11f1-8588-d5147fa879e0","name":"Bilateral Artificial Intelligence (Lampert)","grant_number":"COE12"}],"page":"158","citation":{"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.","short":"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.","ieee":"J. A. Scott, “Data heterogeneity and personalization in federated learning,” Institute of Science and Technology Austria, 2026.","ama":"Scott JA. Data heterogeneity and personalization in federated learning. 2026. doi:10.15479/AT-ISTA-21198","mla":"Scott, Jonathan A. Data Heterogeneity and Personalization in Federated Learning. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-21198."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-10-01T09:29:03Z"},{"acknowledged_ssus":[{"_id":"ScienComp"}],"das_tickbox":"1","degree_awarded":"PhD","fulldoi":"https://doi.org/10.15479/AT-ISTA-21854","article_processing_charge":"No","has_accepted_license":"1","date_published":"2026-05-11T00:00:00Z","file_date_updated":"2026-05-13T13:10:48Z","alternative_title":["ISTA Thesis"],"publication_status":"published","year":"2026","ddc":["000"],"doi":"10.15479/AT-ISTA-21854","file":[{"content_type":"application/zip","date_updated":"2026-05-11T08:36:01Z","file_name":"EIofinova_thesis_FinalVersion.zip","file_size":28479571,"file_id":"21856","access_level":"closed","creator":"eiofinov","relation":"source_file","date_created":"2026-05-11T08:36:01Z","checksum":"2e148dad920e3f9b7c32796e0ba2e5f7"},{"file_id":"21877","file_size":18137757,"file_name":"2026_Iofinova_Eugenia_Thesis.pdf","content_type":"application/pdf","date_updated":"2026-05-13T13:10:48Z","date_created":"2026-05-13T13:10:48Z","checksum":"b10c2933f386f532b2dbf28b19c5525c","success":1,"creator":"eiofinov","relation":"main_file","access_level":"open_access"}],"publisher":"Institute of Science and Technology Austria","department":[{"_id":"GradSch"},{"_id":"DaAl"}],"month":"05","doi_confirm":"1","corr_author":"1","oa":1,"day":"11","date_updated":"2026-10-01T09:32:47Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"ista":"Iofinova EB. 2026. On the utility and effects of efficiency in artificial neural networks. Institute of Science and Technology Austria.","short":"E.B. Iofinova, On the Utility and Effects of Efficiency in Artificial Neural Networks, Institute of Science and Technology Austria, 2026.","ieee":"E. B. Iofinova, “On the utility and effects of efficiency in artificial neural networks,” Institute of Science and Technology Austria, 2026.","ama":"Iofinova EB. On the utility and effects of efficiency in artificial neural networks. 2026. doi:10.15479/AT-ISTA-21854","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.","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."},"page":"237","project":[{"grant_number":"W1260-N35","name":"Vienna Graduate School on Computational Optimization","_id":"9B9290DE-BA93-11EA-9121-9846C619BF3A"}],"related_material":{"record":[{"status":"public","id":"14771","relation":"part_of_dissertation"},{"status":"public","id":"21858","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"21859"},{"status":"public","id":"21857","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"18121"}]},"abstract":[{"text":"As neural-network-based models grow both in size and popularity, interest has grown in making the models smaller and more efficient to train. To that end, many methods have been proposed to prune models by reducing their number of nonzero parameters. Additionally, parameter-efficient fine-tuning, in which a much smaller number of parameters than the total contained in the model is updated during training, has become very popular, especially in the space of Large Language Models. At the same time, the increasingly routine deployment of machine learning in real-world applications has spurred a drive to make them more trustworthy - in the sense of, among other things, being unbiased, interpretable, and editable. In this thesis, we examine the interplay between efficiency and trustworthiness.\r\n\r\nFirst, we analyze the effects of model pruning on bias in computer vision models, demonstrating that increased sparsity leads to greater bias, largely as a function of increased model uncertainty in marginal cases. Based on this observation, we propose several bias mitigation techniques. Then, we demonstrate that example-specific model pruning can improve model interpretation methods while improving pruning efficiency to make example-specific model pruning feasible in real time. Then, we investigate the effectiveness of parameter-efficient and data-efficient model personalization via fine-tuning, demonstrating that it is highly feasible with very small computational and data resources. Finally, we consider efficiency in editing model knowledge using a custom synthetic data framework, demonstrating that parameter-efficient, low-rank fine-tuning frequently outperforms full-rank fine-tuning, and, additionally, that restricting which model blocks are fine-tuned frequently improves results. Together, the results in this thesis provide new insights and techniques for combining trustworthiness and efficiency during neural network inference and training.\r\n\r\n","lang":"eng"}],"oa_version":"Published Version","type":"dissertation","supervisor":[{"full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2026-05-11T08:43:22Z","status":"public","author":[{"id":"f9a17499-f6e0-11ea-865d-fdf9a3f77117","first_name":"Eugenia B","last_name":"Iofinova","orcid":"0000-0002-7778-3221","full_name":"Iofinova, Eugenia B"}],"title":"On the utility and effects of efficiency in artificial neural networks","_id":"21854","language":[{"iso":"eng"}],"OA_place":"publisher","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","publication_identifier":{"issn":["2663-337X"]},"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."},{"day":"29","corr_author":"1","oa":1,"doi_confirm":"1","publisher":"Institute of Science and Technology Austria","month":"09","department":[{"_id":"GradSch"},{"_id":"ScWa"}],"doi":"10.15479/AT-ISTA-23005","researchdata_availability":"yes","file":[{"creator":"vdiazmel","relation":"main_file","access_level":"open_access","checksum":"f339bdee0a6925573687de928ca525dc","date_created":"2026-09-29T09:22:27Z","file_size":8463804,"content_type":"application/pdf","date_updated":"2026-09-29T09:56:46Z","file_name":"2026_diaz-melian_vicente_Thesis.pdf","file_id":"23007"},{"access_level":"closed","creator":"vdiazmel","relation":"source_file","checksum":"5b17122895fc419bfb620e23bfe7780a","date_created":"2026-09-29T09:49:32Z","content_type":"application/zip","date_updated":"2026-09-29T09:56:46Z","file_name":"2026_diaz-melian_vicente_Thesis.zip","file_size":4028974886,"file_id":"23008"}],"ddc":["530","530","530"],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"publication_status":"published","year":"2026","has_accepted_license":"1","file_date_updated":"2026-09-29T09:56:46Z","alternative_title":["ISTA Thesis"],"date_published":"2026-09-29T00:00:00Z","article_processing_charge":"No","degree_awarded":"PhD","fulldoi":"https://doi.org/10.15479/AT-ISTA-23005","acknowledged_ssus":[{"_id":"M-Shop"}],"publication_identifier":{"issn":["2663-337X"]},"OA_place":"publisher","language":[{"iso":"eng"}],"title":"The morphology underneath a levitated hydrogel sphere","_id":"23005","author":[{"last_name":"Diaz Melian","first_name":"Vicente L","id":"b6798902-eea0-11ea-9cbc-a8e14286c631","full_name":"Diaz Melian, Vicente L"}],"date_created":"2026-09-28T17:40:23Z","status":"public","type":"dissertation","supervisor":[{"id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","last_name":"Waitukaitis","first_name":"Scott R","full_name":"Waitukaitis, Scott R","orcid":"0000-0002-2299-3176"}],"oa_version":"Published Version","abstract":[{"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.","lang":"eng"}],"related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"14514"},{"status":"public","id":"21982","relation":"part_of_dissertation"}]},"citation":{"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.","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","ama":"Diaz Melian VL. The morphology underneath a levitated hydrogel sphere. 2026. doi:10.15479/AT-ISTA-23005","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.","ista":"Diaz Melian VL. 2026. The morphology underneath a levitated hydrogel sphere. Institute of Science and Technology Austria.","short":"V.L. Diaz Melian, The Morphology underneath a Levitated Hydrogel Sphere, Institute of Science and Technology Austria, 2026.","ieee":"V. L. Diaz Melian, “The morphology underneath a levitated hydrogel sphere,” Institute of Science and Technology Austria, 2026."},"page":"114","supplementarymaterial":"yes","date_updated":"2026-10-02T08:44:47Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9"}]