[{"scopus_import":"1","external_id":{"pmid":["36443277"],"isi":["000892168800001"]},"intvolume":"        32","OA_type":"free access","pmid":1,"oa_version":"Published Version","volume":32,"date_created":"2023-01-12T12:10:28Z","article_type":"editorial","abstract":[{"text":"Kerstin Johannesson is a marine ecologist and evolutionary biologist based at the Tjärnö Marine Laboratory of the University of Gothenburg, which is situated in the beautiful Kosterhavet National Park on the Swedish west coast. Her work, using marine periwinkles (especially Littorina saxatilis and L. fabalis) as main model systems, has made a remarkable contribution to marine evolutionary biology and our understanding of local adaptation and its genetic underpinnings.","lang":"eng"}],"publication_status":"published","status":"public","doi":"10.1111/mec.16779","department":[{"_id":"NiBa"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","issue":"1","keyword":["Genetics","Ecology","Evolution","Behavior and Systematics"],"oa":1,"main_file_link":[{"url":"https://doi.org/10.1111/mec.16779","open_access":"1"}],"publication":"Molecular Ecology","ddc":["570"],"article_processing_charge":"No","publication_identifier":{"issn":["0962-1083"],"eissn":["1365-294X"]},"quality_controlled":"1","isi":1,"title":"Professor Kerstin Johannesson–winner of the 2022 Molecular Ecology Prize","author":[{"id":"3C147470-F248-11E8-B48F-1D18A9856A87","first_name":"Anja M","last_name":"Westram","full_name":"Westram, Anja M","orcid":"0000-0003-1050-4969"},{"last_name":"Butlin","first_name":"Roger","full_name":"Butlin, Roger"}],"date_published":"2023-01-01T00:00:00Z","type":"journal_article","publisher":"Wiley","corr_author":"1","language":[{"iso":"eng"}],"month":"01","_id":"12166","citation":{"ista":"Westram AM, Butlin R. 2023. Professor Kerstin Johannesson–winner of the 2022 Molecular Ecology Prize. Molecular Ecology. 32(1), 26–29.","apa":"Westram, A. M., &#38; Butlin, R. (2023). Professor Kerstin Johannesson–winner of the 2022 Molecular Ecology Prize. <i>Molecular Ecology</i>. Wiley. <a href=\"https://doi.org/10.1111/mec.16779\">https://doi.org/10.1111/mec.16779</a>","short":"A.M. Westram, R. Butlin, Molecular Ecology 32 (2023) 26–29.","ieee":"A. M. Westram and R. Butlin, “Professor Kerstin Johannesson–winner of the 2022 Molecular Ecology Prize,” <i>Molecular Ecology</i>, vol. 32, no. 1. Wiley, pp. 26–29, 2023.","mla":"Westram, Anja M., and Roger Butlin. “Professor Kerstin Johannesson–Winner of the 2022 Molecular Ecology Prize.” <i>Molecular Ecology</i>, vol. 32, no. 1, Wiley, 2023, pp. 26–29, doi:<a href=\"https://doi.org/10.1111/mec.16779\">10.1111/mec.16779</a>.","ama":"Westram AM, Butlin R. Professor Kerstin Johannesson–winner of the 2022 Molecular Ecology Prize. <i>Molecular Ecology</i>. 2023;32(1):26-29. doi:<a href=\"https://doi.org/10.1111/mec.16779\">10.1111/mec.16779</a>","chicago":"Westram, Anja M, and Roger Butlin. “Professor Kerstin Johannesson–Winner of the 2022 Molecular Ecology Prize.” <i>Molecular Ecology</i>. Wiley, 2023. <a href=\"https://doi.org/10.1111/mec.16779\">https://doi.org/10.1111/mec.16779</a>."},"date_updated":"2026-06-18T17:24:18Z","page":"26-29","year":"2023"},{"day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"SiHi"}],"doi":"10.1016/j.neuron.2023.01.006","status":"public","publication_status":"published","main_file_link":[{"url":"https://doi.org/10.1016/j.neuron.2023.01.006","open_access":"1"}],"oa":1,"issue":"3","intvolume":"       111","external_id":{"isi":["000994473300001"],"pmid":["36731425"]},"scopus_import":"1","abstract":[{"text":"In this issue of Neuron, Espinosa-Medina et al.1 present the TEMPO (Temporal Encoding and Manipulation in a Predefined Order) system, which enables the marking and genetic manipulation of sequentially generated cell lineages in vertebrate species in vivo.","lang":"eng"}],"article_type":"letter_note","date_created":"2023-02-12T23:00:58Z","volume":111,"oa_version":"Published Version","pmid":1,"OA_type":"free access","_id":"12542","page":"291-293","date_updated":"2026-06-18T17:27:44Z","citation":{"chicago":"Villalba Requena, Ana, and Simon Hippenmeyer. “Going Back in Time with TEMPO.” <i>Neuron</i>. Elsevier, 2023. <a href=\"https://doi.org/10.1016/j.neuron.2023.01.006\">https://doi.org/10.1016/j.neuron.2023.01.006</a>.","ista":"Villalba Requena A, Hippenmeyer S. 2023. Going back in time with TEMPO. Neuron. 111(3), 291–293.","apa":"Villalba Requena, A., &#38; Hippenmeyer, S. (2023). Going back in time with TEMPO. <i>Neuron</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.neuron.2023.01.006\">https://doi.org/10.1016/j.neuron.2023.01.006</a>","short":"A. Villalba Requena, S. Hippenmeyer, Neuron 111 (2023) 291–293.","ieee":"A. Villalba Requena and S. Hippenmeyer, “Going back in time with TEMPO,” <i>Neuron</i>, vol. 111, no. 3. Elsevier, pp. 291–293, 2023.","ama":"Villalba Requena A, Hippenmeyer S. Going back in time with TEMPO. <i>Neuron</i>. 2023;111(3):291-293. doi:<a href=\"https://doi.org/10.1016/j.neuron.2023.01.006\">10.1016/j.neuron.2023.01.006</a>","mla":"Villalba Requena, Ana, and Simon Hippenmeyer. “Going Back in Time with TEMPO.” <i>Neuron</i>, vol. 111, no. 3, Elsevier, 2023, pp. 291–93, doi:<a href=\"https://doi.org/10.1016/j.neuron.2023.01.006\">10.1016/j.neuron.2023.01.006</a>."},"month":"02","language":[{"iso":"eng"}],"publisher":"Elsevier","corr_author":"1","year":"2023","OA_place":"publisher","quality_controlled":"1","publication_identifier":{"eissn":["1097-4199"]},"article_processing_charge":"No","ddc":["570"],"publication":"Neuron","type":"journal_article","date_published":"2023-02-01T00:00:00Z","author":[{"orcid":"0000-0002-5615-5277","first_name":"Ana","id":"68cb85a0-39f7-11eb-9559-9aaab4f6a247","last_name":"Villalba Requena","full_name":"Villalba Requena, Ana"},{"last_name":"Hippenmeyer","id":"37B36620-F248-11E8-B48F-1D18A9856A87","first_name":"Simon","full_name":"Hippenmeyer, Simon","orcid":"0000-0003-2279-1061"}],"title":"Going back in time with TEMPO","isi":1},{"oa":1,"main_file_link":[{"url":"https://doi.org/10.1111/tpj.16218","open_access":"1"}],"issue":"1","day":"01","doi":"10.1111/tpj.16218","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"JiFr"}],"status":"public","publication_status":"published","abstract":[{"lang":"eng","text":"Salicylic acid (SA) plays important roles in different aspects of plant development, including root growth, where auxin is also a major player by means of its asymmetric distribution. However, the mechanism underlying the effect of SA on the development of rice roots remains poorly understood. Here, we show that SA inhibits rice root growth by interfering with auxin transport associated with the OsPIN3t- and clathrin-mediated gene regulatory network (GRN). SA inhibits root growth as well as Brefeldin A-sensitive trafficking through a non-canonical SA signaling mechanism. Transcriptome analysis of rice seedlings treated with SA revealed that the OsPIN3t auxin transporter is at the center of a GRN involving the coat protein clathrin. The root growth and endocytic trafficking in both the pin3t and clathrin heavy chain mutants were SA insensitivity. SA inhibitory effect on the endocytosis of OsPIN3t was dependent on clathrin; however, the root growth and endocytic trafficking mediated by tyrphostin A23 (TyrA23) were independent of the pin3t mutant under SA treatment. These data reveal that SA affects rice root growth through the convergence of transcriptional and non-SA signaling mechanisms involving OsPIN3t-mediated auxin transport and clathrin-mediated trafficking as key components."}],"volume":115,"date_created":"2023-04-30T22:01:06Z","article_type":"original","pmid":1,"oa_version":"Published Version","OA_type":"free access","intvolume":"       115","external_id":{"pmid":["37025008 "],"isi":["000971861400001"]},"scopus_import":"1","year":"2023","acknowledgement":"The authors thank Professor Jianqiang Wu (Kunming Institute of Botany, Chinese Academy of Sciences) for support with phytohormone measurement. Thanks also go to Professor Pieter. B. F. Ouwerkerk (Leiden University) and Professor Jean-Benoit Morel (Plant Health Institute of Montpellier) for provision of the rice lines NB-7B-70 and NB-7B-76 and wild-type NB-61-WT, Professor Zuhua He (Chinese Academy of Sciences) for provision of the rice OsNPR1-RNAi mutant, and Professor Yinong Yang (The Pennsylvania State University) for provision of the rice line NahG. This work was supported by grants from the National Natural Science Foundation of China (Grant Nos. 32260085, 31460453, 31660501, 31860064, 31970609, 31801792 and 31960554), the Key Projects of the Applied Basic Research Plan of Yunnan Province (202301AS070082), the Major Special Program for Scientific Research, Education Department of Yunnan Province (Grant No. ZD2015005), the Start-up fund from Xishuangbanna Tropical Botanical Garden, and ‘Top Talents Program in Science and Technology’ from Yunnan Province, the SRF for ROCS, SEM (Grant No. [2013] 1792), and the Major Science and Technology Project in Yunnan Province (202102AE090042 and 202202AE090036); and the young and middle-aged academic and technical leaders reserve talent program in Yunnan Province (202205AC160076).","OA_place":"publisher","month":"07","_id":"12878","citation":{"chicago":"Jiang, Lihui, Baolin Yao, Xiaoyan Zhang, Lixia Wu, Qijing Fu, Yiting Zhao, Yuxin Cao, et al. “Salicylic Acid Inhibits Rice Endocytic Protein Trafficking Mediated by OsPIN3t and Clathrin to Affect Root Growth.” <i>Plant Journal</i>. Wiley, 2023. <a href=\"https://doi.org/10.1111/tpj.16218\">https://doi.org/10.1111/tpj.16218</a>.","short":"L. Jiang, B. Yao, X. Zhang, L. Wu, Q. Fu, Y. Zhao, Y. Cao, R. Zhu, X. Lu, W. Huang, J. Zhao, K. Li, S. Zhao, L. Han, X. Zhou, C. Luo, H. Zhu, J. Yang, H. Huang, Z. Zhu, X. He, J. Friml, Z. Zhang, C. Liu, Y. Du, Plant Journal 115 (2023) 155–174.","apa":"Jiang, L., Yao, B., Zhang, X., Wu, L., Fu, Q., Zhao, Y., … Du, Y. (2023). Salicylic acid inhibits rice endocytic protein trafficking mediated by OsPIN3t and clathrin to affect root growth. <i>Plant Journal</i>. Wiley. <a href=\"https://doi.org/10.1111/tpj.16218\">https://doi.org/10.1111/tpj.16218</a>","ista":"Jiang L, Yao B, Zhang X, Wu L, Fu Q, Zhao Y, Cao Y, Zhu R, Lu X, Huang W, Zhao J, Li K, Zhao S, Han L, Zhou X, Luo C, Zhu H, Yang J, Huang H, Zhu Z, He X, Friml J, Zhang Z, Liu C, Du Y. 2023. Salicylic acid inhibits rice endocytic protein trafficking mediated by OsPIN3t and clathrin to affect root growth. Plant Journal. 115(1), 155–174.","ama":"Jiang L, Yao B, Zhang X, et al. Salicylic acid inhibits rice endocytic protein trafficking mediated by OsPIN3t and clathrin to affect root growth. <i>Plant Journal</i>. 2023;115(1):155-174. doi:<a href=\"https://doi.org/10.1111/tpj.16218\">10.1111/tpj.16218</a>","mla":"Jiang, Lihui, et al. “Salicylic Acid Inhibits Rice Endocytic Protein Trafficking Mediated by OsPIN3t and Clathrin to Affect Root Growth.” <i>Plant Journal</i>, vol. 115, no. 1, Wiley, 2023, pp. 155–74, doi:<a href=\"https://doi.org/10.1111/tpj.16218\">10.1111/tpj.16218</a>.","ieee":"L. Jiang <i>et al.</i>, “Salicylic acid inhibits rice endocytic protein trafficking mediated by OsPIN3t and clathrin to affect root growth,” <i>Plant Journal</i>, vol. 115, no. 1. Wiley, pp. 155–174, 2023."},"date_updated":"2026-06-18T17:29:30Z","page":"155-174","publisher":"Wiley","language":[{"iso":"eng"}],"type":"journal_article","date_published":"2023-07-01T00:00:00Z","title":"Salicylic acid inhibits rice endocytic protein trafficking mediated by OsPIN3t and clathrin to affect root growth","author":[{"last_name":"Jiang","first_name":"Lihui","full_name":"Jiang, Lihui"},{"first_name":"Baolin","last_name":"Yao","full_name":"Yao, Baolin"},{"full_name":"Zhang, Xiaoyan","first_name":"Xiaoyan","last_name":"Zhang"},{"first_name":"Lixia","last_name":"Wu","full_name":"Wu, Lixia"},{"last_name":"Fu","first_name":"Qijing","full_name":"Fu, Qijing"},{"last_name":"Zhao","first_name":"Yiting","full_name":"Zhao, Yiting"},{"full_name":"Cao, Yuxin","first_name":"Yuxin","last_name":"Cao"},{"last_name":"Zhu","first_name":"Ruomeng","full_name":"Zhu, Ruomeng"},{"full_name":"Lu, Xinqi","first_name":"Xinqi","last_name":"Lu"},{"full_name":"Huang, Wuying","last_name":"Huang","first_name":"Wuying"},{"full_name":"Zhao, Jianping","first_name":"Jianping","last_name":"Zhao"},{"full_name":"Li, Kuixiu","last_name":"Li","first_name":"Kuixiu"},{"full_name":"Zhao, Shuanglu","first_name":"Shuanglu","last_name":"Zhao"},{"last_name":"Han","first_name":"Li","full_name":"Han, Li"},{"full_name":"Zhou, Xuan","first_name":"Xuan","last_name":"Zhou"},{"full_name":"Luo, Chongyu","first_name":"Chongyu","last_name":"Luo"},{"last_name":"Zhu","first_name":"Haiyan","full_name":"Zhu, Haiyan"},{"full_name":"Yang, Jing","first_name":"Jing","last_name":"Yang"},{"first_name":"Huichuan","last_name":"Huang","full_name":"Huang, Huichuan"},{"full_name":"Zhu, Zhengge","first_name":"Zhengge","last_name":"Zhu"},{"full_name":"He, Xiahong","first_name":"Xiahong","last_name":"He"},{"full_name":"Friml, Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jiří","last_name":"Friml","orcid":"0000-0002-8302-7596"},{"last_name":"Zhang","first_name":"Zhongkai","full_name":"Zhang, Zhongkai"},{"full_name":"Liu, Changning","first_name":"Changning","last_name":"Liu"},{"first_name":"Yunlong","last_name":"Du","full_name":"Du, Yunlong"}],"isi":1,"publication_identifier":{"issn":["0960-7412"],"eissn":["1365-313X"]},"quality_controlled":"1","article_processing_charge":"No","ddc":["580"],"publication":"Plant Journal"},{"ec_funded":1,"author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"orcid":"0000-0002-1712-2165","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","first_name":"Tobias","last_name":"Meggendorfer","full_name":"Meggendorfer, Tobias"},{"last_name":"Saona Urmeneta","first_name":"Raimundo J","id":"BD1DF4C4-D767-11E9-B658-BC13E6697425","full_name":"Saona Urmeneta, Raimundo J","orcid":"0000-0001-5103-038X"},{"full_name":"Svoboda, Jakub","first_name":"Jakub","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","last_name":"Svoboda","orcid":"0000-0002-1419-3267"}],"title":"Faster algorithm for turn-based stochastic games with bounded treewidth","date_published":"2023-02-01T00:00:00Z","type":"conference","publication":"Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms","ddc":["000"],"article_processing_charge":"No","quality_controlled":"1","publication_identifier":{"isbn":["9781611977554"]},"acknowledgement":"This research was partially supported by the ERC CoG 863818 (ForM-SMArt) grant.","year":"2023","conference":{"end_date":"2023-01-25","start_date":"2023-01-22","location":"Florence, Italy","name":"SODA: Symposium on Discrete Algorithms"},"language":[{"iso":"eng"}],"corr_author":"1","publisher":"Society for Industrial and Applied Mathematics","_id":"12676","page":"4590-4605","date_updated":"2026-06-18T17:28:38Z","citation":{"ieee":"K. Chatterjee, T. Meggendorfer, R. J. Saona Urmeneta, and J. Svoboda, “Faster algorithm for turn-based stochastic games with bounded treewidth,” in <i>Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Florence, Italy, 2023, pp. 4590–4605.","mla":"Chatterjee, Krishnendu, et al. “Faster Algorithm for Turn-Based Stochastic Games with Bounded Treewidth.” <i>Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Society for Industrial and Applied Mathematics, 2023, pp. 4590–605, doi:<a href=\"https://doi.org/10.1137/1.9781611977554.ch173\">10.1137/1.9781611977554.ch173</a>.","ama":"Chatterjee K, Meggendorfer T, Saona Urmeneta RJ, Svoboda J. Faster algorithm for turn-based stochastic games with bounded treewidth. In: <i>Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Society for Industrial and Applied Mathematics; 2023:4590-4605. doi:<a href=\"https://doi.org/10.1137/1.9781611977554.ch173\">10.1137/1.9781611977554.ch173</a>","ista":"Chatterjee K, Meggendorfer T, Saona Urmeneta RJ, Svoboda J. 2023. Faster algorithm for turn-based stochastic games with bounded treewidth. Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 4590–4605.","short":"K. Chatterjee, T. Meggendorfer, R.J. Saona Urmeneta, J. Svoboda, in:, Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2023, pp. 4590–4605.","apa":"Chatterjee, K., Meggendorfer, T., Saona Urmeneta, R. J., &#38; Svoboda, J. (2023). Faster algorithm for turn-based stochastic games with bounded treewidth. In <i>Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 4590–4605). Florence, Italy: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611977554.ch173\">https://doi.org/10.1137/1.9781611977554.ch173</a>","chicago":"Chatterjee, Krishnendu, Tobias Meggendorfer, Raimundo J Saona Urmeneta, and Jakub Svoboda. “Faster Algorithm for Turn-Based Stochastic Games with Bounded Treewidth.” In <i>Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 4590–4605. Society for Industrial and Applied Mathematics, 2023. <a href=\"https://doi.org/10.1137/1.9781611977554.ch173\">https://doi.org/10.1137/1.9781611977554.ch173</a>."},"month":"02","oa_version":"Published Version","date_created":"2023-02-24T12:20:47Z","abstract":[{"text":"Turn-based stochastic games (aka simple stochastic games) are two-player zero-sum games played on directed graphs with probabilistic transitions. The goal of player-max is to maximize the probability to reach a target state against the adversarial player-min. These games lie in NP ∩ coNP and are among the rare combinatorial problems that belong to this complexity class for which the existence of polynomial-time algorithm is a major open question. While randomized sub-exponential time algorithm exists, all known deterministic algorithms require exponential time in the worst-case. An important open question has been whether faster algorithms can be obtained parametrized by the treewidth of the game graph. Even deterministic sub-exponential time algorithm for constant treewidth turn-based stochastic games has remain elusive. In this work our main result is a deterministic algorithm to solve turn-based stochastic games that, given a game with n states, treewidth at most t, and the bit-complexity of the probabilistic transition function log D, has running time O ((tn2 log D)t log n). In particular, our algorithm is quasi-polynomial time for games with constant or poly-logarithmic treewidth.","lang":"eng"}],"oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1137/1.9781611977554.ch173"}],"publication_status":"published","status":"public","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1137/1.9781611977554.ch173","project":[{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications"}],"day":"01"},{"status":"public","publication_status":"published","day":"25","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"DaAl"},{"_id":"GradSch"}],"doi":"10.1145/3572848.3577512","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1145/3572848.3577512"}],"oa":1,"scopus_import":"1","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Although a wide variety of handcrafted concurrent data structures have been proposed, there is considerable interest in universal approaches (Universal Constructions or UCs) for building concurrent data structures. UCs (semi-)automatically convert a sequential data structure into a concurrent one. The simplest approach uses locks [3, 6] that protect a sequential data structure and allow only one process to access it at a time. However, the resulting data structure is blocking. Most work on UCs instead focuses on obtaining non-blocking progress guarantees such as obstruction-freedom, lock-freedom or wait-freedom. Many non-blocking UCs have appeared. Key examples include the seminal wait-free UC [2] by Herlihy, a NUMA-aware UC [10] by Yi et al., and an efficient UC for large objects [1] by Fatourou et al."}],"date_created":"2023-03-19T23:00:58Z","_id":"12736","page":"438-440","citation":{"chicago":"Aksenov, Vitaly, Trevor A Brown, Alexander Fedorov, and Ilya Kokorin. <i>Unexpected Scaling in Path Copying Trees</i>. <i>Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming</i>. Association for Computing Machinery, 2023. <a href=\"https://doi.org/10.1145/3572848.3577512\">https://doi.org/10.1145/3572848.3577512</a>.","mla":"Aksenov, Vitaly, et al. “Unexpected Scaling in Path Copying Trees.” <i>Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming</i>, Association for Computing Machinery, 2023, pp. 438–40, doi:<a href=\"https://doi.org/10.1145/3572848.3577512\">10.1145/3572848.3577512</a>.","ama":"Aksenov V, Brown TA, Fedorov A, Kokorin I. <i>Unexpected Scaling in Path Copying Trees</i>. Association for Computing Machinery; 2023:438-440. doi:<a href=\"https://doi.org/10.1145/3572848.3577512\">10.1145/3572848.3577512</a>","ieee":"V. Aksenov, T. A. Brown, A. Fedorov, and I. Kokorin, <i>Unexpected scaling in path copying trees</i>. Association for Computing Machinery, 2023, pp. 438–440.","short":"V. Aksenov, T.A. Brown, A. Fedorov, I. Kokorin, Unexpected Scaling in Path Copying Trees, Association for Computing Machinery, 2023.","apa":"Aksenov, V., Brown, T. A., Fedorov, A., &#38; Kokorin, I. (2023). <i>Unexpected scaling in path copying trees</i>. <i>Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming</i> (pp. 438–440). Montreal, QB, Canada: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3572848.3577512\">https://doi.org/10.1145/3572848.3577512</a>","ista":"Aksenov V, Brown TA, Fedorov A, Kokorin I. 2023. Unexpected scaling in path copying trees, Association for Computing Machinery,p."},"date_updated":"2026-06-18T17:29:03Z","month":"02","language":[{"iso":"eng"}],"publisher":"Association for Computing Machinery","acknowledgement":"This work was supported by: the Natural Sciences and Engineering Research Council of Canada (NSERC) Discovery Program grant: RGPIN-2019-04227, and the Canada Foundation for Innovation John R. Evans Leaders Fund (CFI-JELF) with equal support from the Ontario Research Fund CFI Leaders Opportunity Fund: 38512.","year":"2023","conference":{"end_date":"2023-03-01","start_date":"2023-02-25","location":"Montreal, QB, Canada","name":"PPoPP: Sympopsium on Principles and Practice of Parallel Programming"},"ddc":["000"],"publication":"Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","quality_controlled":"1","publication_identifier":{"isbn":["9798400700156"]},"article_processing_charge":"No","author":[{"full_name":"Aksenov, Vitaly","first_name":"Vitaly","last_name":"Aksenov"},{"last_name":"Brown","id":"3569F0A0-F248-11E8-B48F-1D18A9856A87","first_name":"Trevor A","full_name":"Brown, Trevor A"},{"last_name":"Fedorov","id":"2e711909-896a-11ed-bdf8-eb0f5a2984c6","first_name":"Alexander","full_name":"Fedorov, Alexander"},{"last_name":"Kokorin","first_name":"Ilya","full_name":"Kokorin, Ilya"}],"title":"Unexpected scaling in path copying trees","type":"conference_poster","date_published":"2023-02-25T00:00:00Z"},{"publication_identifier":{"eissn":["1867-3899"],"issn":["1867-3880"]},"quality_controlled":"1","article_processing_charge":"No","ddc":["540"],"publication":"ChemCatChem","type":"journal_article","date_published":"2023-09-08T00:00:00Z","title":"Special Collection: Photocatalytic synthesis","author":[{"full_name":"Næsborg, Line","first_name":"Line","last_name":"Næsborg"},{"full_name":"Pieber, Bartholomäus","last_name":"Pieber","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","first_name":"Bartholomäus","orcid":"0000-0001-8689-388X"},{"full_name":"Wenger, Oliver S.","first_name":"Oliver S.","last_name":"Wenger"}],"isi":1,"month":"09","date_updated":"2026-06-18T17:32:51Z","_id":"13972","citation":{"chicago":"Næsborg, Line, Bartholomäus Pieber, and Oliver S. Wenger. “Special Collection: Photocatalytic Synthesis.” <i>ChemCatChem</i>. Wiley, 2023. <a href=\"https://doi.org/10.1002/cctc.202300683\">https://doi.org/10.1002/cctc.202300683</a>.","ama":"Næsborg L, Pieber B, Wenger OS. Special Collection: Photocatalytic synthesis. <i>ChemCatChem</i>. 2023;15(17). doi:<a href=\"https://doi.org/10.1002/cctc.202300683\">10.1002/cctc.202300683</a>","mla":"Næsborg, Line, et al. “Special Collection: Photocatalytic Synthesis.” <i>ChemCatChem</i>, vol. 15, no. 17, e202300683, Wiley, 2023, doi:<a href=\"https://doi.org/10.1002/cctc.202300683\">10.1002/cctc.202300683</a>.","ieee":"L. Næsborg, B. Pieber, and O. S. Wenger, “Special Collection: Photocatalytic synthesis,” <i>ChemCatChem</i>, vol. 15, no. 17. Wiley, 2023.","short":"L. Næsborg, B. Pieber, O.S. Wenger, ChemCatChem 15 (2023).","apa":"Næsborg, L., Pieber, B., &#38; Wenger, O. S. (2023). Special Collection: Photocatalytic synthesis. <i>ChemCatChem</i>. Wiley. <a href=\"https://doi.org/10.1002/cctc.202300683\">https://doi.org/10.1002/cctc.202300683</a>","ista":"Næsborg L, Pieber B, Wenger OS. 2023. Special Collection: Photocatalytic synthesis. ChemCatChem. 15(17), e202300683."},"publisher":"Wiley","corr_author":"1","language":[{"iso":"eng"}],"year":"2023","intvolume":"        15","external_id":{"isi":["001037859900001"]},"scopus_import":"1","article_number":"e202300683","abstract":[{"text":"This Special Collection is dedicated to the field of photocatalytic synthesis and contains a diverse selection of original research contributions. It includes studies on catalyst development, mechanistic investigations, method development and the use of enabling technologies, illustrating the many facets of state-of-the-art research in photocatalytic synthesis. Further, emerging topics are surveyed and discussed in three reviews and a concept article.","lang":"eng"}],"volume":15,"date_created":"2023-08-06T22:01:12Z","article_type":"letter_note","oa_version":"Published Version","day":"08","doi":"10.1002/cctc.202300683","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"BaPi"}],"status":"public","publication_status":"published","oa":1,"main_file_link":[{"url":"https://doi.org/10.1002/cctc.202300683","open_access":"1"}],"issue":"17"},{"date_published":"2023-07-01T00:00:00Z","type":"journal_article","author":[{"full_name":"Madani, Amiera","last_name":"Madani","first_name":"Amiera"},{"first_name":"Eric T.","last_name":"Sletten","full_name":"Sletten, Eric T."},{"first_name":"Cristian","last_name":"Cavedon","full_name":"Cavedon, Cristian"},{"first_name":"Peter H.","last_name":"Seeberger","full_name":"Seeberger, Peter H."},{"first_name":"Bartholomäus","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","last_name":"Pieber","full_name":"Pieber, Bartholomäus","orcid":"0000-0001-8689-388X"}],"title":"Visible-light-mediated oxidative debenzylation of 3-O-Benzyl-1,2:5,6-di-O-isopropylidene-α-D-glucofuranose","article_processing_charge":"No","quality_controlled":"1","publication_identifier":{"eissn":["2333-3553"],"issn":["0078-6209"]},"publication":"Organic Syntheses","ddc":["540"],"year":"2023","language":[{"iso":"eng"}],"corr_author":"1","publisher":"Organic Syntheses","date_updated":"2026-06-18T17:32:17Z","_id":"13970","citation":{"mla":"Madani, Amiera, et al. “Visible-Light-Mediated Oxidative Debenzylation of 3-O-Benzyl-1,2:5,6-Di-O-Isopropylidene-α-D-Glucofuranose.” <i>Organic Syntheses</i>, vol. 100, Organic Syntheses, 2023, pp. 271–86, doi:<a href=\"https://doi.org/10.15227/orgsyn.100.0271\">10.15227/orgsyn.100.0271</a>.","ama":"Madani A, Sletten ET, Cavedon C, Seeberger PH, Pieber B. Visible-light-mediated oxidative debenzylation of 3-O-Benzyl-1,2:5,6-di-O-isopropylidene-α-D-glucofuranose. <i>Organic Syntheses</i>. 2023;100:271-286. doi:<a href=\"https://doi.org/10.15227/orgsyn.100.0271\">10.15227/orgsyn.100.0271</a>","ieee":"A. Madani, E. T. Sletten, C. Cavedon, P. H. Seeberger, and B. Pieber, “Visible-light-mediated oxidative debenzylation of 3-O-Benzyl-1,2:5,6-di-O-isopropylidene-α-D-glucofuranose,” <i>Organic Syntheses</i>, vol. 100. Organic Syntheses, pp. 271–286, 2023.","short":"A. Madani, E.T. Sletten, C. Cavedon, P.H. Seeberger, B. Pieber, Organic Syntheses 100 (2023) 271–286.","apa":"Madani, A., Sletten, E. T., Cavedon, C., Seeberger, P. H., &#38; Pieber, B. (2023). Visible-light-mediated oxidative debenzylation of 3-O-Benzyl-1,2:5,6-di-O-isopropylidene-α-D-glucofuranose. <i>Organic Syntheses</i>. Organic Syntheses. <a href=\"https://doi.org/10.15227/orgsyn.100.0271\">https://doi.org/10.15227/orgsyn.100.0271</a>","ista":"Madani A, Sletten ET, Cavedon C, Seeberger PH, Pieber B. 2023. Visible-light-mediated oxidative debenzylation of 3-O-Benzyl-1,2:5,6-di-O-isopropylidene-α-D-glucofuranose. Organic Syntheses. 100, 271–286.","chicago":"Madani, Amiera, Eric T. Sletten, Cristian Cavedon, Peter H. Seeberger, and Bartholomäus Pieber. “Visible-Light-Mediated Oxidative Debenzylation of 3-O-Benzyl-1,2:5,6-Di-O-Isopropylidene-α-D-Glucofuranose.” <i>Organic Syntheses</i>. Organic Syntheses, 2023. <a href=\"https://doi.org/10.15227/orgsyn.100.0271\">https://doi.org/10.15227/orgsyn.100.0271</a>."},"page":"271-286","month":"07","article_type":"original","volume":100,"date_created":"2023-08-06T22:01:11Z","oa_version":"Published Version","intvolume":"       100","scopus_import":"1","oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.15227/orgsyn.100.0271"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"BaPi"}],"doi":"10.15227/orgsyn.100.0271","day":"01","publication_status":"published","status":"public"},{"doi":"10.1093/gigascience/giad045","department":[{"_id":"FyKo"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"27","publication_status":"published","status":"public","oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1093/gigascience/giad045"}],"intvolume":"        12","scopus_import":"1","external_id":{"pmid":["37496156"],"isi":["001081086100001"]},"volume":12,"date_created":"2023-08-06T22:01:13Z","article_type":"review","related_material":{"link":[{"url":"https://doi.org/10.1093/gigascience/giad066","relation":"erratum"}]},"article_number":"giad045","abstract":[{"text":"Conflicts and natural disasters affect entire populations of the countries involved and, in addition to the thousands of lives destroyed, have a substantial negative impact on the scientific advances these countries provide. The unprovoked invasion of Ukraine by Russia, the devastating earthquake in Turkey and Syria, and the ongoing conflicts in the Middle East are just a few examples. Millions of people have been killed or displaced, their futures uncertain. These events have resulted in extensive infrastructure collapse, with loss of electricity, transportation, and access to services. Schools, universities, and research centers have been destroyed along with decades’ worth of data, samples, and findings. Scholars in disaster areas face short- and long-term problems in terms of what they can accomplish now for obtaining grants and for employment in the long run. In our interconnected world, conflicts and disasters are no longer a local problem but have wide-ranging impacts on the entire world, both now and in the future. Here, we focus on the current and ongoing impact of war on the scientific community within Ukraine and from this draw lessons that can be applied to all affected countries where scientists at risk are facing hardship. We present and classify examples of effective and feasible mechanisms used to support researchers in countries facing hardship and discuss how these can be implemented with help from the international scientific community and what more is desperately needed. Reaching out, providing accessible training opportunities, and developing collaborations should increase inclusion and connectivity, support scientific advancements within affected communities, and expedite postwar and disaster recovery.","lang":"eng"}],"pmid":1,"oa_version":"Published Version","publisher":"Oxford University Press","language":[{"iso":"eng"}],"month":"07","date_updated":"2026-06-18T17:33:34Z","_id":"13976","citation":{"ieee":"W. Wolfsberger <i>et al.</i>, “Scientists without borders: Lessons from Ukraine,” <i>GigaScience</i>, vol. 12. Oxford University Press, 2023.","mla":"Wolfsberger, Walter, et al. “Scientists without Borders: Lessons from Ukraine.” <i>GigaScience</i>, vol. 12, giad045, Oxford University Press, 2023, doi:<a href=\"https://doi.org/10.1093/gigascience/giad045\">10.1093/gigascience/giad045</a>.","ama":"Wolfsberger W, Chhugani K, Shchubelka K, et al. Scientists without borders: Lessons from Ukraine. <i>GigaScience</i>. 2023;12. doi:<a href=\"https://doi.org/10.1093/gigascience/giad045\">10.1093/gigascience/giad045</a>","ista":"Wolfsberger W, Chhugani K, Shchubelka K, Frolova A, Salyha Y, Zlenko O, Arych M, Dziuba D, Parkhomenko A, Smolanka V, Gümüş ZH, Sezgin E, Diaz-Lameiro A, Toth VR, Maci M, Bortz E, Kondrashov F, Morton PM, Łabaj PP, Romero V, Hlávka J, Mangul S, Oleksyk TK. 2023. Scientists without borders: Lessons from Ukraine. GigaScience. 12, giad045.","apa":"Wolfsberger, W., Chhugani, K., Shchubelka, K., Frolova, A., Salyha, Y., Zlenko, O., … Oleksyk, T. K. (2023). Scientists without borders: Lessons from Ukraine. <i>GigaScience</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/gigascience/giad045\">https://doi.org/10.1093/gigascience/giad045</a>","short":"W. Wolfsberger, K. Chhugani, K. Shchubelka, A. Frolova, Y. Salyha, O. Zlenko, M. Arych, D. Dziuba, A. Parkhomenko, V. Smolanka, Z.H. Gümüş, E. Sezgin, A. Diaz-Lameiro, V.R. Toth, M. Maci, E. Bortz, F. Kondrashov, P.M. Morton, P.P. Łabaj, V. Romero, J. Hlávka, S. Mangul, T.K. Oleksyk, GigaScience 12 (2023).","chicago":"Wolfsberger, Walter, Karishma Chhugani, Khrystyna Shchubelka, Alina Frolova, Yuriy Salyha, Oksana Zlenko, Mykhailo Arych, et al. “Scientists without Borders: Lessons from Ukraine.” <i>GigaScience</i>. Oxford University Press, 2023. <a href=\"https://doi.org/10.1093/gigascience/giad045\">https://doi.org/10.1093/gigascience/giad045</a>."},"year":"2023","acknowledgement":"Our article is dedicated to all freedom-loving people around the world and to the people of Ukraine who fight for our freedom. Special thanks to Anita Bandrowski, Oleksandra V. Ivashchenko, and Sanita Reinsone for the helpful review, valuable criticism, and useful suggestions while preparing this manuscript, and to Tetiana Yes'kova for helping with Ukrainian translation.\r\nAll authors volunteered their time. No funding supported work on this article.","article_processing_charge":"Yes","publication_identifier":{"eissn":["2047-217X"]},"quality_controlled":"1","publication":"GigaScience","ddc":["000"],"date_published":"2023-07-27T00:00:00Z","type":"journal_article","isi":1,"title":"Scientists without borders: Lessons from Ukraine","author":[{"full_name":"Wolfsberger, Walter","first_name":"Walter","last_name":"Wolfsberger"},{"last_name":"Chhugani","first_name":"Karishma","full_name":"Chhugani, Karishma"},{"first_name":"Khrystyna","last_name":"Shchubelka","full_name":"Shchubelka, Khrystyna"},{"full_name":"Frolova, Alina","first_name":"Alina","last_name":"Frolova"},{"last_name":"Salyha","first_name":"Yuriy","full_name":"Salyha, Yuriy"},{"first_name":"Oksana","last_name":"Zlenko","full_name":"Zlenko, Oksana"},{"last_name":"Arych","first_name":"Mykhailo","full_name":"Arych, Mykhailo"},{"last_name":"Dziuba","first_name":"Dmytro","full_name":"Dziuba, Dmytro"},{"full_name":"Parkhomenko, Andrii","last_name":"Parkhomenko","first_name":"Andrii"},{"last_name":"Smolanka","first_name":"Volodymyr","full_name":"Smolanka, Volodymyr"},{"first_name":"Zeynep H.","last_name":"Gümüş","full_name":"Gümüş, Zeynep H."},{"first_name":"Efe","last_name":"Sezgin","full_name":"Sezgin, Efe"},{"full_name":"Diaz-Lameiro, Alondra","first_name":"Alondra","last_name":"Diaz-Lameiro"},{"last_name":"Toth","first_name":"Viktor R.","full_name":"Toth, Viktor R."},{"first_name":"Megi","last_name":"Maci","full_name":"Maci, Megi"},{"last_name":"Bortz","first_name":"Eric","full_name":"Bortz, Eric"},{"id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","first_name":"Fyodor","last_name":"Kondrashov","full_name":"Kondrashov, Fyodor","orcid":"0000-0001-8243-4694"},{"full_name":"Morton, Patricia M.","last_name":"Morton","first_name":"Patricia M."},{"first_name":"Paweł P.","last_name":"Łabaj","full_name":"Łabaj, Paweł P."},{"full_name":"Romero, Veronika","last_name":"Romero","first_name":"Veronika"},{"full_name":"Hlávka, Jakub","last_name":"Hlávka","first_name":"Jakub"},{"last_name":"Mangul","first_name":"Serghei","full_name":"Mangul, Serghei"},{"full_name":"Oleksyk, Taras K.","first_name":"Taras K.","last_name":"Oleksyk"}]},{"date_created":"2023-10-29T23:01:17Z","volume":202,"abstract":[{"text":"We study fine-grained error bounds for differentially private algorithms for counting under continual observation. Our main insight is that the matrix mechanism when using lower-triangular matrices can be used in the continual observation model. More specifically, we give an explicit factorization for the counting matrix Mcount and upper bound the error explicitly. We also give a fine-grained analysis, specifying the exact constant in the upper bound. Our analysis is based on upper and lower bounds of the completely bounded norm (cb-norm) of Mcount\r\n. Along the way, we improve the best-known bound of 28 years by Mathias (SIAM Journal on Matrix Analysis and Applications, 1993) on the cb-norm of Mcount for a large range of the dimension of Mcount. Furthermore, we are the first to give concrete error bounds for various problems under continual observation such as binary counting, maintaining a histogram, releasing an approximately cut-preserving synthetic graph, many graph-based statistics, and substring and episode counting. Finally, we note that our result can be used to get a fine-grained error bound for non-interactive local learning and the first lower bounds on the additive error for (ϵ,δ)-differentially-private counting under continual observation. Subsequent to this work, Henzinger et al. (SODA, 2023) showed that our factorization also achieves fine-grained mean-squared error.","lang":"eng"}],"oa_version":"Published Version","intvolume":"       202","scopus_import":"1","external_id":{"arxiv":["2202.11205"]},"main_file_link":[{"url":"https://proceedings.mlr.press/v202/fichtenberger23a/fichtenberger23a.pdf","open_access":"1"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"MoHe"}],"project":[{"_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","grant_number":"101019564","call_identifier":"H2020","name":"The design and evaluation of modern fully dynamic data structures"},{"name":"Efficient algorithms","grant_number":"Z00422","_id":"34def286-11ca-11ed-8bc3-da5948e1613c"},{"name":"Fast Algorithms for a Reactive Network Layer","grant_number":"P33775","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe"}],"day":"30","publication_status":"published","status":"public","date_published":"2023-07-30T00:00:00Z","type":"conference","arxiv":1,"ec_funded":1,"alternative_title":["PMLR"],"title":"Constant matters: Fine-grained error bound on differentially private continual observation","author":[{"first_name":"Hendrik","last_name":"Fichtenberger","full_name":"Fichtenberger, Hendrik"},{"orcid":"0000-0002-5008-6530","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","full_name":"Henzinger, Monika H"},{"full_name":"Upadhyay, Jalaj","last_name":"Upadhyay","first_name":"Jalaj"}],"article_processing_charge":"No","publication_identifier":{"eissn":["2640-3498"]},"quality_controlled":"1","publication":"Proceedings of the 40th International Conference on Machine Learning","ddc":["000"],"conference":{"location":"Honolulu, Hawaii, HI, United States","start_date":"2023-07-23","end_date":"2023-07-29","name":"ICML: International Conference on Machine Learning"},"year":"2023","acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant agreement No.\r\n101019564 “The Design of Modern Fully Dynamic Data Structures (MoDynStruct)” and from the Austrian Science Fund (FWF) project Z 422-N, and project “Fast Algorithms for a Reactive Network Layer (ReactNet)”, P 33775-N, with additional funding from the netidee SCIENCE Stiftung, 2020–2024. 2020–2024. JU’s research was funded by Decanal Research Grant. A part of this work was done when JU was visiting Indian Statistical Institute, Delhi. The authors would like to thank Rajat Bhatia, Aleksandar Nikolov, Shanta Laisharam, Vern Paulsen, Ryan Rogers, Abhradeep Thakurta, and Sarvagya Upadhyay for useful discussions.","corr_author":"1","publisher":"ML Research Press","language":[{"iso":"eng"}],"month":"07","page":"10072-10092","_id":"14462","citation":{"mla":"Fichtenberger, Hendrik, et al. “Constant Matters: Fine-Grained Error Bound on Differentially Private Continual Observation.” <i>Proceedings of the 40th International Conference on Machine Learning</i>, vol. 202, ML Research Press, 2023, pp. 10072–92.","ama":"Fichtenberger H, Henzinger M, Upadhyay J. Constant matters: Fine-grained error bound on differentially private continual observation. In: <i>Proceedings of the 40th International Conference on Machine Learning</i>. Vol 202. ML Research Press; 2023:10072-10092.","ieee":"H. Fichtenberger, M. Henzinger, and J. Upadhyay, “Constant matters: Fine-grained error bound on differentially private continual observation,” in <i>Proceedings of the 40th International Conference on Machine Learning</i>, Honolulu, Hawaii, HI, United States, 2023, vol. 202, pp. 10072–10092.","apa":"Fichtenberger, H., Henzinger, M., &#38; Upadhyay, J. (2023). Constant matters: Fine-grained error bound on differentially private continual observation. In <i>Proceedings of the 40th International Conference on Machine Learning</i> (Vol. 202, pp. 10072–10092). Honolulu, Hawaii, HI, United States: ML Research Press.","short":"H. Fichtenberger, M. Henzinger, J. Upadhyay, in:, Proceedings of the 40th International Conference on Machine Learning, ML Research Press, 2023, pp. 10072–10092.","ista":"Fichtenberger H, Henzinger M, Upadhyay J. 2023. Constant matters: Fine-grained error bound on differentially private continual observation. Proceedings of the 40th International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 202, 10072–10092.","chicago":"Fichtenberger, Hendrik, Monika Henzinger, and Jalaj Upadhyay. “Constant Matters: Fine-Grained Error Bound on Differentially Private Continual Observation.” In <i>Proceedings of the 40th International Conference on Machine Learning</i>, 202:10072–92. ML Research Press, 2023."},"date_updated":"2026-06-18T17:35:42Z"},{"publication":"Proceedings of the 37th AAAI Conference on Artificial Intelligence","ddc":["000"],"article_processing_charge":"No","quality_controlled":"1","publication_identifier":{"isbn":["9781577358800"]},"ec_funded":1,"arxiv":1,"author":[{"orcid":"0000-0001-5588-8287","full_name":"Avni, Guy","last_name":"Avni","first_name":"Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Jecker, Ismael R","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","first_name":"Ismael R","last_name":"Jecker"},{"orcid":"0000-0002-4681-1699","first_name":"Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","last_name":"Zikelic","full_name":"Zikelic, Dorde"}],"title":"Bidding graph games with partially-observable budgets","date_published":"2023-06-27T00:00:00Z","type":"conference","language":[{"iso":"eng"}],"_id":"14243","date_updated":"2026-06-18T17:34:06Z","page":"5464-5471","citation":{"chicago":"Avni, Guy, Ismael R Jecker, and Dorde Zikelic. “Bidding Graph Games with Partially-Observable Budgets.” In <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i>, 37:5464–71, 2023. <a href=\"https://doi.org/10.1609/aaai.v37i5.25679\">https://doi.org/10.1609/aaai.v37i5.25679</a>.","ieee":"G. Avni, I. R. Jecker, and D. Zikelic, “Bidding graph games with partially-observable budgets,” in <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i>, Washington, DC, United States, 2023, vol. 37, no. 5, pp. 5464–5471.","mla":"Avni, Guy, et al. “Bidding Graph Games with Partially-Observable Budgets.” <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i>, vol. 37, no. 5, 2023, pp. 5464–71, doi:<a href=\"https://doi.org/10.1609/aaai.v37i5.25679\">10.1609/aaai.v37i5.25679</a>.","ama":"Avni G, Jecker IR, Zikelic D. Bidding graph games with partially-observable budgets. In: <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i>. Vol 37. ; 2023:5464-5471. doi:<a href=\"https://doi.org/10.1609/aaai.v37i5.25679\">10.1609/aaai.v37i5.25679</a>","ista":"Avni G, Jecker IR, Zikelic D. 2023. Bidding graph games with partially-observable budgets. Proceedings of the 37th AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 37, 5464–5471.","apa":"Avni, G., Jecker, I. R., &#38; Zikelic, D. (2023). Bidding graph games with partially-observable budgets. In <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i> (Vol. 37, pp. 5464–5471). Washington, DC, United States. <a href=\"https://doi.org/10.1609/aaai.v37i5.25679\">https://doi.org/10.1609/aaai.v37i5.25679</a>","short":"G. Avni, I.R. Jecker, D. Zikelic, in:, Proceedings of the 37th AAAI Conference on Artificial Intelligence, 2023, pp. 5464–5471."},"month":"06","acknowledgement":"This research was supported in part by ISF grant no.1679/21, by the ERC CoG 863818 (ForM-SMArt), and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","year":"2023","conference":{"name":"AAAI: Conference on Artificial Intelligence","end_date":"2023-02-14","start_date":"2023-02-07","location":"Washington, DC, United States"},"scopus_import":"1","external_id":{"arxiv":["2211.13626"]},"intvolume":"        37","oa_version":"Published Version","date_created":"2023-08-27T22:01:18Z","volume":37,"abstract":[{"text":"Two-player zero-sum \"graph games\" are central in logic, verification, and multi-agent systems. The game proceeds by placing a token on a vertex of a graph, and allowing the players to move it 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, an auction (bidding) determines which player moves the token. So far, bidding games have only been studied as full-information games. In this work we initiate the study of partial-information bidding games: we study bidding games in which a player's initial budget is drawn from a known probability distribution. We show that while for some bidding mechanisms and objectives, it is straightforward to adapt the results from the full-information setting to the partial-information setting, for others, the analysis is significantly more challenging, requires new techniques, and gives rise to interesting results. Specifically, we study games with \"mean-payoff\" objectives in combination with \"poorman\" bidding. We construct optimal strategies for a partially-informed player who plays against a fully-informed adversary. We show that, somewhat surprisingly, the \"value\" under pure strategies does not necessarily exist in such games.","lang":"eng"}],"publication_status":"published","status":"public","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1609/aaai.v37i5.25679","project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"},{"name":"International IST Doctoral Program","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"day":"27","issue":"5","oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1609/aaai.v37i5.25679"}]},{"title":"Source data for the manuscript \"CCR7 acts as both a sensor and a sink for CCL19 to coordinate collective leukocyte migration\"","author":[{"first_name":"Mehmet C","id":"50B2A802-6007-11E9-A42B-EB23E6697425","last_name":"Ucar","full_name":"Ucar, Mehmet C","orcid":"0000-0003-0506-4217"}],"oa_version":"Published Version","date_published":"2023-07-11T00:00:00Z","date_created":"2023-09-06T08:39:25Z","has_accepted_license":"1","type":"research_data_reference","related_material":{"record":[{"status":"public","id":"14274","relation":"used_in_publication"}]},"abstract":[{"text":"The zip file includes source data used in the manuscript \"CCR7 acts as both a sensor and a sink for CCL19 to coordinate collective leukocyte migration\", as well as a representative Jupyter notebook to reproduce the main figures. Please see the preprint on bioRxiv and the DOI link there to access the final published version. Note the title change between the preprint and the published manuscript.\r\nA sample script for particle-based simulations of collective chemotaxis by self-generated gradients is also included (see Self-generated_chemotaxis_sample_script.ipynb) to generate exemplary cell trajectories. A detailed description of the simulation setup is provided in the supplementary information of the manuscipt.","lang":"eng"}],"ddc":["570"],"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"article_processing_charge":"No","year":"2023","oa":1,"main_file_link":[{"url":"https://doi.org/10.5281/zenodo.8133960","open_access":"1"}],"corr_author":"1","publisher":"Zenodo","month":"07","_id":"14279","date_updated":"2026-06-18T17:34:48Z","citation":{"chicago":"Ucar, Mehmet C. “Source Data for the Manuscript ‘CCR7 Acts as Both a Sensor and a Sink for CCL19 to Coordinate Collective Leukocyte Migration.’” Zenodo, 2023. <a href=\"https://doi.org/10.5281/ZENODO.8133960\">https://doi.org/10.5281/ZENODO.8133960</a>.","short":"M.C. Ucar, (2023).","apa":"Ucar, M. C. (2023). Source data for the manuscript “CCR7 acts as both a sensor and a sink for CCL19 to coordinate collective leukocyte migration.” Zenodo. <a href=\"https://doi.org/10.5281/ZENODO.8133960\">https://doi.org/10.5281/ZENODO.8133960</a>","ista":"Ucar MC. 2023. Source data for the manuscript ‘CCR7 acts as both a sensor and a sink for CCL19 to coordinate collective leukocyte migration’, Zenodo, <a href=\"https://doi.org/10.5281/ZENODO.8133960\">10.5281/ZENODO.8133960</a>.","mla":"Ucar, Mehmet C. <i>Source Data for the Manuscript “CCR7 Acts as Both a Sensor and a Sink for CCL19 to Coordinate Collective Leukocyte Migration.”</i> Zenodo, 2023, doi:<a href=\"https://doi.org/10.5281/ZENODO.8133960\">10.5281/ZENODO.8133960</a>.","ama":"Ucar MC. Source data for the manuscript “CCR7 acts as both a sensor and a sink for CCL19 to coordinate collective leukocyte migration.” 2023. doi:<a href=\"https://doi.org/10.5281/ZENODO.8133960\">10.5281/ZENODO.8133960</a>","ieee":"M. C. Ucar, “Source data for the manuscript ‘CCR7 acts as both a sensor and a sink for CCL19 to coordinate collective leukocyte migration.’” Zenodo, 2023."},"status":"public","doi":"10.5281/ZENODO.8133960","department":[{"_id":"EdHa"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"11"},{"year":"2023","acknowledgement":"We thank AlbertA. Smith (Leipzig)for insightful discussions. This work was supported by funding from the European Research Council (StG-2012-311318 to P.S.) and used the platforms of the Grenoble Instruct-ERIC center (ISBG;UMS 3518 CNRS-CEA-UJF-EMBL) within the Grenoble Partnership for Structural Biology(PSB) and facilities and expertiseof the Biophysical and Structural Chemistry platform (BPCS) at IECB,CNRSUAR3033,INSERMUS001 and Bordeaux University.","file":[{"date_updated":"2023-08-16T12:33:31Z","access_level":"open_access","success":1,"content_type":"application/pdf","relation":"main_file","file_id":"14072","creator":"dernst","file_name":"2023_AngewChemInt_Becker.pdf","date_created":"2023-08-16T12:33:31Z","checksum":"7dd083ed8850faa55c34e411ed390de9","file_size":1422445}],"publisher":"Wiley","corr_author":"1","language":[{"iso":"eng"}],"month":"05","citation":{"ista":"Becker LM, Berbon M, Vallet A, Grelard A, Morvan E, Bardiaux B, Lichtenecker R, Ernst M, Loquet A, Schanda P. 2023. The rigid core and flexible surface of amyloid fibrils probed by Magic‐Angle Spinning NMR of aromatic residues. Angewandte Chemie International Edition. 62(19), e202219314.","short":"L.M. Becker, M. Berbon, A. Vallet, A. Grelard, E. Morvan, B. Bardiaux, R. Lichtenecker, M. Ernst, A. Loquet, P. Schanda, Angewandte Chemie International Edition 62 (2023).","apa":"Becker, L. M., Berbon, M., Vallet, A., Grelard, A., Morvan, E., Bardiaux, B., … Schanda, P. (2023). The rigid core and flexible surface of amyloid fibrils probed by Magic‐Angle Spinning NMR of aromatic residues. <i>Angewandte Chemie International Edition</i>. Wiley. <a href=\"https://doi.org/10.1002/anie.202219314\">https://doi.org/10.1002/anie.202219314</a>","ieee":"L. M. Becker <i>et al.</i>, “The rigid core and flexible surface of amyloid fibrils probed by Magic‐Angle Spinning NMR of aromatic residues,” <i>Angewandte Chemie International Edition</i>, vol. 62, no. 19. Wiley, 2023.","ama":"Becker LM, Berbon M, Vallet A, et al. The rigid core and flexible surface of amyloid fibrils probed by Magic‐Angle Spinning NMR of aromatic residues. <i>Angewandte Chemie International Edition</i>. 2023;62(19). doi:<a href=\"https://doi.org/10.1002/anie.202219314\">10.1002/anie.202219314</a>","mla":"Becker, Lea Marie, et al. “The Rigid Core and Flexible Surface of Amyloid Fibrils Probed by Magic‐Angle Spinning NMR of Aromatic Residues.” <i>Angewandte Chemie International Edition</i>, vol. 62, no. 19, e202219314, Wiley, 2023, doi:<a href=\"https://doi.org/10.1002/anie.202219314\">10.1002/anie.202219314</a>.","chicago":"Becker, Lea Marie, Mélanie Berbon, Alicia Vallet, Axelle Grelard, Estelle Morvan, Benjamin Bardiaux, Roman Lichtenecker, Matthias Ernst, Antoine Loquet, and Paul Schanda. “The Rigid Core and Flexible Surface of Amyloid Fibrils Probed by Magic‐Angle Spinning NMR of Aromatic Residues.” <i>Angewandte Chemie International Edition</i>. Wiley, 2023. <a href=\"https://doi.org/10.1002/anie.202219314\">https://doi.org/10.1002/anie.202219314</a>."},"_id":"12675","date_updated":"2026-06-18T17:41:09Z","date_published":"2023-05-01T00:00:00Z","has_accepted_license":"1","type":"journal_article","isi":1,"title":"The rigid core and flexible surface of amyloid fibrils probed by Magic‐Angle Spinning NMR of aromatic residues","author":[{"full_name":"Becker, Lea Marie","id":"36336939-eb97-11eb-a6c2-c83f1214ca79","first_name":"Lea Marie","last_name":"Becker","orcid":"0000-0002-6401-5151"},{"full_name":"Berbon, Mélanie","first_name":"Mélanie","last_name":"Berbon"},{"last_name":"Vallet","first_name":"Alicia","full_name":"Vallet, Alicia"},{"first_name":"Axelle","last_name":"Grelard","full_name":"Grelard, Axelle"},{"first_name":"Estelle","last_name":"Morvan","full_name":"Morvan, Estelle"},{"last_name":"Bardiaux","first_name":"Benjamin","full_name":"Bardiaux, Benjamin"},{"full_name":"Lichtenecker, Roman","first_name":"Roman","last_name":"Lichtenecker"},{"first_name":"Matthias","last_name":"Ernst","full_name":"Ernst, Matthias"},{"full_name":"Loquet, Antoine","last_name":"Loquet","first_name":"Antoine"},{"full_name":"Schanda, Paul","last_name":"Schanda","first_name":"Paul","id":"7B541462-FAF6-11E9-A490-E8DFE5697425","orcid":"0000-0002-9350-7606"}],"article_processing_charge":"Yes (via OA deal)","publication_identifier":{"eissn":["1521-3773"],"issn":["1433-7851"]},"quality_controlled":"1","publication":"Angewandte Chemie International Edition","ddc":["540"],"keyword":["General Chemistry","Catalysis"],"oa":1,"file_date_updated":"2023-08-16T12:33:31Z","issue":"19","doi":"10.1002/anie.202219314","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"GradSch"},{"_id":"PaSc"}],"day":"01","publication_status":"published","status":"public","volume":62,"date_created":"2023-02-24T10:45:01Z","article_type":"original","article_number":"e202219314","related_material":{"link":[{"description":"News on ISTA website","relation":"press_release","url":"https://ista.ac.at/en/news/dancing-styles-of-atoms/"}],"record":[{"status":"public","relation":"research_data","id":"12497"},{"status":"public","id":"14861","relation":"other"}]},"abstract":[{"lang":"eng","text":"Aromatic side chains are important reporters of the plasticity of proteins, and often form important contacts in protein--protein interactions. By studying a pair of structurally homologous cross-β amyloid fibrils, HET-s and HELLF, with a specific isotope-labeling approach and magic-angle-spinning (MAS) NMR, we have characterized the dynamic behavior of Phe and Tyr aromatic rings to show that the hydrophobic amyloid core is rigid, without any sign of \"breathing motions\" over hundreds of milliseconds at least. Aromatic residues exposed at the fibril surface have a rigid ring axis but undergo ring flips, on a variety of time scales from ns to µs. Our approach provides direct insight into hydrophobic-core motions, enabling a better evaluation of the conformational heterogeneity generated from a NMR structural ensemble of such amyloid cross-β architecture."}],"pmid":1,"oa_version":"Published Version","license":"https://creativecommons.org/licenses/by-nc/4.0/","intvolume":"        62","scopus_import":"1","tmp":{"image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)"},"external_id":{"pmid":["36738230"],"isi":["000956919900001"]}},{"article_processing_charge":"No","publication_identifier":{"isbn":["9798400702297"]},"quality_controlled":"1","publication":"Proceedings of the 29th Symposium on Operating Systems Principles","ddc":["000"],"date_published":"2023-10-01T00:00:00Z","type":"conference","isi":1,"title":"QuePaxa: Escaping the tyranny of timeouts in consensus","author":[{"full_name":"Tennage, Pasindu","last_name":"Tennage","first_name":"Pasindu"},{"full_name":"Basescu, Cristina","last_name":"Basescu","first_name":"Cristina"},{"orcid":"0000-0002-8827-3382","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","first_name":"Eleftherios","last_name":"Kokoris Kogias","full_name":"Kokoris Kogias, Eleftherios"},{"first_name":"Ewa","last_name":"Syta","full_name":"Syta, Ewa"},{"full_name":"Jovanovic, Philipp","last_name":"Jovanovic","first_name":"Philipp"},{"full_name":"Estrada-Galinanes, Vero","last_name":"Estrada-Galinanes","first_name":"Vero"},{"full_name":"Ford, Bryan","first_name":"Bryan","last_name":"Ford"}],"publisher":"Association for Computing Machinery","language":[{"iso":"eng"}],"month":"10","_id":"14743","page":"281-297","citation":{"chicago":"Tennage, Pasindu, Cristina Basescu, Eleftherios Kokoris Kogias, Ewa Syta, Philipp Jovanovic, Vero Estrada-Galinanes, and Bryan Ford. “QuePaxa: Escaping the Tyranny of Timeouts in Consensus.” In <i>Proceedings of the 29th Symposium on Operating Systems Principles</i>, 281–97. Association for Computing Machinery, 2023. <a href=\"https://doi.org/10.1145/3600006.3613150\">https://doi.org/10.1145/3600006.3613150</a>.","ama":"Tennage P, Basescu C, Kokoris Kogias E, et al. QuePaxa: Escaping the tyranny of timeouts in consensus. In: <i>Proceedings of the 29th Symposium on Operating Systems Principles</i>. Association for Computing Machinery; 2023:281-297. doi:<a href=\"https://doi.org/10.1145/3600006.3613150\">10.1145/3600006.3613150</a>","mla":"Tennage, Pasindu, et al. “QuePaxa: Escaping the Tyranny of Timeouts in Consensus.” <i>Proceedings of the 29th Symposium on Operating Systems Principles</i>, Association for Computing Machinery, 2023, pp. 281–97, doi:<a href=\"https://doi.org/10.1145/3600006.3613150\">10.1145/3600006.3613150</a>.","ieee":"P. Tennage <i>et al.</i>, “QuePaxa: Escaping the tyranny of timeouts in consensus,” in <i>Proceedings of the 29th Symposium on Operating Systems Principles</i>, Koblenz, Germany, 2023, pp. 281–297.","apa":"Tennage, P., Basescu, C., Kokoris Kogias, E., Syta, E., Jovanovic, P., Estrada-Galinanes, V., &#38; Ford, B. (2023). QuePaxa: Escaping the tyranny of timeouts in consensus. In <i>Proceedings of the 29th Symposium on Operating Systems Principles</i> (pp. 281–297). Koblenz, Germany: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3600006.3613150\">https://doi.org/10.1145/3600006.3613150</a>","short":"P. Tennage, C. Basescu, E. Kokoris Kogias, E. Syta, P. Jovanovic, V. Estrada-Galinanes, B. Ford, in:, Proceedings of the 29th Symposium on Operating Systems Principles, Association for Computing Machinery, 2023, pp. 281–297.","ista":"Tennage P, Basescu C, Kokoris Kogias E, Syta E, Jovanovic P, Estrada-Galinanes V, Ford B. 2023. QuePaxa: Escaping the tyranny of timeouts in consensus. Proceedings of the 29th Symposium on Operating Systems Principles. SOSP: Symposium on Operating Systems Principles, 281–297."},"date_updated":"2026-06-18T17:38:12Z","conference":{"name":"SOSP: Symposium on Operating Systems Principles","start_date":"2023-10-23","location":"Koblenz, Germany","end_date":"2023-10-26"},"year":"2023","acknowledgement":"The authors would like to thank Marcos K. Aguilera, Pierluca Borsò, Aleksey Charapko, Rachid Guerraoui, Jovan Komatovic, Derek Leung, Louis-Henri Merino, Shailesh Mishra, Haochen Pan, Rodrigo Rodrigues, Lewis Tseng, and Haoqian Zhang for their helpful feedback on early drafts of this paper.","scopus_import":"1","external_id":{"isi":["001135072900018"]},"date_created":"2024-01-08T12:54:35Z","abstract":[{"lang":"eng","text":"Leader-based consensus algorithms are fast and efficient under normal conditions, but lack robustness to adverse conditions due to their reliance on timeouts for liveness. We present QuePaxa, the first protocol offering state-of-the-art normal-case efficiency without depending on timeouts. QuePaxa uses a novel randomized asynchronous consensus core to tolerate adverse conditions such as denial-of-service (DoS) attacks, while a one-round-trip fast path preserves the normal-case efficiency of Multi-Paxos or Raft. By allowing simultaneous proposers without destructive interference, and using short hedging delays instead of conservative timeouts to limit redundant effort, QuePaxa permits rapid recovery after leader failure without risking costly view changes due to false timeouts. By treating leader choice and hedging delay as a multi-armed-bandit optimization, QuePaxa achieves responsiveness to prevalent conditions, and can choose the best leader even if the current one has not failed. Experiments with a prototype confirm that QuePaxa achieves normal-case LAN and WAN performance of 584k and 250k cmd/sec in throughput, respectively, comparable to Multi-Paxos. Under conditions such as DoS attacks, misconfigurations, or slow leaders that severely impact existing protocols, we find that QuePaxa remains live with median latency under 380ms in WAN experiments."}],"oa_version":"Published Version","doi":"10.1145/3600006.3613150","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"ElKo"}],"day":"01","publication_status":"published","status":"public","oa":1,"main_file_link":[{"url":"https://doi.org/10.1145/3600006.3613150","open_access":"1"}]},{"ddc":["570"],"publication":"Cold Spring Harbor Perspectives in Biology","quality_controlled":"1","publication_identifier":{"issn":["1943-0264"]},"article_processing_charge":"No","author":[{"last_name":"Lucek","first_name":"Kay","full_name":"Lucek, Kay"},{"full_name":"Giménez, Mabel D.","last_name":"Giménez","first_name":"Mabel D."},{"full_name":"Joron, Mathieu","first_name":"Mathieu","last_name":"Joron"},{"last_name":"Rafajlović","first_name":"Marina","full_name":"Rafajlović, Marina"},{"full_name":"Searle, Jeremy B.","first_name":"Jeremy B.","last_name":"Searle"},{"full_name":"Walden, Nora","last_name":"Walden","first_name":"Nora"},{"id":"3C147470-F248-11E8-B48F-1D18A9856A87","first_name":"Anja M","last_name":"Westram","full_name":"Westram, Anja M","orcid":"0000-0003-1050-4969"},{"first_name":"Rui","last_name":"Faria","full_name":"Faria, Rui"}],"title":"The impact of chromosomal rearrangements in speciation: From micro- to macroevolution","isi":1,"type":"journal_article","date_published":"2023-11-01T00:00:00Z","_id":"14742","citation":{"chicago":"Lucek, Kay, Mabel D. Giménez, Mathieu Joron, Marina Rafajlović, Jeremy B. Searle, Nora Walden, Anja M Westram, and Rui Faria. “The Impact of Chromosomal Rearrangements in Speciation: From Micro- to Macroevolution.” <i>Cold Spring Harbor Perspectives in Biology</i>. Cold Spring Harbor Laboratory Press, 2023. <a href=\"https://doi.org/10.1101/cshperspect.a041447\">https://doi.org/10.1101/cshperspect.a041447</a>.","ama":"Lucek K, Giménez MD, Joron M, et al. The impact of chromosomal rearrangements in speciation: From micro- to macroevolution. <i>Cold Spring Harbor Perspectives in Biology</i>. 2023;15(11). doi:<a href=\"https://doi.org/10.1101/cshperspect.a041447\">10.1101/cshperspect.a041447</a>","mla":"Lucek, Kay, et al. “The Impact of Chromosomal Rearrangements in Speciation: From Micro- to Macroevolution.” <i>Cold Spring Harbor Perspectives in Biology</i>, vol. 15, no. 11, a041447, Cold Spring Harbor Laboratory Press, 2023, doi:<a href=\"https://doi.org/10.1101/cshperspect.a041447\">10.1101/cshperspect.a041447</a>.","ieee":"K. Lucek <i>et al.</i>, “The impact of chromosomal rearrangements in speciation: From micro- to macroevolution,” <i>Cold Spring Harbor Perspectives in Biology</i>, vol. 15, no. 11. Cold Spring Harbor Laboratory Press, 2023.","apa":"Lucek, K., Giménez, M. D., Joron, M., Rafajlović, M., Searle, J. B., Walden, N., … Faria, R. (2023). The impact of chromosomal rearrangements in speciation: From micro- to macroevolution. <i>Cold Spring Harbor Perspectives in Biology</i>. Cold Spring Harbor Laboratory Press. <a href=\"https://doi.org/10.1101/cshperspect.a041447\">https://doi.org/10.1101/cshperspect.a041447</a>","short":"K. Lucek, M.D. Giménez, M. Joron, M. Rafajlović, J.B. Searle, N. Walden, A.M. Westram, R. Faria, Cold Spring Harbor Perspectives in Biology 15 (2023).","ista":"Lucek K, Giménez MD, Joron M, Rafajlović M, Searle JB, Walden N, Westram AM, Faria R. 2023. The impact of chromosomal rearrangements in speciation: From micro- to macroevolution. Cold Spring Harbor Perspectives in Biology. 15(11), a041447."},"date_updated":"2026-06-18T17:37:44Z","month":"11","language":[{"iso":"eng"}],"publisher":"Cold Spring Harbor Laboratory Press","acknowledgement":"K.L. was funded by a Swiss National Science Foundation Eccellenza project: The evolution of strong reproductive barriers towards the completion of speciation (PCEFP3_202869). R.F.\r\nwas funded by an FCT CEEC (Fundação para a Ciênca e a Tecnologia, Concurso Estímulo ao\r\nEmprego Científico) contract (2020.00275. CEECIND) and by an FCT research project\r\n(PTDC/BIA-EVL/1614/2021). M.R. was funded by the Swedish Research Council Vetenskapsrådet (grant number 2021-05243). A.M.W. was partly funded by the Norwegian Research Council RCN. We thank Luis Silva for his help preparing Figure 1. We are grateful to Maren Wellenreuther, Daniel Bolnick, and two anonymous reviewers for their constructive feedback on an earlier version of this paper.","year":"2023","external_id":{"pmid":["37604585"],"isi":["001096272600001"]},"scopus_import":"1","intvolume":"        15","oa_version":"Published Version","pmid":1,"abstract":[{"lang":"eng","text":"Chromosomal rearrangements (CRs) have been known since almost the beginning of genetics.\r\nWhile an important role for CRs in speciation has been suggested, evidence primarily stems\r\nfrom theoretical and empirical studies focusing on the microevolutionary level (i.e., on taxon\r\npairs where speciation is often incomplete). Although the role of CRs in eukaryotic speciation at\r\na macroevolutionary level has been supported by associations between species diversity and\r\nrates of evolution of CRs across phylogenies, these findings are limited to a restricted range of\r\nCRs and taxa. Now that more broadly applicable and precise CR detection approaches have\r\nbecome available, we address the challenges in filling some of the conceptual and empirical\r\ngaps between micro- and macroevolutionary studies on the role of CRs in speciation. We\r\nsynthesize what is known about the macroevolutionary impact of CRs and suggest new research avenues to overcome the pitfalls of previous studies to gain a more comprehensive understanding of the evolutionary significance of CRs in speciation across the tree of life."}],"article_number":"a041447","article_type":"original","volume":15,"date_created":"2024-01-08T12:43:48Z","status":"public","publication_status":"published","day":"01","department":[{"_id":"NiBa"},{"_id":"BeVi"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1101/cshperspect.a041447","issue":"11","main_file_link":[{"url":"https://doi.org/10.1101/cshperspect.a041447","open_access":"1"}],"oa":1,"keyword":["General Biochemistry","Genetics and Molecular Biology"]},{"publication_identifier":{"eissn":["1521-3773"],"issn":["1433-7851"]},"article_processing_charge":"No","ddc":["540"],"publication":"Angewandte Chemie International Edition","type":"other_academic_publication","date_published":"2023-05-02T00:00:00Z","author":[{"orcid":"0000-0002-6401-5151","last_name":"Becker","id":"36336939-eb97-11eb-a6c2-c83f1214ca79","first_name":"Lea Marie","full_name":"Becker, Lea Marie"},{"full_name":"Berbon, Mélanie","first_name":"Mélanie","last_name":"Berbon"},{"full_name":"Vallet, Alicia","last_name":"Vallet","first_name":"Alicia"},{"full_name":"Grelard, Axelle","last_name":"Grelard","first_name":"Axelle"},{"last_name":"Morvan","first_name":"Estelle","full_name":"Morvan, Estelle"},{"first_name":"Benjamin","last_name":"Bardiaux","full_name":"Bardiaux, Benjamin"},{"full_name":"Lichtenecker, Roman","last_name":"Lichtenecker","first_name":"Roman"},{"full_name":"Ernst, Matthias","first_name":"Matthias","last_name":"Ernst"},{"full_name":"Loquet, Antoine","first_name":"Antoine","last_name":"Loquet"},{"last_name":"Schanda","first_name":"Paul","id":"7B541462-FAF6-11E9-A490-E8DFE5697425","full_name":"Schanda, Paul","orcid":"0000-0002-9350-7606"}],"title":"Cover Picture: The rigid core and flexible surface of amyloid fibrils probed by Magic‐Angle‐Spinning NMR spectroscopy of aromatic residues","_id":"14861","date_updated":"2026-06-18T17:41:09Z","citation":{"ieee":"L. M. Becker <i>et al.</i>, <i>Cover Picture: The rigid core and flexible surface of amyloid fibrils probed by Magic‐Angle‐Spinning NMR spectroscopy of aromatic residues</i>, vol. 62, no. 19. Wiley, 2023.","mla":"Becker, Lea Marie, et al. “Cover Picture: The Rigid Core and Flexible Surface of Amyloid Fibrils Probed by Magic‐Angle‐Spinning NMR Spectroscopy of Aromatic Residues.” <i>Angewandte Chemie International Edition</i>, vol. 62, no. 19, e202304138, Wiley, 2023, doi:<a href=\"https://doi.org/10.1002/anie.202304138\">10.1002/anie.202304138</a>.","ama":"Becker LM, Berbon M, Vallet A, et al. <i>Cover Picture: The Rigid Core and Flexible Surface of Amyloid Fibrils Probed by Magic‐Angle‐Spinning NMR Spectroscopy of Aromatic Residues</i>. Vol 62. Wiley; 2023. doi:<a href=\"https://doi.org/10.1002/anie.202304138\">10.1002/anie.202304138</a>","ista":"Becker LM, Berbon M, Vallet A, Grelard A, Morvan E, Bardiaux B, Lichtenecker R, Ernst M, Loquet A, Schanda P. 2023. Cover Picture: The rigid core and flexible surface of amyloid fibrils probed by Magic‐Angle‐Spinning NMR spectroscopy of aromatic residues, Wiley,p.","short":"L.M. Becker, M. Berbon, A. Vallet, A. Grelard, E. Morvan, B. Bardiaux, R. Lichtenecker, M. Ernst, A. Loquet, P. Schanda, Cover Picture: The Rigid Core and Flexible Surface of Amyloid Fibrils Probed by Magic‐Angle‐Spinning NMR Spectroscopy of Aromatic Residues, Wiley, 2023.","apa":"Becker, L. M., Berbon, M., Vallet, A., Grelard, A., Morvan, E., Bardiaux, B., … Schanda, P. (2023). <i>Cover Picture: The rigid core and flexible surface of amyloid fibrils probed by Magic‐Angle‐Spinning NMR spectroscopy of aromatic residues</i>. <i>Angewandte Chemie International Edition</i> (Vol. 62). Wiley. <a href=\"https://doi.org/10.1002/anie.202304138\">https://doi.org/10.1002/anie.202304138</a>","chicago":"Becker, Lea Marie, Mélanie Berbon, Alicia Vallet, Axelle Grelard, Estelle Morvan, Benjamin Bardiaux, Roman Lichtenecker, Matthias Ernst, Antoine Loquet, and Paul Schanda. <i>Cover Picture: The Rigid Core and Flexible Surface of Amyloid Fibrils Probed by Magic‐Angle‐Spinning NMR Spectroscopy of Aromatic Residues</i>. <i>Angewandte Chemie International Edition</i>. Vol. 62. Wiley, 2023. <a href=\"https://doi.org/10.1002/anie.202304138\">https://doi.org/10.1002/anie.202304138</a>."},"month":"05","language":[{"iso":"eng"}],"corr_author":"1","publisher":"Wiley","year":"2023","intvolume":"        62","abstract":[{"lang":"eng","text":"Cover Page"}],"article_number":" e202304138","related_material":{"link":[{"relation":"translation","url":"https://doi.org/10.1002/ange.202304138"}],"record":[{"status":"public","relation":"other","id":"12675"}]},"date_created":"2024-01-22T11:54:34Z","volume":62,"oa_version":"Published Version","day":"02","department":[{"_id":"PaSc"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1002/anie.202304138","status":"public","publication_status":"published","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1002/anie.202304138"}],"oa":1,"keyword":["General Chemistry","Catalysis"],"issue":"19"},{"language":[{"iso":"eng"}],"publisher":"AIP Publishing","corr_author":"1","citation":{"chicago":"Muller, Caroline J, and Sophie Abramian. “The Cloud Dynamics of Convective Storm Systems.” <i>Physics Today</i>. AIP Publishing, 2023. <a href=\"https://doi.org/10.1063/pt.3.5234\">https://doi.org/10.1063/pt.3.5234</a>.","short":"C.J. Muller, S. Abramian, Physics Today 76 (2023).","apa":"Muller, C. J., &#38; Abramian, S. (2023). The cloud dynamics of convective storm systems. <i>Physics Today</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/pt.3.5234\">https://doi.org/10.1063/pt.3.5234</a>","ista":"Muller CJ, Abramian S. 2023. The cloud dynamics of convective storm systems. Physics Today. 76(5), 28.","ama":"Muller CJ, Abramian S. The cloud dynamics of convective storm systems. <i>Physics Today</i>. 2023;76(5). doi:<a href=\"https://doi.org/10.1063/pt.3.5234\">10.1063/pt.3.5234</a>","mla":"Muller, Caroline J., and Sophie Abramian. “The Cloud Dynamics of Convective Storm Systems.” <i>Physics Today</i>, vol. 76, no. 5, 28, AIP Publishing, 2023, doi:<a href=\"https://doi.org/10.1063/pt.3.5234\">10.1063/pt.3.5234</a>.","ieee":"C. J. Muller and S. Abramian, “The cloud dynamics of convective storm systems,” <i>Physics Today</i>, vol. 76, no. 5. AIP Publishing, 2023."},"_id":"14773","date_updated":"2026-06-18T17:38:37Z","month":"05","year":"2023","article_processing_charge":"No","quality_controlled":"1","publication_identifier":{"issn":["0031-9228"],"eissn":["1945-0699"]},"publication":"Physics Today","ddc":["550"],"date_published":"2023-05-01T00:00:00Z","type":"journal_article","isi":1,"author":[{"orcid":"0000-0001-5836-5350","last_name":"Muller","id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b","first_name":"Caroline J","full_name":"Muller, Caroline J"},{"last_name":"Abramian","first_name":"Sophie","full_name":"Abramian, Sophie"}],"title":"The cloud dynamics of convective storm systems","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"CaMu"}],"doi":"10.1063/pt.3.5234","day":"01","publication_status":"published","status":"public","keyword":["General Physics and Astronomy"],"oa":1,"main_file_link":[{"open_access":"1","url":"https://www.lmd.ens.fr/muller/Pubs/2023-MullerAbramianPhysToday.pdf"}],"issue":"5","intvolume":"        76","external_id":{"isi":["000984516100007"]},"article_type":"original","volume":76,"date_created":"2024-01-10T09:18:04Z","abstract":[{"lang":"eng","text":"Through a combination of idealized simulations and real-world data, researchers are uncovering how internal feedbacks and large-scale motions influence cloud dynamics."}],"article_number":"28","oa_version":"Published Version"},{"acknowledgement":"This work is supported by the Novi team at Meta and funded in part by IC3 industry partners and NSF grant 1943499.","oa":1,"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2023/081"}],"year":"2023","conference":{"name":"NDSS: Network and Distributed Systems Security","location":"San Diego, CA, United States","start_date":"2023-02-27","end_date":"2023-03-03"},"date_updated":"2026-06-18T17:41:59Z","_id":"14989","status":"public","citation":{"ieee":"H. Malvai <i>et al.</i>, “Parakeet: Practical key transparency for end-to-end eEncrypted messaging,” in <i>Proceedings of the 2023 Network and Distributed System Security Symposium</i>, San Diego, CA, United States, 2023.","mla":"Malvai, Harjasleen, et al. “Parakeet: Practical Key Transparency for End-to-End EEncrypted Messaging.” <i>Proceedings of the 2023 Network and Distributed System Security Symposium</i>, Internet Society, 2023, doi:<a href=\"https://doi.org/10.14722/ndss.2023.24545\">10.14722/ndss.2023.24545</a>.","ama":"Malvai H, Kokoris Kogias E, Sonnino A, et al. Parakeet: Practical key transparency for end-to-end eEncrypted messaging. In: <i>Proceedings of the 2023 Network and Distributed System Security Symposium</i>. Internet Society; 2023. doi:<a href=\"https://doi.org/10.14722/ndss.2023.24545\">10.14722/ndss.2023.24545</a>","ista":"Malvai H, Kokoris Kogias E, Sonnino A, Ghosh E, Oztürk E, Lewi K, Lawlor S. 2023. Parakeet: Practical key transparency for end-to-end eEncrypted messaging. Proceedings of the 2023 Network and Distributed System Security Symposium. NDSS: Network and Distributed Systems Security.","apa":"Malvai, H., Kokoris Kogias, E., Sonnino, A., Ghosh, E., Oztürk, E., Lewi, K., &#38; Lawlor, S. (2023). Parakeet: Practical key transparency for end-to-end eEncrypted messaging. In <i>Proceedings of the 2023 Network and Distributed System Security Symposium</i>. San Diego, CA, United States: Internet Society. <a href=\"https://doi.org/10.14722/ndss.2023.24545\">https://doi.org/10.14722/ndss.2023.24545</a>","short":"H. Malvai, E. Kokoris Kogias, A. Sonnino, E. Ghosh, E. Oztürk, K. Lewi, S. Lawlor, in:, Proceedings of the 2023 Network and Distributed System Security Symposium, Internet Society, 2023.","chicago":"Malvai, Harjasleen, Eleftherios Kokoris Kogias, Alberto Sonnino, Esha Ghosh, Ercan Oztürk, Kevin Lewi, and Sean Lawlor. “Parakeet: Practical Key Transparency for End-to-End EEncrypted Messaging.” In <i>Proceedings of the 2023 Network and Distributed System Security Symposium</i>. Internet Society, 2023. <a href=\"https://doi.org/10.14722/ndss.2023.24545\">https://doi.org/10.14722/ndss.2023.24545</a>."},"month":"03","publication_status":"published","language":[{"iso":"eng"}],"publisher":"Internet Society","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"ElKo"}],"doi":"10.14722/ndss.2023.24545","oa_version":"Published Version","author":[{"full_name":"Malvai, Harjasleen","last_name":"Malvai","first_name":"Harjasleen"},{"first_name":"Eleftherios","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","last_name":"Kokoris Kogias","full_name":"Kokoris Kogias, Eleftherios","orcid":"0000-0002-8827-3382"},{"last_name":"Sonnino","first_name":"Alberto","full_name":"Sonnino, Alberto"},{"first_name":"Esha","last_name":"Ghosh","full_name":"Ghosh, Esha"},{"last_name":"Oztürk","first_name":"Ercan","full_name":"Oztürk, Ercan"},{"last_name":"Lewi","first_name":"Kevin","full_name":"Lewi, Kevin"},{"full_name":"Lawlor, Sean","last_name":"Lawlor","first_name":"Sean"}],"title":"Parakeet: Practical key transparency for end-to-end eEncrypted messaging","abstract":[{"lang":"eng","text":"Encryption alone is not enough for secure end-to end encrypted messaging: a server must also honestly serve public keys to users. Key transparency has been presented as an efficient\r\nsolution for detecting (and hence deterring) a server that attempts to dishonestly serve keys. Key transparency involves two major components: (1) a username to public key mapping, stored and cryptographically committed to by the server, and, (2) an outof-band consistency protocol for serving short commitments to users. In the setting of real-world deployments and supporting production scale, new challenges must be considered for both of these components. We enumerate these challenges and provide solutions to address them. In particular, we design and implement a memory-optimized and privacy-preserving verifiable data structure for committing to the username to public key store.\r\nTo make this implementation viable for production, we also integrate support for persistent and distributed storage. We also propose a future-facing solution, termed “compaction”, as\r\na mechanism for mitigating practical issues that arise from dealing with infinitely growing server data structures. Finally, we implement a consensusless solution that achieves the minimum requirements for a service that consistently distributes commitments for a transparency application, providing a much more efficient protocol for distributing small and consistent\r\ncommitments to users. This culminates in our production-grade implementation of a key transparency system (Parakeet) which we have open-sourced, along with a demonstration of feasibility through our benchmarks."}],"type":"conference","date_published":"2023-03-01T00:00:00Z","date_created":"2024-02-14T14:20:40Z","ddc":["000"],"scopus_import":"1","publication":"Proceedings of the 2023 Network and Distributed System Security Symposium","quality_controlled":"1","publication_identifier":{"isbn":["1891562835"]},"article_processing_charge":"No"},{"external_id":{"arxiv":["2210.06819"]},"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"oa_version":"Published Version","date_created":"2024-02-02T11:21:56Z","abstract":[{"text":"The stochastic heavy ball method (SHB), also known as stochastic gradient descent (SGD) with Polyak's momentum, is widely used in training neural networks. However, despite the remarkable success of such algorithm in practice, its theoretical characterization remains limited. In this paper, we focus on neural networks with two and three layers and provide a rigorous understanding of the properties of the solutions found by SHB: \\emph{(i)} stability after dropping out part of the neurons, \\emph{(ii)} connectivity along a low-loss path, and \\emph{(iii)} convergence to the global optimum.\r\nTo achieve this goal, we take a mean-field view and relate the SHB dynamics to a certain partial differential equation in the limit of large network widths. This mean-field perspective has inspired a recent line of work focusing on SGD while, in contrast, our paper considers an algorithm with momentum. More specifically, after proving existence and uniqueness of the limit differential equations, we show convergence to the global optimum and give a quantitative bound between the mean-field limit and the SHB dynamics of a finite-width network. Armed with this last bound, we are able to establish the dropout-stability and connectivity of SHB solutions.","lang":"eng"}],"publication_status":"published","status":"public","department":[{"_id":"MaMo"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"28","project":[{"name":"Prix Lopez-Loretta 2019 - Marco Mondelli","_id":"059876FA-7A3F-11EA-A408-12923DDC885E"}],"oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2210.06819"}],"publication":"Transactions on Machine Learning Research","ddc":["000"],"article_processing_charge":"No","quality_controlled":"1","arxiv":1,"author":[{"last_name":"Wu","id":"1a5914c2-896a-11ed-bdf8-fb80621a0635","first_name":"Diyuan","full_name":"Wu, Diyuan"},{"full_name":"Kungurtsev, Vyacheslav","first_name":"Vyacheslav","last_name":"Kungurtsev"},{"orcid":"0000-0002-3242-7020","first_name":"Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","last_name":"Mondelli","full_name":"Mondelli, Marco"}],"title":"Mean-field analysis for heavy ball methods: Dropout-stability, connectivity, and global convergence","alternative_title":["TMLR"],"date_published":"2023-02-28T00:00:00Z","type":"conference","has_accepted_license":"1","language":[{"iso":"eng"}],"publisher":"ML Research Press","corr_author":"1","_id":"14924","citation":{"chicago":"Wu, Diyuan, Vyacheslav Kungurtsev, and Marco Mondelli. “Mean-Field Analysis for Heavy Ball Methods: Dropout-Stability, Connectivity, and Global Convergence.” In <i>Transactions on Machine Learning Research</i>. ML Research Press, 2023.","ieee":"D. Wu, V. Kungurtsev, and M. Mondelli, “Mean-field analysis for heavy ball methods: Dropout-stability, connectivity, and global convergence,” in <i>Transactions on Machine Learning Research</i>, 2023.","ama":"Wu D, Kungurtsev V, Mondelli M. Mean-field analysis for heavy ball methods: Dropout-stability, connectivity, and global convergence. In: <i>Transactions on Machine Learning Research</i>. ML Research Press; 2023.","mla":"Wu, Diyuan, et al. “Mean-Field Analysis for Heavy Ball Methods: Dropout-Stability, Connectivity, and Global Convergence.” <i>Transactions on Machine Learning Research</i>, ML Research Press, 2023.","ista":"Wu D, Kungurtsev V, Mondelli M. 2023. Mean-field analysis for heavy ball methods: Dropout-stability, connectivity, and global convergence. Transactions on Machine Learning Research. , TMLR, .","short":"D. Wu, V. Kungurtsev, M. Mondelli, in:, Transactions on Machine Learning Research, ML Research Press, 2023.","apa":"Wu, D., Kungurtsev, V., &#38; Mondelli, M. (2023). Mean-field analysis for heavy ball methods: Dropout-stability, connectivity, and global convergence. In <i>Transactions on Machine Learning Research</i>. ML Research Press."},"date_updated":"2026-06-18T17:41:36Z","month":"02","acknowledgement":"D. Wu and M. Mondelli are partially supported by the 2019 Lopez-Loreta Prize. V. Kungurtsev was supported by the OP VVV project CZ.02.1.01/0.0/0.0/16_019/0000765 \"Research Center for Informatics\".","year":"2023"},{"department":[{"_id":"TiVo"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"02","publisher":"OpenReview","publication_status":"published","language":[{"iso":"eng"}],"month":"03","status":"public","_id":"14993","date_updated":"2026-06-18T17:42:25Z","citation":{"short":"C. Currin, M.N. Asiedu , C. Fourie, B. Rosman, H. Turki, A. Lambebo Tonja, J. Abbott, M. Ajala, S.A. Adedayo, C.C. Emezue, D. Machangara, in:, 1st Workshop on Machine Learning &#38; Global Health, OpenReview, 2023.","apa":"Currin, C., Asiedu , M. N., Fourie, C., Rosman, B., Turki, H., Lambebo Tonja, A., … Machangara, D. (2023). A framework for grassroots research collaboration in machine learning and global health. In <i>1st Workshop on Machine Learning &#38; Global Health</i>. Kigali, Rwanda: OpenReview.","ista":"Currin C, Asiedu  MN, Fourie C, Rosman B, Turki H, Lambebo Tonja A, Abbott J, Ajala M, Adedayo SA, Emezue CC, Machangara D. 2023. A framework for grassroots research collaboration in machine learning and global health. 1st Workshop on Machine Learning &#38; Global Health. ICLR: International Conference on Learning Representations.","mla":"Currin, Christopher, et al. “A Framework for Grassroots Research Collaboration in Machine Learning and Global Health.” <i>1st Workshop on Machine Learning &#38; Global Health</i>, OpenReview, 2023.","ama":"Currin C, Asiedu  MN, Fourie C, et al. A framework for grassroots research collaboration in machine learning and global health. In: <i>1st Workshop on Machine Learning &#38; Global Health</i>. OpenReview; 2023.","ieee":"C. Currin <i>et al.</i>, “A framework for grassroots research collaboration in machine learning and global health,” in <i>1st Workshop on Machine Learning &#38; Global Health</i>, Kigali, Rwanda, 2023.","chicago":"Currin, Christopher, Mercy Nyamewaa Asiedu , Chris Fourie, Benjamin Rosman, Houcemeddine Turki, Atnafu Lambebo Tonja, Jade Abbott, et al. “A Framework for Grassroots Research Collaboration in Machine Learning and Global Health.” In <i>1st Workshop on Machine Learning &#38; Global Health</i>. OpenReview, 2023."},"conference":{"name":"ICLR: International Conference on Learning Representations","end_date":"2023-05-05","start_date":"2023-05-05","location":"Kigali, Rwanda"},"year":"2023","oa":1,"main_file_link":[{"url":"https://openreview.net/forum?id=jHY_G91R880","open_access":"1"}],"acknowledgement":"Houcemeddine Turki’s contributions to this final output have been funded through the Adapting\r\nWikidata to support clinical practice using Data Science, Semantic Web and Machine Learning\r\nproject, which is part of the Wikimedia Research Fund maintained by the Wikimedia Foundation in San Francisco, California, United States of America.","article_processing_charge":"No","quality_controlled":"1","publication":"1st Workshop on Machine Learning & Global Health","ddc":["000"],"date_published":"2023-03-02T00:00:00Z","date_created":"2024-02-14T15:11:48Z","type":"conference","abstract":[{"text":"Traditional top-down approaches for global health have historically failed to achieve social progress (Hoffman et al., 2015; Hoffman & Røttingen, 2015). Recently, however, a more holistic, multi-level approach termed One Health (OH) (Osterhaus et al., 2020) is being adopted. Several sets of challenges have been identified for the implementation of OH (dos S. Ribeiro et al., 2019), including policy and funding, education and training, and multi-actor, multi-domain, and multi-level collaborations. These exist despite the increasing accessibility to\r\nknowledge and digital collaborative research tools through the internet. To address some of these challenges, we propose a general framework for grassroots community-based means of participatory research. Additionally, we present a specific roadmap to create a Machine Learning for Global Health community in Africa. The proposed framework aims to enable any small group of individuals with scarce resources to build and sustain an online community within approximately two years. We provide a discussion on the potential impact of the proposed framework for global health research collaborations.","lang":"eng"}],"title":"A framework for grassroots research collaboration in machine learning and global health","author":[{"orcid":"0000-0002-4809-5059","full_name":"Currin, Christopher","last_name":"Currin","first_name":"Christopher","id":"e8321fc5-3091-11eb-8a53-83f309a11ac9"},{"full_name":"Asiedu , Mercy Nyamewaa","first_name":"Mercy Nyamewaa","last_name":"Asiedu "},{"last_name":"Fourie","first_name":"Chris","full_name":"Fourie, Chris"},{"last_name":"Rosman","first_name":"Benjamin","full_name":"Rosman, Benjamin"},{"first_name":"Houcemeddine","last_name":"Turki","full_name":"Turki, Houcemeddine"},{"full_name":"Lambebo Tonja, Atnafu","last_name":"Lambebo Tonja","first_name":"Atnafu"},{"full_name":"Abbott, Jade","last_name":"Abbott","first_name":"Jade"},{"full_name":"Ajala, Marvellous","first_name":"Marvellous","last_name":"Ajala"},{"last_name":"Adedayo","first_name":"Sadiq Adewale","full_name":"Adedayo, Sadiq Adewale"},{"full_name":"Emezue, Chris Chinenye","last_name":"Emezue","first_name":"Chris Chinenye"},{"full_name":"Machangara, Daphne","last_name":"Machangara","first_name":"Daphne"}],"oa_version":"Published Version"},{"scopus_import":"1","external_id":{"isi":["000906607900001"],"arxiv":["2208.11591"]},"intvolume":"        62","oa_version":"Preprint","date_created":"2024-01-08T13:19:14Z","volume":62,"article_type":"original","related_material":{"record":[{"relation":"dissertation_contains","id":"20798","status":"public"}]},"abstract":[{"lang":"eng","text":"Proper operation of electro-optic I/Q modulators relies on precise adjustment and control of the relative phase biases between the modulator’s internal interferometer arms. We present an all-analog phase bias locking scheme where error signals are obtained from the beat between the optical carrier and optical tones generated by an auxiliary 2 MHz 𝑅𝐹 tone to lock the phases of all three involved interferometers for operation up to 10 GHz. With the developed method, we demonstrate an I/Q modulator in carrier-suppressed single-sideband mode, where the suppressed carrier and sideband are locked at optical power levels <−27dB\r\n relative to the transmitted sideband. We describe a simple analytical model for calculating the error signals and detail the implementation of the electronic circuitry for the implementation of the method."}],"publication_status":"published","status":"public","doi":"10.1364/ao.474118","department":[{"_id":"OnHo"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","day":"01","issue":"1","keyword":["Atomic and Molecular Physics","and Optics","Engineering (miscellaneous)","Electrical and Electronic Engineering"],"oa":1,"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2208.11591","open_access":"1"}],"publication":"Applied Optics","article_processing_charge":"No","publication_identifier":{"issn":["1559-128X"],"eissn":["2155-3165"]},"quality_controlled":"1","isi":1,"arxiv":1,"title":"Analog stabilization of an electro-optic I/Q modulator with an auxiliary modulation tone","author":[{"orcid":"0000-0002-5869-1604","full_name":"Wald, Sebastian","last_name":"Wald","first_name":"Sebastian","id":"133F200A-B015-11E9-AD41-0EDAE5697425"},{"last_name":"Diorico","id":"2E054C4C-F248-11E8-B48F-1D18A9856A87","first_name":"Fritz R","full_name":"Diorico, Fritz R","orcid":"0000-0002-4947-8924"},{"orcid":"0000-0002-2031-204X","full_name":"Hosten, Onur","id":"4C02D85E-F248-11E8-B48F-1D18A9856A87","first_name":"Onur","last_name":"Hosten"}],"date_published":"2023-01-01T00:00:00Z","type":"journal_article","publisher":"Optica Publishing Group","corr_author":"1","language":[{"iso":"eng"}],"month":"01","_id":"14759","date_updated":"2026-06-18T22:30:04Z","page":"1-7","citation":{"chicago":"Wald, Sebastian, Fritz R Diorico, and Onur Hosten. “Analog Stabilization of an Electro-Optic I/Q Modulator with an Auxiliary Modulation Tone.” <i>Applied Optics</i>. Optica Publishing Group, 2023. <a href=\"https://doi.org/10.1364/ao.474118\">https://doi.org/10.1364/ao.474118</a>.","ista":"Wald S, Diorico FR, Hosten O. 2023. Analog stabilization of an electro-optic I/Q modulator with an auxiliary modulation tone. Applied Optics. 62(1), 1–7.","apa":"Wald, S., Diorico, F. R., &#38; Hosten, O. (2023). Analog stabilization of an electro-optic I/Q modulator with an auxiliary modulation tone. <i>Applied Optics</i>. Optica Publishing Group. <a href=\"https://doi.org/10.1364/ao.474118\">https://doi.org/10.1364/ao.474118</a>","short":"S. Wald, F.R. Diorico, O. Hosten, Applied Optics 62 (2023) 1–7.","ieee":"S. Wald, F. R. Diorico, and O. Hosten, “Analog stabilization of an electro-optic I/Q modulator with an auxiliary modulation tone,” <i>Applied Optics</i>, vol. 62, no. 1. Optica Publishing Group, pp. 1–7, 2023.","mla":"Wald, Sebastian, et al. “Analog Stabilization of an Electro-Optic I/Q Modulator with an Auxiliary Modulation Tone.” <i>Applied Optics</i>, vol. 62, no. 1, Optica Publishing Group, 2023, pp. 1–7, doi:<a href=\"https://doi.org/10.1364/ao.474118\">10.1364/ao.474118</a>.","ama":"Wald S, Diorico FR, Hosten O. Analog stabilization of an electro-optic I/Q modulator with an auxiliary modulation tone. <i>Applied Optics</i>. 2023;62(1):1-7. doi:<a href=\"https://doi.org/10.1364/ao.474118\">10.1364/ao.474118</a>"},"acknowledgement":"We thank Jakob Vorlaufer for technical contributions and Vyacheslav Li and Sofia Agafonova for comments on the manuscript.","year":"2023"}]