--- _id: '12364' abstract: - lang: eng text: "Autism spectrum disorders (ASDs) are a group of neurodevelopmental disorders character\x02ized by behavioral symptoms such as problems in social communication and interaction, as\r\nwell as repetitive, restricted behaviors and interests. These disorders show a high degree\r\nof heritability and hundreds of risk genes have been identifed using high throughput\r\nsequencing technologies. This genetic heterogeneity has hampered eforts in understanding\r\nthe pathogenesis of ASD but at the same time given rise to the concept of convergent\r\nmechanisms. Previous studies have identifed that risk genes for ASD broadly converge\r\nonto specifc functional categories with transcriptional regulation being one of the biggest\r\ngroups. In this thesis, I focus on this subgroup of genes and investigate the gene regulatory\r\nconsequences of some of them in the context of neurodevelopment.\r\nFirst, we showed that mutations in the ASD and intellectual disability risk gene Setd5 lead\r\nto perturbations of gene regulatory programs in early cell fate specifcation. In addition,\r\nadult animals display abnormal learning behavior which is mirrored at the transcriptional\r\nlevel by altered activity dependent regulation of postsynaptic gene expression. Lastly,\r\nwe link the regulatory function of Setd5 to its interaction with the Paf1 and the NCoR\r\ncomplex.\r\nSecond, by modeling the heterozygous loss of the top ASD gene CHD8 in human cerebral\r\norganoids we demonstrate profound changes in the developmental trajectories of both\r\ninhibitory and excitatory neurons using single cell RNA-sequencing. While the former\r\nwere generated earlier in CHD8+/- organoids, the generation of the latter was shifted to\r\nlater times in favor of a prolonged progenitor expansion phase and ultimately increased\r\norganoid size.\r\nFinally, by modeling heterozygous mutations for four ASD associated chromatin modifers,\r\nASH1L, KDM6B, KMT5B, and SETD5 in human cortical spheroids we show evidence of\r\nregulatory convergence across three of those genes. We observe a shift from dorsal cortical\r\nexcitatory neuron fates towards partially ventralized cell types resembling cells from the\r\nlateral ganglionic eminence. As this project is still ongoing at the time of writing, future\r\nexperiments will aim at elucidating the regulatory mechanisms underlying this shift with\r\nthe aim of linking these three ASD risk genes through biological convergence." alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Christoph full_name: Dotter, Christoph id: 4C66542E-F248-11E8-B48F-1D18A9856A87 last_name: Dotter orcid: 0000-0002-9033-9096 citation: ama: Dotter C. Transcriptional consequences of mutations in genes associated with Autism Spectrum Disorder. 2022. doi:10.15479/at:ista:12094 apa: Dotter, C. (2022). Transcriptional consequences of mutations in genes associated with Autism Spectrum Disorder. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:12094 chicago: Dotter, Christoph. “Transcriptional Consequences of Mutations in Genes Associated with Autism Spectrum Disorder.” Institute of Science and Technology Austria, 2022. https://doi.org/10.15479/at:ista:12094. ieee: C. Dotter, “Transcriptional consequences of mutations in genes associated with Autism Spectrum Disorder,” Institute of Science and Technology Austria, 2022. ista: Dotter C. 2022. Transcriptional consequences of mutations in genes associated with Autism Spectrum Disorder. Institute of Science and Technology Austria. mla: Dotter, Christoph. Transcriptional Consequences of Mutations in Genes Associated with Autism Spectrum Disorder. Institute of Science and Technology Austria, 2022, doi:10.15479/at:ista:12094. short: C. Dotter, Transcriptional Consequences of Mutations in Genes Associated with Autism Spectrum Disorder, Institute of Science and Technology Austria, 2022. date_created: 2023-01-24T13:09:57Z date_published: 2022-09-19T00:00:00Z date_updated: 2023-11-16T13:10:22Z day: '19' ddc: - '570' degree_awarded: PhD department: - _id: GradSch - _id: GaNo doi: 10.15479/at:ista:12094 ec_funded: 1 file: - access_level: open_access checksum: 896f4cac9adb6d3f26a6605772f4e1a3 content_type: application/pdf creator: cchlebak date_created: 2023-01-24T13:15:45Z date_updated: 2023-09-20T22:30:03Z embargo: 2023-09-19 file_id: '12365' file_name: 220923_Thesis_CDotter_Final.pdf file_size: 20457465 relation: main_file - access_level: closed checksum: ad01bb20da163be6893b7af832e58419 content_type: application/x-zip-compressed creator: cchlebak date_created: 2023-02-02T09:15:35Z date_updated: 2023-09-20T22:30:03Z embargo_to: open_access file_id: '12482' file_name: latex_source_CDotter_Thesis_2022.zip file_size: 22433512 relation: source_file file_date_updated: 2023-09-20T22:30:03Z has_accepted_license: '1' language: - iso: eng month: '09' oa: 1 oa_version: Published Version page: '152' project: - _id: 254BA948-B435-11E9-9278-68D0E5697425 grant_number: '401299' name: Probing development and reversibility of autism spectrum disorders - _id: 9B91375C-BA93-11EA-9121-9846C619BF3A grant_number: '707964' name: Critical windows and reversibility of ASD associated with mutations in chromatin remodelers - _id: 25444568-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '715508' name: Probing the Reversibility of Autism Spectrum Disorders by Employing in vivo and in vitro Models - _id: 2690FEAC-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: I04205 name: Identification of converging Molecular Pathways Across Chromatinopathies as Targets for Therapy publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '3' relation: part_of_dissertation status: public - id: '11160' relation: part_of_dissertation status: public status: public supervisor: - first_name: Gaia full_name: Novarino, Gaia id: 3E57A680-F248-11E8-B48F-1D18A9856A87 last_name: Novarino orcid: 0000-0002-7673-7178 title: Transcriptional consequences of mutations in genes associated with Autism Spectrum Disorder type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2022' ... --- _id: '9056' abstract: - lang: eng text: "In this thesis we study persistence of multi-covers of Euclidean balls and the geometric structures underlying their computation, in particular Delaunay mosaics and Voronoi tessellations. The k-fold cover for some discrete input point set consists of the space where at least k balls of radius r around the input points overlap. Persistence is a notion that captures, in some sense, the topology of the shape underlying the input. While persistence is usually computed for the union of balls, the k-fold cover is of interest as it captures local density,\r\nand thus might approximate the shape of the input better if the input data is noisy. To compute persistence of these k-fold covers, we need a discretization that is provided by higher-order Delaunay mosaics. We present and implement a simple and efficient algorithm for the computation of higher-order Delaunay mosaics, and use it to give experimental results for their combinatorial properties. The algorithm makes use of a new geometric structure, the rhomboid tiling. It contains the higher-order Delaunay mosaics as slices, and by introducing a filtration\r\nfunction on the tiling, we also obtain higher-order α-shapes as slices. These allow us to compute persistence of the multi-covers for varying radius r; the computation for varying k is less straight-foward and involves the rhomboid tiling directly. We apply our algorithms to experimental sphere packings to shed light on their structural properties. Finally, inspired by periodic structures in packings and materials, we propose and implement an algorithm for periodic Delaunay triangulations to be integrated into the Computational Geometry Algorithms Library (CGAL), and discuss the implications on persistence for periodic data sets." alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Georg F full_name: Osang, Georg F id: 464B40D6-F248-11E8-B48F-1D18A9856A87 last_name: Osang orcid: 0000-0002-8882-5116 citation: ama: Osang GF. Multi-cover persistence and Delaunay mosaics. 2021. doi:10.15479/AT:ISTA:9056 apa: Osang, G. F. (2021). Multi-cover persistence and Delaunay mosaics. Institute of Science and Technology Austria, Klosterneuburg. https://doi.org/10.15479/AT:ISTA:9056 chicago: Osang, Georg F. “Multi-Cover Persistence and Delaunay Mosaics.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/AT:ISTA:9056. ieee: G. F. Osang, “Multi-cover persistence and Delaunay mosaics,” Institute of Science and Technology Austria, Klosterneuburg, 2021. ista: 'Osang GF. 2021. Multi-cover persistence and Delaunay mosaics. Klosterneuburg: Institute of Science and Technology Austria.' mla: Osang, Georg F. Multi-Cover Persistence and Delaunay Mosaics. Institute of Science and Technology Austria, 2021, doi:10.15479/AT:ISTA:9056. short: G.F. Osang, Multi-Cover Persistence and Delaunay Mosaics, Institute of Science and Technology Austria, 2021. date_created: 2021-02-02T14:11:06Z date_published: 2021-02-01T00:00:00Z date_updated: 2023-09-07T13:29:01Z day: '01' ddc: - '006' - '514' - '516' degree_awarded: PhD department: - _id: HeEd - _id: GradSch doi: 10.15479/AT:ISTA:9056 file: - access_level: closed checksum: bcf27986147cab0533b6abadd74e7629 content_type: application/zip creator: patrickd date_created: 2021-02-02T14:09:25Z date_updated: 2021-02-03T10:37:28Z file_id: '9063' file_name: thesis_source.zip file_size: 13446994 relation: source_file - access_level: open_access checksum: 9cc8af266579a464385bbe2aff6af606 content_type: application/pdf creator: patrickd date_created: 2021-02-02T14:09:18Z date_updated: 2021-02-02T14:09:18Z file_id: '9064' file_name: thesis_pdfA2b.pdf file_size: 5210329 relation: main_file success: 1 file_date_updated: 2021-02-03T10:37:28Z has_accepted_license: '1' language: - iso: eng license: https://creativecommons.org/licenses/by/4.0/ month: '02' oa: 1 oa_version: Published Version page: '134' place: Klosterneuburg publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '187' relation: part_of_dissertation status: public - id: '8703' relation: part_of_dissertation status: public status: public supervisor: - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 title: Multi-cover persistence and Delaunay mosaics tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: dissertation user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2021' ... --- _id: '9022' abstract: - lang: eng text: "In the first part of the thesis we consider Hermitian random matrices. Firstly, we consider sample covariance matrices XX∗ with X having independent identically distributed (i.i.d.) centred entries. We prove a Central Limit Theorem for differences of linear statistics of XX∗ and its minor after removing the first column of X. Secondly, we consider Wigner-type matrices and prove that the eigenvalue statistics near cusp singularities of the limiting density of states are universal and that they form a Pearcey process. Since the limiting eigenvalue distribution admits only square root (edge) and cubic root (cusp) singularities, this concludes the third and last remaining case of the Wigner-Dyson-Mehta universality conjecture. The main technical ingredients are an optimal local law at the cusp, and the proof of the fast relaxation to equilibrium of the Dyson Brownian motion in the cusp regime.\r\nIn the second part we consider non-Hermitian matrices X with centred i.i.d. entries. We normalise the entries of X to have variance N −1. It is well known that the empirical eigenvalue density converges to the uniform distribution on the unit disk (circular law). In the first project, we prove universality of the local eigenvalue statistics close to the edge of the spectrum. This is the non-Hermitian analogue of the TracyWidom universality at the Hermitian edge. Technically we analyse the evolution of the spectral distribution of X along the Ornstein-Uhlenbeck flow for very long time\r\n(up to t = +∞). In the second project, we consider linear statistics of eigenvalues for macroscopic test functions f in the Sobolev space H2+ϵ and prove their convergence to the projection of the Gaussian Free Field on the unit disk. We prove this result for non-Hermitian matrices with real or complex entries. The main technical ingredients are: (i) local law for products of two resolvents at different spectral parameters, (ii) analysis of correlated Dyson Brownian motions.\r\nIn the third and final part we discuss the mathematically rigorous application of supersymmetric techniques (SUSY ) to give a lower tail estimate of the lowest singular value of X − z, with z ∈ C. More precisely, we use superbosonisation formula to give an integral representation of the resolvent of (X − z)(X − z)∗ which reduces to two and three contour integrals in the complex and real case, respectively. The rigorous analysis of these integrals is quite challenging since simple saddle point analysis cannot be applied (the main contribution comes from a non-trivial manifold). Our result\r\nimproves classical smoothing inequalities in the regime |z| ≈ 1; this result is essential to prove edge universality for i.i.d. non-Hermitian matrices." acknowledgement: I gratefully acknowledge the financial support from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385 and my advisor’s ERC Advanced Grant No. 338804. alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Giorgio full_name: Cipolloni, Giorgio id: 42198EFA-F248-11E8-B48F-1D18A9856A87 last_name: Cipolloni orcid: 0000-0002-4901-7992 citation: ama: Cipolloni G. Fluctuations in the spectrum of random matrices. 2021. doi:10.15479/AT:ISTA:9022 apa: Cipolloni, G. (2021). Fluctuations in the spectrum of random matrices. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:9022 chicago: Cipolloni, Giorgio. “Fluctuations in the Spectrum of Random Matrices.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/AT:ISTA:9022. ieee: G. Cipolloni, “Fluctuations in the spectrum of random matrices,” Institute of Science and Technology Austria, 2021. ista: Cipolloni G. 2021. Fluctuations in the spectrum of random matrices. Institute of Science and Technology Austria. mla: Cipolloni, Giorgio. Fluctuations in the Spectrum of Random Matrices. Institute of Science and Technology Austria, 2021, doi:10.15479/AT:ISTA:9022. short: G. Cipolloni, Fluctuations in the Spectrum of Random Matrices, Institute of Science and Technology Austria, 2021. date_created: 2021-01-21T18:16:54Z date_published: 2021-01-25T00:00:00Z date_updated: 2023-09-07T13:29:32Z day: '25' ddc: - '510' degree_awarded: PhD department: - _id: GradSch - _id: LaEr doi: 10.15479/AT:ISTA:9022 ec_funded: 1 file: - access_level: open_access checksum: 5a93658a5f19478372523ee232887e2b content_type: application/pdf creator: gcipollo date_created: 2021-01-25T14:19:03Z date_updated: 2021-01-25T14:19:03Z file_id: '9043' file_name: thesis.pdf file_size: 4127796 relation: main_file success: 1 - access_level: closed checksum: e8270eddfe6a988e92a53c88d1d19b8c content_type: application/zip creator: gcipollo date_created: 2021-01-25T14:19:10Z date_updated: 2021-01-25T14:19:10Z file_id: '9044' file_name: Thesis_files.zip file_size: 12775206 relation: source_file file_date_updated: 2021-01-25T14:19:10Z has_accepted_license: '1' language: - iso: eng month: '01' oa: 1 oa_version: Published Version page: '380' project: - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program - _id: 258DCDE6-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '338804' name: Random matrices, universality and disordered quantum systems publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria status: public supervisor: - first_name: László full_name: Erdös, László id: 4DBD5372-F248-11E8-B48F-1D18A9856A87 last_name: Erdös orcid: 0000-0001-5366-9603 title: Fluctuations in the spectrum of random matrices type: dissertation user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2021' ... --- _id: '10007' abstract: - lang: eng text: The present thesis is concerned with the derivation of weak-strong uniqueness principles for curvature driven interface evolution problems not satisfying a comparison principle. The specific examples being treated are two-phase Navier-Stokes flow with surface tension, modeling the evolution of two incompressible, viscous and immiscible fluids separated by a sharp interface, and multiphase mean curvature flow, which serves as an idealized model for the motion of grain boundaries in an annealing polycrystalline material. Our main results - obtained in joint works with Julian Fischer, Tim Laux and Theresa M. Simon - state that prior to the formation of geometric singularities due to topology changes, the weak solution concept of Abels (Interfaces Free Bound. 9, 2007) to two-phase Navier-Stokes flow with surface tension and the weak solution concept of Laux and Otto (Calc. Var. Partial Differential Equations 55, 2016) to multiphase mean curvature flow (for networks in R^2 or double bubbles in R^3) represents the unique solution to these interface evolution problems within the class of classical solutions, respectively. To the best of the author's knowledge, for interface evolution problems not admitting a geometric comparison principle the derivation of a weak-strong uniqueness principle represented an open problem, so that the works contained in the present thesis constitute the first positive results in this direction. The key ingredient of our approach consists of the introduction of a novel concept of relative entropies for a class of curvature driven interface evolution problems, for which the associated energy contains an interfacial contribution being proportional to the surface area of the evolving (network of) interface(s). The interfacial part of the relative entropy gives sufficient control on the interface error between a weak and a classical solution, and its time evolution can be computed, at least in principle, for any energy dissipating weak solution concept. A resulting stability estimate for the relative entropy essentially entails the above mentioned weak-strong uniqueness principles. The present thesis contains a detailed introduction to our relative entropy approach, which in particular highlights potential applications to other problems in curvature driven interface evolution not treated in this thesis. alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Sebastian full_name: Hensel, Sebastian id: 4D23B7DA-F248-11E8-B48F-1D18A9856A87 last_name: Hensel orcid: 0000-0001-7252-8072 citation: ama: 'Hensel S. Curvature driven interface evolution: Uniqueness properties of weak solution concepts. 2021. doi:10.15479/at:ista:10007' apa: 'Hensel, S. (2021). Curvature driven interface evolution: Uniqueness properties of weak solution concepts. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10007' chicago: 'Hensel, Sebastian. “Curvature Driven Interface Evolution: Uniqueness Properties of Weak Solution Concepts.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10007.' ieee: 'S. Hensel, “Curvature driven interface evolution: Uniqueness properties of weak solution concepts,” Institute of Science and Technology Austria, 2021.' ista: 'Hensel S. 2021. Curvature driven interface evolution: Uniqueness properties of weak solution concepts. Institute of Science and Technology Austria.' mla: 'Hensel, Sebastian. Curvature Driven Interface Evolution: Uniqueness Properties of Weak Solution Concepts. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10007.' short: 'S. Hensel, Curvature Driven Interface Evolution: Uniqueness Properties of Weak Solution Concepts, Institute of Science and Technology Austria, 2021.' date_created: 2021-09-13T11:12:34Z date_published: 2021-09-14T00:00:00Z date_updated: 2023-09-07T13:30:45Z day: '14' ddc: - '515' degree_awarded: PhD department: - _id: GradSch - _id: JuFi doi: 10.15479/at:ista:10007 ec_funded: 1 file: - access_level: closed checksum: c8475faaf0b680b4971f638f1db16347 content_type: application/x-zip-compressed creator: shensel date_created: 2021-09-13T11:03:24Z date_updated: 2021-09-15T14:37:30Z file_id: '10008' file_name: thesis_final_Hensel.zip file_size: 15022154 relation: source_file - access_level: open_access checksum: 1a609937aa5275452822f45f2da17f07 content_type: application/pdf creator: shensel date_created: 2021-09-13T14:18:56Z date_updated: 2021-09-14T09:52:47Z file_id: '10014' file_name: thesis_final_Hensel.pdf file_size: 6583638 relation: main_file file_date_updated: 2021-09-15T14:37:30Z has_accepted_license: '1' language: - iso: eng month: '09' oa: 1 oa_version: Published Version page: '300' project: - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program - _id: 0aa76401-070f-11eb-9043-b5bb049fa26d call_identifier: H2020 grant_number: '948819' name: Bridging Scales in Random Materials publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '10012' relation: part_of_dissertation status: public - id: '10013' relation: part_of_dissertation status: public - id: '7489' relation: part_of_dissertation status: public status: public supervisor: - first_name: Julian L full_name: Fischer, Julian L id: 2C12A0B0-F248-11E8-B48F-1D18A9856A87 last_name: Fischer orcid: 0000-0002-0479-558X title: 'Curvature driven interface evolution: Uniqueness properties of weak solution concepts' type: dissertation user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2021' ... --- _id: '10030' abstract: - lang: eng text: "This PhD thesis is primarily focused on the study of discrete transport problems, introduced for the first time in the seminal works of Maas [Maa11] and Mielke [Mie11] on finite state Markov chains and reaction-diffusion equations, respectively. More in detail, my research focuses on the study of transport costs on graphs, in particular the convergence and the stability of such problems in the discrete-to-continuum limit. This thesis also includes some results concerning\r\nnon-commutative optimal transport. The first chapter of this thesis consists of a general introduction to the optimal transport problems, both in the discrete, the continuous, and the non-commutative setting. Chapters 2 and 3 present the content of two works, obtained in collaboration with Peter Gladbach, Eva Kopfer, and Jan Maas, where we have been able to show the convergence of discrete transport costs on periodic graphs to suitable continuous ones, which can be described by means of a homogenisation result. We first focus on the particular case of quadratic costs on the real line and then extending the result to more general costs in arbitrary dimension. Our results are the first complete characterisation of limits of transport costs on periodic graphs in arbitrary dimension which do not rely on any additional symmetry. In Chapter 4 we turn our attention to one of the intriguing connection between evolution equations and optimal transport, represented by the theory of gradient flows. We show that discrete gradient flow structures associated to a finite volume approximation of a certain class of diffusive equations (Fokker–Planck) is stable in the limit of vanishing meshes, reproving the convergence of the scheme via the method of evolutionary Γ-convergence and exploiting a more variational point of view on the problem. This is based on a collaboration with Dominik Forkert and Jan Maas. Chapter 5 represents a change of perspective, moving away from the discrete world and reaching the non-commutative one. As in the discrete case, we discuss how classical tools coming from the commutative optimal transport can be translated into the setting of density matrices. In particular, in this final chapter we present a non-commutative version of the Schrödinger problem (or entropic regularised optimal transport problem) and discuss existence and characterisation of minimisers, a duality result, and present a non-commutative version of the well-known Sinkhorn algorithm to compute the above mentioned optimisers. This is based on a joint work with Dario Feliciangeli and Augusto Gerolin. Finally, Appendix A and B contain some additional material and discussions, with particular attention to Harnack inequalities and the regularity of flows on discrete spaces." acknowledged_ssus: - _id: M-Shop - _id: NanoFab acknowledgement: The author gratefully acknowledges support by the Austrian Science Fund (FWF), grants No W1245. alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Lorenzo full_name: Portinale, Lorenzo id: 30AD2CBC-F248-11E8-B48F-1D18A9856A87 last_name: Portinale citation: ama: Portinale L. Discrete-to-continuum limits of transport problems and gradient flows in the space of measures. 2021. doi:10.15479/at:ista:10030 apa: Portinale, L. (2021). Discrete-to-continuum limits of transport problems and gradient flows in the space of measures. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10030 chicago: Portinale, Lorenzo. “Discrete-to-Continuum Limits of Transport Problems and Gradient Flows in the Space of Measures.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10030. ieee: L. Portinale, “Discrete-to-continuum limits of transport problems and gradient flows in the space of measures,” Institute of Science and Technology Austria, 2021. ista: Portinale L. 2021. Discrete-to-continuum limits of transport problems and gradient flows in the space of measures. Institute of Science and Technology Austria. mla: Portinale, Lorenzo. Discrete-to-Continuum Limits of Transport Problems and Gradient Flows in the Space of Measures. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10030. short: L. Portinale, Discrete-to-Continuum Limits of Transport Problems and Gradient Flows in the Space of Measures, Institute of Science and Technology Austria, 2021. date_created: 2021-09-21T09:14:15Z date_published: 2021-09-22T00:00:00Z date_updated: 2023-09-07T13:31:06Z day: '22' ddc: - '515' degree_awarded: PhD department: - _id: GradSch - _id: JaMa doi: 10.15479/at:ista:10030 file: - access_level: closed checksum: 8cd60dcb8762e8f21867e21e8001e183 content_type: application/x-zip-compressed creator: cchlebak date_created: 2021-09-21T09:17:34Z date_updated: 2022-03-10T12:14:42Z file_id: '10032' file_name: tex_and_pictures.zip file_size: 3876668 relation: source_file - access_level: open_access checksum: 9789e9d967c853c1503ec7f307170279 content_type: application/pdf creator: cchlebak date_created: 2021-09-27T11:14:31Z date_updated: 2021-09-27T11:14:31Z file_id: '10047' file_name: thesis_portinale_Final (1).pdf file_size: 2532673 relation: main_file file_date_updated: 2022-03-10T12:14:42Z has_accepted_license: '1' language: - iso: eng month: '09' oa: 1 oa_version: Published Version project: - _id: 260788DE-B435-11E9-9278-68D0E5697425 call_identifier: FWF name: Dissipation and Dispersion in Nonlinear Partial Differential Equations - _id: fc31cba2-9c52-11eb-aca3-ff467d239cd2 grant_number: F6504 name: Taming Complexity in Partial Differential Systems publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '10022' relation: part_of_dissertation status: public - id: '9792' relation: part_of_dissertation status: public - id: '7573' relation: part_of_dissertation status: public status: public supervisor: - first_name: Jan full_name: Maas, Jan id: 4C5696CE-F248-11E8-B48F-1D18A9856A87 last_name: Maas orcid: 0000-0002-0845-1338 title: Discrete-to-continuum limits of transport problems and gradient flows in the space of measures tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: dissertation user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2021' ... --- _id: '9920' abstract: - lang: eng text: 'This work is concerned with two fascinating circuit quantum electrodynamics components, the Josephson junction and the geometric superinductor, and the interesting experiments that can be done by combining the two. The Josephson junction has revolutionized the field of superconducting circuits as a non-linear dissipation-less circuit element and is used in almost all superconducting qubit implementations since the 90s. On the other hand, the superinductor is a relatively new circuit element introduced as a key component of the fluxonium qubit in 2009. This is an inductor with characteristic impedance larger than the resistance quantum and self-resonance frequency in the GHz regime. The combination of these two elements can occur in two fundamental ways: in parallel and in series. When connected in parallel the two create the fluxonium qubit, a loop with large inductance and a rich energy spectrum reliant on quantum tunneling. On the other hand placing the two elements in series aids with the measurement of the IV curve of a single Josephson junction in a high impedance environment. In this limit theory predicts that the junction will behave as its dual element: the phase-slip junction. While the Josephson junction acts as a non-linear inductor the phase-slip junction has the behavior of a non-linear capacitance and can be used to measure new Josephson junction phenomena, namely Coulomb blockade of Cooper pairs and phase-locked Bloch oscillations. The latter experiment allows for a direct link between frequency and current which is an elusive connection in quantum metrology. This work introduces the geometric superinductor, a superconducting circuit element where the high inductance is due to the geometry rather than the material properties of the superconductor, realized from a highly miniaturized superconducting planar coil. These structures will be described and characterized as resonators and qubit inductors and progress towards the measurement of phase-locked Bloch oscillations will be presented.' acknowledged_ssus: - _id: NanoFab - _id: M-Shop alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Matilda full_name: Peruzzo, Matilda id: 3F920B30-F248-11E8-B48F-1D18A9856A87 last_name: Peruzzo orcid: 0000-0002-3415-4628 citation: ama: Peruzzo M. Geometric superinductors and their applications in circuit quantum electrodynamics. 2021. doi:10.15479/at:ista:9920 apa: Peruzzo, M. (2021). Geometric superinductors and their applications in circuit quantum electrodynamics. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:9920 chicago: Peruzzo, Matilda. “Geometric Superinductors and Their Applications in Circuit Quantum Electrodynamics.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:9920. ieee: M. Peruzzo, “Geometric superinductors and their applications in circuit quantum electrodynamics,” Institute of Science and Technology Austria, 2021. ista: Peruzzo M. 2021. Geometric superinductors and their applications in circuit quantum electrodynamics. Institute of Science and Technology Austria. mla: Peruzzo, Matilda. Geometric Superinductors and Their Applications in Circuit Quantum Electrodynamics. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:9920. short: M. Peruzzo, Geometric Superinductors and Their Applications in Circuit Quantum Electrodynamics, Institute of Science and Technology Austria, 2021. date_created: 2021-08-16T09:44:09Z date_published: 2021-08-19T00:00:00Z date_updated: 2023-09-07T13:31:22Z day: '19' ddc: - '539' degree_awarded: PhD department: - _id: GradSch - _id: JoFi doi: 10.15479/at:ista:9920 file: - access_level: closed checksum: 3cd1986efde5121d7581f6fcf9090da8 content_type: application/x-zip-compressed creator: mperuzzo date_created: 2021-08-16T09:33:21Z date_updated: 2021-09-06T08:39:47Z file_id: '9924' file_name: GeometricSuperinductorsForCQED.zip file_size: 151387283 relation: source_file - access_level: open_access checksum: 50928c621cdf0775d7a5906b9dc8602c content_type: application/pdf creator: mperuzzo date_created: 2021-08-18T14:20:06Z date_updated: 2021-09-06T08:39:47Z file_id: '9939' file_name: GeometricSuperinductorsAndTheirApplicationsIncQED-1b.pdf file_size: 17596344 relation: main_file - access_level: closed checksum: 37f486aa1b622fe44af00d627ec13f6c content_type: application/pdf creator: mperuzzo date_created: 2021-08-18T14:20:09Z date_updated: 2021-09-06T08:39:47Z description: Extra copy of the thesis as PDF/A-2b file_id: '9940' file_name: GeometricSuperinductorsAndTheirApplicationsIncQED-2b.pdf file_size: 17592425 relation: other file_date_updated: 2021-09-06T08:39:47Z has_accepted_license: '1' keyword: - quantum computing - superinductor - quantum metrology language: - iso: eng month: '08' oa: 1 oa_version: Published Version page: '149' publication_identifier: isbn: - 978-3-99078-013-8 issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '9928' relation: part_of_dissertation status: public - id: '8755' relation: part_of_dissertation status: public status: public supervisor: - first_name: Johannes M full_name: Fink, Johannes M id: 4B591CBA-F248-11E8-B48F-1D18A9856A87 last_name: Fink orcid: 0000-0001-8112-028X title: Geometric superinductors and their applications in circuit quantum electrodynamics type: dissertation user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2021' ... --- _id: '10422' abstract: - lang: eng text: Those who aim to devise new materials with desirable properties usually examine present methods first. However, they will find out that some approaches can exist only conceptually without high chances to become practically useful. It seems that a numerical technique called automatic differentiation together with increasing supply of computational accelerators will soon shift many methods of the material design from the category ”unimaginable” to the category ”expensive but possible”. Approach we suggest is not an exception. Our overall goal is to have an efficient and generalizable approach allowing to solve inverse design problems. In this thesis we scratch its surface. We consider jammed systems of identical particles. And ask ourselves how the shape of those particles (or the parameters codifying it) may affect mechanical properties of the system. An indispensable part of reaching the answer is an appropriate particle parametrization. We come up with a simple, yet generalizable and purposeful scheme for it. Using our generalizable shape parameterization, we simulate the formation of a solid composed of pentagonal-like particles and measure anisotropy in the resulting elastic response. Through automatic differentiation techniques, we directly connect the shape parameters with the elastic response. Interestingly, for our system we find that less isotropic particles lead to a more isotropic elastic response. Together with other results known about our method it seems that it can be successfully generalized for different inverse design problems. alternative_title: - ISTA Master's Thesis article_processing_charge: No author: - first_name: Anton full_name: Piankov, Anton id: 865E3C26-AA8C-11E9-A409-C4C4E5697425 last_name: Piankov citation: ama: Piankov A. Towards designer materials using customizable particle shape. 2021. doi:10.15479/at:ista:10422 apa: Piankov, A. (2021). Towards designer materials using customizable particle shape. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10422 chicago: Piankov, Anton. “Towards Designer Materials Using Customizable Particle Shape.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10422. ieee: A. Piankov, “Towards designer materials using customizable particle shape,” Institute of Science and Technology Austria, 2021. ista: Piankov A. 2021. Towards designer materials using customizable particle shape. Institute of Science and Technology Austria. mla: Piankov, Anton. Towards Designer Materials Using Customizable Particle Shape. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10422. short: A. Piankov, Towards Designer Materials Using Customizable Particle Shape, Institute of Science and Technology Austria, 2021. date_created: 2021-12-07T10:48:06Z date_published: 2021-12-07T00:00:00Z date_updated: 2023-09-07T13:34:12Z day: '07' ddc: - '530' degree_awarded: MS department: - _id: GradSch - _id: CaGo doi: 10.15479/at:ista:10422 file: - access_level: closed checksum: 114e8f4b2c002c6c352416c12de2c695 content_type: application/x-zip-compressed creator: cchlebak date_created: 2021-12-07T11:13:52Z date_updated: 2022-03-10T12:10:25Z file_id: '10424' file_name: Thesis.zip file_size: 394018 relation: source_file - access_level: closed checksum: cd15ae991ced352a9959815f794e657c content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document creator: cchlebak date_created: 2021-12-07T11:14:01Z date_updated: 2022-03-10T12:10:25Z file_id: '10425' file_name: Preliminary_pages_Piankov.docx file_size: 47638 relation: source_file - access_level: open_access checksum: e6899c798b75ba42fab9822bce309050 content_type: application/pdf creator: cchlebak date_created: 2021-12-07T11:20:35Z date_updated: 2021-12-07T11:20:35Z file_id: '10426' file_name: 2021_Piankov_combined.pdf file_size: 484965 relation: main_file success: 1 file_date_updated: 2022-03-10T12:10:25Z has_accepted_license: '1' language: - iso: eng month: '12' oa: 1 oa_version: Published Version publication_identifier: issn: - 2791-4585 publication_status: published publisher: Institute of Science and Technology Austria status: public supervisor: - first_name: Carl Peter full_name: Goodrich, Carl Peter id: EB352CD2-F68A-11E9-89C5-A432E6697425 last_name: Goodrich orcid: 0000-0002-1307-5074 title: Towards designer materials using customizable particle shape type: dissertation user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2021' ... --- _id: '9418' abstract: - lang: eng text: "Deep learning is best known for its empirical success across a wide range of applications\r\nspanning computer vision, natural language processing and speech. Of equal significance,\r\nthough perhaps less known, are its ramifications for learning theory: deep networks have\r\nbeen observed to perform surprisingly well in the high-capacity regime, aka the overfitting\r\nor underspecified regime. Classically, this regime on the far right of the bias-variance curve\r\nis associated with poor generalisation; however, recent experiments with deep networks\r\nchallenge this view.\r\n\r\nThis thesis is devoted to investigating various aspects of underspecification in deep learning.\r\nFirst, we argue that deep learning models are underspecified on two levels: a) any given\r\ntraining dataset can be fit by many different functions, and b) any given function can be\r\nexpressed by many different parameter configurations. We refer to the second kind of\r\nunderspecification as parameterisation redundancy and we precisely characterise its extent.\r\nSecond, we characterise the implicit criteria (the inductive bias) that guide learning in the\r\nunderspecified regime. Specifically, we consider a nonlinear but tractable classification\r\nsetting, and show that given the choice, neural networks learn classifiers with a large margin.\r\nThird, we consider learning scenarios where the inductive bias is not by itself sufficient to\r\ndeal with underspecification. We then study different ways of ‘tightening the specification’: i)\r\nIn the setting of representation learning with variational autoencoders, we propose a hand-\r\ncrafted regulariser based on mutual information. ii) In the setting of binary classification, we\r\nconsider soft-label (real-valued) supervision. We derive a generalisation bound for linear\r\nnetworks supervised in this way and verify that soft labels facilitate fast learning. Finally, we\r\nexplore an application of soft-label supervision to the training of multi-exit models." acknowledged_ssus: - _id: ScienComp - _id: CampIT - _id: E-Lib alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Phuong full_name: Bui Thi Mai, Phuong id: 3EC6EE64-F248-11E8-B48F-1D18A9856A87 last_name: Bui Thi Mai citation: ama: Phuong M. Underspecification in deep learning. 2021. doi:10.15479/AT:ISTA:9418 apa: Phuong, M. (2021). Underspecification in deep learning. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:9418 chicago: Phuong, Mary. “Underspecification in Deep Learning.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/AT:ISTA:9418. ieee: M. Phuong, “Underspecification in deep learning,” Institute of Science and Technology Austria, 2021. ista: Phuong M. 2021. Underspecification in deep learning. Institute of Science and Technology Austria. mla: Phuong, Mary. Underspecification in Deep Learning. Institute of Science and Technology Austria, 2021, doi:10.15479/AT:ISTA:9418. short: M. Phuong, Underspecification in Deep Learning, Institute of Science and Technology Austria, 2021. date_created: 2021-05-24T13:06:23Z date_published: 2021-05-30T00:00:00Z date_updated: 2023-09-08T11:11:12Z day: '30' ddc: - '000' degree_awarded: PhD department: - _id: GradSch - _id: ChLa doi: 10.15479/AT:ISTA:9418 file: - access_level: open_access checksum: 4f0abe64114cfed264f9d36e8d1197e3 content_type: application/pdf creator: bphuong date_created: 2021-05-24T11:22:29Z date_updated: 2021-05-24T11:22:29Z file_id: '9419' file_name: mph-thesis-v519-pdfimages.pdf file_size: 2673905 relation: main_file success: 1 - access_level: closed checksum: f5699e876bc770a9b0df8345a77720a2 content_type: application/zip creator: bphuong date_created: 2021-05-24T11:56:02Z date_updated: 2021-05-24T11:56:02Z file_id: '9420' file_name: thesis.zip file_size: 92995100 relation: source_file file_date_updated: 2021-05-24T11:56:02Z has_accepted_license: '1' language: - iso: eng month: '05' oa: 1 oa_version: Published Version page: '125' publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '7435' relation: part_of_dissertation status: deleted - id: '7481' relation: part_of_dissertation status: public - id: '9416' relation: part_of_dissertation status: public - id: '7479' relation: part_of_dissertation status: public status: public supervisor: - first_name: Christoph full_name: Lampert, Christoph id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 title: Underspecification in deep learning type: dissertation user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2021' ... --- _id: '10199' abstract: - lang: eng text: The design and verification of concurrent systems remains an open challenge due to the non-determinism that arises from the inter-process communication. In particular, concurrent programs are notoriously difficult both to be written correctly and to be analyzed formally, as complex thread interaction has to be accounted for. The difficulties are further exacerbated when concurrent programs get executed on modern-day hardware, which contains various buffering and caching mechanisms for efficiency reasons. This causes further subtle non-determinism, which can often produce very unintuitive behavior of the concurrent programs. Model checking is at the forefront of tackling the verification problem, where the task is to decide, given as input a concurrent system and a desired property, whether the system satisfies the property. The inherent state-space explosion problem in model checking of concurrent systems causes naïve explicit methods not to scale, thus more inventive methods are required. One such method is stateless model checking (SMC), which explores in memory-efficient manner the program executions rather than the states of the program. State-of-the-art SMC is typically coupled with partial order reduction (POR) techniques, which argue that certain executions provably produce identical system behavior, thus limiting the amount of executions one needs to explore in order to cover all possible behaviors. Another method to tackle the state-space explosion is symbolic model checking, where the considered techniques operate on a succinct implicit representation of the input system rather than explicitly accessing the system. In this thesis we present new techniques for verification of concurrent systems. We present several novel POR methods for SMC of concurrent programs under various models of semantics, some of which account for write-buffering mechanisms. Additionally, we present novel algorithms for symbolic model checking of finite-state concurrent systems, where the desired property of the systems is to ensure a formally defined notion of fairness. acknowledged_ssus: - _id: SSU alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Viktor full_name: Toman, Viktor id: 3AF3DA7C-F248-11E8-B48F-1D18A9856A87 last_name: Toman orcid: 0000-0001-9036-063X citation: ama: Toman V. Improved verification techniques for concurrent systems. 2021. doi:10.15479/at:ista:10199 apa: Toman, V. (2021). Improved verification techniques for concurrent systems. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10199 chicago: Toman, Viktor. “Improved Verification Techniques for Concurrent Systems.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10199. ieee: V. Toman, “Improved verification techniques for concurrent systems,” Institute of Science and Technology Austria, 2021. ista: Toman V. 2021. Improved verification techniques for concurrent systems. Institute of Science and Technology Austria. mla: Toman, Viktor. Improved Verification Techniques for Concurrent Systems. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10199. short: V. Toman, Improved Verification Techniques for Concurrent Systems, Institute of Science and Technology Austria, 2021. date_created: 2021-10-29T20:09:01Z date_published: 2021-10-31T00:00:00Z date_updated: 2023-09-19T09:59:54Z day: '31' ddc: - '000' degree_awarded: PhD department: - _id: GradSch - _id: KrCh doi: 10.15479/at:ista:10199 ec_funded: 1 file: - access_level: open_access checksum: 4f412a1ee60952221b499a4b1268df35 content_type: application/pdf creator: vtoman date_created: 2021-11-08T14:12:22Z date_updated: 2021-11-08T14:12:22Z file_id: '10225' file_name: toman_th_final.pdf file_size: 2915234 relation: main_file - access_level: closed checksum: 9584943f99127be2dd2963f6784c37d4 content_type: application/zip creator: vtoman date_created: 2021-11-08T14:12:46Z date_updated: 2021-11-09T09:00:50Z file_id: '10226' file_name: toman_thesis.zip file_size: 8616056 relation: source_file file_date_updated: 2021-11-09T09:00:50Z has_accepted_license: '1' keyword: - concurrency - verification - model checking language: - iso: eng month: '10' oa: 1 oa_version: Published Version page: '166' project: - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program - _id: 25F2ACDE-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11402-N23 name: Rigorous Systems Engineering - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '10190' relation: part_of_dissertation status: public - id: '10191' relation: part_of_dissertation status: public - id: '9987' relation: part_of_dissertation status: public - id: '141' relation: part_of_dissertation status: public status: public supervisor: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X title: Improved verification techniques for concurrent systems type: dissertation user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2021' ... --- _id: '10035' abstract: - lang: eng text: 'Many security definitions come in two flavors: a stronger “adaptive” flavor, where the adversary can arbitrarily make various choices during the course of the attack, and a weaker “selective” flavor where the adversary must commit to some or all of their choices a-priori. For example, in the context of identity-based encryption, selective security requires the adversary to decide on the identity of the attacked party at the very beginning of the game whereas adaptive security allows the attacker to first see the master public key and some secret keys before making this choice. Often, it appears to be much easier to achieve selective security than it is to achieve adaptive security. A series of several recent works shows how to cleverly achieve adaptive security in several such scenarios including generalized selective decryption [Pan07][FJP15], constrained PRFs [FKPR14], and Yao’s garbled circuits [JW16]. Although the above works expressed vague intuition that they share a common technique, the connection was never made precise. In this work we present a new framework (published at Crypto ’17 [JKK+17a]) that connects all of these works and allows us to present them in a unified and simplified fashion. Having the framework in place, we show how to achieve adaptive security for proxy re-encryption schemes (published at PKC ’19 [FKKP19]) and provide the first adaptive security proofs for continuous group key agreement protocols (published at S&P ’21 [KPW+21]). Questioning optimality of our framework, we then show that currently used proof techniques cannot lead to significantly better security guarantees for "graph-building" games (published at TCC ’21 [KKPW21a]). These games cover generalized selective decryption, as well as the security of prominent constructions for constrained PRFs, continuous group key agreement, and proxy re-encryption. Finally, we revisit the adaptive security of Yao’s garbled circuits and extend the analysis of Jafargholi and Wichs in two directions: While they prove adaptive security only for a modified construction with increased online complexity, we provide the first positive results for the original construction by Yao (published at TCC ’21 [KKP21a]). On the negative side, we prove that the results of Jafargholi and Wichs are essentially optimal by showing that no black-box reduction can provide a significantly better security bound (published at Crypto ’21 [KKPW21c]).' acknowledgement: "I want to acknowledge the funding by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (682815 - TOCNeT).\r\n" alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Karen full_name: Klein, Karen id: 3E83A2F8-F248-11E8-B48F-1D18A9856A87 last_name: Klein citation: ama: Klein K. On the adaptive security of graph-based games. 2021. doi:10.15479/at:ista:10035 apa: Klein, K. (2021). On the adaptive security of graph-based games. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10035 chicago: Klein, Karen. “On the Adaptive Security of Graph-Based Games.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10035. ieee: K. Klein, “On the adaptive security of graph-based games,” Institute of Science and Technology Austria, 2021. ista: Klein K. 2021. On the adaptive security of graph-based games. Institute of Science and Technology Austria. mla: Klein, Karen. On the Adaptive Security of Graph-Based Games. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10035. short: K. Klein, On the Adaptive Security of Graph-Based Games, Institute of Science and Technology Austria, 2021. date_created: 2021-09-23T07:31:44Z date_published: 2021-09-23T00:00:00Z date_updated: 2023-10-17T09:24:07Z day: '23' ddc: - '519' degree_awarded: PhD department: - _id: GradSch - _id: KrPi doi: 10.15479/at:ista:10035 ec_funded: 1 file: - access_level: open_access checksum: 73a44345c683e81f3e765efbf86fdcc5 content_type: application/pdf creator: cchlebak date_created: 2021-10-04T12:22:33Z date_updated: 2021-10-04T12:22:33Z file_id: '10082' file_name: thesis_pdfa.pdf file_size: 2104726 relation: main_file success: 1 - access_level: closed checksum: 7b80df30a0e686c3ef6a56d4e1c59e29 content_type: application/x-zip-compressed creator: cchlebak date_created: 2021-10-05T07:04:37Z date_updated: 2022-03-10T12:15:18Z file_id: '10085' file_name: thesis_final (1).zip file_size: 9538359 relation: source_file file_date_updated: 2022-03-10T12:15:18Z has_accepted_license: '1' language: - iso: eng month: '09' oa: 1 oa_version: Published Version page: '276' project: - _id: 258AA5B2-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '682815' name: Teaching Old Crypto New Tricks publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '10044' relation: part_of_dissertation status: public - id: '10049' relation: part_of_dissertation status: public - id: '637' relation: part_of_dissertation status: public - id: '10041' relation: part_of_dissertation status: public - id: '6430' relation: part_of_dissertation status: public - id: '10048' relation: part_of_dissertation status: public status: public supervisor: - first_name: Krzysztof Z full_name: Pietrzak, Krzysztof Z id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87 last_name: Pietrzak orcid: 0000-0002-9139-1654 title: On the adaptive security of graph-based games tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: dissertation user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2021' ...