--- OA_place: publisher _id: '8934' abstract: - lang: eng text: "In this thesis, we consider several of the most classical and fundamental problems in static analysis and formal verification, including invariant generation, reachability analysis, termination analysis of probabilistic programs, data-flow analysis, quantitative analysis of Markov chains and Markov decision processes, and the problem of data packing in cache management.\r\nWe use techniques from parameterized complexity theory, polyhedral geometry, and real algebraic geometry to significantly improve the state-of-the-art, in terms of both scalability and completeness guarantees, for the mentioned problems. In some cases, our results are the first theoretical improvements for the respective problems in two or three decades." acknowledgement: 'The research was partially supported by an IBM PhD fellowship, a Facebook PhD fellowship, and DOC fellowship #24956 of the Austrian Academy of Sciences (OeAW).' alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Amir Kafshdar full_name: Goharshady, Amir Kafshdar id: 391365CE-F248-11E8-B48F-1D18A9856A87 last_name: Goharshady orcid: 0000-0003-1702-6584 citation: ama: Goharshady AK. Parameterized and algebro-geometric advances in static program analysis. 2021. doi:10.15479/AT:ISTA:8934 apa: Goharshady, A. K. (2021). Parameterized and algebro-geometric advances in static program analysis. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8934 chicago: Goharshady, Amir Kafshdar. “Parameterized and Algebro-Geometric Advances in Static Program Analysis.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/AT:ISTA:8934. ieee: A. K. Goharshady, “Parameterized and algebro-geometric advances in static program analysis,” Institute of Science and Technology Austria, 2021. ista: Goharshady AK. 2021. Parameterized and algebro-geometric advances in static program analysis. Institute of Science and Technology Austria. mla: Goharshady, Amir Kafshdar. Parameterized and Algebro-Geometric Advances in Static Program Analysis. Institute of Science and Technology Austria, 2021, doi:10.15479/AT:ISTA:8934. short: A.K. Goharshady, Parameterized and Algebro-Geometric Advances in Static Program Analysis, Institute of Science and Technology Austria, 2021. corr_author: '1' date_created: 2020-12-10T12:17:07Z date_published: 2021-01-01T00:00:00Z date_updated: 2026-04-16T10:07:18Z day: '01' ddc: - '005' degree_awarded: PhD department: - _id: KrCh - _id: GradSch doi: 10.15479/AT:ISTA:8934 file: - access_level: open_access checksum: d1b9db3725aed34dadd81274aeb9426c content_type: application/pdf creator: akafshda date_created: 2020-12-22T20:08:44Z date_updated: 2021-12-23T23:30:04Z embargo: 2021-12-22 file_id: '8969' file_name: Thesis-pdfa.pdf file_size: 5251507 relation: main_file - access_level: closed checksum: 1661df7b393e6866d2460eba3c905130 content_type: application/zip creator: akafshda date_created: 2020-12-22T20:08:50Z date_updated: 2021-03-04T23:30:04Z embargo_to: open_access file_id: '8970' file_name: source.zip file_size: 10636756 relation: source_file file_date_updated: 2021-12-23T23:30:04Z fulldoi: https://doi.org/10.15479/AT:ISTA:8934 has_accepted_license: '1' language: - iso: eng license: https://creativecommons.org/publicdomain/zero/1.0/ month: '01' oa: 1 oa_version: Published Version page: '278' project: - _id: 267066CE-B435-11E9-9278-68D0E5697425 name: Quantitative Analysis of Probabilistic Systems with a focus on Crypto-Currencies - _id: 266EEEC0-B435-11E9-9278-68D0E5697425 name: Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '6490' relation: part_of_dissertation status: public - id: '6780' relation: part_of_dissertation status: public - id: '7158' relation: part_of_dissertation status: public - id: '66' relation: part_of_dissertation status: public - id: '6378' relation: part_of_dissertation status: public - id: '311' relation: part_of_dissertation status: public - id: '6175' relation: part_of_dissertation status: public - id: '6340' relation: part_of_dissertation status: public - id: '7014' relation: part_of_dissertation status: public - id: '6009' relation: part_of_dissertation status: public - id: '1437' relation: part_of_dissertation status: public - id: '8728' relation: part_of_dissertation status: public - id: '8089' relation: part_of_dissertation status: public - id: '6380' relation: part_of_dissertation status: public - id: '5977' relation: part_of_dissertation status: public - id: '6056' relation: part_of_dissertation status: public - id: '639' relation: part_of_dissertation status: public - id: '1386' relation: part_of_dissertation status: public - id: '6918' relation: part_of_dissertation status: public - id: '7810' relation: part_of_dissertation status: public - id: '949' 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: Parameterized and algebro-geometric advances in static program analysis tmp: image: /images/cc_0.png legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode name: Creative Commons Public Domain Dedication (CC0 1.0) short: CC0 (1.0) type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2021' ... --- OA_place: publisher _id: '9962' abstract: - lang: eng text: The brain is one of the largest and most complex organs and it is composed of billions of neurons that communicate together enabling e.g. consciousness. The cerebral cortex is the largest site of neural integration in the central nervous system. Concerted radial migration of newly born cortical projection neurons, from their birthplace to their final position, is a key step in the assembly of the cerebral cortex. The cellular and molecular mechanisms regulating radial neuronal migration in vivo are however still unclear. Recent evidence suggests that distinct signaling cues act cell-autonomously but differentially at certain steps during the overall migration process. Moreover, functional analysis of genetic mosaics (mutant neurons present in wild-type/heterozygote environment) using the MADM (Mosaic Analysis with Double Markers) analyses in comparison to global knockout also indicate a significant degree of non-cell-autonomous and/or community effects in the control of cortical neuron migration. The interactions of cell-intrinsic (cell-autonomous) and cell-extrinsic (non-cell-autonomous) components are largely unknown. In part of this thesis work we established a MADM-based experimental strategy for the quantitative analysis of cell-autonomous gene function versus non-cell-autonomous and/or community effects. The direct comparison of mutant neurons from the genetic mosaic (cell-autonomous) to mutant neurons in the conditional and/or global knockout (cell-autonomous + non-cell-autonomous) allows to quantitatively analyze non-cell-autonomous effects. Such analysis enable the high-resolution analysis of projection neuron migration dynamics in distinct environments with concomitant isolation of genomic and proteomic profiles. Using these experimental paradigms and in combination with computational modeling we show and characterize the nature of non-cell-autonomous effects to coordinate radial neuron migration. Furthermore, this thesis discusses recent developments in neurodevelopment with focus on neuronal polarization and non-cell-autonomous mechanisms in neuronal migration. alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Andi H full_name: Hansen, Andi H id: 38853E16-F248-11E8-B48F-1D18A9856A87 last_name: Hansen citation: ama: Hansen AH. Cell-autonomous gene function and non-cell-autonomous effects in radial projection neuron migration. 2021. doi:10.15479/at:ista:9962 apa: Hansen, A. H. (2021). Cell-autonomous gene function and non-cell-autonomous effects in radial projection neuron migration. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:9962 chicago: Hansen, Andi H. “Cell-Autonomous Gene Function and Non-Cell-Autonomous Effects in Radial Projection Neuron Migration.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:9962. ieee: A. H. Hansen, “Cell-autonomous gene function and non-cell-autonomous effects in radial projection neuron migration,” Institute of Science and Technology Austria, 2021. ista: Hansen AH. 2021. Cell-autonomous gene function and non-cell-autonomous effects in radial projection neuron migration. Institute of Science and Technology Austria. mla: Hansen, Andi H. Cell-Autonomous Gene Function and Non-Cell-Autonomous Effects in Radial Projection Neuron Migration. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:9962. short: A.H. Hansen, Cell-Autonomous Gene Function and Non-Cell-Autonomous Effects in Radial Projection Neuron Migration, Institute of Science and Technology Austria, 2021. corr_author: '1' date_created: 2021-08-29T12:36:50Z date_published: 2021-09-02T00:00:00Z date_updated: 2026-04-08T07:19:09Z day: '02' ddc: - '570' degree_awarded: PhD department: - _id: GradSch - _id: SiHi doi: 10.15479/at:ista:9962 file: - access_level: closed checksum: 66b56f5b988b233dc66a4f4b4fb2cdfe content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document creator: ahansen date_created: 2021-08-30T09:17:39Z date_updated: 2022-09-03T22:30:04Z embargo_to: open_access file_id: '9971' file_name: Thesis_Hansen.docx file_size: 10629190 relation: source_file - access_level: open_access checksum: 204fa40321a1c6289b68c473634c4bf3 content_type: application/pdf creator: ahansen date_created: 2021-08-30T09:29:44Z date_updated: 2022-09-03T22:30:04Z embargo: 2022-09-02 file_id: '9972' file_name: Thesis_Hansen_PDFA-1a.pdf file_size: 13457469 relation: main_file file_date_updated: 2022-09-03T22:30:04Z fulldoi: https://doi.org/10.15479/at:ista:9962 has_accepted_license: '1' keyword: - Neuronal migration - Non-cell-autonomous - Cell-autonomous - Neurodevelopmental disease language: - iso: eng month: '09' oa: 1 oa_version: Published Version page: '182' project: - _id: 2625A13E-B435-11E9-9278-68D0E5697425 grant_number: '24812' name: Molecular mechanisms of radial neuronal migration publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '8569' relation: part_of_dissertation status: public - id: '960' relation: part_of_dissertation status: public status: public supervisor: - first_name: Simon full_name: Hippenmeyer, Simon id: 37B36620-F248-11E8-B48F-1D18A9856A87 last_name: Hippenmeyer orcid: 0000-0003-2279-1061 title: Cell-autonomous gene function and non-cell-autonomous effects in radial projection neuron migration tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2021' ... --- OA_place: publisher _id: '9562' abstract: - lang: eng text: Left-right asymmetries can be considered a fundamental organizational principle of the vertebrate central nervous system. The hippocampal CA3-CA1 pyramidal cell synaptic connection shows an input-side dependent asymmetry where the hemispheric location of the presynaptic CA3 neuron determines the synaptic properties. Left-input synapses terminating on apical dendrites in stratum radiatum have a higher density of NMDA receptor subunit GluN2B, a lower density of AMPA receptor subunit GluA1 and smaller areas with less often perforated PSDs. On the other hand, left-input synapses terminating on basal dendrites in stratum oriens have lower GluN2B densities than right-input ones. Apical and basal synapses further employ different signaling pathways involved in LTP. SDS-digested freeze-fracture replica labeling can visualize synaptic membrane proteins with high sensitivity and resolution, and has been used to reveal the asymmetry at the electron microscopic level. However, it requires time-consuming manual demarcation of the synaptic surface for quantitative measurements. To facilitate the analysis of replica labeling, I first developed a software named Darea, which utilizes deep-learning to automatize this demarcation. With Darea I characterized the synaptic distribution of NMDA and AMPA receptors as well as the voltage-gated Ca2+ channels in CA1 stratum radiatum and oriens. Second, I explored the role of GluN2B and its carboxy-terminus in the establishment of input-side dependent hippocampal asymmetry. In conditional knock-out mice lacking GluN2B expression in CA1 and GluN2B-2A swap mice, where GluN2B carboxy-terminus was exchanged to that of GluN2A, no significant asymmetries of GluN2B, GluA1 and PSD area were detected. We further discovered a previously unknown functional asymmetry of GluN2A, which was also lost in the swap mouse. These results demonstrate that GluN2B carboxy-terminus plays a critical role in normal formation of input-side dependent asymmetry. acknowledged_ssus: - _id: EM-Fac alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: David full_name: Kleindienst, David id: 42E121A4-F248-11E8-B48F-1D18A9856A87 last_name: Kleindienst citation: ama: 'Kleindienst D. 2B or not 2B: Hippocampal asymmetries mediated by NMDA receptor subunit GluN2B C-terminus and high-throughput image analysis by Deep-Learning. 2021. doi:10.15479/at:ista:9562' apa: 'Kleindienst, D. (2021). 2B or not 2B: Hippocampal asymmetries mediated by NMDA receptor subunit GluN2B C-terminus and high-throughput image analysis by Deep-Learning. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:9562' chicago: 'Kleindienst, David. “2B or Not 2B: Hippocampal Asymmetries Mediated by NMDA Receptor Subunit GluN2B C-Terminus and High-Throughput Image Analysis by Deep-Learning.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:9562.' ieee: 'D. Kleindienst, “2B or not 2B: Hippocampal asymmetries mediated by NMDA receptor subunit GluN2B C-terminus and high-throughput image analysis by Deep-Learning,” Institute of Science and Technology Austria, 2021.' ista: 'Kleindienst D. 2021. 2B or not 2B: Hippocampal asymmetries mediated by NMDA receptor subunit GluN2B C-terminus and high-throughput image analysis by Deep-Learning. Institute of Science and Technology Austria.' mla: 'Kleindienst, David. 2B or Not 2B: Hippocampal Asymmetries Mediated by NMDA Receptor Subunit GluN2B C-Terminus and High-Throughput Image Analysis by Deep-Learning. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:9562.' short: 'D. Kleindienst, 2B or Not 2B: Hippocampal Asymmetries Mediated by NMDA Receptor Subunit GluN2B C-Terminus and High-Throughput Image Analysis by Deep-Learning, Institute of Science and Technology Austria, 2021.' corr_author: '1' date_created: 2021-06-17T14:10:47Z date_published: 2021-06-01T00:00:00Z date_updated: 2026-07-06T13:11:44Z day: '01' ddc: - '570' degree_awarded: PhD department: - _id: GradSch - _id: RySh doi: 10.15479/at:ista:9562 file: - access_level: open_access checksum: 659df5518db495f679cb1df9e9bd1d94 content_type: application/pdf creator: dkleindienst date_created: 2021-06-17T14:03:14Z date_updated: 2022-07-02T22:30:04Z embargo: 2022-07-01 file_id: '9563' file_name: Thesis.pdf file_size: 77299142 relation: main_file - access_level: closed checksum: 3bcf63a2b19e5b6663be051bea332748 content_type: application/zip creator: dkleindienst date_created: 2021-06-17T14:04:30Z date_updated: 2022-07-02T22:30:04Z embargo_to: open_access file_id: '9564' file_name: Thesis_source.zip file_size: 369804895 relation: source_file file_date_updated: 2022-07-02T22:30:04Z fulldoi: https://doi.org/10.15479/at:ista:9562 has_accepted_license: '1' language: - iso: eng month: '06' oa: 1 oa_version: Published Version page: '124' publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '9437' relation: part_of_dissertation status: public - id: '612' relation: part_of_dissertation status: public - id: '8532' relation: part_of_dissertation status: public - id: '9756' relation: part_of_dissertation status: public status: public supervisor: - first_name: Ryuichi full_name: Shigemoto, Ryuichi id: 499F3ABC-F248-11E8-B48F-1D18A9856A87 last_name: Shigemoto orcid: 0000-0001-8761-9444 title: '2B or not 2B: Hippocampal asymmetries mediated by NMDA receptor subunit GluN2B C-terminus and high-throughput image analysis by Deep-Learning' type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2021' ... --- _id: '9760' abstract: - lang: eng text: "The quantum approximate optimization algorithm (QAOA) is a prospective near-term quantum algorithm due to its modest circuit depth and promising benchmarks. However, an external parameter optimization required in the QAOA could become a performance bottleneck. This motivates studies of the optimization landscape and search for heuristic ways of parameter initialization. In this work we visualize the optimization landscape of the QAOA applied to the MaxCut problem on random graphs, demonstrating that random initialization of the QAOA is prone to converging to local minima with suboptimal performance. We introduce the initialization of QAOA parameters based on the Trotterized quantum annealing (TQA) protocol, parameterized by the Trotter time step. We find that the TQA initialization allows to circumvent\r\nthe issue of false minima for a broad range of time steps, yielding the same performance as the best result out of an exponentially scaling number of random initializations. Moreover, we demonstrate that the optimal value of the time step coincides with the point of proliferation of Trotter errors in quantum annealing. Our results suggest practical ways of initializing QAOA protocols on near-term quantum devices and reveal new connections between QAOA and quantum annealing." acknowledgement: We would like to thank D. Abanin and R. Medina for fruitful discussions and A. Smith and I. Kim for valuable feedback on the manuscript. We acknowledge support by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (Grant Agreement No. 850899). article_number: '491' article_processing_charge: Yes article_type: original arxiv: 1 author: - first_name: Stefan full_name: Sack, Stefan id: dd622248-f6e0-11ea-865d-ce382a1c81a5 last_name: Sack orcid: 0000-0001-5400-8508 - first_name: Maksym full_name: Serbyn, Maksym id: 47809E7E-F248-11E8-B48F-1D18A9856A87 last_name: Serbyn orcid: 0000-0002-2399-5827 citation: ama: Sack S, Serbyn M. Quantum annealing initialization of the quantum approximate optimization algorithm. Quantum. 2021;5. doi:10.22331/Q-2021-07-01-491 apa: Sack, S., & Serbyn, M. (2021). Quantum annealing initialization of the quantum approximate optimization algorithm. Quantum. Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften. https://doi.org/10.22331/Q-2021-07-01-491 chicago: Sack, Stefan, and Maksym Serbyn. “Quantum Annealing Initialization of the Quantum Approximate Optimization Algorithm.” Quantum. Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften, 2021. https://doi.org/10.22331/Q-2021-07-01-491. ieee: S. Sack and M. Serbyn, “Quantum annealing initialization of the quantum approximate optimization algorithm,” Quantum, vol. 5. Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften, 2021. ista: Sack S, Serbyn M. 2021. Quantum annealing initialization of the quantum approximate optimization algorithm. Quantum. 5, 491. mla: Sack, Stefan, and Maksym Serbyn. “Quantum Annealing Initialization of the Quantum Approximate Optimization Algorithm.” Quantum, vol. 5, 491, Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften, 2021, doi:10.22331/Q-2021-07-01-491. short: S. Sack, M. Serbyn, Quantum 5 (2021). corr_author: '1' date_created: 2021-08-01T22:01:21Z date_published: 2021-07-01T00:00:00Z date_updated: 2026-10-13T22:31:13Z day: '01' ddc: - '530' department: - _id: GradSch - _id: MaSe doi: 10.22331/Q-2021-07-01-491 ec_funded: 1 external_id: arxiv: - '2101.05742' isi: - '000669830600001' file: - access_level: open_access checksum: 9706c2bb8e748e9b5b138381995a7f6f content_type: application/pdf creator: cchlebak date_created: 2021-08-06T06:44:31Z date_updated: 2021-08-06T06:44:31Z file_id: '9774' file_name: 2021_Quantum_Sack.pdf file_size: 2312482 relation: main_file file_date_updated: 2021-08-06T06:44:31Z fulldoi: https://doi.org/10.22331/Q-2021-07-01-491 has_accepted_license: '1' intvolume: ' 5' isi: 1 language: - iso: eng month: '07' oa: 1 oa_version: Published Version project: - _id: 23841C26-32DE-11EA-91FC-C7463DDC885E call_identifier: H2020 grant_number: '850899' name: 'Non-Ergodic Quantum Matter: Universality, Dynamics and Control' publication: Quantum publication_identifier: eissn: - 2521-327X publication_status: published publisher: Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften quality_controlled: '1' related_material: record: - id: '14622' relation: dissertation_contains status: public scopus_import: '1' status: public title: Quantum annealing initialization of the quantum approximate optimization algorithm 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: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 5 year: '2021' ... --- _id: '10672' abstract: - lang: eng text: The family of feedback alignment (FA) algorithms aims to provide a more biologically motivated alternative to backpropagation (BP), by substituting the computations that are unrealistic to be implemented in physical brains. While FA algorithms have been shown to work well in practice, there is a lack of rigorous theory proofing their learning capabilities. Here we introduce the first feedback alignment algorithm with provable learning guarantees. In contrast to existing work, we do not require any assumption about the size or depth of the network except that it has a single output neuron, i.e., such as for binary classification tasks. We show that our FA algorithm can deliver its theoretical promises in practice, surpassing the learning performance of existing FA methods and matching backpropagation in binary classification tasks. Finally, we demonstrate the limits of our FA variant when the number of output neurons grows beyond a certain quantity. acknowledgement: "This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23\r\n(Wittgenstein Award).\r\n" article_processing_charge: No author: - first_name: Mathias full_name: Lechner, Mathias id: 3DC22916-F248-11E8-B48F-1D18A9856A87 last_name: Lechner citation: ama: 'Lechner M. Learning representations for binary-classification without backpropagation. In: 8th International Conference on Learning Representations. ICLR; 2020.' apa: 'Lechner, M. (2020). Learning representations for binary-classification without backpropagation. In 8th International Conference on Learning Representations. Virtual ; Addis Ababa, Ethiopia: ICLR.' chicago: Lechner, Mathias. “Learning Representations for Binary-Classification without Backpropagation.” In 8th International Conference on Learning Representations. ICLR, 2020. ieee: M. Lechner, “Learning representations for binary-classification without backpropagation,” in 8th International Conference on Learning Representations, Virtual ; Addis Ababa, Ethiopia, 2020. ista: 'Lechner M. 2020. Learning representations for binary-classification without backpropagation. 8th International Conference on Learning Representations. ICLR: International Conference on Learning Representations.' mla: Lechner, Mathias. “Learning Representations for Binary-Classification without Backpropagation.” 8th International Conference on Learning Representations, ICLR, 2020. short: M. Lechner, in:, 8th International Conference on Learning Representations, ICLR, 2020. conference: end_date: 2020-05-01 location: Virtual ; Addis Ababa, Ethiopia name: 'ICLR: International Conference on Learning Representations' start_date: 2020-04-26 corr_author: '1' date_created: 2022-01-25T15:50:00Z date_published: 2020-03-11T00:00:00Z date_updated: 2025-04-15T06:25:56Z day: '11' ddc: - '000' department: - _id: GradSch - _id: ToHe file: - access_level: open_access checksum: ea13d42dd4541ddb239b6a75821fd6c9 content_type: application/pdf creator: mlechner date_created: 2022-01-26T07:35:17Z date_updated: 2022-01-26T07:35:17Z file_id: '10677' file_name: iclr_2020.pdf file_size: 249431 relation: main_file success: 1 file_date_updated: 2022-01-26T07:35:17Z has_accepted_license: '1' language: - iso: eng license: https://creativecommons.org/licenses/by-nc-nd/3.0/ main_file_link: - open_access: '1' url: https://openreview.net/forum?id=Bke61krFvS month: '03' oa: 1 oa_version: Published Version project: - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: Formal methods for the design and analysis of complex systems publication: 8th International Conference on Learning Representations publication_status: published publisher: ICLR quality_controlled: '1' scopus_import: '1' status: public title: Learning representations for binary-classification without backpropagation tmp: image: /images/cc_by_nc_nd.png legal_code_url: https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode name: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0) short: CC BY-NC-ND (3.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '10673' abstract: - lang: eng text: We propose a neural information processing system obtained by re-purposing the function of a biological neural circuit model to govern simulated and real-world control tasks. Inspired by the structure of the nervous system of the soil-worm, C. elegans, we introduce ordinary neural circuits (ONCs), defined as the model of biological neural circuits reparameterized for the control of alternative tasks. We first demonstrate that ONCs realize networks with higher maximum flow compared to arbitrary wired networks. We then learn instances of ONCs to control a series of robotic tasks, including the autonomous parking of a real-world rover robot. For reconfiguration of the purpose of the neural circuit, we adopt a search-based optimization algorithm. Ordinary neural circuits perform on par and, in some cases, significantly surpass the performance of contemporary deep learning models. ONC networks are compact, 77% sparser than their counterpart neural controllers, and their neural dynamics are fully interpretable at the cell-level. acknowledgement: "RH and RG are partially supported by Horizon-2020 ECSEL Project grant No. 783163 (iDev40), Productive 4.0, and ATBMBFW CPS-IoT Ecosystem. ML was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23\r\n(Wittgenstein Award). AA is supported by the National Science Foundation (NSF) Graduate Research Fellowship\r\nProgram. RH and DR are partially supported by The Boeing Company and JP Morgan Chase. This research work is\r\npartially drawn from the PhD dissertation of RH.\r\n" alternative_title: - PMLR article_processing_charge: No author: - first_name: Ramin full_name: Hasani, Ramin last_name: Hasani - first_name: Mathias full_name: Lechner, Mathias id: 3DC22916-F248-11E8-B48F-1D18A9856A87 last_name: Lechner - first_name: Alexander full_name: Amini, Alexander last_name: Amini - first_name: Daniela full_name: Rus, Daniela last_name: Rus - first_name: Radu full_name: Grosu, Radu last_name: Grosu citation: ama: 'Hasani R, Lechner M, Amini A, Rus D, Grosu R. A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits. In: Proceedings of the 37th International Conference on Machine Learning. PMLR. ; 2020:4082-4093.' apa: 'Hasani, R., Lechner, M., Amini, A., Rus, D., & Grosu, R. (2020). A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits. In Proceedings of the 37th International Conference on Machine Learning (pp. 4082–4093). Virtual.' chicago: 'Hasani, Ramin, Mathias Lechner, Alexander Amini, Daniela Rus, and Radu Grosu. “A Natural Lottery Ticket Winner: Reinforcement Learning with Ordinary Neural Circuits.” In Proceedings of the 37th International Conference on Machine Learning, 4082–93. PMLR, 2020.' ieee: 'R. Hasani, M. Lechner, A. Amini, D. Rus, and R. Grosu, “A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits,” in Proceedings of the 37th International Conference on Machine Learning, Virtual, 2020, pp. 4082–4093.' ista: 'Hasani R, Lechner M, Amini A, Rus D, Grosu R. 2020. A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits. Proceedings of the 37th International Conference on Machine Learning. ML: Machine LearningPMLR, PMLR, , 4082–4093.' mla: 'Hasani, Ramin, et al. “A Natural Lottery Ticket Winner: Reinforcement Learning with Ordinary Neural Circuits.” Proceedings of the 37th International Conference on Machine Learning, 2020, pp. 4082–93.' short: R. Hasani, M. Lechner, A. Amini, D. Rus, R. Grosu, in:, Proceedings of the 37th International Conference on Machine Learning, 2020, pp. 4082–4093. conference: end_date: 2020-07-18 location: Virtual name: 'ML: Machine Learning' start_date: 2020-07-12 date_created: 2022-01-25T15:50:34Z date_published: 2020-01-01T00:00:00Z date_updated: 2025-04-15T06:25:56Z ddc: - '000' department: - _id: GradSch - _id: ToHe file: - access_level: open_access checksum: c9a4a29161777fc1a89ef451c040e3b1 content_type: application/pdf creator: cchlebak date_created: 2022-01-26T11:08:51Z date_updated: 2022-01-26T11:08:51Z file_id: '10691' file_name: 2020_PMLR_Hasani.pdf file_size: 2329798 relation: main_file success: 1 file_date_updated: 2022-01-26T11:08:51Z has_accepted_license: '1' language: - iso: eng main_file_link: - open_access: '1' url: http://proceedings.mlr.press/v119/hasani20a.html oa: 1 oa_version: Published Version page: 4082-4093 project: - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: Formal methods for the design and analysis of complex systems publication: Proceedings of the 37th International Conference on Machine Learning publication_identifier: issn: - 2640-3498 publication_status: published quality_controlled: '1' scopus_import: '1' series_title: PMLR status: public title: 'A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits' tmp: image: /images/cc_by_nc_nd.png legal_code_url: https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode name: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0) short: CC BY-NC-ND (3.0) type: conference user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2020' ... --- _id: '9196' abstract: - lang: eng text: In order to provide a local description of a regular function in a small neighbourhood of a point x, it is sufficient by Taylor’s theorem to know the value of the function as well as all of its derivatives up to the required order at the point x itself. In other words, one could say that a regular function is locally modelled by the set of polynomials. The theory of regularity structures due to Hairer generalizes this observation and provides an abstract setup, which in the application to singular SPDE extends the set of polynomials by functionals constructed from, e.g., white noise. In this context, the notion of Taylor polynomials is lifted to the notion of so-called modelled distributions. The celebrated reconstruction theorem, which in turn was inspired by Gubinelli’s \textit {sewing lemma}, is of paramount importance for the theory. It enables one to reconstruct a modelled distribution as a true distribution on Rd which is locally approximated by this extended set of models or “monomials”. In the original work of Hairer, the error is measured by means of Hölder norms. This was then generalized to the whole scale of Besov spaces by Hairer and Labbé. It is the aim of this work to adapt the analytic part of the theory of regularity structures to the scale of Triebel–Lizorkin spaces. article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Sebastian full_name: Hensel, Sebastian id: 4D23B7DA-F248-11E8-B48F-1D18A9856A87 last_name: Hensel orcid: 0000-0001-7252-8072 - first_name: Tommaso full_name: Rosati, Tommaso last_name: Rosati citation: ama: Hensel S, Rosati T. Modelled distributions of Triebel–Lizorkin type. Studia Mathematica. 2020;252(3):251-297. doi:10.4064/sm180411-11-2 apa: Hensel, S., & Rosati, T. (2020). Modelled distributions of Triebel–Lizorkin type. Studia Mathematica. Instytut Matematyczny. https://doi.org/10.4064/sm180411-11-2 chicago: Hensel, Sebastian, and Tommaso Rosati. “Modelled Distributions of Triebel–Lizorkin Type.” Studia Mathematica. Instytut Matematyczny, 2020. https://doi.org/10.4064/sm180411-11-2. ieee: S. Hensel and T. Rosati, “Modelled distributions of Triebel–Lizorkin type,” Studia Mathematica, vol. 252, no. 3. Instytut Matematyczny, pp. 251–297, 2020. ista: Hensel S, Rosati T. 2020. Modelled distributions of Triebel–Lizorkin type. Studia Mathematica. 252(3), 251–297. mla: Hensel, Sebastian, and Tommaso Rosati. “Modelled Distributions of Triebel–Lizorkin Type.” Studia Mathematica, vol. 252, no. 3, Instytut Matematyczny, 2020, pp. 251–97, doi:10.4064/sm180411-11-2. short: S. Hensel, T. Rosati, Studia Mathematica 252 (2020) 251–297. date_created: 2021-02-25T08:55:03Z date_published: 2020-03-01T00:00:00Z date_updated: 2025-06-24T12:07:06Z day: '01' department: - _id: JuFi - _id: GradSch doi: 10.4064/sm180411-11-2 external_id: arxiv: - '1709.05202' isi: - '000558100500002' fulldoi: https://doi.org/10.4064/sm180411-11-2 intvolume: ' 252' isi: 1 issue: '3' keyword: - General Mathematics language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.1709.05202 month: '03' oa: 1 oa_version: Preprint page: 251-297 publication: Studia Mathematica publication_identifier: eissn: - 1730-6337 issn: - 0039-3223 publication_status: published publisher: Instytut Matematyczny quality_controlled: '1' scopus_import: '1' status: public title: Modelled distributions of Triebel–Lizorkin type type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 252 year: '2020' ... --- OA_place: publisher _id: '7196' abstract: - lang: eng text: 'In this thesis we study certain mathematical aspects of evolution. The two primary forces that drive an evolutionary process are mutation and selection. Mutation generates new variants in a population. Selection chooses among the variants depending on the reproductive rates of individuals. Evolutionary processes are intrinsically random – a new mutation that is initially present in the population at low frequency can go extinct, even if it confers a reproductive advantage. The overall rate of evolution is largely determined by two quantities: the probability that an invading advantageous mutation spreads through the population (called fixation probability) and the time until it does so (called fixation time). Both those quantities crucially depend not only on the strength of the invading mutation but also on the population structure. In this thesis, we aim to understand how the underlying population structure affects the overall rate of evolution. Specifically, we study population structures that increase the fixation probability of advantageous mutants (called amplifiers of selection). Broadly speaking, our results are of three different types: We present various strong amplifiers, we identify regimes under which only limited amplification is feasible, and we propose population structures that provide different tradeoffs between high fixation probability and short fixation time.' alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Josef full_name: Tkadlec, Josef id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87 last_name: Tkadlec orcid: 0000-0002-1097-9684 citation: ama: Tkadlec J. A role of graphs in evolutionary processes. 2020. doi:10.15479/AT:ISTA:7196 apa: Tkadlec, J. (2020). A role of graphs in evolutionary processes. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:7196 chicago: Tkadlec, Josef. “A Role of Graphs in Evolutionary Processes.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:7196. ieee: J. Tkadlec, “A role of graphs in evolutionary processes,” Institute of Science and Technology Austria, 2020. ista: Tkadlec J. 2020. A role of graphs in evolutionary processes. Institute of Science and Technology Austria. mla: Tkadlec, Josef. A Role of Graphs in Evolutionary Processes. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:7196. short: J. Tkadlec, A Role of Graphs in Evolutionary Processes, Institute of Science and Technology Austria, 2020. corr_author: '1' date_created: 2019-12-20T12:26:36Z date_published: 2020-01-12T00:00:00Z date_updated: 2026-04-16T08:32:37Z day: '12' ddc: - '519' degree_awarded: PhD department: - _id: KrCh - _id: GradSch doi: 10.15479/AT:ISTA:7196 file: - access_level: closed checksum: 451f8e64b0eb26bf297644ac72bfcbe9 content_type: application/zip creator: jtkadlec date_created: 2020-01-12T11:49:49Z date_updated: 2020-07-14T12:47:52Z file_id: '7255' file_name: thesis.zip file_size: 21100497 relation: source_file - access_level: open_access checksum: d8c44cbc4f939c49a8efc9d4b8bb3985 content_type: application/pdf creator: dernst date_created: 2020-01-28T07:32:42Z date_updated: 2020-07-14T12:47:52Z file_id: '7367' file_name: 2020_Tkadlec_Thesis.pdf file_size: 11670983 relation: main_file file_date_updated: 2020-07-14T12:47:52Z fulldoi: https://doi.org/10.15479/AT:ISTA:7196 has_accepted_license: '1' language: - iso: eng month: '01' oa: 1 oa_version: Published Version page: '144' publication_identifier: eissn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '5751' relation: dissertation_contains status: public - id: '7210' relation: dissertation_contains status: public - id: '7212' relation: dissertation_contains 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: A role of graphs in evolutionary processes type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2020' ... --- OA_place: publisher _id: '7460' abstract: - lang: eng text: "Many methods for the reconstruction of shapes from sets of points produce ordered simplicial complexes, which are collections of vertices, edges, triangles, and their higher-dimensional analogues, called simplices, in which every simplex gets assigned a real value measuring its size. This thesis studies ordered simplicial complexes, with a focus on their topology, which reflects the connectedness of the represented shapes and the presence of holes. We are interested both in understanding better the structure of these complexes, as well as in developing algorithms for applications.\r\n\r\nFor the Delaunay triangulation, the most popular measure for a simplex is the radius of the smallest empty circumsphere. Based on it, we revisit Alpha and Wrap complexes and experimentally determine their probabilistic properties for random data. Also, we prove the existence of tri-partitions, propose algorithms to open and close holes, and extend the concepts from Euclidean to Bregman geometries." alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Katharina full_name: Ölsböck, Katharina id: 4D4AA390-F248-11E8-B48F-1D18A9856A87 last_name: Ölsböck orcid: 0000-0002-4672-8297 citation: ama: Ölsböck K. The hole system of triangulated shapes. 2020. doi:10.15479/AT:ISTA:7460 apa: Ölsböck, K. (2020). The hole system of triangulated shapes. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:7460 chicago: Ölsböck, Katharina. “The Hole System of Triangulated Shapes.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:7460. ieee: K. Ölsböck, “The hole system of triangulated shapes,” Institute of Science and Technology Austria, 2020. ista: Ölsböck K. 2020. The hole system of triangulated shapes. Institute of Science and Technology Austria. mla: Ölsböck, Katharina. The Hole System of Triangulated Shapes. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:7460. short: K. Ölsböck, The Hole System of Triangulated Shapes, Institute of Science and Technology Austria, 2020. corr_author: '1' date_created: 2020-02-06T14:56:53Z date_published: 2020-02-10T00:00:00Z date_updated: 2026-04-08T07:23:21Z day: '10' ddc: - '514' degree_awarded: PhD department: - _id: HeEd - _id: GradSch doi: 10.15479/AT:ISTA:7460 file: - access_level: open_access checksum: 1df9f8c530b443c0e63a3f2e4fde412e content_type: application/pdf creator: koelsboe date_created: 2020-02-06T14:43:54Z date_updated: 2020-07-14T12:47:58Z file_id: '7461' file_name: thesis_ist-final_noack.pdf file_size: 76195184 relation: main_file - access_level: closed checksum: 7a52383c812b0be64d3826546509e5a4 content_type: application/x-zip-compressed creator: koelsboe date_created: 2020-02-06T14:52:45Z date_updated: 2020-07-14T12:47:58Z description: latex source files, figures file_id: '7462' file_name: latex-files.zip file_size: 122103715 relation: source_file file_date_updated: 2020-07-14T12:47:58Z fulldoi: https://doi.org/10.15479/AT:ISTA:7460 has_accepted_license: '1' keyword: - shape reconstruction - hole manipulation - ordered complexes - Alpha complex - Wrap complex - computational topology - Bregman geometry language: - iso: eng license: https://creativecommons.org/licenses/by-nc-sa/4.0/ month: '02' oa: 1 oa_version: Published Version page: '155' publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '6608' 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: The hole system of triangulated shapes tmp: image: /images/cc_by_nc_sa.png legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) short: CC BY-NC-SA (4.0) type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2020' ... --- OA_place: publisher _id: '7514' abstract: - lang: eng text: "We study the interacting homogeneous Bose gas in two spatial dimensions in the thermodynamic limit at fixed density. We shall be concerned with some mathematical aspects of this complicated problem in many-body quantum mechanics. More specifically, we consider the dilute limit where the scattering length of the interaction potential, which is a measure for the effective range of the potential, is small compared to the average distance between the particles. We are interested in a setting with positive (i.e., non-zero) temperature. After giving a survey of the relevant literature in the field, we provide some facts and examples to set expectations for the two-dimensional system. The crucial difference to the three-dimensional system is that there is no Bose–Einstein condensate at positive temperature due to the Hohenberg–Mermin–Wagner theorem. However, it turns out that an asymptotic formula for the free energy holds similarly to the three-dimensional case.\r\nWe motivate this formula by considering a toy model with δ interaction potential. By restricting this model Hamiltonian to certain trial states with a quasi-condensate we obtain an upper bound for the free energy that still has the quasi-condensate fraction as a free parameter. When minimizing over the quasi-condensate fraction, we obtain the Berezinskii–Kosterlitz–Thouless critical temperature for superfluidity, which plays an important role in our rigorous contribution. The mathematically rigorous result that we prove concerns the specific free energy in the dilute limit. We give upper and lower bounds on the free energy in terms of the free energy of the non-interacting system and a correction term coming from the interaction. Both bounds match and thus we obtain the leading term of an asymptotic approximation in the dilute limit, provided the thermal wavelength of the particles is of the same order (or larger) than the average distance between the particles. The remarkable feature of this result is its generality: the correction term depends on the interaction potential only through its scattering length and it holds for all nonnegative interaction potentials with finite scattering length that are measurable. In particular, this allows to model an interaction of hard disks." alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Simon full_name: Mayer, Simon id: 30C4630A-F248-11E8-B48F-1D18A9856A87 last_name: Mayer citation: ama: Mayer S. The free energy of a dilute two-dimensional Bose gas. 2020. doi:10.15479/AT:ISTA:7514 apa: Mayer, S. (2020). The free energy of a dilute two-dimensional Bose gas. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:7514 chicago: Mayer, Simon. “The Free Energy of a Dilute Two-Dimensional Bose Gas.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:7514. ieee: S. Mayer, “The free energy of a dilute two-dimensional Bose gas,” Institute of Science and Technology Austria, 2020. ista: Mayer S. 2020. The free energy of a dilute two-dimensional Bose gas. Institute of Science and Technology Austria. mla: Mayer, Simon. The Free Energy of a Dilute Two-Dimensional Bose Gas. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:7514. short: S. Mayer, The Free Energy of a Dilute Two-Dimensional Bose Gas, Institute of Science and Technology Austria, 2020. corr_author: '1' date_created: 2020-02-24T09:17:27Z date_published: 2020-02-24T00:00:00Z date_updated: 2026-04-08T07:25:40Z day: '24' ddc: - '510' degree_awarded: PhD department: - _id: RoSe - _id: GradSch doi: 10.15479/AT:ISTA:7514 ec_funded: 1 file: - access_level: open_access checksum: b4de7579ddc1dbdd44ff3f17c48395f6 content_type: application/pdf creator: dernst date_created: 2020-02-24T09:15:06Z date_updated: 2020-07-14T12:47:59Z file_id: '7515' file_name: thesis.pdf file_size: 1563429 relation: main_file - access_level: closed checksum: ad7425867b52d7d9e72296e87bc9cb67 content_type: application/x-zip-compressed creator: dernst date_created: 2020-02-24T09:15:16Z date_updated: 2020-07-14T12:47:59Z file_id: '7516' file_name: thesis_source.zip file_size: 2028038 relation: source_file file_date_updated: 2020-07-14T12:47:59Z fulldoi: https://doi.org/10.15479/AT:ISTA:7514 has_accepted_license: '1' language: - iso: eng month: '02' oa: 1 oa_version: Published Version page: '148' project: - _id: 25C6DC12-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '694227' name: Analysis of quantum many-body systems publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '7524' relation: part_of_dissertation status: public status: public supervisor: - first_name: Robert full_name: Seiringer, Robert id: 4AFD0470-F248-11E8-B48F-1D18A9856A87 last_name: Seiringer orcid: 0000-0002-6781-0521 title: The free energy of a dilute two-dimensional Bose gas tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2020' ... --- _id: '8382' abstract: - lang: eng text: We present the first deterministic wait-free long-lived snapshot algorithm, using only read and write operations, that guarantees polylogarithmic amortized step complexity in all executions. This is the first non-blocking snapshot algorithm, using reads and writes only, that has sub-linear amortized step complexity in executions of arbitrary length. The key to our construction is a novel implementation of a 2-component max array object which may be of independent interest. article_processing_charge: No author: - first_name: Mirza Ahad full_name: Baig, Mirza Ahad id: 3EDE6DE4-AA5A-11E9-986D-341CE6697425 last_name: Baig - first_name: Danny full_name: Hendler, Danny last_name: Hendler - first_name: Alessia full_name: Milani, Alessia last_name: Milani - first_name: Corentin full_name: Travers, Corentin last_name: Travers citation: ama: 'Baig MA, Hendler D, Milani A, Travers C. Long-lived snapshots with polylogarithmic amortized step complexity. In: Proceedings of the 39th Symposium on Principles of Distributed Computing. Association for Computing Machinery; 2020:31-40. doi:10.1145/3382734.3406005' apa: 'Baig, M. A., Hendler, D., Milani, A., & Travers, C. (2020). Long-lived snapshots with polylogarithmic amortized step complexity. In Proceedings of the 39th Symposium on Principles of Distributed Computing (pp. 31–40). Virtual, Italy: Association for Computing Machinery. https://doi.org/10.1145/3382734.3406005' chicago: Baig, Mirza Ahad, Danny Hendler, Alessia Milani, and Corentin Travers. “Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity.” In Proceedings of the 39th Symposium on Principles of Distributed Computing, 31–40. Association for Computing Machinery, 2020. https://doi.org/10.1145/3382734.3406005. ieee: M. A. Baig, D. Hendler, A. Milani, and C. Travers, “Long-lived snapshots with polylogarithmic amortized step complexity,” in Proceedings of the 39th Symposium on Principles of Distributed Computing, Virtual, Italy, 2020, pp. 31–40. ista: 'Baig MA, Hendler D, Milani A, Travers C. 2020. Long-lived snapshots with polylogarithmic amortized step complexity. Proceedings of the 39th Symposium on Principles of Distributed Computing. PODC: Principles of Distributed Computing, 31–40.' mla: Baig, Mirza Ahad, et al. “Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity.” Proceedings of the 39th Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2020, pp. 31–40, doi:10.1145/3382734.3406005. short: M.A. Baig, D. Hendler, A. Milani, C. Travers, in:, Proceedings of the 39th Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2020, pp. 31–40. conference: end_date: 2020-08-07 location: Virtual, Italy name: 'PODC: Principles of Distributed Computing' start_date: 2020-08-03 das_tickbox: '1' date_created: 2020-09-13T22:01:17Z date_published: 2020-07-31T00:00:00Z date_updated: 2026-07-28T09:50:30Z day: '31' department: - _id: GradSch doi: 10.1145/3382734.3406005 external_id: isi: - '001436693500004' fulldoi: https://doi.org/10.1145/3382734.3406005 isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://hal.archives-ouvertes.fr/hal-02860087/document month: '07' oa: 1 oa_version: Preprint page: 31-40 publication: Proceedings of the 39th Symposium on Principles of Distributed Computing publication_identifier: isbn: - '9781450375825' publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' scopus_import: '1' status: public title: Long-lived snapshots with polylogarithmic amortized step complexity type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- OA_place: publisher _id: '7896' abstract: - lang: eng text: "A search problem lies in the complexity class FNP if a solution to the given instance of the problem can be verified efficiently. The complexity class TFNP consists of all search problems in FNP that are total in the sense that a solution is guaranteed to exist. TFNP contains a host of interesting problems from fields such as algorithmic game theory, computational topology, number theory and combinatorics. Since TFNP is a semantic class, it is unlikely to have a complete problem. Instead, one studies its syntactic subclasses which are defined based on the combinatorial principle used to argue totality. Of particular interest is the subclass PPAD, which contains important problems\r\nlike computing Nash equilibrium for bimatrix games and computational counterparts of several fixed-point theorems as complete. In the thesis, we undertake the study of averagecase hardness of TFNP, and in particular its subclass PPAD.\r\nAlmost nothing was known about average-case hardness of PPAD before a series of recent results showed how to achieve it using a cryptographic primitive called program obfuscation.\r\nHowever, it is currently not known how to construct program obfuscation from standard cryptographic assumptions. Therefore, it is desirable to relax the assumption under which average-case hardness of PPAD can be shown. In the thesis we take a step in this direction. First, we show that assuming the (average-case) hardness of a numbertheoretic\r\nproblem related to factoring of integers, which we call Iterated-Squaring, PPAD is hard-on-average in the random-oracle model. Then we strengthen this result to show that the average-case hardness of PPAD reduces to the (adaptive) soundness of the Fiat-Shamir Transform, a well-known technique used to compile a public-coin interactive protocol into a non-interactive one. As a corollary, we obtain average-case hardness for PPAD in the random-oracle model assuming the worst-case hardness of #SAT. Moreover, the above results can all be strengthened to obtain average-case hardness for the class CLS ⊆ PPAD.\r\nOur main technical contribution is constructing incrementally-verifiable procedures for computing Iterated-Squaring and #SAT. By incrementally-verifiable, we mean that every intermediate state of the computation includes a proof of its correctness, and the proof can be updated and verified in polynomial time. Previous constructions of such procedures relied on strong, non-standard assumptions. Instead, we introduce a technique called recursive proof-merging to obtain the same from weaker assumptions. " alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Chethan full_name: Kamath Hosdurg, Chethan id: 4BD3F30E-F248-11E8-B48F-1D18A9856A87 last_name: Kamath Hosdurg orcid: 0009-0006-6812-7317 citation: ama: Kamath Hosdurg C. On the average-case hardness of total search problems. 2020. doi:10.15479/AT:ISTA:7896 apa: Kamath Hosdurg, C. (2020). On the average-case hardness of total search problems. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:7896 chicago: Kamath Hosdurg, Chethan. “On the Average-Case Hardness of Total Search Problems.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:7896. ieee: C. Kamath Hosdurg, “On the average-case hardness of total search problems,” Institute of Science and Technology Austria, 2020. ista: Kamath Hosdurg C. 2020. On the average-case hardness of total search problems. Institute of Science and Technology Austria. mla: Kamath Hosdurg, Chethan. On the Average-Case Hardness of Total Search Problems. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:7896. short: C. Kamath Hosdurg, On the Average-Case Hardness of Total Search Problems, Institute of Science and Technology Austria, 2020. corr_author: '1' date_created: 2020-05-26T14:08:55Z date_published: 2020-05-25T00:00:00Z date_updated: 2026-07-30T13:43:53Z day: '25' ddc: - '000' degree_awarded: PhD department: - _id: KrPi - _id: GradSch doi: 10.15479/AT:ISTA:7896 doi_confirm: '1' ec_funded: 1 file: - access_level: open_access checksum: b39e2e1c376f5819b823fb7077491c64 content_type: application/pdf creator: dernst date_created: 2020-05-26T14:08:13Z date_updated: 2020-07-14T12:48:04Z file_id: '7897' file_name: 2020_Thesis_Kamath.pdf file_size: 1622742 relation: main_file - access_level: closed checksum: 8b26ba729c1a85ac6bea775f5d73cdc7 content_type: application/x-zip-compressed creator: dernst date_created: 2020-05-26T14:08:23Z date_updated: 2020-07-14T12:48:04Z file_id: '7898' file_name: Thesis_Kamath.zip file_size: 15301529 relation: source_file file_date_updated: 2020-07-14T12:48:04Z fulldoi: https://doi.org/10.15479/AT:ISTA:7896 has_accepted_license: '1' language: - iso: eng month: '05' oa: 1 oa_version: Published Version page: '126' project: - _id: 258C570E-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '259668' name: Provable Security for Physical Cryptography - _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: '6677' 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 average-case hardness of total search problems tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2020' ... --- OA_place: publisher OA_type: hybrid _id: '10190' abstract: - lang: eng text: 'The verification of concurrent programs remains an open challenge, as thread interaction has to be accounted for, which leads to state-space explosion. Stateless model checking battles this problem by exploring traces rather than states of the program. As there are exponentially many traces, dynamic partial-order reduction (DPOR) techniques are used to partition the trace space into equivalence classes, and explore a few representatives from each class. The standard equivalence that underlies most DPOR techniques is the happens-before equivalence, however recent works have spawned a vivid interest towards coarser equivalences. The efficiency of such approaches is a product of two parameters: (i) the size of the partitioning induced by the equivalence, and (ii) the time spent by the exploration algorithm in each class of the partitioning. In this work, we present a new equivalence, called value-happens-before and show that it has two appealing features. First, value-happens-before is always at least as coarse as the happens-before equivalence, and can be even exponentially coarser. Second, the value-happens-before partitioning is efficiently explorable when the number of threads is bounded. We present an algorithm called value-centric DPOR (VCDPOR), which explores the underlying partitioning using polynomial time per class. Finally, we perform an experimental evaluation of VCDPOR on various benchmarks, and compare it against other state-of-the-art approaches. Our results show that value-happens-before typically induces a significant reduction in the size of the underlying partitioning, which leads to a considerable reduction in the running time for exploring the whole partitioning.' acknowledgement: "The authors would also like to thank anonymous referees for their valuable comments and helpful suggestions. This work is supported by the Austrian Science Fund (FWF) NFN grants S11407-N23 (RiSE/SHiNE) and S11402-N23 (RiSE/SHiNE), by the Vienna Science and Technology Fund (WWTF) Project ICT15-003, and by the Austrian Science Fund (FWF) Schrodinger grant J-4220.\r\n" article_number: '124' article_processing_charge: No arxiv: 1 author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Andreas full_name: Pavlogiannis, Andreas id: 49704004-F248-11E8-B48F-1D18A9856A87 last_name: Pavlogiannis orcid: 0000-0002-8943-0722 - first_name: Viktor full_name: Toman, Viktor id: 3AF3DA7C-F248-11E8-B48F-1D18A9856A87 last_name: Toman orcid: 0000-0001-9036-063X citation: ama: 'Chatterjee K, Pavlogiannis A, Toman V. Value-centric dynamic partial order reduction. In: Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications. Vol 3. ACM; 2019. doi:10.1145/3360550' apa: 'Chatterjee, K., Pavlogiannis, A., & Toman, V. (2019). Value-centric dynamic partial order reduction. In Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications (Vol. 3). Athens, Greece: ACM. https://doi.org/10.1145/3360550' chicago: Chatterjee, Krishnendu, Andreas Pavlogiannis, and Viktor Toman. “Value-Centric Dynamic Partial Order Reduction.” In Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications, Vol. 3. ACM, 2019. https://doi.org/10.1145/3360550. ieee: K. Chatterjee, A. Pavlogiannis, and V. Toman, “Value-centric dynamic partial order reduction,” in Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications, Athens, Greece, 2019, vol. 3. ista: 'Chatterjee K, Pavlogiannis A, Toman V. 2019. Value-centric dynamic partial order reduction. Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications. OOPSLA: Object-oriented Programming, Systems, Languages and Applications vol. 3, 124.' mla: Chatterjee, Krishnendu, et al. “Value-Centric Dynamic Partial Order Reduction.” Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications, vol. 3, 124, ACM, 2019, doi:10.1145/3360550. short: K. Chatterjee, A. Pavlogiannis, V. Toman, in:, Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications, ACM, 2019. conference: end_date: 2019-10-25 location: Athens, Greece name: 'OOPSLA: Object-oriented Programming, Systems, Languages and Applications' start_date: 2019-10-23 corr_author: '1' date_created: 2021-10-27T14:57:06Z date_published: 2019-10-10T00:00:00Z date_updated: 2026-04-08T07:00:31Z day: '10' ddc: - '000' department: - _id: GradSch - _id: KrCh doi: 10.1145/3360550 external_id: arxiv: - '1909.00989' file: - access_level: open_access checksum: 2149979c46964c4d117af06ccb6c0834 content_type: application/pdf creator: cchlebak date_created: 2021-11-12T11:41:56Z date_updated: 2021-11-12T11:41:56Z file_id: '10278' file_name: 2019_ACM_Chatterjee.pdf file_size: 570829 relation: main_file success: 1 file_date_updated: 2021-11-12T11:41:56Z fulldoi: https://doi.org/10.1145/3360550 has_accepted_license: '1' intvolume: ' 3' keyword: - safety - risk - reliability and quality - software language: - iso: eng month: '10' oa: 1 oa_version: Published Version project: - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25F5A88A-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11402-N23 name: Moderne Concurrency Paradigms publication: Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications publication_identifier: eissn: - 2475-1421 publication_status: published publisher: ACM quality_controlled: '1' related_material: record: - id: '10199' relation: dissertation_contains status: public scopus_import: '1' status: public title: Value-centric dynamic partial order reduction 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: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 3 year: '2019' ... --- OA_place: publisher _id: '6179' abstract: - lang: eng text: "In the first part of this thesis we consider large random matrices with arbitrary expectation and a general slowly decaying correlation among its entries. We prove universality of the local eigenvalue statistics and optimal local laws for the resolvent in the bulk and edge regime. The main novel tool is a systematic diagrammatic control of a multivariate cumulant expansion.\r\nIn the second part we consider Wigner-type matrices and show that at any cusp singularity of the limiting eigenvalue distribution the local eigenvalue statistics are uni- versal and form a Pearcey process. Since the density of states typically exhibits only square root or cubic root cusp singularities, our work complements previous results on the bulk and edge universality and it thus completes the resolution of the Wigner- Dyson-Mehta universality conjecture for the last remaining universality type. Our analysis holds not only for exact cusps, but approximate cusps as well, where an ex- tended Pearcey process emerges. As a main technical ingredient we prove an optimal local law at the cusp, and extend the fast relaxation to equilibrium of the Dyson Brow- nian motion to the cusp regime.\r\nIn the third and final part we explore the entrywise linear statistics of Wigner ma- trices and identify the fluctuations for a large class of test functions with little regularity. This enables us to study the rectangular Young diagram obtained from the interlacing eigenvalues of the random matrix and its minor, and we find that, despite having the same limit, the fluctuations differ from those of the algebraic Young tableaux equipped with the Plancharel measure." alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Dominik J full_name: Schröder, Dominik J id: 408ED176-F248-11E8-B48F-1D18A9856A87 last_name: Schröder orcid: 0000-0002-2904-1856 citation: ama: 'Schröder DJ. From Dyson to Pearcey: Universal statistics in random matrix theory. 2019. doi:10.15479/AT:ISTA:th6179' apa: 'Schröder, D. J. (2019). From Dyson to Pearcey: Universal statistics in random matrix theory. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th6179' chicago: 'Schröder, Dominik J. “From Dyson to Pearcey: Universal Statistics in Random Matrix Theory.” Institute of Science and Technology Austria, 2019. https://doi.org/10.15479/AT:ISTA:th6179.' ieee: 'D. J. Schröder, “From Dyson to Pearcey: Universal statistics in random matrix theory,” Institute of Science and Technology Austria, 2019.' ista: 'Schröder DJ. 2019. From Dyson to Pearcey: Universal statistics in random matrix theory. Institute of Science and Technology Austria.' mla: 'Schröder, Dominik J. From Dyson to Pearcey: Universal Statistics in Random Matrix Theory. Institute of Science and Technology Austria, 2019, doi:10.15479/AT:ISTA:th6179.' short: 'D.J. Schröder, From Dyson to Pearcey: Universal Statistics in Random Matrix Theory, Institute of Science and Technology Austria, 2019.' corr_author: '1' date_created: 2019-03-28T08:58:59Z date_published: 2019-03-18T00:00:00Z date_updated: 2026-07-29T13:46:20Z day: '18' ddc: - '515' - '519' degree_awarded: PhD department: - _id: LaEr - _id: GradSch doi: 10.15479/AT:ISTA:th6179 doi_confirm: '1' ec_funded: 1 file: - access_level: closed checksum: 6926f66f28079a81c4937e3764be00fc content_type: application/x-gzip creator: dernst date_created: 2019-03-28T08:53:52Z date_updated: 2020-07-14T12:47:21Z file_id: '6180' file_name: 2019_Schroeder_Thesis.tar.gz file_size: 7104482 relation: source_file - access_level: open_access checksum: 7d0ebb8d1207e89768cdd497a5bf80fb content_type: application/pdf creator: dernst date_created: 2019-03-28T08:53:52Z date_updated: 2020-07-14T12:47:21Z file_id: '6181' file_name: 2019_Schroeder_Thesis.pdf file_size: 4228794 relation: main_file file_date_updated: 2020-07-14T12:47:21Z fulldoi: https://doi.org/10.15479/AT:ISTA:th6179 has_accepted_license: '1' language: - iso: eng month: '03' oa: 1 oa_version: Published Version page: '375' project: - _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 related_material: record: - id: '6184' relation: part_of_dissertation status: public - id: '6186' relation: part_of_dissertation status: public - id: '6185' relation: part_of_dissertation status: public - id: '1012' relation: part_of_dissertation status: public - id: '1144' relation: part_of_dissertation status: public - id: '6182' relation: part_of_dissertation status: public 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: 'From Dyson to Pearcey: Universal statistics in random matrix theory' type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2019' ... --- OA_place: publisher _id: '6825' abstract: - lang: eng text: "The solving of complex tasks requires the functions of more than one brain area and their interaction. Whilst spatial navigation and memory is dependent on the hippocampus, flexible behavior relies on the medial prefrontal cortex (mPFC). To further examine the roles of the hippocampus and mPFC, we recorded their neural activity during a task that depends on both of these brain regions.\r\nWith tetrodes, we recorded the extracellular activity of dorsal hippocampal CA1 (HPC) and mPFC neurons in Long-Evans rats performing a rule-switching task on the plus-maze. The plus-maze task had a spatial component since it required navigation along one of the two start arms and at the maze center a choice between one of the two goal arms. Which goal contained a reward depended on the rule currently in place. After an uncued rule change the animal had to abandon the old strategy and switch to the new rule, testing cognitive flexibility. Investigating the coordination of activity between the HPC and mPFC allows determination during which task stages their interaction is required. Additionally, comparing neural activity patterns in these two brain regions allows delineation of the specialized functions of the HPC and mPFC in this task. We analyzed neural activity in the HPC and mPFC in terms of oscillatory interactions, rule coding and replay.\r\nWe found that theta coherence between the HPC and mPFC is increased at the center and goals of the maze, both when the rule was stable or has changed. Similar results were found for locking of HPC and mPFC neurons to HPC theta oscillations. However, no differences in HPC-mPFC theta coordination were observed between the spatially- and cue-guided rule. Phase locking of HPC and mPFC neurons to HPC gamma oscillations was not modulated by\r\nmaze position or rule type. We found that the HPC coded for the two different rules with cofiring relationships between\r\ncell pairs. However, we could not find conclusive evidence for rule coding in the mPFC. Spatially-selective firing in the mPFC generalized between the two start and two goal arms. With Bayesian positional decoding, we found that the mPFC reactivated non-local positions during awake immobility periods. Replay of these non-local positions could represent entire behavioral trajectories resembling trajectory replay of the HPC. Furthermore, mPFC\r\ntrajectory-replay at the goal positively correlated with rule-switching performance. \r\nFinally, HPC and mPFC trajectory replay occurred independently of each other. These results show that the mPFC can replay ordered patterns of activity during awake immobility, possibly underlying its role in flexible behavior. " alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Karola full_name: Käfer, Karola id: 2DAA49AA-F248-11E8-B48F-1D18A9856A87 last_name: Käfer citation: ama: Käfer K. The hippocampus and medial prefrontal cortex during flexible behavior. 2019. doi:10.15479/AT:ISTA:6825 apa: Käfer, K. (2019). The hippocampus and medial prefrontal cortex during flexible behavior. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:6825 chicago: Käfer, Karola. “The Hippocampus and Medial Prefrontal Cortex during Flexible Behavior.” Institute of Science and Technology Austria, 2019. https://doi.org/10.15479/AT:ISTA:6825. ieee: K. Käfer, “The hippocampus and medial prefrontal cortex during flexible behavior,” Institute of Science and Technology Austria, 2019. ista: Käfer K. 2019. The hippocampus and medial prefrontal cortex during flexible behavior. Institute of Science and Technology Austria. mla: Käfer, Karola. The Hippocampus and Medial Prefrontal Cortex during Flexible Behavior. Institute of Science and Technology Austria, 2019, doi:10.15479/AT:ISTA:6825. short: K. Käfer, The Hippocampus and Medial Prefrontal Cortex during Flexible Behavior, Institute of Science and Technology Austria, 2019. corr_author: '1' date_created: 2019-08-21T15:00:57Z date_published: 2019-08-24T00:00:00Z date_updated: 2026-04-08T13:56:14Z day: '24' ddc: - '570' degree_awarded: PhD department: - _id: JoCs - _id: GradSch doi: 10.15479/AT:ISTA:6825 file: - access_level: open_access checksum: 2664420e332a33338568f4f3bfc59287 content_type: application/pdf creator: kkaefer date_created: 2019-09-03T08:07:13Z date_updated: 2020-09-06T22:30:03Z embargo: 2020-09-05 file_id: '6846' file_name: Thesis_Kaefer_PDFA.pdf file_size: 3205202 relation: main_file request_a_copy: 0 - access_level: closed checksum: 9a154eab6f07aa590a3d2651dc0d926a content_type: application/zip creator: kkaefer date_created: 2019-09-03T08:07:17Z date_updated: 2024-04-10T22:30:48Z embargo_to: open_access file_id: '6847' file_name: Thesis_Kaefer.zip file_size: 2506835 relation: source_file file_date_updated: 2024-04-10T22:30:48Z fulldoi: https://doi.org/10.15479/AT:ISTA:6825 has_accepted_license: '1' language: - iso: eng month: '08' oa: 1 oa_version: Published Version page: '89' publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '5949' relation: part_of_dissertation status: public status: public supervisor: - first_name: Jozsef L full_name: Csicsvari, Jozsef L id: 3FA14672-F248-11E8-B48F-1D18A9856A87 last_name: Csicsvari orcid: 0000-0002-5193-4036 title: The hippocampus and medial prefrontal cortex during flexible behavior type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2019' ... --- OA_place: publisher _id: '6546' abstract: - lang: eng text: "Invasive migration plays a crucial role not only during development and homeostasis but also in pathological states, such as tumor metastasis. Drosophila macrophage migration into the extended germband is an interesting system to study invasive migration. It carries similarities to immune cell transmigration and cancer cell invasion, therefore studying this process could also bring new understanding of invasion in higher organisms. In our work, we uncover a highly conserved member of the major facilitator family that plays a role in tissue invasion through regulation of glycosylation on a subgroup of proteins and/or by aiding the precise timing of DN-Cadherin downregulation. \r\n\r\nAberrant display of the truncated core1 O-glycan T-antigen is a common feature of human cancer cells that correlates with metastasis. Here we show that T-antigen in Drosophila melanogaster macrophages is involved in their developmentally programmed tissue invasion. Higher macrophage T-antigen levels require an atypical major facilitator superfamily (MFS) member that we named Minerva which enables macrophage dissemination and invasion. We characterize for the first time the T and Tn glycoform O-glycoproteome of the Drosophila melanogaster embryo, and determine that Minerva increases the presence of T-antigen on proteins in pathways previously linked to cancer, most strongly on the sulfhydryl oxidase Qsox1 which we show is required for macrophage tissue entry. Minerva’s vertebrate ortholog, MFSD1, rescues the minerva mutant’s migration and T-antigen glycosylation defects. We thus identify \r\na key conserved regulator that orchestrates O-glycosylation on a protein subset to activate \r\na program governing migration steps important for both development and cancer metastasis. \r\n" acknowledged_ssus: - _id: Bio alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Katarina full_name: Valosková, Katarina id: 46F146FC-F248-11E8-B48F-1D18A9856A87 last_name: Valosková orcid: 0000-0002-7926-0221 citation: ama: Valosková K. The role of a highly conserved major facilitator superfamily member in Drosophila embryonic macrophage migration. 2019. doi:10.15479/AT:ISTA:6546 apa: Valosková, K. (2019). The role of a highly conserved major facilitator superfamily member in Drosophila embryonic macrophage migration. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:6546 chicago: Valosková, Katarina. “The Role of a Highly Conserved Major Facilitator Superfamily Member in Drosophila Embryonic Macrophage Migration.” Institute of Science and Technology Austria, 2019. https://doi.org/10.15479/AT:ISTA:6546. ieee: K. Valosková, “The role of a highly conserved major facilitator superfamily member in Drosophila embryonic macrophage migration,” Institute of Science and Technology Austria, 2019. ista: Valosková K. 2019. The role of a highly conserved major facilitator superfamily member in Drosophila embryonic macrophage migration. Institute of Science and Technology Austria. mla: Valosková, Katarina. The Role of a Highly Conserved Major Facilitator Superfamily Member in Drosophila Embryonic Macrophage Migration. Institute of Science and Technology Austria, 2019, doi:10.15479/AT:ISTA:6546. short: K. Valosková, The Role of a Highly Conserved Major Facilitator Superfamily Member in Drosophila Embryonic Macrophage Migration, Institute of Science and Technology Austria, 2019. corr_author: '1' date_created: 2019-06-07T12:49:19Z date_published: 2019-06-07T00:00:00Z date_updated: 2026-09-03T06:37:27Z day: '07' ddc: - '570' degree_awarded: PhD department: - _id: DaSi - _id: GradSch doi: 10.15479/AT:ISTA:6546 doi_confirm: '1' file: - access_level: closed checksum: 68949c2d96210b45b981a23e9c9cd93c content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document creator: khribikova date_created: 2019-06-07T13:00:04Z date_updated: 2020-07-14T12:47:33Z embargo_to: open_access file_id: '6549' file_name: Katarina Valoskova_PhD thesis_final version.docx file_size: 14110626 relation: source_file - access_level: open_access checksum: 555329cd76e196c96f5278c480ee2e6e content_type: application/pdf creator: khribikova date_created: 2019-06-07T13:00:08Z date_updated: 2021-02-11T11:17:14Z embargo: 2020-06-07 file_id: '6550' file_name: Katarina Valoskova_PhD thesis_final version.pdf file_size: 10054156 relation: main_file file_date_updated: 2021-02-11T11:17:14Z fulldoi: https://doi.org/10.15479/AT:ISTA:6546 has_accepted_license: '1' language: - iso: eng month: '06' oa: 1 oa_version: Published Version page: '141' project: - _id: 253CDE40-B435-11E9-9278-68D0E5697425 grant_number: '24283' name: Examination of the role of a MFS transporter in the migration of Drosophila immune cells publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '544' relation: part_of_dissertation status: public - id: '6187' relation: part_of_dissertation status: public status: public supervisor: - first_name: Daria E full_name: Siekhaus, Daria E id: 3D224B9E-F248-11E8-B48F-1D18A9856A87 last_name: Siekhaus orcid: 0000-0001-8323-8353 title: The role of a highly conserved major facilitator superfamily member in Drosophila embryonic macrophage migration type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2019' ... --- OA_place: publisher _id: '6849' abstract: - lang: eng text: 'Brain function is mediated by complex dynamical interactions between excitatory and inhibitory cell types. The Cholecystokinin-expressing inhibitory cells (CCK-interneurons) are one of the least studied types, despite being suspected to play important roles in cognitive processes. We studied the network effects of optogenetic silencing of CCK-interneurons in the CA1 hippocampal area during exploration and sleep states. The cell firing pattern in response to light pulses allowed us to classify the recorded neurons in 5 classes, including disinhibited and non-responsive pyramidal cell and interneurons, and the inhibited interneurons corresponding to the CCK group. The light application, which inhibited the activity of CCK interneurons triggered wider changes in the firing dynamics of cells. We observed rate changes (i.e. remapping) of pyramidal cells during the exploration session in which the light was applied relative to the previous control session that was not restricted neither in time nor space to the light delivery. Also, the disinhibited pyramidal cells had higher increase in bursting than in single spike firing rate as a result of CCK silencing. In addition, the firing activity patterns during exploratory periods were more weakly reactivated in sleep for those periods in which CCK-interneuron were silenced than in the unaffected periods. Furthermore, light pulses during sleep disrupted the reactivation of recent waking patterns. Hence, silencing CCK neurons during exploration suppressed the reactivation of waking firing patterns in sleep and CCK interneuron activity was also required during sleep for the normal reactivation of waking patterns. These findings demonstrate the involvement of CCK cells in reactivation-related memory consolidation. An important part of our analysis was to test the relationship of the identified CCKinterneurons to brain oscillations. Our findings showed that these cells exhibited different oscillatory behaviour during anaesthesia and natural waking and sleep conditions. We showed that: 1) Contrary to the past studies performed under anaesthesia, the identified CCKinterneurons fired on the descending portion of the theta phase in waking exploration. 2) CCKinterneuron preferred phases around the trough of gamma oscillations. 3) Contrary to anaesthesia conditions, the average firing rate of the CCK-interneurons increased around the peak activity of the sharp-wave ripple (SWR) events in natural sleep, which is congruent with new reports about their functional connectivity. We also found that light driven CCK-interneuron silencing altered the dynamics on the CA1 network oscillatory activity: 1) Pyramidal cells negatively shifted their preferred theta phases when the light was applied, while interneurons responses were less consistent. 2) As a population, pyramidal cells negatively shifted their preferred activity during gamma oscillations, albeit we did not find gamma modulation differences related to the light application when pyramidal cells were subdivided into the disinhibited and unaffected groups. 3) During the peak of SWR events, all but the CCK-interneurons had a reduction in their relative firing rate change during the light application as compared to the change observed at SWR initiation. Finally, regarding to the place field activity of the recorded pyramidal neurons, we showed that the disinhibited pyramidal cells had reduced place field similarity, coherence and spatial information, but only during the light application. The mechanisms behind such observed behaviours might involve eCB signalling and plastic changes in CCK-interneuron synapses. In conclusion, the observed changes related to the light-mediated silencing of CCKinterneurons have unravelled characteristics of this interneuron subpopulation that might change the understanding not only of their particular network interactions, but also of the current theories about the emergence of certain cognitive processes such as place coding needed for navigation or hippocampus-dependent memory consolidation. ' acknowledged_ssus: - _id: Bio - _id: PreCl - _id: M-Shop alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Dámaris K full_name: Rangel Guerrero, Dámaris K id: 4871BCE6-F248-11E8-B48F-1D18A9856A87 last_name: Rangel Guerrero orcid: 0000-0002-8602-4374 citation: ama: Rangel Guerrero DK. The role of CCK-interneurons in regulating hippocampal network dynamics. 2019. doi:10.15479/AT:ISTA:6849 apa: Rangel Guerrero, D. K. (2019). The role of CCK-interneurons in regulating hippocampal network dynamics. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:6849 chicago: Rangel Guerrero, Dámaris K. “The Role of CCK-Interneurons in Regulating Hippocampal Network Dynamics.” Institute of Science and Technology Austria, 2019. https://doi.org/10.15479/AT:ISTA:6849. ieee: D. K. Rangel Guerrero, “The role of CCK-interneurons in regulating hippocampal network dynamics,” Institute of Science and Technology Austria, 2019. ista: Rangel Guerrero DK. 2019. The role of CCK-interneurons in regulating hippocampal network dynamics. Institute of Science and Technology Austria. mla: Rangel Guerrero, Dámaris K. The Role of CCK-Interneurons in Regulating Hippocampal Network Dynamics. Institute of Science and Technology Austria, 2019, doi:10.15479/AT:ISTA:6849. short: D.K. Rangel Guerrero, The Role of CCK-Interneurons in Regulating Hippocampal Network Dynamics, Institute of Science and Technology Austria, 2019. corr_author: '1' date_created: 2019-09-06T06:54:16Z date_published: 2019-09-09T00:00:00Z date_updated: 2026-09-03T06:40:36Z day: '09' ddc: - '570' degree_awarded: PhD department: - _id: JoCs - _id: GradSch doi: 10.15479/AT:ISTA:6849 doi_confirm: '1' file: - access_level: closed checksum: 244dc4f74dbfc94f414156092298831f content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document creator: drangel date_created: 2019-09-09T13:09:45Z date_updated: 2021-02-10T23:30:09Z embargo_to: open_access file_id: '6865' file_name: Thesis_Damaris_Rangel_source.docx file_size: 18253100 relation: source_file - access_level: open_access checksum: 59c73be40eeaa1c4db24067270151555 content_type: application/pdf creator: drangel date_created: 2019-09-09T13:09:52Z date_updated: 2020-09-11T22:30:04Z embargo: 2020-09-10 file_id: '6866' file_name: Thesis_Damaris_Rangel_pdfa.pdf file_size: 2160109 relation: main_file request_a_copy: 0 file_date_updated: 2021-02-10T23:30:09Z fulldoi: https://doi.org/10.15479/AT:ISTA:6849 has_accepted_license: '1' language: - iso: eng month: '09' oa: 1 oa_version: Published Version page: '97' publication_identifier: isbn: - 978-3-99078-003-9 issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '5914' relation: part_of_dissertation status: public status: public supervisor: - first_name: Jozsef L full_name: Csicsvari, Jozsef L id: 3FA14672-F248-11E8-B48F-1D18A9856A87 last_name: Csicsvari orcid: 0000-0002-5193-4036 title: The role of CCK-interneurons in regulating hippocampal network dynamics type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2019' ... --- DOAJ_listed: '1' OA_place: publisher OA_type: gold _id: '19544' abstract: - lang: eng text: Medicinal bioinorganic chemistry is a thriving field of drug research for cancer treatment. Transition metal complexes coordinated to essential biological scaffolds represent a highly promising class of compounds for design of novel target-specific therapeutics. We report here the biological evaluation of a novel Isatin-Schiff base derivative and its Cu(II) complex in several tumor cell lines by assessing their effects on cellular metabolism, real-time cell proliferation and induction of apoptosis. Further, the impact of compounds on the p53 protein and expression of its target genes, including MDM2, p21/CDKN1A, and PUMA was evaluated. Results obtained in this study provide further evidence in support of our prior data suggesting the p53-mediated mechanism of action for Isatin-Schiff base derivatives and their complexes and also shed light on potential use of these compounds for stimulation of apoptosis in breast cancer cells via activation of the pro-apoptotic PUMA gene. article_number: '103' article_processing_charge: Yes article_type: original author: - first_name: Emil full_name: Bulatov, Emil last_name: Bulatov - first_name: Regina full_name: Sayarova, Regina last_name: Sayarova - first_name: Rimma full_name: Mingaleeva, Rimma last_name: Mingaleeva - first_name: Regina full_name: Miftakhova, Regina last_name: Miftakhova - first_name: Marina full_name: Gomzikova, Marina last_name: Gomzikova - first_name: Iurii full_name: Ignatev, Iurii id: 2ac71786-dc7d-11ea-9b2f-c5ad4b9faff6 last_name: Ignatev - first_name: Alexey full_name: Petukhov, Alexey last_name: Petukhov - first_name: Pavel full_name: Davidovich, Pavel last_name: Davidovich - first_name: Albert full_name: Rizvanov, Albert last_name: Rizvanov - first_name: Nickolai A. full_name: Barlev, Nickolai A. last_name: Barlev citation: ama: Bulatov E, Sayarova R, Mingaleeva R, et al. Isatin-Schiff base-copper (II) complex induces cell death in p53-positive tumors. Cell Death Discovery. 2018;4. doi:10.1038/s41420-018-0120-z apa: Bulatov, E., Sayarova, R., Mingaleeva, R., Miftakhova, R., Gomzikova, M., Ignatev, I., … Barlev, N. A. (2018). Isatin-Schiff base-copper (II) complex induces cell death in p53-positive tumors. Cell Death Discovery. Springer Nature. https://doi.org/10.1038/s41420-018-0120-z chicago: Bulatov, Emil, Regina Sayarova, Rimma Mingaleeva, Regina Miftakhova, Marina Gomzikova, Iurii Ignatev, Alexey Petukhov, Pavel Davidovich, Albert Rizvanov, and Nickolai A. Barlev. “Isatin-Schiff Base-Copper (II) Complex Induces Cell Death in P53-Positive Tumors.” Cell Death Discovery. Springer Nature, 2018. https://doi.org/10.1038/s41420-018-0120-z. ieee: E. Bulatov et al., “Isatin-Schiff base-copper (II) complex induces cell death in p53-positive tumors,” Cell Death Discovery, vol. 4. Springer Nature, 2018. ista: Bulatov E, Sayarova R, Mingaleeva R, Miftakhova R, Gomzikova M, Ignatev I, Petukhov A, Davidovich P, Rizvanov A, Barlev NA. 2018. Isatin-Schiff base-copper (II) complex induces cell death in p53-positive tumors. Cell Death Discovery. 4, 103. mla: Bulatov, Emil, et al. “Isatin-Schiff Base-Copper (II) Complex Induces Cell Death in P53-Positive Tumors.” Cell Death Discovery, vol. 4, 103, Springer Nature, 2018, doi:10.1038/s41420-018-0120-z. short: E. Bulatov, R. Sayarova, R. Mingaleeva, R. Miftakhova, M. Gomzikova, I. Ignatev, A. Petukhov, P. Davidovich, A. Rizvanov, N.A. Barlev, Cell Death Discovery 4 (2018). date_created: 2025-04-11T01:31:42Z date_published: 2018-11-13T00:00:00Z date_updated: 2025-07-10T11:51:52Z day: '13' ddc: - '570' department: - _id: GradSch - _id: LoSw doi: 10.1038/s41420-018-0120-z extern: '1' external_id: pmid: - '30455989 ' fulldoi: https://doi.org/10.1038/s41420-018-0120-z has_accepted_license: '1' intvolume: ' 4' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1038/s41420-018-0120-z month: '11' oa: 1 oa_version: Published Version pmid: 1 publication: Cell Death Discovery publication_identifier: issn: - 2058-7716 publication_status: published publisher: Springer Nature quality_controlled: '1' status: public title: Isatin-Schiff base-copper (II) complex induces cell death in p53-positive tumors 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: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 4 year: '2018' ... --- _id: '104' abstract: - lang: eng text: The biotrophic pathogen Ustilago maydis, the causative agent of corn smut disease, infects one of the most important crops worldwide – Zea mays. To successfully colonize its host, U. maydis secretes proteins, known as effectors, that suppress plant defense responses and facilitate the establishment of biotrophy. In this work, we describe the U. maydis effector protein Cce1. Cce1 is essential for virulence and is upregulated during infection. Through microscopic analysis and in vitro assays, we show that Cce1 is secreted from hyphae during filamentous growth of the fungus. Strikingly, Δcce1 mutants are blocked at early stages of infection and induce callose deposition as a plant defense response. Cce1 is highly conserved among smut fungi and the Ustilago bromivora ortholog complemented the virulence defect of the SG200Δcce1 deletion strain. These data indicate that Cce1 is a core effector with apoplastic localization that is essential for U. maydis to infect its host. acknowledgement: 'the Austrian Science Fund (FWF): [P27429‐B22, P27818‐B22, I 3033‐B22], and the Austrian Academy of Science (OEAW).' article_processing_charge: No author: - first_name: Denise full_name: Seitner, Denise last_name: Seitner - first_name: Simon full_name: Uhse, Simon last_name: Uhse - first_name: Michelle C full_name: Gallei, Michelle C id: 35A03822-F248-11E8-B48F-1D18A9856A87 last_name: Gallei orcid: 0000-0003-1286-7368 - first_name: Armin full_name: Djamei, Armin last_name: Djamei citation: ama: Seitner D, Uhse S, Gallei MC, Djamei A. The core effector Cce1 is required for early infection of maize by Ustilago maydis. Molecular Plant Pathology. 2018;19(10):2277-2287. doi:10.1111/mpp.12698 apa: Seitner, D., Uhse, S., Gallei, M. C., & Djamei, A. (2018). The core effector Cce1 is required for early infection of maize by Ustilago maydis. Molecular Plant Pathology. Wiley. https://doi.org/10.1111/mpp.12698 chicago: Seitner, Denise, Simon Uhse, Michelle C Gallei, and Armin Djamei. “The Core Effector Cce1 Is Required for Early Infection of Maize by Ustilago Maydis.” Molecular Plant Pathology. Wiley, 2018. https://doi.org/10.1111/mpp.12698. ieee: D. Seitner, S. Uhse, M. C. Gallei, and A. Djamei, “The core effector Cce1 is required for early infection of maize by Ustilago maydis,” Molecular Plant Pathology, vol. 19, no. 10. Wiley, pp. 2277–2287, 2018. ista: Seitner D, Uhse S, Gallei MC, Djamei A. 2018. The core effector Cce1 is required for early infection of maize by Ustilago maydis. Molecular Plant Pathology. 19(10), 2277–2287. mla: Seitner, Denise, et al. “The Core Effector Cce1 Is Required for Early Infection of Maize by Ustilago Maydis.” Molecular Plant Pathology, vol. 19, no. 10, Wiley, 2018, pp. 2277–87, doi:10.1111/mpp.12698. short: D. Seitner, S. Uhse, M.C. Gallei, A. Djamei, Molecular Plant Pathology 19 (2018) 2277–2287. date_created: 2018-12-11T11:44:39Z date_published: 2018-10-01T00:00:00Z date_updated: 2023-09-19T10:06:42Z day: '01' ddc: - '580' department: - _id: GradSch doi: 10.1111/mpp.12698 external_id: isi: - '000445624100006' file: - access_level: open_access content_type: application/pdf creator: dernst date_created: 2018-12-18T09:46:00Z date_updated: 2018-12-18T09:46:00Z file_id: '5740' file_name: 2018_MolecPlantPath_Seitner.pdf file_size: 682335 relation: main_file success: 1 file_date_updated: 2018-12-18T09:46:00Z fulldoi: https://doi.org/10.1111/mpp.12698 has_accepted_license: '1' intvolume: ' 19' isi: 1 issue: '10' language: - iso: eng month: '10' oa: 1 oa_version: Published Version page: 2277 - 2287 publication: Molecular Plant Pathology publication_status: published publisher: Wiley publist_id: '7950' quality_controlled: '1' scopus_import: '1' status: public title: The core effector Cce1 is required for early infection of maize by Ustilago maydis 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: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 19 year: '2018' ... --- OA_place: publisher _id: '69' abstract: - lang: eng text: 'A qubit, a unit of quantum information, is essentially any quantum mechanical two-level system which can be coherently controlled. Still, to be used for computation, it has to fulfill criteria. Qubits, regardless of the system in which they are realized, suffer from decoherence. This leads to loss of the information stored in the qubit. The upper bound of the time scale on which decoherence happens is set by the spin relaxation time. In this thesis I studied a two-level system consisting of a Zeeman-split hole spin confined in a quantum dot formed in a Ge hut wire. Such Ge hut wires have emerged as a promising material system for the realization of spin qubits, due to the combination of two significant properties: long spin coherence time as expected for group IV semiconductors due to the low hyperfine interaction and a strong valence band spin-orbit coupling. Here, I present how to fabricate quantum dot devices suitable for electrical transport measurements. Coupled quantum dot devices allowed the realization of a charge sensor, which is electrostatically and tunnel coupled to a quantum dot. By integrating the charge sensor into a radio-frequency reflectometry setup, I performed for the first time single-shot readout measurements of hole spins and extracted the hole spin relaxation times in Ge hut wires.' alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Lada full_name: Vukušić, Lada id: 31E9F056-F248-11E8-B48F-1D18A9856A87 last_name: Vukušić orcid: 0000-0003-2424-8636 citation: ama: Vukušić L. Charge sensing and spin relaxation times of holes in Ge hut wires. 2018. doi:10.15479/AT:ISTA:TH_1047 apa: Vukušić, L. (2018). Charge sensing and spin relaxation times of holes in Ge hut wires. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:TH_1047 chicago: Vukušić, Lada. “Charge Sensing and Spin Relaxation Times of Holes in Ge Hut Wires.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:TH_1047. ieee: L. Vukušić, “Charge sensing and spin relaxation times of holes in Ge hut wires,” Institute of Science and Technology Austria, 2018. ista: Vukušić L. 2018. Charge sensing and spin relaxation times of holes in Ge hut wires. Institute of Science and Technology Austria. mla: Vukušić, Lada. Charge Sensing and Spin Relaxation Times of Holes in Ge Hut Wires. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:TH_1047. short: L. Vukušić, Charge Sensing and Spin Relaxation Times of Holes in Ge Hut Wires, Institute of Science and Technology Austria, 2018. corr_author: '1' date_created: 2018-12-11T11:44:28Z date_published: 2018-09-01T00:00:00Z date_updated: 2026-04-08T14:09:47Z day: '01' ddc: - '530' - '600' degree_awarded: PhD department: - _id: GeKa - _id: GradSch doi: 10.15479/AT:ISTA:TH_1047 file: - access_level: open_access checksum: c570b656e30749cd65b1c7e13a9ce0a8 content_type: application/pdf creator: dernst date_created: 2019-04-09T07:00:40Z date_updated: 2020-07-14T12:47:44Z file_id: '6247' file_name: 2018_Thesis_Vukusic.pdf file_size: 28452385 relation: main_file - access_level: closed checksum: 7856771d9cd401fe0b311191076db6e1 content_type: application/zip creator: dernst date_created: 2019-04-09T07:00:40Z date_updated: 2020-07-14T12:47:44Z file_id: '6248' file_name: 2018_Thesis_Vukusic_source.zip file_size: 53058704 relation: source_file file_date_updated: 2020-07-14T12:47:44Z fulldoi: https://doi.org/10.15479/AT:ISTA:TH_1047 has_accepted_license: '1' language: - iso: eng month: '09' oa: 1 oa_version: Published Version page: '103' publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria publist_id: '7985' pubrep_id: '1047' related_material: record: - id: '23' relation: part_of_dissertation status: public - id: '840' relation: part_of_dissertation status: public status: public supervisor: - first_name: Georgios full_name: Katsaros, Georgios id: 38DB5788-F248-11E8-B48F-1D18A9856A87 last_name: Katsaros orcid: 0000-0001-8342-202X title: Charge sensing and spin relaxation times of holes in Ge hut wires tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2018' ...