[{"OA_place":"publisher","degree_awarded":"PhD","project":[{"name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11407"},{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"date_updated":"2026-04-07T12:31:22Z","date_published":"2025-08-27T00:00:00Z","alternative_title":["ISTA Thesis"],"ddc":["519"],"author":[{"orcid":"0000-0001-5103-038X","first_name":"Raimundo J","full_name":"Saona Urmeneta, Raimundo J","id":"BD1DF4C4-D767-11E9-B658-BC13E6697425","last_name":"Saona Urmeneta"}],"month":"08","oa_version":"Published Version","has_accepted_license":"1","language":[{"iso":"eng"}],"supervisor":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"}],"publication_identifier":{"issn":["2663-337X"]},"acknowledgement":"Funding sources The works included in this thesis were partially supported by:\r\n• Austrian Science Fund (FWF), grants 10.55776/COE12 and No RiSE/SHiNE S11407,\r\n• French Agence Nationale de la Recherche (ANR), grants ANR-21-CE40-0020 (CONVERGENCE) and ANR-20-CE40-0002 (GrHyDy),\r\n• Fondation Mathématique Jaques Hadamard, grant PGMO RSG 2018-0031H,\r\n• European Research Council (ERC), Consolidator grant 863818 (ForM-SMArt),\r\n• Agencia Nacional de Investigación y Desarrollo (ANID Chile), grant ACT210005,\r\n• Fondo Nacional de Desarrollo Científico y Tecnológico (Fondecyt Chile), grant 1220174,\r\n• Comisión Nacional de Investigación Científica y Tecnológica (CONICYT Chile), grant\r\nPII 20150140,\r\n• Evaluation-orientation de la Coopération Scientifique and Comisión Nacional de Investigación Científica y Tecnológica (ECOS-CONICYT), grant C15E03,\r\n• European Cooperation in Science and Technology (E-COST), grants CA16228 - European\r\nNetwork for Game Theory (GAMENET) and E-COST-GRANT-CA16228-c5a69859.\r\n","doi":"10.15479/AT-ISTA-20234","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"_id":"20234","abstract":[{"text":"Game Theory is the mathematical formalization of social dynamics - systems where agents interact over time and the evolution of the state of the system depends on the decisions of every player. \r\nThis thesis takes the perspective of a single player and focuses on what they can guarantee in the worst case over the behavior of other players.\r\nIn other words, we consider that the objective of every other player in the game is exactly the opposite to the player.\r\nWe focus on sustained interactions over time, where the players repeatedly obtain quantitative rewards over time, and they are interested in maximizing their long-term performance.\t\r\nFormally, this thesis focuses on zero-sum games with the liminf average objective.\r\nTwo fundamental questions that Game Theory aims to answer are the following.\r\n\r\n1. How much can a player guarantee to obtain after the interaction?\r\n\r\n2. How to act in order to obtain the previously mentioned guarantee?\r\n\r\nThese questions are formalized by the concepts of \"value\" and \"optimal strategies\". \t\r\nWe study their properties on games that exhibit one or more of the following properties. \r\n\r\n1. Partial Observation: \r\nthe players can not perfectly observe the current state of the system during the game. We consider the model of (finite) Partially Observable Markov Decision Processes and prove that finite-memory strategies are sufficient to approximately guarantee the value.\r\n\r\n2. Perturbed Description: \r\nthe formal description of the game is perturbed by a small parameter.\r\nWe consider the model of (finite) Perturbed Matrix Games, and provide algorithms to check various robustness properties and to compute the parameterized value and optimal strategies.\r\n\r\n3. Stochastic Transitions: \r\nthe actions of the players determine the behavior of the evolution of the system, described as a probability distribution over the next state.\r\nWe consider the model of (finite) Perturbed Stochastic Games and provide formulas for the marginal value.\r\n\r\n4. Infinite States: \r\nthe system can be in infinitely many states.\r\nWe consider the model of Random Dynamic Games on a class of infinite graphs, prove the existence of the value, and quantify the concentration of finite-horizon values.","lang":"eng"}],"status":"public","publication_status":"published","file":[{"date_updated":"2025-08-28T14:47:07Z","success":1,"creator":"rsaonaur","date_created":"2025-08-28T14:47:07Z","file_name":"2025_Saona_Raimundo_Thesis.pdf","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"20240","checksum":"394a651f7de7085e509ef856ffe7bd97","file_size":1503623},{"date_updated":"2025-08-28T14:47:12Z","creator":"rsaonaur","date_created":"2025-08-28T14:47:12Z","file_name":"2025_Saona_Raimundo_Thesis.zip","relation":"source_file","content_type":"application/zip","access_level":"closed","file_id":"20241","file_size":622747,"checksum":"09fb2633e66aac80433d373f4180c5b4"}],"type":"dissertation","day":"27","page":"125","publisher":"Institute of Science and Technology Austria","article_processing_charge":"No","oa":1,"citation":{"chicago":"Saona Urmeneta, Raimundo J. “Robustness of Solutions in Game Theory : Values and Strategies in Partially Observable, Perturbed, Stochastic, and Infinite Games.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT-ISTA-20234\">https://doi.org/10.15479/AT-ISTA-20234</a>.","apa":"Saona Urmeneta, R. J. (2025). <i>Robustness of solutions in game theory : Values and strategies in partially observable, perturbed, stochastic, and infinite games</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-20234\">https://doi.org/10.15479/AT-ISTA-20234</a>","ista":"Saona Urmeneta RJ. 2025. Robustness of solutions in game theory : Values and strategies in partially observable, perturbed, stochastic, and infinite games. Institute of Science and Technology Austria.","ama":"Saona Urmeneta RJ. Robustness of solutions in game theory : Values and strategies in partially observable, perturbed, stochastic, and infinite games. 2025. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20234\">10.15479/AT-ISTA-20234</a>","short":"R.J. Saona Urmeneta, Robustness of Solutions in Game Theory : Values and Strategies in Partially Observable, Perturbed, Stochastic, and Infinite Games, Institute of Science and Technology Austria, 2025.","ieee":"R. J. Saona Urmeneta, “Robustness of solutions in game theory : Values and strategies in partially observable, perturbed, stochastic, and infinite games,” Institute of Science and Technology Austria, 2025.","mla":"Saona Urmeneta, Raimundo J. <i>Robustness of Solutions in Game Theory : Values and Strategies in Partially Observable, Perturbed, Stochastic, and Infinite Games</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20234\">10.15479/AT-ISTA-20234</a>."},"date_created":"2025-08-27T14:00:13Z","year":"2025","corr_author":"1","file_date_updated":"2025-08-28T14:47:12Z","ec_funded":1,"title":"Robustness of solutions in game theory : Values and strategies in partially observable, perturbed, stochastic, and infinite games","related_material":{"record":[{"status":"public","id":"9311","relation":"part_of_dissertation"},{"status":"public","id":"17037","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"18266","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"19508"}]},"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"status":"public","id":"20234","relation":"dissertation_contains"}]},"ec_funded":1,"title":"Marginal values of a stochastic game","article_type":"original","quality_controlled":"1","year":"2025","date_created":"2024-05-22T11:41:14Z","citation":{"ista":"Attia L, Oliu-Barton M, Saona Urmeneta RJ. 2025. Marginal values of a stochastic game. Mathematics of Operations Research. 50(1), 482–505.","ama":"Attia L, Oliu-Barton M, Saona Urmeneta RJ. Marginal values of a stochastic game. <i>Mathematics of Operations Research</i>. 2025;50(1):482-505. doi:<a href=\"https://doi.org/10.1287/moor.2023.0297\">10.1287/moor.2023.0297</a>","chicago":"Attia, Luc, Miquel Oliu-Barton, and Raimundo J Saona Urmeneta. “Marginal Values of a Stochastic Game.” <i>Mathematics of Operations Research</i>. Institute for Operations Research and the Management Sciences, 2025. <a href=\"https://doi.org/10.1287/moor.2023.0297\">https://doi.org/10.1287/moor.2023.0297</a>.","apa":"Attia, L., Oliu-Barton, M., &#38; Saona Urmeneta, R. J. (2025). Marginal values of a stochastic game. <i>Mathematics of Operations Research</i>. Institute for Operations Research and the Management Sciences. <a href=\"https://doi.org/10.1287/moor.2023.0297\">https://doi.org/10.1287/moor.2023.0297</a>","mla":"Attia, Luc, et al. “Marginal Values of a Stochastic Game.” <i>Mathematics of Operations Research</i>, vol. 50, no. 1, Institute for Operations Research and the Management Sciences, 2025, pp. 482–505, doi:<a href=\"https://doi.org/10.1287/moor.2023.0297\">10.1287/moor.2023.0297</a>.","short":"L. Attia, M. Oliu-Barton, R.J. Saona Urmeneta, Mathematics of Operations Research 50 (2025) 482–505.","ieee":"L. Attia, M. Oliu-Barton, and R. J. Saona Urmeneta, “Marginal values of a stochastic game,” <i>Mathematics of Operations Research</i>, vol. 50, no. 1. Institute for Operations Research and the Management Sciences, pp. 482–505, 2025."},"article_processing_charge":"No","publisher":"Institute for Operations Research and the Management Sciences","issue":"1","publication":"Mathematics of Operations Research","page":"482-505","day":"01","volume":50,"type":"journal_article","publication_status":"published","status":"public","_id":"17037","abstract":[{"text":"Zero-sum stochastic games are parameterized by payoffs, transitions, and possibly a discount rate. In this article, we study how the main solution concepts, the discounted and undiscounted values, vary when these parameters are perturbed. We focus on the marginal values, introduced by Mills in 1956 in the context of matrix games—that is, the directional derivatives of the value along any fixed perturbation. We provide a formula for the marginal values of a discounted stochastic game. Further, under mild assumptions on the perturbation, we provide a formula for their limit as the discount rate vanishes and for the marginal values of an undiscounted stochastic game. We also show, via an example, that the two latter differ in general.","lang":"eng"}],"intvolume":"        50","isi":1,"department":[{"_id":"GradSch"},{"_id":"KrCh"}],"doi":"10.1287/moor.2023.0297","acknowledgement":"This work was supported by Fondation CFM pour la Recherche; the European Research Council [Grant ERC-CoG-863818 (ForM-SMArt)]; and Agence Nationale de la Recherche [Grant ANR-21-CE40-0020].","publication_identifier":{"issn":["0364-765X"],"eissn":["1526-5471"]},"external_id":{"isi":["001184648000001"]},"language":[{"iso":"eng"}],"oa_version":"None","scopus_import":"1","month":"02","author":[{"full_name":"Attia, Luc","last_name":"Attia","first_name":"Luc"},{"first_name":"Miquel","last_name":"Oliu-Barton","full_name":"Oliu-Barton, Miquel"},{"full_name":"Saona Urmeneta, Raimundo J","id":"BD1DF4C4-D767-11E9-B658-BC13E6697425","last_name":"Saona Urmeneta","first_name":"Raimundo J","orcid":"0000-0001-5103-038X"}],"date_published":"2025-02-01T00:00:00Z","date_updated":"2026-04-07T12:31:21Z","project":[{"call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818"}]},{"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2506.06441","open_access":"1"}],"_id":"20576","abstract":[{"text":"We prove that a very general class of $N\\times N$ Hermitian random band matrices is in the delocalized phase when the band width $W$ exceeds the critical threshold, $W\\gg \\sqrt{N}$. In this regime, we show that, in the bulk spectrum, the eigenfunctions are fully delocalized, the eigenvalues follow the universal Wigner-Dyson statistics, and quantum unique ergodicity holds for general diagonal observables with an optimal convergence rate. Our results are valid for general variance profiles, arbitrary single entry distributions, in both real-symmetric and complex-Hermitian symmetry classes. In particular, our work substantially generalizes the recent breakthrough result of Yau and Yin [arXiv:2501.01718], obtained for a specific complex Hermitian Gaussian block band matrix. The main technical input is the optimal multi-resolvent local laws -- both in the averaged and fully isotropic form. We also generalize the $\\sqrtη$-rule from [arXiv:2012.13215] to exploit the additional effect of traceless observables. Our analysis is based on the zigzag strategy, complemented with a new global-scale estimate derived using the static version of the master inequalities, while the zig-step and the a priori estimates on the deterministic approximations are proven dynamically.","lang":"eng"}],"OA_place":"repository","status":"public","project":[{"grant_number":"101020331","name":"Random matrices beyond Wigner-Dyson-Mehta","call_identifier":"H2020","_id":"62796744-2b32-11ec-9570-940b20777f1d"}],"date_updated":"2026-04-07T12:32:19Z","publication_status":"draft","author":[{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","full_name":"Erdös, László","last_name":"Erdös","first_name":"László","orcid":"0000-0001-5366-9603"},{"id":"1949f904-edfb-11eb-afb5-e2dfddabb93b","full_name":"Riabov, Volodymyr","last_name":"Riabov","first_name":"Volodymyr"}],"date_published":"2025-06-06T00:00:00Z","oa_version":"Preprint","day":"06","month":"06","type":"preprint","article_processing_charge":"No","language":[{"iso":"eng"}],"publication":"arXiv","citation":{"ieee":"L. Erdös and V. Riabov, “The zigzag strategy for random band matrices,” <i>arXiv</i>. .","short":"L. Erdös, V. Riabov, ArXiv (n.d.).","mla":"Erdös, László, and Volodymyr Riabov. “The Zigzag Strategy for Random Band Matrices.” <i>ArXiv</i>, doi:<a href=\"https://doi.org/10.48550/ARXIV.2506.06441\">10.48550/ARXIV.2506.06441</a>.","ama":"Erdös L, Riabov V. The zigzag strategy for random band matrices. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/ARXIV.2506.06441\">10.48550/ARXIV.2506.06441</a>","ista":"Erdös L, Riabov V. The zigzag strategy for random band matrices. arXiv, <a href=\"https://doi.org/10.48550/ARXIV.2506.06441\">10.48550/ARXIV.2506.06441</a>.","apa":"Erdös, L., &#38; Riabov, V. (n.d.). The zigzag strategy for random band matrices. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/ARXIV.2506.06441\">https://doi.org/10.48550/ARXIV.2506.06441</a>","chicago":"Erdös, László, and Volodymyr Riabov. “The Zigzag Strategy for Random Band Matrices.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/ARXIV.2506.06441\">https://doi.org/10.48550/ARXIV.2506.06441</a>."},"acknowledgement":" Supported by the ERC\r\nAdvanced Grant ”RMTBeyond” No. 101020331.","oa":1,"corr_author":"1","doi":"10.48550/ARXIV.2506.06441","date_created":"2025-10-29T19:09:03Z","year":"2025","related_material":{"record":[{"id":"20575","relation":"dissertation_contains","status":"public"}]},"department":[{"_id":"GradSch"},{"_id":"LaEr"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","title":"The zigzag strategy for random band matrices","ec_funded":1},{"file_date_updated":"2025-10-29T18:54:53Z","ec_funded":1,"title":"Universality in random matrices with spatial structure","related_material":{"record":[{"id":"20322","relation":"part_of_dissertation","status":"public"},{"id":"18764","relation":"part_of_dissertation","status":"public"},{"id":"13317","relation":"part_of_dissertation","status":"public"},{"status":"deleted","id":"19368","relation":"part_of_dissertation"},{"status":"public","id":"18554","relation":"part_of_dissertation"},{"status":"public","id":"20576","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"17174"},{"id":"19547","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"19598"}]},"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_created":"2025-10-29T19:12:24Z","year":"2025","corr_author":"1","oa":1,"citation":{"ista":"Riabov V. 2025. Universality in random matrices with spatial structure. Institute of Science and Technology Austria.","ama":"Riabov V. Universality in random matrices with spatial structure. 2025. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20575\">10.15479/AT-ISTA-20575</a>","chicago":"Riabov, Volodymyr. “Universality in Random Matrices with Spatial Structure.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT-ISTA-20575\">https://doi.org/10.15479/AT-ISTA-20575</a>.","apa":"Riabov, V. (2025). <i>Universality in random matrices with spatial structure</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-20575\">https://doi.org/10.15479/AT-ISTA-20575</a>","ieee":"V. Riabov, “Universality in random matrices with spatial structure,” Institute of Science and Technology Austria, 2025.","short":"V. Riabov, Universality in Random Matrices with Spatial Structure, Institute of Science and Technology Austria, 2025.","mla":"Riabov, Volodymyr. <i>Universality in Random Matrices with Spatial Structure</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20575\">10.15479/AT-ISTA-20575</a>."},"publisher":"Institute of Science and Technology Austria","article_processing_charge":"No","type":"dissertation","page":"436","day":"3","publication_status":"published","file":[{"file_id":"20577","access_level":"open_access","file_size":7536583,"checksum":"6a0487b2b66bb35d44b394756d44b8b4","success":1,"creator":"vriabov","date_updated":"2025-10-29T18:53:59Z","relation":"main_file","content_type":"application/pdf","file_name":"riabov_thesis-pdfa.pdf","date_created":"2025-10-29T18:53:59Z"},{"file_id":"20578","access_level":"closed","checksum":"224efda6bf9864d296a1e5e0124c1e8f","file_size":17841612,"creator":"vriabov","date_updated":"2025-10-29T18:54:53Z","content_type":"application/x-zip-compressed","relation":"source_file","date_created":"2025-10-29T18:54:53Z","file_name":"manuscript.zip"}],"_id":"20575","abstract":[{"text":"This thesis deals with eigenvalue and eigenvector universality results for random matrix ensembles equipped with non-trivial spatial structure. We consider both mean-field models with a general variance profile (Wigner-type matrices) and correlation structure (correlated matrices) among the entries, as well as non-mean-field random band matrices with bandwidth W >> N^(1/2).\r\n\r\nTo extract the universal properties of random matrix spectra and eigenvectors, we obtain concentration estimates for their resolvent, the local laws, which generalize the celebrated Wigner semicircle law for a broad class of random matrices to much finer spectral scales. The local laws hold for both a single resolvent as well as for products of multiple resolvents, known as resolvent chains, and express the remarkable approximately-deterministic behavior of these objects down to the microscopic scale.\r\n\r\nOur primary tool for establishing the local laws is the dynamical Zigzag strategy, which we develop in the setting of spatially-inhomogeneous random matrices. Our proof method systematically addresses the challenges arising from non-trivial spatial structures and is robust to all types of singularities in the spectrum, as we demonstrate in the correlated setting. Furthermore, we incorporate the analysis of the deterministic resolvent chain approximations into the dynamical framework of the Zigzag strategy, synthesizing a unified toolkit for establishing multi-resolvent local laws.\r\n\r\nUsing these methods, we prove complete eigenvector delocalization, the Eigenstate Thermalization Hypothesis, and Wigner-Dyson universality in the bulk for random band matrices down to the optimal bandwidth W >> N^(1/2). For mean-field ensembles, we establish universality of local eigenvalue statistics at the cups for random matrices with correlated entries, and the Eigenstate Thermalization Hypothesis for Wigner-type matrices in the bulk of the spectrum.\r\n\r\nFinally, this thesis also contains other applications of the multi-resolvent local laws to spatially-inhomogeneous random matrices, obtained prior to the development of the Zigzag strategy. In particular, we provide a complete analysis of mesoscopic linear-eigenvalue statistics of Wigner-type matrices in all spectral regimes, including the novel cusps, and rigorously establish the prethermalization phenomenon for deformed Wigner matrices.\r\n\r\nThe main body of this thesis consists of seven research papers (listed on page xi), each presented in a separate chapter with its own introduction and all relevant context, suitable to be read independently. We ask the reader’s indulgence for the repetitions in the historical overviews and other minor redundancies that remain among the chapters as a result. The overall Introduction, preceding the chapters, provides a condensed, informal summary of the main ideas and concepts at the core of these works.\r\n","lang":"eng"}],"status":"public","department":[{"_id":"GradSch"},{"_id":"LaEr"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"doi":"10.15479/AT-ISTA-20575","supervisor":[{"orcid":"0000-0001-5366-9603","first_name":"László","last_name":"Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","full_name":"Erdös, László"}],"publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-064-0"]},"acknowledgement":"The work comprising this thesis was supported by the ERC Advanced Grant \"RMTBeyond\"\r\nNo.101020331 awarded to my advisor.","language":[{"iso":"eng"}],"month":"11","oa_version":"Published Version","has_accepted_license":"1","date_published":"2025-11-03T00:00:00Z","alternative_title":["ISTA Thesis"],"ddc":["515","519"],"author":[{"id":"1949f904-edfb-11eb-afb5-e2dfddabb93b","last_name":"Riabov","full_name":"Riabov, Volodymyr","first_name":"Volodymyr"}],"OA_place":"publisher","degree_awarded":"PhD","project":[{"grant_number":"101020331","call_identifier":"H2020","_id":"62796744-2b32-11ec-9570-940b20777f1d","name":"Random matrices beyond Wigner-Dyson-Mehta"}],"date_updated":"2026-04-07T12:32:20Z"},{"language":[{"iso":"eng"}],"oa_version":"Published Version","has_accepted_license":"1","month":"12","author":[{"last_name":"Rella","id":"B4765ACA-AA38-11E9-AC9A-0930E6697425","full_name":"Rella, Simon","first_name":"Simon"}],"date_published":"2025-12-15T00:00:00Z","ddc":["616","576","614","519"],"alternative_title":["ISTA Thesis"],"OA_place":"publisher","degree_awarded":"PhD","date_updated":"2026-04-07T12:34:58Z","department":[{"_id":"GradSch"},{"_id":"GaTk"},{"_id":"FyKo"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"doi":"10.15479/AT-ISTA-20811","supervisor":[{"orcid":"0000-0002-6699-1455","first_name":"Gašper","full_name":"Tkačik, Gašper","last_name":"Tkačik","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Fyodor","orcid":"0000-0001-8243-4694","last_name":"Kondrashov","id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","full_name":"Kondrashov, Fyodor"}],"publication_identifier":{"issn":["2663-337X"]},"article_processing_charge":"No","publisher":"Institute of Science and Technology Austria","page":"95","day":"15","type":"dissertation","publication_status":"published","file":[{"file_id":"20831","access_level":"open_access","checksum":"a0bd7a585720e60df284101b8afdf6bb","file_size":29019662,"creator":"srella","success":1,"date_updated":"2025-12-16T21:49:52Z","content_type":"application/pdf","relation":"main_file","date_created":"2025-12-16T21:49:52Z","file_name":"2025_Rella_Simon_Thesis.pdf"},{"creator":"srella","date_updated":"2025-12-16T21:52:19Z","relation":"source_file","content_type":"application/zip","file_name":"2025_Rella_Simon_Thesis_Sourcefiles.zip","date_created":"2025-12-16T21:52:19Z","file_id":"20832","access_level":"open_access","checksum":"b8b3a90932ae1d96d307838710f46e32","file_size":42094025}],"_id":"20811","abstract":[{"text":"\tThis thesis is organized into two parts, each comprising two chapters: Chapter 1 and 2 offer models for the evolution of vaccine resistance in response to diverse vaccination strategies. Chapter 3 and 4 review the statistics of records, their connection to models of innovation and an application to the cultural evolution of sports.\r\n\tIn chapter 1 we present a modelling study from 2021 on the evolution of SARS-CoV-2. At that time the vaccine-resistant Omicron variant had not yet evolved. In our model we consider a population that is becoming vaccinated over time, while a pathogen is spreading in the population and eventually becoming resistant to the vaccine. We explore effective pharmaceutical and non-pharmaceutical interventions to prevent the emergence of vaccine resistance. \r\n\tIn chapter 2 we model a particular set of complex vaccination strategies, mosaic and pyramid vaccination, where an immunologically diverse portfolio of vaccines is considered. We find that a bet-hatching strategy, in which vaccine types are distributed in the population, is effective at hindering the evolution of vaccine resistance if mutation rates are high. \r\n\tIn chapter 3 we switch gears and present a review on the statistics of records. We highlight similarities and analogies to other models in the fields of statistical physics, evolution and innovation. This offers interesting complimentary perspectives on well-known models. \r\n\tIn chapter 4 we apply models of record statistics and innovation to study cultural evolution in sport. We propose a model of sport evolution that combines deterministic improvements in performance and stochastic bursts of improvements due to innovation. ","lang":"eng"}],"status":"public","related_material":{"record":[{"status":"public","id":"18307","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"9905"}]},"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","file_date_updated":"2025-12-16T21:52:19Z","title":"Adaptive processes in biology and culture : Models of evolving vaccine resistance and the record statistics of innovation","corr_author":"1","date_created":"2025-12-12T14:39:56Z","year":"2025","citation":{"ieee":"S. Rella, “Adaptive processes in biology and culture : Models of evolving vaccine resistance and the record statistics of innovation,” Institute of Science and Technology Austria, 2025.","mla":"Rella, Simon. <i>Adaptive Processes in Biology and Culture : Models of Evolving Vaccine Resistance and the Record Statistics of Innovation</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20811\">10.15479/AT-ISTA-20811</a>.","short":"S. Rella, Adaptive Processes in Biology and Culture : Models of Evolving Vaccine Resistance and the Record Statistics of Innovation, Institute of Science and Technology Austria, 2025.","ista":"Rella S. 2025. Adaptive processes in biology and culture : Models of evolving vaccine resistance and the record statistics of innovation. Institute of Science and Technology Austria.","ama":"Rella S. Adaptive processes in biology and culture : Models of evolving vaccine resistance and the record statistics of innovation. 2025. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20811\">10.15479/AT-ISTA-20811</a>","chicago":"Rella, Simon. “Adaptive Processes in Biology and Culture : Models of Evolving Vaccine Resistance and the Record Statistics of Innovation.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT-ISTA-20811\">https://doi.org/10.15479/AT-ISTA-20811</a>.","apa":"Rella, S. (2025). <i>Adaptive processes in biology and culture : Models of evolving vaccine resistance and the record statistics of innovation</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-20811\">https://doi.org/10.15479/AT-ISTA-20811</a>"},"oa":1},{"supervisor":[{"first_name":"Tim P","orcid":"0000-0003-3295-6181","full_name":"Vogels, Tim P","last_name":"Vogels","id":"CB6FF8D2-008F-11EA-8E08-2637E6697425"},{"full_name":"Sweeney, Lora Beatrice Jaeger","last_name":"Sweeney","id":"56BE8254-C4F0-11E9-8E45-0B23E6697425","orcid":"0000-0001-9242-5601","first_name":"Lora Beatrice Jaeger"}],"publication_identifier":{"issn":["2791-4585"]},"doi":"10.15479/AT-ISTA-20735","department":[{"_id":"GradSch"},{"_id":"TiVo"},{"_id":"LoSw"}],"OA_place":"publisher","degree_awarded":"MS","date_updated":"2026-04-07T12:36:08Z","author":[{"first_name":"Alexia C","orcid":"0000-0001-6191-1367","last_name":"Wilson","id":"5230e794-15b2-11ec-abd3-e2d5335ebd1d","full_name":"Wilson, Alexia C"}],"date_published":"2025-12-09T00:00:00Z","ddc":["570","596","005"],"alternative_title":["ISTA Master's Thesis"],"oa_version":"Published Version","has_accepted_license":"1","month":"12","language":[{"iso":"eng"}],"citation":{"mla":"Wilson, Alexia C. <i>Modelling the Spinal Cord of a Tadpole : Exploring Different Ways to Model the Spinal Cord in the Xenopus Frog</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20735\">10.15479/AT-ISTA-20735</a>.","short":"A.C. Wilson, Modelling the Spinal Cord of a Tadpole : Exploring Different Ways to Model the Spinal Cord in the Xenopus Frog, Institute of Science and Technology Austria, 2025.","ieee":"A. C. Wilson, “Modelling the spinal cord of a tadpole : Exploring different ways to model the spinal cord in the Xenopus frog,” Institute of Science and Technology Austria, 2025.","ama":"Wilson AC. Modelling the spinal cord of a tadpole : Exploring different ways to model the spinal cord in the Xenopus frog. 2025. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20735\">10.15479/AT-ISTA-20735</a>","ista":"Wilson AC. 2025. Modelling the spinal cord of a tadpole : Exploring different ways to model the spinal cord in the Xenopus frog. Institute of Science and Technology Austria.","apa":"Wilson, A. C. (2025). <i>Modelling the spinal cord of a tadpole : Exploring different ways to model the spinal cord in the Xenopus frog</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-20735\">https://doi.org/10.15479/AT-ISTA-20735</a>","chicago":"Wilson, Alexia C. “Modelling the Spinal Cord of a Tadpole : Exploring Different Ways to Model the Spinal Cord in the Xenopus Frog.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT-ISTA-20735\">https://doi.org/10.15479/AT-ISTA-20735</a>."},"oa":1,"corr_author":"1","date_created":"2025-12-08T09:49:41Z","year":"2025","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"13097"}]},"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","file_date_updated":"2026-01-04T12:58:49Z","title":"Modelling the spinal cord of a tadpole : Exploring different ways to model the spinal cord in the Xenopus frog","abstract":[{"text":"Left–right alternation is a defining feature of spinal locomotor circuits, yet the level of neuronal\r\ndetail required to generate and maintain this pattern remains unclear. This thesis investigates how\r\nmodels spanning multiple levels of abstraction—from biophysically detailed Hodgkin–Huxley (HH)\r\nneurons to adaptive integrate–and–fire (I&F) formulations and synfire-chain modules—can account\r\nfor the generation of fictive swimming in the spinal cord of the Xenopus laevis tadpole. The guiding\r\nhypothesis is that a small set of neuronal mechanisms is sufficient to reproduce the essential features\r\nof rhythmic alternation, and that moving between modeling scales helps distinguish core principles\r\nfrom biological detail.\r\nA minimal bilateral HH network comprising only four canonical neuron classes—excitatory\r\ndescending interneurons (dINs), inhibitory commissural interneurons (cINs), ipsilateral inhibitory\r\ninterneurons (aINs) and motoneurons—served as a biophysical proof of concept. Tuned to reproduce\r\nexperimentally observed firing modes, the model demonstrated that rebound-prone dIN excitability,\r\ncontralateral inhibition and modest electrical coupling are sufficient to generate stable alternating\r\nactivity, even in very small networks. These results motivated the transition to simpler models\r\ncapable of efficient analysis and scaling.\r\nAdaptive exponential I&F (AdEx) neurons were calibrated to physiological recordings using\r\nsimulation-based inference, yielding tonic and phasic/rebound templates that preserved the key\r\ndynamical signatures of the HH model. Phase-plane analysis clarified the mechanisms underlying\r\nsingle-spike responses and rebound firing in dINs. At network level, the I&F models robustly\r\nreproduced left–right alternation, while highlighting constraints on synaptic kinetics and adaptation\r\nneeded to avoid multi-spike responses.\r\nFinally, a synfire-chain framework provided a complementary, timing-centric perspective, demonstrating how precise spike synchrony, synaptic delays and minimal inhibitory coupling can generate\r\nalternating left–right sequences in a feedforward setting. Together, these approaches converge on a\r\ncommon conclusion: rebound-prone ipsilateral excitation combined with precisely timed contralateral inhibition constitutes a sufficient substrate for alternating spinal rhythms.\r\nBy integrating bottom-up and top-down modeling strategies, this thesis provides a unified, extensible framework for studying spinal pattern generation. The results show that essential locomotor\r\ndynamics can be captured across multiple abstraction levels, offering both mechanistic insight and\r\npractical tools for future data-driven investigations of spinal circuit development, robustness and\r\nmodulation.","lang":"eng"}],"_id":"20735","status":"public","publication_status":"published","file":[{"date_created":"2026-01-01T17:26:30Z","file_name":"tadpoleAdEx.zip","relation":"source_file","content_type":"application/zip","date_updated":"2026-01-02T13:05:07Z","creator":"awilson","file_size":566072368,"checksum":"9e3b6b73f8cbec2c3687d17fe8e30410","access_level":"closed","file_id":"20919"},{"file_name":"Masters_Thesis_Alexia_Wilson_FINAL_pdfA.pdf","date_created":"2026-01-04T12:58:49Z","relation":"main_file","content_type":"application/pdf","date_updated":"2026-01-04T12:58:49Z","success":1,"creator":"awilson","checksum":"13f4c0d33923e9d5c9d56731345cf21d","file_size":7170097,"access_level":"open_access","file_id":"20923"}],"page":"110","day":"09","type":"dissertation","article_processing_charge":"No","publisher":"Institute of Science and Technology Austria"},{"language":[{"iso":"eng"}],"has_accepted_license":"1","oa_version":"Published Version","month":"12","author":[{"id":"133F200A-B015-11E9-AD41-0EDAE5697425","last_name":"Wald","full_name":"Wald, Sebastian","first_name":"Sebastian","orcid":"0000-0002-5869-1604"}],"ddc":["530"],"alternative_title":["ISTA Thesis"],"date_published":"2025-12-11T00:00:00Z","date_updated":"2026-04-07T12:35:11Z","OA_place":"publisher","degree_awarded":"PhD","department":[{"_id":"GradSch"},{"_id":"OnHo"}],"tmp":{"image":"/images/cc_by_nc.png","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)"},"doi":"10.15479/AT-ISTA-20798","publication_identifier":{"isbn":["978-3-99078-075-6"],"issn":["2663-337X"]},"supervisor":[{"orcid":"0000-0002-2031-204X","first_name":"Onur","last_name":"Hosten","id":"4C02D85E-F248-11E8-B48F-1D18A9856A87","full_name":"Hosten, Onur"}],"article_processing_charge":"No","publisher":"Institute of Science and Technology Austria","keyword":["entanglement-enhanced atom interferometry","cavity QED","spin-squeezing","dipole trap","quantum optics"],"page":"152","day":"11","type":"dissertation","file":[{"embargo":"2026-06-15","creator":"swald","date_updated":"2025-12-17T09:46:34Z","content_type":"application/pdf","relation":"main_file","file_name":"2025_Wald_Sebastian_Thesis.pdf","date_created":"2025-12-12T11:53:42Z","file_id":"20809","access_level":"closed","file_size":47536855,"checksum":"1be72faf529a5e8a2d03cb3d5f808b77","embargo_to":"open_access"},{"file_id":"20810","access_level":"closed","checksum":"8c3a1904dceb4bcd04bc9f14b2594bab","file_size":40127601,"creator":"swald","date_updated":"2025-12-12T13:07:32Z","content_type":"application/x-zip-compressed","relation":"source_file","date_created":"2025-12-12T11:54:55Z","file_name":"2025_Wald_Sebastian_Thesis.zip"}],"publication_status":"published","status":"public","_id":"20798","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","related_material":{"record":[{"relation":"part_of_dissertation","id":"14759","status":"public"}]},"title":"Atoms in a propagating-wave cavity for squeezed Mach-Zehnder atom interferometry","file_date_updated":"2025-12-17T09:46:34Z","corr_author":"1","year":"2025","date_created":"2025-12-11T11:48:11Z","citation":{"mla":"Wald, Sebastian. <i>Atoms in a Propagating-Wave Cavity for Squeezed Mach-Zehnder Atom Interferometry</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20798\">10.15479/AT-ISTA-20798</a>.","ieee":"S. Wald, “Atoms in a propagating-wave cavity for squeezed Mach-Zehnder atom interferometry,” Institute of Science and Technology Austria, 2025.","short":"S. Wald, Atoms in a Propagating-Wave Cavity for Squeezed Mach-Zehnder Atom Interferometry, Institute of Science and Technology Austria, 2025.","ista":"Wald S. 2025. Atoms in a propagating-wave cavity for squeezed Mach-Zehnder atom interferometry. Institute of Science and Technology Austria.","ama":"Wald S. Atoms in a propagating-wave cavity for squeezed Mach-Zehnder atom interferometry. 2025. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20798\">10.15479/AT-ISTA-20798</a>","chicago":"Wald, Sebastian. “Atoms in a Propagating-Wave Cavity for Squeezed Mach-Zehnder Atom Interferometry.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT-ISTA-20798\">https://doi.org/10.15479/AT-ISTA-20798</a>.","apa":"Wald, S. (2025). <i>Atoms in a propagating-wave cavity for squeezed Mach-Zehnder atom interferometry</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-20798\">https://doi.org/10.15479/AT-ISTA-20798</a>"},"OA_embargo":"6"},{"ddc":["570"],"alternative_title":["ISTA Thesis"],"date_published":"2025-08-08T00:00:00Z","author":[{"last_name":"Dos Reis Rodrigues","id":"26E95904-5160-11E9-9C0B-C5B0DC97E90F","full_name":"Dos Reis Rodrigues, Patricia","first_name":"Patricia","orcid":"0000-0003-1681-508X"}],"date_updated":"2026-04-07T12:36:26Z","project":[{"name":"Pushing from within: Control of cell shape, integrity and motility by cytoskeletal pushing forces","_id":"bd91e723-d553-11ed-ba76-fe7eeb2185fd","grant_number":"101071793"}],"degree_awarded":"PhD","OA_place":"publisher","acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"},{"_id":"M-Shop"},{"_id":"NanoFab"}],"language":[{"iso":"eng"}],"month":"08","has_accepted_license":"1","oa_version":"Published Version","doi":"10.15479/AT-ISTA-20149","publication_identifier":{"issn":["2663-337X"]},"supervisor":[{"orcid":"0000-0002-6620-9179","first_name":"Michael K","full_name":"Sixt, Michael K","last_name":"Sixt","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87"}],"acknowledgement":"I would like to acknowledge the\r\nfinancial support of the European Research Council through the ERC-SyG grant “Pushing from\r\nwithin: Control of cell shape, integrity and motility by cytoskeletal pushing forces”\r\n(01071793), which made this research possible. ","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"department":[{"_id":"GradSch"},{"_id":"MiSi"}],"file":[{"relation":"main_file","content_type":"application/pdf","date_created":"2025-08-27T12:59:10Z","file_name":"2025_ReisRodrigues_Patricia_Thesis.pdf","creator":"prodrigu","success":1,"date_updated":"2025-08-27T12:59:10Z","checksum":"fda8a1070667c3562263f4867609b41b","file_size":63885565,"file_id":"20232","access_level":"open_access"},{"checksum":"e8b65affcbce846a926454df4b2867b9","file_size":50483434,"access_level":"closed","file_id":"20233","date_created":"2025-08-27T13:00:30Z","file_name":"2025_ReisRodrigues_Patricia_Thesis.docx","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","relation":"source_file","date_updated":"2025-08-27T13:02:28Z","creator":"prodrigu"}],"publication_status":"published","status":"public","_id":"20149","abstract":[{"text":"Immune responses depend on the coordinated and efficient migration of leukocytes. These\r\ncells, which are embedded and tightly confined within tissues, must navigate and traverse\r\ndiverse and complex three-dimensional environments. Leukocytes adapt their locomotory\r\nbehavior to the mechanical, geometrical, and biochemical characteristics of their\r\nsurroundings. In low-density environments, where the pore size of the interstitial matrix\r\nallows free passage, these cells position the nucleus directly behind the lamellipodium, the\r\nprotrusive actin structure that forms the leading front of the cell. In this configuration, they\r\nuse the nucleus as a gauge to identify the path of least resistance.\r\nHere, we show that in high-density environments, where the pore size precludes free passage\r\nof the cell body, leukocytes reposition the microtubule-organizing center (MTOC) and\r\nassociated organelles in front of the nucleus. In this configuration, they use actin structures\r\nprotruding orthogonally to the direction of migration in order to open a path for the cell body.\r\nWe identify two distinct actin populations that serve this purpose at different subcellular\r\nlocalizations. At the leading edge, local indentation of the plasma membrane leads to\r\nrecruitment of the Wiskott-Aldrich syndrome protein (WASp), which, via Arp2/3, results in\r\nthe formation of individual actin foci. At the cell body, actin polymerization is triggered by\r\nDOCK8, a Cdc42 exchange factor, resulting in the formation of a central actin pool.\r\nWe demonstrate that the central and peripheral actin pools are functionally communicating\r\nand that depletion of the central actin pool leads to increased actin accumulation at the cell\r\nfront, resulting in excessive extension of the leading edge.","lang":"eng"}],"publisher":"Institute of Science and Technology Austria","article_processing_charge":"No","type":"dissertation","day":"08","page":"114","year":"2025","date_created":"2025-08-08T09:18:02Z","corr_author":"1","oa":1,"citation":{"ama":"Dos Reis Rodrigues P. Coordination of protrusive forces in immune cell migration . 2025. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20149\">10.15479/AT-ISTA-20149</a>","ista":"Dos Reis Rodrigues P. 2025. Coordination of protrusive forces in immune cell migration . Institute of Science and Technology Austria.","apa":"Dos Reis Rodrigues, P. (2025). <i>Coordination of protrusive forces in immune cell migration </i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-20149\">https://doi.org/10.15479/AT-ISTA-20149</a>","chicago":"Dos Reis Rodrigues, Patricia. “Coordination of Protrusive Forces in Immune Cell Migration .” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT-ISTA-20149\">https://doi.org/10.15479/AT-ISTA-20149</a>.","short":"P. Dos Reis Rodrigues, Coordination of Protrusive Forces in Immune Cell Migration , Institute of Science and Technology Austria, 2025.","ieee":"P. Dos Reis Rodrigues, “Coordination of protrusive forces in immune cell migration ,” Institute of Science and Technology Austria, 2025.","mla":"Dos Reis Rodrigues, Patricia. <i>Coordination of Protrusive Forces in Immune Cell Migration </i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20149\">10.15479/AT-ISTA-20149</a>."},"title":"Coordination of protrusive forces in immune cell migration ","file_date_updated":"2025-08-27T13:02:28Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","related_material":{"record":[{"status":"public","id":"10703","relation":"part_of_dissertation"},{"status":"public","id":"20082","relation":"part_of_dissertation"}]}},{"ddc":["516"],"alternative_title":["ISTA Thesis"],"date_published":"2025-09-10T00:00:00Z","author":[{"last_name":"Tasinato","full_name":"Tasinato, Gianluca","id":"0433290C-AF8F-11E9-A4C7-F729E6697425","first_name":"Gianluca"}],"date_updated":"2026-04-07T12:36:51Z","degree_awarded":"PhD","OA_place":"publisher","language":[{"iso":"eng"}],"month":"09","has_accepted_license":"1","oa_version":"Published Version","doi":"10.15479/AT-ISTA-20339","publication_identifier":{"issn":["2663-337X"]},"supervisor":[{"last_name":"Wagner","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","full_name":"Wagner, Uli","orcid":"0000-0002-1494-0568","first_name":"Uli"}],"department":[{"_id":"GradSch"},{"_id":"UlWa"}],"tmp":{"image":"/images/cc_by_nc_sa.png","short":"CC BY-NC-SA (4.0)","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode"},"file":[{"access_level":"closed","file_id":"20344","checksum":"ae097a515b9bb4d4b025ca854ae2ed76","file_size":2218562,"date_updated":"2025-09-11T12:24:12Z","creator":"gtasinat","file_name":"thesis-source.zip","date_created":"2025-09-11T12:24:12Z","relation":"source_file","content_type":"application/x-zip-compressed"},{"date_created":"2025-09-11T12:26:14Z","file_name":"2025_Tasinato_Gianluca_Thesis.pdf","content_type":"application/pdf","relation":"main_file","date_updated":"2025-09-11T12:26:14Z","creator":"gtasinat","success":1,"checksum":"04b2e016409e52167ce42b0eef839fbf","file_size":10071982,"access_level":"open_access","file_id":"20345"}],"publication_status":"published","status":"public","_id":"20339","abstract":[{"lang":"eng","text":"This thesis investigates the interplay between algebraic and topological methods and combinatorial problems, focusing on approximate graph colourings and mass partitioning. The unifying theme throughout the dissertation is the use of continuous maps and symmetry constraints to extract combinatorial insights.\r\n\r\nWe first explore approximate graph colouring problems and more generally promise constraint satisfaction problems. Using tools from equivariant topology in combination with the general theory of polymorphism of a promise constraint satisfaction problem, we establish hardness for specific types of approximations.\r\n\r\nIn the second part, we address mass partitioning problems, where one seeks to divide geometric objects or measures in Euclidean space into parts of equal size using hyperplanes. Employing techniques from topological combinatorics (configuration space/test map setup and Borsuk–Ulam type theorems), we both obtain a new equipartitioning result in the and provide a fast algorithm for computing equipartitioning of point sets in 3D.\r\n"}],"publisher":"Institute of Science and Technology Austria","article_processing_charge":"No","type":"dissertation","day":"10","page":"106","year":"2025","date_created":"2025-09-10T12:17:55Z","corr_author":"1","oa":1,"citation":{"short":"G. Tasinato, Topological Methods in Discrete Geometry and Theoretical Computer Science : Measure Partitioning and Constraint Satisfaction Problems, Institute of Science and Technology Austria, 2025.","ieee":"G. Tasinato, “Topological methods in discrete geometry and theoretical computer science : Measure partitioning and constraint satisfaction problems,” Institute of Science and Technology Austria, 2025.","mla":"Tasinato, Gianluca. <i>Topological Methods in Discrete Geometry and Theoretical Computer Science : Measure Partitioning and Constraint Satisfaction Problems</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20339\">10.15479/AT-ISTA-20339</a>.","ista":"Tasinato G. 2025. Topological methods in discrete geometry and theoretical computer science : Measure partitioning and constraint satisfaction problems. Institute of Science and Technology Austria.","ama":"Tasinato G. Topological methods in discrete geometry and theoretical computer science : Measure partitioning and constraint satisfaction problems. 2025. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20339\">10.15479/AT-ISTA-20339</a>","chicago":"Tasinato, Gianluca. “Topological Methods in Discrete Geometry and Theoretical Computer Science : Measure Partitioning and Constraint Satisfaction Problems.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT-ISTA-20339\">https://doi.org/10.15479/AT-ISTA-20339</a>.","apa":"Tasinato, G. (2025). <i>Topological methods in discrete geometry and theoretical computer science : Measure partitioning and constraint satisfaction problems</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-20339\">https://doi.org/10.15479/AT-ISTA-20339</a>"},"title":"Topological methods in discrete geometry and theoretical computer science : Measure partitioning and constraint satisfaction problems","file_date_updated":"2025-09-11T12:26:14Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","related_material":{"record":[{"relation":"part_of_dissertation","id":"20008","status":"public"},{"relation":"part_of_dissertation","id":"15168","status":"public"},{"status":"public","id":"19860","relation":"part_of_dissertation"}]}},{"publisher":"Institute of Science and Technology Austria","article_processing_charge":"No","type":"dissertation","day":"10","page":"720","file":[{"checksum":"b8477ae5578436c72c3bb4193ad34ac5","file_size":4107587,"access_level":"closed","file_id":"19542","date_created":"2025-04-10T21:14:18Z","file_name":"Henheik-Thesis_source_final.zip","content_type":"application/zip","relation":"source_file","date_updated":"2025-04-10T21:14:18Z","creator":"shenheik"},{"checksum":"e9fc0ea12ec46c9f71110c33217c4140","file_size":9999492,"file_id":"19553","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_name":"Henheik-Thesis-pdfa_FINAL.pdf","date_created":"2025-04-11T13:16:05Z","success":1,"creator":"shenheik","date_updated":"2025-04-11T13:16:05Z"},{"access_level":"closed","file_id":"19615","file_size":13276442,"checksum":"f94580f86c785e7108eb116cd189e225","date_updated":"2025-04-23T14:10:27Z","creator":"cchlebak","date_created":"2025-04-23T14:10:27Z","file_name":"Henheik-Thesis-Volume1_print.pdf","content_type":"application/pdf","relation":"other"},{"creator":"cchlebak","date_updated":"2025-04-23T14:11:05Z","relation":"other","content_type":"application/pdf","date_created":"2025-04-23T14:11:05Z","file_name":"Henheik-Thesis-Volume2_print.pdf","file_id":"19616","access_level":"closed","checksum":"b927ead3c78020ffb32918911deedb74","file_size":7628767}],"publication_status":"published","status":"public","_id":"19540","abstract":[{"lang":"eng","text":"This thesis deals with several different models for complex quantum mechanical systems and is structured in three main parts. \r\n\t\r\nIn Part I, we study mean field random matrices as models for quantum Hamiltonians. Our focus lies on proving concentration estimates for resolvents of random matrices, so-called local laws, mostly in the setting of multiple resolvents. These estimates have profound consequences for eigenvector overlaps and thermalization problems. More concretely, we obtain, e.g., the optimal eigenstate thermalization hypothesis (ETH) uniformly in the spectrum for Wigner matrices, an optimal lower bound on non-Hermitian eigenvector overlaps, and prethermalization for deformed Wigner matrices.\tIn order to prove our novel multi-resolvent local laws, we develop and devise two main methods, the static Psi-method and the dynamical Zigzag strategy. \r\n\t\r\nIn Part II, we study Bardeen-Cooper-Schrieffer (BCS) theory, the standard mean field microscopic theory of superconductivity. We focus on asymptotic formulas for the characteristic critical temperature and energy gap of a superconductor and prove universality of their ratio in various physical regimes. Additionally, we investigate multi-band superconductors and show that inter-band coupling effects can only enhance the critical temperature. \r\n\t\r\nIn Part III, we study quantum lattice systems. On the one hand, we show a strong version of the local-perturbations-perturb-locally (LPPL) principle for the ground state of weakly interacting quantum spin systems with a uniform on-site gap. On the other hand, we introduce a notion of a local gap and rigorously justify response theory and the Kubo formula under the weakened assumption of a local gap. \r\n\t\r\nAdditionally, we discuss two classes of problems which do not fit into the three main parts of the thesis. These are deformational rigidity of Liouville metrics on the torus and relativistic toy models of particle creation via interior-boundary-conditions (IBCs).  "}],"ec_funded":1,"title":"Modeling complex quantum systems : Random matrices, BCS theory, and quantum lattice systems","file_date_updated":"2025-04-23T14:11:05Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","related_material":{"record":[{"relation":"part_of_dissertation","id":"14343","status":"public"},{"relation":"part_of_dissertation","id":"18656","status":"public"},{"id":"13317","relation":"part_of_dissertation","status":"public"},{"status":"public","id":"11732","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"12184","status":"public"},{"relation":"part_of_dissertation","id":"14421","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"10623"},{"status":"public","relation":"part_of_dissertation","id":"18112"},{"status":"public","id":"19001","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"10642"},{"status":"public","id":"19545","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"19546","status":"public"},{"relation":"part_of_dissertation","id":"19550","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"19551"},{"id":"19552","relation":"part_of_dissertation","status":"public"},{"id":"14542","relation":"part_of_dissertation","status":"public"},{"status":"public","id":"17049","relation":"part_of_dissertation"},{"status":"public","id":"18764","relation":"part_of_dissertation"},{"id":"19547","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"19548"}]},"year":"2025","date_created":"2025-04-10T21:21:18Z","corr_author":"1","oa":1,"citation":{"mla":"Henheik, Sven Joscha. <i>Modeling Complex Quantum Systems : Random Matrices, BCS Theory, and Quantum Lattice Systems</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-19540\">10.15479/AT-ISTA-19540</a>.","ieee":"S. J. Henheik, “Modeling complex quantum systems : Random matrices, BCS theory, and quantum lattice systems,” Institute of Science and Technology Austria, 2025.","short":"S.J. Henheik, Modeling Complex Quantum Systems : Random Matrices, BCS Theory, and Quantum Lattice Systems, Institute of Science and Technology Austria, 2025.","ista":"Henheik SJ. 2025. Modeling complex quantum systems : Random matrices, BCS theory, and quantum lattice systems. Institute of Science and Technology Austria.","ama":"Henheik SJ. Modeling complex quantum systems : Random matrices, BCS theory, and quantum lattice systems. 2025. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-19540\">10.15479/AT-ISTA-19540</a>","chicago":"Henheik, Sven Joscha. “Modeling Complex Quantum Systems : Random Matrices, BCS Theory, and Quantum Lattice Systems.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT-ISTA-19540\">https://doi.org/10.15479/AT-ISTA-19540</a>.","apa":"Henheik, S. J. (2025). <i>Modeling complex quantum systems : Random matrices, BCS theory, and quantum lattice systems</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-19540\">https://doi.org/10.15479/AT-ISTA-19540</a>"},"language":[{"iso":"eng"}],"month":"04","has_accepted_license":"1","oa_version":"Published Version","ddc":["519"],"alternative_title":["ISTA Thesis"],"date_published":"2025-04-10T00:00:00Z","author":[{"id":"31d731d7-d235-11ea-ad11-b50331c8d7fb","full_name":"Henheik, Sven Joscha","last_name":"Henheik","orcid":"0000-0003-1106-327X","first_name":"Sven Joscha"}],"date_updated":"2026-04-07T12:37:12Z","project":[{"name":"Random matrices beyond Wigner-Dyson-Mehta","call_identifier":"H2020","_id":"62796744-2b32-11ec-9570-940b20777f1d","grant_number":"101020331"}],"degree_awarded":"PhD","OA_place":"publisher","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"department":[{"_id":"GradSch"},{"_id":"LaEr"}],"doi":"10.15479/AT-ISTA-19540","publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-057-2"]},"supervisor":[{"first_name":"László","orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös","full_name":"Erdös, László"}]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"status":"public","id":"18688","relation":"earlier_version"}]},"ec_funded":1,"title":"Human hippocampal CA3 uses specific functional connectivity rules for efficient associative memory","file_date_updated":"2025-01-27T08:46:33Z","citation":{"chicago":"Watson, Jake, Victor M Vargas Barroso, Rebecca Morse, Andrea C Navas Olivé, Mojtaba Tavakoli, Johann G Danzl, Matthias Tomschik, Karl Rössler, and Peter M Jonas. “Human Hippocampal CA3 Uses Specific Functional Connectivity Rules for Efficient Associative Memory.” <i>Cell</i>. Elsevier, 2025. <a href=\"https://doi.org/10.1016/j.cell.2024.11.022\">https://doi.org/10.1016/j.cell.2024.11.022</a>.","apa":"Watson, J., Vargas Barroso, V. M., Morse, R., Navas Olivé, A. C., Tavakoli, M., Danzl, J. G., … Jonas, P. M. (2025). Human hippocampal CA3 uses specific functional connectivity rules for efficient associative memory. <i>Cell</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.cell.2024.11.022\">https://doi.org/10.1016/j.cell.2024.11.022</a>","ista":"Watson J, Vargas Barroso VM, Morse R, Navas Olivé AC, Tavakoli M, Danzl JG, Tomschik M, Rössler K, Jonas PM. 2025. Human hippocampal CA3 uses specific functional connectivity rules for efficient associative memory. Cell. 188(2), 501–514.e18.","ama":"Watson J, Vargas Barroso VM, Morse R, et al. Human hippocampal CA3 uses specific functional connectivity rules for efficient associative memory. <i>Cell</i>. 2025;188(2):501-514.e18. doi:<a href=\"https://doi.org/10.1016/j.cell.2024.11.022\">10.1016/j.cell.2024.11.022</a>","ieee":"J. Watson <i>et al.</i>, “Human hippocampal CA3 uses specific functional connectivity rules for efficient associative memory,” <i>Cell</i>, vol. 188, no. 2. Elsevier, p. 501–514.e18, 2025.","mla":"Watson, Jake, et al. “Human Hippocampal CA3 Uses Specific Functional Connectivity Rules for Efficient Associative Memory.” <i>Cell</i>, vol. 188, no. 2, Elsevier, 2025, p. 501–514.e18, doi:<a href=\"https://doi.org/10.1016/j.cell.2024.11.022\">10.1016/j.cell.2024.11.022</a>.","short":"J. Watson, V.M. Vargas Barroso, R. Morse, A.C. Navas Olivé, M. Tavakoli, J.G. Danzl, M. Tomschik, K. Rössler, P.M. Jonas, Cell 188 (2025) 501–514.e18."},"oa":1,"article_type":"original","quality_controlled":"1","corr_author":"1","year":"2025","date_created":"2025-01-26T23:01:49Z","day":"23","page":"501-514.e18","volume":188,"type":"journal_article","article_processing_charge":"Yes (via OA deal)","OA_type":"hybrid","publisher":"Elsevier","issue":"2","publication":"Cell","status":"public","_id":"18879","intvolume":"       188","pmid":1,"abstract":[{"lang":"eng","text":"Our brain has remarkable computational power, generating sophisticated behaviors, storing memories over an individual’s lifetime, and producing higher cognitive functions. However, little of our neuroscience knowledge covers the human brain. Is this organ truly unique, or is it a scaled version of the extensively studied rodent brain? Combining multicellular patch-clamp recording with expansion-based superresolution microscopy and full-scale modeling, we determined the cellular and microcircuit properties of the human hippocampal CA3 region, a fundamental circuit for memory storage. In contrast to neocortical networks, human hippocampal CA3 displayed sparse connectivity, providing a circuit architecture that maximizes associational power. Human synapses showed unique reliability, high precision, and long integration times, exhibiting both species- and circuit-specific properties. Together with expanded neuronal numbers, these circuit characteristics greatly enhanced the memory storage capacity of CA3. Our results reveal distinct microcircuit properties of the human hippocampus and begin to unravel the inner workings of our most complex organ. "}],"file":[{"access_level":"open_access","file_id":"18884","checksum":"d5a818edc32d249cdf75e1bb5b70a4b7","file_size":14082343,"date_updated":"2025-01-27T08:46:33Z","success":1,"creator":"dernst","date_created":"2025-01-27T08:46:33Z","file_name":"2025_Cell_Watson.pdf","content_type":"application/pdf","relation":"main_file"}],"publication_status":"published","department":[{"_id":"JoDa"},{"_id":"PeJo"},{"_id":"GradSch"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"isi":1,"acknowledgement":"We thank Florian Marr for excellent technical assistance, Christina Altmutter and Julia Flor for technical support, Alois Schlögl for programming, Todor Asenov for development of the transportation box for human brain tissue, Tim Vogels for guidance on simulations, Marcus Huber for mathematical advice, Walter Kaufmann for assistance with handling frozen tissue, and Eleftheria Kralli-Beller for manuscript editing. This research was supported by the Scientific Services Units (SSUs) of ISTA, and we are grateful for assistance from Christoph Sommer and the Imaging and Optics Facility, Preclinical Facility, Lab Support Facility, Miba Machine Shop, and Scientific Computing. We are particularly grateful to the patient donors for their support of this project and also acknowledge the excellent support of the Medical University of Vienna Department of Neurosurgery staff; Romana Hoeftberger and the Division of Neuropathology and Neurochemistry; Gregor Kasprian and the Division of Neuroradiology and Musculoskeletal Radiology; and Christoph Baumgartner, Martha Feucht, and Ekaterina Pataraia for their clinical care of the patients included in this study. We thank Laura Jonkman, the NABCA biobank, and postmortem brain sample donors for their support of this research. The project received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (advanced grant no. 692692 to P.J. and Marie Skłodowska-Curie Actions Individual Fellowship no. 101026635 to J.F.W.), the Austrian Science Fund (FWF; grant PAT 4178023 to P.J. and grant DK W1232 to M.R.T. and J.G.D.), the Austrian Academy of Sciences (DOC fellowship 26137 to M.R.T.), and a NOMIS-ISTA fellowship (to A.N.-O.).","publication_identifier":{"eissn":["1097-4172"],"issn":["0092-8674"]},"doi":"10.1016/j.cell.2024.11.022","has_accepted_license":"1","oa_version":"Published Version","scopus_import":"1","month":"01","external_id":{"pmid":["39667938"],"isi":["001408395600001"]},"acknowledged_ssus":[{"_id":"Bio"},{"_id":"PreCl"},{"_id":"LifeSc"},{"_id":"M-Shop"},{"_id":"ScienComp"}],"language":[{"iso":"eng"}],"project":[{"grant_number":"692692","call_identifier":"H2020","_id":"25B7EB9E-B435-11E9-9278-68D0E5697425","name":"Biophysics and circuit function of a giant cortical glutamatergic synapse"},{"grant_number":"101026635","_id":"fc2be41b-9c52-11eb-aca3-faa90aa144e9","call_identifier":"H2020","name":"Synaptic computations of the hippocampal CA3 circuitry"},{"_id":"6285a163-2b32-11ec-9570-8e204ca2dba5","name":"Studying Organelle Structure and Function at Nanoscale Resolution with Expansion Microscopy","grant_number":"26137"},{"grant_number":"W1232","call_identifier":"FWF","_id":"2548AE96-B435-11E9-9278-68D0E5697425","name":"Molecular Drug Targets"},{"grant_number":"PAT 4178023","name":"Synaptic networks of human brain","_id":"8d9195e9-16d5-11f0-9cad-d075be887a1e"},{"name":"NOMIS Fellowship Program","_id":"9B861AAC-BA93-11EA-9121-9846C619BF3A"}],"date_updated":"2026-04-14T08:34:32Z","OA_place":"publisher","author":[{"id":"63836096-4690-11EA-BD4E-32803DDC885E","last_name":"Watson","full_name":"Watson, Jake","first_name":"Jake","orcid":"0000-0002-8698-3823"},{"last_name":"Vargas Barroso","full_name":"Vargas Barroso, Victor M","id":"2F55A9DE-F248-11E8-B48F-1D18A9856A87","first_name":"Victor M"},{"last_name":"Morse","id":"ceb89ae7-dc8d-11ea-abe3-da3301d0eab4","full_name":"Morse, Rebecca","first_name":"Rebecca"},{"full_name":"Navas Olivé, Andrea C","last_name":"Navas Olivé","id":"739d26c9-52e8-11ee-8d72-f14d3893b4ce","orcid":"0000-0002-9280-8597","first_name":"Andrea C"},{"full_name":"Tavakoli, Mojtaba","id":"3A0A06F4-F248-11E8-B48F-1D18A9856A87","last_name":"Tavakoli","first_name":"Mojtaba","orcid":"0000-0002-7667-6854"},{"id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87","last_name":"Danzl","full_name":"Danzl, Johann G","first_name":"Johann G","orcid":"0000-0001-8559-3973"},{"first_name":"Matthias","full_name":"Tomschik, Matthias","last_name":"Tomschik"},{"full_name":"Rössler, Karl","last_name":"Rössler","first_name":"Karl"},{"id":"353C1B58-F248-11E8-B48F-1D18A9856A87","last_name":"Jonas","full_name":"Jonas, Peter M","first_name":"Peter M","orcid":"0000-0001-5001-4804"}],"ddc":["570"],"date_published":"2025-01-23T00:00:00Z"},{"month":"08","has_accepted_license":"1","oa_version":"Published Version","acknowledged_ssus":[{"_id":"Bio"},{"_id":"PreCl"}],"language":[{"iso":"eng"}],"date_updated":"2026-04-14T08:16:57Z","project":[{"name":"Molecular Mechanisms Regulating Cortical Neural Stem Cell Lineage Progression and Astrocyte Development","_id":"34c9fbcb-11ca-11ed-8bc3-98fa5658610d","grant_number":"26253"}],"degree_awarded":"PhD","OA_place":"publisher","ddc":["570"],"alternative_title":["ISTA Thesis"],"date_published":"2025-08-22T00:00:00Z","author":[{"last_name":"Miranda","id":"862A3C56-A8BF-11E9-B4FA-D9E3E5697425","full_name":"Miranda, Osvaldo","orcid":"0000-0001-6618-6889","first_name":"Osvaldo"}],"department":[{"_id":"GradSch"},{"_id":"SiHi"}],"publication_identifier":{"isbn":["978-3-99078-063-3"],"issn":["2663-337X"]},"supervisor":[{"orcid":"0000-0003-2279-1061","first_name":"Simon","id":"37B36620-F248-11E8-B48F-1D18A9856A87","last_name":"Hippenmeyer","full_name":"Hippenmeyer, Simon"}],"acknowledgement":"I would also like to\r\nthank the Austrian Academy of Sciences for awarding me a 2-year DOC fellowship\r\n(DOC26253).","doi":"10.15479/AT-ISTA-20212","type":"dissertation","day":"22","keyword":["Pten","mtor","cortical development","MADM","Mapk"],"page":"119","publisher":"Institute of Science and Technology Austria","article_processing_charge":"No","status":"public","_id":"20212","file":[{"file_id":"20230","access_level":"closed","checksum":"3331f76bbef74ff4908e2d2c9262045c","file_size":32887334,"creator":"omiranda","date_updated":"2025-08-26T09:03:50Z","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","relation":"source_file","date_created":"2025-08-26T09:03:50Z","file_name":"2025_MirandaRomero_OsvaldoAntonio_Thesis.docx"},{"content_type":"application/pdf","relation":"main_file","date_created":"2025-08-26T09:05:55Z","file_name":"2025_MirandaRomero_OsvaldoAntonio_Thesis.pdf","embargo":"2026-08-26","creator":"omiranda","date_updated":"2025-08-26T10:43:30Z","file_size":28636240,"checksum":"02509d50cff8e35c5bcbf71e8d658176","embargo_to":"open_access","file_id":"20231","access_level":"closed"}],"publication_status":"published","title":"Unraveling the role of Pten in cortical stem cell lineage progression using MADM","file_date_updated":"2025-08-26T10:43:30Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","related_material":{"record":[{"relation":"part_of_dissertation","id":"17425","status":"public"}]},"citation":{"mla":"Miranda, Osvaldo. <i>Unraveling the Role of Pten in Cortical Stem Cell Lineage Progression Using MADM</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20212\">10.15479/AT-ISTA-20212</a>.","ieee":"O. Miranda, “Unraveling the role of Pten in cortical stem cell lineage progression using MADM,” Institute of Science and Technology Austria, 2025.","short":"O. Miranda, Unraveling the Role of Pten in Cortical Stem Cell Lineage Progression Using MADM, Institute of Science and Technology Austria, 2025.","chicago":"Miranda, Osvaldo. “Unraveling the Role of Pten in Cortical Stem Cell Lineage Progression Using MADM.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT-ISTA-20212\">https://doi.org/10.15479/AT-ISTA-20212</a>.","apa":"Miranda, O. (2025). <i>Unraveling the role of Pten in cortical stem cell lineage progression using MADM</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-20212\">https://doi.org/10.15479/AT-ISTA-20212</a>","ista":"Miranda O. 2025. Unraveling the role of Pten in cortical stem cell lineage progression using MADM. Institute of Science and Technology Austria.","ama":"Miranda O. Unraveling the role of Pten in cortical stem cell lineage progression using MADM. 2025. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20212\">10.15479/AT-ISTA-20212</a>"},"year":"2025","date_created":"2025-08-22T14:07:00Z","corr_author":"1"},{"article_processing_charge":"No","publisher":"Institute of Science and Technology Austria","day":"09","page":"133","keyword":["NOTCH","radial glial progenitor","lineage progression","cortical development"],"type":"dissertation","file":[{"checksum":"71e0fdf4619b0d70d03657ad7348137d","file_size":78207207,"access_level":"closed","file_id":"20793","date_created":"2025-12-11T09:28:09Z","file_name":"2025_CasadoPolanco_Raquel_Thesis.docx","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","relation":"source_file","date_updated":"2025-12-11T11:18:37Z","creator":"rcasadop"},{"checksum":"58cf2f25c33567723bc754a019c3e396","file_size":6261874,"embargo_to":"open_access","file_id":"20794","access_level":"closed","relation":"main_file","content_type":"application/pdf","date_created":"2025-12-11T09:28:04Z","file_name":"2025_CasadoPolanco_Raquel_Thesis.pdf","embargo":"2026-12-01","creator":"rcasadop","date_updated":"2025-12-11T09:28:04Z"}],"publication_status":"published","status":"public","_id":"20737","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","title":"Role of NOTCH signaling in radial glial progenitor lineage progression","file_date_updated":"2025-12-11T11:18:37Z","corr_author":"1","year":"2025","date_created":"2025-12-09T09:04:18Z","citation":{"mla":"Casado Polanco, Raquel. <i>Role of NOTCH Signaling in Radial Glial Progenitor Lineage Progression</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20737\">10.15479/AT-ISTA-20737</a>.","short":"R. Casado Polanco, Role of NOTCH Signaling in Radial Glial Progenitor Lineage Progression, Institute of Science and Technology Austria, 2025.","ieee":"R. Casado Polanco, “Role of NOTCH signaling in radial glial progenitor lineage progression,” Institute of Science and Technology Austria, 2025.","apa":"Casado Polanco, R. (2025). <i>Role of NOTCH signaling in radial glial progenitor lineage progression</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-20737\">https://doi.org/10.15479/AT-ISTA-20737</a>","chicago":"Casado Polanco, Raquel. “Role of NOTCH Signaling in Radial Glial Progenitor Lineage Progression.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT-ISTA-20737\">https://doi.org/10.15479/AT-ISTA-20737</a>.","ama":"Casado Polanco R. Role of NOTCH signaling in radial glial progenitor lineage progression. 2025. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20737\">10.15479/AT-ISTA-20737</a>","ista":"Casado Polanco R. 2025. Role of NOTCH signaling in radial glial progenitor lineage progression. Institute of Science and Technology Austria."},"acknowledged_ssus":[{"_id":"Bio"},{"_id":"PreCl"}],"language":[{"iso":"eng"}],"has_accepted_license":"1","oa_version":"Published Version","month":"12","author":[{"orcid":"0000-0001-8293-4568","first_name":"Raquel","last_name":"Casado Polanco","id":"15240fc1-dbcd-11ea-9d1d-ac5a786425fd","full_name":"Casado Polanco, Raquel"}],"alternative_title":["ISTA Thesis"],"ddc":["570"],"date_published":"2025-12-09T00:00:00Z","project":[{"_id":"059F6AB4-7A3F-11EA-A408-12923DDC885E","name":"Stem Cell Modulation in Neural Development and Regeneration/ P05-Molecular Mechanisms of Neural Stem Cell Lineage Progression","grant_number":"F7805"}],"date_updated":"2026-04-14T08:16:58Z","degree_awarded":"PhD","OA_place":"publisher","department":[{"_id":"GradSch"},{"_id":"SiHi"}],"doi":"10.15479/AT-ISTA-20737","acknowledgement":"I also want to thank ISTA and the Austrian Science Fund FWF SFB F78 (F7805) for financially\r\nsupporting my research.","publication_identifier":{"isbn":["978-3-99078-072-5"],"issn":["2663-337X"]},"supervisor":[{"last_name":"Hippenmeyer","id":"37B36620-F248-11E8-B48F-1D18A9856A87","full_name":"Hippenmeyer, Simon","first_name":"Simon","orcid":"0000-0003-2279-1061"}]},{"corr_author":"1","date_created":"2025-04-14T06:59:06Z","year":"2025","citation":{"ama":"Schwarz LA. Mapping developmental dynamics of autism spectrum disorder mouse models at single-cell resolution. 2025. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-19557\">10.15479/AT-ISTA-19557</a>","ista":"Schwarz LA. 2025. Mapping developmental dynamics of autism spectrum disorder mouse models at single-cell resolution. Institute of Science and Technology Austria.","apa":"Schwarz, L. A. (2025). <i>Mapping developmental dynamics of autism spectrum disorder mouse models at single-cell resolution</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-19557\">https://doi.org/10.15479/AT-ISTA-19557</a>","chicago":"Schwarz, Lena A. “Mapping Developmental Dynamics of Autism Spectrum Disorder Mouse Models at Single-Cell Resolution.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT-ISTA-19557\">https://doi.org/10.15479/AT-ISTA-19557</a>.","ieee":"L. A. Schwarz, “Mapping developmental dynamics of autism spectrum disorder mouse models at single-cell resolution,” Institute of Science and Technology Austria, 2025.","mla":"Schwarz, Lena A. <i>Mapping Developmental Dynamics of Autism Spectrum Disorder Mouse Models at Single-Cell Resolution</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-19557\">10.15479/AT-ISTA-19557</a>.","short":"L.A. Schwarz, Mapping Developmental Dynamics of Autism Spectrum Disorder Mouse Models at Single-Cell Resolution, Institute of Science and Technology Austria, 2025."},"related_material":{"record":[{"relation":"part_of_dissertation","id":"12802","status":"public"},{"status":"public","id":"9429","relation":"part_of_dissertation"}]},"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","file_date_updated":"2026-03-27T13:15:08Z","title":"Mapping developmental dynamics of autism spectrum disorder mouse models at single-cell resolution","publication_status":"published","file":[{"creator":"lschwarz","date_updated":"2025-04-15T08:43:36Z","relation":"source_file","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","date_created":"2025-04-15T08:43:36Z","file_name":"Schwarz_Thesis_2025_FINAL.docx","file_id":"19561","access_level":"closed","checksum":"50290a8604edb0a720387f01e9d59fe4","file_size":21783427},{"relation":"main_file","content_type":"application/pdf","file_name":"Schwarz_Thesis_2025_FINALpdfa.pdf","date_created":"2025-04-15T08:43:42Z","creator":"lschwarz","embargo":"2026-10-15","date_updated":"2026-03-27T13:15:08Z","checksum":"ed028488180ac4901e018ef1c330cf01","file_size":11432175,"embargo_to":"open_access","file_id":"19562","access_level":"closed"}],"_id":"19557","status":"public","article_processing_charge":"No","publisher":"Institute of Science and Technology Austria","day":"14","page":"124","type":"dissertation","doi":"10.15479/AT-ISTA-19557","acknowledgement":"The work presented in this doctoral thesis was performed at the Institute of Science\r\nand Technology (ISTA) and financially supported by a European Research Council\r\n(ERC) Consolidator Grant (PR1028ERC02), by SFARI (PR1028SIM02) and by the\r\nAustrian Science Fund (FWF) to Gaia Novarino (PE1028W1232). I am very thankful\r\nto the Doctoral Program “Molecular Drug Targets” (MolTag) for offering me financial\r\nsupport to perform essential experiments during my PhD studies and to participate in\r\ninternational conferences and courses.","supervisor":[{"last_name":"Novarino","id":"3E57A680-F248-11E8-B48F-1D18A9856A87","full_name":"Novarino, Gaia","orcid":"0000-0002-7673-7178","first_name":"Gaia"}],"publication_identifier":{"issn":["2663-337X"]},"department":[{"_id":"GradSch"},{"_id":"GaNo"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"author":[{"last_name":"Schwarz","full_name":"Schwarz, Lena A","id":"29A8453C-F248-11E8-B48F-1D18A9856A87","first_name":"Lena A"}],"date_published":"2025-04-14T00:00:00Z","alternative_title":["ISTA Thesis"],"ddc":["570"],"OA_place":"publisher","degree_awarded":"PhD","date_updated":"2026-04-14T09:07:14Z","project":[{"grant_number":"707964","name":"Critical windows and reversibility of ASD associated with mutations in chromatin remodelers","_id":"9B91375C-BA93-11EA-9121-9846C619BF3A"},{"grant_number":"101044865","name":"Toward an understanding of the brain interstitial system and the extracellular proteome in health and autism spectrum disorders","_id":"34ba8964-11ca-11ed-8bc3-e15864e7e9a6"},{"grant_number":"W1232","name":"Molecular Drug Targets","call_identifier":"FWF","_id":"2548AE96-B435-11E9-9278-68D0E5697425"}],"language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"Bio"},{"_id":"PreCl"},{"_id":"ScienComp"}],"oa_version":"Published Version","has_accepted_license":"1","month":"04"},{"corr_author":"1","date_created":"2025-09-25T10:08:10Z","year":"2025","citation":{"ama":"Kishi K. Regulation of notochord and floor plate size during mouse development. 2025. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20393\">10.15479/AT-ISTA-20393</a>","ista":"Kishi K. 2025. Regulation of notochord and floor plate size during mouse development. Institute of Science and Technology Austria.","apa":"Kishi, K. (2025). <i>Regulation of notochord and floor plate size during mouse development</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-20393\">https://doi.org/10.15479/AT-ISTA-20393</a>","chicago":"Kishi, Kasumi. “Regulation of Notochord and Floor Plate Size during Mouse Development.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT-ISTA-20393\">https://doi.org/10.15479/AT-ISTA-20393</a>.","mla":"Kishi, Kasumi. <i>Regulation of Notochord and Floor Plate Size during Mouse Development</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20393\">10.15479/AT-ISTA-20393</a>.","ieee":"K. Kishi, “Regulation of notochord and floor plate size during mouse development,” Institute of Science and Technology Austria, 2025.","short":"K. Kishi, Regulation of Notochord and Floor Plate Size during Mouse Development, Institute of Science and Technology Austria, 2025."},"related_material":{"record":[{"id":"18481","relation":"part_of_dissertation","status":"public"}]},"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","file_date_updated":"2025-10-02T07:51:21Z","title":"Regulation of notochord and floor plate size during mouse development","publication_status":"published","file":[{"date_created":"2025-09-30T14:33:17Z","file_name":"2025-Kishi-Kasumi-Thesis.zip","relation":"source_file","content_type":"application/x-zip-compressed","date_updated":"2025-10-01T11:54:41Z","creator":"kkishi","file_size":41847994,"checksum":"6bb5a7ce318dc3f7bd165f2523e77b89","access_level":"closed","file_id":"20413"},{"date_updated":"2025-10-02T07:51:21Z","creator":"kkishi","embargo":"2026-09-30","file_name":"2025-Kishi-Kasumi-Thesis.pdf","date_created":"2025-09-30T14:33:22Z","relation":"main_file","content_type":"application/pdf","access_level":"closed","file_id":"20414","embargo_to":"open_access","checksum":"88349b9177e1dcbe1242cd3884b36fdb","file_size":55747072}],"_id":"20393","status":"public","article_processing_charge":"No","publisher":"Institute of Science and Technology Austria","page":"102","day":"24","type":"dissertation","doi":"10.15479/AT-ISTA-20393","supervisor":[{"orcid":"0000-0003-4509-4998","first_name":"Anna","full_name":"Kicheva, Anna","last_name":"Kicheva","id":"3959A2A0-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0001-6005-1561","first_name":"Edouard B","last_name":"Hannezo","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87","full_name":"Hannezo, Edouard B"}],"publication_identifier":{"issn":["2663-337X"]},"department":[{"_id":"GradSch"},{"_id":"AnKi"},{"_id":"EdHa"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"author":[{"id":"3065DFC4-F248-11E8-B48F-1D18A9856A87","full_name":"Kishi, Kasumi","last_name":"Kishi","orcid":"0000-0001-6060-4795","first_name":"Kasumi"}],"date_published":"2025-09-24T00:00:00Z","ddc":["570"],"alternative_title":["ISTA Thesis"],"OA_place":"publisher","degree_awarded":"PhD","date_updated":"2026-04-14T09:50:52Z","language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"Bio"},{"_id":"PreCl"},{"_id":"LifeSc"}],"oa_version":"Published Version","has_accepted_license":"1","month":"09"},{"type":"dissertation","day":"23","page":"202","publisher":"Institute of Science and Technology Austria","article_processing_charge":"No","status":"public","_id":"20371","abstract":[{"lang":"eng","text":"Quantum mechanics reveals a world that defies classical determinism, where uncertainty, superposition, and fluctuations are fundamental aspects. Engineering devices that harness these quantum features requires not only precision, but also a deep understanding of how they interact with their surrounding environment. Superconducting circuits, which exploit\r\nmacroscopic quantum coherence in low-loss superconducting materials, provide a scalable platform for implementing such systems. Among the critical elements in these circuits, superinductors—high-impedance, dissipation-free inductive components—play a central role by suppressing charge fluctuations. They allow quantum states to be delocalized in phase space, protect qubits from environmental noise, and facilitate access to phenomena such as dual Josephson physics and ultra-strong coupling regimes. \r\nThis thesis explores two complementary implementations of high-impedance circuits: geometric superinductors, demonstrating that high impedance can be achieved beyond kinetic inductance,\r\nand Josephson junction chains, used to investigate both microwave mode properties and DC transport across the superconductor-to-insulator transition. \r\nPart I addresses geometric superinductors. Contrary to the common belief that high-impedance superconducting circuits require kinetic inductance, we demonstrate that purely geometric designs can achieve characteristic impedance exceeding the resistance quantum. By exploiting mutual coupling between adjacent turns, coil-based inductors achieve enhanced self-inductance, creating a reliable platform for qubits and resonators. Modeling, simulation, fabrication, and\r\ncharacterization confirm that these elements behave as superinductor. With low loss, high linearity, and minimal stray capacitance, these elements are reproducible, free of uncontrolled tunneling events, and capable of strong magnetic coupling. This establishes geometric superinductors as robust, single-wave-function superconducting devices suitable for hardware protected qubits and hybrid systems.\r\nPart II presents classical numerical simulations of a Quantum Phase Slip circuit to study dual Shapiro steps. The circuit consists of an ideal Quantum Phase Slip element embedded in a resistive-inductive environment with a parasitic capacitance.\r\nPart III extends the investigation of high characteristic-impedance circuit elements to one-dimensional Josephson junction chains, which act as a quantum simulator for many-body physics and the superconductor–insulator transition. Different devices are realized on both sides of the DC phase transition, showing either a supercurrent branch or Coulomb blockade at zero bias. The effect of the crossover on microwave modes, however, remains insufficiently investigated. Studying these modes provides insight into the interplay between disorder and phase-slip events. Small differences in circuit component sizes determine which side of the transition a device falls on, making these results relevant not only for fundamental understanding but also for the design of quantum devices, emphasizing the crucial role of the\r\nelectromagnetic environment in stabilizing and controlling fragile quantum states. \r\nTogether, these results illustrate how carefully engineered high characteristic-impedance elements provide a link between macroscopic circuits and the inherently uncertain quantum world, enabling experiments that probe, control, and ultimately exploit quantum fluctuations for applications in quantum information, metrology, solid state physics and beyond.\r\n\r\n"}],"file":[{"creator":"atrioni","date_updated":"2025-09-25T14:25:31Z","content_type":"application/pdf","relation":"main_file","date_created":"2025-09-25T07:15:05Z","file_name":"2025_Trioni_Andrea_Thesis.pdf","file_id":"20392","access_level":"open_access","checksum":"6fb925648dfa5f4384814c552ee2f099","file_size":22351676},{"date_created":"2025-09-25T14:45:43Z","file_name":"2025_Trioni_Andrea_Thesis.zip","relation":"source_file","content_type":"application/x-zip-compressed","date_updated":"2025-09-26T07:20:48Z","creator":"atrioni","checksum":"619dc614bdfbf3999b76ac8890b2cebd","file_size":60079009,"access_level":"closed","file_id":"20396"}],"publication_status":"published","ec_funded":1,"title":"High-impedance quantum circuits for mesoscopic physics : Geometric superinductors and insulating Josephson Chains","file_date_updated":"2025-09-26T07:20:48Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","related_material":{"record":[{"id":"8755","relation":"part_of_dissertation","status":"public"}]},"oa":1,"citation":{"short":"A. Trioni, High-Impedance Quantum Circuits for Mesoscopic Physics : Geometric Superinductors and Insulating Josephson Chains, Institute of Science and Technology Austria, 2025.","ieee":"A. Trioni, “High-impedance quantum circuits for mesoscopic physics : Geometric superinductors and insulating Josephson Chains,” Institute of Science and Technology Austria, 2025.","mla":"Trioni, Andrea. <i>High-Impedance Quantum Circuits for Mesoscopic Physics : Geometric Superinductors and Insulating Josephson Chains</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20371\">10.15479/AT-ISTA-20371</a>.","apa":"Trioni, A. (2025). <i>High-impedance quantum circuits for mesoscopic physics : Geometric superinductors and insulating Josephson Chains</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-20371\">https://doi.org/10.15479/AT-ISTA-20371</a>","chicago":"Trioni, Andrea. “High-Impedance Quantum Circuits for Mesoscopic Physics : Geometric Superinductors and Insulating Josephson Chains.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT-ISTA-20371\">https://doi.org/10.15479/AT-ISTA-20371</a>.","ama":"Trioni A. High-impedance quantum circuits for mesoscopic physics : Geometric superinductors and insulating Josephson Chains. 2025. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20371\">10.15479/AT-ISTA-20371</a>","ista":"Trioni A. 2025. High-impedance quantum circuits for mesoscopic physics : Geometric superinductors and insulating Josephson Chains. Institute of Science and Technology Austria."},"year":"2025","date_created":"2025-09-23T09:57:57Z","corr_author":"1","month":"09","has_accepted_license":"1","oa_version":"Published Version","acknowledged_ssus":[{"_id":"NanoFab"},{"_id":"M-Shop"}],"language":[{"iso":"eng"}],"date_updated":"2026-04-15T06:43:02Z","project":[{"_id":"eb9b30ac-77a9-11ec-83b8-871f581d53d2","name":"Protected states of quantum matter"},{"grant_number":"F07105","_id":"bdb108fd-d553-11ed-ba76-83dc74a9864f","name":"QUANTUM INFORMATION SYSTEMS BEYOND CLASSICAL CAPABILITIES / P5- Integration of Superconducting Quantum Circuits"},{"call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","grant_number":"665385"}],"OA_place":"publisher","degree_awarded":"PhD","ddc":["539"],"alternative_title":["ISTA Thesis"],"date_published":"2025-09-23T00:00:00Z","author":[{"first_name":"Andrea","id":"42F71B44-F248-11E8-B48F-1D18A9856A87","full_name":"Trioni, Andrea","last_name":"Trioni"}],"department":[{"_id":"GradSch"},{"_id":"JoFi"}],"publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-067-1"]},"supervisor":[{"orcid":"0000-0001-8112-028X","first_name":"Johannes M","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","full_name":"Fink, Johannes M","last_name":"Fink"}],"acknowledgement":"I also gratefully acknowledge the generous support of the NOMIS Foundation Project \"Protected\r\nStates of Quantum Matter\" and the grant from the Beyond-C consortium. Their funding\r\nmade this research possible and gave me the freedom to ask ambitious questions, and try to\r\nanswer them.\r\n","doi":"10.15479/AT-ISTA-20371"},{"date_updated":"2026-04-16T08:29:34Z","project":[{"name":"Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large Scales","_id":"2533E772-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"638176"},{"_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088","name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena","grant_number":"101045083"},{"grant_number":"788183","name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"grant_number":"638176","call_identifier":"H2020","_id":"2533E772-B435-11E9-9278-68D0E5697425","name":"Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large Scales"},{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35"}],"OA_place":"publisher","degree_awarded":"PhD","author":[{"id":"331776E2-F248-11E8-B48F-1D18A9856A87","full_name":"Synak, Peter","last_name":"Synak","first_name":"Peter"}],"ddc":["519","006"],"alternative_title":["ISTA Thesis"],"date_published":"2025-04-29T00:00:00Z","has_accepted_license":"1","oa_version":"Published Version","month":"04","acknowledged_ssus":[{"_id":"ScienComp"}],"language":[{"iso":"eng"}],"acknowledgement":"The project in Chapter 2 has received funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme under grant agreement No. 638176. The project in Chapter 3 was funded in part by the European Union (ERC-2021-COG 101045083 CoDiNA). The project in Chapter 4 has received funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme (grant agreements No 78818 Alpha and No 638176). It was also partially supported by the DFG Collaborative Research Center TRR 109, 'Discretization in Geometry and Dynamics', through grant no. I02979-N35 of the Austrian Science Fund (FWF). Thank you for providing funds to support my work.","publication_identifier":{"issn":["2663-337X"]},"supervisor":[{"last_name":"Wojtan","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","full_name":"Wojtan, Christopher J","first_name":"Christopher J","orcid":"0000-0001-6646-5546"}],"doi":"10.15479/AT-ISTA-19630","department":[{"_id":"ChWo"},{"_id":"GradSch"}],"status":"public","_id":"19630","abstract":[{"lang":"eng","text":"This thesis consists of three chapters, each corresponding to one publication. While each of these projects tackles a topic in a different area of research, they all share a common thread in the type of topological structure they handle - a partition of space into volumes separated by interfaces that meet in non-manifold junctions.\r\n\r\nIn Chapter 2, we study clusters of soap bubbles from a simulation perspective. In particular, we develop a surface-only algorithm that couples large scale motion and shape deformation of soap bubble clusters with the small scale evolution of the thin film's thickness, which is responsible for visual phenomena like surface vortices, Newton's interference patterns, capillary waves, and deformation-dependent rupturing of films in a foam. We model film thickness as a reduced degree of freedom in the Navier-Stokes equations and from them derive three sets of equations governing normal and tangential motion of the soap film surface, as well as the evolution of the thin film thickness. We discretize these equations on a non-manifold triangle mesh, extending and adapting operators to handle complex topology. We also present an incompressible fluid solver for 2.5D films and an advection algorithm for convecting fields across non-manifold surface junctions. Our simulations enhance bubble solvers with additional effects caused by convection, rippling, draining, and evaporation of the thin film.\r\n\r\nIn Chapter 3, we introduce a multi-material non-manifold mesh-based surface tracking algorithm that converts mesh defects, such as overlaps, self-intersections, and inversions into topological changes. Our algorithm generalizes prior work on manifold surface tracking with topological changes: it preserves surface features like mesh-based methods, and it robustly handles topological changes like level set methods. Our method also offers improved efficiency and robustness over the state of the art. We demonstrate the effectiveness of the approach on a range of examples, including complex soap film simulations, such as those presented in Chapter 2, but with an order of magnitude more interacting bubbles than what we could achieve before, and Boolean unions of non-manifold meshes consisting of millions of triangles.\r\n\r\nLastly, in Chapter 4, we utilize developments in the theory of random geometric complexes facilitated by observations from Discrete Morse theory. We survey the methods and results obtained with this new approach, and discuss some of its shortcomings. We use simulations to illustrate the results and to form conjectures, getting numerical estimates for combinatorial, topological, and geometric properties of weighted and unweighted Delaunay mosaics, their dual Voronoi tessellations, and the Alpha and Wrap complexes contained in the mosaics."}],"file":[{"file_size":60670543,"checksum":"f00b519c27529daa0c3b2d4102b4fa7b","access_level":"closed","file_id":"19633","date_created":"2025-04-30T14:02:25Z","file_name":"Thesis_source_Heiss_Synak.zip","relation":"source_file","content_type":"application/x-zip-compressed","date_updated":"2025-04-30T14:02:25Z","creator":"cchlebak"},{"content_type":"application/pdf","relation":"main_file","date_created":"2025-04-30T14:02:42Z","file_name":"Thesis_PDFA_Heiss_Synak.pdf","creator":"cchlebak","date_updated":"2025-04-30T15:49:16Z","file_size":21319043,"checksum":"6e40a2fd3b1b881af1385670854a682e","file_id":"19634","access_level":"open_access"}],"publication_status":"published","day":"29","page":"106","type":"dissertation","article_processing_charge":"No","publisher":"Institute of Science and Technology Austria","citation":{"mla":"Synak, Peter. <i>Methods for Fluid Simulation, Surface Tracking, and Statistics of Non-Manifold Structures</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-19630\">10.15479/AT-ISTA-19630</a>.","ieee":"P. Synak, “Methods for fluid simulation, surface tracking, and statistics of non-manifold structures,” Institute of Science and Technology Austria, 2025.","short":"P. Synak, Methods for Fluid Simulation, Surface Tracking, and Statistics of Non-Manifold Structures, Institute of Science and Technology Austria, 2025.","apa":"Synak, P. (2025). <i>Methods for fluid simulation, surface tracking, and statistics of non-manifold structures</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-19630\">https://doi.org/10.15479/AT-ISTA-19630</a>","chicago":"Synak, Peter. “Methods for Fluid Simulation, Surface Tracking, and Statistics of Non-Manifold Structures.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT-ISTA-19630\">https://doi.org/10.15479/AT-ISTA-19630</a>.","ama":"Synak P. Methods for fluid simulation, surface tracking, and statistics of non-manifold structures. 2025. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-19630\">10.15479/AT-ISTA-19630</a>","ista":"Synak P. 2025. Methods for fluid simulation, surface tracking, and statistics of non-manifold structures. Institute of Science and Technology Austria."},"oa":1,"corr_author":"1","year":"2025","date_created":"2025-04-29T09:39:34Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","related_material":{"record":[{"relation":"part_of_dissertation","id":"8135","status":"public"},{"status":"public","id":"17219","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"8384","status":"public"}]},"ec_funded":1,"title":"Methods for fluid simulation, surface tracking, and statistics of non-manifold structures","file_date_updated":"2025-04-30T15:49:16Z"},{"doi":"10.15479/AT-ISTA-20920","publication_identifier":{"issn":["2663-337X"]},"supervisor":[{"first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak"}],"department":[{"_id":"GradSch"},{"_id":"KrPi"}],"tmp":{"image":"/images/cc_by_nc_sa.png","short":"CC BY-NC-SA (4.0)","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode"},"alternative_title":["ISTA Thesis"],"ddc":["004"],"date_published":"2025-12-31T00:00:00Z","author":[{"first_name":"Charlotte","orcid":"0000-0003-2027-5549","id":"0f78d746-dc7d-11ea-9b2f-83f92091afe7","full_name":"Hoffmann, Charlotte","last_name":"Hoffmann"}],"date_updated":"2026-04-16T09:11:08Z","degree_awarded":"PhD","OA_place":"publisher","language":[{"iso":"eng"}],"month":"12","has_accepted_license":"1","oa_version":"Published Version","year":"2025","date_created":"2026-01-02T10:46:47Z","corr_author":"1","oa":1,"citation":{"mla":"Hoffmann, Charlotte. <i>Theory and Applications of Verifiable Delay Functions</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20920\">10.15479/AT-ISTA-20920</a>.","short":"C. Hoffmann, Theory and Applications of Verifiable Delay Functions, Institute of Science and Technology Austria, 2025.","ieee":"C. Hoffmann, “Theory and applications of verifiable delay functions,” Institute of Science and Technology Austria, 2025.","apa":"Hoffmann, C. (2025). <i>Theory and applications of verifiable delay functions</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-20920\">https://doi.org/10.15479/AT-ISTA-20920</a>","chicago":"Hoffmann, Charlotte. “Theory and Applications of Verifiable Delay Functions.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT-ISTA-20920\">https://doi.org/10.15479/AT-ISTA-20920</a>.","ama":"Hoffmann C. Theory and applications of verifiable delay functions. 2025. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20920\">10.15479/AT-ISTA-20920</a>","ista":"Hoffmann C. 2025. Theory and applications of verifiable delay functions. Institute of Science and Technology Austria."},"title":"Theory and applications of verifiable delay functions","file_date_updated":"2026-01-02T10:39:26Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","related_material":{"record":[{"id":"13143","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","id":"20701","status":"public"},{"relation":"part_of_dissertation","id":"12176","status":"public"},{"relation":"earlier_version","id":"20556","status":"public"},{"relation":"part_of_dissertation","id":"19778","status":"public"}]},"file":[{"access_level":"closed","file_id":"20921","file_size":8355494,"checksum":"8a099fbf54963bd0be38f7ce73658682","date_updated":"2026-01-02T10:39:16Z","creator":"choffman","file_name":"2025_Hoffmann_Charlotte_Source.zip","date_created":"2026-01-02T10:39:16Z","content_type":"application/x-zip-compressed","relation":"source_file"},{"file_name":"2025_Hoffmann_Charlotte_Thesis.pdf","date_created":"2026-01-02T10:39:26Z","relation":"main_file","content_type":"application/pdf","date_updated":"2026-01-02T10:39:26Z","success":1,"creator":"choffman","checksum":"9521c07bfb2bb5b14a49c09fcfc96474","file_size":2258804,"access_level":"open_access","file_id":"20922"}],"publication_status":"published","status":"public","abstract":[{"text":"Verifiable Delay Functions (VDFs) introduced by Boneh et al. (CRYPTO'18) are functions that require a prescribed number of sequential steps T to evaluate, yet their output can be verified in time much faster than T. Since their introduction, VDFs have gained a lot of attention due to their applications in blockchain protocols, randomness beacons, timestamping and deniability. This thesis explores the theory and applications of VDFs, focusing on enhancing their soundness, efficiency and practicality.\r\n\r\nThe only practical VDFs known to date are based on repeated squaring in hidden order groups. Consider the function VDF(x,T)=x^(2^T).\r\nThe iterated squaring assumption states that, for a random group element x, the result of VDF cannot be computed significantly faster than performing T sequential squarings if the group order is unknown. To make the result verifiable a prover can compute a proof of exponentiation (PoE) \\pi. Given \\pi, the output of VDF can be verified in time much less than T.\r\n\r\nWe first present new constructions of statistically sound proofs of exponentiation, which are an important building block in the construction of SNARKs (Succinct Non-Interactive Argument of Knowledge). Statistical soundness means that the proofs remain secure against computationally unbounded adversaries, in particular, it remains secure even when the group order is known. We thereby address limitations in previous PoE protocols which either required (non-standard) hardness assumptions or a lot of parallel repetitions. Our construction significantly reduces the proof size of statistically sound PoEs that allow for a structured exponent, which leads to better efficiency of SNARKs and other applications.\r\n\r\nSecondly, we introduce improved batching techniques for PoEs, which allow multiple proofs to be aggregated and verified with minimal overhead. These protocols optimize communication and computation complexity in large-scale blockchain environments and enable scalable remote benchmarking of parallel computation resources.\r\n\r\nWe then construct VDFs with enhanced properties such as zero-knowledge and watermarkability. It was shown by Arun, Bonneau and Clark (ASIACRYPT'22) that these features enable new cryptographic primitives called short-lived proofs and signatures. The validity of such proofs and signatures expires after a predefined amount of time T, i.e., they are deniable after time T. Our constructions improve upon the constructions by Arun, Bonneau and Clark in several dimensions (faster forging times, arguably weaker assumptions).\r\n\r\nFinally, we apply PoEs in the realm of primality testing, providing cryptographically sound proofs of non-primality for large Proth numbers. This work gives a surprising application of VDFs in the area of computational number theory.\r\n\r\nTogether, our contributions advance both the theoretical foundations and the real-world usability of VDFs in general and in particular of PoEs, making them more adaptable and secure for current and emerging cryptographic applications.","lang":"eng"}],"_id":"20920","publisher":"Institute of Science and Technology Austria","article_processing_charge":"No","type":"dissertation","page":"116","day":"31"},{"publisher":"Institute of Science and Technology Austria","article_processing_charge":"No","type":"dissertation","day":"31","page":"116","file":[{"relation":"main_file","content_type":"application/pdf","date_created":"2025-10-28T14:33:03Z","file_name":"2025_Hoffmann_Charlotte_Thesis.pdf","creator":"choffman","date_updated":"2026-01-08T14:11:39Z","file_size":2259304,"checksum":"1fffa4e2c33dd0b9f883d615504a2858","file_id":"20573","access_level":"closed"},{"checksum":"076ea98a1f0a86c3bbc990b6b9460dc2","file_size":9987633,"access_level":"closed","file_id":"20574","date_created":"2025-10-28T14:35:06Z","file_name":"2025_Hoffmann_Charlotte_Source.zip","relation":"source_file","content_type":"application/x-zip-compressed","date_updated":"2025-11-11T09:34:54Z","creator":"choffman"}],"publication_status":"published","status":"public","_id":"20556","abstract":[{"lang":"eng","text":"Verifiable Delay Functions (VDFs) introduced by Boneh et al. (CRYPTO'18) are functions that require a prescribed number of sequential steps T to evaluate, yet their output can be verified in time much faster than T. Since their introduction, VDFs have gained a lot of attention due to their applications in blockchain protocols, randomness beacons, timestamping and deniability. This thesis explores the theory and applications of VDFs, focusing on enhancing their soundness, efficiency and practicality.\r\n\r\nThe only practical VDFs known to date are based on repeated squaring in hidden order groups. Consider the function VDF(x,T)=x^(2^T).\r\nThe iterated squaring assumption states that, for a random group element x, the result of VDF cannot be computed significantly faster than performing T sequential squarings if the group order is unknown. To make the result verifiable a prover can compute a proof of exponentiation (PoE) \\pi. Given \\pi, the output of VDF can be verified in time much less than T.\r\n\r\nWe first present new constructions of statistically sound proofs of exponentiation, which are an important building block in the construction of SNARKs (Succinct Non-Interactive Argument of Knowledge). Statistical soundness means that the proofs remain secure against computationally unbounded adversaries, in particular, it remains secure even when the group order is known. We thereby address limitations in previous PoE protocols which either required (non-standard) hardness assumptions or a lot of parallel repetitions. Our construction significantly reduces the proof size of statistically sound PoEs that allow for a structured exponent, which leads to better efficiency of SNARKs and other applications.\r\n\r\nSecondly, we introduce improved batching techniques for PoEs, which allow multiple proofs to be aggregated and verified with minimal overhead. These protocols optimize communication and computation complexity in large-scale blockchain environments and enable scalable remote benchmarking of parallel computation resources.\r\n\r\nWe then construct VDFs with enhanced properties such as zero-knowledge and watermarkability. It was shown by Arun, Bonneau and Clark (ASIACRYPT'22) that these features enable new cryptographic primitives called short-lived proofs and signatures. The validity of such proofs and signatures expires after a predefined amount of time T, i.e., they are deniable after time T. Our constructions improve upon the constructions by Arun, Bonneau and Clark in several dimensions (faster forging times, arguably weaker assumptions).\r\n\r\nFinally, we apply PoEs in the realm of primality testing, providing cryptographically sound proofs of non-primality for large Proth numbers. This work gives a surprising application of VDFs in the area of computational number theory.\r\n\r\nTogether, our contributions advance both the theoretical foundations and the real-world usability of VDFs in general and in particular of PoEs, making them more adaptable and secure for current and emerging cryptographic applications."}],"title":"Theory and applications of verifiable delay functions","file_date_updated":"2026-01-08T14:11:39Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","related_material":{"record":[{"id":"13143","relation":"part_of_dissertation","status":"public"},{"id":"12176","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","id":"20701","status":"public"},{"relation":"later_version","id":"20920","status":"public"},{"relation":"part_of_dissertation","id":"19778","status":"public"}]},"year":"2025","date_created":"2025-10-27T14:16:56Z","corr_author":"1","citation":{"mla":"Hoffmann, Charlotte. <i>Theory and Applications of Verifiable Delay Functions</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20556\">10.15479/AT-ISTA-20556</a>.","ieee":"C. Hoffmann, “Theory and applications of verifiable delay functions,” Institute of Science and Technology Austria, 2025.","short":"C. Hoffmann, Theory and Applications of Verifiable Delay Functions, Institute of Science and Technology Austria, 2025.","ama":"Hoffmann C. Theory and applications of verifiable delay functions. 2025. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20556\">10.15479/AT-ISTA-20556</a>","ista":"Hoffmann C. 2025. Theory and applications of verifiable delay functions. Institute of Science and Technology Austria.","apa":"Hoffmann, C. (2025). <i>Theory and applications of verifiable delay functions</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-20556\">https://doi.org/10.15479/AT-ISTA-20556</a>","chicago":"Hoffmann, Charlotte. “Theory and Applications of Verifiable Delay Functions.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT-ISTA-20556\">https://doi.org/10.15479/AT-ISTA-20556</a>."},"language":[{"iso":"eng"}],"month":"10","has_accepted_license":"1","oa_version":"Published Version","alternative_title":["ISTA Thesis"],"ddc":["004"],"date_published":"2025-10-31T00:00:00Z","author":[{"orcid":"0000-0003-2027-5549","first_name":"Charlotte","id":"0f78d746-dc7d-11ea-9b2f-83f92091afe7","last_name":"Hoffmann","full_name":"Hoffmann, Charlotte"}],"date_updated":"2026-04-16T09:11:09Z","degree_awarded":"PhD","OA_place":"publisher","department":[{"_id":"GradSch"},{"_id":"KrPi"}],"tmp":{"image":"/images/cc_by_nc_sa.png","short":"CC BY-NC-SA (4.0)","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode"},"doi":"10.15479/AT-ISTA-20556","publication_identifier":{"issn":["2663-337X"]},"supervisor":[{"orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"}]},{"intvolume":"     15674","_id":"19778","abstract":[{"lang":"eng","text":"A verifiable delay function VDF(x, T)->(y, π) maps an input x and time parameter T to an output y together with an efficiently verifiable proof π certifying that y was correctly computed. The function runs in T sequential steps, and it should not be possible to compute y much faster than that. The only known practical VDFs use sequential squaring in groups of unknown order as the sequential function, i.e., y = x^2^T. There are two constructions for the proof of exponentiation (PoE) certifying that y = x^2^T, with Wesolowski (Eurocrypt’19) having very short proofs, but they are more expensive to compute and the soundness relies on stronger assumptions than the PoE proposed by Pietrzak (ITCS’19).\r\nA recent application of VDFs by Arun, Bonneau and Clark (Asiacrypt’22) are short-lived proofs and signatures, which are proofs and signatures that are only sound for some time t, but after that can be forged by anyone. For this they rely on “watermarkable VDFs”, where the proof embeds a prover chosen watermark. To achieve stronger notions of proofs/signatures with reusable forgeability, they rely on “zero-knowledge VDFs”, where instead of the output y, one just proves knowledge of this output. The existing proposals for watermarkable and zero-knowledge VDFs all build on Wesolowski’s PoE, for the watermarkable VDFs there’s currently no security proof.\r\n\r\nIn this work we give the first constructions that transform any PoEs in hidden order groups into watermarkable VDFs and into zkVDFs, solving an open question by Arun et al. Unlike our watermarkable VDF, the zkVDF (required for reusable forgeability) is not very practical as the number of group elements in the proof is a security parameter. To address this, we introduce the notion of zero-knowledge proofs of sequential work (zkPoSW), a notion that relaxes zkVDFs by not requiring that the output is unique. We show that zkPoSW are sufficient to construct proofs or signatures with reusable forgeability, and construct efficient zkPoSW from any PoE, ultimately achieving short lived proofs and signatures that improve upon Arun et al.’s construction in several dimensions (faster forging times, arguably weaker assumptions).\r\nA key idea underlying our constructions is to not directly construct a (watermarked or zk) proof for y = x^2^T, but instead give a (watermarked or zk) proof for the more basic statement that \r\nx^l, y^l satisfy x^l = x ^r, y^l = y^r for some r, together with a normal PoE for y^l = (x^l)^2^T."}],"status":"public","main_file_link":[{"url":"https://ia.cr/2024/481","open_access":"1"}],"publication_status":"published","type":"conference","volume":15674,"page":"36-66","day":"01","publication":"28th IACR International Conference on Practice and Theory of Public-Key Cryptography","publisher":"Springer Nature","OA_type":"green","article_processing_charge":"No","oa":1,"citation":{"mla":"Hoffmann, Charlotte, and Krzysztof Z. Pietrzak. “Watermarkable and Zero-Knowledge Verifiable Delay Functions from Any Proof of Exponentiation.” <i>28th IACR International Conference on Practice and Theory of Public-Key Cryptography</i>, vol. 15674, Springer Nature, 2025, pp. 36–66, doi:<a href=\"https://doi.org/10.1007/978-3-031-91820-9_2\">10.1007/978-3-031-91820-9_2</a>.","ieee":"C. Hoffmann and K. Z. Pietrzak, “Watermarkable and zero-knowledge Verifiable Delay Functions from any proof of exponentiation,” in <i>28th IACR International Conference on Practice and Theory of Public-Key Cryptography</i>, Roros, Norway, 2025, vol. 15674, pp. 36–66.","short":"C. Hoffmann, K.Z. Pietrzak, in:, 28th IACR International Conference on Practice and Theory of Public-Key Cryptography, Springer Nature, 2025, pp. 36–66.","ista":"Hoffmann C, Pietrzak KZ. 2025. Watermarkable and zero-knowledge Verifiable Delay Functions from any proof of exponentiation. 28th IACR International Conference on Practice and Theory of Public-Key Cryptography. PKC: Public-Key Cryptography, LNCS, vol. 15674, 36–66.","ama":"Hoffmann C, Pietrzak KZ. Watermarkable and zero-knowledge Verifiable Delay Functions from any proof of exponentiation. In: <i>28th IACR International Conference on Practice and Theory of Public-Key Cryptography</i>. Vol 15674. Springer Nature; 2025:36-66. doi:<a href=\"https://doi.org/10.1007/978-3-031-91820-9_2\">10.1007/978-3-031-91820-9_2</a>","chicago":"Hoffmann, Charlotte, and Krzysztof Z Pietrzak. “Watermarkable and Zero-Knowledge Verifiable Delay Functions from Any Proof of Exponentiation.” In <i>28th IACR International Conference on Practice and Theory of Public-Key Cryptography</i>, 15674:36–66. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/978-3-031-91820-9_2\">https://doi.org/10.1007/978-3-031-91820-9_2</a>.","apa":"Hoffmann, C., &#38; Pietrzak, K. Z. (2025). Watermarkable and zero-knowledge Verifiable Delay Functions from any proof of exponentiation. In <i>28th IACR International Conference on Practice and Theory of Public-Key Cryptography</i> (Vol. 15674, pp. 36–66). Roros, Norway: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-91820-9_2\">https://doi.org/10.1007/978-3-031-91820-9_2</a>"},"date_created":"2025-06-03T07:30:21Z","year":"2025","quality_controlled":"1","corr_author":"1","title":"Watermarkable and zero-knowledge Verifiable Delay Functions from any proof of exponentiation","related_material":{"record":[{"status":"public","id":"20920","relation":"dissertation_contains"},{"relation":"dissertation_contains","id":"20556","status":"public"}]},"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","OA_place":"repository","date_updated":"2026-04-16T09:11:09Z","date_published":"2025-01-01T00:00:00Z","alternative_title":["LNCS"],"author":[{"orcid":"0000-0003-2027-5549","first_name":"Charlotte","id":"0f78d746-dc7d-11ea-9b2f-83f92091afe7","last_name":"Hoffmann","full_name":"Hoffmann, Charlotte"},{"last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z"}],"month":"01","oa_version":"Preprint","scopus_import":"1","language":[{"iso":"eng"}],"conference":{"location":"Roros, Norway","name":"PKC: Public-Key Cryptography","end_date":"2025-05-15","start_date":"2025-05-12"},"publication_identifier":{"eisbn":["9783031918209"],"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783031918193"]},"doi":"10.1007/978-3-031-91820-9_2","department":[{"_id":"KrPi"},{"_id":"GradSch"}]}]