[{"project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","grant_number":"863818"},{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF"}],"article_number":"17443","oa_version":"Published Version","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","month":"08","language":[{"iso":"eng"}],"scopus_import":"1","ddc":["003"],"date_updated":"2026-10-23T22:30:45Z","publisher":"Springer Nature","_id":"9997","external_id":{"pmid":["34465830"],"isi":["000692406400018"]},"acknowledgement":"This work was supported by the European Research Council CoG 863818 (ForM-SMArt) (to K.C.) and the European Research Council Starting Grant 850529: E-DIRECT (to C.H.). L.S. received additional partial support by the Austrian Science Fund (FWF) under Grant Z211-N23 (Wittgenstein Award).","title":"The evolution of indirect reciprocity under action and assessment generosity","article_processing_charge":"Yes","publication_identifier":{"eissn":["2045-2322"]},"abstract":[{"text":"Indirect reciprocity is a mechanism for the evolution of cooperation based on social norms. This mechanism requires that individuals in a population observe and judge each other’s behaviors. Individuals with a good reputation are more likely to receive help from others. Previous work suggests that indirect reciprocity is only effective when all relevant information is reliable and publicly available. Otherwise, individuals may disagree on how to assess others, even if they all apply the same social norm. Such disagreements can lead to a breakdown of cooperation. Here we explore whether the predominantly studied ‘leading eight’ social norms of indirect reciprocity can be made more robust by equipping them with an element of generosity. To this end, we distinguish between two kinds of generosity. According to assessment generosity, individuals occasionally assign a good reputation to group members who would usually be regarded as bad. According to action generosity, individuals occasionally cooperate with group members with whom they would usually defect. Using individual-based simulations, we show that the two kinds of generosity have a very different effect on the resulting reputation dynamics. Assessment generosity tends to add to the overall noise and allows defectors to invade. In contrast, a limited amount of action generosity can be beneficial in a few cases. However, even when action generosity is beneficial, the respective simulations do not result in full cooperation. Our results suggest that while generosity can favor cooperation when individuals use the most simple strategies of reciprocity, it is disadvantageous when individuals use more complex social norms.","lang":"eng"}],"doi":"10.1038/s41598-021-96932-1","citation":{"mla":"Schmid, Laura, et al. “The Evolution of Indirect Reciprocity under Action and Assessment Generosity.” <i>Scientific Reports</i>, vol. 11, no. 1, 17443, Springer Nature, 2021, doi:<a href=\"https://doi.org/10.1038/s41598-021-96932-1\">10.1038/s41598-021-96932-1</a>.","apa":"Schmid, L., Shati, P., Hilbe, C., &#38; Chatterjee, K. (2021). The evolution of indirect reciprocity under action and assessment generosity. <i>Scientific Reports</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41598-021-96932-1\">https://doi.org/10.1038/s41598-021-96932-1</a>","ieee":"L. Schmid, P. Shati, C. Hilbe, and K. Chatterjee, “The evolution of indirect reciprocity under action and assessment generosity,” <i>Scientific Reports</i>, vol. 11, no. 1. Springer Nature, 2021.","ista":"Schmid L, Shati P, Hilbe C, Chatterjee K. 2021. The evolution of indirect reciprocity under action and assessment generosity. Scientific Reports. 11(1), 17443.","chicago":"Schmid, Laura, Pouya Shati, Christian Hilbe, and Krishnendu Chatterjee. “The Evolution of Indirect Reciprocity under Action and Assessment Generosity.” <i>Scientific Reports</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1038/s41598-021-96932-1\">https://doi.org/10.1038/s41598-021-96932-1</a>.","short":"L. Schmid, P. Shati, C. Hilbe, K. Chatterjee, Scientific Reports 11 (2021).","ama":"Schmid L, Shati P, Hilbe C, Chatterjee K. The evolution of indirect reciprocity under action and assessment generosity. <i>Scientific Reports</i>. 2021;11(1). doi:<a href=\"https://doi.org/10.1038/s41598-021-96932-1\">10.1038/s41598-021-96932-1</a>"},"file_date_updated":"2021-09-13T10:31:21Z","keyword":["Multidisciplinary"],"corr_author":"1","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"has_accepted_license":"1","pmid":1,"article_type":"original","file":[{"success":1,"content_type":"application/pdf","file_id":"10006","creator":"cchlebak","file_size":2424943,"file_name":"2021_ScientificReports_Schmid.pdf","date_created":"2021-09-13T10:31:21Z","access_level":"open_access","date_updated":"2021-09-13T10:31:21Z","relation":"main_file","checksum":"19df8816cf958b272b85841565c73182"}],"quality_controlled":"1","volume":11,"ec_funded":1,"license":"https://creativecommons.org/licenses/by/4.0/","isi":1,"author":[{"first_name":"Laura","full_name":"Schmid, Laura","last_name":"Schmid","id":"38B437DE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6978-7329"},{"full_name":"Shati, Pouya","first_name":"Pouya","last_name":"Shati"},{"first_name":"Christian","full_name":"Hilbe, Christian","last_name":"Hilbe"},{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"}],"day":"31","year":"2021","status":"public","related_material":{"record":[{"relation":"dissertation_contains","id":"10293","status":"public"}]},"intvolume":"        11","type":"journal_article","issue":"1","date_created":"2021-09-11T16:22:02Z","date_published":"2021-08-31T00:00:00Z","oa":1,"fulldoi":"https://doi.org/10.1038/s41598-021-96932-1","publication_status":"published","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication":"Scientific Reports"},{"author":[{"first_name":"Hana","full_name":"Semerádová, Hana","id":"42FE702E-F248-11E8-B48F-1D18A9856A87","last_name":"Semerádová"}],"day":"13","OA_place":"publisher","supervisor":[{"id":"38F4F166-F248-11E8-B48F-1D18A9856A87","last_name":"Benková","orcid":"0000-0002-8510-9739","first_name":"Eva","full_name":"Benková, Eva"}],"file":[{"file_name":"Hana_Semeradova_Disertation_Thesis_II_Revised_3.docx","embargo_to":"open_access","access_level":"closed","date_created":"2021-10-27T07:45:37Z","checksum":"ce7108853e6cec6224f17cd6429b51fe","date_updated":"2022-12-20T23:30:05Z","relation":"source_file","file_id":"10186","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","creator":"cziletti","file_size":28508629},{"file_id":"10187","content_type":"application/pdf","creator":"cziletti","file_size":10623525,"file_name":"Hana_Semeradova_Disertation_Thesis_II_Revised_3PDFA.pdf","date_created":"2021-10-27T07:45:57Z","access_level":"open_access","embargo":"2022-10-28","relation":"main_file","date_updated":"2022-12-20T23:30:05Z","checksum":"0d7afb846e8e31ec794de47bf44e12ef"}],"fulldoi":"https://doi.org/10.15479/at:ista:10135","publication_status":"published","date_created":"2021-10-13T13:42:48Z","date_published":"2021-10-13T00:00:00Z","oa":1,"year":"2021","status":"public","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"9160"}]},"type":"dissertation","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","language":[{"iso":"eng"}],"month":"10","oa_version":"Published Version","project":[{"name":"Molecular mechanisms of the cytokinin regulated endomembrane trafficking to coordinate plant organogenesis","_id":"261821BC-B435-11E9-9278-68D0E5697425","grant_number":"24746"}],"alternative_title":["ISTA Thesis"],"corr_author":"1","department":[{"_id":"GradSch"},{"_id":"EvBe"}],"has_accepted_license":"1","article_processing_charge":"No","publication_identifier":{"isbn":["978-3-99078-014-5"],"issn":["2663-337X"]},"abstract":[{"text":"Plants maintain the capacity to develop new organs e.g. lateral roots post-embryonically throughout their whole life and thereby flexibly adapt to ever-changing environmental conditions. Plant hormones auxin and cytokinin are the main regulators of the lateral root organogenesis. Additionally to their solo activities, the interaction between auxin and\r\ncytokinin plays crucial role in fine-tuning of lateral root development and growth. In particular, cytokinin modulates auxin distribution within the developing lateral root by affecting the endomembrane trafficking of auxin transporter PIN1 and promoting its vacuolar degradation (Marhavý et al., 2011, 2014). This effect is independent of transcription and\r\ntranslation. Therefore, it suggests novel, non-canonical cytokinin activity occuring possibly on the posttranslational level. Impact of cytokinin and other plant hormones on auxin transporters (including PIN1) on the posttranslational level is described in detail in the introduction part of this thesis in a form of a review (Semeradova et al., 2020). To gain insights into the molecular machinery underlying cytokinin effect on the endomembrane trafficking in the plant cell, in particular on the PIN1 degradation, we conducted two large proteomic screens: 1) Identification of cytokinin binding proteins using\r\nchemical proteomics. 2) Monitoring of proteomic and phosphoproteomic changes upon cytokinin treatment. In the first screen, we identified DYNAMIN RELATED PROTEIN 2A (DRP2A). We found that DRP2A plays a role in cytokinin regulated processes during the plant growth and that cytokinin treatment promotes destabilization of DRP2A protein. However, the role of DRP2A in the PIN1 degradation remains to be elucidated. In the second screen, we found VACUOLAR PROTEIN SORTING 9A (VPS9A). VPS9a plays crucial role in plant’s response to cytokin and in cytokinin mediated PIN1 degradation. Altogether, we identified proteins, which bind to cytokinin and proteins that in response to\r\ncytokinin exhibit significantly changed abundance or phosphorylation pattern. By combining information from these two screens, we can pave our way towards understanding of noncanonical cytokinin effects.","lang":"eng"}],"citation":{"short":"H. Semerádová, Molecular Mechanisms of the Cytokinin-Regulated Endomembrane Trafficking to Coordinate Plant Organogenesis, Institute of Science and Technology Austria, 2021.","chicago":"Semerádová, Hana. “Molecular Mechanisms of the Cytokinin-Regulated Endomembrane Trafficking to Coordinate Plant Organogenesis.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/at:ista:10135\">https://doi.org/10.15479/at:ista:10135</a>.","ama":"Semerádová H. Molecular mechanisms of the cytokinin-regulated endomembrane trafficking to coordinate plant organogenesis. 2021. doi:<a href=\"https://doi.org/10.15479/at:ista:10135\">10.15479/at:ista:10135</a>","ieee":"H. Semerádová, “Molecular mechanisms of the cytokinin-regulated endomembrane trafficking to coordinate plant organogenesis,” Institute of Science and Technology Austria, 2021.","ista":"Semerádová H. 2021. Molecular mechanisms of the cytokinin-regulated endomembrane trafficking to coordinate plant organogenesis. Institute of Science and Technology Austria.","mla":"Semerádová, Hana. <i>Molecular Mechanisms of the Cytokinin-Regulated Endomembrane Trafficking to Coordinate Plant Organogenesis</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/at:ista:10135\">10.15479/at:ista:10135</a>.","apa":"Semerádová, H. (2021). <i>Molecular mechanisms of the cytokinin-regulated endomembrane trafficking to coordinate plant organogenesis</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:10135\">https://doi.org/10.15479/at:ista:10135</a>"},"file_date_updated":"2022-12-20T23:30:05Z","doi":"10.15479/at:ista:10135","title":"Molecular mechanisms of the cytokinin-regulated endomembrane trafficking to coordinate plant organogenesis","ddc":["570"],"date_updated":"2026-04-08T07:12:06Z","_id":"10135","publisher":"Institute of Science and Technology Austria","degree_awarded":"PhD"},{"author":[{"full_name":"Schmid, Laura","first_name":"Laura","last_name":"Schmid","id":"38B437DE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6978-7329"},{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Christian","full_name":"Hilbe, Christian","orcid":"0000-0001-5116-955X","id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","last_name":"Hilbe"},{"first_name":"Martin A.","full_name":"Nowak, Martin A.","last_name":"Nowak"}],"isi":1,"day":"13","ec_funded":1,"page":"1292–1302","volume":5,"article_type":"original","pmid":1,"quality_controlled":"1","file":[{"access_level":"open_access","date_created":"2023-11-07T08:27:23Z","file_name":"2021_NatureHumanBehaviour_Schmid_accepted.pdf","checksum":"34f55e173f90dc1dab731063458ac780","date_updated":"2023-11-07T08:27:23Z","relation":"main_file","file_id":"14496","content_type":"application/pdf","success":1,"file_size":5232761,"creator":"dernst"}],"publication_status":"published","fulldoi":"https://doi.org/10.1038/s41562-021-01114-8","publication":"Nature Human Behaviour","date_created":"2021-05-18T16:56:57Z","oa":1,"date_published":"2021-05-13T00:00:00Z","intvolume":"         5","related_material":{"link":[{"relation":"press_release","description":"News on IST Homepage","url":"https://ist.ac.at/en/news/the-emergence-of-cooperation/"}],"record":[{"relation":"dissertation_contains","status":"public","id":"10293"}]},"status":"public","year":"2021","issue":"10","type":"journal_article","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"05","scopus_import":"1","oa_version":"Submitted Version","project":[{"call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"}],"corr_author":"1","has_accepted_license":"1","department":[{"_id":"KrCh"},{"_id":"GradSch"}],"article_processing_charge":"No","file_date_updated":"2023-11-07T08:27:23Z","doi":"10.1038/s41562-021-01114-8","citation":{"apa":"Schmid, L., Chatterjee, K., Hilbe, C., &#38; Nowak, M. A. (2021). A unified framework of direct and indirect reciprocity. <i>Nature Human Behaviour</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41562-021-01114-8\">https://doi.org/10.1038/s41562-021-01114-8</a>","mla":"Schmid, Laura, et al. “A Unified Framework of Direct and Indirect Reciprocity.” <i>Nature Human Behaviour</i>, vol. 5, no. 10, Springer Nature, 2021, pp. 1292–1302, doi:<a href=\"https://doi.org/10.1038/s41562-021-01114-8\">10.1038/s41562-021-01114-8</a>.","ista":"Schmid L, Chatterjee K, Hilbe C, Nowak MA. 2021. A unified framework of direct and indirect reciprocity. Nature Human Behaviour. 5(10), 1292–1302.","ieee":"L. Schmid, K. Chatterjee, C. Hilbe, and M. A. Nowak, “A unified framework of direct and indirect reciprocity,” <i>Nature Human Behaviour</i>, vol. 5, no. 10. Springer Nature, pp. 1292–1302, 2021.","ama":"Schmid L, Chatterjee K, Hilbe C, Nowak MA. A unified framework of direct and indirect reciprocity. <i>Nature Human Behaviour</i>. 2021;5(10):1292–1302. doi:<a href=\"https://doi.org/10.1038/s41562-021-01114-8\">10.1038/s41562-021-01114-8</a>","short":"L. Schmid, K. Chatterjee, C. Hilbe, M.A. Nowak, Nature Human Behaviour 5 (2021) 1292–1302.","chicago":"Schmid, Laura, Krishnendu Chatterjee, Christian Hilbe, and Martin A. Nowak. “A Unified Framework of Direct and Indirect Reciprocity.” <i>Nature Human Behaviour</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1038/s41562-021-01114-8\">https://doi.org/10.1038/s41562-021-01114-8</a>."},"abstract":[{"lang":"eng","text":"Direct and indirect reciprocity are key mechanisms for the evolution of cooperation. Direct reciprocity means that individuals use their own experience to decide whether to cooperate with another person. Indirect reciprocity means that they also consider the experiences of others. Although these two mechanisms are intertwined, they are typically studied in isolation. Here, we introduce a mathematical framework that allows us to explore both kinds of reciprocity simultaneously. We show that the well-known ‘generous tit-for-tat’ strategy of direct reciprocity has a natural analogue in indirect reciprocity, which we call ‘generous scoring’. Using an equilibrium analysis, we characterize under which conditions either of the two strategies can maintain cooperation. With simulations, we additionally explore which kind of reciprocity evolves when members of a population engage in social learning to adapt to their environment. Our results draw unexpected connections between direct and indirect reciprocity while highlighting important differences regarding their evolvability."}],"publication_identifier":{"eissn":["2397-3374"]},"title":"A unified framework of direct and indirect reciprocity","_id":"9402","publisher":"Springer Nature","ddc":["000"],"date_updated":"2026-10-23T22:30:45Z","acknowledgement":"This work was supported by the European Research Council CoG 863818 (ForM-SMArt) (to K.C.), the European Research Council Start Grant 279307: Graph Games (to K.C.), and the European Research Council Starting Grant 850529: E-DIRECT (to C.H.). The funders had no role in study design, data collection and analysis, decision to publish or preparation of the manuscript.","external_id":{"isi":["000650304000002"],"pmid":["33986519"]}},{"publication_status":"published","fulldoi":"https://doi.org/10.15252/embr.202051813","publication":"EMBO Reports","tmp":{"image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"related_material":{"record":[{"status":"public","id":"10303","relation":"dissertation_contains"}]},"intvolume":"        22","year":"2021","status":"public","issue":"9","type":"journal_article","date_created":"2021-08-15T22:01:30Z","oa":1,"date_published":"2021-09-06T00:00:00Z","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","author":[{"last_name":"Vega","full_name":"Vega, Andrea","first_name":"Andrea"},{"full_name":"Fredes, Isabel","first_name":"Isabel","last_name":"Fredes"},{"first_name":"José","full_name":"O’Brien, José","last_name":"O’Brien"},{"first_name":"Zhouxin","full_name":"Shen, Zhouxin","last_name":"Shen"},{"first_name":"Krisztina","full_name":"Ötvös, Krisztina","orcid":"0000-0002-5503-4983","id":"29B901B0-F248-11E8-B48F-1D18A9856A87","last_name":"Ötvös"},{"orcid":"0000-0002-9357-9415","id":"4827E134-F248-11E8-B48F-1D18A9856A87","last_name":"Abualia","full_name":"Abualia, Rashed","first_name":"Rashed"},{"last_name":"Benková","orcid":"0000-0002-8510-9739","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","first_name":"Eva","full_name":"Benková, Eva"},{"full_name":"Briggs, Steven P.","first_name":"Steven P.","last_name":"Briggs"},{"last_name":"Gutiérrez","full_name":"Gutiérrez, Rodrigo A.","first_name":"Rodrigo A."}],"isi":1,"day":"06","article_type":"original","pmid":1,"quality_controlled":"1","file":[{"file_name":"2021_EmboR_Vega.pdf","access_level":"open_access","date_created":"2021-10-05T13:36:42Z","checksum":"750de03dc3b715c37090126c1548ba13","relation":"main_file","date_updated":"2021-10-05T13:36:42Z","success":1,"content_type":"application/pdf","file_id":"10090","creator":"cchlebak","file_size":3144854}],"volume":22,"article_processing_charge":"Yes","citation":{"apa":"Vega, A., Fredes, I., O’Brien, J., Shen, Z., Ötvös, K., Abualia, R., … Gutiérrez, R. A. (2021). Nitrate triggered phosphoproteome changes and a PIN2 phosphosite modulating root system architecture. <i>EMBO Reports</i>. Wiley. <a href=\"https://doi.org/10.15252/embr.202051813\">https://doi.org/10.15252/embr.202051813</a>","mla":"Vega, Andrea, et al. “Nitrate Triggered Phosphoproteome Changes and a PIN2 Phosphosite Modulating Root System Architecture.” <i>EMBO Reports</i>, vol. 22, no. 9, e51813, Wiley, 2021, doi:<a href=\"https://doi.org/10.15252/embr.202051813\">10.15252/embr.202051813</a>.","ama":"Vega A, Fredes I, O’Brien J, et al. Nitrate triggered phosphoproteome changes and a PIN2 phosphosite modulating root system architecture. <i>EMBO Reports</i>. 2021;22(9). doi:<a href=\"https://doi.org/10.15252/embr.202051813\">10.15252/embr.202051813</a>","chicago":"Vega, Andrea, Isabel Fredes, José O’Brien, Zhouxin Shen, Krisztina Ötvös, Rashed Abualia, Eva Benková, Steven P. Briggs, and Rodrigo A. Gutiérrez. “Nitrate Triggered Phosphoproteome Changes and a PIN2 Phosphosite Modulating Root System Architecture.” <i>EMBO Reports</i>. Wiley, 2021. <a href=\"https://doi.org/10.15252/embr.202051813\">https://doi.org/10.15252/embr.202051813</a>.","short":"A. Vega, I. Fredes, J. O’Brien, Z. Shen, K. Ötvös, R. Abualia, E. Benková, S.P. Briggs, R.A. Gutiérrez, EMBO Reports 22 (2021).","ista":"Vega A, Fredes I, O’Brien J, Shen Z, Ötvös K, Abualia R, Benková E, Briggs SP, Gutiérrez RA. 2021. Nitrate triggered phosphoproteome changes and a PIN2 phosphosite modulating root system architecture. EMBO Reports. 22(9), e51813.","ieee":"A. Vega <i>et al.</i>, “Nitrate triggered phosphoproteome changes and a PIN2 phosphosite modulating root system architecture,” <i>EMBO Reports</i>, vol. 22, no. 9. Wiley, 2021."},"file_date_updated":"2021-10-05T13:36:42Z","doi":"10.15252/embr.202051813","publication_identifier":{"eissn":["1469-3178"],"issn":["1469-221X"]},"abstract":[{"lang":"eng","text":"Nitrate commands genome-wide gene expression changes that impact metabolism, physiology, plant growth, and development. In an effort to identify new components involved in nitrate responses in plants, we analyze the Arabidopsis thaliana root phosphoproteome in response to nitrate treatments via liquid chromatography coupled to tandem mass spectrometry. 176 phosphoproteins show significant changes at 5 or 20 min after nitrate treatments. Proteins identified by 5 min include signaling components such as kinases or transcription factors. In contrast, by 20 min, proteins identified were associated with transporter activity or hormone metabolism functions, among others. The phosphorylation profile of NITRATE TRANSPORTER 1.1 (NRT1.1) mutant plants was significantly altered as compared to wild-type plants, confirming its key role in nitrate signaling pathways that involves phosphorylation changes. Integrative bioinformatics analysis highlights auxin transport as an important mechanism modulated by nitrate signaling at the post-translational level. We validated a new phosphorylation site in PIN2 and provide evidence that it functions in primary and lateral root growth responses to nitrate."}],"has_accepted_license":"1","department":[{"_id":"EvBe"},{"_id":"GradSch"}],"publisher":"Wiley","_id":"9913","ddc":["580"],"date_updated":"2026-10-23T22:30:48Z","acknowledgement":"This work was supported by ANID—Millennium Science Initiative Program—ICN17_022, Fondo de Desarrollo de Areas Prioritarias (FONDAP) Center for Genome Regulation (15090007), ANID—Fondo Nacional de Desarrollo Científico y Tecnológico (FONDECYT) 1180759 (to RAG) and 1171631 (to AV). We would like to thank Unidad de Microscopía Avanzada UC (UMA UC).","external_id":{"pmid":["34357701 "],"isi":["000681754200001"]},"title":"Nitrate triggered phosphoproteome changes and a PIN2 phosphosite modulating root system architecture","oa_version":"Published Version","language":[{"iso":"eng"}],"month":"09","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","article_number":"e51813"},{"date_published":"2021-11-22T00:00:00Z","oa":1,"date_created":"2021-11-18T11:20:59Z","type":"dissertation","year":"2021","status":"public","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"47"},{"relation":"part_of_dissertation","status":"public","id":"9913"},{"relation":"part_of_dissertation","status":"public","id":"9010"}]},"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"fulldoi":"https://doi.org/10.15479/at:ista:10303","publication_status":"published","supervisor":[{"last_name":"Benková","orcid":"0000-0002-8510-9739","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","first_name":"Eva","full_name":"Benková, Eva"}],"file":[{"file_id":"10331","content_type":"application/pdf","file_size":28005730,"creator":"rabualia","access_level":"open_access","date_created":"2021-11-22T14:48:21Z","file_name":"AbualiaPhDthesisfinalv3.pdf","checksum":"dea38b98aa4da1cea03dcd0f10862818","relation":"main_file","date_updated":"2022-12-20T23:30:06Z","embargo":"2022-11-23"},{"relation":"source_file","date_updated":"2022-12-20T23:30:06Z","checksum":"4cd62da5ec5ba4c32e61f0f6d9e61920","date_created":"2021-11-22T14:48:34Z","access_level":"closed","embargo_to":"open_access","file_name":"AbualiaPhDthesisfinalv3.docx","file_size":62841883,"creator":"rabualia","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_id":"10332"}],"day":"22","acknowledged_ssus":[{"_id":"LifeSc"},{"_id":"Bio"}],"author":[{"id":"4827E134-F248-11E8-B48F-1D18A9856A87","last_name":"Abualia","orcid":"0000-0002-9357-9415","full_name":"Abualia, Rashed","first_name":"Rashed"}],"page":"139","OA_place":"publisher","title":"Role of hormones in nitrate regulated growth","degree_awarded":"PhD","ddc":["580","581"],"date_updated":"2026-04-08T07:20:07Z","publisher":"Institute of Science and Technology Austria","_id":"10303","department":[{"_id":"GradSch"},{"_id":"EvBe"}],"has_accepted_license":"1","alternative_title":["ISTA Thesis"],"corr_author":"1","abstract":[{"text":"Nitrogen is an essential macronutrient determining plant growth, development and affecting agricultural productivity. Root, as a hub that perceives and integrates local and systemic signals on the plant’s external and endogenous nitrogen resources, communicates with other plant organs to consolidate their physiology and development in accordance with actual nitrogen balance. Over the last years, numerous studies demonstrated that these comprehensive developmental adaptations rely on the interaction between pathways controlling nitrogen homeostasis and hormonal networks acting globally in the plant body. However, molecular insights into how the information about the nitrogen status is translated through hormonal pathways into specific developmental output are lacking. In my work, I addressed so far poorly understood mechanisms underlying root-to-shoot communication that lead to a rapid re-adjustment of shoot growth and development after nitrate provision. Applying a combination of molecular, cell, and developmental biology approaches, genetics and grafting experiments as well as hormonal analytics, I identified and characterized an unknown molecular framework orchestrating shoot development with a root nitrate sensory system. ","lang":"eng"}],"publication_identifier":{"issn":["2663-337X"]},"file_date_updated":"2022-12-20T23:30:06Z","doi":"10.15479/at:ista:10303","citation":{"ista":"Abualia R. 2021. Role of hormones in nitrate regulated growth. Institute of Science and Technology Austria.","ieee":"R. Abualia, “Role of hormones in nitrate regulated growth,” Institute of Science and Technology Austria, 2021.","ama":"Abualia R. Role of hormones in nitrate regulated growth. 2021. doi:<a href=\"https://doi.org/10.15479/at:ista:10303\">10.15479/at:ista:10303</a>","chicago":"Abualia, Rashed. “Role of Hormones in Nitrate Regulated Growth.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/at:ista:10303\">https://doi.org/10.15479/at:ista:10303</a>.","short":"R. Abualia, Role of Hormones in Nitrate Regulated Growth, Institute of Science and Technology Austria, 2021.","apa":"Abualia, R. (2021). <i>Role of hormones in nitrate regulated growth</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:10303\">https://doi.org/10.15479/at:ista:10303</a>","mla":"Abualia, Rashed. <i>Role of Hormones in Nitrate Regulated Growth</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/at:ista:10303\">10.15479/at:ista:10303</a>."},"article_processing_charge":"No","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","month":"11","language":[{"iso":"eng"}],"oa_version":"Published Version"},{"alternative_title":["ISTA Thesis"],"corr_author":"1","has_accepted_license":"1","department":[{"_id":"KrCh"},{"_id":"GradSch"}],"article_processing_charge":"No","file_date_updated":"2021-12-23T23:30:04Z","doi":"10.15479/AT:ISTA:8934","citation":{"apa":"Goharshady, A. K. (2021). <i>Parameterized and algebro-geometric advances in static program analysis</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:8934\">https://doi.org/10.15479/AT:ISTA:8934</a>","mla":"Goharshady, Amir Kafshdar. <i>Parameterized and Algebro-Geometric Advances in Static Program Analysis</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8934\">10.15479/AT:ISTA:8934</a>.","ista":"Goharshady AK. 2021. Parameterized and algebro-geometric advances in static program analysis. Institute of Science and Technology Austria.","ieee":"A. K. Goharshady, “Parameterized and algebro-geometric advances in static program analysis,” Institute of Science and Technology Austria, 2021.","ama":"Goharshady AK. Parameterized and algebro-geometric advances in static program analysis. 2021. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8934\">10.15479/AT:ISTA:8934</a>","chicago":"Goharshady, Amir Kafshdar. “Parameterized and Algebro-Geometric Advances in Static Program Analysis.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/AT:ISTA:8934\">https://doi.org/10.15479/AT:ISTA:8934</a>.","short":"A.K. Goharshady, Parameterized and Algebro-Geometric Advances in Static Program Analysis, Institute of Science and Technology Austria, 2021."},"publication_identifier":{"issn":["2663-337X"]},"abstract":[{"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.","lang":"eng"}],"title":"Parameterized and algebro-geometric advances in static program analysis","publisher":"Institute of Science and Technology Austria","_id":"8934","ddc":["005"],"date_updated":"2026-04-16T10:07:18Z","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).","degree_awarded":"PhD","language":[{"iso":"eng"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","month":"01","oa_version":"Published Version","project":[{"name":"Quantitative Analysis of Probabilistic Systems with a focus on Crypto-Currencies","_id":"267066CE-B435-11E9-9278-68D0E5697425"},{"_id":"266EEEC0-B435-11E9-9278-68D0E5697425","name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts"}],"publication_status":"published","fulldoi":"https://doi.org/10.15479/AT:ISTA:8934","tmp":{"name":"Creative Commons Public Domain Dedication (CC0 1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","image":"/images/cc_0.png","short":"CC0 (1.0)"},"date_created":"2020-12-10T12:17:07Z","oa":1,"date_published":"2021-01-01T00:00:00Z","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"6490"},{"status":"public","relation":"part_of_dissertation","id":"6780"},{"status":"public","relation":"part_of_dissertation","id":"7158"},{"status":"public","id":"66","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"6378","status":"public"},{"id":"311","status":"public","relation":"part_of_dissertation"},{"status":"public","id":"6175","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"6340"},{"relation":"part_of_dissertation","status":"public","id":"7014"},{"status":"public","relation":"part_of_dissertation","id":"6009"},{"id":"1437","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"8728"},{"relation":"part_of_dissertation","status":"public","id":"8089"},{"status":"public","relation":"part_of_dissertation","id":"6380"},{"relation":"part_of_dissertation","id":"5977","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"6056"},{"relation":"part_of_dissertation","status":"public","id":"639"},{"relation":"part_of_dissertation","status":"public","id":"1386"},{"status":"public","relation":"part_of_dissertation","id":"6918"},{"relation":"part_of_dissertation","status":"public","id":"7810"},{"relation":"part_of_dissertation","id":"949","status":"public"}]},"status":"public","year":"2021","type":"dissertation","author":[{"first_name":"Amir Kafshdar","full_name":"Goharshady, Amir Kafshdar","last_name":"Goharshady","id":"391365CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1702-6584"}],"day":"01","OA_place":"publisher","license":"https://creativecommons.org/publicdomain/zero/1.0/","page":"278","supervisor":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"}],"file":[{"file_id":"8969","content_type":"application/pdf","creator":"akafshda","file_size":5251507,"file_name":"Thesis-pdfa.pdf","access_level":"open_access","date_created":"2020-12-22T20:08:44Z","embargo":"2021-12-22","checksum":"d1b9db3725aed34dadd81274aeb9426c","relation":"main_file","date_updated":"2021-12-23T23:30:04Z"},{"relation":"source_file","date_updated":"2021-03-04T23:30:04Z","checksum":"1661df7b393e6866d2460eba3c905130","embargo_to":"open_access","file_name":"source.zip","date_created":"2020-12-22T20:08:50Z","access_level":"closed","creator":"akafshda","file_size":10636756,"file_id":"8970","content_type":"application/zip"}]},{"day":"02","author":[{"full_name":"Hansen, Andi H","first_name":"Andi H","last_name":"Hansen","id":"38853E16-F248-11E8-B48F-1D18A9856A87"}],"page":"182","OA_place":"publisher","supervisor":[{"full_name":"Hippenmeyer, Simon","first_name":"Simon","id":"37B36620-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2279-1061","last_name":"Hippenmeyer"}],"file":[{"content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_id":"9971","file_size":10629190,"creator":"ahansen","date_created":"2021-08-30T09:17:39Z","access_level":"closed","embargo_to":"open_access","file_name":"Thesis_Hansen.docx","relation":"source_file","date_updated":"2022-09-03T22:30:04Z","checksum":"66b56f5b988b233dc66a4f4b4fb2cdfe"},{"creator":"ahansen","file_size":13457469,"content_type":"application/pdf","file_id":"9972","embargo":"2022-09-02","relation":"main_file","date_updated":"2022-09-03T22:30:04Z","checksum":"204fa40321a1c6289b68c473634c4bf3","file_name":"Thesis_Hansen_PDFA-1a.pdf","date_created":"2021-08-30T09:29:44Z","access_level":"open_access"}],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication_status":"published","fulldoi":"https://doi.org/10.15479/at:ista:9962","oa":1,"date_published":"2021-09-02T00:00:00Z","date_created":"2021-08-29T12:36:50Z","type":"dissertation","related_material":{"record":[{"id":"8569","status":"public","relation":"part_of_dissertation"},{"id":"960","status":"public","relation":"part_of_dissertation"}]},"year":"2021","status":"public","language":[{"iso":"eng"}],"month":"09","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","oa_version":"Published Version","project":[{"grant_number":"24812","_id":"2625A13E-B435-11E9-9278-68D0E5697425","name":"Molecular mechanisms of radial neuronal migration"}],"has_accepted_license":"1","department":[{"_id":"GradSch"},{"_id":"SiHi"}],"corr_author":"1","alternative_title":["ISTA Thesis"],"keyword":["Neuronal migration","Non-cell-autonomous","Cell-autonomous","Neurodevelopmental disease"],"citation":{"mla":"Hansen, Andi H. <i>Cell-Autonomous Gene Function and Non-Cell-Autonomous Effects in Radial Projection Neuron Migration</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/at:ista:9962\">10.15479/at:ista:9962</a>.","apa":"Hansen, A. H. (2021). <i>Cell-autonomous gene function and non-cell-autonomous effects in radial projection neuron migration</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:9962\">https://doi.org/10.15479/at:ista:9962</a>","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. <a href=\"https://doi.org/10.15479/at:ista:9962\">https://doi.org/10.15479/at:ista:9962</a>.","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.","ama":"Hansen AH. Cell-autonomous gene function and non-cell-autonomous effects in radial projection neuron migration. 2021. doi:<a href=\"https://doi.org/10.15479/at:ista:9962\">10.15479/at:ista:9962</a>","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."},"file_date_updated":"2022-09-03T22:30:04Z","doi":"10.15479/at:ista:9962","publication_identifier":{"issn":["2663-337X"]},"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."}],"article_processing_charge":"No","title":"Cell-autonomous gene function and non-cell-autonomous effects in radial projection neuron migration","degree_awarded":"PhD","publisher":"Institute of Science and Technology Austria","_id":"9962","date_updated":"2026-04-08T07:19:09Z","ddc":["570"]},{"oa_version":"Published Version","month":"06","language":[{"iso":"eng"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","_id":"9562","publisher":"Institute of Science and Technology Austria","date_updated":"2026-07-06T13:11:44Z","ddc":["570"],"degree_awarded":"PhD","title":"2B or not 2B: Hippocampal asymmetries mediated by NMDA receptor subunit GluN2B C-terminus and high-throughput image analysis by Deep-Learning","article_processing_charge":"No","doi":"10.15479/at:ista:9562","citation":{"mla":"Kleindienst, David. <i>2B or Not 2B: Hippocampal Asymmetries Mediated by NMDA Receptor Subunit GluN2B C-Terminus and High-Throughput Image Analysis by Deep-Learning</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/at:ista:9562\">10.15479/at:ista:9562</a>.","apa":"Kleindienst, D. (2021). <i>2B or not 2B: Hippocampal asymmetries mediated by NMDA receptor subunit GluN2B C-terminus and high-throughput image analysis by Deep-Learning</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:9562\">https://doi.org/10.15479/at:ista:9562</a>","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.","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. <a href=\"https://doi.org/10.15479/at:ista:9562\">https://doi.org/10.15479/at:ista:9562</a>.","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:<a href=\"https://doi.org/10.15479/at:ista:9562\">10.15479/at:ista:9562</a>","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."},"file_date_updated":"2022-07-02T22:30:04Z","publication_identifier":{"issn":["2663-337X"]},"abstract":[{"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.","lang":"eng"}],"corr_author":"1","alternative_title":["ISTA Thesis"],"has_accepted_license":"1","department":[{"_id":"GradSch"},{"_id":"RySh"}],"file":[{"creator":"dkleindienst","file_size":77299142,"file_id":"9563","content_type":"application/pdf","embargo":"2022-07-01","checksum":"659df5518db495f679cb1df9e9bd1d94","date_updated":"2022-07-02T22:30:04Z","relation":"main_file","file_name":"Thesis.pdf","access_level":"open_access","date_created":"2021-06-17T14:03:14Z"},{"date_updated":"2022-07-02T22:30:04Z","relation":"source_file","checksum":"3bcf63a2b19e5b6663be051bea332748","date_created":"2021-06-17T14:04:30Z","access_level":"closed","embargo_to":"open_access","file_name":"Thesis_source.zip","file_size":369804895,"creator":"dkleindienst","content_type":"application/zip","file_id":"9564"}],"supervisor":[{"id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8761-9444","last_name":"Shigemoto","full_name":"Shigemoto, Ryuichi","first_name":"Ryuichi"}],"OA_place":"publisher","page":"124","author":[{"first_name":"David","full_name":"Kleindienst, David","id":"42E121A4-F248-11E8-B48F-1D18A9856A87","last_name":"Kleindienst"}],"acknowledged_ssus":[{"_id":"EM-Fac"}],"day":"01","related_material":{"record":[{"id":"9437","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","id":"612","status":"public"},{"id":"8532","status":"public","relation":"part_of_dissertation"},{"status":"public","id":"9756","relation":"part_of_dissertation"}]},"year":"2021","status":"public","type":"dissertation","date_created":"2021-06-17T14:10:47Z","oa":1,"date_published":"2021-06-01T00:00:00Z","publication_status":"published","fulldoi":"https://doi.org/10.15479/at:ista:9562"},{"type":"journal_article","intvolume":"         5","related_material":{"record":[{"status":"public","id":"14622","relation":"dissertation_contains"}]},"year":"2021","status":"public","oa":1,"date_published":"2021-07-01T00:00:00Z","date_created":"2021-08-01T22:01:21Z","publication":"Quantum","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication_status":"published","arxiv":1,"fulldoi":"https://doi.org/10.22331/Q-2021-07-01-491","quality_controlled":"1","file":[{"creator":"cchlebak","file_size":2312482,"file_id":"9774","content_type":"application/pdf","date_updated":"2021-08-06T06:44:31Z","relation":"main_file","checksum":"9706c2bb8e748e9b5b138381995a7f6f","file_name":"2021_Quantum_Sack.pdf","date_created":"2021-08-06T06:44:31Z","access_level":"open_access"}],"article_type":"original","volume":5,"ec_funded":1,"day":"01","author":[{"first_name":"Stefan","full_name":"Sack, Stefan","last_name":"Sack","id":"dd622248-f6e0-11ea-865d-ce382a1c81a5","orcid":"0000-0001-5400-8508"},{"full_name":"Serbyn, Maksym","first_name":"Maksym","orcid":"0000-0002-2399-5827","last_name":"Serbyn","id":"47809E7E-F248-11E8-B48F-1D18A9856A87"}],"isi":1,"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).","external_id":{"arxiv":["2101.05742"],"isi":["000669830600001"]},"_id":"9760","publisher":"Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften","date_updated":"2026-10-23T22:31:10Z","ddc":["530"],"title":"Quantum annealing initialization of the quantum approximate optimization algorithm","file_date_updated":"2021-08-06T06:44:31Z","doi":"10.22331/Q-2021-07-01-491","citation":{"short":"S. Sack, M. Serbyn, Quantum 5 (2021).","chicago":"Sack, Stefan, and Maksym Serbyn. “Quantum Annealing Initialization of the Quantum Approximate Optimization Algorithm.” <i>Quantum</i>. Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften, 2021. <a href=\"https://doi.org/10.22331/Q-2021-07-01-491\">https://doi.org/10.22331/Q-2021-07-01-491</a>.","ama":"Sack S, Serbyn M. Quantum annealing initialization of the quantum approximate optimization algorithm. <i>Quantum</i>. 2021;5. doi:<a href=\"https://doi.org/10.22331/Q-2021-07-01-491\">10.22331/Q-2021-07-01-491</a>","ieee":"S. Sack and M. Serbyn, “Quantum annealing initialization of the quantum approximate optimization algorithm,” <i>Quantum</i>, 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.” <i>Quantum</i>, vol. 5, 491, Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften, 2021, doi:<a href=\"https://doi.org/10.22331/Q-2021-07-01-491\">10.22331/Q-2021-07-01-491</a>.","apa":"Sack, S., &#38; Serbyn, M. (2021). Quantum annealing initialization of the quantum approximate optimization algorithm. <i>Quantum</i>. Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften. <a href=\"https://doi.org/10.22331/Q-2021-07-01-491\">https://doi.org/10.22331/Q-2021-07-01-491</a>"},"abstract":[{"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.","lang":"eng"}],"publication_identifier":{"eissn":["2521-327X"]},"article_processing_charge":"Yes","has_accepted_license":"1","department":[{"_id":"GradSch"},{"_id":"MaSe"}],"corr_author":"1","project":[{"grant_number":"850899","name":"Non-Ergodic Quantum Matter: Universality, Dynamics and Control","_id":"23841C26-32DE-11EA-91FC-C7463DDC885E","call_identifier":"H2020"}],"article_number":"491","oa_version":"Published Version","scopus_import":"1","month":"07","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}]},{"scopus_import":"1","month":"03","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"oa_version":"Published Version","main_file_link":[{"open_access":"1","url":"https://openreview.net/forum?id=Bke61krFvS"}],"project":[{"grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"has_accepted_license":"1","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"corr_author":"1","citation":{"apa":"Lechner, M. (2020). Learning representations for binary-classification without backpropagation. In <i>8th International Conference on Learning Representations</i>. Virtual ; Addis Ababa, Ethiopia: ICLR.","mla":"Lechner, Mathias. “Learning Representations for Binary-Classification without Backpropagation.” <i>8th International Conference on Learning Representations</i>, ICLR, 2020.","ama":"Lechner M. Learning representations for binary-classification without backpropagation. In: <i>8th International Conference on Learning Representations</i>. ICLR; 2020.","short":"M. Lechner, in:, 8th International Conference on Learning Representations, ICLR, 2020.","chicago":"Lechner, Mathias. “Learning Representations for Binary-Classification without Backpropagation.” In <i>8th International Conference on Learning Representations</i>. ICLR, 2020.","ista":"Lechner M. 2020. Learning representations for binary-classification without backpropagation. 8th International Conference on Learning Representations. ICLR: International Conference on Learning Representations.","ieee":"M. Lechner, “Learning representations for binary-classification without backpropagation,” in <i>8th International Conference on Learning Representations</i>, Virtual ; Addis Ababa, Ethiopia, 2020."},"file_date_updated":"2022-01-26T07:35:17Z","abstract":[{"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.","lang":"eng"}],"article_processing_charge":"No","title":"Learning representations for binary-classification without backpropagation","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23\r\n(Wittgenstein Award).\r\n","_id":"10672","publisher":"ICLR","ddc":["000"],"date_updated":"2025-04-15T06:25:56Z","day":"11","author":[{"full_name":"Lechner, Mathias","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner"}],"license":"https://creativecommons.org/licenses/by-nc-nd/3.0/","quality_controlled":"1","file":[{"file_size":249431,"creator":"mlechner","content_type":"application/pdf","file_id":"10677","success":1,"checksum":"ea13d42dd4541ddb239b6a75821fd6c9","relation":"main_file","date_updated":"2022-01-26T07:35:17Z","access_level":"open_access","date_created":"2022-01-26T07:35:17Z","file_name":"iclr_2020.pdf"}],"conference":{"end_date":"2020-05-01","name":"ICLR: International Conference on Learning Representations","start_date":"2020-04-26","location":"Virtual ; Addis Ababa, Ethiopia"},"publication":"8th International Conference on Learning Representations","tmp":{"short":"CC BY-NC-ND (3.0)","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode"},"publication_status":"published","oa":1,"date_published":"2020-03-11T00:00:00Z","date_created":"2022-01-25T15:50:00Z","type":"conference","status":"public","year":"2020"},{"publication_status":"published","publication":"Proceedings of the 37th International Conference on Machine Learning","tmp":{"short":"CC BY-NC-ND (3.0)","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode"},"conference":{"location":"Virtual","start_date":"2020-07-12","name":"ML: Machine Learning","end_date":"2020-07-18"},"status":"public","year":"2020","type":"conference","date_created":"2022-01-25T15:50:34Z","oa":1,"date_published":"2020-01-01T00:00:00Z","page":"4082-4093","author":[{"full_name":"Hasani, Ramin","first_name":"Ramin","last_name":"Hasani"},{"first_name":"Mathias","full_name":"Lechner, Mathias","last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Amini","first_name":"Alexander","full_name":"Amini, Alexander"},{"last_name":"Rus","full_name":"Rus, Daniela","first_name":"Daniela"},{"full_name":"Grosu, Radu","first_name":"Radu","last_name":"Grosu"}],"quality_controlled":"1","file":[{"file_name":"2020_PMLR_Hasani.pdf","date_created":"2022-01-26T11:08:51Z","access_level":"open_access","relation":"main_file","date_updated":"2022-01-26T11:08:51Z","checksum":"c9a4a29161777fc1a89ef451c040e3b1","success":1,"file_id":"10691","content_type":"application/pdf","creator":"cchlebak","file_size":2329798}],"article_processing_charge":"No","citation":{"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.","chicago":"Hasani, Ramin, Mathias Lechner, Alexander Amini, Daniela Rus, and Radu Grosu. “A Natural Lottery Ticket Winner: Reinforcement Learning with Ordinary Neural Circuits.” In <i>Proceedings of the 37th International Conference on Machine Learning</i>, 4082–93. PMLR, 2020.","ama":"Hasani R, Lechner M, Amini A, Rus D, Grosu R. A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits. In: <i>Proceedings of the 37th International Conference on Machine Learning</i>. PMLR. ; 2020:4082-4093.","ieee":"R. Hasani, M. Lechner, A. Amini, D. Rus, and R. Grosu, “A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits,” in <i>Proceedings of the 37th International Conference on Machine Learning</i>, 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.” <i>Proceedings of the 37th International Conference on Machine Learning</i>, 2020, pp. 4082–93.","apa":"Hasani, R., Lechner, M., Amini, A., Rus, D., &#38; Grosu, R. (2020). A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits. In <i>Proceedings of the 37th International Conference on Machine Learning</i> (pp. 4082–4093). Virtual."},"file_date_updated":"2022-01-26T11:08:51Z","abstract":[{"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.","lang":"eng"}],"publication_identifier":{"issn":["2640-3498"]},"alternative_title":["PMLR"],"series_title":"PMLR","has_accepted_license":"1","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"_id":"10673","date_updated":"2025-04-15T06:25:56Z","ddc":["000"],"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","title":"A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits","main_file_link":[{"url":"http://proceedings.mlr.press/v119/hasani20a.html","open_access":"1"}],"oa_version":"Published Version","language":[{"iso":"eng"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","scopus_import":"1","project":[{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211"}]},{"page":"251-297","day":"01","author":[{"first_name":"Sebastian","full_name":"Hensel, Sebastian","last_name":"Hensel","id":"4D23B7DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7252-8072"},{"first_name":"Tommaso","full_name":"Rosati, Tommaso","last_name":"Rosati"}],"isi":1,"quality_controlled":"1","article_type":"original","volume":252,"publication":"Studia Mathematica","arxiv":1,"publication_status":"published","fulldoi":"https://doi.org/10.4064/sm180411-11-2","issue":"3","type":"journal_article","intvolume":"       252","year":"2020","status":"public","oa":1,"date_published":"2020-03-01T00:00:00Z","date_created":"2021-02-25T08:55:03Z","oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1709.05202"}],"scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"03","language":[{"iso":"eng"}],"doi":"10.4064/sm180411-11-2","citation":{"short":"S. Hensel, T. Rosati, Studia Mathematica 252 (2020) 251–297.","chicago":"Hensel, Sebastian, and Tommaso Rosati. “Modelled Distributions of Triebel–Lizorkin Type.” <i>Studia Mathematica</i>. Instytut Matematyczny, 2020. <a href=\"https://doi.org/10.4064/sm180411-11-2\">https://doi.org/10.4064/sm180411-11-2</a>.","ama":"Hensel S, Rosati T. Modelled distributions of Triebel–Lizorkin type. <i>Studia Mathematica</i>. 2020;252(3):251-297. doi:<a href=\"https://doi.org/10.4064/sm180411-11-2\">10.4064/sm180411-11-2</a>","ieee":"S. Hensel and T. Rosati, “Modelled distributions of Triebel–Lizorkin type,” <i>Studia Mathematica</i>, 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.” <i>Studia Mathematica</i>, vol. 252, no. 3, Instytut Matematyczny, 2020, pp. 251–97, doi:<a href=\"https://doi.org/10.4064/sm180411-11-2\">10.4064/sm180411-11-2</a>.","apa":"Hensel, S., &#38; Rosati, T. (2020). Modelled distributions of Triebel–Lizorkin type. <i>Studia Mathematica</i>. Instytut Matematyczny. <a href=\"https://doi.org/10.4064/sm180411-11-2\">https://doi.org/10.4064/sm180411-11-2</a>"},"publication_identifier":{"issn":["0039-3223"],"eissn":["1730-6337"]},"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","department":[{"_id":"JuFi"},{"_id":"GradSch"}],"keyword":["General Mathematics"],"external_id":{"isi":["000558100500002"],"arxiv":["1709.05202"]},"publisher":"Instytut Matematyczny","_id":"9196","date_updated":"2025-06-24T12:07:06Z","title":"Modelled distributions of Triebel–Lizorkin type"},{"related_material":{"record":[{"id":"5751","status":"public","relation":"dissertation_contains"},{"status":"public","relation":"dissertation_contains","id":"7210"},{"id":"7212","status":"public","relation":"dissertation_contains"}]},"year":"2020","status":"public","type":"dissertation","date_created":"2019-12-20T12:26:36Z","oa":1,"date_published":"2020-01-12T00:00:00Z","publication_status":"published","fulldoi":"https://doi.org/10.15479/AT:ISTA:7196","file":[{"creator":"jtkadlec","file_size":21100497,"file_id":"7255","content_type":"application/zip","checksum":"451f8e64b0eb26bf297644ac72bfcbe9","relation":"source_file","date_updated":"2020-07-14T12:47:52Z","file_name":"thesis.zip","access_level":"closed","date_created":"2020-01-12T11:49:49Z"},{"file_name":"2020_Tkadlec_Thesis.pdf","access_level":"open_access","date_created":"2020-01-28T07:32:42Z","checksum":"d8c44cbc4f939c49a8efc9d4b8bb3985","date_updated":"2020-07-14T12:47:52Z","relation":"main_file","content_type":"application/pdf","file_id":"7367","creator":"dernst","file_size":11670983}],"supervisor":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"}],"OA_place":"publisher","page":"144","author":[{"first_name":"Josef","full_name":"Tkadlec, Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","last_name":"Tkadlec","orcid":"0000-0002-1097-9684"}],"day":"12","_id":"7196","publisher":"Institute of Science and Technology Austria","ddc":["519"],"date_updated":"2026-04-16T08:32:37Z","degree_awarded":"PhD","title":"A role of graphs in evolutionary processes","article_processing_charge":"No","doi":"10.15479/AT:ISTA:7196","citation":{"apa":"Tkadlec, J. (2020). <i>A role of graphs in evolutionary processes</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:7196\">https://doi.org/10.15479/AT:ISTA:7196</a>","mla":"Tkadlec, Josef. <i>A Role of Graphs in Evolutionary Processes</i>. Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:7196\">10.15479/AT:ISTA:7196</a>.","ista":"Tkadlec J. 2020. A role of graphs in evolutionary processes. Institute of Science and Technology Austria.","ieee":"J. Tkadlec, “A role of graphs in evolutionary processes,” Institute of Science and Technology Austria, 2020.","ama":"Tkadlec J. A role of graphs in evolutionary processes. 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:7196\">10.15479/AT:ISTA:7196</a>","short":"J. Tkadlec, A Role of Graphs in Evolutionary Processes, Institute of Science and Technology Austria, 2020.","chicago":"Tkadlec, Josef. “A Role of Graphs in Evolutionary Processes.” Institute of Science and Technology Austria, 2020. <a href=\"https://doi.org/10.15479/AT:ISTA:7196\">https://doi.org/10.15479/AT:ISTA:7196</a>."},"file_date_updated":"2020-07-14T12:47:52Z","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."}],"publication_identifier":{"eissn":["2663-337X"]},"corr_author":"1","alternative_title":["ISTA Thesis"],"has_accepted_license":"1","department":[{"_id":"KrCh"},{"_id":"GradSch"}],"oa_version":"Published Version","language":[{"iso":"eng"}],"month":"01","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd"},{"file_date_updated":"2020-07-14T12:47:58Z","citation":{"apa":"Ölsböck, K. (2020). <i>The hole system of triangulated shapes</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:7460\">https://doi.org/10.15479/AT:ISTA:7460</a>","mla":"Ölsböck, Katharina. <i>The Hole System of Triangulated Shapes</i>. Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:7460\">10.15479/AT:ISTA:7460</a>.","ama":"Ölsböck K. The hole system of triangulated shapes. 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:7460\">10.15479/AT:ISTA:7460</a>","chicago":"Ölsböck, Katharina. “The Hole System of Triangulated Shapes.” Institute of Science and Technology Austria, 2020. <a href=\"https://doi.org/10.15479/AT:ISTA:7460\">https://doi.org/10.15479/AT:ISTA:7460</a>.","short":"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.","ieee":"K. Ölsböck, “The hole system of triangulated shapes,” Institute of Science and Technology Austria, 2020."},"doi":"10.15479/AT:ISTA:7460","publication_identifier":{"issn":["2663-337X"]},"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."}],"article_processing_charge":"No","has_accepted_license":"1","department":[{"_id":"HeEd"},{"_id":"GradSch"}],"corr_author":"1","alternative_title":["ISTA Thesis"],"keyword":["shape reconstruction","hole manipulation","ordered complexes","Alpha complex","Wrap complex","computational topology","Bregman geometry"],"degree_awarded":"PhD","publisher":"Institute of Science and Technology Austria","_id":"7460","date_updated":"2026-04-08T07:23:21Z","ddc":["514"],"title":"The hole system of triangulated shapes","oa_version":"Published Version","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","month":"02","language":[{"iso":"eng"}],"tmp":{"short":"CC BY-NC-SA (4.0)","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)"},"publication_status":"published","fulldoi":"https://doi.org/10.15479/AT:ISTA:7460","type":"dissertation","related_material":{"record":[{"status":"public","id":"6608","relation":"part_of_dissertation"}]},"year":"2020","status":"public","oa":1,"date_published":"2020-02-10T00:00:00Z","date_created":"2020-02-06T14:56:53Z","license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","page":"155","OA_place":"publisher","day":"10","author":[{"full_name":"Ölsböck, Katharina","first_name":"Katharina","id":"4D4AA390-F248-11E8-B48F-1D18A9856A87","last_name":"Ölsböck","orcid":"0000-0002-4672-8297"}],"file":[{"date_updated":"2020-07-14T12:47:58Z","relation":"main_file","checksum":"1df9f8c530b443c0e63a3f2e4fde412e","file_name":"thesis_ist-final_noack.pdf","date_created":"2020-02-06T14:43:54Z","access_level":"open_access","creator":"koelsboe","file_size":76195184,"content_type":"application/pdf","file_id":"7461"},{"content_type":"application/x-zip-compressed","file_id":"7462","description":"latex source files, figures","creator":"koelsboe","file_size":122103715,"file_name":"latex-files.zip","access_level":"closed","date_created":"2020-02-06T14:52:45Z","checksum":"7a52383c812b0be64d3826546509e5a4","date_updated":"2020-07-14T12:47:58Z","relation":"source_file"}],"supervisor":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","first_name":"Herbert"}]},{"_id":"7514","publisher":"Institute of Science and Technology Austria","date_updated":"2026-04-08T07:25:40Z","ddc":["510"],"degree_awarded":"PhD","title":"The free energy of a dilute two-dimensional Bose gas","article_processing_charge":"No","doi":"10.15479/AT:ISTA:7514","citation":{"apa":"Mayer, S. (2020). <i>The free energy of a dilute two-dimensional Bose gas</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:7514\">https://doi.org/10.15479/AT:ISTA:7514</a>","mla":"Mayer, Simon. <i>The Free Energy of a Dilute Two-Dimensional Bose Gas</i>. Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:7514\">10.15479/AT:ISTA:7514</a>.","ista":"Mayer S. 2020. The free energy of a dilute two-dimensional Bose gas. Institute of Science and Technology Austria.","ieee":"S. Mayer, “The free energy of a dilute two-dimensional Bose gas,” Institute of Science and Technology Austria, 2020.","ama":"Mayer S. The free energy of a dilute two-dimensional Bose gas. 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:7514\">10.15479/AT:ISTA:7514</a>","chicago":"Mayer, Simon. “The Free Energy of a Dilute Two-Dimensional Bose Gas.” Institute of Science and Technology Austria, 2020. <a href=\"https://doi.org/10.15479/AT:ISTA:7514\">https://doi.org/10.15479/AT:ISTA:7514</a>.","short":"S. Mayer, The Free Energy of a Dilute Two-Dimensional Bose Gas, Institute of Science and Technology Austria, 2020."},"file_date_updated":"2020-07-14T12:47:59Z","publication_identifier":{"issn":["2663-337X"]},"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."}],"corr_author":"1","alternative_title":["ISTA Thesis"],"has_accepted_license":"1","department":[{"_id":"RoSe"},{"_id":"GradSch"}],"project":[{"_id":"25C6DC12-B435-11E9-9278-68D0E5697425","name":"Analysis of quantum many-body systems","call_identifier":"H2020","grant_number":"694227"}],"oa_version":"Published Version","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","language":[{"iso":"eng"}],"month":"02","related_material":{"record":[{"id":"7524","status":"public","relation":"part_of_dissertation"}]},"year":"2020","status":"public","type":"dissertation","date_created":"2020-02-24T09:17:27Z","oa":1,"date_published":"2020-02-24T00:00:00Z","publication_status":"published","fulldoi":"https://doi.org/10.15479/AT:ISTA:7514","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"checksum":"b4de7579ddc1dbdd44ff3f17c48395f6","relation":"main_file","date_updated":"2020-07-14T12:47:59Z","access_level":"open_access","date_created":"2020-02-24T09:15:06Z","file_name":"thesis.pdf","file_size":1563429,"creator":"dernst","content_type":"application/pdf","file_id":"7515"},{"file_id":"7516","content_type":"application/x-zip-compressed","file_size":2028038,"creator":"dernst","date_created":"2020-02-24T09:15:16Z","access_level":"closed","file_name":"thesis_source.zip","date_updated":"2020-07-14T12:47:59Z","relation":"source_file","checksum":"ad7425867b52d7d9e72296e87bc9cb67"}],"supervisor":[{"first_name":"Robert","full_name":"Seiringer, Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521","last_name":"Seiringer"}],"ec_funded":1,"OA_place":"publisher","page":"148","author":[{"id":"30C4630A-F248-11E8-B48F-1D18A9856A87","last_name":"Mayer","first_name":"Simon","full_name":"Mayer, Simon"}],"day":"24"},{"publisher":"Association for Computing Machinery","_id":"8382","date_updated":"2026-07-28T09:50:30Z","external_id":{"isi":["001436693500004"]},"title":"Long-lived snapshots with polylogarithmic amortized step complexity","article_processing_charge":"No","doi":"10.1145/3382734.3406005","citation":{"mla":"Baig, Mirza Ahad, et al. “Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity.” <i>Proceedings of the 39th Symposium on Principles of Distributed Computing</i>, Association for Computing Machinery, 2020, pp. 31–40, doi:<a href=\"https://doi.org/10.1145/3382734.3406005\">10.1145/3382734.3406005</a>.","apa":"Baig, M. A., Hendler, D., Milani, A., &#38; Travers, C. (2020). Long-lived snapshots with polylogarithmic amortized step complexity. In <i>Proceedings of the 39th Symposium on Principles of Distributed Computing</i> (pp. 31–40). Virtual, Italy: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3382734.3406005\">https://doi.org/10.1145/3382734.3406005</a>","ieee":"M. A. Baig, D. Hendler, A. Milani, and C. Travers, “Long-lived snapshots with polylogarithmic amortized step complexity,” in <i>Proceedings of the 39th Symposium on Principles of Distributed Computing</i>, 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.","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.","chicago":"Baig, Mirza Ahad, Danny Hendler, Alessia Milani, and Corentin Travers. “Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity.” In <i>Proceedings of the 39th Symposium on Principles of Distributed Computing</i>, 31–40. Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3382734.3406005\">https://doi.org/10.1145/3382734.3406005</a>.","ama":"Baig MA, Hendler D, Milani A, Travers C. Long-lived snapshots with polylogarithmic amortized step complexity. In: <i>Proceedings of the 39th Symposium on Principles of Distributed Computing</i>. Association for Computing Machinery; 2020:31-40. doi:<a href=\"https://doi.org/10.1145/3382734.3406005\">10.1145/3382734.3406005</a>"},"publication_identifier":{"isbn":["9781450375825"]},"abstract":[{"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.","lang":"eng"}],"department":[{"_id":"GradSch"}],"main_file_link":[{"url":"https://hal.archives-ouvertes.fr/hal-02860087/document","open_access":"1"}],"oa_version":"Preprint","language":[{"iso":"eng"}],"month":"07","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","status":"public","year":"2020","type":"conference","date_created":"2020-09-13T22:01:17Z","oa":1,"date_published":"2020-07-31T00:00:00Z","publication_status":"published","fulldoi":"https://doi.org/10.1145/3382734.3406005","publication":"Proceedings of the 39th Symposium on Principles of Distributed Computing","conference":{"name":"PODC: Principles of Distributed Computing","end_date":"2020-08-07","start_date":"2020-08-03","location":"Virtual, Italy"},"quality_controlled":"1","das_tickbox":"1","page":"31-40","author":[{"id":"3EDE6DE4-AA5A-11E9-986D-341CE6697425","last_name":"Baig","first_name":"Mirza Ahad","full_name":"Baig, Mirza Ahad"},{"last_name":"Hendler","full_name":"Hendler, Danny","first_name":"Danny"},{"full_name":"Milani, Alessia","first_name":"Alessia","last_name":"Milani"},{"full_name":"Travers, Corentin","first_name":"Corentin","last_name":"Travers"}],"isi":1,"day":"31"},{"oa":1,"date_published":"2020-05-25T00:00:00Z","date_created":"2020-05-26T14:08:55Z","type":"dissertation","related_material":{"record":[{"id":"6677","status":"public","relation":"part_of_dissertation"}]},"status":"public","year":"2020","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication_status":"published","fulldoi":"https://doi.org/10.15479/AT:ISTA:7896","supervisor":[{"full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654"}],"file":[{"content_type":"application/pdf","file_id":"7897","creator":"dernst","file_size":1622742,"file_name":"2020_Thesis_Kamath.pdf","access_level":"open_access","date_created":"2020-05-26T14:08:13Z","checksum":"b39e2e1c376f5819b823fb7077491c64","relation":"main_file","date_updated":"2020-07-14T12:48:04Z"},{"file_id":"7898","content_type":"application/x-zip-compressed","file_size":15301529,"creator":"dernst","access_level":"closed","date_created":"2020-05-26T14:08:23Z","file_name":"Thesis_Kamath.zip","checksum":"8b26ba729c1a85ac6bea775f5d73cdc7","date_updated":"2020-07-14T12:48:04Z","relation":"source_file"}],"day":"25","author":[{"full_name":"Kamath Hosdurg, Chethan","first_name":"Chethan","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87","last_name":"Kamath Hosdurg","orcid":"0009-0006-6812-7317"}],"doi_confirm":"1","page":"126","ec_funded":1,"OA_place":"publisher","title":"On the average-case hardness of total search problems","degree_awarded":"PhD","publisher":"Institute of Science and Technology Austria","_id":"7896","date_updated":"2026-07-30T13:43:53Z","ddc":["000"],"has_accepted_license":"1","department":[{"_id":"KrPi"},{"_id":"GradSch"}],"alternative_title":["ISTA Thesis"],"corr_author":"1","citation":{"apa":"Kamath Hosdurg, C. (2020). <i>On the average-case hardness of total search problems</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:7896\">https://doi.org/10.15479/AT:ISTA:7896</a>","mla":"Kamath Hosdurg, Chethan. <i>On the Average-Case Hardness of Total Search Problems</i>. Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:7896\">10.15479/AT:ISTA:7896</a>.","ista":"Kamath Hosdurg C. 2020. On the average-case hardness of total search problems. Institute of Science and Technology Austria.","ieee":"C. Kamath Hosdurg, “On the average-case hardness of total search problems,” Institute of Science and Technology Austria, 2020.","ama":"Kamath Hosdurg C. On the average-case hardness of total search problems. 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:7896\">10.15479/AT:ISTA:7896</a>","short":"C. Kamath Hosdurg, On the Average-Case Hardness of Total Search Problems, Institute of Science and Technology Austria, 2020.","chicago":"Kamath Hosdurg, Chethan. “On the Average-Case Hardness of Total Search Problems.” Institute of Science and Technology Austria, 2020. <a href=\"https://doi.org/10.15479/AT:ISTA:7896\">https://doi.org/10.15479/AT:ISTA:7896</a>."},"file_date_updated":"2020-07-14T12:48:04Z","doi":"10.15479/AT:ISTA:7896","publication_identifier":{"issn":["2663-337X"]},"abstract":[{"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. ","lang":"eng"}],"article_processing_charge":"No","project":[{"grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425","name":"Provable Security for Physical Cryptography","call_identifier":"FP7"},{"grant_number":"682815","name":"Teaching Old Crypto New Tricks","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","month":"05","language":[{"iso":"eng"}],"oa_version":"Published Version"},{"article_processing_charge":"No","doi":"10.1145/3360550","citation":{"mla":"Chatterjee, Krishnendu, et al. “Value-Centric Dynamic Partial Order Reduction.” <i>Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications</i>, vol. 3, 124, ACM, 2019, doi:<a href=\"https://doi.org/10.1145/3360550\">10.1145/3360550</a>.","apa":"Chatterjee, K., Pavlogiannis, A., &#38; Toman, V. (2019). Value-centric dynamic partial order reduction. In <i>Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications</i> (Vol. 3). Athens, Greece: ACM. <a href=\"https://doi.org/10.1145/3360550\">https://doi.org/10.1145/3360550</a>","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.","chicago":"Chatterjee, Krishnendu, Andreas Pavlogiannis, and Viktor Toman. “Value-Centric Dynamic Partial Order Reduction.” In <i>Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications</i>, Vol. 3. ACM, 2019. <a href=\"https://doi.org/10.1145/3360550\">https://doi.org/10.1145/3360550</a>.","ama":"Chatterjee K, Pavlogiannis A, Toman V. Value-centric dynamic partial order reduction. In: <i>Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications</i>. Vol 3. ACM; 2019. doi:<a href=\"https://doi.org/10.1145/3360550\">10.1145/3360550</a>","ieee":"K. Chatterjee, A. Pavlogiannis, and V. Toman, “Value-centric dynamic partial order reduction,” in <i>Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications</i>, 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."},"file_date_updated":"2021-11-12T11:41:56Z","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."}],"publication_identifier":{"eissn":["2475-1421"]},"corr_author":"1","keyword":["safety","risk","reliability and quality","software"],"has_accepted_license":"1","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"publisher":"ACM","_id":"10190","date_updated":"2026-04-08T07:00:31Z","ddc":["000"],"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","external_id":{"arxiv":["1909.00989"]},"title":"Value-centric dynamic partial order reduction","oa_version":"Published Version","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"10","scopus_import":"1","project":[{"grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11407"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","name":"Moderne Concurrency Paradigms","call_identifier":"FWF"}],"article_number":"124","publication_status":"published","arxiv":1,"fulldoi":"https://doi.org/10.1145/3360550","publication":"Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"conference":{"location":"Athens, Greece","start_date":"2019-10-23","name":"OOPSLA: Object-oriented Programming, Systems, Languages and Applications","end_date":"2019-10-25"},"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"10199"}]},"intvolume":"         3","status":"public","year":"2019","type":"conference","date_created":"2021-10-27T14:57:06Z","oa":1,"date_published":"2019-10-10T00:00:00Z","OA_place":"publisher","author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"first_name":"Andreas","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis"},{"full_name":"Toman, Viktor","first_name":"Viktor","id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87","last_name":"Toman","orcid":"0000-0001-9036-063X"}],"day":"10","OA_type":"hybrid","quality_controlled":"1","file":[{"file_name":"2019_ACM_Chatterjee.pdf","access_level":"open_access","date_created":"2021-11-12T11:41:56Z","checksum":"2149979c46964c4d117af06ccb6c0834","date_updated":"2021-11-12T11:41:56Z","relation":"main_file","success":1,"content_type":"application/pdf","file_id":"10278","creator":"cchlebak","file_size":570829}],"volume":3},{"page":"375","OA_place":"publisher","ec_funded":1,"day":"18","author":[{"id":"408ED176-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2904-1856","last_name":"Schröder","full_name":"Schröder, Dominik J","first_name":"Dominik J"}],"doi_confirm":"1","file":[{"checksum":"6926f66f28079a81c4937e3764be00fc","relation":"source_file","date_updated":"2020-07-14T12:47:21Z","access_level":"closed","date_created":"2019-03-28T08:53:52Z","file_name":"2019_Schroeder_Thesis.tar.gz","file_size":7104482,"creator":"dernst","file_id":"6180","content_type":"application/x-gzip"},{"file_name":"2019_Schroeder_Thesis.pdf","access_level":"open_access","date_created":"2019-03-28T08:53:52Z","checksum":"7d0ebb8d1207e89768cdd497a5bf80fb","date_updated":"2020-07-14T12:47:21Z","relation":"main_file","file_id":"6181","content_type":"application/pdf","creator":"dernst","file_size":4228794}],"supervisor":[{"full_name":"Erdös, László","first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös","orcid":"0000-0001-5366-9603"}],"fulldoi":"https://doi.org/10.15479/AT:ISTA:th6179","publication_status":"published","type":"dissertation","status":"public","year":"2019","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"6184"},{"relation":"part_of_dissertation","status":"public","id":"6186"},{"status":"public","relation":"part_of_dissertation","id":"6185"},{"relation":"part_of_dissertation","status":"public","id":"1012"},{"relation":"part_of_dissertation","id":"1144","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"6182"}]},"date_published":"2019-03-18T00:00:00Z","oa":1,"date_created":"2019-03-28T08:58:59Z","oa_version":"Published Version","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","language":[{"iso":"eng"}],"month":"03","project":[{"call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","name":"Random matrices, universality and disordered quantum systems","grant_number":"338804"}],"publication_identifier":{"issn":["2663-337X"]},"abstract":[{"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.","lang":"eng"}],"doi":"10.15479/AT:ISTA:th6179","citation":{"ista":"Schröder DJ. 2019. From Dyson to Pearcey: Universal statistics in random matrix theory. Institute of Science and Technology Austria.","ieee":"D. J. Schröder, “From Dyson to Pearcey: Universal statistics in random matrix theory,” Institute of Science and Technology Austria, 2019.","ama":"Schröder DJ. From Dyson to Pearcey: Universal statistics in random matrix theory. 2019. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th6179\">10.15479/AT:ISTA:th6179</a>","chicago":"Schröder, Dominik J. “From Dyson to Pearcey: Universal Statistics in Random Matrix Theory.” Institute of Science and Technology Austria, 2019. <a href=\"https://doi.org/10.15479/AT:ISTA:th6179\">https://doi.org/10.15479/AT:ISTA:th6179</a>.","short":"D.J. Schröder, From Dyson to Pearcey: Universal Statistics in Random Matrix Theory, Institute of Science and Technology Austria, 2019.","apa":"Schröder, D. J. (2019). <i>From Dyson to Pearcey: Universal statistics in random matrix theory</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:th6179\">https://doi.org/10.15479/AT:ISTA:th6179</a>","mla":"Schröder, Dominik J. <i>From Dyson to Pearcey: Universal Statistics in Random Matrix Theory</i>. Institute of Science and Technology Austria, 2019, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th6179\">10.15479/AT:ISTA:th6179</a>."},"file_date_updated":"2020-07-14T12:47:21Z","article_processing_charge":"No","department":[{"_id":"LaEr"},{"_id":"GradSch"}],"has_accepted_license":"1","alternative_title":["ISTA Thesis"],"corr_author":"1","degree_awarded":"PhD","ddc":["515","519"],"date_updated":"2026-07-29T13:46:20Z","publisher":"Institute of Science and Technology Austria","_id":"6179","title":"From Dyson to Pearcey: Universal statistics in random matrix theory"},{"language":[{"iso":"eng"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","month":"08","oa_version":"Published Version","alternative_title":["ISTA Thesis"],"corr_author":"1","has_accepted_license":"1","department":[{"_id":"JoCs"},{"_id":"GradSch"}],"article_processing_charge":"No","doi":"10.15479/AT:ISTA:6825","citation":{"apa":"Käfer, K. (2019). <i>The hippocampus and medial prefrontal cortex during flexible behavior</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:6825\">https://doi.org/10.15479/AT:ISTA:6825</a>","mla":"Käfer, Karola. <i>The Hippocampus and Medial Prefrontal Cortex during Flexible Behavior</i>. Institute of Science and Technology Austria, 2019, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:6825\">10.15479/AT:ISTA:6825</a>.","ista":"Käfer K. 2019. The hippocampus and medial prefrontal cortex during flexible behavior. Institute of Science and Technology Austria.","ieee":"K. Käfer, “The hippocampus and medial prefrontal cortex during flexible behavior,” Institute of Science and Technology Austria, 2019.","ama":"Käfer K. The hippocampus and medial prefrontal cortex during flexible behavior. 2019. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:6825\">10.15479/AT:ISTA:6825</a>","short":"K. Käfer, The Hippocampus and Medial Prefrontal Cortex during Flexible Behavior, Institute of Science and Technology Austria, 2019.","chicago":"Käfer, Karola. “The Hippocampus and Medial Prefrontal Cortex during Flexible Behavior.” Institute of Science and Technology Austria, 2019. <a href=\"https://doi.org/10.15479/AT:ISTA:6825\">https://doi.org/10.15479/AT:ISTA:6825</a>."},"file_date_updated":"2024-04-10T22:30:48Z","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. "}],"publication_identifier":{"issn":["2663-337X"]},"title":"The hippocampus and medial prefrontal cortex during flexible behavior","publisher":"Institute of Science and Technology Austria","_id":"6825","date_updated":"2026-04-08T13:56:14Z","ddc":["570"],"degree_awarded":"PhD","author":[{"last_name":"Käfer","id":"2DAA49AA-F248-11E8-B48F-1D18A9856A87","full_name":"Käfer, Karola","first_name":"Karola"}],"day":"24","OA_place":"publisher","page":"89","supervisor":[{"last_name":"Csicsvari","orcid":"0000-0002-5193-4036","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","first_name":"Jozsef L","full_name":"Csicsvari, Jozsef L"}],"file":[{"date_created":"2019-09-03T08:07:13Z","access_level":"open_access","file_name":"Thesis_Kaefer_PDFA.pdf","date_updated":"2020-09-06T22:30:03Z","relation":"main_file","checksum":"2664420e332a33338568f4f3bfc59287","embargo":"2020-09-05","content_type":"application/pdf","file_id":"6846","request_a_copy":0,"file_size":3205202,"creator":"kkaefer"},{"content_type":"application/zip","file_id":"6847","creator":"kkaefer","file_size":2506835,"file_name":"Thesis_Kaefer.zip","embargo_to":"open_access","access_level":"closed","date_created":"2019-09-03T08:07:17Z","checksum":"9a154eab6f07aa590a3d2651dc0d926a","relation":"source_file","date_updated":"2024-04-10T22:30:48Z"}],"publication_status":"published","fulldoi":"https://doi.org/10.15479/AT:ISTA:6825","date_created":"2019-08-21T15:00:57Z","oa":1,"date_published":"2019-08-24T00:00:00Z","related_material":{"record":[{"relation":"part_of_dissertation","id":"5949","status":"public"}]},"status":"public","year":"2019","type":"dissertation"}]