[{"_id":"12919","keyword":["Organic Chemistry","Catalysis"],"status":"public","type":"journal_article","article_type":"original","extern":"1","date_updated":"2023-05-15T08:43:50Z","oa_version":"None","abstract":[{"text":"We report the visible light photocatalytic cleavage of trityl thioethers or ethers under pH-neutral conditions. The method results in the formation of the respective symmetrical disulfides and alcohols in moderate to excellent yield. The protocol only requires the addition of a suitable photocatalyst and light rendering it orthogonal to several functionalities, including acid labile protective groups. The same conditions can be used to directly convert trityl-protected thiols into unsymmetrical disulfides or selenosulfides, and to cleave trityl resins in solid phase organic synthesis.","lang":"eng"}],"intvolume":" 55","month":"05","scopus_import":"1","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["0039-7881"],"eissn":["1437-210X"]},"volume":55,"issue":"09","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Murakami, Sho, et al. “Photocatalytic Cleavage of Trityl Protected Thiols and Alcohols.” Synthesis, vol. 55, no. 09, Georg Thieme Verlag, 2023, pp. 1367–74, doi:10.1055/a-1979-5933.","ama":"Murakami S, Brudy C, Bachmann M, Takemoto Y, Pieber B. Photocatalytic cleavage of trityl protected thiols and alcohols. Synthesis. 2023;55(09):1367-1374. doi:10.1055/a-1979-5933","apa":"Murakami, S., Brudy, C., Bachmann, M., Takemoto, Y., & Pieber, B. (2023). Photocatalytic cleavage of trityl protected thiols and alcohols. Synthesis. Georg Thieme Verlag. https://doi.org/10.1055/a-1979-5933","short":"S. Murakami, C. Brudy, M. Bachmann, Y. Takemoto, B. Pieber, Synthesis 55 (2023) 1367–1374.","ieee":"S. Murakami, C. Brudy, M. Bachmann, Y. Takemoto, and B. Pieber, “Photocatalytic cleavage of trityl protected thiols and alcohols,” Synthesis, vol. 55, no. 09. Georg Thieme Verlag, pp. 1367–1374, 2023.","chicago":"Murakami, Sho, Cosima Brudy, Moritz Bachmann, Yoshiji Takemoto, and Bartholomäus Pieber. “Photocatalytic Cleavage of Trityl Protected Thiols and Alcohols.” Synthesis. Georg Thieme Verlag, 2023. https://doi.org/10.1055/a-1979-5933.","ista":"Murakami S, Brudy C, Bachmann M, Takemoto Y, Pieber B. 2023. Photocatalytic cleavage of trityl protected thiols and alcohols. Synthesis. 55(09), 1367–1374."},"title":"Photocatalytic cleavage of trityl protected thiols and alcohols","article_processing_charge":"No","author":[{"first_name":"Sho","full_name":"Murakami, Sho","last_name":"Murakami"},{"first_name":"Cosima","full_name":"Brudy, Cosima","last_name":"Brudy"},{"full_name":"Bachmann, Moritz","last_name":"Bachmann","first_name":"Moritz"},{"last_name":"Takemoto","full_name":"Takemoto, Yoshiji","first_name":"Yoshiji"},{"first_name":"Bartholomäus","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","last_name":"Pieber","orcid":"0000-0001-8689-388X","full_name":"Pieber, Bartholomäus"}],"publisher":"Georg Thieme Verlag","quality_controlled":"1","publication":"Synthesis","day":"01","year":"2023","date_created":"2023-05-08T08:25:08Z","doi":"10.1055/a-1979-5933","date_published":"2023-05-01T00:00:00Z","page":"1367-1374"},{"ec_funded":1,"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9781450399135"]},"publication_status":"published","month":"06","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2303.04014"}],"oa_version":"Preprint","abstract":[{"text":"In this paper we introduce a pruning of the medial axis called the (λ,α)-medial axis (axλα). We prove that the (λ,α)-medial axis of a set K is stable in a Gromov-Hausdorff sense under weak assumptions. More formally we prove that if K and K′ are close in the Hausdorff (dH) sense then the (λ,α)-medial axes of K and K′ are close as metric spaces, that is the Gromov-Hausdorff distance (dGH) between the two is 1/4-Hölder in the sense that dGH (axλα(K),axλα(K′)) ≲ dH(K,K′)1/4. The Hausdorff distance between the two medial axes is also bounded, by dH (axλα(K),λα(K′)) ≲ dH(K,K′)1/2. These quantified stability results provide guarantees for practical computations of medial axes from approximations. Moreover, they provide key ingredients for studying the computability of the medial axis in the context of computable analysis.","lang":"eng"}],"department":[{"_id":"HeEd"}],"date_updated":"2023-05-22T08:15:19Z","status":"public","type":"conference","conference":{"name":"STOC: Symposium on Theory of Computing","end_date":"2023-06-23","location":"Orlando, FL, United States","start_date":"2023-06-20"},"_id":"13048","date_published":"2023-06-02T00:00:00Z","doi":"10.1145/3564246.3585113","date_created":"2023-05-22T08:02:02Z","page":"1768-1776","day":"02","publication":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","year":"2023","publisher":"Association for Computing Machinery","quality_controlled":"1","oa":1,"acknowledgement":"We are greatly indebted to Erin Chambers for posing a number of questions that eventually led to this paper. We would also like to thank the other organizers of the workshop on ‘Algorithms\r\nfor the medial axis’. We are also indebted to Tatiana Ezubova for helping with the search for and translation of Russian literature. The second author thanks all members of the Edelsbrunner and Datashape groups for the atmosphere in which the research was conducted.\r\nThe research leading to these results has received funding from the European Research Council (ERC) under the European Union’s Seventh Framework Programme (FP/2007-2013) / ERC Grant Agreement No. 339025 GUDHI (Algorithmic Foundations of Geometry Understanding in Higher Dimensions). Supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754411. The Austrian science fund (FWF) M-3073.","title":"Hausdorff and Gromov-Hausdorff stable subsets of the medial axis","author":[{"first_name":"André","last_name":"Lieutier","full_name":"Lieutier, André"},{"last_name":"Wintraecken","orcid":"0000-0002-7472-2220","full_name":"Wintraecken, Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","first_name":"Mathijs"}],"external_id":{"arxiv":["2303.04014"]},"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"A. Lieutier, M. Wintraecken, in:, Proceedings of the 55th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2023, pp. 1768–1776.","ieee":"A. Lieutier and M. Wintraecken, “Hausdorff and Gromov-Hausdorff stable subsets of the medial axis,” in Proceedings of the 55th Annual ACM Symposium on Theory of Computing, Orlando, FL, United States, 2023, pp. 1768–1776.","apa":"Lieutier, A., & Wintraecken, M. (2023). Hausdorff and Gromov-Hausdorff stable subsets of the medial axis. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing (pp. 1768–1776). Orlando, FL, United States: Association for Computing Machinery. https://doi.org/10.1145/3564246.3585113","ama":"Lieutier A, Wintraecken M. Hausdorff and Gromov-Hausdorff stable subsets of the medial axis. In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery; 2023:1768-1776. doi:10.1145/3564246.3585113","mla":"Lieutier, André, and Mathijs Wintraecken. “Hausdorff and Gromov-Hausdorff Stable Subsets of the Medial Axis.” Proceedings of the 55th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2023, pp. 1768–76, doi:10.1145/3564246.3585113.","ista":"Lieutier A, Wintraecken M. 2023. Hausdorff and Gromov-Hausdorff stable subsets of the medial axis. Proceedings of the 55th Annual ACM Symposium on Theory of Computing. STOC: Symposium on Theory of Computing, 1768–1776.","chicago":"Lieutier, André, and Mathijs Wintraecken. “Hausdorff and Gromov-Hausdorff Stable Subsets of the Medial Axis.” In Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1768–76. Association for Computing Machinery, 2023. https://doi.org/10.1145/3564246.3585113."},"project":[{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships"},{"name":"Learning and triangulating manifolds via collapses","grant_number":"M03073","_id":"fc390959-9c52-11eb-aca3-afa58bd282b2"}]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Peste, Elena-Alexandra, et al. “CrAM: A Compression-Aware Minimizer.” 11th International Conference on Learning Representations .","ieee":"E.-A. Peste, A. Vladu, E. Kurtic, C. Lampert, and D.-A. Alistarh, “CrAM: A Compression-Aware Minimizer,” in 11th International Conference on Learning Representations , Kigali, Rwanda .","short":"E.-A. Peste, A. Vladu, E. Kurtic, C. Lampert, D.-A. Alistarh, in:, 11th International Conference on Learning Representations , n.d.","ama":"Peste E-A, Vladu A, Kurtic E, Lampert C, Alistarh D-A. CrAM: A Compression-Aware Minimizer. In: 11th International Conference on Learning Representations .","apa":"Peste, E.-A., Vladu, A., Kurtic, E., Lampert, C., & Alistarh, D.-A. (n.d.). CrAM: A Compression-Aware Minimizer. In 11th International Conference on Learning Representations . Kigali, Rwanda .","chicago":"Peste, Elena-Alexandra, Adrian Vladu, Eldar Kurtic, Christoph Lampert, and Dan-Adrian Alistarh. “CrAM: A Compression-Aware Minimizer.” In 11th International Conference on Learning Representations , n.d.","ista":"Peste E-A, Vladu A, Kurtic E, Lampert C, Alistarh D-A. CrAM: A Compression-Aware Minimizer. 11th International Conference on Learning Representations . ICLR: International Conference on Learning Representations."},"date_updated":"2023-06-01T12:54:45Z","title":"CrAM: A Compression-Aware Minimizer","department":[{"_id":"GradSch"},{"_id":"DaAl"},{"_id":"ChLa"}],"author":[{"first_name":"Elena-Alexandra","id":"32D78294-F248-11E8-B48F-1D18A9856A87","last_name":"Peste","full_name":"Peste, Elena-Alexandra"},{"full_name":"Vladu, Adrian","last_name":"Vladu","first_name":"Adrian"},{"last_name":"Kurtic","full_name":"Kurtic, Eldar","id":"47beb3a5-07b5-11eb-9b87-b108ec578218","first_name":"Eldar"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","last_name":"Lampert"},{"first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh"}],"article_processing_charge":"No","external_id":{"arxiv":["2207.14200"]},"_id":"13053","status":"public","project":[{"name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223","call_identifier":"H2020","_id":"268A44D6-B435-11E9-9278-68D0E5697425"}],"type":"conference","conference":{"start_date":"2023-05-01","location":"Kigali, Rwanda ","end_date":"2023-05-05","name":"ICLR: International Conference on Learning Representations"},"publication":"11th International Conference on Learning Representations ","language":[{"iso":"eng"}],"publication_status":"accepted","year":"2023","related_material":{"record":[{"id":"13074","status":"public","relation":"dissertation_contains"}]},"date_published":"2023-05-01T00:00:00Z","date_created":"2023-05-23T11:36:18Z","ec_funded":1,"oa_version":"Preprint","acknowledgement":"AP, EK, DA received funding from the European Research Council (ERC) under the European\r\nUnion’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML). AV acknowledges the support of the French Agence Nationale de la Recherche (ANR), under grant ANR-21-CE48-0016 (project COMCOPT). We further acknowledge the support from the Scientific Service Units (SSU) of ISTA through resources provided by Scientific Computing (SciComp)-","abstract":[{"lang":"eng","text":"Deep neural networks (DNNs) often have to be compressed, via pruning and/or quantization, before they can be deployed in practical settings. In this work we propose a new compression-aware minimizer dubbed CrAM that modifies the optimization step in a principled way, in order to produce models whose local loss behavior is stable under compression operations such as pruning. Thus, dense models trained via CrAM should be compressible post-training, in a single step, without significant accuracy loss. Experimental results on standard benchmarks, such as residual networks for ImageNet classification and BERT models for language modelling, show that CrAM produces dense models that can be more accurate than the standard SGD/Adam-based baselines, but which are stable under weight pruning: specifically, we can prune models in one-shot to 70-80% sparsity with almost no accuracy loss, and to 90% with reasonable (∼1%) accuracy loss, which is competitive with gradual compression methods. Additionally, CrAM can produce sparse models which perform well for transfer learning, and it also works for semi-structured 2:4 pruning patterns supported by GPU hardware. The code for reproducing the results is available at this https URL ."}],"acknowledged_ssus":[{"_id":"ScienComp"}],"month":"05","quality_controlled":"1","oa":1,"main_file_link":[{"url":"https://openreview.net/pdf?id=_eTZBs-yedr","open_access":"1"}]},{"page":"530-553","doi":"10.1007/978-3-031-31368-4_19","date_published":"2023-05-02T00:00:00Z","date_created":"2023-06-18T22:00:47Z","year":"2023","day":"02","publication":"Public-Key Cryptography - PKC 2023","publisher":"Springer Nature","quality_controlled":"1","oa":1,"acknowledgement":"We are grateful to Pavel Atnashev for clarifying via e-mail several aspects of the primality tests implementated in the PrimeGrid project. Pavel Hubáček is supported by the Czech Academy of Sciences (RVO 67985840), the Grant Agency of the Czech Republic under the grant agreement no. 19-27871X, and by the Charles University project UNCE/SCI/004. Chethan Kamath is supported by Azrieli International Postdoctoral Fellowship, ISF grants 484/18 and 1789/19, and ERC StG project SPP: Secrecy Preserving Proofs.","author":[{"full_name":"Hoffmann, Charlotte","last_name":"Hoffmann","id":"0f78d746-dc7d-11ea-9b2f-83f92091afe7","first_name":"Charlotte"},{"last_name":"Hubáček","full_name":"Hubáček, Pavel","first_name":"Pavel"},{"first_name":"Chethan","full_name":"Kamath, Chethan","last_name":"Kamath"},{"full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z"}],"article_processing_charge":"No","title":"Certifying giant nonprimes","citation":{"mla":"Hoffmann, Charlotte, et al. “Certifying Giant Nonprimes.” Public-Key Cryptography - PKC 2023, vol. 13940, Springer Nature, 2023, pp. 530–53, doi:10.1007/978-3-031-31368-4_19.","short":"C. Hoffmann, P. Hubáček, C. Kamath, K.Z. Pietrzak, in:, Public-Key Cryptography - PKC 2023, Springer Nature, 2023, pp. 530–553.","ieee":"C. Hoffmann, P. Hubáček, C. Kamath, and K. Z. Pietrzak, “Certifying giant nonprimes,” in Public-Key Cryptography - PKC 2023, Atlanta, GA, United States, 2023, vol. 13940, pp. 530–553.","apa":"Hoffmann, C., Hubáček, P., Kamath, C., & Pietrzak, K. Z. (2023). Certifying giant nonprimes. In Public-Key Cryptography - PKC 2023 (Vol. 13940, pp. 530–553). Atlanta, GA, United States: Springer Nature. https://doi.org/10.1007/978-3-031-31368-4_19","ama":"Hoffmann C, Hubáček P, Kamath C, Pietrzak KZ. Certifying giant nonprimes. In: Public-Key Cryptography - PKC 2023. Vol 13940. Springer Nature; 2023:530-553. doi:10.1007/978-3-031-31368-4_19","chicago":"Hoffmann, Charlotte, Pavel Hubáček, Chethan Kamath, and Krzysztof Z Pietrzak. “Certifying Giant Nonprimes.” In Public-Key Cryptography - PKC 2023, 13940:530–53. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-31368-4_19.","ista":"Hoffmann C, Hubáček P, Kamath C, Pietrzak KZ. 2023. Certifying giant nonprimes. Public-Key Cryptography - PKC 2023. PKC: Public-Key Cryptography, LNCS, vol. 13940, 530–553."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":13940,"publication_identifier":{"isbn":["9783031313677"],"eissn":["1611-3349"],"issn":["0302-9743"]},"publication_status":"published","language":[{"iso":"eng"}],"scopus_import":"1","alternative_title":["LNCS"],"main_file_link":[{"url":"https://eprint.iacr.org/2023/238","open_access":"1"}],"month":"05","intvolume":" 13940","abstract":[{"text":"GIMPS and PrimeGrid are large-scale distributed projects dedicated to searching giant prime numbers, usually of special forms like Mersenne and Proth primes. The numbers in the current search-space are millions of digits large and the participating volunteers need to run resource-consuming primality tests. Once a candidate prime N has been found, the only way for another party to independently verify the primality of N used to be by repeating the expensive primality test. To avoid the need for second recomputation of each primality test, these projects have recently adopted certifying mechanisms that enable efficient verification of performed tests. However, the mechanisms presently in place only detect benign errors and there is no guarantee against adversarial behavior: a malicious volunteer can mislead the project to reject a giant prime as being non-prime.\r\nIn this paper, we propose a practical, cryptographically-sound mechanism for certifying the non-primality of Proth numbers. That is, a volunteer can – parallel to running the primality test for N – generate an efficiently verifiable proof at a little extra cost certifying that N is not prime. The interactive protocol has statistical soundness and can be made non-interactive using the Fiat-Shamir heuristic.\r\nOur approach is based on a cryptographic primitive called Proof of Exponentiation (PoE) which, for a group G, certifies that a tuple (x,y,T)∈G2×N satisfies x2T=y (Pietrzak, ITCS 2019 and Wesolowski, J. Cryptol. 2020). In particular, we show how to adapt Pietrzak’s PoE at a moderate additional cost to make it a cryptographically-sound certificate of non-primality.","lang":"eng"}],"oa_version":"Submitted Version","department":[{"_id":"KrPi"}],"date_updated":"2023-06-19T08:03:37Z","type":"conference","conference":{"start_date":"2023-05-07","end_date":"2023-05-10","location":"Atlanta, GA, United States","name":"PKC: Public-Key Cryptography"},"status":"public","_id":"13143"},{"publication_identifier":{"isbn":["9783031308222"],"eissn":["1611-3349"],"issn":["0302-9743"]},"publication_status":"published","file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"3d8a8bb24d211bc83360dfc2fd744307","file_id":"13150","success":1,"creator":"dernst","date_updated":"2023-06-19T08:29:30Z","file_size":528455,"date_created":"2023-06-19T08:29:30Z","file_name":"2023_LNCS_Chatterjee.pdf"}],"language":[{"iso":"eng"}],"volume":13993,"license":"https://creativecommons.org/licenses/by/4.0/","ec_funded":1,"abstract":[{"lang":"eng","text":"Reinforcement learning has received much attention for learning controllers of deterministic systems. We consider a learner-verifier framework for stochastic control systems and survey recent methods that formally guarantee a conjunction of reachability and safety properties. Given a property and a lower bound on the probability of the property being satisfied, our framework jointly learns a control policy and a formal certificate to ensure the satisfaction of the property with a desired probability threshold. Both the control policy and the formal certificate are continuous functions from states to reals, which are learned as parameterized neural networks. While in the deterministic case, the certificates are invariant and barrier functions for safety, or Lyapunov and ranking functions for liveness, in the stochastic case the certificates are supermartingales. For certificate verification, we use interval arithmetic abstract interpretation to bound the expected values of neural network functions."}],"oa_version":"Published Version","scopus_import":"1","alternative_title":["LNCS"],"month":"04","intvolume":" 13993","date_updated":"2023-06-19T08:30:54Z","ddc":["000"],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"file_date_updated":"2023-06-19T08:29:30Z","_id":"13142","type":"conference","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","end_date":"2023-04-27","location":"Paris, France","start_date":"2023-04-22"},"status":"public","has_accepted_license":"1","year":"2023","day":"22","publication":"Tools and Algorithms for the Construction and Analysis of Systems ","page":"3-25","date_published":"2023-04-22T00:00:00Z","doi":"10.1007/978-3-031-30823-9_1","date_created":"2023-06-18T22:00:47Z","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093, 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.","quality_controlled":"1","publisher":"Springer Nature","oa":1,"citation":{"ista":"Chatterjee K, Henzinger TA, Lechner M, Zikelic D. 2023. A learner-verifier framework for neural network controllers and certificates of stochastic systems. Tools and Algorithms for the Construction and Analysis of Systems . TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 13993, 3–25.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Mathias Lechner, and Dorde Zikelic. “A Learner-Verifier Framework for Neural Network Controllers and Certificates of Stochastic Systems.” In Tools and Algorithms for the Construction and Analysis of Systems , 13993:3–25. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-30823-9_1.","ama":"Chatterjee K, Henzinger TA, Lechner M, Zikelic D. A learner-verifier framework for neural network controllers and certificates of stochastic systems. In: Tools and Algorithms for the Construction and Analysis of Systems . Vol 13993. Springer Nature; 2023:3-25. doi:10.1007/978-3-031-30823-9_1","apa":"Chatterjee, K., Henzinger, T. A., Lechner, M., & Zikelic, D. (2023). A learner-verifier framework for neural network controllers and certificates of stochastic systems. In Tools and Algorithms for the Construction and Analysis of Systems (Vol. 13993, pp. 3–25). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-031-30823-9_1","ieee":"K. Chatterjee, T. A. Henzinger, M. Lechner, and D. Zikelic, “A learner-verifier framework for neural network controllers and certificates of stochastic systems,” in Tools and Algorithms for the Construction and Analysis of Systems , Paris, France, 2023, vol. 13993, pp. 3–25.","short":"K. Chatterjee, T.A. Henzinger, M. Lechner, D. Zikelic, in:, Tools and Algorithms for the Construction and Analysis of Systems , Springer Nature, 2023, pp. 3–25.","mla":"Chatterjee, Krishnendu, et al. “A Learner-Verifier Framework for Neural Network Controllers and Certificates of Stochastic Systems.” Tools and Algorithms for the Construction and Analysis of Systems , vol. 13993, Springer Nature, 2023, pp. 3–25, doi:10.1007/978-3-031-30823-9_1."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A"},{"full_name":"Lechner, Mathias","last_name":"Lechner","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Zikelic, Dorde","last_name":"Zikelic","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","first_name":"Dorde"}],"article_processing_charge":"No","title":"A learner-verifier framework for neural network controllers and certificates of stochastic systems","project":[{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"},{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"665385","name":"International IST Doctoral Program"}]},{"volume":13994,"publication_status":"published","publication_identifier":{"issn":["0302-9743"],"isbn":["9783031308192"],"eissn":["1611-3349"]},"language":[{"iso":"eng"}],"file":[{"date_updated":"2023-06-19T08:43:21Z","file_size":521425,"creator":"dernst","date_created":"2023-06-19T08:43:21Z","file_name":"2023_LNCS_Anand.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"13151","checksum":"60dcafc1b4f6f070be43bad3fe877974","success":1}],"scopus_import":"1","alternative_title":["LNCS"],"intvolume":" 13994","month":"04","abstract":[{"lang":"eng","text":"We automatically compute a new class of environment assumptions in two-player turn-based finite graph games which characterize an “adequate cooperation” needed from the environment to allow the system player to win. Given an ω-regular winning condition Φ for the system player, we compute an ω-regular assumption Ψ for the environment player, such that (i) every environment strategy compliant with Ψ allows the system to fulfill Φ (sufficiency), (ii) Ψ\r\n can be fulfilled by the environment for every strategy of the system (implementability), and (iii) Ψ does not prevent any cooperative strategy choice (permissiveness).\r\nFor parity games, which are canonical representations of ω-regular games, we present a polynomial-time algorithm for the symbolic computation of adequately permissive assumptions and show that our algorithm runs faster and produces better assumptions than existing approaches—both theoretically and empirically. To the best of our knowledge, for ω\r\n-regular games, we provide the first algorithm to compute sufficient and implementable environment assumptions that are also permissive."}],"oa_version":"Published Version","file_date_updated":"2023-06-19T08:43:21Z","department":[{"_id":"ToHe"}],"date_updated":"2023-06-19T08:49:46Z","ddc":["000"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","start_date":"2023-04-22","location":"Paris, France","end_date":"2023-04-27"},"type":"conference","status":"public","_id":"13141","page":"211-228","date_created":"2023-06-18T22:00:47Z","date_published":"2023-04-20T00:00:00Z","doi":"10.1007/978-3-031-30820-8_15","year":"2023","has_accepted_license":"1","publication":"TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems","day":"20","oa":1,"quality_controlled":"1","publisher":"Springer Nature","article_processing_charge":"No","author":[{"full_name":"Anand, Ashwani","last_name":"Anand","first_name":"Ashwani"},{"first_name":"Kaushik","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598","full_name":"Mallik, Kaushik","orcid":"0000-0001-9864-7475","last_name":"Mallik"},{"first_name":"Satya Prakash","last_name":"Nayak","full_name":"Nayak, Satya Prakash"},{"full_name":"Schmuck, Anne Kathrin","last_name":"Schmuck","first_name":"Anne Kathrin"}],"title":"Computing adequately permissive assumptions for synthesis","citation":{"ista":"Anand A, Mallik K, Nayak SP, Schmuck AK. 2023. Computing adequately permissive assumptions for synthesis. TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 13994, 211–228.","chicago":"Anand, Ashwani, Kaushik Mallik, Satya Prakash Nayak, and Anne Kathrin Schmuck. “Computing Adequately Permissive Assumptions for Synthesis.” In TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems, 13994:211–28. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-30820-8_15.","ieee":"A. Anand, K. Mallik, S. P. Nayak, and A. K. Schmuck, “Computing adequately permissive assumptions for synthesis,” in TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems, Paris, France, 2023, vol. 13994, pp. 211–228.","short":"A. Anand, K. Mallik, S.P. Nayak, A.K. Schmuck, in:, TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2023, pp. 211–228.","ama":"Anand A, Mallik K, Nayak SP, Schmuck AK. Computing adequately permissive assumptions for synthesis. In: TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems. Vol 13994. Springer Nature; 2023:211-228. doi:10.1007/978-3-031-30820-8_15","apa":"Anand, A., Mallik, K., Nayak, S. P., & Schmuck, A. K. (2023). Computing adequately permissive assumptions for synthesis. In TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems (Vol. 13994, pp. 211–228). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-031-30820-8_15","mla":"Anand, Ashwani, et al. “Computing Adequately Permissive Assumptions for Synthesis.” TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems, vol. 13994, Springer Nature, 2023, pp. 211–28, doi:10.1007/978-3-031-30820-8_15."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"dissertation","status":"public","_id":"12826","department":[{"_id":"MaJö"},{"_id":"GradSch"}],"file_date_updated":"2023-04-20T09:26:51Z","date_updated":"2023-06-23T09:47:36Z","supervisor":[{"full_name":"Jösch, Maximilian A","orcid":"0000-0002-3937-1330","last_name":"Jösch","id":"2BD278E6-F248-11E8-B48F-1D18A9856A87","first_name":"Maximilian A"}],"ddc":["570","571"],"alternative_title":["ISTA Thesis"],"month":"04","acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"}],"abstract":[{"lang":"eng","text":"During navigation, animals can infer the structure of the environment by computing the optic flow cues elicited by their own movements, and subsequently use this information to instruct proper locomotor actions. These computations require a panoramic assessment of the visual environment in order to disambiguate similar sensory experiences that may require distinct behavioral responses. The estimation of the global motion patterns is therefore essential for successful navigation. Yet, our understanding of the algorithms and implementations that enable coherent panoramic visual perception remains scarce. Here I pursue this problem by dissecting the functional aspects of interneuronal communication in the lobula plate tangential cell network in Drosophila melanogaster. The results presented in the thesis demonstrate that the basis for effective interpretation of the optic flow in this circuit are stereotyped synaptic connections that mediate the formation of distinct subnetworks, each extracting a particular pattern of global motion. \r\nFirstly, I show that gap junctions are essential for a correct interpretation of binocular motion cues by horizontal motion-sensitive cells. HS cells form electrical synapses with contralateral H2 neurons that are involved in detecting yaw rotation and translation. I developed an FlpStop-mediated mutant of a gap junction protein ShakB that disrupts these electrical synapses. While the loss of electrical synapses does not affect the tuning of the direction selectivity in HS neurons, it severely alters their sensitivity to horizontal motion in the contralateral side. These physiological changes result in an inappropriate integration of binocular motion cues in walking animals. While wild-type flies form a binocular perception of visual motion by non-linear integration of monocular optic flow cues, the mutant flies sum the monocular inputs linearly. These results indicate that rather than averaging signals in neighboring neurons, gap-junctions operate in conjunction with chemical synapses to mediate complex non-linear optic flow computations.\r\nSecondly, I show that stochastic manipulation of neuronal activity in the lobula plate tangential cell network is a powerful approach to study the neuronal implementation of optic flow-based navigation in flies. Tangential neurons form multiple subnetworks, each mediating course-stabilizing response to a particular global pattern of visual motion. Application of genetic mosaic techniques can provide sparse optogenetic activation of HS cells in numerous combinations. These distinct combinations of activated neurons drive an array of distinct behavioral responses, providing important insights into how visuomotor transformation is performed in the lobula plate tangential cell network. This approach can be complemented by stochastic silencing of tangential neurons, enabling direct assessment of the functional role of individual tangential neurons in the processing of specific visual motion patterns.\r\n\tTaken together, the findings presented in this thesis suggest that establishing specific activity patterns of tangential cells via stereotyped synaptic connectivity is a key to efficient optic flow-based navigation in Drosophila melanogaster."}],"oa_version":"Published Version","ec_funded":1,"degree_awarded":"PhD","publication_status":"published","publication_identifier":{"issn":["2663 - 337X"]},"language":[{"iso":"eng"}],"file":[{"relation":"source_file","access_level":"closed","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","checksum":"5f589a9af025f7eeebfd0c186209913e","file_id":"12857","creator":"vpokusae","file_size":14507243,"date_updated":"2023-04-20T09:26:51Z","file_name":"Thesis_Pokusaeva.docx","date_created":"2023-04-20T09:14:38Z"},{"file_id":"12858","checksum":"bbeed76db45a996b4c91a9abe12ce0ec","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2023-04-20T09:14:44Z","file_name":"Thesis_Pokusaeva.pdf","creator":"vpokusae","date_updated":"2023-04-20T09:14:44Z","file_size":10090711}],"project":[{"call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","name":"International IST Doctoral Program"}],"article_processing_charge":"No","author":[{"first_name":"Victoria","id":"3184041C-F248-11E8-B48F-1D18A9856A87","full_name":"Pokusaeva, Victoria","orcid":"0000-0001-7660-444X","last_name":"Pokusaeva"}],"title":"Neural control of optic flow-based navigation in Drosophila melanogaster","citation":{"chicago":"Pokusaeva, Victoria. “Neural Control of Optic Flow-Based Navigation in Drosophila Melanogaster.” Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/at:ista:12826.","ista":"Pokusaeva V. 2023. Neural control of optic flow-based navigation in Drosophila melanogaster. Institute of Science and Technology Austria.","mla":"Pokusaeva, Victoria. Neural Control of Optic Flow-Based Navigation in Drosophila Melanogaster. Institute of Science and Technology Austria, 2023, doi:10.15479/at:ista:12826.","ieee":"V. Pokusaeva, “Neural control of optic flow-based navigation in Drosophila melanogaster,” Institute of Science and Technology Austria, 2023.","short":"V. Pokusaeva, Neural Control of Optic Flow-Based Navigation in Drosophila Melanogaster, Institute of Science and Technology Austria, 2023.","apa":"Pokusaeva, V. (2023). Neural control of optic flow-based navigation in Drosophila melanogaster. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:12826","ama":"Pokusaeva V. Neural control of optic flow-based navigation in Drosophila melanogaster. 2023. doi:10.15479/at:ista:12826"},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","oa":1,"publisher":"Institute of Science and Technology Austria","page":"106","date_created":"2023-04-14T14:56:04Z","date_published":"2023-04-18T00:00:00Z","doi":"10.15479/at:ista:12826","year":"2023","has_accepted_license":"1","day":"18"},{"ddc":["510"],"date_updated":"2023-06-27T12:53:43Z","file_date_updated":"2023-01-20T10:02:48Z","department":[{"_id":"HeEd"}],"_id":"12086","status":"public","type":"journal_article","article_type":"original","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"71685ca5121f4c837f40c3f8eb50c915","file_id":"12322","success":1,"date_updated":"2023-01-20T10:02:48Z","file_size":911017,"creator":"dernst","date_created":"2023-01-20T10:02:48Z","file_name":"2023_Algorithmica_Edelsbrunner.pdf"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0178-4617"],"eissn":["1432-0541"]},"publication_status":"published","volume":85,"ec_funded":1,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"We present a simple algorithm for computing higher-order Delaunay mosaics that works in Euclidean spaces of any finite dimensions. The algorithm selects the vertices of the order-k mosaic from incrementally constructed lower-order mosaics and uses an algorithm for weighted first-order Delaunay mosaics as a black-box to construct the order-k mosaic from its vertices. Beyond this black-box, the algorithm uses only combinatorial operations, thus facilitating easy implementation. We extend this algorithm to compute higher-order α-shapes and provide open-source implementations. We present experimental results for properties of higher-order Delaunay mosaics of random point sets."}],"month":"01","intvolume":" 85","scopus_import":"1","user_id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Edelsbrunner H, Osang GF. 2023. A simple algorithm for higher-order Delaunay mosaics and alpha shapes. Algorithmica. 85, 277–295.","chicago":"Edelsbrunner, Herbert, and Georg F Osang. “A Simple Algorithm for Higher-Order Delaunay Mosaics and Alpha Shapes.” Algorithmica. Springer Nature, 2023. https://doi.org/10.1007/s00453-022-01027-6.","apa":"Edelsbrunner, H., & Osang, G. F. (2023). A simple algorithm for higher-order Delaunay mosaics and alpha shapes. Algorithmica. Springer Nature. https://doi.org/10.1007/s00453-022-01027-6","ama":"Edelsbrunner H, Osang GF. A simple algorithm for higher-order Delaunay mosaics and alpha shapes. Algorithmica. 2023;85:277-295. doi:10.1007/s00453-022-01027-6","short":"H. Edelsbrunner, G.F. Osang, Algorithmica 85 (2023) 277–295.","ieee":"H. Edelsbrunner and G. F. Osang, “A simple algorithm for higher-order Delaunay mosaics and alpha shapes,” Algorithmica, vol. 85. Springer Nature, pp. 277–295, 2023.","mla":"Edelsbrunner, Herbert, and Georg F. Osang. “A Simple Algorithm for Higher-Order Delaunay Mosaics and Alpha Shapes.” Algorithmica, vol. 85, Springer Nature, 2023, pp. 277–95, doi:10.1007/s00453-022-01027-6."},"title":"A simple algorithm for higher-order Delaunay mosaics and alpha shapes","author":[{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner"},{"full_name":"Osang, Georg F","last_name":"Osang","first_name":"Georg F","id":"464B40D6-F248-11E8-B48F-1D18A9856A87"}],"external_id":{"isi":["000846967100001"]},"article_processing_charge":"Yes (via OA deal)","project":[{"call_identifier":"H2020","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","name":"Alpha Shape Theory Extended","grant_number":"788183"},{"name":"The Wittgenstein Prize","grant_number":"Z00342","_id":"268116B8-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35"}],"day":"01","publication":"Algorithmica","has_accepted_license":"1","isi":1,"year":"2023","doi":"10.1007/s00453-022-01027-6","date_published":"2023-01-01T00:00:00Z","date_created":"2022-09-11T22:01:57Z","page":"277-295","acknowledgement":"Open access funding provided by Austrian Science Fund (FWF). This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme, Grant No. 788183, from the Wittgenstein Prize, Austrian Science Fund (FWF), Grant No. Z 342-N31, and from the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), Grant No. I 02979-N35.","quality_controlled":"1","publisher":"Springer Nature","oa":1},{"publisher":"Springer Nature","quality_controlled":"1","oa":1,"acknowledgement":"Research supported by the Austrian Science Fund (FWF) grant F65 at the Institute of Science and Technology Austria and by the European Research Council (ERC) (Grant agreement No. 716117 awarded to Prof. Dr. Jan Maas). L.D.S. gratefully acknowledges funding of his current position by the Austrian Science Fund (FWF) through the ESPRIT Programme (Grant No. 208). M.W. gratefully acknowledges funding of his current position by the Austrian Science Fund (FWF) through the ESPRIT Programme (Grant No. 156).","doi":"10.1007/s00028-022-00859-7","date_published":"2023-01-01T00:00:00Z","date_created":"2023-01-08T23:00:53Z","isi":1,"has_accepted_license":"1","year":"2023","day":"01","publication":"Journal of Evolution Equations","project":[{"name":"Taming Complexity in Partial Differential Systems","grant_number":"F6504","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2"},{"grant_number":"716117","name":"Optimal Transport and Stochastic Dynamics","call_identifier":"H2020","_id":"256E75B8-B435-11E9-9278-68D0E5697425"},{"_id":"34dbf174-11ca-11ed-8bc3-afe9d43d4b9c","name":"Configuration Spaces over Non-Smooth Spaces","grant_number":"E208"},{"_id":"34c6ea2d-11ca-11ed-8bc3-c04f3c502833","grant_number":"ESP156_N","name":"Gradient flow techniques for quantum Markov semigroups"}],"article_number":"9","author":[{"orcid":"0000-0002-9881-6870","full_name":"Dello Schiavo, Lorenzo","last_name":"Dello Schiavo","first_name":"Lorenzo","id":"ECEBF480-9E4F-11EA-B557-B0823DDC885E"},{"id":"88644358-0A0E-11EA-8FA5-49A33DDC885E","first_name":"Melchior","full_name":"Wirth, Melchior","orcid":"0000-0002-0519-4241","last_name":"Wirth"}],"external_id":{"isi":["000906214600004"]},"article_processing_charge":"Yes (via OA deal)","title":"Ergodic decompositions of Dirichlet forms under order isomorphisms","citation":{"mla":"Dello Schiavo, Lorenzo, and Melchior Wirth. “Ergodic Decompositions of Dirichlet Forms under Order Isomorphisms.” Journal of Evolution Equations, vol. 23, no. 1, 9, Springer Nature, 2023, doi:10.1007/s00028-022-00859-7.","ieee":"L. Dello Schiavo and M. Wirth, “Ergodic decompositions of Dirichlet forms under order isomorphisms,” Journal of Evolution Equations, vol. 23, no. 1. Springer Nature, 2023.","short":"L. Dello Schiavo, M. Wirth, Journal of Evolution Equations 23 (2023).","ama":"Dello Schiavo L, Wirth M. Ergodic decompositions of Dirichlet forms under order isomorphisms. Journal of Evolution Equations. 2023;23(1). doi:10.1007/s00028-022-00859-7","apa":"Dello Schiavo, L., & Wirth, M. (2023). Ergodic decompositions of Dirichlet forms under order isomorphisms. Journal of Evolution Equations. Springer Nature. https://doi.org/10.1007/s00028-022-00859-7","chicago":"Dello Schiavo, Lorenzo, and Melchior Wirth. “Ergodic Decompositions of Dirichlet Forms under Order Isomorphisms.” Journal of Evolution Equations. Springer Nature, 2023. https://doi.org/10.1007/s00028-022-00859-7.","ista":"Dello Schiavo L, Wirth M. 2023. Ergodic decompositions of Dirichlet forms under order isomorphisms. Journal of Evolution Equations. 23(1), 9."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","month":"01","intvolume":" 23","abstract":[{"lang":"eng","text":"We study ergodic decompositions of Dirichlet spaces under intertwining via unitary order isomorphisms. We show that the ergodic decomposition of a quasi-regular Dirichlet space is unique up to a unique isomorphism of the indexing space. Furthermore, every unitary order isomorphism intertwining two quasi-regular Dirichlet spaces is decomposable over their ergodic decompositions up to conjugation via an isomorphism of the corresponding indexing spaces."}],"oa_version":"Published Version","issue":"1","volume":23,"ec_funded":1,"publication_identifier":{"issn":["1424-3199"],"eissn":["1424-3202"]},"publication_status":"published","file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"file_id":"12325","checksum":"1f34f3e2cb521033de6154f274ea3a4e","file_size":422612,"date_updated":"2023-01-20T10:45:06Z","creator":"dernst","file_name":"2023_JourEvolutionEquations_DelloSchiavo.pdf","date_created":"2023-01-20T10:45:06Z"}],"language":[{"iso":"eng"}],"type":"journal_article","article_type":"original","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","_id":"12104","department":[{"_id":"JaMa"}],"file_date_updated":"2023-01-20T10:45:06Z","date_updated":"2023-06-28T11:54:35Z","ddc":["510"]},{"isi":1,"year":"2023","day":"01","publication":"Climate Dynamics","page":"427-442","doi":"10.1007/s00382-022-06337-7","date_published":"2023-01-01T00:00:00Z","date_created":"2022-06-05T22:01:50Z","acknowledgement":"This work was supported by the National Research Foundation of Korea (NRF) grant funded by the Korea government (MSIT) (NRF-2018R1A5A1024958). Model simulation and data transfer were supported by the National Supercomputing Center with supercomputing resources including technical support (KSC-2019-CHA-0005), the National Center for Meteorological Supercomputer of Korea Meteorological Administration, and by the Korea Research Environment Open NETwork (KREONET), respectively. The authors declare no conflicts of interest.","publisher":"Springer Nature","quality_controlled":"1","citation":{"chicago":"GOSWAMI, BIDYUT B. “Role of the Eastern Equatorial Indian Ocean Warming in the Indian Summer Monsoon Rainfall Trend.” Climate Dynamics. Springer Nature, 2023. https://doi.org/10.1007/s00382-022-06337-7.","ista":"GOSWAMI BB. 2023. Role of the eastern equatorial Indian Ocean warming in the Indian summer monsoon rainfall trend. Climate Dynamics. 60, 427–442.","mla":"GOSWAMI, BIDYUT B. “Role of the Eastern Equatorial Indian Ocean Warming in the Indian Summer Monsoon Rainfall Trend.” Climate Dynamics, vol. 60, Springer Nature, 2023, pp. 427–42, doi:10.1007/s00382-022-06337-7.","ama":"GOSWAMI BB. Role of the eastern equatorial Indian Ocean warming in the Indian summer monsoon rainfall trend. Climate Dynamics. 2023;60:427-442. doi:10.1007/s00382-022-06337-7","apa":"GOSWAMI, B. B. (2023). Role of the eastern equatorial Indian Ocean warming in the Indian summer monsoon rainfall trend. Climate Dynamics. Springer Nature. https://doi.org/10.1007/s00382-022-06337-7","ieee":"B. B. GOSWAMI, “Role of the eastern equatorial Indian Ocean warming in the Indian summer monsoon rainfall trend,” Climate Dynamics, vol. 60. Springer Nature, pp. 427–442, 2023.","short":"B.B. GOSWAMI, Climate Dynamics 60 (2023) 427–442."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"3a4ac09c-6d61-11ec-bf66-884cde66b64b","first_name":"Bidyut B","last_name":"Goswami","full_name":"Goswami, Bidyut B"}],"external_id":{"isi":["000803119400002"]},"article_processing_charge":"No","title":"Role of the eastern equatorial Indian Ocean warming in the Indian summer monsoon rainfall trend","publication_identifier":{"eissn":["1432-0894"],"issn":["0930-7575"]},"publication_status":"published","language":[{"iso":"eng"}],"volume":60,"related_material":{"link":[{"relation":"erratum","url":" https://doi.org/10.1007/s00382-022-06401-2"}]},"abstract":[{"text":"The Indian summer monsoon rainfall (ISMR) has been declining since the 1950s. However, since 2002 it is reported to have revived. For these observed changes in the ISMR, several explanations have been reported. Among these explanations, however, the role of the eastern equatorial Indian Ocean (EEIO) is missing despite being one of the warmest regions in the Indian Ocean, and monotonously warming. A recent study reported that EEIO warming impacts the rainfall over northern India. Here we report that warming in the EEIO weakens the low-level Indian summer monsoon circulation and reduces ISMR. A warm EEIO drives easterly winds in the Indo–Pacific sector as a Gill response. The warm EEIO also enhances nocturnal convection offshore the western coast of Sumatra. The latent heating associated with the increased convection augments the Gill response and the resultant circulation opposes the monsoon low-level circulation and weakens the seasonal rainfall.","lang":"eng"}],"oa_version":"None","scopus_import":"1","month":"01","intvolume":" 60","date_updated":"2023-06-28T11:49:58Z","department":[{"_id":"CaMu"}],"_id":"11434","type":"journal_article","article_type":"original","status":"public"},{"publication_identifier":{"isbn":["9783031308284"],"eissn":["1611-3349"],"issn":["0302-9743"]},"publication_status":"published","file":[{"file_id":"12468","checksum":"981025aed580b6b27c426cb8856cf63e","success":1,"content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2023-01-31T07:22:21Z","file_name":"qsl.pdf","date_updated":"2023-01-31T07:22:21Z","file_size":449027,"creator":"esarac"},{"success":1,"checksum":"f16e2af1e0eb243158ab0f0fe74e7d5a","file_id":"13153","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"2023_LNCS_HenzingerT.pdf","date_created":"2023-06-19T10:28:09Z","creator":"dernst","file_size":1048171,"date_updated":"2023-06-19T10:28:09Z"}],"language":[{"iso":"eng"}],"volume":13992,"ec_funded":1,"abstract":[{"lang":"eng","text":"Safety and liveness are elementary concepts of computation, and the foundation of many verification paradigms. The safety-liveness classification of boolean properties characterizes whether a given property can be falsified by observing a finite prefix of an infinite computation trace (always for safety, never for liveness). In quantitative specification and verification, properties assign not truth values, but quantitative values to infinite traces (e.g., a cost, or the distance to a boolean property). We introduce quantitative safety and liveness, and we prove that our definitions induce conservative quantitative generalizations of both (1)~the safety-progress hierarchy of boolean properties and (2)~the safety-liveness decomposition of boolean properties. In particular, we show that every quantitative property can be written as the pointwise minimum of a quantitative safety property and a quantitative liveness property. Consequently, like boolean properties, also quantitative properties can be min-decomposed into safety and liveness parts, or alternatively, max-decomposed into co-safety and co-liveness parts. Moreover, quantitative properties can be approximated naturally. We prove that every quantitative property that has both safe and co-safe approximations can be monitored arbitrarily precisely by a monitor that uses only a finite number of states."}],"oa_version":"Published Version","scopus_import":"1","alternative_title":["LNCS"],"month":"04","intvolume":" 13992","date_updated":"2023-07-14T11:20:27Z","ddc":["000"],"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"file_date_updated":"2023-06-19T10:28:09Z","_id":"12467","type":"conference","conference":{"name":"FOSSACS: Foundations of Software Science and Computation Structures","start_date":"2023-04-22","end_date":"2023-04-27","location":"Paris, France"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","has_accepted_license":"1","year":"2023","day":"21","publication":"26th International Conference Foundations of Software Science and Computation Structures","page":"349-370","doi":"10.1007/978-3-031-30829-1_17","date_published":"2023-04-21T00:00:00Z","date_created":"2023-01-31T07:23:56Z","acknowledgement":"We thank the anonymous reviewers for their helpful comments. This work was supported in part by the ERC-2020-AdG 101020093.","publisher":"Springer Nature","quality_controlled":"1","oa":1,"citation":{"ista":"Henzinger TA, Mazzocchi NA, Sarac NE. 2023. Quantitative safety and liveness. 26th International Conference Foundations of Software Science and Computation Structures. FOSSACS: Foundations of Software Science and Computation Structures, LNCS, vol. 13992, 349–370.","chicago":"Henzinger, Thomas A, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Quantitative Safety and Liveness.” In 26th International Conference Foundations of Software Science and Computation Structures, 13992:349–70. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-30829-1_17.","ama":"Henzinger TA, Mazzocchi NA, Sarac NE. Quantitative safety and liveness. In: 26th International Conference Foundations of Software Science and Computation Structures. Vol 13992. Springer Nature; 2023:349-370. doi:10.1007/978-3-031-30829-1_17","apa":"Henzinger, T. A., Mazzocchi, N. A., & Sarac, N. E. (2023). Quantitative safety and liveness. In 26th International Conference Foundations of Software Science and Computation Structures (Vol. 13992, pp. 349–370). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-031-30829-1_17","short":"T.A. Henzinger, N.A. Mazzocchi, N.E. Sarac, in:, 26th International Conference Foundations of Software Science and Computation Structures, Springer Nature, 2023, pp. 349–370.","ieee":"T. A. Henzinger, N. A. Mazzocchi, and N. E. Sarac, “Quantitative safety and liveness,” in 26th International Conference Foundations of Software Science and Computation Structures, Paris, France, 2023, vol. 13992, pp. 349–370.","mla":"Henzinger, Thomas A., et al. “Quantitative Safety and Liveness.” 26th International Conference Foundations of Software Science and Computation Structures, vol. 13992, Springer Nature, 2023, pp. 349–70, doi:10.1007/978-3-031-30829-1_17."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","author":[{"last_name":"Henzinger","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"id":"b26baa86-3308-11ec-87b0-8990f34baa85","first_name":"Nicolas Adrien","last_name":"Mazzocchi","full_name":"Mazzocchi, Nicolas Adrien"},{"full_name":"Sarac, Naci E","last_name":"Sarac","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","first_name":"Naci E"}],"external_id":{"arxiv":["2301.11175"]},"article_processing_charge":"No","title":"Quantitative safety and liveness","project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093"}]},{"file":[{"date_created":"2023-07-03T13:09:39Z","file_name":"2023_ACMProgram.Lang._Koval.pdf","date_updated":"2023-07-03T13:09:39Z","file_size":1266773,"creator":"alisjak","checksum":"5dba6e73f0ed79adbdae14d165bc2f68","file_id":"13187","success":1,"content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["2475-1421"]},"publication_status":"published","volume":7,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Writing concurrent code that is both correct and efficient is notoriously difficult. Thus, programmers often prefer to use synchronization abstractions, which render code simpler and easier to reason about. Despite a wealth of work on this topic, there is still a gap between the rich semantics provided by synchronization abstractions in modern programming languages—specifically, fair FIFO ordering of synchronization requests and support for abortable operations—and frameworks for implementing it correctly and efficiently. Supporting such semantics is critical given the rising popularity of constructs for asynchronous programming, such as coroutines, which abort frequently and are cheaper to suspend and resume compared to native threads.\r\n\r\nThis paper introduces a new framework called CancellableQueueSynchronizer (CQS), which enables simple yet efficient implementations of a wide range of fair and abortable synchronization primitives: mutexes, semaphores, barriers, count-down latches, and blocking pools. Our main contribution is algorithmic, as implementing both fairness and abortability efficiently at this level of generality is non-trivial. Importantly, all our algorithms, including the CQS framework and the primitives built on top of it, come with formal proofs in the Iris framework for Coq for many of their properties. These proofs are modular, so it is easy to show correctness for new primitives implemented on top of CQS. From a practical perspective, implementation of CQS for native threads on the JVM improves throughput by up to two orders of magnitude over Java’s AbstractQueuedSynchronizer, the only practical abstraction offering similar semantics. Further, we successfully integrated CQS as a core component of the popular Kotlin Coroutines library, validating the framework’s practical impact and expressiveness in a real-world environment. In sum, CancellableQueueSynchronizer is the first framework to combine expressiveness with formal guarantees and solid practical performance. Our approach should be extensible to other languages and families of synchronization primitives."}],"month":"06","intvolume":" 7","scopus_import":"1","ddc":["000"],"date_updated":"2023-07-17T08:43:19Z","department":[{"_id":"DaAl"}],"file_date_updated":"2023-07-03T13:09:39Z","_id":"13179","status":"public","type":"journal_article","article_type":"original","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"day":"06","publication":"Proceedings of the ACM on Programming Languages","has_accepted_license":"1","year":"2023","date_published":"2023-06-06T00:00:00Z","doi":"10.1145/3591230","date_created":"2023-07-02T22:00:43Z","publisher":"Association for Computing Machinery ","quality_controlled":"1","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Koval, Nikita, Dmitry Khalanskiy, and Dan-Adrian Alistarh. “CQS: A Formally-Verified Framework for Fair and Abortable Synchronization.” Proceedings of the ACM on Programming Languages. Association for Computing Machinery , 2023. https://doi.org/10.1145/3591230.","ista":"Koval N, Khalanskiy D, Alistarh D-A. 2023. CQS: A formally-verified framework for fair and abortable synchronization. Proceedings of the ACM on Programming Languages. 7, 116.","mla":"Koval, Nikita, et al. “CQS: A Formally-Verified Framework for Fair and Abortable Synchronization.” Proceedings of the ACM on Programming Languages, vol. 7, 116, Association for Computing Machinery , 2023, doi:10.1145/3591230.","apa":"Koval, N., Khalanskiy, D., & Alistarh, D.-A. (2023). CQS: A formally-verified framework for fair and abortable synchronization. Proceedings of the ACM on Programming Languages. Association for Computing Machinery . https://doi.org/10.1145/3591230","ama":"Koval N, Khalanskiy D, Alistarh D-A. CQS: A formally-verified framework for fair and abortable synchronization. Proceedings of the ACM on Programming Languages. 2023;7. doi:10.1145/3591230","short":"N. Koval, D. Khalanskiy, D.-A. Alistarh, Proceedings of the ACM on Programming Languages 7 (2023).","ieee":"N. Koval, D. Khalanskiy, and D.-A. Alistarh, “CQS: A formally-verified framework for fair and abortable synchronization,” Proceedings of the ACM on Programming Languages, vol. 7. Association for Computing Machinery , 2023."},"title":"CQS: A formally-verified framework for fair and abortable synchronization","author":[{"first_name":"Nikita","id":"2F4DB10C-F248-11E8-B48F-1D18A9856A87","last_name":"Koval","full_name":"Koval, Nikita"},{"last_name":"Khalanskiy","full_name":"Khalanskiy, Dmitry","first_name":"Dmitry"},{"full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian"}],"article_processing_charge":"No","article_number":"116"},{"abstract":[{"text":"We study the density of everywhere locally soluble diagonal quadric surfaces, parameterised by rational points that lie on a split quadric surface","lang":"eng"}],"oa_version":"Preprint","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/2203.06881","open_access":"1"}],"month":"05","intvolume":" 16","publication_identifier":{"issn":["1944-4176"],"eissn":["1944-4184"]},"publication_status":"published","language":[{"iso":"eng"}],"volume":16,"issue":"2","_id":"13180","type":"journal_article","article_type":"original","status":"public","date_updated":"2023-07-17T08:39:19Z","department":[{"_id":"TiBr"}],"publisher":"Mathematical Sciences Publishers","quality_controlled":"1","oa":1,"year":"2023","day":"26","publication":"Involve","page":"331-342","date_published":"2023-05-26T00:00:00Z","doi":"10.2140/involve.2023.16.331","date_created":"2023-07-02T22:00:43Z","citation":{"chicago":"Browning, Timothy D, Julian Lyczak, and Roman Sarapin. “Local Solubility for a Family of Quadrics over a Split Quadric Surface.” Involve. Mathematical Sciences Publishers, 2023. https://doi.org/10.2140/involve.2023.16.331.","ista":"Browning TD, Lyczak J, Sarapin R. 2023. Local solubility for a family of quadrics over a split quadric surface. Involve. 16(2), 331–342.","mla":"Browning, Timothy D., et al. “Local Solubility for a Family of Quadrics over a Split Quadric Surface.” Involve, vol. 16, no. 2, Mathematical Sciences Publishers, 2023, pp. 331–42, doi:10.2140/involve.2023.16.331.","ieee":"T. D. Browning, J. Lyczak, and R. Sarapin, “Local solubility for a family of quadrics over a split quadric surface,” Involve, vol. 16, no. 2. Mathematical Sciences Publishers, pp. 331–342, 2023.","short":"T.D. Browning, J. Lyczak, R. Sarapin, Involve 16 (2023) 331–342.","apa":"Browning, T. D., Lyczak, J., & Sarapin, R. (2023). Local solubility for a family of quadrics over a split quadric surface. Involve. Mathematical Sciences Publishers. https://doi.org/10.2140/involve.2023.16.331","ama":"Browning TD, Lyczak J, Sarapin R. Local solubility for a family of quadrics over a split quadric surface. Involve. 2023;16(2):331-342. doi:10.2140/involve.2023.16.331"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Browning","full_name":"Browning, Timothy D","orcid":"0000-0002-8314-0177","id":"35827D50-F248-11E8-B48F-1D18A9856A87","first_name":"Timothy D"},{"id":"3572849A-F248-11E8-B48F-1D18A9856A87","first_name":"Julian","full_name":"Lyczak, Julian","last_name":"Lyczak"},{"full_name":"Sarapin, Roman","last_name":"Sarapin","first_name":"Roman"}],"external_id":{"arxiv":["2203.06881"]},"article_processing_charge":"No","title":"Local solubility for a family of quadrics over a split quadric surface"},{"page":"42-42","date_published":"2023-07-01T00:00:00Z","date_created":"2023-06-23T11:03:18Z","has_accepted_license":"1","publication_status":"accepted","year":"2023","day":"01","file":[{"file_id":"13250","checksum":"0ab6173cd5c5634ed773cd37ff012681","success":1,"content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2023-07-18T09:28:30Z","file_name":"2023_ASHPC_Elefante.pdf","date_updated":"2023-07-18T09:28:30Z","file_size":380354,"creator":"dernst"}],"language":[{"iso":"eng"}],"publication":"ASHPC23 - Austrian-Slovenian HPC Meeting 2023","quality_controlled":"1","publisher":"EuroCC","oa":1,"month":"07","oa_version":"Submitted Version","author":[{"full_name":"Elefante, Stefano","last_name":"Elefante","id":"490F40CE-F248-11E8-B48F-1D18A9856A87","first_name":"Stefano"},{"last_name":"Stadlbauer","full_name":"Stadlbauer, Stephan","first_name":"Stephan","id":"4D0BC184-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Alexander, Michael F","last_name":"Alexander","first_name":"Michael F","id":"3A02A8FA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Schlögl","full_name":"Schlögl, Alois","orcid":"0000-0002-5621-8100","first_name":"Alois","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","title":"Cryo-EM software packages: A sys-admins point of view","file_date_updated":"2023-07-18T09:28:30Z","department":[{"_id":"ScienComp"}],"date_updated":"2023-07-18T09:32:16Z","citation":{"ama":"Elefante S, Stadlbauer S, Alexander MF, Schlögl A. Cryo-EM software packages: A sys-admins point of view. In: ASHPC23 - Austrian-Slovenian HPC Meeting 2023. EuroCC; :42-42.","apa":"Elefante, S., Stadlbauer, S., Alexander, M. F., & Schlögl, A. (n.d.). Cryo-EM software packages: A sys-admins point of view. In ASHPC23 - Austrian-Slovenian HPC Meeting 2023 (pp. 42–42). Maribor, Slovenia: EuroCC.","short":"S. Elefante, S. Stadlbauer, M.F. Alexander, A. Schlögl, in:, ASHPC23 - Austrian-Slovenian HPC Meeting 2023, EuroCC, n.d., pp. 42–42.","ieee":"S. Elefante, S. Stadlbauer, M. F. Alexander, and A. Schlögl, “Cryo-EM software packages: A sys-admins point of view,” in ASHPC23 - Austrian-Slovenian HPC Meeting 2023, Maribor, Slovenia, pp. 42–42.","mla":"Elefante, Stefano, et al. “Cryo-EM Software Packages: A Sys-Admins Point of View.” ASHPC23 - Austrian-Slovenian HPC Meeting 2023, EuroCC, pp. 42–42.","ista":"Elefante S, Stadlbauer S, Alexander MF, Schlögl A. Cryo-EM software packages: A sys-admins point of view. ASHPC23 - Austrian-Slovenian HPC Meeting 2023. ASHPC: Austrian-Slovenian HPC Meeting, 42–42.","chicago":"Elefante, Stefano, Stephan Stadlbauer, Michael F Alexander, and Alois Schlögl. “Cryo-EM Software Packages: A Sys-Admins Point of View.” In ASHPC23 - Austrian-Slovenian HPC Meeting 2023, 42–42. EuroCC, n.d."},"ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference_abstract","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"location":"Maribor, Slovenia","end_date":"2023-06-15","start_date":"2023-06-12","name":"ASHPC: Austrian-Slovenian HPC Meeting"},"status":"public","_id":"13162"},{"quality_controlled":"1","publisher":"EuroCC","oa":1,"acknowledgement":"Thanks to Jesse Hansen for his suggestions on improving the abstract.","page":"59-59","date_published":"2023-07-01T00:00:00Z","date_created":"2023-06-23T11:01:23Z","has_accepted_license":"1","year":"2023","day":"01","publication":"ASHPC23 - Austrian-Slovenian HPC Meeting 2023","author":[{"first_name":"Alois","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","last_name":"Schlögl","full_name":"Schlögl, Alois","orcid":"0000-0002-5621-8100"},{"last_name":"Elefante","full_name":"Elefante, Stefano","id":"490F40CE-F248-11E8-B48F-1D18A9856A87","first_name":"Stefano"},{"last_name":"Hodirnau","full_name":"Hodirnau, Victor-Valentin","first_name":"Victor-Valentin","id":"3661B498-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","title":"Running Windows-applications on a Linux HPC cluster using WINE","citation":{"mla":"Schlögl, Alois, et al. “Running Windows-Applications on a Linux HPC Cluster Using WINE.” ASHPC23 - Austrian-Slovenian HPC Meeting 2023, EuroCC, pp. 59–59.","short":"A. Schlögl, S. Elefante, V.-V. Hodirnau, in:, ASHPC23 - Austrian-Slovenian HPC Meeting 2023, EuroCC, n.d., pp. 59–59.","ieee":"A. Schlögl, S. Elefante, and V.-V. Hodirnau, “Running Windows-applications on a Linux HPC cluster using WINE,” in ASHPC23 - Austrian-Slovenian HPC Meeting 2023, Maribor, Slovenia, pp. 59–59.","apa":"Schlögl, A., Elefante, S., & Hodirnau, V.-V. (n.d.). Running Windows-applications on a Linux HPC cluster using WINE. In ASHPC23 - Austrian-Slovenian HPC Meeting 2023 (pp. 59–59). Maribor, Slovenia: EuroCC.","ama":"Schlögl A, Elefante S, Hodirnau V-V. Running Windows-applications on a Linux HPC cluster using WINE. In: ASHPC23 - Austrian-Slovenian HPC Meeting 2023. EuroCC; :59-59.","chicago":"Schlögl, Alois, Stefano Elefante, and Victor-Valentin Hodirnau. “Running Windows-Applications on a Linux HPC Cluster Using WINE.” In ASHPC23 - Austrian-Slovenian HPC Meeting 2023, 59–59. EuroCC, n.d.","ista":"Schlögl A, Elefante S, Hodirnau V-V. Running Windows-applications on a Linux HPC cluster using WINE. ASHPC23 - Austrian-Slovenian HPC Meeting 2023. ASHPC: Austrian-Slovenian HPC Meeting, 59–59."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"07","oa_version":"Submitted Version","publication_status":"inpress","file":[{"date_created":"2023-07-18T09:18:55Z","file_name":"2023_ASHPC_Schloegl.pdf","date_updated":"2023-07-18T09:18:55Z","file_size":316959,"creator":"dernst","checksum":"ec8e4295d54171032cdd1b01423eb4a6","file_id":"13249","success":1,"content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"language":[{"iso":"eng"}],"type":"conference_abstract","conference":{"start_date":"2023-06-13","location":"Maribor, Slovenia","end_date":"2023-06-15","name":"ASHPC: Austrian-Slovenian HPC Meeting"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","_id":"13161","department":[{"_id":"ScienComp"},{"_id":"EM-Fac"}],"file_date_updated":"2023-07-18T09:18:55Z","date_updated":"2023-07-18T09:30:54Z","ddc":["000"]},{"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"article_type":"original","type":"journal_article","keyword":["General Materials Science","Physical and Theoretical Chemistry"],"status":"public","_id":"13251","file_date_updated":"2023-07-19T06:55:39Z","department":[{"_id":"MiLe"},{"_id":"ZhAl"}],"date_updated":"2023-07-19T06:59:19Z","ddc":["530"],"intvolume":" 14","month":"07","abstract":[{"lang":"eng","text":"A rotating organic cation and a dynamically disordered soft inorganic cage are the hallmark features of organic-inorganic lead-halide perovskites. Understanding the interplay between these two subsystems is a challenging problem, but it is this coupling that is widely conjectured to be responsible for the unique behavior of photocarriers in these materials. In this work, we use the fact that the polarizability of the organic cation strongly depends on the ambient electrostatic environment to put the molecule forward as a sensitive probe of the local crystal fields inside the lattice cell. We measure the average polarizability of the C/N–H bond stretching mode by means of infrared spectroscopy, which allows us to deduce the character of the motion of the cation molecule, find the magnitude of the local crystal field, and place an estimate on the strength of the hydrogen bond between the hydrogen and halide atoms. Our results pave the way for understanding electric fields in lead-halide perovskites using infrared bond spectroscopy."}],"oa_version":"Published Version","ec_funded":1,"issue":"27","volume":14,"publication_status":"published","publication_identifier":{"eissn":["1948-7185"]},"language":[{"iso":"eng"}],"file":[{"date_updated":"2023-07-19T06:55:39Z","file_size":2121252,"creator":"dernst","date_created":"2023-07-19T06:55:39Z","file_name":"2023_JourPhysChemistry_Wei.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"c0c040063f06a51b9c463adc504f1a23","file_id":"13253","success":1}],"project":[{"_id":"2688CF98-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Angulon: physics and applications of a new quasiparticle","grant_number":"801770"}],"article_processing_charge":"Yes (via OA deal)","external_id":{"isi":["001022811500001"],"arxiv":["2304.14198"]},"author":[{"id":"0c5ff007-2600-11ee-b896-98bd8d663294","first_name":"Yujing","orcid":"0000-0001-8913-9719","full_name":"Wei, Yujing","last_name":"Wei"},{"first_name":"Artem","id":"37D278BC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0393-5525","full_name":"Volosniev, Artem","last_name":"Volosniev"},{"full_name":"Lorenc, Dusan","last_name":"Lorenc","id":"40D8A3E6-F248-11E8-B48F-1D18A9856A87","first_name":"Dusan"},{"first_name":"Ayan A.","full_name":"Zhumekenov, Ayan A.","last_name":"Zhumekenov"},{"full_name":"Bakr, Osman M.","last_name":"Bakr","first_name":"Osman M."},{"first_name":"Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6990-7802","full_name":"Lemeshko, Mikhail","last_name":"Lemeshko"},{"last_name":"Alpichshev","full_name":"Alpichshev, Zhanybek","orcid":"0000-0002-7183-5203","first_name":"Zhanybek","id":"45E67A2A-F248-11E8-B48F-1D18A9856A87"}],"title":"Bond polarizability as a probe of local crystal fields in hybrid lead-halide perovskites","citation":{"chicago":"Wei, Yujing, Artem Volosniev, Dusan Lorenc, Ayan A. Zhumekenov, Osman M. Bakr, Mikhail Lemeshko, and Zhanybek Alpichshev. “Bond Polarizability as a Probe of Local Crystal Fields in Hybrid Lead-Halide Perovskites.” The Journal of Physical Chemistry Letters. American Chemical Society, 2023. https://doi.org/10.1021/acs.jpclett.3c01158.","ista":"Wei Y, Volosniev A, Lorenc D, Zhumekenov AA, Bakr OM, Lemeshko M, Alpichshev Z. 2023. Bond polarizability as a probe of local crystal fields in hybrid lead-halide perovskites. The Journal of Physical Chemistry Letters. 14(27), 6309–6314.","mla":"Wei, Yujing, et al. “Bond Polarizability as a Probe of Local Crystal Fields in Hybrid Lead-Halide Perovskites.” The Journal of Physical Chemistry Letters, vol. 14, no. 27, American Chemical Society, 2023, pp. 6309–14, doi:10.1021/acs.jpclett.3c01158.","ieee":"Y. Wei et al., “Bond polarizability as a probe of local crystal fields in hybrid lead-halide perovskites,” The Journal of Physical Chemistry Letters, vol. 14, no. 27. American Chemical Society, pp. 6309–6314, 2023.","short":"Y. Wei, A. Volosniev, D. Lorenc, A.A. Zhumekenov, O.M. Bakr, M. Lemeshko, Z. Alpichshev, The Journal of Physical Chemistry Letters 14 (2023) 6309–6314.","apa":"Wei, Y., Volosniev, A., Lorenc, D., Zhumekenov, A. A., Bakr, O. M., Lemeshko, M., & Alpichshev, Z. (2023). Bond polarizability as a probe of local crystal fields in hybrid lead-halide perovskites. The Journal of Physical Chemistry Letters. American Chemical Society. https://doi.org/10.1021/acs.jpclett.3c01158","ama":"Wei Y, Volosniev A, Lorenc D, et al. Bond polarizability as a probe of local crystal fields in hybrid lead-halide perovskites. The Journal of Physical Chemistry Letters. 2023;14(27):6309-6314. doi:10.1021/acs.jpclett.3c01158"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"quality_controlled":"1","publisher":"American Chemical Society","acknowledgement":"We thank Bingqing Cheng and Hong-Zhou Ye for valuable discussions; Y.W.’s work at IST Austria was supported through ISTernship summer internship program funded by OeADGmbH; D.L. and Z.A. acknowledge support by IST Austria (ISTA); M.L. acknowledges support by the European Research Council (ERC) Starting Grant No. 801770 (ANGULON).\r\nA.A.Z. and O.M.B. acknowledge support by KAUST.","page":"6309-6314","date_created":"2023-07-18T11:13:17Z","doi":"10.1021/acs.jpclett.3c01158","date_published":"2023-07-05T00:00:00Z","year":"2023","has_accepted_license":"1","isi":1,"publication":"The Journal of Physical Chemistry Letters","day":"05"},{"publication":"50th International Colloquium on Automata, Languages, and Programming","day":"05","year":"2023","has_accepted_license":"1","date_created":"2023-07-24T15:11:41Z","date_published":"2023-07-05T00:00:00Z","doi":"10.4230/LIPIcs.ICALP.2023.129","page":"129:1--129:20","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093.\r\nWe thank Pierre Ganty for early discussions and the anonymous reviewers for their helpful comments.\r\n","oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Henzinger TA, Kebis P, Mazzocchi NA, Sarac NE. 2023. Regular methods for operator precedence languages. 50th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 261, 129:1--129:20.","chicago":"Henzinger, Thomas A, Pavol Kebis, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Regular Methods for Operator Precedence Languages.” In 50th International Colloquium on Automata, Languages, and Programming, 261:129:1--129:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.ICALP.2023.129.","ieee":"T. A. Henzinger, P. Kebis, N. A. Mazzocchi, and N. E. Sarac, “Regular methods for operator precedence languages,” in 50th International Colloquium on Automata, Languages, and Programming, Paderborn, Germany, 2023, vol. 261, p. 129:1--129:20.","short":"T.A. Henzinger, P. Kebis, N.A. Mazzocchi, N.E. Sarac, in:, 50th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, p. 129:1--129:20.","ama":"Henzinger TA, Kebis P, Mazzocchi NA, Sarac NE. Regular methods for operator precedence languages. In: 50th International Colloquium on Automata, Languages, and Programming. Vol 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023:129:1--129:20. doi:10.4230/LIPIcs.ICALP.2023.129","apa":"Henzinger, T. A., Kebis, P., Mazzocchi, N. A., & Sarac, N. E. (2023). Regular methods for operator precedence languages. In 50th International Colloquium on Automata, Languages, and Programming (Vol. 261, p. 129:1--129:20). Paderborn, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2023.129","mla":"Henzinger, Thomas A., et al. “Regular Methods for Operator Precedence Languages.” 50th International Colloquium on Automata, Languages, and Programming, vol. 261, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, p. 129:1--129:20, doi:10.4230/LIPIcs.ICALP.2023.129."},"title":"Regular methods for operator precedence languages","external_id":{"arxiv":["2305.03447"]},"article_processing_charge":"Yes","author":[{"orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"last_name":"Kebis","full_name":"Kebis, Pavol","first_name":"Pavol"},{"full_name":"Mazzocchi, Nicolas Adrien","last_name":"Mazzocchi","id":"b26baa86-3308-11ec-87b0-8990f34baa85","first_name":"Nicolas Adrien"},{"first_name":"Naci E","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","full_name":"Sarac, Naci E","last_name":"Sarac"}],"project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093"}],"language":[{"iso":"eng"}],"file":[{"success":1,"file_id":"13293","checksum":"5d4c8932ef3450615a53b9bb15d92eb2","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"icalp23.pdf","date_created":"2023-07-24T15:11:05Z","file_size":859379,"date_updated":"2023-07-24T15:11:05Z","creator":"esarac"}],"publication_status":"published","publication_identifier":{"eissn":["1868-8969"],"isbn":["9783959772785"]},"ec_funded":1,"volume":261,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"The operator precedence languages (OPLs) represent the largest known subclass of the context-free languages which enjoys all desirable closure and decidability properties. This includes the decidability of language inclusion, which is the ultimate verification problem. Operator precedence grammars, automata, and logics have been investigated and used, for example, to verify programs with arithmetic expressions and exceptions (both of which are deterministic pushdown but lie outside the scope of the visibly pushdown languages). In this paper, we complete the picture and give, for the first time, an algebraic characterization of the class of OPLs in the form of a syntactic congruence that has finitely many equivalence classes exactly for the operator precedence languages. This is a generalization of the celebrated Myhill-Nerode theorem for the regular languages to OPLs. As one of the consequences, we show that universality and language inclusion for nondeterministic operator precedence automata can be solved by an antichain algorithm. Antichain algorithms avoid determinization and complementation through an explicit subset construction, by leveraging a quasi-order on words, which allows the pruning of the search space for counterexample words without sacrificing completeness. Antichain algorithms can be implemented symbolically, and these implementations are today the best-performing algorithms in practice for the inclusion of finite automata. We give a generic construction of the quasi-order needed for antichain algorithms from a finite syntactic congruence. This yields the first antichain algorithm for OPLs, an algorithm that solves the ExpTime-hard language inclusion problem for OPLs in exponential time."}],"intvolume":" 261","month":"07","alternative_title":["LIPIcs"],"ddc":["000"],"date_updated":"2023-07-31T08:38:38Z","file_date_updated":"2023-07-24T15:11:05Z","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"_id":"13292","status":"public","conference":{"start_date":"2023-07-10","end_date":"2023-07-14","location":"Paderborn, Germany","name":"ICALP: International Colloquium on Automata, Languages, and Programming"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"conference"},{"ddc":["530"],"date_updated":"2023-07-31T09:03:28Z","department":[{"_id":"MaSe"}],"file_date_updated":"2023-07-31T09:02:27Z","_id":"13277","status":"public","keyword":["Statistical and Nonlinear Physics","Atomic and Molecular Physics","and Optics","Nuclear and High Energy Physics","Condensed Matter Physics"],"article_type":"original","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"file":[{"file_size":523236,"date_updated":"2023-07-31T09:02:27Z","creator":"dernst","file_name":"2023_SciPostPhysCore_Tucci.pdf","date_created":"2023-07-31T09:02:27Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"checksum":"b472bc82108747eda5d52adf9e2ac7f3","file_id":"13329"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2666-9366"]},"publication_status":"published","volume":6,"issue":"2","ec_funded":1,"oa_version":"Published Version","abstract":[{"text":"Recent experimental advances have inspired the development of theoretical tools to describe the non-equilibrium dynamics of quantum systems. Among them an exact representation of quantum spin systems in terms of classical stochastic processes has been proposed. Here we provide first steps towards the extension of this stochastic approach to bosonic systems by considering the one-dimensional quantum quartic oscillator. We show how to exactly parameterize the time evolution of this prototypical model via the dynamics of a set of classical variables. We interpret these variables as stochastic processes, which allows us to propose a novel way to numerically simulate the time evolution of the system. We benchmark our findings by considering analytically solvable limits and providing alternative derivations of known results.","lang":"eng"}],"month":"04","intvolume":" 6","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Tucci, Gennaro, Stefano De Nicola, Sascha Wald, and Andrea Gambassi. “Stochastic Representation of the Quantum Quartic Oscillator.” SciPost Physics Core. SciPost Foundation, 2023. https://doi.org/10.21468/scipostphyscore.6.2.029.","ista":"Tucci G, De Nicola S, Wald S, Gambassi A. 2023. Stochastic representation of the quantum quartic oscillator. SciPost Physics Core. 6(2), 029.","mla":"Tucci, Gennaro, et al. “Stochastic Representation of the Quantum Quartic Oscillator.” SciPost Physics Core, vol. 6, no. 2, 029, SciPost Foundation, 2023, doi:10.21468/scipostphyscore.6.2.029.","ieee":"G. Tucci, S. De Nicola, S. Wald, and A. Gambassi, “Stochastic representation of the quantum quartic oscillator,” SciPost Physics Core, vol. 6, no. 2. SciPost Foundation, 2023.","short":"G. Tucci, S. De Nicola, S. Wald, A. Gambassi, SciPost Physics Core 6 (2023).","apa":"Tucci, G., De Nicola, S., Wald, S., & Gambassi, A. (2023). Stochastic representation of the quantum quartic oscillator. SciPost Physics Core. SciPost Foundation. https://doi.org/10.21468/scipostphyscore.6.2.029","ama":"Tucci G, De Nicola S, Wald S, Gambassi A. Stochastic representation of the quantum quartic oscillator. SciPost Physics Core. 2023;6(2). doi:10.21468/scipostphyscore.6.2.029"},"title":"Stochastic representation of the quantum quartic oscillator","author":[{"first_name":"Gennaro","full_name":"Tucci, Gennaro","last_name":"Tucci"},{"orcid":"0000-0002-4842-6671","full_name":"De Nicola, Stefano","last_name":"De Nicola","id":"42832B76-F248-11E8-B48F-1D18A9856A87","first_name":"Stefano"},{"last_name":"Wald","full_name":"Wald, Sascha","first_name":"Sascha"},{"first_name":"Andrea","full_name":"Gambassi, Andrea","last_name":"Gambassi"}],"external_id":{"arxiv":["2211.01923"]},"article_processing_charge":"No","article_number":"029","project":[{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"day":"14","publication":"SciPost Physics Core","has_accepted_license":"1","year":"2023","date_published":"2023-04-14T00:00:00Z","doi":"10.21468/scipostphyscore.6.2.029","date_created":"2023-07-24T10:47:46Z","acknowledgement":"S. De Nicola acknowledges funding from the Institute of Science and Technology Austria (ISTA), and from the European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie Grant Agreement No. 754411. S. De Nicola also acknowledges funding from the EPSRC Center for Doctoral Training in Cross-Disciplinary Approaches to NonEquilibrium Systems (CANES) under Grant EP/L015854/1. ","quality_controlled":"1","publisher":"SciPost Foundation","oa":1},{"abstract":[{"text":"We introduce a generic and accessible implementation of an exact diagonalization method for studying few-fermion models. Our aim is to provide a testbed for the newcomers to the field as well as a stepping stone for trying out novel optimizations and approximations. This userguide consists of a description of the algorithm, and several examples in varying orders of sophistication. In particular, we exemplify our routine using an effective-interaction approach that fixes the low-energy physics. We benchmark this approach against the existing data, and show that it is able to deliver state-of-the-art numerical results at a significantly reduced computational cost.","lang":"eng"}],"oa_version":"Published Version","month":"04","publication_status":"published","publication_identifier":{"issn":["2949-804X"]},"language":[{"iso":"eng"}],"file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"13330","checksum":"f583a70fe915d2208c803f5afb426daa","success":1,"creator":"dernst","date_updated":"2023-07-31T09:09:23Z","file_size":551418,"date_created":"2023-07-31T09:09:23Z","file_name":"2023_SciPostPhysCodebase_Rammelmueller.pdf"}],"ec_funded":1,"related_material":{"record":[{"status":"public","id":"13275","relation":"research_data"}]},"_id":"13276","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","article_type":"original","status":"public","date_updated":"2023-07-31T09:16:02Z","ddc":["530"],"file_date_updated":"2023-07-31T09:09:23Z","department":[{"_id":"MiLe"}],"acknowledgement":"We acknowledge fruitful discussions with Hans-Werner Hammer and thank Gerhard Zürn and\r\nPietro Massignan for sending us their data. We thank Fabian Brauneis for beta-testing the\r\nprovided code-package, and comments on the manuscript.\r\nL.R. is supported by FP7/ERC Consolidator Grant QSIMCORR, No.\r\n771891, and the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under\r\nGermany’s Excellence Strategy –EXC–2111–390814868. A.G.V. acknowledges support\r\nby European Union’s Horizon 2020 research and innovation programme under the Marie\r\nSkłodowska-Curie Grant Agreement No. 754411.","oa":1,"publisher":"SciPost Foundation","quality_controlled":"1","year":"2023","has_accepted_license":"1","publication":"SciPost Physics Codebases","day":"19","date_created":"2023-07-24T10:47:15Z","doi":"10.21468/scipostphyscodeb.12","date_published":"2023-04-19T00:00:00Z","article_number":"12","project":[{"grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"citation":{"apa":"Rammelmüller, L., Huber, D., & Volosniev, A. (2023). A modular implementation of an effective interaction approach for harmonically trapped fermions in 1D. SciPost Physics Codebases. SciPost Foundation. https://doi.org/10.21468/scipostphyscodeb.12","ama":"Rammelmüller L, Huber D, Volosniev A. A modular implementation of an effective interaction approach for harmonically trapped fermions in 1D. SciPost Physics Codebases. 2023. doi:10.21468/scipostphyscodeb.12","short":"L. Rammelmüller, D. Huber, A. Volosniev, SciPost Physics Codebases (2023).","ieee":"L. Rammelmüller, D. Huber, and A. Volosniev, “A modular implementation of an effective interaction approach for harmonically trapped fermions in 1D,” SciPost Physics Codebases. SciPost Foundation, 2023.","mla":"Rammelmüller, Lukas, et al. “A Modular Implementation of an Effective Interaction Approach for Harmonically Trapped Fermions in 1D.” SciPost Physics Codebases, 12, SciPost Foundation, 2023, doi:10.21468/scipostphyscodeb.12.","ista":"Rammelmüller L, Huber D, Volosniev A. 2023. A modular implementation of an effective interaction approach for harmonically trapped fermions in 1D. SciPost Physics Codebases., 12.","chicago":"Rammelmüller, Lukas, David Huber, and Artem Volosniev. “A Modular Implementation of an Effective Interaction Approach for Harmonically Trapped Fermions in 1D.” SciPost Physics Codebases. SciPost Foundation, 2023. https://doi.org/10.21468/scipostphyscodeb.12."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["2202.04603"]},"article_processing_charge":"No","author":[{"first_name":"Lukas","full_name":"Rammelmüller, Lukas","last_name":"Rammelmüller"},{"last_name":"Huber","full_name":"Huber, David","first_name":"David"},{"id":"37D278BC-F248-11E8-B48F-1D18A9856A87","first_name":"Artem","last_name":"Volosniev","full_name":"Volosniev, Artem","orcid":"0000-0003-0393-5525"}],"title":"A modular implementation of an effective interaction approach for harmonically trapped fermions in 1D"},{"oa_version":"Published Version","abstract":[{"text":"We introduce a generic and accessible implementation of an exact diagonalization method for studying few-fermion models. Our aim is to provide a testbed for the newcomers to the field as well as a stepping stone for trying out novel optimizations and approximations. This userguide consists of a description of the algorithm, and several examples in varying orders of sophistication. In particular, we exemplify our routine using an effective-interaction approach that fixes the low-energy physics. We benchmark this approach against the existing data, and show that it is able to deliver state-of-the-art numerical results at a significantly reduced computational cost.","lang":"eng"}],"month":"04","main_file_link":[{"open_access":"1","url":"https://doi.org/10.21468/SciPostPhysCodeb.12-r1.0"}],"oa":1,"publisher":"SciPost Foundation","day":"19","year":"2023","date_created":"2023-07-24T10:46:23Z","ec_funded":1,"doi":"10.21468/scipostphyscodeb.12-r1.0","date_published":"2023-04-19T00:00:00Z","related_material":{"record":[{"relation":"used_in_publication","id":"13276","status":"public"}]},"_id":"13275","status":"public","project":[{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships"}],"type":"research_data_reference","ddc":["530"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Rammelmüller, Lukas, David Huber, and Artem Volosniev. “Codebase Release 1.0 for FermiFCI.” SciPost Foundation, 2023. https://doi.org/10.21468/scipostphyscodeb.12-r1.0.","ista":"Rammelmüller L, Huber D, Volosniev A. 2023. Codebase release 1.0 for FermiFCI, SciPost Foundation, 10.21468/scipostphyscodeb.12-r1.0.","mla":"Rammelmüller, Lukas, et al. Codebase Release 1.0 for FermiFCI. SciPost Foundation, 2023, doi:10.21468/scipostphyscodeb.12-r1.0.","short":"L. Rammelmüller, D. Huber, A. Volosniev, (2023).","ieee":"L. Rammelmüller, D. Huber, and A. Volosniev, “Codebase release 1.0 for FermiFCI.” SciPost Foundation, 2023.","apa":"Rammelmüller, L., Huber, D., & Volosniev, A. (2023). Codebase release 1.0 for FermiFCI. SciPost Foundation. https://doi.org/10.21468/scipostphyscodeb.12-r1.0","ama":"Rammelmüller L, Huber D, Volosniev A. Codebase release 1.0 for FermiFCI. 2023. doi:10.21468/scipostphyscodeb.12-r1.0"},"date_updated":"2023-07-31T09:16:02Z","department":[{"_id":"MiLe"}],"title":"Codebase release 1.0 for FermiFCI","article_processing_charge":"No","author":[{"full_name":"Rammelmüller, Lukas","last_name":"Rammelmüller","first_name":"Lukas"},{"full_name":"Huber, David","last_name":"Huber","first_name":"David"},{"id":"37D278BC-F248-11E8-B48F-1D18A9856A87","first_name":"Artem","full_name":"Volosniev, Artem","orcid":"0000-0003-0393-5525","last_name":"Volosniev"}]}]