[{"has_accepted_license":"1","_id":"10135","type":"dissertation","file_date_updated":"2022-12-20T23:30:05Z","language":[{"iso":"eng"}],"date_published":"2021-10-13T00:00:00Z","article_processing_charge":"No","title":"Molecular mechanisms of the cytokinin-regulated endomembrane trafficking to coordinate plant organogenesis","department":[{"_id":"GradSch"},{"_id":"EvBe"}],"supervisor":[{"last_name":"Benková","full_name":"Benková, Eva","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","first_name":"Eva","orcid":"0000-0002-8510-9739"}],"corr_author":"1","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","oa":1,"date_created":"2021-10-13T13:42:48Z","year":"2021","date_updated":"2026-04-08T07:12:06Z","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"}],"oa_version":"Published Version","month":"10","ddc":["570"],"degree_awarded":"PhD","status":"public","OA_place":"publisher","doi":"10.15479/at:ista:10135","day":"13","related_material":{"record":[{"id":"9160","relation":"part_of_dissertation","status":"public"}]},"author":[{"last_name":"Semerádová","full_name":"Semerádová, Hana","first_name":"Hana","id":"42FE702E-F248-11E8-B48F-1D18A9856A87"}],"publisher":"Institute of Science and Technology Austria","project":[{"_id":"261821BC-B435-11E9-9278-68D0E5697425","grant_number":"24746","name":"Molecular mechanisms of the cytokinin regulated endomembrane trafficking to coordinate plant organogenesis"}],"alternative_title":["ISTA Thesis"],"publication_status":"published","citation":{"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>.","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>.","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>","ista":"Semerádová H. 2021. Molecular mechanisms of the cytokinin-regulated endomembrane trafficking to coordinate plant organogenesis. Institute of Science and Technology Austria.","short":"H. Semerádová, Molecular Mechanisms of the Cytokinin-Regulated Endomembrane Trafficking to Coordinate Plant Organogenesis, Institute of Science and Technology Austria, 2021.","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>","ieee":"H. Semerádová, “Molecular mechanisms of the cytokinin-regulated endomembrane trafficking to coordinate plant organogenesis,” Institute of Science and Technology Austria, 2021."},"file":[{"file_size":28508629,"relation":"source_file","access_level":"closed","file_name":"Hana_Semeradova_Disertation_Thesis_II_Revised_3.docx","date_created":"2021-10-27T07:45:37Z","date_updated":"2022-12-20T23:30:05Z","file_id":"10186","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","embargo_to":"open_access","creator":"cziletti","checksum":"ce7108853e6cec6224f17cd6429b51fe"},{"checksum":"0d7afb846e8e31ec794de47bf44e12ef","embargo":"2022-10-28","creator":"cziletti","content_type":"application/pdf","file_id":"10187","date_updated":"2022-12-20T23:30:05Z","date_created":"2021-10-27T07:45:57Z","file_name":"Hana_Semeradova_Disertation_Thesis_II_Revised_3PDFA.pdf","file_size":10623525,"relation":"main_file","access_level":"open_access"}]},{"type":"journal_article","_id":"10191","has_accepted_license":"1","intvolume":"         5","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"article_processing_charge":"No","title":"The reads-from equivalence for the TSO and PSO memory models","date_published":"2021-10-15T00:00:00Z","file_date_updated":"2021-11-04T07:24:48Z","language":[{"iso":"eng"}],"oa":1,"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"abstract":[{"lang":"eng","text":"In this work we solve the algorithmic problem of consistency verification for the TSO and PSO memory models given a reads-from map, denoted VTSO-rf and VPSO-rf, respectively. For an execution of n events over k threads and d variables, we establish novel bounds that scale as nk+1 for TSO and as nk+1· min(nk2, 2k· d) for PSO. Moreover, based on our solution to these problems, we develop an SMC algorithm under TSO and PSO that uses the RF equivalence. The algorithm is exploration-optimal, in the sense that it is guaranteed to explore each class of the RF partitioning exactly once, and spends polynomial time per class when k is bounded. Finally, we implement all our algorithms in the SMC tool Nidhugg, and perform a large number of experiments over benchmarks from existing literature. Our experimental results show that our algorithms for VTSO-rf and VPSO-rf provide significant scalability improvements over standard alternatives. Moreover, when used for SMC, the RF partitioning is often much coarser than the standard Shasha-Snir partitioning for TSO/PSO, which yields a significant speedup in the model checking task.\r\n\r\n"}],"external_id":{"arxiv":["2011.11763"]},"acknowledgement":"The research was partially funded by the ERC CoG 863818 (ForM-SMArt) and the Vienna Science\r\nand Technology Fund (WWTF) through project ICT15-003.","publication_identifier":{"eissn":["2475-1421"]},"arxiv":1,"date_updated":"2026-04-08T07:00:31Z","year":"2021","date_created":"2021-10-27T15:05:34Z","publication":"Proceedings of the ACM on Programming Languages","status":"public","article_number":"164","keyword":["safety","risk","reliability and quality","software"],"ddc":["000"],"issue":"OOPSLA","article_type":"original","month":"10","oa_version":"Published Version","doi":"10.1145/3485541","quality_controlled":"1","project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","call_identifier":"H2020"},{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"}],"publisher":"Association for Computing Machinery","volume":5,"author":[{"first_name":"Truc Lam","last_name":"Bui","full_name":"Bui, Truc Lam"},{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"last_name":"Gautam","full_name":"Gautam, Tushar","first_name":"Tushar"},{"first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis","full_name":"Pavlogiannis, Andreas"},{"id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87","first_name":"Viktor","orcid":"0000-0001-9036-063X","last_name":"Toman","full_name":"Toman, Viktor"}],"related_material":{"record":[{"id":"10199","status":"public","relation":"dissertation_contains"}]},"day":"15","ec_funded":1,"scopus_import":"1","citation":{"ieee":"T. L. Bui, K. Chatterjee, T. Gautam, A. Pavlogiannis, and V. Toman, “The reads-from equivalence for the TSO and PSO memory models,” <i>Proceedings of the ACM on Programming Languages</i>, vol. 5, no. OOPSLA. Association for Computing Machinery, 2021.","apa":"Bui, T. L., Chatterjee, K., Gautam, T., Pavlogiannis, A., &#38; Toman, V. (2021). The reads-from equivalence for the TSO and PSO memory models. <i>Proceedings of the ACM on Programming Languages</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3485541\">https://doi.org/10.1145/3485541</a>","short":"T.L. Bui, K. Chatterjee, T. Gautam, A. Pavlogiannis, V. Toman, Proceedings of the ACM on Programming Languages 5 (2021).","ista":"Bui TL, Chatterjee K, Gautam T, Pavlogiannis A, Toman V. 2021. The reads-from equivalence for the TSO and PSO memory models. Proceedings of the ACM on Programming Languages. 5(OOPSLA), 164.","ama":"Bui TL, Chatterjee K, Gautam T, Pavlogiannis A, Toman V. The reads-from equivalence for the TSO and PSO memory models. <i>Proceedings of the ACM on Programming Languages</i>. 2021;5(OOPSLA). doi:<a href=\"https://doi.org/10.1145/3485541\">10.1145/3485541</a>","mla":"Bui, Truc Lam, et al. “The Reads-from Equivalence for the TSO and PSO Memory Models.” <i>Proceedings of the ACM on Programming Languages</i>, vol. 5, no. OOPSLA, 164, Association for Computing Machinery, 2021, doi:<a href=\"https://doi.org/10.1145/3485541\">10.1145/3485541</a>.","chicago":"Bui, Truc Lam, Krishnendu Chatterjee, Tushar Gautam, Andreas Pavlogiannis, and Viktor Toman. “The Reads-from Equivalence for the TSO and PSO Memory Models.” <i>Proceedings of the ACM on Programming Languages</i>. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3485541\">https://doi.org/10.1145/3485541</a>."},"file":[{"date_updated":"2021-11-04T07:24:48Z","file_id":"10215","date_created":"2021-11-04T07:24:48Z","content_type":"application/pdf","file_size":2903485,"relation":"main_file","access_level":"open_access","file_name":"2021_ProcACMPL_Bui.pdf","success":1,"checksum":"9d6dce7b611853c529bb7b1915ac579e","creator":"cchlebak"}],"publication_status":"published"},{"publication_identifier":{"issn":["2663-337X"]},"year":"2021","date_updated":"2026-04-08T07:00:31Z","date_created":"2021-10-29T20:09:01Z","abstract":[{"text":"The design and verification of concurrent systems remains an open challenge due to the non-determinism that arises from the inter-process communication. In particular, concurrent programs are notoriously difficult both to be written correctly and to be analyzed formally, as complex thread interaction has to be accounted for. The difficulties are further exacerbated when concurrent programs get executed on modern-day hardware, which contains various buffering and caching mechanisms for efficiency reasons. This causes further subtle non-determinism, which can often produce very unintuitive behavior of the concurrent programs. Model checking is at the forefront of tackling the verification problem, where the task is to decide, given as input a concurrent system and a desired property, whether the system satisfies the property. The inherent state-space explosion problem in model checking of concurrent systems causes naïve explicit methods not to scale, thus more inventive methods are required. One such method is stateless model checking (SMC), which explores in memory-efficient manner the program executions rather than the states of the program. State-of-the-art SMC is typically coupled with partial order reduction (POR) techniques, which argue that certain executions provably produce identical system behavior, thus limiting the amount of executions one needs to explore in order to cover all possible behaviors. Another method to tackle the state-space explosion is symbolic model checking, where the considered techniques operate on a succinct implicit representation of the input system rather than explicitly accessing the system. In this thesis we present new techniques for verification of concurrent systems. We present several novel POR methods for SMC of concurrent programs under various models of semantics, some of which account for write-buffering mechanisms. Additionally, we present novel algorithms for symbolic model checking of finite-state concurrent systems, where the desired property of the systems is to ensure a formally defined notion of fairness.","lang":"eng"}],"supervisor":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"}],"department":[{"_id":"GradSch"},{"_id":"KrCh"}],"oa":1,"corr_author":"1","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","language":[{"iso":"eng"}],"file_date_updated":"2021-11-09T09:00:50Z","title":"Improved verification techniques for concurrent systems","article_processing_charge":"No","date_published":"2021-10-31T00:00:00Z","_id":"10199","acknowledged_ssus":[{"_id":"SSU"}],"type":"dissertation","has_accepted_license":"1","file":[{"relation":"main_file","access_level":"open_access","file_size":2915234,"file_name":"toman_th_final.pdf","file_id":"10225","date_updated":"2021-11-08T14:12:22Z","date_created":"2021-11-08T14:12:22Z","content_type":"application/pdf","creator":"vtoman","checksum":"4f412a1ee60952221b499a4b1268df35"},{"date_created":"2021-11-08T14:12:46Z","date_updated":"2021-11-09T09:00:50Z","file_id":"10226","content_type":"application/zip","file_size":8616056,"relation":"source_file","access_level":"closed","file_name":"toman_thesis.zip","checksum":"9584943f99127be2dd2963f6784c37d4","creator":"vtoman"}],"citation":{"ieee":"V. Toman, “Improved verification techniques for concurrent systems,” Institute of Science and Technology Austria, 2021.","chicago":"Toman, Viktor. “Improved Verification Techniques for Concurrent Systems.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/at:ista:10199\">https://doi.org/10.15479/at:ista:10199</a>.","ista":"Toman V. 2021. Improved verification techniques for concurrent systems. Institute of Science and Technology Austria.","ama":"Toman V. Improved verification techniques for concurrent systems. 2021. doi:<a href=\"https://doi.org/10.15479/at:ista:10199\">10.15479/at:ista:10199</a>","mla":"Toman, Viktor. <i>Improved Verification Techniques for Concurrent Systems</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/at:ista:10199\">10.15479/at:ista:10199</a>.","short":"V. Toman, Improved Verification Techniques for Concurrent Systems, Institute of Science and Technology Austria, 2021.","apa":"Toman, V. (2021). <i>Improved verification techniques for concurrent systems</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:10199\">https://doi.org/10.15479/at:ista:10199</a>"},"page":"166","publication_status":"published","alternative_title":["ISTA Thesis"],"ec_funded":1,"author":[{"orcid":"0000-0001-9036-063X","first_name":"Viktor","id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87","full_name":"Toman, Viktor","last_name":"Toman"}],"related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"9987"},{"status":"public","relation":"part_of_dissertation","id":"10191"},{"id":"141","relation":"part_of_dissertation","status":"public"},{"id":"10190","relation":"part_of_dissertation","status":"public"}]},"day":"31","publisher":"Institute of Science and Technology Austria","project":[{"name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","call_identifier":"H2020"},{"call_identifier":"FWF","grant_number":"S11402-N23","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"},{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"OA_place":"publisher","doi":"10.15479/at:ista:10199","month":"10","oa_version":"Published Version","status":"public","keyword":["concurrency","verification","model checking"],"degree_awarded":"PhD","ddc":["000"]},{"author":[{"last_name":"Schmid","full_name":"Schmid, Laura","id":"38B437DE-F248-11E8-B48F-1D18A9856A87","first_name":"Laura","orcid":"0000-0002-6978-7329"}],"day":"17","related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"9997"},{"id":"9402","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"2"}]},"project":[{"call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"publisher":"Institute of Science and Technology Austria","file":[{"content_type":"application/zip","date_created":"2021-11-18T12:41:46Z","date_updated":"2022-12-20T23:30:08Z","file_id":"10305","file_name":"submission_new.zip","relation":"source_file","access_level":"closed","file_size":29703124,"checksum":"86a05b430756ca12ae8107b6e6f3c1e5","creator":"lschmid","embargo_to":"open_access"},{"date_updated":"2022-12-20T23:30:08Z","file_id":"10306","date_created":"2021-11-18T12:59:15Z","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_size":8320985,"file_name":"thesis_new_upload.pdf","checksum":"d940af042e94660c6b6a7b4f0b184d47","embargo":"2022-10-18","creator":"lschmid"}],"citation":{"short":"L. Schmid, Evolution of Cooperation via (in)Direct Reciprocity under Imperfect Information, Institute of Science and Technology Austria, 2021.","apa":"Schmid, L. (2021). <i>Evolution of cooperation via (in)direct reciprocity under imperfect information</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:10293\">https://doi.org/10.15479/at:ista:10293</a>","ista":"Schmid L. 2021. Evolution of cooperation via (in)direct reciprocity under imperfect information. Institute of Science and Technology Austria.","chicago":"Schmid, Laura. “Evolution of Cooperation via (in)Direct Reciprocity under Imperfect Information.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/at:ista:10293\">https://doi.org/10.15479/at:ista:10293</a>.","ama":"Schmid L. Evolution of cooperation via (in)direct reciprocity under imperfect information. 2021. doi:<a href=\"https://doi.org/10.15479/at:ista:10293\">10.15479/at:ista:10293</a>","mla":"Schmid, Laura. <i>Evolution of Cooperation via (in)Direct Reciprocity under Imperfect Information</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/at:ista:10293\">10.15479/at:ista:10293</a>.","ieee":"L. Schmid, “Evolution of cooperation via (in)direct reciprocity under imperfect information,” Institute of Science and Technology Austria, 2021."},"page":"171","alternative_title":["ISTA Thesis"],"publication_status":"published","ec_funded":1,"month":"11","oa_version":"Published Version","status":"public","ddc":["519","576"],"degree_awarded":"PhD","OA_place":"publisher","doi":"10.15479/at:ista:10293","supervisor":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"}],"department":[{"_id":"GradSch"},{"_id":"KrCh"}],"corr_author":"1","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","oa":1,"publication_identifier":{"issn":["2663-337X"]},"date_created":"2021-11-15T17:12:57Z","year":"2021","date_updated":"2026-04-08T07:11:20Z","abstract":[{"text":"Indirect reciprocity in evolutionary game theory is a prominent mechanism for explaining the evolution of cooperation among unrelated individuals. In contrast to direct reciprocity, which is based on individuals meeting repeatedly, and conditionally cooperating by using their own experiences, indirect reciprocity is based on individuals’ reputations. If a player helps another, this increases the helper’s public standing, benefitting them in the future. This lets cooperation in the population emerge without individuals having to meet more than once. While the two modes of reciprocity are intertwined, they are difficult to compare. Thus, they are usually studied in isolation. Direct reciprocity can maintain cooperation with simple strategies, and is robust against noise even when players do not remember more\r\nthan their partner’s last action. Meanwhile, indirect reciprocity requires its successful strategies, or social norms, to be more complex. Exhaustive search previously identified eight such norms, called the “leading eight”, which excel at maintaining cooperation. However, as the first result of this thesis, we show that the leading eight break down once we remove the fundamental assumption that information is synchronized and public, such that everyone agrees on reputations. Once we consider a more realistic scenario of imperfect information, where reputations are private, and individuals occasionally misinterpret or miss observations, the leading eight do not promote cooperation anymore. Instead, minor initial disagreements can proliferate, fragmenting populations into subgroups. In a next step, we consider ways to mitigate this issue. We first explore whether introducing “generosity” can stabilize cooperation when players use the leading eight strategies in noisy environments. This approach of modifying strategies to include probabilistic elements for coping with errors is known to work well in direct reciprocity. However, as we show here, it fails for the more complex norms of indirect reciprocity. Imperfect information still prevents cooperation from evolving. On the other hand, we succeeded to show in this thesis that modifying the leading eight to use “quantitative assessment”, i.e. tracking reputation scores on a scale beyond good and bad, and making overall judgments of others based on a threshold, is highly successful, even when noise increases in the environment. Cooperation can flourish when reputations\r\nare more nuanced, and players have a broader understanding what it means to be “good.” Finally, we present a single theoretical framework that unites the two modes of reciprocity despite their differences. Within this framework, we identify a novel simple and successful strategy for indirect reciprocity, which can cope with noisy environments and has an analogue in direct reciprocity. We can also analyze decision making when different sources of information are available. Our results help highlight that for sustaining cooperation, already the most simple rules of reciprocity can be sufficient.","lang":"eng"}],"_id":"10293","type":"dissertation","has_accepted_license":"1","language":[{"iso":"eng"}],"file_date_updated":"2022-12-20T23:30:08Z","title":"Evolution of cooperation via (in)direct reciprocity under imperfect information","article_processing_charge":"No","date_published":"2021-11-17T00:00:00Z"},{"type":"dissertation","_id":"10303","acknowledged_ssus":[{"_id":"LifeSc"},{"_id":"Bio"}],"has_accepted_license":"1","file_date_updated":"2022-12-20T23:30:06Z","language":[{"iso":"eng"}],"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"article_processing_charge":"No","title":"Role of hormones in nitrate regulated growth","date_published":"2021-11-22T00:00:00Z","supervisor":[{"full_name":"Benková, Eva","last_name":"Benková","orcid":"0000-0002-8510-9739","first_name":"Eva","id":"38F4F166-F248-11E8-B48F-1D18A9856A87"}],"department":[{"_id":"GradSch"},{"_id":"EvBe"}],"oa":1,"corr_author":"1","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","publication_identifier":{"issn":["2663-337X"]},"year":"2021","date_updated":"2026-04-08T07:20:07Z","date_created":"2021-11-18T11:20:59Z","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"}],"month":"11","oa_version":"Published Version","status":"public","ddc":["580","581"],"degree_awarded":"PhD","OA_place":"publisher","doi":"10.15479/at:ista:10303","author":[{"id":"4827E134-F248-11E8-B48F-1D18A9856A87","first_name":"Rashed","orcid":"0000-0002-9357-9415","last_name":"Abualia","full_name":"Abualia, Rashed"}],"related_material":{"record":[{"id":"47","status":"public","relation":"part_of_dissertation"},{"id":"9913","relation":"part_of_dissertation","status":"public"},{"id":"9010","status":"public","relation":"part_of_dissertation"}]},"day":"22","publisher":"Institute of Science and Technology Austria","citation":{"ieee":"R. Abualia, “Role of hormones in nitrate regulated growth,” Institute of Science and Technology Austria, 2021.","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>.","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>","ista":"Abualia R. 2021. Role of hormones in nitrate regulated growth. Institute of Science and Technology Austria.","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>"},"file":[{"checksum":"dea38b98aa4da1cea03dcd0f10862818","embargo":"2022-11-23","creator":"rabualia","date_updated":"2022-12-20T23:30:06Z","file_id":"10331","date_created":"2021-11-22T14:48:21Z","content_type":"application/pdf","access_level":"open_access","file_size":28005730,"relation":"main_file","file_name":"AbualiaPhDthesisfinalv3.pdf"},{"date_updated":"2022-12-20T23:30:06Z","file_id":"10332","date_created":"2021-11-22T14:48:34Z","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","access_level":"closed","relation":"source_file","file_size":62841883,"file_name":"AbualiaPhDthesisfinalv3.docx","checksum":"4cd62da5ec5ba4c32e61f0f6d9e61920","embargo_to":"open_access","creator":"rabualia"}],"page":"139","alternative_title":["ISTA Thesis"],"publication_status":"published"},{"status":"public","ddc":["570"],"degree_awarded":"PhD","month":"11","oa_version":"Published Version","doi":"10.15479/at:ista:10307","OA_place":"publisher","publisher":"Institute of Science and Technology Austria","author":[{"id":"3AEC8556-F248-11E8-B48F-1D18A9856A87","first_name":"Kathrin","orcid":"0000-0003-3768-877X","last_name":"Tomasek","full_name":"Tomasek, Kathrin"}],"day":"18","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"10316"}]},"citation":{"ieee":"K. Tomasek, “Pathogenic Escherichia coli hijack the host immune response,” Institute of Science and Technology Austria, 2021.","short":"K. Tomasek, Pathogenic Escherichia Coli Hijack the Host Immune Response, Institute of Science and Technology Austria, 2021.","apa":"Tomasek, K. (2021). <i>Pathogenic Escherichia coli hijack the host immune response</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:10307\">https://doi.org/10.15479/at:ista:10307</a>","mla":"Tomasek, Kathrin. <i>Pathogenic Escherichia Coli Hijack the Host Immune Response</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/at:ista:10307\">10.15479/at:ista:10307</a>.","chicago":"Tomasek, Kathrin. “Pathogenic Escherichia Coli Hijack the Host Immune Response.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/at:ista:10307\">https://doi.org/10.15479/at:ista:10307</a>.","ama":"Tomasek K. Pathogenic Escherichia coli hijack the host immune response. 2021. doi:<a href=\"https://doi.org/10.15479/at:ista:10307\">10.15479/at:ista:10307</a>","ista":"Tomasek K. 2021. Pathogenic Escherichia coli hijack the host immune response. Institute of Science and Technology Austria."},"file":[{"embargo":"2022-11-18","checksum":"b39c9e0ef18d0484d537a67551effd02","creator":"ktomasek","content_type":"application/pdf","date_created":"2021-11-18T15:07:31Z","date_updated":"2022-12-20T23:30:05Z","file_id":"10308","file_name":"ThesisTomasekKathrin.pdf","file_size":13266088,"relation":"main_file","access_level":"open_access"},{"creator":"ktomasek","embargo_to":"open_access","checksum":"c0c440ee9e5ef1102a518a4f9f023e7c","file_name":"ThesisTomasekKathrin.docx","file_size":7539509,"relation":"source_file","access_level":"closed","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","date_updated":"2022-12-20T23:30:05Z","file_id":"10309","date_created":"2021-11-18T15:07:46Z"}],"page":"73","alternative_title":["ISTA Thesis"],"publication_status":"published","_id":"10307","acknowledged_ssus":[{"_id":"LifeSc"},{"_id":"Bio"},{"_id":"PreCl"},{"_id":"EM-Fac"}],"type":"dissertation","has_accepted_license":"1","article_processing_charge":"No","title":"Pathogenic Escherichia coli hijack the host immune response","date_published":"2021-11-18T00:00:00Z","language":[{"iso":"eng"}],"file_date_updated":"2022-12-20T23:30:05Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","corr_author":"1","oa":1,"supervisor":[{"full_name":"Sixt, Michael K","last_name":"Sixt","orcid":"0000-0002-4561-241X","first_name":"Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Guet","full_name":"Guet, Calin C","orcid":"0000-0001-6220-2052","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","first_name":"Calin C"}],"department":[{"_id":"MiSi"},{"_id":"CaGu"},{"_id":"GradSch"}],"abstract":[{"lang":"eng","text":"Bacteria-host interactions represent a continuous trade-off between benefit and risk. Thus, the host immune response is faced with a non-trivial problem – accommodate beneficial commensals and remove harmful pathogens. This is especially difficult as molecular patterns, such as lipopolysaccharide or specific surface organelles such as pili, are conserved in both, commensal and pathogenic bacteria. Type 1 pili, tightly regulated by phase variation, are considered an important virulence factor of pathogenic bacteria as they facilitate invasion into host cells. While invasion represents a de facto passive mechanism for pathogens to escape the host immune response, we demonstrate a fundamental role of type 1 pili as active modulators of the innate and adaptive immune response."}],"publication_identifier":{"issn":["2663-337X"]},"date_created":"2021-11-18T15:05:06Z","year":"2021","date_updated":"2026-04-08T07:14:01Z"},{"doi":"10.15479/at:ista:10422","OA_place":"publisher","status":"public","ddc":["530"],"degree_awarded":"MS","month":"12","oa_version":"Published Version","citation":{"short":"A. Piankov, Towards Designer Materials Using Customizable Particle Shape, Institute of Science and Technology Austria, 2021.","apa":"Piankov, A. (2021). <i>Towards designer materials using customizable particle shape</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:10422\">https://doi.org/10.15479/at:ista:10422</a>","ama":"Piankov A. Towards designer materials using customizable particle shape. 2021. doi:<a href=\"https://doi.org/10.15479/at:ista:10422\">10.15479/at:ista:10422</a>","chicago":"Piankov, Anton. “Towards Designer Materials Using Customizable Particle Shape.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/at:ista:10422\">https://doi.org/10.15479/at:ista:10422</a>.","ista":"Piankov A. 2021. Towards designer materials using customizable particle shape. Institute of Science and Technology Austria.","mla":"Piankov, Anton. <i>Towards Designer Materials Using Customizable Particle Shape</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/at:ista:10422\">10.15479/at:ista:10422</a>.","ieee":"A. Piankov, “Towards designer materials using customizable particle shape,” Institute of Science and Technology Austria, 2021."},"file":[{"creator":"cchlebak","checksum":"114e8f4b2c002c6c352416c12de2c695","relation":"source_file","file_size":394018,"access_level":"closed","file_name":"Thesis.zip","date_updated":"2022-03-10T12:10:25Z","file_id":"10424","date_created":"2021-12-07T11:13:52Z","content_type":"application/x-zip-compressed"},{"relation":"source_file","access_level":"closed","file_size":47638,"file_name":"Preliminary_pages_Piankov.docx","date_created":"2021-12-07T11:14:01Z","date_updated":"2022-03-10T12:10:25Z","file_id":"10425","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","creator":"cchlebak","checksum":"cd15ae991ced352a9959815f794e657c"},{"creator":"cchlebak","success":1,"checksum":"e6899c798b75ba42fab9822bce309050","access_level":"open_access","relation":"main_file","file_size":484965,"file_name":"2021_Piankov_combined.pdf","file_id":"10426","date_updated":"2021-12-07T11:20:35Z","date_created":"2021-12-07T11:20:35Z","content_type":"application/pdf"}],"alternative_title":["ISTA Master's Thesis"],"publication_status":"published","publisher":"Institute of Science and Technology Austria","author":[{"first_name":"Anton","id":"865E3C26-AA8C-11E9-A409-C4C4E5697425","full_name":"Piankov, Anton","last_name":"Piankov"}],"day":"07","article_processing_charge":"No","title":"Towards designer materials using customizable particle shape","date_published":"2021-12-07T00:00:00Z","language":[{"iso":"eng"}],"file_date_updated":"2022-03-10T12:10:25Z","type":"dissertation","_id":"10422","has_accepted_license":"1","abstract":[{"lang":"eng","text":"Those who aim to devise new materials with desirable properties usually examine present methods first. However, they will find out that some approaches can exist only conceptually without high chances to become practically useful. It seems that a numerical technique called automatic differentiation together with increasing supply of computational accelerators will soon shift many methods of the material design from the category ”unimaginable” to the category ”expensive but possible”. Approach we suggest is not an exception. Our overall goal is to have an efficient and generalizable approach allowing to solve inverse design problems. In this thesis we scratch its surface. We consider jammed systems of identical particles. And ask ourselves how the shape of those particles (or the parameters codifying it) may affect mechanical properties of the system. An indispensable part of reaching the answer is an appropriate particle parametrization. We come up with a simple, yet generalizable and purposeful scheme for it. Using our generalizable shape parameterization, we simulate the formation of a solid composed of pentagonal-like particles and measure anisotropy in the resulting elastic response. Through automatic differentiation techniques, we directly connect the shape parameters with the elastic response. Interestingly, for our system we find that less isotropic particles lead to a more isotropic elastic response. Together with other results known about our method it seems that it can be successfully generalized for different inverse design problems."}],"publication_identifier":{"issn":["2791-4585"]},"date_created":"2021-12-07T10:48:06Z","date_updated":"2026-04-08T06:58:55Z","year":"2021","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","corr_author":"1","oa":1,"supervisor":[{"last_name":"Goodrich","full_name":"Goodrich, Carl Peter","orcid":"0000-0002-1307-5074","id":"EB352CD2-F68A-11E9-89C5-A432E6697425","first_name":"Carl Peter"}],"department":[{"_id":"GradSch"},{"_id":"CaGo"}]},{"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","corr_author":"1","oa":1,"department":[{"_id":"GradSch"},{"_id":"DaAl"}],"supervisor":[{"first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh"}],"abstract":[{"text":"The scalability of concurrent data structures and distributed algorithms strongly depends on\r\nreducing the contention for shared resources and the costs of synchronization and communication. We show how such cost reductions can be attained by relaxing the strict consistency conditions required by sequential implementations. In the first part of the thesis, we consider relaxation in the context of concurrent data structures. Specifically, in data structures \r\nsuch as priority queues, imposing strong semantics renders scalability impossible, since a correct implementation of the remove operation should return only the element with highest priority. Intuitively, attempting to invoke remove operations concurrently  creates a race condition. This bottleneck  can be circumvented by relaxing semantics of the affected data structure, thus allowing removal of the elements which are no longer required to have the highest priority. We prove that the randomized implementations of relaxed data structures provide provable guarantees on the priority of the removed elements even under concurrency. Additionally, we show that in some cases the relaxed data structures can be used to scale the classical algorithms which are usually implemented with the exact ones. In the second part, we study parallel variants of the  stochastic gradient descent (SGD) algorithm, which distribute computation  among the multiple processors, thus reducing the running time. Unfortunately, in order for standard parallel SGD to succeed, each processor has to maintain a local copy of the necessary model parameter, which is identical to the local copies of other processors; the overheads from this perfect consistency in terms of communication and synchronization can negate the speedup gained by distributing the computation. We show that the consistency conditions required by SGD can be  relaxed, allowing the algorithm to be more flexible in terms of tolerating quantized communication, asynchrony, or even crash faults, while its convergence remains asymptotically the same.","lang":"eng"}],"date_created":"2021-12-08T21:52:28Z","date_updated":"2026-06-18T08:41:39Z","year":"2021","publication_identifier":{"issn":["2663-337X"]},"has_accepted_license":"1","type":"dissertation","_id":"10429","date_published":"2021-12-09T00:00:00Z","title":"On achieving scalability through relaxation","article_processing_charge":"No","file_date_updated":"2022-03-28T12:55:12Z","language":[{"iso":"eng"}],"publisher":"Institute of Science and Technology Austria","project":[{"call_identifier":"H2020","grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425","name":"Elastic Coordination for Scalable Machine Learning"}],"day":"09","related_material":{"record":[{"id":"6673","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"5965"},{"status":"public","relation":"part_of_dissertation","id":"10432"},{"relation":"part_of_dissertation","status":"public","id":"10435"}]},"author":[{"full_name":"Nadiradze, Giorgi","last_name":"Nadiradze","orcid":"0000-0001-5634-0731","id":"3279A00C-F248-11E8-B48F-1D18A9856A87","first_name":"Giorgi"}],"ec_funded":1,"page":"132","alternative_title":["ISTA Thesis"],"publication_status":"published","citation":{"short":"G. Nadiradze, On Achieving Scalability through Relaxation, Institute of Science and Technology Austria, 2021.","apa":"Nadiradze, G. (2021). <i>On achieving scalability through relaxation</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:10429\">https://doi.org/10.15479/at:ista:10429</a>","chicago":"Nadiradze, Giorgi. “On Achieving Scalability through Relaxation.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/at:ista:10429\">https://doi.org/10.15479/at:ista:10429</a>.","ista":"Nadiradze G. 2021. On achieving scalability through relaxation. Institute of Science and Technology Austria.","ama":"Nadiradze G. On achieving scalability through relaxation. 2021. doi:<a href=\"https://doi.org/10.15479/at:ista:10429\">10.15479/at:ista:10429</a>","mla":"Nadiradze, Giorgi. <i>On Achieving Scalability through Relaxation</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/at:ista:10429\">10.15479/at:ista:10429</a>.","ieee":"G. Nadiradze, “On achieving scalability through relaxation,” Institute of Science and Technology Austria, 2021."},"file":[{"checksum":"6bf14e9a523387328f016c0689f5e10e","success":1,"creator":"gnadirad","content_type":"application/pdf","date_created":"2021-12-09T17:47:49Z","file_id":"10436","date_updated":"2021-12-09T17:47:49Z","file_name":"Thesis_Final_09_12_2021.pdf","relation":"main_file","access_level":"open_access","file_size":2370859},{"checksum":"914d6c5ca86bd0add471971a8f4c4341","creator":"gnadirad","date_updated":"2022-03-28T12:55:12Z","file_id":"10437","date_created":"2021-12-09T17:47:49Z","content_type":"application/zip","access_level":"closed","relation":"source_file","file_size":2596924,"file_name":"Thesis_Final_09_12_2021.zip"}],"ddc":["000"],"degree_awarded":"PhD","status":"public","oa_version":"Published Version","month":"12","doi":"10.15479/at:ista:10429","OA_place":"publisher"},{"publication_status":"published","citation":{"apa":"Nardin, M., Phillips, J. W., Podlaski, W. F., &#38; Keemink, S. W. (2021). Nonlinear computations in spiking neural networks through multiplicative synapses. <i>Peer Community Journal</i>. Peer Community In. <a href=\"https://doi.org/10.24072/pcjournal.69\">https://doi.org/10.24072/pcjournal.69</a>","short":"M. Nardin, J.W. Phillips, W.F. Podlaski, S.W. Keemink, Peer Community Journal 1 (2021).","mla":"Nardin, Michele, et al. “Nonlinear Computations in Spiking Neural Networks through Multiplicative Synapses.” <i>Peer Community Journal</i>, vol. 1, e68, Peer Community In, 2021, doi:<a href=\"https://doi.org/10.24072/pcjournal.69\">10.24072/pcjournal.69</a>.","chicago":"Nardin, Michele, James W. Phillips, William F. Podlaski, and Sander W. Keemink. “Nonlinear Computations in Spiking Neural Networks through Multiplicative Synapses.” <i>Peer Community Journal</i>. Peer Community In, 2021. <a href=\"https://doi.org/10.24072/pcjournal.69\">https://doi.org/10.24072/pcjournal.69</a>.","ama":"Nardin M, Phillips JW, Podlaski WF, Keemink SW. Nonlinear computations in spiking neural networks through multiplicative synapses. <i>Peer Community Journal</i>. 2021;1. doi:<a href=\"https://doi.org/10.24072/pcjournal.69\">10.24072/pcjournal.69</a>","ista":"Nardin M, Phillips JW, Podlaski WF, Keemink SW. 2021. Nonlinear computations in spiking neural networks through multiplicative synapses. Peer Community Journal. 1, e68.","ieee":"M. Nardin, J. W. Phillips, W. F. Podlaski, and S. W. Keemink, “Nonlinear computations in spiking neural networks through multiplicative synapses,” <i>Peer Community Journal</i>, vol. 1. Peer Community In, 2021."},"file":[{"creator":"mnardin","checksum":"cd9af6b331918608f2e3d1c7940cbf4f","success":1,"file_name":"10_24072_pcjournal_69.pdf","access_level":"open_access","relation":"main_file","file_size":3311494,"content_type":"application/pdf","date_created":"2022-01-17T11:15:26Z","date_updated":"2022-01-17T11:15:26Z","file_id":"10636"}],"scopus_import":"1","ec_funded":1,"day":"15","author":[{"first_name":"Michele","id":"30BD0376-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8849-6570","last_name":"Nardin","full_name":"Nardin, Michele"},{"last_name":"Phillips","full_name":"Phillips, James W.","first_name":"James W."},{"full_name":"Podlaski, William F.","last_name":"Podlaski","first_name":"William F."},{"last_name":"Keemink","full_name":"Keemink, Sander W.","first_name":"Sander W."}],"volume":1,"project":[{"name":"International IST Doctoral Program","grant_number":"665385","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"publisher":"Peer Community In","doi":"10.24072/pcjournal.69","quality_controlled":"1","oa_version":"Published Version","month":"12","article_type":"original","ddc":["519"],"article_number":"e68","status":"public","publication":"Peer Community Journal","date_created":"2022-01-17T11:12:40Z","date_updated":"2025-05-14T11:23:19Z","year":"2021","publication_identifier":{"eissn":["2804-3871"]},"arxiv":1,"acknowledgement":"A preprint version of this article has been peer-reviewed and recommended by Peer Community In Neuroscience (DOI link to the recommendation: https://doi.org/10.24072/pci.cneuro.100003).\r\nWe thank Christian Machens and Nuno Calaim for useful discussions on the project. This report\r\ncame out of a collaboration started at the CAJAL Advanced Neuroscience Training Programme in\r\nComputational Neuroscience in Lisbon, Portugal, during the 2019 summer. The authors would\r\nlike to thank the participants, TAs, lecturers, and organizers of the summer school. SWK was\r\nsupported by the Simons Collaboration on the Global Brain (543009). WFP was supported by\r\nFCT (032077). MN was supported by European Union Horizon 2020 (665385).\r\n","external_id":{"arxiv":["2009.03857"]},"abstract":[{"lang":"eng","text":"The brain efficiently performs nonlinear computations through its intricate networks of spiking neurons, but how this is done remains elusive. While nonlinear computations can be implemented successfully in spiking neural networks, this requires supervised training and the resulting connectivity can be hard to interpret. In contrast, the required connectivity for any computation in the form of a linear dynamical system can be directly derived and understood with the spike coding network (SCN) framework. These networks also have biologically realistic activity patterns and are highly robust to cell death. Here we extend the SCN framework to directly implement any polynomial dynamical system, without the need for training. This results in networks requiring a mix of synapse types (fast, slow, and multiplicative), which we term multiplicative spike coding networks (mSCNs). Using mSCNs, we demonstrate how to directly derive the required connectivity for several nonlinear dynamical systems. We also show how to carry out higher-order polynomials with coupled networks that use only pair-wise multiplicative synapses, and provide expected numbers of connections for each synapse type. Overall, our work demonstrates a novel method for implementing nonlinear computations in spiking neural networks, while keeping the attractive features of standard SCNs (robustness, realistic activity patterns, and interpretable connectivity). Finally, we discuss the biological plausibility of our approach, and how the high accuracy and robustness of the approach may be of interest for neuromorphic computing."}],"department":[{"_id":"GradSch"},{"_id":"JoCs"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","corr_author":"1","oa":1,"language":[{"iso":"eng"}],"file_date_updated":"2022-01-17T11:15:26Z","date_published":"2021-12-15T00:00:00Z","article_processing_charge":"No","title":"Nonlinear computations in spiking neural networks through multiplicative synapses","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"intvolume":"         1","has_accepted_license":"1","type":"journal_article","_id":"10635"},{"quality_controlled":"1","oa_version":"Published Version","conference":{"end_date":"2021-02-09","start_date":"2021-02-02","name":"AAAI: Association for the Advancement of Artificial Intelligence","location":"Virtual"},"month":"05","issue":"5A","ddc":["000"],"status":"public","main_file_link":[{"open_access":"1","url":"https://ojs.aaai.org/index.php/AAAI/article/view/16496"}],"publication_status":"published","page":"3787-3795","alternative_title":["Technical Tracks"],"file":[{"file_name":"16496-Article Text-19990-1-2-20210518 (1).pdf","access_level":"open_access","relation":"main_file","file_size":137235,"content_type":"application/pdf","date_created":"2022-01-26T07:41:16Z","date_updated":"2022-01-26T07:41:16Z","file_id":"10684","creator":"mlechner","checksum":"2bc8155b2526a70fba5b7301bc89dbd1","success":1}],"citation":{"ieee":"T. A. Henzinger, M. Lechner, and D. Zikelic, “Scalable verification of quantized neural networks,” in <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, Virtual, 2021, vol. 35, no. 5A, pp. 3787–3795.","short":"T.A. Henzinger, M. Lechner, D. Zikelic, in:, Proceedings of the AAAI Conference on Artificial Intelligence, AAAI Press, 2021, pp. 3787–3795.","apa":"Henzinger, T. A., Lechner, M., &#38; Zikelic, D. (2021). Scalable verification of quantized neural networks. In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i> (Vol. 35, pp. 3787–3795). Virtual: AAAI Press.","ista":"Henzinger TA, Lechner M, Zikelic D. 2021. Scalable verification of quantized neural networks. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI: Association for the Advancement of Artificial Intelligence, Technical Tracks, vol. 35, 3787–3795.","chicago":"Henzinger, Thomas A, Mathias Lechner, and Dorde Zikelic. “Scalable Verification of Quantized Neural Networks.” In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, 35:3787–95. AAAI Press, 2021.","mla":"Henzinger, Thomas A., et al. “Scalable Verification of Quantized Neural Networks.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 35, no. 5A, AAAI Press, 2021, pp. 3787–95.","ama":"Henzinger TA, Lechner M, Zikelic D. Scalable verification of quantized neural networks. In: <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Vol 35. AAAI Press; 2021:3787-3795."},"scopus_import":"1","ec_funded":1,"day":"28","related_material":{"record":[{"id":"11362","status":"public","relation":"dissertation_contains"}]},"author":[{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","last_name":"Lechner"},{"full_name":"Zikelic, Dorde","last_name":"Zikelic","orcid":"0000-0002-4681-1699","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","first_name":"Dorde"}],"volume":35,"project":[{"name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","call_identifier":"H2020"},{"name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","call_identifier":"H2020"}],"publisher":"AAAI Press","language":[{"iso":"eng"}],"file_date_updated":"2022-01-26T07:41:16Z","date_published":"2021-05-28T00:00:00Z","title":"Scalable verification of quantized neural networks","article_processing_charge":"No","intvolume":"        35","has_accepted_license":"1","type":"conference","_id":"10665","date_created":"2022-01-25T15:15:02Z","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","date_updated":"2026-04-07T14:21:58Z","year":"2021","publication_identifier":{"isbn":["978-1-57735-866-4"],"eissn":["2374-3468"],"issn":["2159-5399"]},"arxiv":1,"acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein\r\nAward), ERC CoG 863818 (FoRM-SMArt), and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.\r\n","external_id":{"arxiv":["2012.08185"]},"abstract":[{"text":"Formal verification of neural networks is an active topic of research, and recent advances have significantly increased the size of the networks that verification tools can handle. However, most methods are designed for verification of an idealized model of the actual network which works over real arithmetic and ignores rounding imprecisions. This idealization is in stark contrast to network quantization, which is a technique that trades numerical precision for computational efficiency and is, therefore, often applied in practice. Neglecting rounding errors of such low-bit quantized neural networks has been shown to lead to wrong conclusions about the network’s correctness. Thus, the desired approach for verifying quantized neural networks would be one that takes these rounding errors\r\ninto account. In this paper, we show that verifying the bitexact implementation of quantized neural networks with bitvector specifications is PSPACE-hard, even though verifying idealized real-valued networks and satisfiability of bit-vector specifications alone are each in NP. Furthermore, we explore several practical heuristics toward closing the complexity gap between idealized and bit-exact verification. In particular, we propose three techniques for making SMT-based verification of quantized neural networks more scalable. Our experiments demonstrate that our proposed methods allow a speedup of up to three orders of magnitude over existing approaches.","lang":"eng"}],"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"corr_author":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1},{"project":[{"grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems"}],"author":[{"full_name":"Lechner, Mathias","last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias"},{"last_name":"Hasani","full_name":"Hasani, Ramin","first_name":"Ramin"},{"first_name":"Radu","last_name":"Grosu","full_name":"Grosu, Radu"},{"first_name":"Daniela","full_name":"Rus, Daniela","last_name":"Rus"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000-0002-2985-7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"11362"}]},"day":"01","scopus_import":"1","isi":1,"citation":{"ieee":"M. Lechner, R. Hasani, R. Grosu, D. Rus, and T. A. Henzinger, “Adversarial training is not ready for robot learning,” in <i>2021 IEEE International Conference on Robotics and Automation</i>, Xi’an, China, 2021, pp. 4140–4147.","ista":"Lechner M, Hasani R, Grosu R, Rus D, Henzinger TA. 2021. Adversarial training is not ready for robot learning. 2021 IEEE International Conference on Robotics and Automation. ICRA: International Conference on Robotics and AutomationICRA, 4140–4147.","ama":"Lechner M, Hasani R, Grosu R, Rus D, Henzinger TA. Adversarial training is not ready for robot learning. In: <i>2021 IEEE International Conference on Robotics and Automation</i>. ICRA. ; 2021:4140-4147. doi:<a href=\"https://doi.org/10.1109/ICRA48506.2021.9561036\">10.1109/ICRA48506.2021.9561036</a>","mla":"Lechner, Mathias, et al. “Adversarial Training Is Not Ready for Robot Learning.” <i>2021 IEEE International Conference on Robotics and Automation</i>, 2021, pp. 4140–47, doi:<a href=\"https://doi.org/10.1109/ICRA48506.2021.9561036\">10.1109/ICRA48506.2021.9561036</a>.","chicago":"Lechner, Mathias, Ramin Hasani, Radu Grosu, Daniela Rus, and Thomas A Henzinger. “Adversarial Training Is Not Ready for Robot Learning.” In <i>2021 IEEE International Conference on Robotics and Automation</i>, 4140–47. ICRA, 2021. <a href=\"https://doi.org/10.1109/ICRA48506.2021.9561036\">https://doi.org/10.1109/ICRA48506.2021.9561036</a>.","short":"M. Lechner, R. Hasani, R. Grosu, D. Rus, T.A. Henzinger, in:, 2021 IEEE International Conference on Robotics and Automation, 2021, pp. 4140–4147.","apa":"Lechner, M., Hasani, R., Grosu, R., Rus, D., &#38; Henzinger, T. A. (2021). Adversarial training is not ready for robot learning. In <i>2021 IEEE International Conference on Robotics and Automation</i> (pp. 4140–4147). Xi’an, China. <a href=\"https://doi.org/10.1109/ICRA48506.2021.9561036\">https://doi.org/10.1109/ICRA48506.2021.9561036</a>"},"page":"4140-4147","publication_status":"published","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2103.08187"}],"status":"public","ddc":["000"],"series_title":"ICRA","month":"06","oa_version":"Preprint","conference":{"start_date":"2021-05-30","name":"ICRA: International Conference on Robotics and Automation","end_date":"2021-06-05","location":"Xi'an, China"},"doi":"10.1109/ICRA48506.2021.9561036","quality_controlled":"1","OA_place":"repository","license":"https://creativecommons.org/licenses/by-nc-nd/3.0/","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"abstract":[{"lang":"eng","text":"Adversarial training is an effective method to train deep learning models that are resilient to norm-bounded perturbations, with the cost of nominal performance drop. While adversarial training appears to enhance the robustness and safety of a deep model deployed in open-world decision-critical applications, counterintuitively, it induces undesired behaviors in robot learning settings. In this paper, we show theoretically and experimentally that neural controllers obtained via adversarial training are subjected to three types of defects, namely transient, systematic, and conditional errors. We first generalize adversarial training to a safety-domain optimization scheme allowing for more generic specifications. We then prove that such a learning process tends to cause certain error profiles. We support our theoretical results by a thorough experimental safety analysis in a robot-learning task. Our results suggest that adversarial training is not yet ready for robot learning."}],"external_id":{"isi":["000765738803040"],"arxiv":["2103.08187"]},"acknowledgement":"M.L. and T.A.H. are supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). R.H. and D.R. are supported by Boeing and R.G. by Horizon-2020 ECSEL Project grant no. 783163 (iDev40).","arxiv":1,"publication_identifier":{"eisbn":["978-1-7281-9077-8"],"issn":["1050-4729"],"eissn":["2577-087X"],"isbn":["978-1-7281-9078-5"]},"date_updated":"2026-04-07T14:21:58Z","year":"2021","publication":"2021 IEEE International Conference on Robotics and Automation","date_created":"2022-01-25T15:44:54Z","type":"conference","_id":"10666","has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","short":"CC BY-NC-ND (3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","image":"/images/cc_by_nc_nd.png"},"title":"Adversarial training is not ready for robot learning","article_processing_charge":"No","date_published":"2021-06-01T00:00:00Z","OA_type":"green","language":[{"iso":"eng"}]},{"has_accepted_license":"1","_id":"10667","type":"conference","file_date_updated":"2022-01-26T07:39:59Z","language":[{"iso":"eng"}],"date_published":"2021-12-01T00:00:00Z","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","short":"CC BY-NC-ND (3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","image":"/images/cc_by_nc_nd.png"},"title":"Infinite time horizon safety of Bayesian neural networks","article_processing_charge":"No","department":[{"_id":"GradSch"},{"_id":"ToHe"},{"_id":"KrCh"}],"oa":1,"user_id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","corr_author":"1","year":"2021","date_updated":"2026-04-07T14:21:58Z","publication":"35th Conference on Neural Information Processing Systems","date_created":"2022-01-25T15:45:58Z","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award), ERC CoG 863818 (FoRM-SMArt), and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","arxiv":1,"external_id":{"arxiv":["2111.03165"]},"abstract":[{"lang":"eng","text":"Bayesian neural networks (BNNs) place distributions over the weights of a neural network to model uncertainty in the data and the network's prediction. We consider the problem of verifying safety when running a Bayesian neural network policy in a feedback loop with infinite time horizon systems. Compared to the existing sampling-based approaches, which are inapplicable to the infinite time horizon setting, we train a separate deterministic neural network that serves as an infinite time horizon safety certificate. In particular, we show that the certificate network guarantees the safety of the system over a subset of the BNN weight posterior's support. Our method first computes a safe weight set and then alters the BNN's weight posterior to reject samples outside this set. Moreover, we show how to extend our approach to a safe-exploration reinforcement learning setting, in order to avoid unsafe trajectories during the training of the policy. We evaluate our approach on a series of reinforcement learning benchmarks, including non-Lyapunovian safety specifications."}],"oa_version":"Published Version","conference":{"location":"Virtual","end_date":"2021-12-10","start_date":"2021-12-06","name":"NeurIPS: Neural Information Processing Systems"},"month":"12","ddc":["000"],"main_file_link":[{"url":"https://proceedings.neurips.cc/paper/2021/hash/544defa9fddff50c53b71c43e0da72be-Abstract.html","open_access":"1"}],"status":"public","doi":"10.48550/arXiv.2111.03165","quality_controlled":"1","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"11362"}]},"day":"01","author":[{"first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","last_name":"Lechner"},{"first_name":"Ðorđe","last_name":"Žikelić","full_name":"Žikelić, Ðorđe"},{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A"}],"project":[{"name":"International IST Doctoral Program","call_identifier":"H2020","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"},{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211"}],"publication_status":"published","alternative_title":[" Advances in Neural Information Processing Systems"],"file":[{"checksum":"0fc0f852525c10dda9cc9ffea07fb4e4","success":1,"creator":"mlechner","content_type":"application/pdf","date_created":"2022-01-26T07:39:59Z","date_updated":"2022-01-26T07:39:59Z","file_id":"10682","file_name":"infinite_time_horizon_safety_o.pdf","relation":"main_file","access_level":"open_access","file_size":452492}],"citation":{"ieee":"M. Lechner, Ð. Žikelić, K. Chatterjee, and T. A. Henzinger, “Infinite time horizon safety of Bayesian neural networks,” in <i>35th Conference on Neural Information Processing Systems</i>, Virtual, 2021.","apa":"Lechner, M., Žikelić, Ð., Chatterjee, K., &#38; Henzinger, T. A. (2021). Infinite time horizon safety of Bayesian neural networks. In <i>35th Conference on Neural Information Processing Systems</i>. Virtual. <a href=\"https://doi.org/10.48550/arXiv.2111.03165\">https://doi.org/10.48550/arXiv.2111.03165</a>","short":"M. Lechner, Ð. Žikelić, K. Chatterjee, T.A. Henzinger, in:, 35th Conference on Neural Information Processing Systems, 2021.","chicago":"Lechner, Mathias, Ðorđe Žikelić, Krishnendu Chatterjee, and Thomas A Henzinger. “Infinite Time Horizon Safety of Bayesian Neural Networks.” In <i>35th Conference on Neural Information Processing Systems</i>, 2021. <a href=\"https://doi.org/10.48550/arXiv.2111.03165\">https://doi.org/10.48550/arXiv.2111.03165</a>.","mla":"Lechner, Mathias, et al. “Infinite Time Horizon Safety of Bayesian Neural Networks.” <i>35th Conference on Neural Information Processing Systems</i>, 2021, doi:<a href=\"https://doi.org/10.48550/arXiv.2111.03165\">10.48550/arXiv.2111.03165</a>.","ista":"Lechner M, Žikelić Ð, Chatterjee K, Henzinger TA. 2021. Infinite time horizon safety of Bayesian neural networks. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems,  Advances in Neural Information Processing Systems, .","ama":"Lechner M, Žikelić Ð, Chatterjee K, Henzinger TA. Infinite time horizon safety of Bayesian neural networks. In: <i>35th Conference on Neural Information Processing Systems</i>. ; 2021. doi:<a href=\"https://doi.org/10.48550/arXiv.2111.03165\">10.48550/arXiv.2111.03165</a>"},"ec_funded":1},{"month":"07","oa_version":"Published Version","conference":{"location":"Virtual","end_date":"2021-07-24","start_date":"2021-07-18","name":"ML: Machine Learning"},"main_file_link":[{"open_access":"1","url":"https://proceedings.mlr.press/v139/babaiee21a"}],"status":"public","ddc":["000"],"quality_controlled":"1","author":[{"first_name":"Zahra","full_name":"Babaiee, Zahra","last_name":"Babaiee"},{"last_name":"Hasani","full_name":"Hasani, Ramin","first_name":"Ramin"},{"full_name":"Lechner, Mathias","last_name":"Lechner","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Daniela","last_name":"Rus","full_name":"Rus, Daniela"},{"first_name":"Radu","full_name":"Grosu, Radu","last_name":"Grosu"}],"day":"01","publisher":"ML Research Press","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems"}],"volume":139,"file":[{"file_id":"10681","date_updated":"2022-01-26T07:38:32Z","date_created":"2022-01-26T07:38:32Z","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_size":4246561,"file_name":"babaiee21a.pdf","success":1,"checksum":"d30eae62561bb517d9f978437d7677db","creator":"mlechner"}],"citation":{"mla":"Babaiee, Zahra, et al. “On-off Center-Surround Receptive Fields for Accurate and Robust Image Classification.” <i>Proceedings of the 38th International Conference on Machine Learning</i>, vol. 139, ML Research Press, 2021, pp. 478–89.","ista":"Babaiee Z, Hasani R, Lechner M, Rus D, Grosu R. 2021. On-off center-surround receptive fields for accurate and robust image classification. Proceedings of the 38th International Conference on Machine Learning. ML: Machine Learning, PMLR, vol. 139, 478–489.","ama":"Babaiee Z, Hasani R, Lechner M, Rus D, Grosu R. On-off center-surround receptive fields for accurate and robust image classification. In: <i>Proceedings of the 38th International Conference on Machine Learning</i>. Vol 139. ML Research Press; 2021:478-489.","chicago":"Babaiee, Zahra, Ramin Hasani, Mathias Lechner, Daniela Rus, and Radu Grosu. “On-off Center-Surround Receptive Fields for Accurate and Robust Image Classification.” In <i>Proceedings of the 38th International Conference on Machine Learning</i>, 139:478–89. ML Research Press, 2021.","short":"Z. Babaiee, R. Hasani, M. Lechner, D. Rus, R. Grosu, in:, Proceedings of the 38th International Conference on Machine Learning, ML Research Press, 2021, pp. 478–489.","apa":"Babaiee, Z., Hasani, R., Lechner, M., Rus, D., &#38; Grosu, R. (2021). On-off center-surround receptive fields for accurate and robust image classification. In <i>Proceedings of the 38th International Conference on Machine Learning</i> (Vol. 139, pp. 478–489). Virtual: ML Research Press.","ieee":"Z. Babaiee, R. Hasani, M. Lechner, D. Rus, and R. Grosu, “On-off center-surround receptive fields for accurate and robust image classification,” in <i>Proceedings of the 38th International Conference on Machine Learning</i>, Virtual, 2021, vol. 139, pp. 478–489."},"page":"478-489","alternative_title":["PMLR"],"publication_status":"published","intvolume":"       139","type":"conference","_id":"10668","has_accepted_license":"1","language":[{"iso":"eng"}],"file_date_updated":"2022-01-26T07:38:32Z","title":"On-off center-surround receptive fields for accurate and robust image classification","article_processing_charge":"No","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","short":"CC BY-NC-ND (3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","image":"/images/cc_by_nc_nd.png"},"date_published":"2021-07-01T00:00:00Z","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"publication_identifier":{"issn":["2640-3498"]},"arxiv":1,"acknowledgement":"Z.B. is supported by the Doctoral College Resilient Embedded Systems, which is run jointly by the TU Wien’s Faculty of Informatics and the UAS Technikum Wien. R.G. is partially supported by the Horizon 2020 Era-Permed project Persorad, and ECSEL Project grant no. 783163 (iDev40). R.H and D.R were partially supported by Boeing and MIT. M.L. is supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","date_created":"2022-01-25T15:46:33Z","publication":"Proceedings of the 38th International Conference on Machine Learning","date_updated":"2025-05-19T11:28:08Z","year":"2021","abstract":[{"text":"Robustness to variations in lighting conditions is a key objective for any deep vision system. To this end, our paper extends the receptive field of convolutional neural networks with two residual components, ubiquitous in the visual processing system of vertebrates: On-center and off-center pathways, with an excitatory center and inhibitory surround; OOCS for short. The On-center pathway is excited by the presence of a light stimulus in its center, but not in its surround, whereas the Off-center pathway is excited by the absence of a light stimulus in its center, but not in its surround. We design OOCS pathways via a difference of Gaussians, with their variance computed analytically from the size of the receptive fields. OOCS pathways complement each other in their response to light stimuli, ensuring this way a strong edge-detection capability, and as a result an accurate and robust inference under challenging lighting conditions. We provide extensive empirical evidence showing that networks supplied with OOCS pathways gain accuracy and illumination-robustness from the novel edge representation, compared to other baselines.","lang":"eng"}],"external_id":{"arxiv":["2106.07091"]}},{"file":[{"date_created":"2022-01-26T07:38:08Z","date_updated":"2022-01-26T07:38:08Z","file_id":"10680","content_type":"application/pdf","relation":"main_file","file_size":286906,"access_level":"open_access","file_name":"17372-Article Text-20866-1-2-20210518.pdf","success":1,"checksum":"468d07041e282a1d46ffdae92f709630","creator":"mlechner"}],"citation":{"short":"S. Grunbacher, R. Hasani, M. Lechner, J. Cyranka, S.A. Smolka, R. Grosu, in:, Proceedings of the AAAI Conference on Artificial Intelligence, AAAI Press, 2021, pp. 11525–11535.","apa":"Grunbacher, S., Hasani, R., Lechner, M., Cyranka, J., Smolka, S. A., &#38; Grosu, R. (2021). On the verification of neural ODEs with stochastic guarantees. In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i> (Vol. 35, pp. 11525–11535). Virtual: AAAI Press.","ista":"Grunbacher S, Hasani R, Lechner M, Cyranka J, Smolka SA, Grosu R. 2021. On the verification of neural ODEs with stochastic guarantees. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI: Association for the Advancement of Artificial Intelligence, Technical Tracks, vol. 35, 11525–11535.","chicago":"Grunbacher, Sophie, Ramin Hasani, Mathias Lechner, Jacek Cyranka, Scott A Smolka, and Radu Grosu. “On the Verification of Neural ODEs with Stochastic Guarantees.” In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, 35:11525–35. AAAI Press, 2021.","mla":"Grunbacher, Sophie, et al. “On the Verification of Neural ODEs with Stochastic Guarantees.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 35, no. 13, AAAI Press, 2021, pp. 11525–35.","ama":"Grunbacher S, Hasani R, Lechner M, Cyranka J, Smolka SA, Grosu R. On the verification of neural ODEs with stochastic guarantees. In: <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Vol 35. AAAI Press; 2021:11525-11535.","ieee":"S. Grunbacher, R. Hasani, M. Lechner, J. Cyranka, S. A. Smolka, and R. Grosu, “On the verification of neural ODEs with stochastic guarantees,” in <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, Virtual, 2021, vol. 35, no. 13, pp. 11525–11535."},"page":"11525-11535","publication_status":"published","alternative_title":["Technical Tracks"],"author":[{"first_name":"Sophie","full_name":"Grunbacher, Sophie","last_name":"Grunbacher"},{"full_name":"Hasani, Ramin","last_name":"Hasani","first_name":"Ramin"},{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias","last_name":"Lechner","full_name":"Lechner, Mathias"},{"first_name":"Jacek","full_name":"Cyranka, Jacek","last_name":"Cyranka"},{"first_name":"Scott A","last_name":"Smolka","full_name":"Smolka, Scott A"},{"last_name":"Grosu","full_name":"Grosu, Radu","first_name":"Radu"}],"day":"28","publisher":"AAAI Press","project":[{"name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"volume":35,"quality_controlled":"1","month":"05","conference":{"end_date":"2021-02-09","name":"AAAI: Association for the Advancement of Artificial Intelligence","start_date":"2021-02-02","location":"Virtual"},"oa_version":"Published Version","main_file_link":[{"open_access":"1","url":"https://ojs.aaai.org/index.php/AAAI/article/view/17372"}],"status":"public","ddc":["000"],"issue":"13","acknowledgement":"The authors would like to thank the reviewers for their insightful comments. RH and RG were partially supported by\r\nHorizon-2020 ECSEL Project grant No. 783163 (iDev40). RH was partially supported by Boeing. ML was supported\r\nin part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). SG was funded by FWF\r\nproject W1255-N23. JC was partially supported by NAWA Polish Returns grant PPN/PPO/2018/1/00029. SS was supported by NSF awards DCL-2040599, CCF-1918225, and CPS-1446832.\r\n","publication_identifier":{"isbn":["978-1-57735-866-4"],"eissn":["2374-3468"],"issn":["2159-5399"]},"arxiv":1,"year":"2021","date_updated":"2025-04-15T06:25:56Z","date_created":"2022-01-25T15:47:20Z","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","abstract":[{"lang":"eng","text":"We show that Neural ODEs, an emerging class of timecontinuous neural networks, can be verified by solving a set of global-optimization problems. For this purpose, we introduce Stochastic Lagrangian Reachability (SLR), an\r\nabstraction-based technique for constructing a tight Reachtube (an over-approximation of the set of reachable states\r\nover a given time-horizon), and provide stochastic guarantees in the form of confidence intervals for the Reachtube bounds. SLR inherently avoids the infamous wrapping effect (accumulation of over-approximation errors) by performing local optimization steps to expand safe regions instead of repeatedly forward-propagating them as is done by deterministic reachability methods. To enable fast local optimizations, we introduce a novel forward-mode adjoint sensitivity method to compute gradients without the need for backpropagation. Finally, we establish asymptotic and non-asymptotic convergence rates for SLR."}],"external_id":{"arxiv":["2012.08863"]},"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"oa":1,"corr_author":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2022-01-26T07:38:08Z","language":[{"iso":"eng"}],"title":"On the verification of neural ODEs with stochastic guarantees","article_processing_charge":"No","date_published":"2021-05-28T00:00:00Z","intvolume":"        35","type":"conference","_id":"10669","has_accepted_license":"1"},{"main_file_link":[{"url":"https://proceedings.neurips.cc/paper/2021/hash/67ba02d73c54f0b83c05507b7fb7267f-Abstract.html","open_access":"1"}],"status":"public","ddc":["000"],"month":"12","oa_version":"Published Version","conference":{"end_date":"2021-12-10","start_date":"2021-12-06","name":"NeurIPS: Neural Information Processing Systems","location":"Virtual"},"quality_controlled":"1","project":[{"name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"author":[{"first_name":"Charles J","last_name":"Vorbach","full_name":"Vorbach, Charles J"},{"last_name":"Hasani","full_name":"Hasani, Ramin","first_name":"Ramin"},{"first_name":"Alexander","last_name":"Amini","full_name":"Amini, Alexander"},{"full_name":"Lechner, Mathias","last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias"},{"first_name":"Daniela","last_name":"Rus","full_name":"Rus, Daniela"}],"day":"01","citation":{"ieee":"C. J. Vorbach, R. Hasani, A. Amini, M. Lechner, and D. Rus, “Causal navigation by continuous-time neural networks,” in <i>35th Conference on Neural Information Processing Systems</i>, Virtual, 2021.","apa":"Vorbach, C. J., Hasani, R., Amini, A., Lechner, M., &#38; Rus, D. (2021). Causal navigation by continuous-time neural networks. In <i>35th Conference on Neural Information Processing Systems</i>. Virtual.","short":"C.J. Vorbach, R. Hasani, A. Amini, M. Lechner, D. Rus, in:, 35th Conference on Neural Information Processing Systems, 2021.","ama":"Vorbach CJ, Hasani R, Amini A, Lechner M, Rus D. Causal navigation by continuous-time neural networks. In: <i>35th Conference on Neural Information Processing Systems</i>. ; 2021.","mla":"Vorbach, Charles J., et al. “Causal Navigation by Continuous-Time Neural Networks.” <i>35th Conference on Neural Information Processing Systems</i>, 2021.","chicago":"Vorbach, Charles J, Ramin Hasani, Alexander Amini, Mathias Lechner, and Daniela Rus. “Causal Navigation by Continuous-Time Neural Networks.” In <i>35th Conference on Neural Information Processing Systems</i>, 2021.","ista":"Vorbach CJ, Hasani R, Amini A, Lechner M, Rus D. 2021. Causal navigation by continuous-time neural networks. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems,  Advances in Neural Information Processing Systems, ."},"file":[{"creator":"mlechner","success":1,"checksum":"be81f0ade174a8c9b2d4fe09590b2021","file_size":6841228,"access_level":"open_access","relation":"main_file","file_name":"NeurIPS-2021-causal-navigation-by-continuous-time-neural-networks-Paper.pdf","date_created":"2022-01-26T07:37:24Z","date_updated":"2022-01-26T07:37:24Z","file_id":"10679","content_type":"application/pdf"}],"publication_status":"published","alternative_title":[" Advances in Neural Information Processing Systems"],"_id":"10670","type":"conference","has_accepted_license":"1","title":"Causal navigation by continuous-time neural networks","article_processing_charge":"No","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","short":"CC BY-NC-ND (3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","image":"/images/cc_by_nc_nd.png"},"date_published":"2021-12-01T00:00:00Z","file_date_updated":"2022-01-26T07:37:24Z","language":[{"iso":"eng"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","oa":1,"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"abstract":[{"text":"Imitation learning enables high-fidelity, vision-based learning of policies within rich, photorealistic environments. However, such techniques often rely on traditional discrete-time neural models and face difficulties in generalizing to domain shifts by failing to account for the causal relationships between the agent and the environment. In this paper, we propose a theoretical and experimental framework for learning causal representations using continuous-time neural networks, specifically over their discrete-time counterparts. We evaluate our method in the context of visual-control learning of drones over a series of complex tasks, ranging from short- and long-term navigation, to chasing static and dynamic objects through photorealistic environments. Our results demonstrate that causal continuous-time\r\ndeep models can perform robust navigation tasks, where advanced recurrent models fail. These models learn complex causal control representations directly from raw visual inputs and scale to solve a variety of tasks using imitation learning.","lang":"eng"}],"external_id":{"arxiv":["2106.08314"]},"arxiv":1,"acknowledgement":"C.V., R.H. A.A. and D.R. are partially supported by Boeing and MIT. A.A. is supported by the National Science Foundation (NSF) Graduate Research Fellowship Program. M.L. is supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). Research was sponsored by the United States Air Force Research Laboratory and the United States Air Force Artificial Intelligence Accelerator and was accomplished under Cooperative Agreement Number FA8750-19-2-1000. The views and conclusions contained in this document are those of the authors\r\nand should not be interpreted as representing the official policies, either expressed or implied, of the United States Air Force or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation herein.\r\n","date_created":"2022-01-25T15:47:50Z","publication":"35th Conference on Neural Information Processing Systems","year":"2021","date_updated":"2025-04-15T06:25:56Z"},{"file":[{"date_created":"2022-01-26T07:36:03Z","date_updated":"2022-01-26T07:36:03Z","file_id":"10678","content_type":"application/pdf","file_size":4302669,"relation":"main_file","access_level":"open_access","file_name":"16936-Article Text-20430-1-2-20210518 (1).pdf","success":1,"checksum":"0f06995fba06dbcfa7ed965fc66027ff","creator":"mlechner"}],"citation":{"ieee":"R. Hasani, M. Lechner, A. Amini, D. Rus, and R. Grosu, “Liquid time-constant networks,” in <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, Virtual, 2021, vol. 35, no. 9, pp. 7657–7666.","apa":"Hasani, R., Lechner, M., Amini, A., Rus, D., &#38; Grosu, R. (2021). Liquid time-constant networks. In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i> (Vol. 35, pp. 7657–7666). Virtual: AAAI Press.","short":"R. Hasani, M. Lechner, A. Amini, D. Rus, R. Grosu, in:, Proceedings of the AAAI Conference on Artificial Intelligence, AAAI Press, 2021, pp. 7657–7666.","ista":"Hasani R, Lechner M, Amini A, Rus D, Grosu R. 2021. Liquid time-constant networks. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI: Association for the Advancement of Artificial Intelligence, Technical Tracks, vol. 35, 7657–7666.","mla":"Hasani, Ramin, et al. “Liquid Time-Constant Networks.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 35, no. 9, AAAI Press, 2021, pp. 7657–66.","ama":"Hasani R, Lechner M, Amini A, Rus D, Grosu R. Liquid time-constant networks. In: <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Vol 35. AAAI Press; 2021:7657-7666.","chicago":"Hasani, Ramin, Mathias Lechner, Alexander Amini, Daniela Rus, and Radu Grosu. “Liquid Time-Constant Networks.” In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, 35:7657–66. AAAI Press, 2021."},"publication_status":"published","page":"7657-7666","alternative_title":["Technical Tracks"],"project":[{"name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"publisher":"AAAI Press","volume":35,"author":[{"last_name":"Hasani","full_name":"Hasani, Ramin","first_name":"Ramin"},{"last_name":"Lechner","full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias"},{"first_name":"Alexander","last_name":"Amini","full_name":"Amini, Alexander"},{"first_name":"Daniela","last_name":"Rus","full_name":"Rus, Daniela"},{"last_name":"Grosu","full_name":"Grosu, Radu","first_name":"Radu"}],"day":"28","quality_controlled":"1","status":"public","main_file_link":[{"url":"https://ojs.aaai.org/index.php/AAAI/article/view/16936","open_access":"1"}],"ddc":["000"],"issue":"9","month":"05","conference":{"location":"Virtual","start_date":"2021-02-02","name":"AAAI: Association for the Advancement of Artificial Intelligence","end_date":"2021-02-09"},"oa_version":"Published Version","abstract":[{"lang":"eng","text":"We introduce a new class of time-continuous recurrent neural network models. Instead of declaring a learning system’s dynamics by implicit nonlinearities, we construct networks of linear first-order dynamical systems modulated via nonlinear interlinked gates. The resulting models represent dynamical systems with varying (i.e., liquid) time-constants coupled to their hidden state, with outputs being computed by numerical differential equation solvers. These neural networks exhibit stable and bounded behavior, yield superior expressivity within the family of neural ordinary differential equations, and give rise to improved performance on time-series prediction tasks. To demonstrate these properties, we first take a theoretical approach to find bounds over their dynamics, and compute their expressive power by the trajectory length measure in a latent trajectory space. We then conduct a series of time-series prediction experiments to manifest the approximation capability of Liquid Time-Constant Networks (LTCs) compared to classical and modern RNNs."}],"external_id":{"arxiv":["2006.04439"]},"arxiv":1,"publication_identifier":{"isbn":["978-1-57735-866-4"],"issn":["2159-5399"],"eissn":["2374-3468"]},"acknowledgement":"R.H. and D.R. are partially supported by Boeing. R.H. and R.G. were partially supported by the Horizon-2020 ECSEL\r\nProject grant No. 783163 (iDev40). M.L. was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). A.A. is supported by the National Science Foundation (NSF) Graduate Research Fellowship Program. This research work is partially drawn from the PhD dissertation of R.H.","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","date_created":"2022-01-25T15:48:36Z","year":"2021","date_updated":"2025-04-15T06:25:56Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","corr_author":"1","oa":1,"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"title":"Liquid time-constant networks","article_processing_charge":"No","date_published":"2021-05-28T00:00:00Z","file_date_updated":"2022-01-26T07:36:03Z","language":[{"iso":"eng"}],"type":"conference","_id":"10671","has_accepted_license":"1","intvolume":"        35"},{"oa":1,"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","corr_author":"1","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"abstract":[{"lang":"eng","text":"In a two-player zero-sum graph game the players move a token throughout a graph to produce an infinite path, which determines the winner or payoff of the game. Traditionally, the players alternate turns in moving the token. In bidding games, however, the players have budgets, and in each turn, we hold an “auction” (bidding) to determine which player moves the token: both players simultaneously submit bids and the higher bidder moves the token. The bidding mechanisms differ in their payment schemes. Bidding games were largely studied with variants of first-price bidding in which only the higher bidder pays his bid. We focus on all-pay bidding, where both players pay their bids. Finite-duration all-pay bidding games were studied and shown to be technically more challenging than their first-price counterparts. We study for the first time, infinite-duration all-pay bidding games. Our most interesting results are for mean-payoff objectives: we portray a complete picture for games played on strongly-connected graphs. We study both pure (deterministic) and mixed (probabilistic) strategies and completely characterize the optimal and almost-sure (with probability 1) payoffs the players can respectively guarantee. We show that mean-payoff games under all-pay bidding exhibit the intriguing mathematical properties of their first-price counterparts; namely, an equivalence with random-turn games in which in each turn, the player who moves is selected according to a (biased) coin toss. The equivalences for all-pay bidding are more intricate and unexpected than for first-price bidding."}],"external_id":{"arxiv":["2005.06636"]},"acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award), ERC CoG 863818 (FoRM-SMArt), and by the European Union's Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","publication_identifier":{"isbn":["978-1-61197-646-5"]},"arxiv":1,"year":"2021","date_updated":"2025-04-15T06:26:15Z","publication":"Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms","date_created":"2022-01-27T12:11:23Z","_id":"10694","type":"conference","title":"Infinite-duration all-pay bidding games","article_processing_charge":"No","date_published":"2021-01-01T00:00:00Z","editor":[{"full_name":"Marx, Dániel","last_name":"Marx","first_name":"Dániel"}],"language":[{"iso":"eng"}],"publisher":"Society for Industrial and Applied Mathematics","project":[{"name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211"},{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","call_identifier":"H2020"},{"grant_number":"665385","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program"}],"author":[{"id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","first_name":"Guy","orcid":"0000-0001-5588-8287","full_name":"Avni, Guy","last_name":"Avni"},{"full_name":"Jecker, Ismael R","last_name":"Jecker","first_name":"Ismael R","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425"},{"first_name":"Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4681-1699","last_name":"Zikelic","full_name":"Zikelic, Dorde"}],"day":"01","ec_funded":1,"scopus_import":"1","citation":{"short":"G. Avni, I.R. Jecker, D. Zikelic, in:, D. Marx (Ed.), Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2021, pp. 617–636.","apa":"Avni, G., Jecker, I. R., &#38; Zikelic, D. (2021). Infinite-duration all-pay bidding games. In D. Marx (Ed.), <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 617–636). Virtual: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611976465.38\">https://doi.org/10.1137/1.9781611976465.38</a>","ista":"Avni G, Jecker IR, Zikelic D. 2021. Infinite-duration all-pay bidding games. Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 617–636.","ama":"Avni G, Jecker IR, Zikelic D. Infinite-duration all-pay bidding games. In: Marx D, ed. <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i>. Society for Industrial and Applied Mathematics; 2021:617-636. doi:<a href=\"https://doi.org/10.1137/1.9781611976465.38\">10.1137/1.9781611976465.38</a>","mla":"Avni, Guy, et al. “Infinite-Duration All-Pay Bidding Games.” <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i>, edited by Dániel Marx, Society for Industrial and Applied Mathematics, 2021, pp. 617–36, doi:<a href=\"https://doi.org/10.1137/1.9781611976465.38\">10.1137/1.9781611976465.38</a>.","chicago":"Avni, Guy, Ismael R Jecker, and Dorde Zikelic. “Infinite-Duration All-Pay Bidding Games.” In <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i>, edited by Dániel Marx, 617–36. Society for Industrial and Applied Mathematics, 2021. <a href=\"https://doi.org/10.1137/1.9781611976465.38\">https://doi.org/10.1137/1.9781611976465.38</a>.","ieee":"G. Avni, I. R. Jecker, and D. Zikelic, “Infinite-duration all-pay bidding games,” in <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i>, Virtual, 2021, pp. 617–636."},"publication_status":"published","page":"617-636","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2005.06636"}],"status":"public","month":"01","oa_version":"Preprint","conference":{"location":"Virtual","start_date":"2021-01-10","name":"SODA: Symposium on Discrete Algorithms","end_date":"2021-01-13"},"doi":"10.1137/1.9781611976465.38","quality_controlled":"1"},{"department":[{"_id":"GeKa"},{"_id":"NanoFab"},{"_id":"GradSch"}],"oa":1,"corr_author":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This research was supported by the Scientific Service Units of Institute of Science and Technology (IST) Austria through resources provided by the Miba Machine Shop and the nanofabrication facility, and was made possible with the support of the NOMIS Foundation. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under Marie Sklodowska-Curie grant agreements no. 844511 and no. 75441, and by the Austrian Science Fund FWF-P 30207 project. A.B. acknowledges support from the European Union Horizon 2020 FET project microSPIRE, no. 766955. M. Botifoll and J.A. acknowledge funding from Generalitat de Catalunya 2017 SGR 327. The Catalan Institute of Nanoscience and Nanotechnology (ICN2) is supported by the Severo Ochoa programme from the Spanish Ministery of Economy (MINECO) (grant no. SEV-2017-0706) and is funded by the Catalonian Research Centre (CERCA) Programme, Generalitat de Catalunya. Part of the present work has been performed within the framework of the Universitat Autónoma de Barcelona Materials Science PhD programme. Part of the HAADF scanning transmission electron microscopy was conducted in the Laboratorio de Microscopias Avanzadas at Instituto de Nanociencia de Aragon, Universidad de Zaragoza. ICN2 acknowledge support from the Spanish Superior Council of Scientific Research (CSIC) Research Platform on Quantum Technologies PTI-001. M.B. acknowledges funding from the Catalan Agency for Management of University and Research Grants (AGAUR) Generalitat de Catalunya formation of investigators (FI) PhD grant.","arxiv":1,"publication_identifier":{"eissn":["1476-4660"],"issn":["1476-1122"]},"date_updated":"2026-06-23T22:30:24Z","year":"2021","publication":"Nature Materials","date_created":"2020-12-02T10:50:47Z","abstract":[{"text":"Spin qubits are considered to be among the most promising candidates for building a quantum processor. Group IV hole spin qubits have moved into the focus of interest due to the ease of operation and compatibility with Si technology. In addition, Ge offers the option for monolithic superconductor-semiconductor integration. Here we demonstrate a hole spin qubit operating at fields below 10 mT, the critical field of Al, by exploiting the large out-of-plane hole g-factors in planar Ge and by encoding the qubit into the singlet-triplet states of a double quantum dot. We observe electrically controlled X and Z-rotations with tunable frequencies exceeding 100 MHz and dephasing times of 1μs which we extend beyond 15μs with echo techniques. These results show that Ge hole singlet triplet qubits outperform their electronic Si and GaAs based counterparts in speed and coherence, respectively. In addition, they are on par with Ge single spin qubits, but can be operated at much lower fields underlining their potential for on chip integration with superconducting technologies.","lang":"eng"}],"external_id":{"arxiv":["2011.13755"],"isi":["000657596400001"],"pmid":["34083775"]},"intvolume":"        20","type":"journal_article","_id":"8909","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"language":[{"iso":"eng"}],"title":"A singlet triplet hole spin qubit in planar Ge","article_processing_charge":"No","date_published":"2021-08-01T00:00:00Z","pmid":1,"author":[{"last_name":"Jirovec","full_name":"Jirovec, Daniel","orcid":"0000-0002-7197-4801","first_name":"Daniel","id":"4C473F58-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Hofmann, Andrea C","last_name":"Hofmann","id":"340F461A-F248-11E8-B48F-1D18A9856A87","first_name":"Andrea C"},{"first_name":"Andrea","last_name":"Ballabio","full_name":"Ballabio, Andrea"},{"first_name":"Philipp M.","full_name":"Mutter, Philipp M.","last_name":"Mutter"},{"last_name":"Tavani","full_name":"Tavani, Giulio","first_name":"Giulio"},{"first_name":"Marc","last_name":"Botifoll","full_name":"Botifoll, Marc"},{"last_name":"Crippa","full_name":"Crippa, Alessandro","id":"1F2B21A2-F6E7-11E9-9B82-F7DBE5697425","first_name":"Alessandro","orcid":"0000-0002-2968-611X"},{"last_name":"Kukucka","full_name":"Kukucka, Josip","first_name":"Josip","id":"3F5D8856-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Sagi, Oliver","last_name":"Sagi","first_name":"Oliver","id":"71616374-A8E9-11E9-A7CA-09ECE5697425"},{"orcid":"0000-0003-2668-2401","id":"38F80F9A-1CB8-11EA-BC76-B49B3DDC885E","first_name":"Frederico","last_name":"Martins","full_name":"Martins, Frederico"},{"first_name":"Jaime","id":"e0390f72-f6e0-11ea-865d-862393336714","full_name":"Saez Mollejo, Jaime","last_name":"Saez Mollejo"},{"full_name":"Prieto Gonzalez, Ivan","last_name":"Prieto Gonzalez","id":"2A307FE2-F248-11E8-B48F-1D18A9856A87","first_name":"Ivan","orcid":"0000-0002-7370-5357"},{"first_name":"Maksim","id":"2ac7a0a2-3562-11eb-9256-fbd18ea55087","last_name":"Borovkov","full_name":"Borovkov, Maksim"},{"full_name":"Arbiol, Jordi","last_name":"Arbiol","first_name":"Jordi"},{"last_name":"Chrastina","full_name":"Chrastina, Daniel","first_name":"Daniel"},{"first_name":"Giovanni","last_name":"Isella","full_name":"Isella, Giovanni"},{"last_name":"Katsaros","full_name":"Katsaros, Georgios","first_name":"Georgios","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8342-202X"}],"related_material":{"link":[{"url":"https://ist.ac.at/en/news/quantum-computing-with-holes/","description":"News on IST Homepage","relation":"press_release"}],"record":[{"relation":"research_data","status":"public","id":"9323"},{"relation":"dissertation_contains","status":"public","id":"10058"}]},"day":"01","project":[{"grant_number":"844511","call_identifier":"H2020","_id":"26A151DA-B435-11E9-9278-68D0E5697425","name":"Majorana bound states in Ge/SiGe heterostructures"},{"_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships"},{"name":"Hole spin orbit qubits in Ge quantum wells","_id":"2641CE5E-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P30207"},{"name":"Hybrid Semiconductor - Superconductor Quantum Devices","_id":"262116AA-B435-11E9-9278-68D0E5697425"}],"publisher":"Springer Nature","volume":20,"citation":{"apa":"Jirovec, D., Hofmann, A. C., Ballabio, A., Mutter, P. M., Tavani, G., Botifoll, M., … Katsaros, G. (2021). A singlet triplet hole spin qubit in planar Ge. <i>Nature Materials</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41563-021-01022-2\">https://doi.org/10.1038/s41563-021-01022-2</a>","short":"D. Jirovec, A.C. Hofmann, A. Ballabio, P.M. Mutter, G. Tavani, M. Botifoll, A. Crippa, J. Kukucka, O. Sagi, F. Martins, J. Saez Mollejo, I. Prieto Gonzalez, M. Borovkov, J. Arbiol, D. Chrastina, G. Isella, G. Katsaros, Nature Materials 20 (2021) 1106–1112.","ista":"Jirovec D, Hofmann AC, Ballabio A, Mutter PM, Tavani G, Botifoll M, Crippa A, Kukucka J, Sagi O, Martins F, Saez Mollejo J, Prieto Gonzalez I, Borovkov M, Arbiol J, Chrastina D, Isella G, Katsaros G. 2021. A singlet triplet hole spin qubit in planar Ge. Nature Materials. 20(8), 1106–1112.","ama":"Jirovec D, Hofmann AC, Ballabio A, et al. A singlet triplet hole spin qubit in planar Ge. <i>Nature Materials</i>. 2021;20(8):1106–1112. doi:<a href=\"https://doi.org/10.1038/s41563-021-01022-2\">10.1038/s41563-021-01022-2</a>","mla":"Jirovec, Daniel, et al. “A Singlet Triplet Hole Spin Qubit in Planar Ge.” <i>Nature Materials</i>, vol. 20, no. 8, Springer Nature, 2021, pp. 1106–1112, doi:<a href=\"https://doi.org/10.1038/s41563-021-01022-2\">10.1038/s41563-021-01022-2</a>.","chicago":"Jirovec, Daniel, Andrea C Hofmann, Andrea Ballabio, Philipp M. Mutter, Giulio Tavani, Marc Botifoll, Alessandro Crippa, et al. “A Singlet Triplet Hole Spin Qubit in Planar Ge.” <i>Nature Materials</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1038/s41563-021-01022-2\">https://doi.org/10.1038/s41563-021-01022-2</a>.","ieee":"D. Jirovec <i>et al.</i>, “A singlet triplet hole spin qubit in planar Ge,” <i>Nature Materials</i>, vol. 20, no. 8. Springer Nature, pp. 1106–1112, 2021."},"isi":1,"publication_status":"published","page":"1106–1112","ec_funded":1,"scopus_import":"1","article_type":"original","month":"08","oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2011.13755"}],"status":"public","issue":"8","quality_controlled":"1","doi":"10.1038/s41563-021-01022-2"},{"article_processing_charge":"No","title":"Parameterized and algebro-geometric advances in static program analysis","tmp":{"legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","image":"/images/cc_0.png","name":"Creative Commons Public Domain Dedication (CC0 1.0)","short":"CC0 (1.0)"},"date_published":"2021-01-01T00:00:00Z","file_date_updated":"2021-12-23T23:30:04Z","language":[{"iso":"eng"}],"_id":"8934","type":"dissertation","has_accepted_license":"1","abstract":[{"lang":"eng","text":"In this thesis, we consider several of the most classical and fundamental problems in static analysis and formal verification, including invariant generation, reachability analysis, termination analysis of probabilistic programs, data-flow analysis, quantitative analysis of Markov chains and Markov decision processes, and the problem of data packing in cache management.\r\nWe use techniques from parameterized complexity theory, polyhedral geometry, and real algebraic geometry to significantly improve the state-of-the-art, in terms of both scalability and completeness guarantees, for the mentioned problems. In some cases, our results are the first theoretical improvements for the respective problems in two or three decades."}],"publication_identifier":{"issn":["2663-337X"]},"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).","date_created":"2020-12-10T12:17:07Z","year":"2021","date_updated":"2026-04-16T10:07:18Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","corr_author":"1","oa":1,"supervisor":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"}],"department":[{"_id":"KrCh"},{"_id":"GradSch"}],"doi":"10.15479/AT:ISTA:8934","OA_place":"publisher","license":"https://creativecommons.org/publicdomain/zero/1.0/","status":"public","ddc":["005"],"degree_awarded":"PhD","month":"01","oa_version":"Published Version","file":[{"checksum":"d1b9db3725aed34dadd81274aeb9426c","embargo":"2021-12-22","creator":"akafshda","file_id":"8969","date_updated":"2021-12-23T23:30:04Z","date_created":"2020-12-22T20:08:44Z","content_type":"application/pdf","access_level":"open_access","file_size":5251507,"relation":"main_file","file_name":"Thesis-pdfa.pdf"},{"creator":"akafshda","embargo_to":"open_access","checksum":"1661df7b393e6866d2460eba3c905130","file_name":"source.zip","access_level":"closed","file_size":10636756,"relation":"source_file","content_type":"application/zip","date_created":"2020-12-22T20:08:50Z","file_id":"8970","date_updated":"2021-03-04T23:30:04Z"}],"citation":{"ieee":"A. K. Goharshady, “Parameterized and algebro-geometric advances in static program analysis,” Institute of Science and Technology Austria, 2021.","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>","short":"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>","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.","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>."},"publication_status":"published","page":"278","alternative_title":["ISTA Thesis"],"publisher":"Institute of Science and Technology Austria","project":[{"name":"Quantitative Analysis of Probabilistic Systems with a focus on Crypto-Currencies","_id":"267066CE-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts","_id":"266EEEC0-B435-11E9-9278-68D0E5697425"}],"author":[{"last_name":"Goharshady","full_name":"Goharshady, Amir Kafshdar","orcid":"0000-0003-1702-6584","first_name":"Amir Kafshdar","id":"391365CE-F248-11E8-B48F-1D18A9856A87"}],"day":"01","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"6490"},{"relation":"part_of_dissertation","status":"public","id":"6780"},{"id":"7158","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"66"},{"id":"6378","relation":"part_of_dissertation","status":"public"},{"id":"311","status":"public","relation":"part_of_dissertation"},{"id":"6175","relation":"part_of_dissertation","status":"public"},{"id":"6340","status":"public","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"7014"},{"id":"6009","status":"public","relation":"part_of_dissertation"},{"id":"1437","status":"public","relation":"part_of_dissertation"},{"id":"8728","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"8089"},{"status":"public","relation":"part_of_dissertation","id":"6380"},{"id":"5977","relation":"part_of_dissertation","status":"public"},{"id":"6056","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"639"},{"status":"public","relation":"part_of_dissertation","id":"1386"},{"id":"6918","status":"public","relation":"part_of_dissertation"},{"id":"7810","relation":"part_of_dissertation","status":"public"},{"id":"949","relation":"part_of_dissertation","status":"public"}]}},{"ec_funded":1,"citation":{"ama":"Cipolloni G. Fluctuations in the spectrum of random matrices. 2021. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9022\">10.15479/AT:ISTA:9022</a>","mla":"Cipolloni, Giorgio. <i>Fluctuations in the Spectrum of Random Matrices</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9022\">10.15479/AT:ISTA:9022</a>.","ista":"Cipolloni G. 2021. Fluctuations in the spectrum of random matrices. Institute of Science and Technology Austria.","chicago":"Cipolloni, Giorgio. “Fluctuations in the Spectrum of Random Matrices.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/AT:ISTA:9022\">https://doi.org/10.15479/AT:ISTA:9022</a>.","apa":"Cipolloni, G. (2021). <i>Fluctuations in the spectrum of random matrices</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:9022\">https://doi.org/10.15479/AT:ISTA:9022</a>","short":"G. Cipolloni, Fluctuations in the Spectrum of Random Matrices, Institute of Science and Technology Austria, 2021.","ieee":"G. Cipolloni, “Fluctuations in the spectrum of random matrices,” Institute of Science and Technology Austria, 2021."},"file":[{"file_name":"thesis.pdf","access_level":"open_access","relation":"main_file","file_size":4127796,"content_type":"application/pdf","date_created":"2021-01-25T14:19:03Z","file_id":"9043","date_updated":"2021-01-25T14:19:03Z","creator":"gcipollo","checksum":"5a93658a5f19478372523ee232887e2b","success":1},{"checksum":"e8270eddfe6a988e92a53c88d1d19b8c","creator":"gcipollo","content_type":"application/zip","file_id":"9044","date_updated":"2021-01-25T14:19:10Z","date_created":"2021-01-25T14:19:10Z","file_name":"Thesis_files.zip","relation":"source_file","file_size":12775206,"access_level":"closed"}],"alternative_title":["ISTA Thesis"],"page":"380","publication_status":"published","publisher":"Institute of Science and Technology Austria","project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","call_identifier":"H2020","name":"International IST Doctoral Program"},{"name":"Random matrices, universality and disordered quantum systems","grant_number":"338804","call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425"}],"author":[{"last_name":"Cipolloni","full_name":"Cipolloni, Giorgio","id":"42198EFA-F248-11E8-B48F-1D18A9856A87","first_name":"Giorgio","orcid":"0000-0002-4901-7992"}],"day":"25","doi":"10.15479/AT:ISTA:9022","OA_place":"publisher","status":"public","ddc":["510"],"degree_awarded":"PhD","month":"01","oa_version":"Published Version","abstract":[{"lang":"eng","text":"In the first part of the thesis we consider Hermitian random matrices. Firstly, we consider sample covariance matrices XX∗ with X having independent identically distributed (i.i.d.) centred entries. We prove a Central Limit Theorem for differences of linear statistics of XX∗ and its minor after removing the first column of X. Secondly, we consider Wigner-type matrices and prove that the eigenvalue statistics near cusp singularities of the limiting density of states are universal and that they form a Pearcey process. Since the limiting eigenvalue distribution admits only square root (edge) and cubic root (cusp) singularities, this concludes the third and last remaining case of the Wigner-Dyson-Mehta universality conjecture. The main technical ingredients are an optimal local law at the cusp, and the proof of the fast relaxation to equilibrium of the Dyson Brownian motion in the cusp regime.\r\nIn the second part we consider non-Hermitian matrices X with centred i.i.d. entries. We normalise the entries of X to have variance N −1. It is well known that the empirical eigenvalue density converges to the uniform distribution on the unit disk (circular law). In the first project, we prove universality of the local eigenvalue statistics close to the edge of the spectrum. This is the non-Hermitian analogue of the TracyWidom universality at the Hermitian edge. Technically we analyse the evolution of the spectral distribution of X along the Ornstein-Uhlenbeck flow for very long time\r\n(up to t = +∞). In the second project, we consider linear statistics of eigenvalues for macroscopic test functions f in the Sobolev space H2+ϵ and prove their convergence to the projection of the Gaussian Free Field on the unit disk. We prove this result for non-Hermitian matrices with real or complex entries. The main technical ingredients are: (i) local law for products of two resolvents at different spectral parameters, (ii) analysis of correlated Dyson Brownian motions.\r\nIn the third and final part we discuss the mathematically rigorous application of supersymmetric techniques (SUSY ) to give a lower tail estimate of the lowest singular value of X − z, with z ∈ C. More precisely, we use superbosonisation formula to give an integral representation of the resolvent of (X − z)(X − z)∗ which reduces to two and three contour integrals in the complex and real case, respectively. The rigorous analysis of these integrals is quite challenging since simple saddle point analysis cannot be applied (the main contribution comes from a non-trivial manifold). Our result\r\nimproves classical smoothing inequalities in the regime |z| ≈ 1; this result is essential to prove edge universality for i.i.d. non-Hermitian matrices."}],"publication_identifier":{"issn":["2663-337X"]},"acknowledgement":"I gratefully acknowledge the financial support from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385 and my advisor’s ERC Advanced Grant No. 338804.","date_created":"2021-01-21T18:16:54Z","year":"2021","date_updated":"2026-04-08T06:59:33Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","corr_author":"1","oa":1,"supervisor":[{"last_name":"Erdös","full_name":"Erdös, László","orcid":"0000-0001-5366-9603","first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"}],"department":[{"_id":"GradSch"},{"_id":"LaEr"}],"article_processing_charge":"No","title":"Fluctuations in the spectrum of random matrices","date_published":"2021-01-25T00:00:00Z","file_date_updated":"2021-01-25T14:19:10Z","language":[{"iso":"eng"}],"type":"dissertation","_id":"9022","has_accepted_license":"1"}]