[{"volume":2,"quality_controlled":"1","author":[{"full_name":"Kragl, Bernhard","orcid":"0000-0001-7745-9117","first_name":"Bernhard","last_name":"Kragl","id":"320FC952-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Qadeer, Shaz","first_name":"Shaz","last_name":"Qadeer"}],"title":"The Civl verifier","language":[{"iso":"eng"}],"file":[{"success":1,"file_size":390555,"relation":"main_file","file_id":"10689","access_level":"open_access","checksum":"35438ac9f9750340b7f8ae4ae3220d9f","file_name":"2021_FCAD2021_Kragl.pdf","creator":"cchlebak","content_type":"application/pdf","date_updated":"2022-01-26T08:04:29Z","date_created":"2022-01-26T08:04:29Z"}],"corr_author":"1","date_published":"2021-10-01T00:00:00Z","alternative_title":["Conference Series"],"conference":{"end_date":"2021-10-22","name":"FMCAD: Formal Methods in Computer-Aided Design","location":"Virtual","start_date":"2021-10-20"},"publisher":"TU Wien Academic Press","project":[{"call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"}],"has_accepted_license":"1","oa":1,"date_created":"2022-01-26T08:01:30Z","scopus_import":"1","intvolume":"         2","publication":"Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design","_id":"10688","ddc":["000"],"page":"143–152","department":[{"_id":"ToHe"}],"publication_status":"published","editor":[{"last_name":"Ruzica","first_name":"Piskac","full_name":"Ruzica, Piskac"},{"full_name":"Whalen, Michael W.","last_name":"Whalen","first_name":"Michael W."}],"fulldoi":"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23","date_updated":"2025-04-15T06:25:56Z","oa_version":"Published Version","article_processing_charge":"No","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"mla":"Kragl, Bernhard, and Shaz Qadeer. “The Civl Verifier.” <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i>, edited by Piskac Ruzica and Michael W. Whalen, vol. 2, TU Wien Academic Press, 2021, pp. 143–152, doi:<a href=\"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23\">10.34727/2021/isbn.978-3-85448-046-4_23</a>.","chicago":"Kragl, Bernhard, and Shaz Qadeer. “The Civl Verifier.” In <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i>, edited by Piskac Ruzica and Michael W. Whalen, 2:143–152. TU Wien Academic Press, 2021. <a href=\"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23\">https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23</a>.","short":"B. Kragl, S. Qadeer, in:, P. Ruzica, M.W. Whalen (Eds.), Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design, TU Wien Academic Press, 2021, pp. 143–152.","ama":"Kragl B, Qadeer S. The Civl verifier. In: Ruzica P, Whalen MW, eds. <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i>. Vol 2. TU Wien Academic Press; 2021:143–152. doi:<a href=\"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23\">10.34727/2021/isbn.978-3-85448-046-4_23</a>","ista":"Kragl B, Qadeer S. 2021. The Civl verifier. Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, Conference Series, vol. 2, 143–152.","apa":"Kragl, B., &#38; Qadeer, S. (2021). The Civl verifier. In P. Ruzica &#38; M. W. Whalen (Eds.), <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i> (Vol. 2, pp. 143–152). Virtual: TU Wien Academic Press. <a href=\"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23\">https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23</a>","ieee":"B. Kragl and S. Qadeer, “The Civl verifier,” in <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i>, Virtual, 2021, vol. 2, pp. 143–152."},"month":"10","license":"https://creativecommons.org/licenses/by/4.0/","file_date_updated":"2022-01-26T08:04:29Z","type":"conference","day":"01","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"abstract":[{"lang":"eng","text":"Civl is a static verifier for concurrent programs designed around the conceptual framework of layered refinement,\r\nwhich views the task of verifying a program as a sequence of program simplification steps each justified by its own invariant. Civl verifies a layered concurrent program that compactly expresses all the programs in this sequence and the supporting invariants. This paper presents the design and implementation of the Civl verifier."}],"publication_identifier":{"isbn":["978-3-85448-046-4"]},"doi":"10.34727/2021/isbn.978-3-85448-046-4_23","year":"2021","status":"public","acknowledgement":"This research was performed while Bernhard Kragl was at IST Austria, supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award)."},{"publisher":"Society for Industrial and Applied Mathematics","conference":{"name":"SODA: Symposium on Discrete Algorithms","start_date":"2021-01-10","location":"Virtual","end_date":"2021-01-13"},"_id":"10694","page":"617-636","scopus_import":"1","publication":"Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms","date_created":"2022-01-27T12:11:23Z","oa":1,"project":[{"name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","call_identifier":"H2020"}],"author":[{"last_name":"Avni","first_name":"Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","full_name":"Avni, Guy","orcid":"0000-0001-5588-8287"},{"first_name":"Ismael R","last_name":"Jecker","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","full_name":"Jecker, Ismael R"},{"orcid":"0000-0002-4681-1699","full_name":"Zikelic, Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","first_name":"Dorde","last_name":"Zikelic"}],"title":"Infinite-duration all-pay bidding games","quality_controlled":"1","date_published":"2021-01-01T00:00:00Z","corr_author":"1","arxiv":1,"language":[{"iso":"eng"}],"type":"conference","day":"01","main_file_link":[{"url":"https://arxiv.org/abs/2005.06636","open_access":"1"}],"ec_funded":1,"month":"01","citation":{"mla":"Avni, Guy, et al. “Infinite-Duration All-Pay Bidding Games.” <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i>, edited by Dániel Marx, Society for Industrial and Applied Mathematics, 2021, pp. 617–36, doi:<a href=\"https://doi.org/10.1137/1.9781611976465.38\">10.1137/1.9781611976465.38</a>.","chicago":"Avni, Guy, Ismael R Jecker, and Dorde Zikelic. “Infinite-Duration All-Pay Bidding Games.” In <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i>, edited by Dániel Marx, 617–36. Society for Industrial and Applied Mathematics, 2021. <a href=\"https://doi.org/10.1137/1.9781611976465.38\">https://doi.org/10.1137/1.9781611976465.38</a>.","short":"G. Avni, I.R. Jecker, D. Zikelic, in:, D. Marx (Ed.), Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2021, pp. 617–636.","ama":"Avni G, Jecker IR, Zikelic D. Infinite-duration all-pay bidding games. In: Marx D, ed. <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i>. Society for Industrial and Applied Mathematics; 2021:617-636. doi:<a href=\"https://doi.org/10.1137/1.9781611976465.38\">10.1137/1.9781611976465.38</a>","ista":"Avni G, Jecker IR, Zikelic D. 2021. Infinite-duration all-pay bidding games. Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 617–636.","ieee":"G. Avni, I. R. Jecker, and D. Zikelic, “Infinite-duration all-pay bidding games,” in <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i>, Virtual, 2021, pp. 617–636.","apa":"Avni, G., Jecker, I. R., &#38; Zikelic, D. (2021). Infinite-duration all-pay bidding games. In D. Marx (Ed.), <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 617–636). Virtual: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611976465.38\">https://doi.org/10.1137/1.9781611976465.38</a>"},"year":"2021","status":"public","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award), ERC CoG 863818 (FoRM-SMArt), and by the European Union's Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","publication_identifier":{"isbn":["978-1-61197-646-5"]},"doi":"10.1137/1.9781611976465.38","abstract":[{"text":"In a two-player zero-sum graph game the players move a token throughout a graph to produce an infinite path, which determines the winner or payoff of the game. Traditionally, the players alternate turns in moving the token. In bidding games, however, the players have budgets, and in each turn, we hold an “auction” (bidding) to determine which player moves the token: both players simultaneously submit bids and the higher bidder moves the token. The bidding mechanisms differ in their payment schemes. Bidding games were largely studied with variants of first-price bidding in which only the higher bidder pays his bid. We focus on all-pay bidding, where both players pay their bids. Finite-duration all-pay bidding games were studied and shown to be technically more challenging than their first-price counterparts. We study for the first time, infinite-duration all-pay bidding games. Our most interesting results are for mean-payoff objectives: we portray a complete picture for games played on strongly-connected graphs. We study both pure (deterministic) and mixed (probabilistic) strategies and completely characterize the optimal and almost-sure (with probability 1) payoffs the players can respectively guarantee. We show that mean-payoff games under all-pay bidding exhibit the intriguing mathematical properties of their first-price counterparts; namely, an equivalence with random-turn games in which in each turn, the player who moves is selected according to a (biased) coin toss. The equivalences for all-pay bidding are more intricate and unexpected than for first-price bidding.","lang":"eng"}],"fulldoi":"https://doi.org/10.1137/1.9781611976465.38","external_id":{"arxiv":["2005.06636"]},"editor":[{"last_name":"Marx","first_name":"Dániel","full_name":"Marx, Dániel"}],"publication_status":"published","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","article_processing_charge":"No","oa_version":"Preprint","date_updated":"2025-04-15T06:26:15Z"},{"_id":"10762","page":"2105.15193","publication":"arXiv","oa":1,"date_created":"2022-02-17T11:18:57Z","project":[{"name":"Angulon: physics and applications of a new quasiparticle","call_identifier":"H2020","grant_number":"801770","_id":"2688CF98-B435-11E9-9278-68D0E5697425"},{"grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","call_identifier":"H2020"}],"title":"Artificial neural network states for non-additive systems","author":[{"id":"48C55298-F248-11E8-B48F-1D18A9856A87","last_name":"Rzadkowski","first_name":"Wojciech","orcid":"0000-0002-1106-4419","full_name":"Rzadkowski, Wojciech"},{"full_name":"Lemeshko, Mikhail","orcid":"0000-0002-6990-7802","first_name":"Mikhail","last_name":"Lemeshko","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Mentink, Johan H.","first_name":"Johan H.","last_name":"Mentink"}],"related_material":{"record":[{"id":"10759","status":"public","relation":"dissertation_contains"}]},"corr_author":"1","date_published":"2021-05-31T00:00:00Z","arxiv":1,"language":[{"iso":"eng"}],"day":"31","type":"preprint","ec_funded":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2105.15193"}],"month":"05","citation":{"ieee":"W. Rzadkowski, M. Lemeshko, and J. H. Mentink, “Artificial neural network states for non-additive systems,” <i>arXiv</i>. .","ista":"Rzadkowski W, Lemeshko M, Mentink JH. Artificial neural network states for non-additive systems. arXiv, <a href=\"https://doi.org/10.48550/arXiv.2105.15193\">10.48550/arXiv.2105.15193</a>.","ama":"Rzadkowski W, Lemeshko M, Mentink JH. Artificial neural network states for non-additive systems. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2105.15193\">10.48550/arXiv.2105.15193</a>","apa":"Rzadkowski, W., Lemeshko, M., &#38; Mentink, J. H. (n.d.). Artificial neural network states for non-additive systems. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2105.15193\">https://doi.org/10.48550/arXiv.2105.15193</a>","short":"W. Rzadkowski, M. Lemeshko, J.H. Mentink, ArXiv (n.d.).","chicago":"Rzadkowski, Wojciech, Mikhail Lemeshko, and Johan H. Mentink. “Artificial Neural Network States for Non-Additive Systems.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2105.15193\">https://doi.org/10.48550/arXiv.2105.15193</a>.","mla":"Rzadkowski, Wojciech, et al. “Artificial Neural Network States for Non-Additive Systems.” <i>ArXiv</i>, doi:<a href=\"https://doi.org/10.48550/arXiv.2105.15193\">10.48550/arXiv.2105.15193</a>."},"year":"2021","acknowledgement":"We acknowledge fruitful discussions with Giacomo Bighin, Giammarco Fabiani, Areg Ghazaryan, Christoph\r\nLampert, and Artem Volosniev at various stages of this work. W.R. is a recipient of a DOC Fellowship of the\r\nAustrian Academy of Sciences and has received funding from the EU Horizon 2020 programme under the Marie\r\nSkłodowska-Curie Grant Agreement No. 665385. M. L. acknowledges support by the European Research Council (ERC) Starting Grant No. 801770 (ANGULON). This work is part of the Shell-NWO/FOM-initiative “Computational sciences for energy research” of Shell and Chemical Sciences, Earth and Life Sciences, Physical Sciences, FOM and STW.","status":"public","doi":"10.48550/arXiv.2105.15193","abstract":[{"text":"Methods inspired from machine learning have recently attracted great interest in the computational study of quantum many-particle systems. So far, however, it has proven challenging to deal with microscopic models in which the total number of particles is not conserved. To address this issue, we propose a new variant of neural network states, which we term neural coherent states. Taking the Fröhlich impurity model as a case study, we show that neural coherent states can learn the ground state of non-additive systems very well. In particular, we observe substantial improvement over the standard coherent state estimates in the most challenging intermediate coupling regime. Our approach is generic and does not assume specific details of the system, suggesting wide applications.","lang":"eng"}],"fulldoi":"https://doi.org/10.48550/arXiv.2105.15193","external_id":{"arxiv":["2105.15193"]},"publication_status":"draft","department":[{"_id":"MiLe"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","oa_version":"Preprint","date_updated":"2026-04-07T14:20:12Z"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"id":"10799","status":"public","relation":"dissertation_contains"}]},"article_processing_charge":"No","oa_version":"Preprint","corr_author":"1","date_published":"2021-06-07T00:00:00Z","article_number":"2102.05996","date_updated":"2026-04-07T14:19:48Z","arxiv":1,"language":[{"iso":"eng"}],"title":"Fairness through regularization for learning to rank","fulldoi":"https://doi.org/10.48550/arXiv.2102.05996","author":[{"full_name":"Konstantinov, Nikola H","orcid":"0009-0009-5204-7621","last_name":"Konstantinov","first_name":"Nikola H","id":"4B9D76E4-F248-11E8-B48F-1D18A9856A87"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","first_name":"Christoph","orcid":"0000-0002-4561-241X","full_name":"Lampert, Christoph"}],"external_id":{"arxiv":["2102.05996"]},"publication_status":"draft","department":[{"_id":"ChLa"}],"_id":"10803","year":"2021","status":"public","publication":"arXiv","doi":"10.48550/arXiv.2102.05996","abstract":[{"lang":"eng","text":"Given the abundance of applications of ranking in recent years, addressing fairness concerns around automated ranking systems becomes necessary for increasing the trust among end-users. Previous work on fair ranking has mostly focused on application-specific fairness notions, often tailored to online advertising, and it rarely considers learning as part of the process. In this work, we show how to transfer numerous fairness notions from binary classification to a learning to rank setting. Our formalism allows us to design methods for incorporating fairness objectives with provable generalization guarantees. An extensive experimental evaluation shows that our method can improve ranking fairness substantially with no or only little loss of model quality."}],"oa":1,"date_created":"2022-02-28T14:13:59Z","type":"preprint","day":"07","main_file_link":[{"url":"https://arxiv.org/abs/2102.05996","open_access":"1"}],"month":"06","citation":{"apa":"Konstantinov, N. H., &#38; Lampert, C. (n.d.). Fairness through regularization for learning to rank. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2102.05996\">https://doi.org/10.48550/arXiv.2102.05996</a>","ama":"Konstantinov NH, Lampert C. Fairness through regularization for learning to rank. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2102.05996\">10.48550/arXiv.2102.05996</a>","ieee":"N. H. Konstantinov and C. Lampert, “Fairness through regularization for learning to rank,” <i>arXiv</i>. .","ista":"Konstantinov NH, Lampert C. Fairness through regularization for learning to rank. arXiv, 2102.05996.","short":"N.H. Konstantinov, C. Lampert, ArXiv (n.d.).","mla":"Konstantinov, Nikola H., and Christoph Lampert. “Fairness through Regularization for Learning to Rank.” <i>ArXiv</i>, 2102.05996, doi:<a href=\"https://doi.org/10.48550/arXiv.2102.05996\">10.48550/arXiv.2102.05996</a>.","chicago":"Konstantinov, Nikola H, and Christoph Lampert. “Fairness through Regularization for Learning to Rank.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2102.05996\">https://doi.org/10.48550/arXiv.2102.05996</a>."}},{"department":[{"_id":"MaIb"}],"publication_status":"published","fulldoi":"https://doi.org/10.1021/jacsau.1c00349","date_updated":"2026-04-07T13:26:13Z","oa_version":"Published Version","article_processing_charge":"Yes (via OA deal)","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"chicago":"Calcabrini, Mariano, Dietger Van den Eynden, Sergi Sanchez Ribot, Rohan Pokratath, Jordi Llorca, Jonathan De Roo, and Maria Ibáñez. “Ligand Conversion in Nanocrystal Synthesis: The Oxidation of Alkylamines to Fatty Acids by Nitrate.” <i>JACS Au</i>. American Chemical Society, 2021. <a href=\"https://doi.org/10.1021/jacsau.1c00349\">https://doi.org/10.1021/jacsau.1c00349</a>.","mla":"Calcabrini, Mariano, et al. “Ligand Conversion in Nanocrystal Synthesis: The Oxidation of Alkylamines to Fatty Acids by Nitrate.” <i>JACS Au</i>, vol. 1, no. 11, American Chemical Society, 2021, pp. 1898–903, doi:<a href=\"https://doi.org/10.1021/jacsau.1c00349\">10.1021/jacsau.1c00349</a>.","short":"M. Calcabrini, D. Van den Eynden, S. Sanchez Ribot, R. Pokratath, J. Llorca, J. De Roo, M. Ibáñez, JACS Au 1 (2021) 1898–1903.","ama":"Calcabrini M, Van den Eynden D, Sanchez Ribot S, et al. Ligand conversion in nanocrystal synthesis: The oxidation of alkylamines to fatty acids by nitrate. <i>JACS Au</i>. 2021;1(11):1898-1903. doi:<a href=\"https://doi.org/10.1021/jacsau.1c00349\">10.1021/jacsau.1c00349</a>","ista":"Calcabrini M, Van den Eynden D, Sanchez Ribot S, Pokratath R, Llorca J, De Roo J, Ibáñez M. 2021. Ligand conversion in nanocrystal synthesis: The oxidation of alkylamines to fatty acids by nitrate. JACS Au. 1(11), 1898–1903.","apa":"Calcabrini, M., Van den Eynden, D., Sanchez Ribot, S., Pokratath, R., Llorca, J., De Roo, J., &#38; Ibáñez, M. (2021). Ligand conversion in nanocrystal synthesis: The oxidation of alkylamines to fatty acids by nitrate. <i>JACS Au</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/jacsau.1c00349\">https://doi.org/10.1021/jacsau.1c00349</a>","ieee":"M. Calcabrini <i>et al.</i>, “Ligand conversion in nanocrystal synthesis: The oxidation of alkylamines to fatty acids by nitrate,” <i>JACS Au</i>, vol. 1, no. 11. American Chemical Society, pp. 1898–1903, 2021."},"month":"11","ec_funded":1,"file_date_updated":"2022-03-02T15:33:18Z","day":"22","type":"journal_article","keyword":["general medicine"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"abstract":[{"text":"Ligands are a fundamental part of nanocrystals. They control and direct nanocrystal syntheses and provide colloidal stability. Bound ligands also affect the nanocrystals’ chemical reactivity and electronic structure. Surface chemistry is thus crucial to understand nanocrystal properties and functionality. Here, we investigate the synthesis of metal oxide nanocrystals (CeO2-x, ZnO, and NiO) from metal nitrate precursors, in the presence of oleylamine ligands. Surprisingly, the nanocrystals are capped exclusively with a fatty acid instead of oleylamine. Analysis of the reaction mixtures with nuclear magnetic resonance spectroscopy revealed several reaction byproducts and intermediates that are common to the decomposition of Ce, Zn, Ni, and Zr nitrate precursors. Our evidence supports the oxidation of alkylamine and formation of a carboxylic acid, thus unraveling this counterintuitive surface chemistry.","lang":"eng"}],"issue":"11","publication_identifier":{"issn":["2691-3704"],"eissn":["2691-3704"]},"doi":"10.1021/jacsau.1c00349","year":"2021","acknowledgement":"This work was financially supported by IST Austria and the Werner Siemens Foundation. M.C. has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385. The work was also financially supported by University of Basel, SNSF NCCR Molecular Systems Engineering (project number: 182895) and SNSF R’equip (project number: 189622). J.L. is a Serra Húnter Fellow and is grateful to ICREA Academia program and MICINN/FEDER RTI2018-093996-B-C31 and GC 2017 SGR 128 projects.","status":"public","volume":1,"quality_controlled":"1","author":[{"full_name":"Calcabrini, Mariano","orcid":"0000-0003-4566-5877","first_name":"Mariano","last_name":"Calcabrini","id":"45D7531A-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Dietger","last_name":"Van den Eynden","full_name":"Van den Eynden, Dietger"},{"full_name":"Sanchez Ribot, Sergi","id":"ddae5a59-f6e0-11ea-865d-d9dc61e77a2a","first_name":"Sergi","last_name":"Sanchez Ribot"},{"full_name":"Pokratath, Rohan","last_name":"Pokratath","first_name":"Rohan"},{"first_name":"Jordi","last_name":"Llorca","full_name":"Llorca, Jordi"},{"first_name":"Jonathan","last_name":"De Roo","full_name":"De Roo, Jonathan"},{"id":"43C61214-F248-11E8-B48F-1D18A9856A87","first_name":"Maria","last_name":"Ibáñez","orcid":"0000-0001-5013-2843","full_name":"Ibáñez, Maria"}],"title":"Ligand conversion in nanocrystal synthesis: The oxidation of alkylamines to fatty acids by nitrate","language":[{"iso":"eng"}],"file":[{"date_created":"2022-03-02T15:33:18Z","date_updated":"2022-03-02T15:33:18Z","creator":"cchlebak","file_name":"2021_JACSAu_Calcabrini.pdf","content_type":"application/pdf","checksum":"1c66a35369e911312a359111420318a9","access_level":"open_access","file_size":1257973,"success":1,"relation":"main_file","file_id":"10807"}],"corr_author":"1","date_published":"2021-11-22T00:00:00Z","related_material":{"record":[{"id":"12885","relation":"dissertation_contains","status":"public"}],"link":[{"relation":"earlier_version","url":"https://doi.org/10.26434/chemrxiv-2021-cn2fr"}]},"publisher":"American Chemical Society","project":[{"call_identifier":"H2020","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385"},{"_id":"9B8F7476-BA93-11EA-9121-9846C619BF3A","name":"HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of Semiconductors for Waste Heat Recovery"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"article_type":"original","has_accepted_license":"1","date_created":"2022-03-02T15:24:16Z","oa":1,"scopus_import":"1","intvolume":"         1","publication":"JACS Au","_id":"10806","ddc":["540"],"page":"1898-1903"},{"abstract":[{"text":"We consider a gas of interacting bosons trapped in a box of side length one in the Gross–Pitaevskii limit. We review the proof of the validity of Bogoliubov’s prediction for the ground state energy and the low-energy excitation spectrum. This note is based on joint work with C. Brennecke, S. Cenatiempo and B. Schlein.","lang":"eng"}],"issue":"1","publication_identifier":{"issn":["0129-055X"]},"doi":"10.1142/S0129055X20600065","year":"2021","status":"public","citation":{"chicago":"Boccato, Chiara. “The Excitation Spectrum of the Bose Gas in the Gross-Pitaevskii Regime.” <i>Reviews in Mathematical Physics</i>. World Scientific Publishing, 2021. <a href=\"https://doi.org/10.1142/S0129055X20600065\">https://doi.org/10.1142/S0129055X20600065</a>.","mla":"Boccato, Chiara. “The Excitation Spectrum of the Bose Gas in the Gross-Pitaevskii Regime.” <i>Reviews in Mathematical Physics</i>, vol. 33, no. 1, 2060006, World Scientific Publishing, 2021, doi:<a href=\"https://doi.org/10.1142/S0129055X20600065\">10.1142/S0129055X20600065</a>.","short":"C. Boccato, Reviews in Mathematical Physics 33 (2021).","ama":"Boccato C. The excitation spectrum of the Bose gas in the Gross-Pitaevskii regime. <i>Reviews in Mathematical Physics</i>. 2021;33(1). doi:<a href=\"https://doi.org/10.1142/S0129055X20600065\">10.1142/S0129055X20600065</a>","ista":"Boccato C. 2021. The excitation spectrum of the Bose gas in the Gross-Pitaevskii regime. Reviews in Mathematical Physics. 33(1), 2060006.","apa":"Boccato, C. (2021). The excitation spectrum of the Bose gas in the Gross-Pitaevskii regime. <i>Reviews in Mathematical Physics</i>. World Scientific Publishing. <a href=\"https://doi.org/10.1142/S0129055X20600065\">https://doi.org/10.1142/S0129055X20600065</a>","ieee":"C. Boccato, “The excitation spectrum of the Bose gas in the Gross-Pitaevskii regime,” <i>Reviews in Mathematical Physics</i>, vol. 33, no. 1. World Scientific Publishing, 2021."},"month":"01","ec_funded":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2001.00497"}],"day":"01","type":"journal_article","article_number":"2060006","date_updated":"2025-05-14T10:49:57Z","oa_version":"Preprint","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"RoSe"}],"publication_status":"published","external_id":{"arxiv":["2001.00497"],"isi":["000613313200007"]},"fulldoi":"https://doi.org/10.1142/S0129055X20600065","project":[{"_id":"25C6DC12-B435-11E9-9278-68D0E5697425","grant_number":"694227","call_identifier":"H2020","name":"Analysis of quantum many-body systems"}],"article_type":"original","oa":1,"date_created":"2020-04-26T22:00:45Z","intvolume":"        33","scopus_import":"1","publication":"Reviews in Mathematical Physics","_id":"7685","publisher":"World Scientific Publishing","isi":1,"arxiv":1,"language":[{"iso":"eng"}],"date_published":"2021-01-01T00:00:00Z","volume":33,"quality_controlled":"1","author":[{"first_name":"Chiara","last_name":"Boccato","id":"342E7E22-F248-11E8-B48F-1D18A9856A87","full_name":"Boccato, Chiara"}],"title":"The excitation spectrum of the Bose gas in the Gross-Pitaevskii regime"},{"author":[{"id":"3DE6C32A-F248-11E8-B48F-1D18A9856A87","first_name":"Niels P","last_name":"Benedikter","orcid":"0000-0002-1071-6091","full_name":"Benedikter, Niels P"}],"title":"Bosonic collective excitations in Fermi gases","quality_controlled":"1","volume":33,"date_published":"2021-01-01T00:00:00Z","language":[{"iso":"eng"}],"arxiv":1,"isi":1,"publisher":"World Scientific Publishing","publication":"Reviews in Mathematical Physics","intvolume":"        33","scopus_import":"1","_id":"7900","project":[{"grant_number":"694227","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","name":"Analysis of quantum many-body systems","call_identifier":"H2020"}],"article_type":"original","oa":1,"date_created":"2020-05-28T16:47:55Z","external_id":{"arxiv":["1910.08190"],"isi":["000613313200010"]},"fulldoi":"https://doi.org/10.1142/s0129055x20600090","department":[{"_id":"RoSe"}],"publication_status":"published","article_processing_charge":"No","oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2025-05-14T10:49:46Z","article_number":"2060009","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1910.08190"}],"ec_funded":1,"type":"journal_article","day":"01","citation":{"ieee":"N. P. Benedikter, “Bosonic collective excitations in Fermi gases,” <i>Reviews in Mathematical Physics</i>, vol. 33, no. 1. World Scientific Publishing, 2021.","apa":"Benedikter, N. P. (2021). Bosonic collective excitations in Fermi gases. <i>Reviews in Mathematical Physics</i>. World Scientific Publishing. <a href=\"https://doi.org/10.1142/s0129055x20600090\">https://doi.org/10.1142/s0129055x20600090</a>","ama":"Benedikter NP. Bosonic collective excitations in Fermi gases. <i>Reviews in Mathematical Physics</i>. 2021;33(1). doi:<a href=\"https://doi.org/10.1142/s0129055x20600090\">10.1142/s0129055x20600090</a>","ista":"Benedikter NP. 2021. Bosonic collective excitations in Fermi gases. Reviews in Mathematical Physics. 33(1), 2060009.","short":"N.P. Benedikter, Reviews in Mathematical Physics 33 (2021).","mla":"Benedikter, Niels P. “Bosonic Collective Excitations in Fermi Gases.” <i>Reviews in Mathematical Physics</i>, vol. 33, no. 1, 2060009, World Scientific Publishing, 2021, doi:<a href=\"https://doi.org/10.1142/s0129055x20600090\">10.1142/s0129055x20600090</a>.","chicago":"Benedikter, Niels P. “Bosonic Collective Excitations in Fermi Gases.” <i>Reviews in Mathematical Physics</i>. World Scientific Publishing, 2021. <a href=\"https://doi.org/10.1142/s0129055x20600090\">https://doi.org/10.1142/s0129055x20600090</a>."},"month":"01","publication_identifier":{"issn":["0129-055X"],"eissn":["1793-6659"]},"doi":"10.1142/s0129055x20600090","status":"public","year":"2021","issue":"1","abstract":[{"text":"Hartree–Fock theory has been justified as a mean-field approximation for fermionic systems. However, it suffers from some defects in predicting physical properties, making necessary a theory of quantum correlations. Recently, bosonization of many-body correlations has been rigorously justified as an upper bound on the correlation energy at high density with weak interactions. We review the bosonic approximation, deriving an effective Hamiltonian. We then show that for systems with Coulomb interaction this effective theory predicts collective excitations (plasmons) in accordance with the random phase approximation of Bohm and Pines, and with experimental observation.","lang":"eng"}]},{"ddc":["510"],"page":"885-979","_id":"7901","publication":"Inventiones Mathematicae","intvolume":"       225","scopus_import":"1","oa":1,"date_created":"2020-05-28T16:48:20Z","has_accepted_license":"1","project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"},{"call_identifier":"H2020","name":"Analysis of quantum many-body systems","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","grant_number":"694227"}],"article_type":"original","isi":1,"publisher":"Springer","date_published":"2021-05-03T00:00:00Z","file":[{"success":1,"file_size":1089319,"relation":"main_file","file_id":"11386","checksum":"f38c79dfd828cdc7f49a34b37b83d376","access_level":"open_access","creator":"dernst","file_name":"2021_InventMath_Benedikter.pdf","content_type":"application/pdf","date_updated":"2022-05-16T12:23:40Z","date_created":"2022-05-16T12:23:40Z"}],"language":[{"iso":"eng"}],"arxiv":1,"author":[{"orcid":"0000-0002-1071-6091","full_name":"Benedikter, Niels P","id":"3DE6C32A-F248-11E8-B48F-1D18A9856A87","last_name":"Benedikter","first_name":"Niels P"},{"last_name":"Nam","first_name":"Phan Thành","full_name":"Nam, Phan Thành"},{"full_name":"Porta, Marcello","last_name":"Porta","first_name":"Marcello"},{"last_name":"Schlein","first_name":"Benjamin","full_name":"Schlein, Benjamin"},{"last_name":"Seiringer","first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521"}],"title":"Correlation energy of a weakly interacting Fermi gas","quality_controlled":"1","volume":225,"acknowledgement":"We thank Christian Hainzl for helpful discussions and a referee for very careful reading of the paper and many helpful suggestions. NB and RS were supported by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No. 694227). Part of the research of NB was conducted on the RZD18 Nice–Milan–Vienna–Moscow. NB thanks Elliott H. Lieb and Peter Otte for explanations about the Luttinger model. PTN has received funding from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy (EXC-2111-390814868). MP acknowledges financial support from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (ERC StG MaMBoQ, grant agreement No. 802901). BS gratefully acknowledges financial support from the NCCR SwissMAP, from the Swiss National Science Foundation through the Grant “Dynamical and energetic properties of Bose-Einstein condensates” and from the European Research Council through the ERC-AdG CLaQS (grant agreement No. 834782). All authors acknowledge support for workshop participation from Mathematisches Forschungsinstitut Oberwolfach (Leibniz Association). NB, PTN, BS, and RS acknowledge support for workshop participation from Fondation des Treilles.","status":"public","year":"2021","publication_identifier":{"issn":["0020-9910"],"eissn":["1432-1297"]},"doi":"10.1007/s00222-021-01041-5","abstract":[{"text":"We derive rigorously the leading order of the correlation energy of a Fermi gas in a scaling regime of high density and weak interaction. The result verifies the prediction of the random-phase approximation. Our proof refines the method of collective bosonization in three dimensions. We approximately diagonalize an effective Hamiltonian describing approximately bosonic collective excitations around the Hartree–Fock state, while showing that gapless and non-collective excitations have only a negligible effect on the ground state energy.","lang":"eng"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"day":"03","type":"journal_article","file_date_updated":"2022-05-16T12:23:40Z","ec_funded":1,"month":"05","citation":{"ama":"Benedikter NP, Nam PT, Porta M, Schlein B, Seiringer R. Correlation energy of a weakly interacting Fermi gas. <i>Inventiones Mathematicae</i>. 2021;225:885-979. doi:<a href=\"https://doi.org/10.1007/s00222-021-01041-5\">10.1007/s00222-021-01041-5</a>","ista":"Benedikter NP, Nam PT, Porta M, Schlein B, Seiringer R. 2021. Correlation energy of a weakly interacting Fermi gas. Inventiones Mathematicae. 225, 885–979.","apa":"Benedikter, N. P., Nam, P. T., Porta, M., Schlein, B., &#38; Seiringer, R. (2021). Correlation energy of a weakly interacting Fermi gas. <i>Inventiones Mathematicae</i>. Springer. <a href=\"https://doi.org/10.1007/s00222-021-01041-5\">https://doi.org/10.1007/s00222-021-01041-5</a>","ieee":"N. P. Benedikter, P. T. Nam, M. Porta, B. Schlein, and R. Seiringer, “Correlation energy of a weakly interacting Fermi gas,” <i>Inventiones Mathematicae</i>, vol. 225. Springer, pp. 885–979, 2021.","short":"N.P. Benedikter, P.T. Nam, M. Porta, B. Schlein, R. Seiringer, Inventiones Mathematicae 225 (2021) 885–979.","chicago":"Benedikter, Niels P, Phan Thành Nam, Marcello Porta, Benjamin Schlein, and Robert Seiringer. “Correlation Energy of a Weakly Interacting Fermi Gas.” <i>Inventiones Mathematicae</i>. Springer, 2021. <a href=\"https://doi.org/10.1007/s00222-021-01041-5\">https://doi.org/10.1007/s00222-021-01041-5</a>.","mla":"Benedikter, Niels P., et al. “Correlation Energy of a Weakly Interacting Fermi Gas.” <i>Inventiones Mathematicae</i>, vol. 225, Springer, 2021, pp. 885–979, doi:<a href=\"https://doi.org/10.1007/s00222-021-01041-5\">10.1007/s00222-021-01041-5</a>."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","article_processing_charge":"Yes (via OA deal)","oa_version":"Published Version","date_updated":"2025-04-14T07:27:00Z","fulldoi":"https://doi.org/10.1007/s00222-021-01041-5","external_id":{"arxiv":["2005.08933"],"isi":["000646573600001"]},"publication_status":"published","department":[{"_id":"RoSe"}]},{"_id":"7905","page":"1166-1198","ddc":["510"],"intvolume":"        65","scopus_import":"1","publication":"Discrete and Computational Geometry","date_created":"2020-05-30T10:26:04Z","oa":1,"article_type":"original","project":[{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"has_accepted_license":"1","publisher":"Springer Nature","isi":1,"file":[{"content_type":"application/pdf","creator":"dernst","file_name":"2020_DiscreteCompGeometry_Brown.pdf","date_created":"2020-11-25T09:06:41Z","date_updated":"2020-11-25T09:06:41Z","relation":"main_file","file_id":"8803","success":1,"file_size":1013730,"checksum":"487a84ea5841b75f04f66d7ebd71b67e","access_level":"open_access"}],"date_published":"2021-06-01T00:00:00Z","corr_author":"1","arxiv":1,"language":[{"iso":"eng"}],"title":"Sheaf-theoretic stratification learning from geometric and topological perspectives","author":[{"full_name":"Brown, Adam","id":"70B7FDF6-608D-11E9-9333-8535E6697425","last_name":"Brown","first_name":"Adam"},{"last_name":"Wang","first_name":"Bei","full_name":"Wang, Bei"}],"volume":65,"quality_controlled":"1","year":"2021","status":"public","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). This work was partially supported by NSF IIS-1513616 and NSF ABI-1661375. The authors would like to thank the anonymous referees for their insightful comments.","doi":"10.1007/s00454-020-00206-y","publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]},"abstract":[{"lang":"eng","text":"We investigate a sheaf-theoretic interpretation of stratification learning from geometric and topological perspectives. Our main result is the construction of stratification learning algorithms framed in terms of a sheaf on a partially ordered set with the Alexandroff topology. We prove that the resulting decomposition is the unique minimal stratification for which the strata are homogeneous and the given sheaf is constructible. In particular, when we choose to work with the local homology sheaf, our algorithm gives an alternative to the local homology transfer algorithm given in Bendich et al. (Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1355–1370, ACM, New York, 2012), and the cohomology stratification algorithm given in Nanda (Found. Comput. Math. 20(2), 195–222, 2020). Additionally, we give examples of stratifications based on the geometric techniques of Breiding et al. (Rev. Mat. Complut. 31(3), 545–593, 2018), illustrating how the sheaf-theoretic approach can be used to study stratifications from both topological and geometric perspectives. This approach also points toward future applications of sheaf theory in the study of topological data analysis by illustrating the utility of the language of sheaf theory in generalizing existing algorithms."}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"file_date_updated":"2020-11-25T09:06:41Z","day":"01","type":"journal_article","month":"06","citation":{"short":"A. Brown, B. Wang, Discrete and Computational Geometry 65 (2021) 1166–1198.","chicago":"Brown, Adam, and Bei Wang. “Sheaf-Theoretic Stratification Learning from Geometric and Topological Perspectives.” <i>Discrete and Computational Geometry</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/s00454-020-00206-y\">https://doi.org/10.1007/s00454-020-00206-y</a>.","mla":"Brown, Adam, and Bei Wang. “Sheaf-Theoretic Stratification Learning from Geometric and Topological Perspectives.” <i>Discrete and Computational Geometry</i>, vol. 65, Springer Nature, 2021, pp. 1166–98, doi:<a href=\"https://doi.org/10.1007/s00454-020-00206-y\">10.1007/s00454-020-00206-y</a>.","ama":"Brown A, Wang B. Sheaf-theoretic stratification learning from geometric and topological perspectives. <i>Discrete and Computational Geometry</i>. 2021;65:1166-1198. doi:<a href=\"https://doi.org/10.1007/s00454-020-00206-y\">10.1007/s00454-020-00206-y</a>","ista":"Brown A, Wang B. 2021. Sheaf-theoretic stratification learning from geometric and topological perspectives. Discrete and Computational Geometry. 65, 1166–1198.","ieee":"A. Brown and B. Wang, “Sheaf-theoretic stratification learning from geometric and topological perspectives,” <i>Discrete and Computational Geometry</i>, vol. 65. Springer Nature, pp. 1166–1198, 2021.","apa":"Brown, A., &#38; Wang, B. (2021). Sheaf-theoretic stratification learning from geometric and topological perspectives. <i>Discrete and Computational Geometry</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00454-020-00206-y\">https://doi.org/10.1007/s00454-020-00206-y</a>"},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"Yes (via OA deal)","oa_version":"Published Version","date_updated":"2025-04-15T06:53:15Z","fulldoi":"https://doi.org/10.1007/s00454-020-00206-y","external_id":{"arxiv":["1712.07734"],"isi":["000536324700001"]},"publication_status":"published","department":[{"_id":"HeEd"}]},{"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"abstract":[{"text":"In this paper, we introduce a relaxed CQ method with alternated inertial step for solving split feasibility problems. We give convergence of the sequence generated by our method under some suitable assumptions. Some numerical implementations from sparse signal and image deblurring are reported to show the efficiency of our method.","lang":"eng"}],"publication_identifier":{"issn":["1862-4472"],"eissn":["1862-4480"]},"doi":"10.1007/s11590-020-01603-1","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). The authors are grateful to the referees for their insightful comments which have improved the earlier version of the manuscript greatly. The first author has received funding from the European Research Council (ERC) under the European Union’s Seventh Framework Program (FP7-2007-2013) (Grant agreement No. 616160).","status":"public","year":"2021","citation":{"ama":"Shehu Y, Gibali A. New inertial relaxed method for solving split feasibilities. <i>Optimization Letters</i>. 2021;15:2109-2126. doi:<a href=\"https://doi.org/10.1007/s11590-020-01603-1\">10.1007/s11590-020-01603-1</a>","ieee":"Y. Shehu and A. Gibali, “New inertial relaxed method for solving split feasibilities,” <i>Optimization Letters</i>, vol. 15. Springer Nature, pp. 2109–2126, 2021.","ista":"Shehu Y, Gibali A. 2021. New inertial relaxed method for solving split feasibilities. Optimization Letters. 15, 2109–2126.","apa":"Shehu, Y., &#38; Gibali, A. (2021). New inertial relaxed method for solving split feasibilities. <i>Optimization Letters</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s11590-020-01603-1\">https://doi.org/10.1007/s11590-020-01603-1</a>","short":"Y. Shehu, A. Gibali, Optimization Letters 15 (2021) 2109–2126.","chicago":"Shehu, Yekini, and Aviv Gibali. “New Inertial Relaxed Method for Solving Split Feasibilities.” <i>Optimization Letters</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/s11590-020-01603-1\">https://doi.org/10.1007/s11590-020-01603-1</a>.","mla":"Shehu, Yekini, and Aviv Gibali. “New Inertial Relaxed Method for Solving Split Feasibilities.” <i>Optimization Letters</i>, vol. 15, Springer Nature, 2021, pp. 2109–26, doi:<a href=\"https://doi.org/10.1007/s11590-020-01603-1\">10.1007/s11590-020-01603-1</a>."},"month":"09","ec_funded":1,"day":"01","type":"journal_article","file_date_updated":"2024-03-07T14:58:51Z","date_updated":"2024-11-04T13:52:35Z","oa_version":"Published Version","article_processing_charge":"Yes (via OA deal)","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"VlKo"}],"publication_status":"published","external_id":{"isi":["000537342300001"]},"fulldoi":"https://doi.org/10.1007/s11590-020-01603-1","has_accepted_license":"1","article_type":"original","project":[{"name":"Discrete Optimization in Computer Vision: Theory and Practice","call_identifier":"FP7","grant_number":"616160","_id":"25FBA906-B435-11E9-9278-68D0E5697425"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"oa":1,"date_created":"2020-06-04T11:28:33Z","publication":"Optimization Letters","intvolume":"        15","scopus_import":"1","ddc":["510"],"page":"2109-2126","_id":"7925","publisher":"Springer Nature","isi":1,"language":[{"iso":"eng"}],"date_published":"2021-09-01T00:00:00Z","corr_author":"1","file":[{"content_type":"application/pdf","file_name":"2021_OptimizationLetters_Shehu.pdf","creator":"kschuh","date_updated":"2024-03-07T14:58:51Z","date_created":"2024-03-07T14:58:51Z","file_id":"15089","relation":"main_file","file_size":2148882,"success":1,"checksum":"63c5f31cd04626152a19f97a2476281b","access_level":"open_access"}],"quality_controlled":"1","volume":15,"title":"New inertial relaxed method for solving split feasibilities","author":[{"last_name":"Shehu","first_name":"Yekini","id":"3FC7CB58-F248-11E8-B48F-1D18A9856A87","full_name":"Shehu, Yekini","orcid":"0000-0001-9224-7139"},{"last_name":"Gibali","first_name":"Aviv","full_name":"Gibali, Aviv"}]},{"ddc":["000"],"page":"463-487","_id":"7939","publication":"Distributed Computing","intvolume":"        34","scopus_import":"1","oa":1,"date_created":"2020-06-07T22:00:54Z","project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"article_type":"original","publisher":"Springer Nature","isi":1,"related_material":{"record":[{"id":"6933","relation":"earlier_version","status":"public"}]},"date_published":"2021-12-01T00:00:00Z","corr_author":"1","language":[{"iso":"eng"}],"arxiv":1,"author":[{"full_name":"Censor-Hillel, Keren","first_name":"Keren","last_name":"Censor-Hillel"},{"full_name":"Dory, Michal","first_name":"Michal","last_name":"Dory"},{"full_name":"Korhonen, Janne","id":"C5402D42-15BC-11E9-A202-CA2BE6697425","first_name":"Janne","last_name":"Korhonen"},{"first_name":"Dean","last_name":"Leitersdorf","full_name":"Leitersdorf, Dean"}],"title":"Fast approximate shortest paths in the congested clique","quality_controlled":"1","volume":34,"status":"public","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). We thank Mohsen Ghaffari, Michael Elkin and Merav Parter for fruitful discussions. This project has received funding from the European Union’s Horizon 2020 Research And Innovation Program under Grant Agreement No. 755839.","year":"2021","publication_identifier":{"issn":["0178-2770"],"eissn":["1432-0452"]},"doi":"10.1007/s00446-020-00380-5","abstract":[{"lang":"eng","text":"We design fast deterministic algorithms for distance computation in the Congested Clique model. Our key contributions include:\r\n    A (2+ϵ)-approximation for all-pairs shortest paths in O(log2n/ϵ) rounds on unweighted undirected graphs. With a small additional additive factor, this also applies for weighted graphs. This is the first sub-polynomial constant-factor approximation for APSP in this model.\r\n    A (1+ϵ)-approximation for multi-source shortest paths from O(n−−√) sources in O(log2n/ϵ) rounds on weighted undirected graphs. This is the first sub-polynomial algorithm obtaining this approximation for a set of sources of polynomial size.\r\n\r\nOur main techniques are new distance tools that are obtained via improved algorithms for sparse matrix multiplication, which we leverage to construct efficient hopsets and shortest paths. Furthermore, our techniques extend to additional distance problems for which we improve upon the state-of-the-art, including diameter approximation, and an exact single-source shortest paths algorithm for weighted undirected graphs in O~(n1/6) rounds. "}],"type":"journal_article","day":"01","main_file_link":[{"url":"https://doi.org/10.1007/s00446-020-00380-5","open_access":"1"}],"month":"12","citation":{"mla":"Censor-Hillel, Keren, et al. “Fast Approximate Shortest Paths in the Congested Clique.” <i>Distributed Computing</i>, vol. 34, Springer Nature, 2021, pp. 463–87, doi:<a href=\"https://doi.org/10.1007/s00446-020-00380-5\">10.1007/s00446-020-00380-5</a>.","chicago":"Censor-Hillel, Keren, Michal Dory, Janne Korhonen, and Dean Leitersdorf. “Fast Approximate Shortest Paths in the Congested Clique.” <i>Distributed Computing</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/s00446-020-00380-5\">https://doi.org/10.1007/s00446-020-00380-5</a>.","short":"K. Censor-Hillel, M. Dory, J. Korhonen, D. Leitersdorf, Distributed Computing 34 (2021) 463–487.","ista":"Censor-Hillel K, Dory M, Korhonen J, Leitersdorf D. 2021. Fast approximate shortest paths in the congested clique. Distributed Computing. 34, 463–487.","ieee":"K. Censor-Hillel, M. Dory, J. Korhonen, and D. Leitersdorf, “Fast approximate shortest paths in the congested clique,” <i>Distributed Computing</i>, vol. 34. Springer Nature, pp. 463–487, 2021.","apa":"Censor-Hillel, K., Dory, M., Korhonen, J., &#38; Leitersdorf, D. (2021). Fast approximate shortest paths in the congested clique. <i>Distributed Computing</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00446-020-00380-5\">https://doi.org/10.1007/s00446-020-00380-5</a>","ama":"Censor-Hillel K, Dory M, Korhonen J, Leitersdorf D. Fast approximate shortest paths in the congested clique. <i>Distributed Computing</i>. 2021;34:463-487. doi:<a href=\"https://doi.org/10.1007/s00446-020-00380-5\">10.1007/s00446-020-00380-5</a>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","article_processing_charge":"Yes (via OA deal)","date_updated":"2026-06-18T19:28:41Z","fulldoi":"https://doi.org/10.1007/s00446-020-00380-5","external_id":{"arxiv":["1903.05956"],"isi":["000556444600001"]},"publication_status":"published","department":[{"_id":"DaAl"}]},{"publication":"Methods in Cell Biology","scopus_import":"1","intvolume":"       161","page":"33-56","_id":"7941","date_created":"2020-06-07T22:00:55Z","publisher":"Elsevier","date_published":"2021-01-01T00:00:00Z","corr_author":"1","language":[{"iso":"eng"}],"title":"Simple multi-color super-resolution by X10 microscopy","author":[{"first_name":"Sven M","last_name":"Truckenbrodt","id":"45812BD4-F248-11E8-B48F-1D18A9856A87","full_name":"Truckenbrodt, Sven M"},{"first_name":"Silvio O.","last_name":"Rizzoli","full_name":"Rizzoli, Silvio O."}],"quality_controlled":"1","pmid":1,"volume":161,"doi":"10.1016/bs.mcb.2020.04.016","publication_identifier":{"isbn":["978012820807-6"],"issn":["0091-679X"]},"status":"public","year":"2021","abstract":[{"text":"Expansion microscopy is a recently developed super-resolution imaging technique, which provides an alternative to optics-based methods such as deterministic approaches (e.g. STED) or stochastic approaches (e.g. PALM/STORM). The idea behind expansion microscopy is to embed the biological sample in a swellable gel, and then to expand it isotropically, thereby increasing the distance between the fluorophores. This approach breaks the diffraction barrier by simply separating the emission point-spread-functions of the fluorophores. The resolution attainable in expansion microscopy is thus directly dependent on the separation that can be achieved, i.e. on the expansion factor. The original implementation of the technique achieved an expansion factor of fourfold, for a resolution of 70–80 nm. The subsequently developed X10 method achieves an expansion factor of 10-fold, for a resolution of 25–30 nm. This technique can be implemented with minimal technical requirements on any standard fluorescence microscope, and is more easily applied for multi-color imaging than either deterministic or stochastic super-resolution approaches. This renders X10 expansion microscopy a highly promising tool for new biological discoveries, as discussed here, and as demonstrated by several recent applications.","lang":"eng"}],"type":"book_chapter","day":"01","citation":{"ista":"Truckenbrodt SM, Rizzoli SO. 2021.Simple multi-color super-resolution by X10 microscopy. In: Methods in Cell Biology. vol. 161, 33–56.","ieee":"S. M. Truckenbrodt and S. O. Rizzoli, “Simple multi-color super-resolution by X10 microscopy,” in <i>Methods in Cell Biology</i>, vol. 161, Elsevier, 2021, pp. 33–56.","apa":"Truckenbrodt, S. M., &#38; Rizzoli, S. O. (2021). Simple multi-color super-resolution by X10 microscopy. In <i>Methods in Cell Biology</i> (Vol. 161, pp. 33–56). Elsevier. <a href=\"https://doi.org/10.1016/bs.mcb.2020.04.016\">https://doi.org/10.1016/bs.mcb.2020.04.016</a>","ama":"Truckenbrodt SM, Rizzoli SO. Simple multi-color super-resolution by X10 microscopy. In: <i>Methods in Cell Biology</i>. Vol 161. Elsevier; 2021:33-56. doi:<a href=\"https://doi.org/10.1016/bs.mcb.2020.04.016\">10.1016/bs.mcb.2020.04.016</a>","short":"S.M. Truckenbrodt, S.O. Rizzoli, in:, Methods in Cell Biology, Elsevier, 2021, pp. 33–56.","mla":"Truckenbrodt, Sven M., and Silvio O. Rizzoli. “Simple Multi-Color Super-Resolution by X10 Microscopy.” <i>Methods in Cell Biology</i>, vol. 161, Elsevier, 2021, pp. 33–56, doi:<a href=\"https://doi.org/10.1016/bs.mcb.2020.04.016\">10.1016/bs.mcb.2020.04.016</a>.","chicago":"Truckenbrodt, Sven M, and Silvio O. Rizzoli. “Simple Multi-Color Super-Resolution by X10 Microscopy.” In <i>Methods in Cell Biology</i>, 161:33–56. Elsevier, 2021. <a href=\"https://doi.org/10.1016/bs.mcb.2020.04.016\">https://doi.org/10.1016/bs.mcb.2020.04.016</a>."},"month":"01","oa_version":"None","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-10-09T20:59:36Z","external_id":{"pmid":["33478696"]},"fulldoi":"https://doi.org/10.1016/bs.mcb.2020.04.016","department":[{"_id":"JoDa"}],"publication_status":"published"},{"fulldoi":"https://doi.org/10.1007/s11081-020-09544-5","external_id":{"isi":["000559345400001"]},"publication_status":"published","department":[{"_id":"VlKo"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"Yes (via OA deal)","oa_version":"Published Version","date_updated":"2024-11-04T13:52:38Z","file_date_updated":"2020-08-03T15:24:39Z","day":"25","type":"journal_article","ec_funded":1,"month":"02","citation":{"mla":"Shehu, Yekini, et al. “New Strong Convergence Method for the Sum of Two Maximal Monotone Operators.” <i>Optimization and Engineering</i>, vol. 22, Springer Nature, 2021, pp. 2627–53, doi:<a href=\"https://doi.org/10.1007/s11081-020-09544-5\">10.1007/s11081-020-09544-5</a>.","chicago":"Shehu, Yekini, Qiao-Li Dong, Lu-Lu Liu, and Jen-Chih Yao. “New Strong Convergence Method for the Sum of Two Maximal Monotone Operators.” <i>Optimization and Engineering</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/s11081-020-09544-5\">https://doi.org/10.1007/s11081-020-09544-5</a>.","short":"Y. Shehu, Q.-L. Dong, L.-L. Liu, J.-C. Yao, Optimization and Engineering 22 (2021) 2627–2653.","ama":"Shehu Y, Dong Q-L, Liu L-L, Yao J-C. New strong convergence method for the sum of two maximal monotone operators. <i>Optimization and Engineering</i>. 2021;22:2627-2653. doi:<a href=\"https://doi.org/10.1007/s11081-020-09544-5\">10.1007/s11081-020-09544-5</a>","apa":"Shehu, Y., Dong, Q.-L., Liu, L.-L., &#38; Yao, J.-C. (2021). New strong convergence method for the sum of two maximal monotone operators. <i>Optimization and Engineering</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s11081-020-09544-5\">https://doi.org/10.1007/s11081-020-09544-5</a>","ieee":"Y. Shehu, Q.-L. Dong, L.-L. Liu, and J.-C. Yao, “New strong convergence method for the sum of two maximal monotone operators,” <i>Optimization and Engineering</i>, vol. 22. Springer Nature, pp. 2627–2653, 2021.","ista":"Shehu Y, Dong Q-L, Liu L-L, Yao J-C. 2021. New strong convergence method for the sum of two maximal monotone operators. Optimization and Engineering. 22, 2627–2653."},"year":"2021","status":"public","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). The project of Yekini Shehu has received funding from the European Research Council (ERC) under the European Union’s Seventh Framework Program (FP7—2007–2013) (Grant Agreement No. 616160). The authors are grateful to the anonymous referees and the handling Editor for their comments and suggestions which have improved the earlier version of the manuscript greatly.","publication_identifier":{"issn":["1389-4420"],"eissn":["1573-2924"]},"doi":"10.1007/s11081-020-09544-5","abstract":[{"text":"This paper aims to obtain a strong convergence result for a Douglas–Rachford splitting method with inertial extrapolation step for finding a zero of the sum of two set-valued maximal monotone operators without any further assumption of uniform monotonicity on any of the involved maximal monotone operators. Furthermore, our proposed method is easy to implement and the inertial factor in our proposed method is a natural choice. Our method of proof is of independent interest. Finally, some numerical implementations are given to confirm the theoretical analysis.","lang":"eng"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"title":"New strong convergence method for the sum of two maximal monotone operators","author":[{"orcid":"0000-0001-9224-7139","full_name":"Shehu, Yekini","id":"3FC7CB58-F248-11E8-B48F-1D18A9856A87","last_name":"Shehu","first_name":"Yekini"},{"full_name":"Dong, Qiao-Li","first_name":"Qiao-Li","last_name":"Dong"},{"full_name":"Liu, Lu-Lu","last_name":"Liu","first_name":"Lu-Lu"},{"full_name":"Yao, Jen-Chih","first_name":"Jen-Chih","last_name":"Yao"}],"volume":22,"quality_controlled":"1","file":[{"date_created":"2020-08-03T15:24:39Z","date_updated":"2020-08-03T15:24:39Z","content_type":"application/pdf","file_name":"2020_OptimizationEngineering_Shehu.pdf","creator":"dernst","access_level":"open_access","file_id":"8197","relation":"main_file","success":1,"file_size":2137860}],"corr_author":"1","date_published":"2021-02-25T00:00:00Z","language":[{"iso":"eng"}],"publisher":"Springer Nature","isi":1,"_id":"8196","ddc":["510"],"page":"2627-2653","scopus_import":"1","intvolume":"        22","publication":"Optimization and Engineering","oa":1,"date_created":"2020-08-03T14:29:57Z","project":[{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"},{"name":"Discrete Optimization in Computer Vision: Theory and Practice","call_identifier":"FP7","grant_number":"616160","_id":"25FBA906-B435-11E9-9278-68D0E5697425"}],"article_type":"original","has_accepted_license":"1"},{"acknowledgement":"We thank Y. Bar Lev, T. Biadse, and, particularly, E. Bairey and B. Katzir for illuminating discussions and their many insights and help. The authors thank N. Lindner for his support throughout this project. We are further grateful to M. Serbyn, A. Kamenev, A. Turner, and S. de Nicola for reading the manuscript and providing good feedback and suggestions. We acknowledge financial support from the Defense Advanced Research Projects Agency through the DRINQS program, Grant No. D18AC00025. T.G. was in part supported by an Aly Kaufman Fellowship at the Technion. T.G. acknowledges funding from the Institute of Science and Technology (IST) Austria and from the European Union’s Horizon 2020 research and innovation program under Marie SkłodowskaCurie Grant Agreement No. 754411.under the Marie Skłodowska-Curie Grant Agreement No.754411.","status":"public","year":"2021","publication_identifier":{"eissn":["2469-9969"],"issn":["2469-9950"]},"doi":"10.1103/PhysRevB.103.214204","issue":"21","abstract":[{"text":"We investigate how the critical driving amplitude at the Floquet many-body localized (MBL) to ergodic phase transition differs between smooth and nonsmooth drives. To this end, we numerically study a disordered spin-1/2 chain which is periodically driven by a sine or square-wave drive over a wide range of driving frequencies. In both cases the critical driving amplitude increases monotonically with the frequency, and at large frequencies it is identical for the two drives. However, at low and intermediate frequencies the critical amplitude of the square-wave drive depends strongly on the frequency, while that of the sinusoidal drive is almost constant over a wide frequency range. By analyzing the density of drive-induced resonances we conclude that this difference is due to resonances induced by the higher harmonics which are present (absent) in the Fourier spectrum of the square-wave (sine) drive. Furthermore, we suggest a numerically efficient method for estimating the frequency dependence of the critical driving amplitudes for different drives which is based on calculating the density of drive-induced resonances. We conclude that delocalization occurs once the density of drive-induced resonances reaches a critical value determined only by the static system.","lang":"eng"}],"type":"journal_article","day":"21","main_file_link":[{"url":"https://arxiv.org/abs/2007.14879","open_access":"1"}],"ec_funded":1,"month":"06","citation":{"short":"A.A. Diringer, T. Gulden, Physical Review B 103 (2021).","chicago":"Diringer, Asaf A., and Tobias Gulden. “Impact of Drive Harmonics on the Stability of Floquet Many-Body Localization.” <i>Physical Review B</i>. American Physical Society, 2021. <a href=\"https://doi.org/10.1103/PhysRevB.103.214204\">https://doi.org/10.1103/PhysRevB.103.214204</a>.","mla":"Diringer, Asaf A., and Tobias Gulden. “Impact of Drive Harmonics on the Stability of Floquet Many-Body Localization.” <i>Physical Review B</i>, vol. 103, no. 21, 214204, American Physical Society, 2021, doi:<a href=\"https://doi.org/10.1103/PhysRevB.103.214204\">10.1103/PhysRevB.103.214204</a>.","ieee":"A. A. Diringer and T. Gulden, “Impact of drive harmonics on the stability of Floquet many-body localization,” <i>Physical Review B</i>, vol. 103, no. 21. American Physical Society, 2021.","ama":"Diringer AA, Gulden T. Impact of drive harmonics on the stability of Floquet many-body localization. <i>Physical Review B</i>. 2021;103(21). doi:<a href=\"https://doi.org/10.1103/PhysRevB.103.214204\">10.1103/PhysRevB.103.214204</a>","apa":"Diringer, A. A., &#38; Gulden, T. (2021). Impact of drive harmonics on the stability of Floquet many-body localization. <i>Physical Review B</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevB.103.214204\">https://doi.org/10.1103/PhysRevB.103.214204</a>","ista":"Diringer AA, Gulden T. 2021. Impact of drive harmonics on the stability of Floquet many-body localization. Physical Review B. 103(21), 214204."},"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","oa_version":"Preprint","article_processing_charge":"No","date_updated":"2026-04-02T14:02:07Z","article_number":"214204","fulldoi":"https://doi.org/10.1103/PhysRevB.103.214204","external_id":{"arxiv":["2007.14879"],"isi":["000664429700005"]},"publication_status":"published","department":[{"_id":"MaSe"}],"_id":"8198","publication":"Physical Review B","scopus_import":"1","intvolume":"       103","date_created":"2020-08-04T13:03:40Z","oa":1,"project":[{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"}],"article_type":"original","isi":1,"publisher":"American Physical Society","date_published":"2021-06-21T00:00:00Z","language":[{"iso":"eng"}],"arxiv":1,"title":"Impact of drive harmonics on the stability of Floquet many-body localization","author":[{"full_name":"Diringer, Asaf A.","first_name":"Asaf A.","last_name":"Diringer"},{"last_name":"Gulden","first_name":"Tobias","id":"1083E038-9F73-11E9-A4B5-532AE6697425","full_name":"Gulden, Tobias","orcid":"0000-0001-6814-7541"}],"quality_controlled":"1","volume":103},{"volume":66,"quality_controlled":"1","author":[{"full_name":"Boissonnat, Jean-Daniel","last_name":"Boissonnat","first_name":"Jean-Daniel"},{"full_name":"Dyer, Ramsay","last_name":"Dyer","first_name":"Ramsay"},{"first_name":"Arijit","last_name":"Ghosh","full_name":"Ghosh, Arijit"},{"full_name":"Lieutier, Andre","first_name":"Andre","last_name":"Lieutier"},{"full_name":"Wintraecken, Mathijs","orcid":"0000-0002-7472-2220","last_name":"Wintraecken","first_name":"Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87"}],"title":"Local conditions for triangulating submanifolds of Euclidean space","language":[{"iso":"eng"}],"corr_author":"1","date_published":"2021-09-01T00:00:00Z","isi":1,"publisher":"Springer Nature","date_created":"2020-08-11T07:11:51Z","oa":1,"project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships"}],"article_type":"original","has_accepted_license":"1","_id":"8248","page":"666-686","ddc":["510"],"intvolume":"        66","scopus_import":"1","publication":"Discrete and Computational Geometry","publication_status":"published","department":[{"_id":"HeEd"}],"fulldoi":"https://doi.org/10.1007/s00454-020-00233-9","external_id":{"isi":["000558119300001"]},"date_updated":"2025-04-14T07:44:05Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"Yes (via OA deal)","oa_version":"Published Version","month":"09","citation":{"apa":"Boissonnat, J.-D., Dyer, R., Ghosh, A., Lieutier, A., &#38; Wintraecken, M. (2021). Local conditions for triangulating submanifolds of Euclidean space. <i>Discrete and Computational Geometry</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00454-020-00233-9\">https://doi.org/10.1007/s00454-020-00233-9</a>","ama":"Boissonnat J-D, Dyer R, Ghosh A, Lieutier A, Wintraecken M. Local conditions for triangulating submanifolds of Euclidean space. <i>Discrete and Computational Geometry</i>. 2021;66:666-686. doi:<a href=\"https://doi.org/10.1007/s00454-020-00233-9\">10.1007/s00454-020-00233-9</a>","ieee":"J.-D. Boissonnat, R. Dyer, A. Ghosh, A. Lieutier, and M. Wintraecken, “Local conditions for triangulating submanifolds of Euclidean space,” <i>Discrete and Computational Geometry</i>, vol. 66. Springer Nature, pp. 666–686, 2021.","ista":"Boissonnat J-D, Dyer R, Ghosh A, Lieutier A, Wintraecken M. 2021. Local conditions for triangulating submanifolds of Euclidean space. Discrete and Computational Geometry. 66, 666–686.","chicago":"Boissonnat, Jean-Daniel, Ramsay Dyer, Arijit Ghosh, Andre Lieutier, and Mathijs Wintraecken. “Local Conditions for Triangulating Submanifolds of Euclidean Space.” <i>Discrete and Computational Geometry</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/s00454-020-00233-9\">https://doi.org/10.1007/s00454-020-00233-9</a>.","mla":"Boissonnat, Jean-Daniel, et al. “Local Conditions for Triangulating Submanifolds of Euclidean Space.” <i>Discrete and Computational Geometry</i>, vol. 66, Springer Nature, 2021, pp. 666–86, doi:<a href=\"https://doi.org/10.1007/s00454-020-00233-9\">10.1007/s00454-020-00233-9</a>.","short":"J.-D. Boissonnat, R. Dyer, A. Ghosh, A. Lieutier, M. Wintraecken, Discrete and Computational Geometry 66 (2021) 666–686."},"day":"01","type":"journal_article","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1007/s00454-020-00233-9"}],"ec_funded":1,"abstract":[{"lang":"eng","text":"We consider the following setting: suppose that we are given a manifold M in Rd with positive reach. Moreover assume that we have an embedded simplical complex A without boundary, whose vertex set lies on the manifold, is sufficiently dense and such that all simplices in A have sufficient quality. We prove that if, locally, interiors of the projection of the simplices onto the tangent space do not intersect, then A is a triangulation of the manifold, that is, they are homeomorphic."}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"year":"2021","status":"public","acknowledgement":"Open access funding provided by the Institute of Science and Technology (IST Austria). Arijit Ghosh is supported by the Ramanujan Fellowship (No. SB/S2/RJN-064/2015), India.\r\nThis work has been funded by the European Research Council under the European Union’s ERC Grant Agreement number 339025 GUDHI (Algorithmic Foundations of Geometric Understanding in Higher Dimensions). The third author is supported by Ramanujan Fellowship (No. SB/S2/RJN-064/2015), India. The fifth author also received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 754411.","publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]},"doi":"10.1007/s00454-020-00233-9"},{"status":"public","acknowledgement":"F.Z. was supported by the Wellcome Trust (110124/Z/15/Z) and the Novartis Research Foundation. T.P.V. was supported by a Wellcome Trust Sir Henry Dale Research fellowship (WT100000), a Wellcome Trust Senior Research Fellowship (214316/Z/18/Z), and an ERC Consolidator Grant SYNAPSEEK.","year":"2021","publication_identifier":{"issn":["0899-7667"],"eissn":["1530-888X"]},"doi":"10.1162/neco_a_01367","issue":"4","abstract":[{"lang":"eng","text":"Brains process information in spiking neural networks. Their intricate connections shape the diverse functions these networks perform. In comparison, the functional capabilities of models of spiking networks are still rudimentary. This shortcoming is mainly due to the lack of insight and practical algorithms to construct the necessary connectivity. Any such algorithm typically attempts to build networks by iteratively reducing the error compared to a desired output. But assigning credit to hidden units in multi-layered spiking networks has remained challenging due to the non-differentiable nonlinearity of spikes. To avoid this issue, one can employ surrogate gradients to discover the required connectivity in spiking network models. However, the choice of a surrogate is not unique, raising the question of how its implementation influences the effectiveness of the method. Here, we use numerical simulations to systematically study how essential design parameters of surrogate gradients impact learning performance on a range of classification problems. We show that surrogate gradient learning is robust to different shapes of underlying surrogate derivatives, but the choice of the derivative’s scale can substantially affect learning performance. When we combine surrogate gradients with a suitable activity regularization technique, robust information processing can be achieved in spiking networks even at the sparse activity limit. Our study provides a systematic account of the remarkable robustness of surrogate gradient learning and serves as a practical guide to model functional spiking neural networks."}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"type":"journal_article","day":"01","file_date_updated":"2022-04-08T06:05:39Z","ec_funded":1,"month":"03","citation":{"ieee":"F. Zenke and T. P. Vogels, “The remarkable robustness of surrogate gradient learning for instilling complex function in spiking neural networks,” <i>Neural Computation</i>, vol. 33, no. 4. MIT Press, pp. 899–925, 2021.","ama":"Zenke F, Vogels TP. The remarkable robustness of surrogate gradient learning for instilling complex function in spiking neural networks. <i>Neural Computation</i>. 2021;33(4):899-925. doi:<a href=\"https://doi.org/10.1162/neco_a_01367\">10.1162/neco_a_01367</a>","ista":"Zenke F, Vogels TP. 2021. The remarkable robustness of surrogate gradient learning for instilling complex function in spiking neural networks. Neural Computation. 33(4), 899–925.","apa":"Zenke, F., &#38; Vogels, T. P. (2021). The remarkable robustness of surrogate gradient learning for instilling complex function in spiking neural networks. <i>Neural Computation</i>. MIT Press. <a href=\"https://doi.org/10.1162/neco_a_01367\">https://doi.org/10.1162/neco_a_01367</a>","short":"F. Zenke, T.P. Vogels, Neural Computation 33 (2021) 899–925.","mla":"Zenke, Friedemann, and Tim P. Vogels. “The Remarkable Robustness of Surrogate Gradient Learning for Instilling Complex Function in Spiking Neural Networks.” <i>Neural Computation</i>, vol. 33, no. 4, MIT Press, 2021, pp. 899–925, doi:<a href=\"https://doi.org/10.1162/neco_a_01367\">10.1162/neco_a_01367</a>.","chicago":"Zenke, Friedemann, and Tim P Vogels. “The Remarkable Robustness of Surrogate Gradient Learning for Instilling Complex Function in Spiking Neural Networks.” <i>Neural Computation</i>. MIT Press, 2021. <a href=\"https://doi.org/10.1162/neco_a_01367\">https://doi.org/10.1162/neco_a_01367</a>."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Published Version","article_processing_charge":"No","date_updated":"2025-04-14T09:44:14Z","fulldoi":"https://doi.org/10.1162/neco_a_01367","external_id":{"pmid":["33513328"],"isi":["000663433900003"]},"publication_status":"published","department":[{"_id":"TiVo"}],"page":"899-925","ddc":["000","570"],"_id":"8253","publication":"Neural Computation","scopus_import":"1","intvolume":"        33","date_created":"2020-08-12T12:08:24Z","oa":1,"has_accepted_license":"1","article_type":"original","project":[{"call_identifier":"H2020","name":"Learning the shape of synaptic plasticity rules for neuronal architectures and function through machine learning.","_id":"0aacfa84-070f-11eb-9043-d7eb2c709234","grant_number":"819603"},{"name":"What’s in a memory? Spatiotemporal dynamics in strongly coupled recurrent neuronal networks.","grant_number":"214316/Z/18/Z","_id":"c084a126-5a5b-11eb-8a69-d75314a70a87"}],"isi":1,"publisher":"MIT Press","date_published":"2021-03-01T00:00:00Z","corr_author":"1","file":[{"relation":"main_file","file_id":"11131","file_size":1611614,"success":1,"access_level":"open_access","checksum":"eac5a51c24c8989ae7cf9ae32ec3bc95","content_type":"application/pdf","file_name":"2021_NeuralComputation_Zenke.pdf","creator":"dernst","date_created":"2022-04-08T06:05:39Z","date_updated":"2022-04-08T06:05:39Z"}],"language":[{"iso":"eng"}],"title":"The remarkable robustness of surrogate gradient learning for instilling complex function in spiking neural networks","author":[{"last_name":"Zenke","first_name":"Friedemann","orcid":"0000-0003-1883-644X","full_name":"Zenke, Friedemann"},{"last_name":"Vogels","first_name":"Tim P","id":"CB6FF8D2-008F-11EA-8E08-2637E6697425","full_name":"Vogels, Tim P","orcid":"0000-0003-3295-6181"}],"pmid":1,"quality_controlled":"1","volume":33},{"isi":1,"publisher":"Springer Nature","article_type":"original","project":[{"name":"Alpha Shape Theory Extended","call_identifier":"H2020","grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425"}],"oa":1,"date_created":"2020-09-06T22:01:13Z","scopus_import":"1","intvolume":"        66","publication":"Discrete and Computational Geometry","_id":"8338","page":"938-976","volume":66,"quality_controlled":"1","title":"On mutually diagonal nets on (confocal) quadrics and 3-dimensional webs","author":[{"last_name":"Akopyan","first_name":"Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","full_name":"Akopyan, Arseniy","orcid":"0000-0002-2548-617X"},{"full_name":"Bobenko, Alexander I.","last_name":"Bobenko","first_name":"Alexander I."},{"first_name":"Wolfgang K.","last_name":"Schief","full_name":"Schief, Wolfgang K."},{"first_name":"Jan","last_name":"Techter","full_name":"Techter, Jan"}],"arxiv":1,"language":[{"iso":"eng"}],"date_published":"2021-10-01T00:00:00Z","citation":{"ieee":"A. Akopyan, A. I. Bobenko, W. K. Schief, and J. Techter, “On mutually diagonal nets on (confocal) quadrics and 3-dimensional webs,” <i>Discrete and Computational Geometry</i>, vol. 66. Springer Nature, pp. 938–976, 2021.","ista":"Akopyan A, Bobenko AI, Schief WK, Techter J. 2021. On mutually diagonal nets on (confocal) quadrics and 3-dimensional webs. Discrete and Computational Geometry. 66, 938–976.","ama":"Akopyan A, Bobenko AI, Schief WK, Techter J. On mutually diagonal nets on (confocal) quadrics and 3-dimensional webs. <i>Discrete and Computational Geometry</i>. 2021;66:938-976. doi:<a href=\"https://doi.org/10.1007/s00454-020-00240-w\">10.1007/s00454-020-00240-w</a>","apa":"Akopyan, A., Bobenko, A. I., Schief, W. K., &#38; Techter, J. (2021). On mutually diagonal nets on (confocal) quadrics and 3-dimensional webs. <i>Discrete and Computational Geometry</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00454-020-00240-w\">https://doi.org/10.1007/s00454-020-00240-w</a>","short":"A. Akopyan, A.I. Bobenko, W.K. Schief, J. Techter, Discrete and Computational Geometry 66 (2021) 938–976.","chicago":"Akopyan, Arseniy, Alexander I. Bobenko, Wolfgang K. Schief, and Jan Techter. “On Mutually Diagonal Nets on (Confocal) Quadrics and 3-Dimensional Webs.” <i>Discrete and Computational Geometry</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/s00454-020-00240-w\">https://doi.org/10.1007/s00454-020-00240-w</a>.","mla":"Akopyan, Arseniy, et al. “On Mutually Diagonal Nets on (Confocal) Quadrics and 3-Dimensional Webs.” <i>Discrete and Computational Geometry</i>, vol. 66, Springer Nature, 2021, pp. 938–76, doi:<a href=\"https://doi.org/10.1007/s00454-020-00240-w\">10.1007/s00454-020-00240-w</a>."},"month":"10","main_file_link":[{"url":"https://arxiv.org/abs/1908.00856","open_access":"1"}],"ec_funded":1,"type":"journal_article","day":"01","abstract":[{"lang":"eng","text":"Canonical parametrisations of classical confocal coordinate systems are introduced and exploited to construct non-planar analogues of incircular (IC) nets on individual quadrics and systems of confocal quadrics. Intimate connections with classical deformations of quadrics that are isometric along asymptotic lines and circular cross-sections of quadrics are revealed. The existence of octahedral webs of surfaces of Blaschke type generated by asymptotic and characteristic lines that are diagonally related to lines of curvature is proved theoretically and established constructively. Appropriate samplings (grids) of these webs lead to three-dimensional extensions of non-planar IC nets. Three-dimensional octahedral grids composed of planes and spatially extending (checkerboard) IC-nets are shown to arise in connection with systems of confocal quadrics in Minkowski space. In this context, the Laguerre geometric notion of conical octahedral grids of planes is introduced. The latter generalise the octahedral grids derived from systems of confocal quadrics in Minkowski space. An explicit construction of conical octahedral grids is presented. The results are accompanied by various illustrations which are based on the explicit formulae provided by the theory."}],"doi":"10.1007/s00454-020-00240-w","publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]},"year":"2021","acknowledgement":"This research was supported by the DFG Collaborative Research Center TRR 109 “Discretization in Geometry and Dynamics”. W.K.S. was also supported by the Australian Research Council (DP1401000851). A.V.A. was also supported by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant Agreement No. 78818 Alpha).","status":"public","department":[{"_id":"HeEd"}],"publication_status":"published","external_id":{"isi":["000564488500002"],"arxiv":["1908.00856"]},"fulldoi":"https://doi.org/10.1007/s00454-020-00240-w","date_updated":"2025-04-14T07:48:36Z","article_processing_charge":"No","oa_version":"Preprint","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},{"title":"A divergence center interpretation of general symmetric Kubo-Ando means, and related weighted multivariate operator means","author":[{"first_name":"József","last_name":"Pitrik","full_name":"Pitrik, József"},{"id":"48DB45DA-F248-11E8-B48F-1D18A9856A87","first_name":"Daniel","last_name":"Virosztek","orcid":"0000-0003-1109-5511","full_name":"Virosztek, Daniel"}],"quality_controlled":"1","volume":609,"date_published":"2021-01-15T00:00:00Z","language":[{"iso":"eng"}],"arxiv":1,"publisher":"Elsevier","isi":1,"publication":"Linear Algebra and its Applications","intvolume":"       609","scopus_import":"1","page":"203-217","_id":"8373","project":[{"name":"Geometric study of Wasserstein spaces and free probability","call_identifier":"H2020","grant_number":"846294","_id":"26A455A6-B435-11E9-9278-68D0E5697425"},{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"article_type":"original","date_created":"2020-09-11T08:35:50Z","oa":1,"external_id":{"arxiv":["2002.11678"],"isi":["000581730500011"]},"fulldoi":"https://doi.org/10.1016/j.laa.2020.09.007","department":[{"_id":"LaEr"}],"publication_status":"published","article_processing_charge":"No","oa_version":"Preprint","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_updated":"2025-04-14T07:50:40Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2002.11678"}],"ec_funded":1,"keyword":["Kubo-Ando mean","weighted multivariate mean","barycenter"],"type":"journal_article","day":"15","citation":{"ama":"Pitrik J, Virosztek D. A divergence center interpretation of general symmetric Kubo-Ando means, and related weighted multivariate operator means. <i>Linear Algebra and its Applications</i>. 2021;609:203-217. doi:<a href=\"https://doi.org/10.1016/j.laa.2020.09.007\">10.1016/j.laa.2020.09.007</a>","ieee":"J. Pitrik and D. Virosztek, “A divergence center interpretation of general symmetric Kubo-Ando means, and related weighted multivariate operator means,” <i>Linear Algebra and its Applications</i>, vol. 609. Elsevier, pp. 203–217, 2021.","ista":"Pitrik J, Virosztek D. 2021. A divergence center interpretation of general symmetric Kubo-Ando means, and related weighted multivariate operator means. Linear Algebra and its Applications. 609, 203–217.","apa":"Pitrik, J., &#38; Virosztek, D. (2021). A divergence center interpretation of general symmetric Kubo-Ando means, and related weighted multivariate operator means. <i>Linear Algebra and Its Applications</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.laa.2020.09.007\">https://doi.org/10.1016/j.laa.2020.09.007</a>","short":"J. Pitrik, D. Virosztek, Linear Algebra and Its Applications 609 (2021) 203–217.","chicago":"Pitrik, József, and Daniel Virosztek. “A Divergence Center Interpretation of General Symmetric Kubo-Ando Means, and Related Weighted Multivariate Operator Means.” <i>Linear Algebra and Its Applications</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.laa.2020.09.007\">https://doi.org/10.1016/j.laa.2020.09.007</a>.","mla":"Pitrik, József, and Daniel Virosztek. “A Divergence Center Interpretation of General Symmetric Kubo-Ando Means, and Related Weighted Multivariate Operator Means.” <i>Linear Algebra and Its Applications</i>, vol. 609, Elsevier, 2021, pp. 203–17, doi:<a href=\"https://doi.org/10.1016/j.laa.2020.09.007\">10.1016/j.laa.2020.09.007</a>."},"month":"01","doi":"10.1016/j.laa.2020.09.007","publication_identifier":{"issn":["0024-3795"]},"status":"public","acknowledgement":"The authors are grateful to Milán Mosonyi for fruitful discussions on the topic, and to the anonymous referee for his/her comments and suggestions.\r\nJ. Pitrik was supported by the Hungarian Academy of Sciences Lendület-Momentum Grant for Quantum Information Theory, No. 96 141, and by Hungarian National Research, Development and Innovation Office (NKFIH) via grants no. K119442, no. K124152, and no. KH129601. D. Virosztek was supported by the ISTFELLOW program of the Institute of Science and Technology Austria (project code IC1027FELL01), by the European Union's Horizon 2020 research and innovation program under the Marie Sklodowska-Curie Grant Agreement No. 846294, and partially supported by the Hungarian National Research, Development and Innovation Office (NKFIH) via grants no. K124152, and no. KH129601.","year":"2021","abstract":[{"lang":"eng","text":"It is well known that special Kubo-Ando operator means admit divergence center interpretations, moreover, they are also mean squared error estimators for certain metrics on positive definite operators. In this paper we give a divergence center interpretation for every symmetric Kubo-Ando mean. This characterization of the symmetric means naturally leads to a definition of weighted and multivariate versions of a large class of symmetric Kubo-Ando means. We study elementary properties of these weighted multivariate means, and note in particular that in the special case of the geometric mean we recover the weighted A#H-mean introduced by Kim, Lawson, and Lim."}]},{"pmid":1,"quality_controlled":"1","volume":12,"author":[{"full_name":"Patxot, Marion","first_name":"Marion","last_name":"Patxot"},{"last_name":"Trejo Banos","first_name":"Daniel","full_name":"Trejo Banos, Daniel"},{"full_name":"Kousathanas, Athanasios","first_name":"Athanasios","last_name":"Kousathanas"},{"full_name":"Orliac, Etienne J","last_name":"Orliac","first_name":"Etienne J"},{"full_name":"Ojavee, Sven E","last_name":"Ojavee","first_name":"Sven E"},{"last_name":"Moser","first_name":"Gerhard","full_name":"Moser, Gerhard"},{"first_name":"Julia","last_name":"Sidorenko","full_name":"Sidorenko, Julia"},{"full_name":"Kutalik, Zoltan","last_name":"Kutalik","first_name":"Zoltan"},{"first_name":"Reedik","last_name":"Magi","full_name":"Magi, Reedik"},{"full_name":"Visscher, Peter M","last_name":"Visscher","first_name":"Peter M"},{"last_name":"Ronnegard","first_name":"Lars","full_name":"Ronnegard, Lars"},{"last_name":"Robinson","first_name":"Matthew Richard","id":"E5D42276-F5DA-11E9-8E24-6303E6697425","full_name":"Robinson, Matthew Richard","orcid":"0000-0001-8982-8813"}],"title":"Probabilistic inference of the genetic architecture underlying functional enrichment of complex traits","language":[{"iso":"eng"}],"related_material":{"record":[{"status":"public","relation":"research_data","id":"13063"}]},"date_published":"2021-11-30T00:00:00Z","file":[{"date_created":"2021-12-06T07:47:11Z","date_updated":"2021-12-06T07:47:11Z","creator":"cchlebak","file_name":"2021_NatComm_Paxtot.pdf","content_type":"application/pdf","access_level":"open_access","checksum":"384681be17aff902c149a48f52d13d4f","file_size":6519771,"success":1,"file_id":"10419","relation":"main_file"}],"publisher":"Springer Nature","isi":1,"date_created":"2020-09-17T10:52:38Z","oa":1,"has_accepted_license":"1","article_type":"original","ddc":["610"],"_id":"8429","publication":"Nature Communications","scopus_import":"1","intvolume":"        12","publication_status":"published","department":[{"_id":"MaRo"}],"fulldoi":"https://doi.org/10.1038/s41467-021-27258-9","external_id":{"pmid":["34848700"],"isi":["000724450600023"]},"date_updated":"2025-06-12T06:54:52Z","article_number":"6972","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","article_processing_charge":"No","month":"11","citation":{"short":"M. Patxot, D. Trejo Banos, A. Kousathanas, E.J. Orliac, S.E. Ojavee, G. Moser, J. Sidorenko, Z. Kutalik, R. Magi, P.M. Visscher, L. Ronnegard, M.R. Robinson, Nature Communications 12 (2021).","mla":"Patxot, Marion, et al. “Probabilistic Inference of the Genetic Architecture Underlying Functional Enrichment of Complex Traits.” <i>Nature Communications</i>, vol. 12, no. 1, 6972, Springer Nature, 2021, doi:<a href=\"https://doi.org/10.1038/s41467-021-27258-9\">10.1038/s41467-021-27258-9</a>.","chicago":"Patxot, Marion, Daniel Trejo Banos, Athanasios Kousathanas, Etienne J Orliac, Sven E Ojavee, Gerhard Moser, Julia Sidorenko, et al. “Probabilistic Inference of the Genetic Architecture Underlying Functional Enrichment of Complex Traits.” <i>Nature Communications</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1038/s41467-021-27258-9\">https://doi.org/10.1038/s41467-021-27258-9</a>.","ieee":"M. Patxot <i>et al.</i>, “Probabilistic inference of the genetic architecture underlying functional enrichment of complex traits,” <i>Nature Communications</i>, vol. 12, no. 1. Springer Nature, 2021.","ista":"Patxot M, Trejo Banos D, Kousathanas A, Orliac EJ, Ojavee SE, Moser G, Sidorenko J, Kutalik Z, Magi R, Visscher PM, Ronnegard L, Robinson MR. 2021. Probabilistic inference of the genetic architecture underlying functional enrichment of complex traits. Nature Communications. 12(1), 6972.","ama":"Patxot M, Trejo Banos D, Kousathanas A, et al. Probabilistic inference of the genetic architecture underlying functional enrichment of complex traits. <i>Nature Communications</i>. 2021;12(1). doi:<a href=\"https://doi.org/10.1038/s41467-021-27258-9\">10.1038/s41467-021-27258-9</a>","apa":"Patxot, M., Trejo Banos, D., Kousathanas, A., Orliac, E. J., Ojavee, S. E., Moser, G., … Robinson, M. R. (2021). Probabilistic inference of the genetic architecture underlying functional enrichment of complex traits. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-021-27258-9\">https://doi.org/10.1038/s41467-021-27258-9</a>"},"type":"journal_article","day":"30","file_date_updated":"2021-12-06T07:47:11Z","issue":"1","abstract":[{"text":"We develop a Bayesian model (BayesRR-RC) that provides robust SNP-heritability estimation, an alternative to marker discovery, and accurate genomic prediction, taking 22 seconds per iteration to estimate 8.4 million SNP-effects and 78 SNP-heritability parameters in the UK Biobank. We find that only ≤10% of the genetic variation captured for height, body mass index, cardiovascular disease, and type 2 diabetes is attributable to proximal regulatory regions within 10kb upstream of genes, while 12-25% is attributed to coding regions, 32–44% to introns, and 22-28% to distal 10-500kb upstream regions. Up to 24% of all cis and coding regions of each chromosome are associated with each trait, with over 3,100 independent exonic and intronic regions and over 5,400 independent regulatory regions having ≥95% probability of contributing ≥0.001% to the genetic variance of these four traits. Our open-source software (GMRM) provides a scalable alternative to current approaches for biobank data.","lang":"eng"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"status":"public","acknowledgement":"This project was funded by an SNSF Eccellenza Grant to MRR (PCEGP3-181181), and by core funding from the Institute of Science and Technology Austria. We would like to thank the participants of the cohort studies, and the Ecole Polytechnique Federal Lausanne (EPFL) SCITAS for their excellent compute resources, their generosity with their time and the kindness of their support. P.M.V. acknowledges funding from the Australian National Health and Medical Research Council (1113400) and the Australian Research Council (FL180100072). L.R. acknowledges funding from the Kjell & Märta Beijer Foundation (Stockholm, Sweden). We also would like to acknowledge Simone Rubinacci, Oliver Delanau, Alexander Terenin, Eleonora Porcu, and Mike Goddard for their useful comments and suggestions.","year":"2021","publication_identifier":{"eissn":["2041-1723"]},"doi":"10.1038/s41467-021-27258-9"},{"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","oa_version":"Published Version","article_processing_charge":"No","date_updated":"2026-04-03T09:31:17Z","article_number":"2337","fulldoi":"https://doi.org/10.1038/s41467-021-22538-w","external_id":{"pmid":["33879782"],"isi":["000642509600006"]},"publication_status":"published","department":[{"_id":"MaRo"}],"status":"public","acknowledgement":"This project was funded by an SNSF Eccellenza Grant to MRR (PCEGP3-181181), and by core funding from the Institute of Science and Technology Austria and the University of Lausanne; the work of KF was supported by the grant PUT1665 by the Estonian Research Council. We would like to thank Mike Goddard for comments which greatly improved the work, the participants of the cohort studies, and the Ecole Polytechnique Federal Lausanne (EPFL) SCITAS for their excellent compute resources, their generosity with their time and the kindness of their support.","year":"2021","doi":"10.1038/s41467-021-22538-w","publication_identifier":{"eissn":["2041-1723"]},"issue":"1","abstract":[{"lang":"eng","text":"While recent advancements in computation and modelling have improved the analysis of complex traits, our understanding of the genetic basis of the time at symptom onset remains limited. Here, we develop a Bayesian approach (BayesW) that provides probabilistic inference of the genetic architecture of age-at-onset phenotypes in a sampling scheme that facilitates biobank-scale time-to-event analyses. We show in extensive simulation work the benefits BayesW provides in terms of number of discoveries, model performance and genomic prediction. In the UK Biobank, we find many thousands of common genomic regions underlying the age-at-onset of high blood pressure (HBP), cardiac disease (CAD), and type-2 diabetes (T2D), and for the genetic basis of onset reflecting the underlying genetic liability to disease. Age-at-menopause and age-at-menarche are also highly polygenic, but with higher variance contributed by low frequency variants. Genomic prediction into the Estonian Biobank data shows that BayesW gives higher prediction accuracy than other approaches."}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"type":"journal_article","day":"20","file_date_updated":"2021-05-04T15:07:50Z","month":"04","citation":{"ama":"Ojavee SE, Kousathanas A, Trejo Banos D, et al. Genomic architecture and prediction of censored time-to-event phenotypes with a Bayesian genome-wide analysis. <i>Nature Communications</i>. 2021;12(1). doi:<a href=\"https://doi.org/10.1038/s41467-021-22538-w\">10.1038/s41467-021-22538-w</a>","apa":"Ojavee, S. E., Kousathanas, A., Trejo Banos, D., Orliac, E. J., Patxot, M., Lall, K., … Robinson, M. R. (2021). Genomic architecture and prediction of censored time-to-event phenotypes with a Bayesian genome-wide analysis. <i>Nature Communications</i>. Nature Research. <a href=\"https://doi.org/10.1038/s41467-021-22538-w\">https://doi.org/10.1038/s41467-021-22538-w</a>","ieee":"S. E. Ojavee <i>et al.</i>, “Genomic architecture and prediction of censored time-to-event phenotypes with a Bayesian genome-wide analysis,” <i>Nature Communications</i>, vol. 12, no. 1. Nature Research, 2021.","ista":"Ojavee SE, Kousathanas A, Trejo Banos D, Orliac EJ, Patxot M, Lall K, Magi R, Fischer K, Kutalik Z, Robinson MR. 2021. Genomic architecture and prediction of censored time-to-event phenotypes with a Bayesian genome-wide analysis. Nature Communications. 12(1), 2337.","short":"S.E. Ojavee, A. Kousathanas, D. Trejo Banos, E.J. Orliac, M. Patxot, K. Lall, R. Magi, K. Fischer, Z. Kutalik, M.R. Robinson, Nature Communications 12 (2021).","mla":"Ojavee, Sven E., et al. “Genomic Architecture and Prediction of Censored Time-to-Event Phenotypes with a Bayesian Genome-Wide Analysis.” <i>Nature Communications</i>, vol. 12, no. 1, 2337, Nature Research, 2021, doi:<a href=\"https://doi.org/10.1038/s41467-021-22538-w\">10.1038/s41467-021-22538-w</a>.","chicago":"Ojavee, Sven E, Athanasios Kousathanas, Daniel Trejo Banos, Etienne J Orliac, Marion Patxot, Kristi Lall, Reedik Magi, Krista Fischer, Zoltan Kutalik, and Matthew Richard Robinson. “Genomic Architecture and Prediction of Censored Time-to-Event Phenotypes with a Bayesian Genome-Wide Analysis.” <i>Nature Communications</i>. Nature Research, 2021. <a href=\"https://doi.org/10.1038/s41467-021-22538-w\">https://doi.org/10.1038/s41467-021-22538-w</a>."},"related_material":{"link":[{"relation":"press_release","description":"News on IST Homepage","url":"https://ist.ac.at/en/news/predicting-the-onset-of-diseases/"}]},"date_published":"2021-04-20T00:00:00Z","file":[{"access_level":"open_access","checksum":"eca8b9ae713835c5b785211dd08d8a2e","success":1,"file_size":6474239,"relation":"main_file","file_id":"9372","date_created":"2021-05-04T15:07:50Z","date_updated":"2021-05-04T15:07:50Z","creator":"kschuh","file_name":"2021_nature_communications_Ojavee.pdf","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"author":[{"full_name":"Ojavee, Sven E","last_name":"Ojavee","first_name":"Sven E"},{"full_name":"Kousathanas, Athanasios","last_name":"Kousathanas","first_name":"Athanasios"},{"full_name":"Trejo Banos, Daniel","first_name":"Daniel","last_name":"Trejo Banos"},{"first_name":"Etienne J","last_name":"Orliac","full_name":"Orliac, Etienne J"},{"full_name":"Patxot, Marion","first_name":"Marion","last_name":"Patxot"},{"last_name":"Lall","first_name":"Kristi","full_name":"Lall, Kristi"},{"first_name":"Reedik","last_name":"Magi","full_name":"Magi, Reedik"},{"full_name":"Fischer, Krista","last_name":"Fischer","first_name":"Krista"},{"full_name":"Kutalik, Zoltan","last_name":"Kutalik","first_name":"Zoltan"},{"full_name":"Robinson, Matthew Richard","orcid":"0000-0001-8982-8813","first_name":"Matthew Richard","last_name":"Robinson","id":"E5D42276-F5DA-11E9-8E24-6303E6697425"}],"title":"Genomic architecture and prediction of censored time-to-event phenotypes with a Bayesian genome-wide analysis","pmid":1,"quality_controlled":"1","volume":12,"ddc":["570"],"_id":"8430","publication":"Nature Communications","intvolume":"        12","scopus_import":"1","date_created":"2020-09-17T10:53:00Z","oa":1,"has_accepted_license":"1","project":[{"grant_number":"PCEGP3_181181","_id":"9B8D11D6-BA93-11EA-9121-9846C619BF3A","name":"Improving estimation and prediction of common complex disease risk"}],"publisher":"Nature Research","isi":1}]