[{"month":"06","date_published":"2023-06-06T00:00:00Z","language":[{"iso":"eng"}],"date_updated":"2023-07-17T08:43:19Z","day":"06","license":"https://creativecommons.org/licenses/by/4.0/","article_number":"116","ddc":["000"],"publication_identifier":{"eissn":["2475-1421"]},"_id":"13179","quality_controlled":"1","article_processing_charge":"No","type":"journal_article","scopus_import":"1","has_accepted_license":"1","volume":7,"publisher":"Association for Computing Machinery ","author":[{"first_name":"Nikita","full_name":"Koval, Nikita","id":"2F4DB10C-F248-11E8-B48F-1D18A9856A87","last_name":"Koval"},{"first_name":"Dmitry","full_name":"Khalanskiy, Dmitry","last_name":"Khalanskiy"},{"orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh"}],"publication":"Proceedings of the ACM on Programming Languages","intvolume":" 7","year":"2023","publication_status":"published","department":[{"_id":"DaAl"}],"status":"public","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"oa_version":"Published Version","title":"CQS: A formally-verified framework for fair and abortable synchronization","date_created":"2023-07-02T22:00:43Z","citation":{"short":"N. Koval, D. Khalanskiy, D.-A. Alistarh, Proceedings of the ACM on Programming Languages 7 (2023).","mla":"Koval, Nikita, et al. “CQS: A Formally-Verified Framework for Fair and Abortable Synchronization.” Proceedings of the ACM on Programming Languages, vol. 7, 116, Association for Computing Machinery , 2023, doi:10.1145/3591230.","ama":"Koval N, Khalanskiy D, Alistarh D-A. CQS: A formally-verified framework for fair and abortable synchronization. Proceedings of the ACM on Programming Languages. 2023;7. doi:10.1145/3591230","ieee":"N. Koval, D. Khalanskiy, and D.-A. Alistarh, “CQS: A formally-verified framework for fair and abortable synchronization,” Proceedings of the ACM on Programming Languages, vol. 7. Association for Computing Machinery , 2023.","apa":"Koval, N., Khalanskiy, D., & Alistarh, D.-A. (2023). CQS: A formally-verified framework for fair and abortable synchronization. Proceedings of the ACM on Programming Languages. Association for Computing Machinery . https://doi.org/10.1145/3591230","ista":"Koval N, Khalanskiy D, Alistarh D-A. 2023. CQS: A formally-verified framework for fair and abortable synchronization. Proceedings of the ACM on Programming Languages. 7, 116.","chicago":"Koval, Nikita, Dmitry Khalanskiy, and Dan-Adrian Alistarh. “CQS: A Formally-Verified Framework for Fair and Abortable Synchronization.” Proceedings of the ACM on Programming Languages. Association for Computing Machinery , 2023. https://doi.org/10.1145/3591230."},"file":[{"content_type":"application/pdf","success":1,"date_updated":"2023-07-03T13:09:39Z","creator":"alisjak","access_level":"open_access","file_name":"2023_ACMProgram.Lang._Koval.pdf","relation":"main_file","date_created":"2023-07-03T13:09:39Z","file_size":1266773,"checksum":"5dba6e73f0ed79adbdae14d165bc2f68","file_id":"13187"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Writing concurrent code that is both correct and efficient is notoriously difficult. Thus, programmers often prefer to use synchronization abstractions, which render code simpler and easier to reason about. Despite a wealth of work on this topic, there is still a gap between the rich semantics provided by synchronization abstractions in modern programming languages—specifically, fair FIFO ordering of synchronization requests and support for abortable operations—and frameworks for implementing it correctly and efficiently. Supporting such semantics is critical given the rising popularity of constructs for asynchronous programming, such as coroutines, which abort frequently and are cheaper to suspend and resume compared to native threads.\r\n\r\nThis paper introduces a new framework called CancellableQueueSynchronizer (CQS), which enables simple yet efficient implementations of a wide range of fair and abortable synchronization primitives: mutexes, semaphores, barriers, count-down latches, and blocking pools. Our main contribution is algorithmic, as implementing both fairness and abortability efficiently at this level of generality is non-trivial. Importantly, all our algorithms, including the CQS framework and the primitives built on top of it, come with formal proofs in the Iris framework for Coq for many of their properties. These proofs are modular, so it is easy to show correctness for new primitives implemented on top of CQS. From a practical perspective, implementation of CQS for native threads on the JVM improves throughput by up to two orders of magnitude over Java’s AbstractQueuedSynchronizer, the only practical abstraction offering similar semantics. Further, we successfully integrated CQS as a core component of the popular Kotlin Coroutines library, validating the framework’s practical impact and expressiveness in a real-world environment. In sum, CancellableQueueSynchronizer is the first framework to combine expressiveness with formal guarantees and solid practical performance. Our approach should be extensible to other languages and families of synchronization primitives."}],"doi":"10.1145/3591230","file_date_updated":"2023-07-03T13:09:39Z","oa":1,"article_type":"original"},{"article_processing_charge":"No","quality_controlled":"1","_id":"13180","publication_identifier":{"eissn":["1944-4184"],"issn":["1944-4176"]},"author":[{"first_name":"Timothy D","orcid":"0000-0002-8314-0177","last_name":"Browning","id":"35827D50-F248-11E8-B48F-1D18A9856A87","full_name":"Browning, Timothy D"},{"first_name":"Julian","last_name":"Lyczak","id":"3572849A-F248-11E8-B48F-1D18A9856A87","full_name":"Lyczak, Julian"},{"full_name":"Sarapin, Roman","last_name":"Sarapin","first_name":"Roman"}],"publisher":"Mathematical Sciences Publishers","volume":16,"scopus_import":"1","type":"journal_article","language":[{"iso":"eng"}],"external_id":{"arxiv":["2203.06881"]},"date_published":"2023-05-26T00:00:00Z","month":"05","day":"26","date_updated":"2023-07-17T08:39:19Z","citation":{"ama":"Browning TD, Lyczak J, Sarapin R. Local solubility for a family of quadrics over a split quadric surface. Involve. 2023;16(2):331-342. doi:10.2140/involve.2023.16.331","short":"T.D. Browning, J. Lyczak, R. Sarapin, Involve 16 (2023) 331–342.","mla":"Browning, Timothy D., et al. “Local Solubility for a Family of Quadrics over a Split Quadric Surface.” Involve, vol. 16, no. 2, Mathematical Sciences Publishers, 2023, pp. 331–42, doi:10.2140/involve.2023.16.331.","ista":"Browning TD, Lyczak J, Sarapin R. 2023. Local solubility for a family of quadrics over a split quadric surface. Involve. 16(2), 331–342.","chicago":"Browning, Timothy D, Julian Lyczak, and Roman Sarapin. “Local Solubility for a Family of Quadrics over a Split Quadric Surface.” Involve. Mathematical Sciences Publishers, 2023. https://doi.org/10.2140/involve.2023.16.331.","ieee":"T. D. Browning, J. Lyczak, and R. Sarapin, “Local solubility for a family of quadrics over a split quadric surface,” Involve, vol. 16, no. 2. Mathematical Sciences Publishers, pp. 331–342, 2023.","apa":"Browning, T. D., Lyczak, J., & Sarapin, R. (2023). Local solubility for a family of quadrics over a split quadric surface. Involve. Mathematical Sciences Publishers. https://doi.org/10.2140/involve.2023.16.331"},"title":"Local solubility for a family of quadrics over a split quadric surface","date_created":"2023-07-02T22:00:43Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2203.06881"}],"oa_version":"Preprint","oa":1,"article_type":"original","page":"331-342","doi":"10.2140/involve.2023.16.331","abstract":[{"lang":"eng","text":"We study the density of everywhere locally soluble diagonal quadric surfaces, parameterised by rational points that lie on a split quadric surface"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"2","intvolume":" 16","publication":"Involve","department":[{"_id":"TiBr"}],"status":"public","publication_status":"published","year":"2023"},{"volume":13904,"scopus_import":"1","type":"conference","author":[{"first_name":"Da Wei","full_name":"Zheng, Da Wei","last_name":"Zheng"},{"orcid":"0000-0002-5008-6530","first_name":"Monika H","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger"}],"publisher":"Springer Nature","_id":"13236","publication_identifier":{"issn":["0302-9743"],"isbn":["9783031327254"],"eissn":["1611-3349"]},"article_processing_charge":"No","acknowledgement":"The first author thanks to Chandra Chekuri for useful discussions about this paper. 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. 101019564 “The Design of Modern Fully Dynamic Data Structures (MoDynStruct)” and from the Austrian Science Fund (FWF) project “Fast Algorithms for a Reactive Network Layer (ReactNet)”, P 33775-N, with additional funding from the netidee SCIENCE Stiftung, 2020–2024.","quality_controlled":"1","date_updated":"2023-07-18T07:08:51Z","day":"22","month":"05","conference":{"name":"IPCO: Integer Programming and Combinatorial Optimization","start_date":"2023-06-21","end_date":"2023-06-23","location":"Madison, WI, United States"},"language":[{"iso":"eng"}],"external_id":{"arxiv":["2301.09217"]},"date_published":"2023-05-22T00:00:00Z","doi":"10.1007/978-3-031-32726-1_32","abstract":[{"lang":"eng","text":"We present an auction algorithm using multiplicative instead of constant weight updates to compute a (1−ε)-approximate maximum weight matching (MWM) in a bipartite graph with n vertices and m edges in time O(mε−1log(ε−1)), matching the running time of the linear-time approximation algorithm of Duan and Pettie [JACM ’14]. Our algorithm is very simple and it can be extended to give a dynamic data structure that maintains a (1−ε)-approximate maximum weight matching under (1) one-sided vertex deletions (with incident edges) and (2) one-sided vertex insertions (with incident edges sorted by weight) to the other side. The total time time used is O(mε−1log(ε−1)), where m is the sum of the number of initially existing and inserted edges."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"name":"The design and evaluation of modern fully dynamic data structures","grant_number":"101019564","call_identifier":"H2020","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62"},{"_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","name":"Fast Algorithms for a Reactive Network Layer","grant_number":"P33775 "}],"oa":1,"page":"453-465","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2301.09217"}],"ec_funded":1,"oa_version":"Preprint","citation":{"ista":"Zheng DW, Henzinger MH. 2023. Multiplicative auction algorithm for approximate maximum weight bipartite matching. International Conference on Integer Programming and Combinatorial Optimization. IPCO: Integer Programming and Combinatorial Optimization, LNCS, vol. 13904, 453–465.","chicago":"Zheng, Da Wei, and Monika H Henzinger. “Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite Matching.” In International Conference on Integer Programming and Combinatorial Optimization, 13904:453–65. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-32726-1_32.","ieee":"D. W. Zheng and M. H. Henzinger, “Multiplicative auction algorithm for approximate maximum weight bipartite matching,” in International Conference on Integer Programming and Combinatorial Optimization, Madison, WI, United States, 2023, vol. 13904, pp. 453–465.","apa":"Zheng, D. W., & Henzinger, M. H. (2023). Multiplicative auction algorithm for approximate maximum weight bipartite matching. In International Conference on Integer Programming and Combinatorial Optimization (Vol. 13904, pp. 453–465). Madison, WI, United States: Springer Nature. https://doi.org/10.1007/978-3-031-32726-1_32","ama":"Zheng DW, Henzinger MH. Multiplicative auction algorithm for approximate maximum weight bipartite matching. In: International Conference on Integer Programming and Combinatorial Optimization. Vol 13904. Springer Nature; 2023:453-465. doi:10.1007/978-3-031-32726-1_32","short":"D.W. Zheng, M.H. Henzinger, in:, International Conference on Integer Programming and Combinatorial Optimization, Springer Nature, 2023, pp. 453–465.","mla":"Zheng, Da Wei, and Monika H. Henzinger. “Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite Matching.” International Conference on Integer Programming and Combinatorial Optimization, vol. 13904, Springer Nature, 2023, pp. 453–65, doi:10.1007/978-3-031-32726-1_32."},"alternative_title":["LNCS"],"date_created":"2023-07-16T22:01:11Z","title":"Multiplicative auction algorithm for approximate maximum weight bipartite matching","year":"2023","status":"public","department":[{"_id":"MoHe"}],"publication_status":"published","intvolume":" 13904","publication":"International Conference on Integer Programming and Combinatorial Optimization"},{"publication":"ASHPC23 - Austrian-Slovenian HPC Meeting 2023","month":"07","conference":{"location":"Maribor, Slovenia","name":"ASHPC: Austrian-Slovenian HPC Meeting","end_date":"2023-06-15","start_date":"2023-06-12"},"language":[{"iso":"eng"}],"date_published":"2023-07-01T00:00:00Z","year":"2023","date_updated":"2023-07-18T09:32:16Z","department":[{"_id":"ScienComp"}],"status":"public","day":"01","publication_status":"accepted","_id":"13162","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"ddc":["000"],"oa_version":"Submitted Version","citation":{"mla":"Elefante, Stefano, et al. “Cryo-EM Software Packages: A Sys-Admins Point of View.” ASHPC23 - Austrian-Slovenian HPC Meeting 2023, EuroCC, pp. 42–42.","short":"S. Elefante, S. Stadlbauer, M.F. Alexander, A. Schlögl, in:, ASHPC23 - Austrian-Slovenian HPC Meeting 2023, EuroCC, n.d., pp. 42–42.","ama":"Elefante S, Stadlbauer S, Alexander MF, Schlögl A. Cryo-EM software packages: A sys-admins point of view. In: ASHPC23 - Austrian-Slovenian HPC Meeting 2023. EuroCC; :42-42.","ieee":"S. Elefante, S. Stadlbauer, M. F. Alexander, and A. Schlögl, “Cryo-EM software packages: A sys-admins point of view,” in ASHPC23 - Austrian-Slovenian HPC Meeting 2023, Maribor, Slovenia, pp. 42–42.","apa":"Elefante, S., Stadlbauer, S., Alexander, M. F., & Schlögl, A. (n.d.). Cryo-EM software packages: A sys-admins point of view. In ASHPC23 - Austrian-Slovenian HPC Meeting 2023 (pp. 42–42). Maribor, Slovenia: EuroCC.","chicago":"Elefante, Stefano, Stephan Stadlbauer, Michael F Alexander, and Alois Schlögl. “Cryo-EM Software Packages: A Sys-Admins Point of View.” In ASHPC23 - Austrian-Slovenian HPC Meeting 2023, 42–42. EuroCC, n.d.","ista":"Elefante S, Stadlbauer S, Alexander MF, Schlögl A. Cryo-EM software packages: A sys-admins point of view. ASHPC23 - Austrian-Slovenian HPC Meeting 2023. ASHPC: Austrian-Slovenian HPC Meeting, 42–42."},"article_processing_charge":"No","quality_controlled":"1","title":"Cryo-EM software packages: A sys-admins point of view","date_created":"2023-06-23T11:03:18Z","has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2023-07-18T09:28:30Z","type":"conference_abstract","file":[{"file_id":"13250","checksum":"0ab6173cd5c5634ed773cd37ff012681","date_created":"2023-07-18T09:28:30Z","file_size":380354,"relation":"main_file","access_level":"open_access","file_name":"2023_ASHPC_Elefante.pdf","creator":"dernst","date_updated":"2023-07-18T09:28:30Z","success":1,"content_type":"application/pdf"}],"publisher":"EuroCC","oa":1,"author":[{"last_name":"Elefante","full_name":"Elefante, Stefano","id":"490F40CE-F248-11E8-B48F-1D18A9856A87","first_name":"Stefano"},{"last_name":"Stadlbauer","full_name":"Stadlbauer, Stephan","id":"4D0BC184-F248-11E8-B48F-1D18A9856A87","first_name":"Stephan"},{"first_name":"Michael F","last_name":"Alexander","id":"3A02A8FA-F248-11E8-B48F-1D18A9856A87","full_name":"Alexander, Michael F"},{"orcid":"0000-0002-5621-8100","first_name":"Alois","full_name":"Schlögl, Alois","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","last_name":"Schlögl"}],"page":"42-42"},{"language":[{"iso":"eng"}],"conference":{"location":"Maribor, Slovenia","end_date":"2023-06-15","start_date":"2023-06-13","name":"ASHPC: Austrian-Slovenian HPC Meeting"},"date_published":"2023-07-01T00:00:00Z","month":"07","day":"01","date_updated":"2023-07-18T09:30:54Z","article_processing_charge":"No","acknowledgement":"Thanks to Jesse Hansen for his suggestions on improving the abstract.","quality_controlled":"1","_id":"13161","ddc":["000"],"publisher":"EuroCC","author":[{"orcid":"0000-0002-5621-8100","first_name":"Alois","full_name":"Schlögl, Alois","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","last_name":"Schlögl"},{"last_name":"Elefante","id":"490F40CE-F248-11E8-B48F-1D18A9856A87","full_name":"Elefante, Stefano","first_name":"Stefano"},{"id":"3661B498-F248-11E8-B48F-1D18A9856A87","full_name":"Hodirnau, Victor-Valentin","last_name":"Hodirnau","first_name":"Victor-Valentin"}],"has_accepted_license":"1","type":"conference_abstract","publication":"ASHPC23 - Austrian-Slovenian HPC Meeting 2023","status":"public","department":[{"_id":"ScienComp"},{"_id":"EM-Fac"}],"publication_status":"inpress","year":"2023","citation":{"mla":"Schlögl, Alois, et al. “Running Windows-Applications on a Linux HPC Cluster Using WINE.” ASHPC23 - Austrian-Slovenian HPC Meeting 2023, EuroCC, pp. 59–59.","short":"A. Schlögl, S. Elefante, V.-V. Hodirnau, in:, ASHPC23 - Austrian-Slovenian HPC Meeting 2023, EuroCC, n.d., pp. 59–59.","ama":"Schlögl A, Elefante S, Hodirnau V-V. Running Windows-applications on a Linux HPC cluster using WINE. In: ASHPC23 - Austrian-Slovenian HPC Meeting 2023. EuroCC; :59-59.","ieee":"A. Schlögl, S. Elefante, and V.-V. Hodirnau, “Running Windows-applications on a Linux HPC cluster using WINE,” in ASHPC23 - Austrian-Slovenian HPC Meeting 2023, Maribor, Slovenia, pp. 59–59.","apa":"Schlögl, A., Elefante, S., & Hodirnau, V.-V. (n.d.). Running Windows-applications on a Linux HPC cluster using WINE. In ASHPC23 - Austrian-Slovenian HPC Meeting 2023 (pp. 59–59). Maribor, Slovenia: EuroCC.","chicago":"Schlögl, Alois, Stefano Elefante, and Victor-Valentin Hodirnau. “Running Windows-Applications on a Linux HPC Cluster Using WINE.” In ASHPC23 - Austrian-Slovenian HPC Meeting 2023, 59–59. EuroCC, n.d.","ista":"Schlögl A, Elefante S, Hodirnau V-V. Running Windows-applications on a Linux HPC cluster using WINE. ASHPC23 - Austrian-Slovenian HPC Meeting 2023. ASHPC: Austrian-Slovenian HPC Meeting, 59–59."},"date_created":"2023-06-23T11:01:23Z","title":"Running Windows-applications on a Linux HPC cluster using WINE","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"oa_version":"Submitted Version","oa":1,"page":"59-59","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2023-07-18T09:18:55Z","file":[{"file_id":"13249","checksum":"ec8e4295d54171032cdd1b01423eb4a6","relation":"main_file","date_created":"2023-07-18T09:18:55Z","file_size":316959,"creator":"dernst","file_name":"2023_ASHPC_Schloegl.pdf","access_level":"open_access","success":1,"date_updated":"2023-07-18T09:18:55Z","content_type":"application/pdf"}]},{"date_updated":"2023-07-19T06:59:19Z","day":"05","month":"07","isi":1,"external_id":{"arxiv":["2304.14198"],"isi":["001022811500001"]},"date_published":"2023-07-05T00:00:00Z","language":[{"iso":"eng"}],"type":"journal_article","volume":14,"has_accepted_license":"1","author":[{"last_name":"Wei","id":"0c5ff007-2600-11ee-b896-98bd8d663294","full_name":"Wei, Yujing","first_name":"Yujing","orcid":"0000-0001-8913-9719"},{"orcid":"0000-0003-0393-5525","first_name":"Artem","full_name":"Volosniev, Artem","id":"37D278BC-F248-11E8-B48F-1D18A9856A87","last_name":"Volosniev"},{"full_name":"Lorenc, Dusan","id":"40D8A3E6-F248-11E8-B48F-1D18A9856A87","last_name":"Lorenc","first_name":"Dusan"},{"last_name":"Zhumekenov","full_name":"Zhumekenov, Ayan A.","first_name":"Ayan A."},{"first_name":"Osman M.","full_name":"Bakr, Osman M.","last_name":"Bakr"},{"full_name":"Lemeshko, Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","last_name":"Lemeshko","orcid":"0000-0002-6990-7802","first_name":"Mikhail"},{"orcid":"0000-0002-7183-5203","first_name":"Zhanybek","id":"45E67A2A-F248-11E8-B48F-1D18A9856A87","full_name":"Alpichshev, Zhanybek","last_name":"Alpichshev"}],"publisher":"American Chemical Society","ddc":["530"],"_id":"13251","publication_identifier":{"eissn":["1948-7185"]},"quality_controlled":"1","article_processing_charge":"Yes (via OA deal)","acknowledgement":"We thank Bingqing Cheng and Hong-Zhou Ye for valuable discussions; Y.W.’s work at IST Austria was supported through ISTernship summer internship program funded by OeADGmbH; D.L. and Z.A. acknowledge support by IST Austria (ISTA); M.L. acknowledges support by the European Research Council (ERC) Starting Grant No. 801770 (ANGULON).\r\nA.A.Z. and O.M.B. acknowledge support by KAUST.","year":"2023","publication_status":"published","keyword":["General Materials Science","Physical and Theoretical Chemistry"],"department":[{"_id":"MiLe"},{"_id":"ZhAl"}],"status":"public","publication":"The Journal of Physical Chemistry Letters","intvolume":" 14","issue":"27","file":[{"file_id":"13253","checksum":"c0c040063f06a51b9c463adc504f1a23","relation":"main_file","date_created":"2023-07-19T06:55:39Z","file_size":2121252,"creator":"dernst","access_level":"open_access","file_name":"2023_JourPhysChemistry_Wei.pdf","success":1,"date_updated":"2023-07-19T06:55:39Z","content_type":"application/pdf"}],"project":[{"call_identifier":"H2020","grant_number":"801770","name":"Angulon: physics and applications of a new quasiparticle","_id":"2688CF98-B435-11E9-9278-68D0E5697425"}],"file_date_updated":"2023-07-19T06:55:39Z","doi":"10.1021/acs.jpclett.3c01158","abstract":[{"text":"A rotating organic cation and a dynamically disordered soft inorganic cage are the hallmark features of organic-inorganic lead-halide perovskites. Understanding the interplay between these two subsystems is a challenging problem, but it is this coupling that is widely conjectured to be responsible for the unique behavior of photocarriers in these materials. In this work, we use the fact that the polarizability of the organic cation strongly depends on the ambient electrostatic environment to put the molecule forward as a sensitive probe of the local crystal fields inside the lattice cell. We measure the average polarizability of the C/N–H bond stretching mode by means of infrared spectroscopy, which allows us to deduce the character of the motion of the cation molecule, find the magnitude of the local crystal field, and place an estimate on the strength of the hydrogen bond between the hydrogen and halide atoms. Our results pave the way for understanding electric fields in lead-halide perovskites using infrared bond spectroscopy.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"6309-6314","article_type":"original","oa":1,"oa_version":"Published Version","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"ec_funded":1,"title":"Bond polarizability as a probe of local crystal fields in hybrid lead-halide perovskites","date_created":"2023-07-18T11:13:17Z","citation":{"short":"Y. Wei, A. Volosniev, D. Lorenc, A.A. Zhumekenov, O.M. Bakr, M. Lemeshko, Z. Alpichshev, The Journal of Physical Chemistry Letters 14 (2023) 6309–6314.","mla":"Wei, Yujing, et al. “Bond Polarizability as a Probe of Local Crystal Fields in Hybrid Lead-Halide Perovskites.” The Journal of Physical Chemistry Letters, vol. 14, no. 27, American Chemical Society, 2023, pp. 6309–14, doi:10.1021/acs.jpclett.3c01158.","ama":"Wei Y, Volosniev A, Lorenc D, et al. Bond polarizability as a probe of local crystal fields in hybrid lead-halide perovskites. The Journal of Physical Chemistry Letters. 2023;14(27):6309-6314. doi:10.1021/acs.jpclett.3c01158","apa":"Wei, Y., Volosniev, A., Lorenc, D., Zhumekenov, A. A., Bakr, O. M., Lemeshko, M., & Alpichshev, Z. (2023). Bond polarizability as a probe of local crystal fields in hybrid lead-halide perovskites. The Journal of Physical Chemistry Letters. American Chemical Society. https://doi.org/10.1021/acs.jpclett.3c01158","ieee":"Y. Wei et al., “Bond polarizability as a probe of local crystal fields in hybrid lead-halide perovskites,” The Journal of Physical Chemistry Letters, vol. 14, no. 27. American Chemical Society, pp. 6309–6314, 2023.","chicago":"Wei, Yujing, Artem Volosniev, Dusan Lorenc, Ayan A. Zhumekenov, Osman M. Bakr, Mikhail Lemeshko, and Zhanybek Alpichshev. “Bond Polarizability as a Probe of Local Crystal Fields in Hybrid Lead-Halide Perovskites.” The Journal of Physical Chemistry Letters. American Chemical Society, 2023. https://doi.org/10.1021/acs.jpclett.3c01158.","ista":"Wei Y, Volosniev A, Lorenc D, Zhumekenov AA, Bakr OM, Lemeshko M, Alpichshev Z. 2023. Bond polarizability as a probe of local crystal fields in hybrid lead-halide perovskites. The Journal of Physical Chemistry Letters. 14(27), 6309–6314."}},{"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","author":[{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A","orcid":"0000-0002-2985-7724"},{"last_name":"Kebis","full_name":"Kebis, Pavol","first_name":"Pavol"},{"first_name":"Nicolas Adrien","last_name":"Mazzocchi","id":"b26baa86-3308-11ec-87b0-8990f34baa85","full_name":"Mazzocchi, Nicolas Adrien"},{"last_name":"Sarac","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","full_name":"Sarac, Naci E","first_name":"Naci E"}],"type":"conference","has_accepted_license":"1","volume":261,"quality_controlled":"1","article_processing_charge":"Yes","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093.\r\nWe thank Pierre Ganty for early discussions and the anonymous reviewers for their helpful comments.\r\n","ddc":["000"],"publication_identifier":{"eissn":["1868-8969"],"isbn":["9783959772785"]},"_id":"13292","day":"05","date_updated":"2023-07-31T08:38:38Z","date_published":"2023-07-05T00:00:00Z","external_id":{"arxiv":["2305.03447"]},"language":[{"iso":"eng"}],"conference":{"name":"ICALP: International Colloquium on Automata, Languages, and Programming","end_date":"2023-07-14","start_date":"2023-07-10","location":"Paderborn, Germany"},"month":"07","page":"129:1--129:20","oa":1,"file":[{"content_type":"application/pdf","success":1,"date_updated":"2023-07-24T15:11:05Z","creator":"esarac","file_name":"icalp23.pdf","access_level":"open_access","relation":"main_file","date_created":"2023-07-24T15:11:05Z","file_size":859379,"checksum":"5d4c8932ef3450615a53b9bb15d92eb2","file_id":"13293"}],"project":[{"grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"abstract":[{"text":"The operator precedence languages (OPLs) represent the largest known subclass of the context-free languages which enjoys all desirable closure and decidability properties. This includes the decidability of language inclusion, which is the ultimate verification problem. Operator precedence grammars, automata, and logics have been investigated and used, for example, to verify programs with arithmetic expressions and exceptions (both of which are deterministic pushdown but lie outside the scope of the visibly pushdown languages). In this paper, we complete the picture and give, for the first time, an algebraic characterization of the class of OPLs in the form of a syntactic congruence that has finitely many equivalence classes exactly for the operator precedence languages. This is a generalization of the celebrated Myhill-Nerode theorem for the regular languages to OPLs. As one of the consequences, we show that universality and language inclusion for nondeterministic operator precedence automata can be solved by an antichain algorithm. Antichain algorithms avoid determinization and complementation through an explicit subset construction, by leveraging a quasi-order on words, which allows the pruning of the search space for counterexample words without sacrificing completeness. Antichain algorithms can be implemented symbolically, and these implementations are today the best-performing algorithms in practice for the inclusion of finite automata. We give a generic construction of the quasi-order needed for antichain algorithms from a finite syntactic congruence. This yields the first antichain algorithm for OPLs, an algorithm that solves the ExpTime-hard language inclusion problem for OPLs in exponential time.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.4230/LIPIcs.ICALP.2023.129","file_date_updated":"2023-07-24T15:11:05Z","date_created":"2023-07-24T15:11:41Z","title":"Regular methods for operator precedence languages","citation":{"ama":"Henzinger TA, Kebis P, Mazzocchi NA, Sarac NE. Regular methods for operator precedence languages. In: 50th International Colloquium on Automata, Languages, and Programming. Vol 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023:129:1--129:20. doi:10.4230/LIPIcs.ICALP.2023.129","mla":"Henzinger, Thomas A., et al. “Regular Methods for Operator Precedence Languages.” 50th International Colloquium on Automata, Languages, and Programming, vol. 261, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, p. 129:1--129:20, doi:10.4230/LIPIcs.ICALP.2023.129.","short":"T.A. Henzinger, P. Kebis, N.A. Mazzocchi, N.E. Sarac, in:, 50th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, p. 129:1--129:20.","chicago":"Henzinger, Thomas A, Pavol Kebis, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Regular Methods for Operator Precedence Languages.” In 50th International Colloquium on Automata, Languages, and Programming, 261:129:1--129:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.ICALP.2023.129.","ista":"Henzinger TA, Kebis P, Mazzocchi NA, Sarac NE. 2023. Regular methods for operator precedence languages. 50th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 261, 129:1--129:20.","ieee":"T. A. Henzinger, P. Kebis, N. A. Mazzocchi, and N. E. Sarac, “Regular methods for operator precedence languages,” in 50th International Colloquium on Automata, Languages, and Programming, Paderborn, Germany, 2023, vol. 261, p. 129:1--129:20.","apa":"Henzinger, T. A., Kebis, P., Mazzocchi, N. A., & Sarac, N. E. (2023). Regular methods for operator precedence languages. In 50th International Colloquium on Automata, Languages, and Programming (Vol. 261, p. 129:1--129:20). Paderborn, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2023.129"},"alternative_title":["LIPIcs"],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"oa_version":"Published Version","ec_funded":1,"publication_status":"published","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"status":"public","year":"2023","publication":"50th International Colloquium on Automata, Languages, and Programming","intvolume":" 261"},{"type":"journal_article","volume":6,"has_accepted_license":"1","publisher":"SciPost Foundation","author":[{"full_name":"Tucci, Gennaro","last_name":"Tucci","first_name":"Gennaro"},{"last_name":"De Nicola","id":"42832B76-F248-11E8-B48F-1D18A9856A87","full_name":"De Nicola, Stefano","first_name":"Stefano","orcid":"0000-0002-4842-6671"},{"last_name":"Wald","full_name":"Wald, Sascha","first_name":"Sascha"},{"last_name":"Gambassi","full_name":"Gambassi, Andrea","first_name":"Andrea"}],"article_number":"029","ddc":["530"],"publication_identifier":{"issn":["2666-9366"]},"_id":"13277","quality_controlled":"1","acknowledgement":"S. De Nicola acknowledges funding from the Institute of Science and Technology Austria (ISTA), and from the European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie Grant Agreement No. 754411. S. De Nicola also acknowledges funding from the EPSRC Center for Doctoral Training in Cross-Disciplinary Approaches to NonEquilibrium Systems (CANES) under Grant EP/L015854/1. ","article_processing_charge":"No","date_updated":"2023-07-31T09:03:28Z","day":"14","month":"04","date_published":"2023-04-14T00:00:00Z","external_id":{"arxiv":["2211.01923"]},"language":[{"iso":"eng"}],"project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"}],"file":[{"success":1,"date_updated":"2023-07-31T09:02:27Z","content_type":"application/pdf","checksum":"b472bc82108747eda5d52adf9e2ac7f3","file_id":"13329","creator":"dernst","access_level":"open_access","file_name":"2023_SciPostPhysCore_Tucci.pdf","relation":"main_file","file_size":523236,"date_created":"2023-07-31T09:02:27Z"}],"abstract":[{"lang":"eng","text":"Recent experimental advances have inspired the development of theoretical tools to describe the non-equilibrium dynamics of quantum systems. Among them an exact representation of quantum spin systems in terms of classical stochastic processes has been proposed. Here we provide first steps towards the extension of this stochastic approach to bosonic systems by considering the one-dimensional quantum quartic oscillator. We show how to exactly parameterize the time evolution of this prototypical model via the dynamics of a set of classical variables. We interpret these variables as stochastic processes, which allows us to propose a novel way to numerically simulate the time evolution of the system. We benchmark our findings by considering analytically solvable limits and providing alternative derivations of known results."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.21468/scipostphyscore.6.2.029","file_date_updated":"2023-07-31T09:02:27Z","article_type":"original","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"oa_version":"Published Version","ec_funded":1,"date_created":"2023-07-24T10:47:46Z","title":"Stochastic representation of the quantum quartic oscillator","citation":{"chicago":"Tucci, Gennaro, Stefano De Nicola, Sascha Wald, and Andrea Gambassi. “Stochastic Representation of the Quantum Quartic Oscillator.” SciPost Physics Core. SciPost Foundation, 2023. https://doi.org/10.21468/scipostphyscore.6.2.029.","ista":"Tucci G, De Nicola S, Wald S, Gambassi A. 2023. Stochastic representation of the quantum quartic oscillator. SciPost Physics Core. 6(2), 029.","apa":"Tucci, G., De Nicola, S., Wald, S., & Gambassi, A. (2023). Stochastic representation of the quantum quartic oscillator. SciPost Physics Core. SciPost Foundation. https://doi.org/10.21468/scipostphyscore.6.2.029","ieee":"G. Tucci, S. De Nicola, S. Wald, and A. Gambassi, “Stochastic representation of the quantum quartic oscillator,” SciPost Physics Core, vol. 6, no. 2. SciPost Foundation, 2023.","ama":"Tucci G, De Nicola S, Wald S, Gambassi A. Stochastic representation of the quantum quartic oscillator. SciPost Physics Core. 2023;6(2). doi:10.21468/scipostphyscore.6.2.029","mla":"Tucci, Gennaro, et al. “Stochastic Representation of the Quantum Quartic Oscillator.” SciPost Physics Core, vol. 6, no. 2, 029, SciPost Foundation, 2023, doi:10.21468/scipostphyscore.6.2.029.","short":"G. Tucci, S. De Nicola, S. Wald, A. Gambassi, SciPost Physics Core 6 (2023)."},"year":"2023","publication_status":"published","department":[{"_id":"MaSe"}],"status":"public","keyword":["Statistical and Nonlinear Physics","Atomic and Molecular Physics","and Optics","Nuclear and High Energy Physics","Condensed Matter Physics"],"publication":"SciPost Physics Core","intvolume":" 6","issue":"2"},{"publisher":"SciPost Foundation","author":[{"last_name":"Rammelmüller","full_name":"Rammelmüller, Lukas","first_name":"Lukas"},{"full_name":"Huber, David","last_name":"Huber","first_name":"David"},{"id":"37D278BC-F248-11E8-B48F-1D18A9856A87","full_name":"Volosniev, Artem","last_name":"Volosniev","orcid":"0000-0003-0393-5525","first_name":"Artem"}],"has_accepted_license":"1","type":"journal_article","acknowledgement":"We acknowledge fruitful discussions with Hans-Werner Hammer and thank Gerhard Zürn and\r\nPietro Massignan for sending us their data. We thank Fabian Brauneis for beta-testing the\r\nprovided code-package, and comments on the manuscript.\r\nL.R. is supported by FP7/ERC Consolidator Grant QSIMCORR, No.\r\n771891, and the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under\r\nGermany’s Excellence Strategy –EXC–2111–390814868. A.G.V. acknowledges support\r\nby European Union’s Horizon 2020 research and innovation programme under the Marie\r\nSkłodowska-Curie Grant Agreement No. 754411.","article_processing_charge":"No","quality_controlled":"1","publication_identifier":{"issn":["2949-804X"]},"_id":"13276","article_number":"12","ddc":["530"],"day":"19","date_updated":"2023-07-31T09:16:02Z","language":[{"iso":"eng"}],"date_published":"2023-04-19T00:00:00Z","external_id":{"arxiv":["2202.04603"]},"month":"04","article_type":"original","oa":1,"abstract":[{"lang":"eng","text":"We introduce a generic and accessible implementation of an exact diagonalization method for studying few-fermion models. Our aim is to provide a testbed for the newcomers to the field as well as a stepping stone for trying out novel optimizations and approximations. This userguide consists of a description of the algorithm, and several examples in varying orders of sophistication. In particular, we exemplify our routine using an effective-interaction approach that fixes the low-energy physics. We benchmark this approach against the existing data, and show that it is able to deliver state-of-the-art numerical results at a significantly reduced computational cost."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.21468/scipostphyscodeb.12","file_date_updated":"2023-07-31T09:09:23Z","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"}],"file":[{"date_updated":"2023-07-31T09:09:23Z","success":1,"content_type":"application/pdf","checksum":"f583a70fe915d2208c803f5afb426daa","file_id":"13330","access_level":"open_access","file_name":"2023_SciPostPhysCodebase_Rammelmueller.pdf","creator":"dernst","date_created":"2023-07-31T09:09:23Z","file_size":551418,"relation":"main_file"}],"citation":{"ama":"Rammelmüller L, Huber D, Volosniev A. A modular implementation of an effective interaction approach for harmonically trapped fermions in 1D. SciPost Physics Codebases. 2023. doi:10.21468/scipostphyscodeb.12","mla":"Rammelmüller, Lukas, et al. “A Modular Implementation of an Effective Interaction Approach for Harmonically Trapped Fermions in 1D.” SciPost Physics Codebases, 12, SciPost Foundation, 2023, doi:10.21468/scipostphyscodeb.12.","short":"L. Rammelmüller, D. Huber, A. Volosniev, SciPost Physics Codebases (2023).","ista":"Rammelmüller L, Huber D, Volosniev A. 2023. A modular implementation of an effective interaction approach for harmonically trapped fermions in 1D. SciPost Physics Codebases., 12.","chicago":"Rammelmüller, Lukas, David Huber, and Artem Volosniev. “A Modular Implementation of an Effective Interaction Approach for Harmonically Trapped Fermions in 1D.” SciPost Physics Codebases. SciPost Foundation, 2023. https://doi.org/10.21468/scipostphyscodeb.12.","ieee":"L. Rammelmüller, D. Huber, and A. Volosniev, “A modular implementation of an effective interaction approach for harmonically trapped fermions in 1D,” SciPost Physics Codebases. SciPost Foundation, 2023.","apa":"Rammelmüller, L., Huber, D., & Volosniev, A. (2023). A modular implementation of an effective interaction approach for harmonically trapped fermions in 1D. SciPost Physics Codebases. SciPost Foundation. https://doi.org/10.21468/scipostphyscodeb.12"},"title":"A modular implementation of an effective interaction approach for harmonically trapped fermions in 1D","date_created":"2023-07-24T10:47:15Z","ec_funded":1,"related_material":{"record":[{"status":"public","id":"13275","relation":"research_data"}]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"oa_version":"Published Version","status":"public","department":[{"_id":"MiLe"}],"publication_status":"published","year":"2023","publication":"SciPost Physics Codebases"},{"month":"04","date_published":"2023-04-19T00:00:00Z","date_updated":"2023-07-31T09:16:02Z","year":"2023","status":"public","department":[{"_id":"MiLe"}],"day":"19","main_file_link":[{"url":"https://doi.org/10.21468/SciPostPhysCodeb.12-r1.0","open_access":"1"}],"_id":"13275","related_material":{"record":[{"status":"public","id":"13276","relation":"used_in_publication"}]},"ec_funded":1,"ddc":["530"],"oa_version":"Published Version","citation":{"ama":"Rammelmüller L, Huber D, Volosniev A. Codebase release 1.0 for FermiFCI. 2023. doi:10.21468/scipostphyscodeb.12-r1.0","mla":"Rammelmüller, Lukas, et al. Codebase Release 1.0 for FermiFCI. SciPost Foundation, 2023, doi:10.21468/scipostphyscodeb.12-r1.0.","short":"L. Rammelmüller, D. Huber, A. Volosniev, (2023).","chicago":"Rammelmüller, Lukas, David Huber, and Artem Volosniev. “Codebase Release 1.0 for FermiFCI.” SciPost Foundation, 2023. https://doi.org/10.21468/scipostphyscodeb.12-r1.0.","ista":"Rammelmüller L, Huber D, Volosniev A. 2023. Codebase release 1.0 for FermiFCI, SciPost Foundation, 10.21468/scipostphyscodeb.12-r1.0.","ieee":"L. Rammelmüller, D. Huber, and A. Volosniev, “Codebase release 1.0 for FermiFCI.” SciPost Foundation, 2023.","apa":"Rammelmüller, L., Huber, D., & Volosniev, A. (2023). Codebase release 1.0 for FermiFCI. SciPost Foundation. https://doi.org/10.21468/scipostphyscodeb.12-r1.0"},"article_processing_charge":"No","date_created":"2023-07-24T10:46:23Z","title":"Codebase release 1.0 for FermiFCI","doi":"10.21468/scipostphyscodeb.12-r1.0","abstract":[{"lang":"eng","text":"We introduce a generic and accessible implementation of an exact diagonalization method for studying few-fermion models. Our aim is to provide a testbed for the newcomers to the field as well as a stepping stone for trying out novel optimizations and approximations. This userguide consists of a description of the algorithm, and several examples in varying orders of sophistication. In particular, we exemplify our routine using an effective-interaction approach that fixes the low-energy physics. We benchmark this approach against the existing data, and show that it is able to deliver state-of-the-art numerical results at a significantly reduced computational cost."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"type":"research_data_reference","author":[{"first_name":"Lukas","last_name":"Rammelmüller","full_name":"Rammelmüller, Lukas"},{"full_name":"Huber, David","last_name":"Huber","first_name":"David"},{"full_name":"Volosniev, Artem","id":"37D278BC-F248-11E8-B48F-1D18A9856A87","last_name":"Volosniev","orcid":"0000-0003-0393-5525","first_name":"Artem"}],"oa":1,"publisher":"SciPost Foundation"},{"publication":"Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures","year":"2023","publication_status":"published","department":[{"_id":"DaAl"},{"_id":"GradSch"}],"status":"public","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"oa_version":"Published Version","title":"Provably-efficient and internally-deterministic parallel Union-Find","date_created":"2023-07-23T22:01:12Z","citation":{"ama":"Fedorov A, Hashemi D, Nadiradze G, Alistarh D-A. Provably-efficient and internally-deterministic parallel Union-Find. In: Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery; 2023:261-271. doi:10.1145/3558481.3591082","short":"A. Fedorov, D. Hashemi, G. Nadiradze, D.-A. Alistarh, in:, Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2023, pp. 261–271.","mla":"Fedorov, Alexander, et al. “Provably-Efficient and Internally-Deterministic Parallel Union-Find.” Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2023, pp. 261–71, doi:10.1145/3558481.3591082.","chicago":"Fedorov, Alexander, Diba Hashemi, Giorgi Nadiradze, and Dan-Adrian Alistarh. “Provably-Efficient and Internally-Deterministic Parallel Union-Find.” In Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 261–71. Association for Computing Machinery, 2023. https://doi.org/10.1145/3558481.3591082.","ista":"Fedorov A, Hashemi D, Nadiradze G, Alistarh D-A. 2023. Provably-efficient and internally-deterministic parallel Union-Find. Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures. SPAA: Symposium on Parallelism in Algorithms and Architectures, 261–271.","apa":"Fedorov, A., Hashemi, D., Nadiradze, G., & Alistarh, D.-A. (2023). Provably-efficient and internally-deterministic parallel Union-Find. In Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures (pp. 261–271). Orlando, FL, United States: Association for Computing Machinery. https://doi.org/10.1145/3558481.3591082","ieee":"A. Fedorov, D. Hashemi, G. Nadiradze, and D.-A. Alistarh, “Provably-efficient and internally-deterministic parallel Union-Find,” in Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, Orlando, FL, United States, 2023, pp. 261–271."},"file":[{"file_size":2087937,"date_created":"2023-07-31T10:53:08Z","relation":"main_file","file_name":"2023_SPAA_Fedorov.pdf","access_level":"open_access","creator":"dernst","file_id":"13334","checksum":"72e312aabf0c5248c99b5cd3a88e4c88","content_type":"application/pdf","date_updated":"2023-07-31T10:53:08Z","success":1}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"Determining the degree of inherent parallelism in classical sequential algorithms and leveraging it for fast parallel execution is a key topic in parallel computing, and detailed analyses are known for a wide range of classical algorithms. In this paper, we perform the first such analysis for the fundamental Union-Find problem, in which we are given a graph as a sequence of edges, and must maintain its connectivity structure under edge additions. We prove that classic sequential algorithms for this problem are well-parallelizable under reasonable assumptions, addressing a conjecture by [Blelloch, 2017]. More precisely, we show via a new potential argument that, under uniform random edge ordering, parallel union-find operations are unlikely to interfere: T concurrent threads processing the graph in parallel will encounter memory contention O(T2 · log |V| · log |E|) times in expectation, where |E| and |V| are the number of edges and nodes in the graph, respectively. We leverage this result to design a new parallel Union-Find algorithm that is both internally deterministic, i.e., its results are guaranteed to match those of a sequential execution, but also work-efficient and scalable, as long as the number of threads T is O(|E|1 over 3 - ε), for an arbitrarily small constant ε > 0, which holds for most large real-world graphs. We present lower bounds which show that our analysis is close to optimal, and experimental results suggesting that the performance cost of internal determinism is limited.","lang":"eng"}],"file_date_updated":"2023-07-31T10:53:08Z","doi":"10.1145/3558481.3591082","page":"261-271","oa":1,"month":"06","date_published":"2023-06-17T00:00:00Z","external_id":{"arxiv":["2304.09331"]},"language":[{"iso":"eng"}],"conference":{"location":"Orlando, FL, United States","start_date":"2023-06-17","end_date":"2023-06-19","name":"SPAA: Symposium on Parallelism in Algorithms and Architectures"},"date_updated":"2023-07-31T10:54:32Z","day":"17","ddc":["000"],"publication_identifier":{"isbn":["9781450395458"]},"_id":"13262","quality_controlled":"1","article_processing_charge":"Yes (in subscription journal)","scopus_import":"1","type":"conference","has_accepted_license":"1","publisher":"Association for Computing Machinery","author":[{"first_name":"Alexander","full_name":"Fedorov, Alexander","id":"2e711909-896a-11ed-bdf8-eb0f5a2984c6","last_name":"Fedorov"},{"full_name":"Hashemi, Diba","id":"ed9595ea-2f8f-11ee-ba95-d2b546540783","last_name":"Hashemi","first_name":"Diba"},{"full_name":"Nadiradze, Giorgi","id":"3279A00C-F248-11E8-B48F-1D18A9856A87","last_name":"Nadiradze","first_name":"Giorgi"},{"orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh"}]},{"issue":"2","publication":"Evolutionary Applications","intvolume":" 16","publication_status":"published","department":[{"_id":"NiBa"},{"_id":"BeVi"}],"status":"public","year":"2023","date_created":"2022-07-03T22:01:33Z","title":"Ten years of demographic modelling of divergence and speciation in the sea","citation":{"short":"A. De Jode, A. Le Moan, K. Johannesson, R. Faria, S. Stankowski, A.M. Westram, R.K. Butlin, M. Rafajlović, C. Fraisse, Evolutionary Applications 16 (2023) 542–559.","mla":"De Jode, Aurélien, et al. “Ten Years of Demographic Modelling of Divergence and Speciation in the Sea.” Evolutionary Applications, vol. 16, no. 2, Wiley, 2023, pp. 542–59, doi:10.1111/eva.13428.","ama":"De Jode A, Le Moan A, Johannesson K, et al. Ten years of demographic modelling of divergence and speciation in the sea. Evolutionary Applications. 2023;16(2):542-559. doi:10.1111/eva.13428","ieee":"A. De Jode et al., “Ten years of demographic modelling of divergence and speciation in the sea,” Evolutionary Applications, vol. 16, no. 2. Wiley, pp. 542–559, 2023.","apa":"De Jode, A., Le Moan, A., Johannesson, K., Faria, R., Stankowski, S., Westram, A. M., … Fraisse, C. (2023). Ten years of demographic modelling of divergence and speciation in the sea. Evolutionary Applications. Wiley. https://doi.org/10.1111/eva.13428","ista":"De Jode A, Le Moan A, Johannesson K, Faria R, Stankowski S, Westram AM, Butlin RK, Rafajlović M, Fraisse C. 2023. Ten years of demographic modelling of divergence and speciation in the sea. Evolutionary Applications. 16(2), 542–559.","chicago":"De Jode, Aurélien, Alan Le Moan, Kerstin Johannesson, Rui Faria, Sean Stankowski, Anja M Westram, Roger K. Butlin, Marina Rafajlović, and Christelle Fraisse. “Ten Years of Demographic Modelling of Divergence and Speciation in the Sea.” Evolutionary Applications. Wiley, 2023. https://doi.org/10.1111/eva.13428."},"oa_version":"Published Version","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"page":"542-559","article_type":"original","oa":1,"file":[{"success":1,"date_updated":"2023-02-27T07:10:17Z","content_type":"application/pdf","file_id":"12685","checksum":"d4d6fa9ddf36643af994a6a757919afb","relation":"main_file","file_size":2269822,"date_created":"2023-02-27T07:10:17Z","creator":"dernst","file_name":"2023_EvolutionaryApplications_DeJode.pdf","access_level":"open_access"}],"file_date_updated":"2023-02-27T07:10:17Z","doi":"10.1111/eva.13428","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","abstract":[{"text":"Understanding population divergence that eventually leads to speciation is essential for evolutionary biology. High species diversity in the sea was regarded as a paradox when strict allopatry was considered necessary for most speciation events because geographical barriers seemed largely absent in the sea, and many marine species have high dispersal capacities. Combining genome-wide data with demographic modelling to infer the demographic history of divergence has introduced new ways to address this classical issue. These models assume an ancestral population that splits into two subpopulations diverging according to different scenarios that allow tests for periods of gene flow. Models can also test for heterogeneities in population sizes and migration rates along the genome to account, respectively, for background selection and selection against introgressed ancestry. To investigate how barriers to gene flow arise in the sea, we compiled studies modelling the demographic history of divergence in marine organisms and extracted preferred demographic scenarios together with estimates of demographic parameters. These studies show that geographical barriers to gene flow do exist in the sea but that divergence can also occur without strict isolation. Heterogeneity of gene flow was detected in most population pairs suggesting the predominance of semipermeable barriers during divergence. We found a weak positive relationship between the fraction of the genome experiencing reduced gene flow and levels of genome-wide differentiation. Furthermore, we found that the upper bound of the ‘grey zone of speciation’ for our dataset extended beyond that found before, implying that gene flow between diverging taxa is possible at higher levels of divergence than previously thought. Finally, we list recommendations for further strengthening the use of demographic modelling in speciation research. These include a more balanced representation of taxa, more consistent and comprehensive modelling, clear reporting of results and simulation studies to rule out nonbiological explanations for general results.","lang":"eng"}],"external_id":{"isi":["000815663700001"]},"date_published":"2023-02-01T00:00:00Z","language":[{"iso":"eng"}],"month":"02","isi":1,"day":"01","date_updated":"2023-08-01T12:25:44Z","quality_controlled":"1","acknowledgement":"We greatly thank all the corresponding authors of the studies that were included in our synthesis for the sharing of additional data: Thomas Broquet, Dmitry Filatov, Quentin Rougemont, Paolo Momigliano, Pierre-Alexandre Gagnaire, Carlos Prada, Ahmed Souissi, Michael Møller Hansen, Sylvie Lapègue, Joseph Di Battista, Michael Hellberg and Carlos Prada. RKB and ADJ were supported by the European Research Council. MR was supported by the Swedish Research Council Vetenskapsrådet (grant number 2021-05243; to MR) and Formas (grant number 2019-00882; to KJ and MR), and by additional grants from the European Research Council (to RKB) and Vetenskapsrådet (to KJ) through the Centre for Marine Evolutionary Biology (https://www.gu.se/en/cemeb-marine-evolutionary-biology).","article_processing_charge":"No","ddc":["576"],"_id":"11479","publication_identifier":{"eissn":["1752-4571"]},"author":[{"full_name":"De Jode, Aurélien","last_name":"De Jode","first_name":"Aurélien"},{"first_name":"Alan","full_name":"Le Moan, Alan","last_name":"Le Moan"},{"last_name":"Johannesson","full_name":"Johannesson, Kerstin","first_name":"Kerstin"},{"full_name":"Faria, Rui","last_name":"Faria","first_name":"Rui"},{"first_name":"Sean","full_name":"Stankowski, Sean","id":"43161670-5719-11EA-8025-FABC3DDC885E","last_name":"Stankowski"},{"last_name":"Westram","full_name":"Westram, Anja M","id":"3C147470-F248-11E8-B48F-1D18A9856A87","first_name":"Anja M","orcid":"0000-0003-1050-4969"},{"first_name":"Roger K.","last_name":"Butlin","full_name":"Butlin, Roger K."},{"last_name":"Rafajlović","full_name":"Rafajlović, Marina","first_name":"Marina"},{"id":"32DF5794-F248-11E8-B48F-1D18A9856A87","full_name":"Fraisse, Christelle","last_name":"Fraisse","orcid":"0000-0001-8441-5075","first_name":"Christelle"}],"publisher":"Wiley","type":"journal_article","scopus_import":"1","has_accepted_license":"1","volume":16},{"day":"10","date_updated":"2023-08-01T12:31:40Z","external_id":{"isi":["001003345000051"]},"date_published":"2023-01-10T00:00:00Z","language":[{"iso":"eng"}],"month":"01","isi":1,"author":[{"first_name":"Arturo","full_name":"Gómez, Arturo","last_name":"Gómez"},{"first_name":"Goncalo","last_name":"Oliveira","id":"58abbde8-f455-11eb-a497-98c8fd71b905","full_name":"Oliveira, Goncalo"}],"publisher":"Springer Nature","scopus_import":"1","type":"journal_article","volume":13,"has_accepted_license":"1","quality_controlled":"1","acknowledgement":"Gonçalo Oliveira is supported by the NOMIS Foundation, Fundação Serrapilheira 1812-27395, by CNPq grants 428959/2018-0 and 307475/2018-2, and by FAPERJ through the grant Jovem Cientista do Nosso Estado E-26/202.793/2019.","article_processing_charge":"No","ddc":["510"],"article_number":"468","_id":"12329","publication_identifier":{"eissn":["2045-2322"]},"publication_status":"published","status":"public","department":[{"_id":"TaHa"}],"year":"2023","publication":"Scientific Reports","intvolume":" 13","oa":1,"article_type":"original","file":[{"success":1,"date_updated":"2023-01-23T07:53:23Z","content_type":"application/pdf","checksum":"a8b83739f4a951e83e0b2a778f03b327","file_id":"12336","creator":"dernst","file_name":"2023_ScientificReports_Gomez.pdf","access_level":"open_access","relation":"main_file","date_created":"2023-01-23T07:53:23Z","file_size":2167792}],"doi":"10.1038/s41598-022-19827-9","file_date_updated":"2023-01-23T07:53:23Z","abstract":[{"lang":"eng","text":"In this article, we develop two independent and new approaches to model epidemic spread in a network. Contrary to the most studied models, those developed here allow for contacts with different probabilities of transmitting the disease (transmissibilities). We then examine each of these models using some mean field type approximations. The first model looks at the late-stage effects of an epidemic outbreak and allows for the computation of the probability that a given vertex was infected. This computation is based on a mean field approximation and only depends on the number of contacts and their transmissibilities. This approach shares many similarities with percolation models in networks. The second model we develop is a dynamic model which we analyze using a mean field approximation which highly reduces the dimensionality of the system. In particular, the original system which individually analyses each vertex of the network is reduced to one with as many equations as different transmissibilities. Perhaps the greatest contribution of this article is the observation that, in both these models, the existence and size of an epidemic outbreak are linked to the properties of a matrix which we call the R-matrix. This is a generalization of the basic reproduction number which more precisely characterizes the main routes of infection."}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","title":"New approaches to epidemic modeling on networks","date_created":"2023-01-22T23:00:55Z","citation":{"apa":"Gómez, A., & Oliveira, G. (2023). New approaches to epidemic modeling on networks. Scientific Reports. Springer Nature. https://doi.org/10.1038/s41598-022-19827-9","ieee":"A. Gómez and G. Oliveira, “New approaches to epidemic modeling on networks,” Scientific Reports, vol. 13. Springer Nature, 2023.","ista":"Gómez A, Oliveira G. 2023. New approaches to epidemic modeling on networks. Scientific Reports. 13, 468.","chicago":"Gómez, Arturo, and Goncalo Oliveira. “New Approaches to Epidemic Modeling on Networks.” Scientific Reports. Springer Nature, 2023. https://doi.org/10.1038/s41598-022-19827-9.","short":"A. Gómez, G. Oliveira, Scientific Reports 13 (2023).","mla":"Gómez, Arturo, and Goncalo Oliveira. “New Approaches to Epidemic Modeling on Networks.” Scientific Reports, vol. 13, 468, Springer Nature, 2023, doi:10.1038/s41598-022-19827-9.","ama":"Gómez A, Oliveira G. New approaches to epidemic modeling on networks. Scientific Reports. 2023;13. doi:10.1038/s41598-022-19827-9"},"oa_version":"Published Version","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"}},{"doi":"10.1093/imrn/rnac048","abstract":[{"lang":"eng","text":"We determine an asymptotic formula for the number of integral points of bounded height on a blow-up of P3 outside certain planes using universal torsors."}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","article_type":"original","oa":1,"page":"6780-6808","main_file_link":[{"url":"https://arxiv.org/abs/1901.08503","open_access":"1"}],"oa_version":"Preprint","citation":{"ista":"Wilsch FA. 2023. Integral points of bounded height on a log Fano threefold. International Mathematics Research Notices. 2023(8), 6780–6808.","chicago":"Wilsch, Florian Alexander. “Integral Points of Bounded Height on a Log Fano Threefold.” International Mathematics Research Notices. Oxford Academic, 2023. https://doi.org/10.1093/imrn/rnac048.","apa":"Wilsch, F. A. (2023). Integral points of bounded height on a log Fano threefold. International Mathematics Research Notices. Oxford Academic. https://doi.org/10.1093/imrn/rnac048","ieee":"F. A. Wilsch, “Integral points of bounded height on a log Fano threefold,” International Mathematics Research Notices, vol. 2023, no. 8. Oxford Academic, pp. 6780–6808, 2023.","ama":"Wilsch FA. Integral points of bounded height on a log Fano threefold. International Mathematics Research Notices. 2023;2023(8):6780-6808. doi:10.1093/imrn/rnac048","mla":"Wilsch, Florian Alexander. “Integral Points of Bounded Height on a Log Fano Threefold.” International Mathematics Research Notices, vol. 2023, no. 8, Oxford Academic, 2023, pp. 6780–808, doi:10.1093/imrn/rnac048.","short":"F.A. Wilsch, International Mathematics Research Notices 2023 (2023) 6780–6808."},"date_created":"2021-01-22T09:31:09Z","title":"Integral points of bounded height on a log Fano threefold","year":"2023","status":"public","department":[{"_id":"TiBr"}],"publication_status":"published","intvolume":" 2023","publication":"International Mathematics Research Notices","issue":"8","volume":2023,"type":"journal_article","author":[{"id":"560601DA-8D36-11E9-A136-7AC1E5697425","full_name":"Wilsch, Florian Alexander","last_name":"Wilsch","orcid":"0000-0001-7302-8256","first_name":"Florian Alexander"}],"publisher":"Oxford Academic","_id":"9034","publication_identifier":{"eissn":["1687-0247"],"issn":["1073-7928"]},"article_processing_charge":"No","acknowledgement":"This work was supported by the German Academic Exchange Service. Parts of this article were prepared at the Institut de Mathémathiques de Jussieu—Paris Rive Gauche. I wish to thank Antoine Chambert-Loir for his remarks and the institute for its hospitality, as well as the anonymous referee for several useful remarks and suggestions for improvements.","quality_controlled":"1","date_updated":"2023-08-01T12:23:55Z","day":"01","isi":1,"month":"04","language":[{"iso":"eng"}],"external_id":{"arxiv":["1901.08503"],"isi":["000773116000001"]},"date_published":"2023-04-01T00:00:00Z"},{"date_updated":"2023-08-01T12:39:58Z","day":"16","isi":1,"month":"03","language":[{"iso":"eng"}],"external_id":{"isi":["000961542100001"],"pmid":["PPR559293 "]},"date_published":"2023-03-16T00:00:00Z","volume":14,"has_accepted_license":"1","type":"journal_article","scopus_import":"1","author":[{"first_name":"Lumi","full_name":"Viljakainen, Lumi","last_name":"Viljakainen"},{"orcid":"0000-0002-3712-925X","first_name":"Matthias","full_name":"Fürst, Matthias","id":"393B1196-F248-11E8-B48F-1D18A9856A87","last_name":"Fürst"},{"first_name":"Anna V","full_name":"Grasse, Anna V","id":"406F989C-F248-11E8-B48F-1D18A9856A87","last_name":"Grasse"},{"first_name":"Jaana","full_name":"Jurvansuu, Jaana","last_name":"Jurvansuu"},{"orcid":"0000-0001-7425-2372","first_name":"Jinook","id":"403169A4-080F-11EA-9993-BF3F3DDC885E","full_name":"Oh, Jinook","last_name":"Oh"},{"first_name":"Lassi","full_name":"Tolonen, Lassi","last_name":"Tolonen"},{"first_name":"Thomas","full_name":"Eder, Thomas","last_name":"Eder"},{"last_name":"Rattei","full_name":"Rattei, Thomas","first_name":"Thomas"},{"first_name":"Sylvia","orcid":"0000-0002-2193-3868","last_name":"Cremer","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","full_name":"Cremer, Sylvia"}],"publisher":"Frontiers","_id":"12469","publication_identifier":{"eissn":["1664-302X"]},"article_number":"1119002","ddc":["570"],"pmid":1,"article_processing_charge":"Yes (via OA deal)","acknowledgement":"We thank D.J. Obbard for sharing the details of the dual RNA-seq/sRNA-seq approach, S.\r\nMetzler and R. Ferrigato for the photographs (Figure 1), M. Konrad, B. Casillas-Perez, C.D.\r\nPull and X. Espadaler for help with ant collection, and the Social Immunity Team at IST\r\nAustria, in particular J. Robb, A. Franschitz, E. Naderlinger, E. Dawson and B. Casillas-Perez\r\nfor support and comments on the manuscript. The study was funded by the Austrian Science\r\nFund (FWF; M02076-B25 to MAF) and the Academy of Finland (343022 to LV). ","quality_controlled":"1","year":"2023","department":[{"_id":"SyCr"}],"status":"public","publication_status":"published","intvolume":" 14","publication":"Frontiers in Microbiology","file_date_updated":"2023-04-17T07:49:09Z","doi":"10.3389/fmicb.2023.1119002","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","abstract":[{"lang":"eng","text":"Hosts can carry many viruses in their bodies, but not all of them cause disease. We studied ants as a social host to determine both their overall viral repertoire and the subset of actively infecting viruses across natural populations of three subfamilies: the Argentine ant (Linepithema humile, Dolichoderinae), the invasive garden ant (Lasius neglectus, Formicinae) and the red ant (Myrmica rubra, Myrmicinae). We used a dual sequencing strategy to reconstruct complete virus genomes by RNA-seq and to simultaneously determine the small interfering RNAs (siRNAs) by small RNA sequencing (sRNA-seq), which constitute the host antiviral RNAi immune response. This approach led to the discovery of 41 novel viruses in ants and revealed a host ant-specific RNAi response (21 vs. 22 nt siRNAs) in the different ant species. The efficiency of the RNAi response (sRNA/RNA read count ratio) depended on the virus and the respective ant species, but not its population. Overall, we found the highest virus abundance and diversity per population in Li. humile, followed by La. neglectus and M. rubra. Argentine ants also shared a high proportion of viruses between populations, whilst overlap was nearly absent in M. rubra. Only one of the 59 viruses was found to infect two of the ant species as hosts, revealing high host-specificity in active infections. In contrast, six viruses actively infected one ant species, but were found as contaminants only in the others. Disentangling spillover of disease-causing infection from non-infecting contamination across species is providing relevant information for disease ecology and ecosystem management."}],"file":[{"date_created":"2023-04-17T07:49:09Z","file_size":4866332,"relation":"main_file","access_level":"open_access","file_name":"2023_FrontMicrobiology_Viljakainen.pdf","creator":"dernst","file_id":"12843","checksum":"cd52292963acce1111634d9fac08c699","content_type":"application/pdf","date_updated":"2023-04-17T07:49:09Z","success":1}],"project":[{"call_identifier":"FWF","grant_number":"M02076","name":"Viral pathogens and social immunity in ants","_id":"25DF61D8-B435-11E9-9278-68D0E5697425"}],"oa":1,"article_type":"original","oa_version":"Published Version","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"citation":{"chicago":"Viljakainen, Lumi, Matthias Fürst, Anna V Grasse, Jaana Jurvansuu, Jinook Oh, Lassi Tolonen, Thomas Eder, Thomas Rattei, and Sylvia Cremer. “Antiviral Immune Response Reveals Host-Specific Virus Infections in Natural Ant Populations.” Frontiers in Microbiology. Frontiers, 2023. https://doi.org/10.3389/fmicb.2023.1119002.","ista":"Viljakainen L, Fürst M, Grasse AV, Jurvansuu J, Oh J, Tolonen L, Eder T, Rattei T, Cremer S. 2023. Antiviral immune response reveals host-specific virus infections in natural ant populations. Frontiers in Microbiology. 14, 1119002.","ieee":"L. Viljakainen et al., “Antiviral immune response reveals host-specific virus infections in natural ant populations,” Frontiers in Microbiology, vol. 14. Frontiers, 2023.","apa":"Viljakainen, L., Fürst, M., Grasse, A. V., Jurvansuu, J., Oh, J., Tolonen, L., … Cremer, S. (2023). Antiviral immune response reveals host-specific virus infections in natural ant populations. Frontiers in Microbiology. Frontiers. https://doi.org/10.3389/fmicb.2023.1119002","ama":"Viljakainen L, Fürst M, Grasse AV, et al. Antiviral immune response reveals host-specific virus infections in natural ant populations. Frontiers in Microbiology. 2023;14. doi:10.3389/fmicb.2023.1119002","short":"L. Viljakainen, M. Fürst, A.V. Grasse, J. Jurvansuu, J. Oh, L. Tolonen, T. Eder, T. Rattei, S. Cremer, Frontiers in Microbiology 14 (2023).","mla":"Viljakainen, Lumi, et al. “Antiviral Immune Response Reveals Host-Specific Virus Infections in Natural Ant Populations.” Frontiers in Microbiology, vol. 14, 1119002, Frontiers, 2023, doi:10.3389/fmicb.2023.1119002."},"title":"Antiviral immune response reveals host-specific virus infections in natural ant populations","date_created":"2023-01-31T08:13:40Z"},{"oa":1,"article_type":"original","page":"156-191","abstract":[{"lang":"eng","text":"We present criteria for establishing a triangulation of a manifold. Given a manifold M, a simplicial complex A, and a map H from the underlying space of A to M, our criteria are presented in local coordinate charts for M, and ensure that H is a homeomorphism. These criteria do not require a differentiable structure, or even an explicit metric on M. No Delaunay property of A is assumed. The result provides a triangulation guarantee for algorithms that construct a simplicial complex by working in local coordinate patches. Because the criteria are easily verified in such a setting, they are expected to be of general use."}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","file_date_updated":"2023-02-02T11:01:10Z","doi":"10.1007/s00454-022-00431-7","file":[{"checksum":"46352e0ee71e460848f88685ca852681","file_id":"12488","creator":"dernst","file_name":"2023_DiscreteCompGeometry_Boissonnat.pdf","access_level":"open_access","relation":"main_file","file_size":582850,"date_created":"2023-02-02T11:01:10Z","success":1,"date_updated":"2023-02-02T11:01:10Z","content_type":"application/pdf"}],"project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"},{"name":"Learning and triangulating manifolds via collapses","grant_number":"M03073","_id":"fc390959-9c52-11eb-aca3-afa58bd282b2"}],"citation":{"ama":"Boissonnat J-D, Dyer R, Ghosh A, Wintraecken M. Local criteria for triangulating general manifolds. Discrete & Computational Geometry. 2023;69:156-191. doi:10.1007/s00454-022-00431-7","short":"J.-D. Boissonnat, R. Dyer, A. Ghosh, M. Wintraecken, Discrete & Computational Geometry 69 (2023) 156–191.","mla":"Boissonnat, Jean-Daniel, et al. “Local Criteria for Triangulating General Manifolds.” Discrete & Computational Geometry, vol. 69, Springer Nature, 2023, pp. 156–91, doi:10.1007/s00454-022-00431-7.","ista":"Boissonnat J-D, Dyer R, Ghosh A, Wintraecken M. 2023. Local criteria for triangulating general manifolds. Discrete & Computational Geometry. 69, 156–191.","chicago":"Boissonnat, Jean-Daniel, Ramsay Dyer, Arijit Ghosh, and Mathijs Wintraecken. “Local Criteria for Triangulating General Manifolds.” Discrete & Computational Geometry. Springer Nature, 2023. https://doi.org/10.1007/s00454-022-00431-7.","ieee":"J.-D. Boissonnat, R. Dyer, A. Ghosh, and M. Wintraecken, “Local criteria for triangulating general manifolds,” Discrete & Computational Geometry, vol. 69. Springer Nature, pp. 156–191, 2023.","apa":"Boissonnat, J.-D., Dyer, R., Ghosh, A., & Wintraecken, M. (2023). Local criteria for triangulating general manifolds. Discrete & Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-022-00431-7"},"date_created":"2023-01-16T10:04:06Z","title":"Local criteria for triangulating general manifolds","ec_funded":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"oa_version":"Published Version","status":"public","department":[{"_id":"HeEd"}],"keyword":["Computational Theory and Mathematics","Discrete Mathematics and Combinatorics","Geometry and Topology","Theoretical Computer Science"],"publication_status":"published","year":"2023","intvolume":" 69","publication":"Discrete & Computational Geometry","publisher":"Springer Nature","author":[{"last_name":"Boissonnat","full_name":"Boissonnat, Jean-Daniel","first_name":"Jean-Daniel"},{"first_name":"Ramsay","full_name":"Dyer, Ramsay","last_name":"Dyer"},{"last_name":"Ghosh","full_name":"Ghosh, Arijit","first_name":"Arijit"},{"full_name":"Wintraecken, Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","last_name":"Wintraecken","orcid":"0000-0002-7472-2220","first_name":"Mathijs"}],"has_accepted_license":"1","volume":69,"scopus_import":"1","type":"journal_article","article_processing_charge":"No","acknowledgement":"This work has been funded by the European Research Council under the European Union’s ERC Grant Agreement number 339025 GUDHI (Algorithmic Foundations of Geometric Understanding in Higher Dimensions). Arijit Ghosh is supported by Ramanujan Fellowship (No. SB/S2/RJN-064/2015). Part of this work was done when Arijit Ghosh was a Researcher at Max-Planck-Institute for Informatics, Germany, supported by the IndoGerman Max Planck Center for Computer Science (IMPECS). Mathijs Wintraecken also received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754411 and the Austrian Science Fund (FWF): M-3073. A part of the results described in this paper were presented at SoCG 2018 and in [3]. \r\nOpen access funding provided by the Austrian Science Fund (FWF).","quality_controlled":"1","publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"_id":"12287","ddc":["510"],"day":"01","date_updated":"2023-08-01T12:47:32Z","language":[{"iso":"eng"}],"date_published":"2023-01-01T00:00:00Z","external_id":{"isi":["000862193600001"]},"isi":1,"month":"01"},{"intvolume":" 5","publication":"Nature Reviews Physics","keyword":["General Physics and Astronomy"],"status":"public","department":[{"_id":"BjHo"}],"publication_status":"published","year":"2023","citation":{"short":"B. Hof, Nature Reviews Physics 5 (2023) 62–72.","mla":"Hof, Björn. “Directed Percolation and the Transition to Turbulence.” Nature Reviews Physics, vol. 5, Springer Nature, 2023, pp. 62–72, doi:10.1038/s42254-022-00539-y.","ama":"Hof B. Directed percolation and the transition to turbulence. Nature Reviews Physics. 2023;5:62-72. doi:10.1038/s42254-022-00539-y","apa":"Hof, B. (2023). Directed percolation and the transition to turbulence. Nature Reviews Physics. Springer Nature. https://doi.org/10.1038/s42254-022-00539-y","ieee":"B. Hof, “Directed percolation and the transition to turbulence,” Nature Reviews Physics, vol. 5. Springer Nature, pp. 62–72, 2023.","ista":"Hof B. 2023. Directed percolation and the transition to turbulence. Nature Reviews Physics. 5, 62–72.","chicago":"Hof, Björn. “Directed Percolation and the Transition to Turbulence.” Nature Reviews Physics. Springer Nature, 2023. https://doi.org/10.1038/s42254-022-00539-y."},"title":"Directed percolation and the transition to turbulence","date_created":"2023-01-12T12:10:18Z","oa_version":"None","article_type":"original","page":"62-72","doi":"10.1038/s42254-022-00539-y","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","abstract":[{"lang":"eng","text":"It may come as a surprise that a phenomenon as ubiquitous and prominent as the transition from laminar to turbulent flow has resisted combined efforts by physicists, engineers and mathematicians, and remained unresolved for almost one and a half centuries. In recent years, various studies have proposed analogies to directed percolation, a well-known universality class in statistical mechanics, which describes a non-equilibrium phase transition from a fluctuating active phase into an absorbing state. It is this unlikely relation between the multiscale, high-dimensional dynamics that signify the transition process in virtually all flows of practical relevance, and the arguably most basic non-equilibrium phase transition, that so far has mainly been the subject of model studies, which I review in this Perspective."}],"language":[{"iso":"eng"}],"external_id":{"isi":["000890148700002"]},"date_published":"2023-01-01T00:00:00Z","isi":1,"month":"01","day":"01","date_updated":"2023-08-01T12:50:48Z","article_processing_charge":"No","quality_controlled":"1","_id":"12165","publication_identifier":{"eissn":["2522-5820"]},"author":[{"last_name":"Hof","full_name":"Hof, Björn","id":"3A374330-F248-11E8-B48F-1D18A9856A87","first_name":"Björn","orcid":"0000-0003-2057-2754"}],"publisher":"Springer Nature","volume":5,"scopus_import":"1","type":"journal_article"},{"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","abstract":[{"lang":"eng","text":"The actin cytoskeleton plays a key role in cell migration and cellular morphodynamics in most eukaryotes. The ability of the actin cytoskeleton to assemble and disassemble in a spatiotemporally controlled manner allows it to form higher-order structures, which can generate forces required for a cell to explore and navigate through its environment. It is regulated not only via a complex synergistic and competitive interplay between actin-binding proteins (ABP), but also by filament biochemistry and filament geometry. The lack of structural insights into how geometry and ABPs regulate the actin cytoskeleton limits our understanding of the molecular mechanisms that define actin cytoskeleton remodeling and, in turn, impact emerging cell migration characteristics. With the advent of cryo-electron microscopy (cryo-EM) and advanced computational methods, it is now possible to define these molecular mechanisms involving actin and its interactors at both atomic and ultra-structural levels in vitro and in cellulo. In this review, we will provide an overview of the available cryo-EM methods, applicable to further our understanding of the actin cytoskeleton, specifically in the context of cell migration. We will discuss how these methods have been employed to elucidate ABP- and geometry-defined regulatory mechanisms in initiating, maintaining, and disassembling cellular actin networks in migratory protrusions."}],"doi":"10.1042/bst20220221","file_date_updated":"2023-03-16T07:58:16Z","file":[{"creator":"dernst","access_level":"open_access","file_name":"2023_BioChemicalSocietyTransactions_Faessler.pdf","relation":"main_file","file_size":10045006,"date_created":"2023-03-16T07:58:16Z","checksum":"4e7069845e3dad22bb44fb71ec624c60","file_id":"12728","content_type":"application/pdf","success":1,"date_updated":"2023-03-16T07:58:16Z"}],"project":[{"name":"Structure and isoform diversity of the Arp2/3 complex","grant_number":"P33367","_id":"9B954C5C-BA93-11EA-9121-9846C619BF3A"}],"article_type":"original","oa":1,"page":"87-99","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"oa_version":"Published Version","citation":{"ama":"Fäßler F, Javoor M, Schur FK. Deciphering the molecular mechanisms of actin cytoskeleton regulation in cell migration using cryo-EM. Biochemical Society Transactions. 2023;51(1):87-99. doi:10.1042/bst20220221","short":"F. Fäßler, M. Javoor, F.K. Schur, Biochemical Society Transactions 51 (2023) 87–99.","mla":"Fäßler, Florian, et al. “Deciphering the Molecular Mechanisms of Actin Cytoskeleton Regulation in Cell Migration Using Cryo-EM.” Biochemical Society Transactions, vol. 51, no. 1, Portland Press, 2023, pp. 87–99, doi:10.1042/bst20220221.","ista":"Fäßler F, Javoor M, Schur FK. 2023. Deciphering the molecular mechanisms of actin cytoskeleton regulation in cell migration using cryo-EM. Biochemical Society Transactions. 51(1), 87–99.","chicago":"Fäßler, Florian, Manjunath Javoor, and Florian KM Schur. “Deciphering the Molecular Mechanisms of Actin Cytoskeleton Regulation in Cell Migration Using Cryo-EM.” Biochemical Society Transactions. Portland Press, 2023. https://doi.org/10.1042/bst20220221.","apa":"Fäßler, F., Javoor, M., & Schur, F. K. (2023). Deciphering the molecular mechanisms of actin cytoskeleton regulation in cell migration using cryo-EM. Biochemical Society Transactions. Portland Press. https://doi.org/10.1042/bst20220221","ieee":"F. Fäßler, M. Javoor, and F. K. Schur, “Deciphering the molecular mechanisms of actin cytoskeleton regulation in cell migration using cryo-EM,” Biochemical Society Transactions, vol. 51, no. 1. Portland Press, pp. 87–99, 2023."},"date_created":"2023-01-27T10:08:19Z","title":"Deciphering the molecular mechanisms of actin cytoskeleton regulation in cell migration using cryo-EM","year":"2023","department":[{"_id":"FlSc"}],"status":"public","keyword":["Biochemistry"],"publication_status":"published","intvolume":" 51","publication":"Biochemical Society Transactions","issue":"1","volume":51,"has_accepted_license":"1","scopus_import":"1","type":"journal_article","publisher":"Portland Press","author":[{"id":"404F5528-F248-11E8-B48F-1D18A9856A87","full_name":"Fäßler, Florian","last_name":"Fäßler","orcid":"0000-0001-7149-769X","first_name":"Florian"},{"id":"305ab18b-dc7d-11ea-9b2f-b58195228ea2","full_name":"Javoor, Manjunath","last_name":"Javoor","first_name":"Manjunath"},{"last_name":"Schur","full_name":"Schur, Florian KM","id":"48AD8942-F248-11E8-B48F-1D18A9856A87","first_name":"Florian KM","orcid":"0000-0003-4790-8078"}],"publication_identifier":{"eissn":["1470-8752"],"issn":["0300-5127"]},"_id":"12421","ddc":["570"],"article_processing_charge":"No","acknowledgement":"We apologize for not being able to mention and cite additional excellent work that would have fit the scope of this review, due to space restraints. We thank Jesse Hansen for comments on the manuscript. We acknowledge support from the Austrian Science Fund (FWF): P33367 and the Institute of Science and Technology Austria.","quality_controlled":"1","date_updated":"2023-08-01T12:55:32Z","day":"01","isi":1,"month":"02","language":[{"iso":"eng"}],"date_published":"2023-02-01T00:00:00Z","external_id":{"isi":["000926043100001"]}},{"publication":"Journal of Fluid Mechanics","intvolume":" 954","publication_status":"published","status":"public","department":[{"_id":"BjHo"}],"year":"2023","title":"Symmetry-reduced dynamic mode decomposition of near-wall turbulence","date_created":"2023-01-08T23:00:53Z","citation":{"ieee":"E. Marensi, G. Yalniz, B. Hof, and N. B. Budanur, “Symmetry-reduced dynamic mode decomposition of near-wall turbulence,” Journal of Fluid Mechanics, vol. 954. Cambridge University Press, 2023.","apa":"Marensi, E., Yalniz, G., Hof, B., & Budanur, N. B. (2023). Symmetry-reduced dynamic mode decomposition of near-wall turbulence. Journal of Fluid Mechanics. Cambridge University Press. https://doi.org/10.1017/jfm.2022.1001","ista":"Marensi E, Yalniz G, Hof B, Budanur NB. 2023. Symmetry-reduced dynamic mode decomposition of near-wall turbulence. Journal of Fluid Mechanics. 954, A10.","chicago":"Marensi, Elena, Gökhan Yalniz, Björn Hof, and Nazmi B Budanur. “Symmetry-Reduced Dynamic Mode Decomposition of near-Wall Turbulence.” Journal of Fluid Mechanics. Cambridge University Press, 2023. https://doi.org/10.1017/jfm.2022.1001.","short":"E. Marensi, G. Yalniz, B. Hof, N.B. Budanur, Journal of Fluid Mechanics 954 (2023).","mla":"Marensi, Elena, et al. “Symmetry-Reduced Dynamic Mode Decomposition of near-Wall Turbulence.” Journal of Fluid Mechanics, vol. 954, A10, Cambridge University Press, 2023, doi:10.1017/jfm.2022.1001.","ama":"Marensi E, Yalniz G, Hof B, Budanur NB. Symmetry-reduced dynamic mode decomposition of near-wall turbulence. Journal of Fluid Mechanics. 2023;954. doi:10.1017/jfm.2022.1001"},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"oa_version":"Published Version","article_type":"original","oa":1,"project":[{"name":"Revisiting the Turbulence Problem Using Statistical Mechanics: Experimental Studies on Transitional and Turbulent Flows","grant_number":"662960","_id":"238598C6-32DE-11EA-91FC-C7463DDC885E"}],"file":[{"file_name":"2023_JourFluidMechanics_Marensi.pdf","access_level":"open_access","creator":"dernst","date_created":"2023-02-02T12:34:54Z","file_size":1931647,"relation":"main_file","checksum":"9224f987caefe5dd85a70814d3cce65c","file_id":"12489","content_type":"application/pdf","date_updated":"2023-02-02T12:34:54Z","success":1}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","abstract":[{"lang":"eng","text":"Data-driven dimensionality reduction methods such as proper orthogonal decomposition and dynamic mode decomposition have proven to be useful for exploring complex phenomena within fluid dynamics and beyond. A well-known challenge for these techniques is posed by the continuous symmetries, e.g. translations and rotations, of the system under consideration, as drifts in the data dominate the modal expansions without providing an insight into the dynamics of the problem. In the present study, we address this issue for fluid flows in rectangular channels by formulating a continuous symmetry reduction method that eliminates the translations in the streamwise and spanwise directions simultaneously. We demonstrate our method by computing the symmetry-reduced dynamic mode decomposition (SRDMD) of sliding windows of data obtained from the transitional plane-Couette and turbulent plane-Poiseuille flow simulations. In the former setting, SRDMD captures the dynamics in the vicinity of the invariant solutions with translation symmetries, i.e. travelling waves and relative periodic orbits, whereas in the latter, our calculations reveal episodes of turbulent time evolution that can be approximated by a low-dimensional linear expansion."}],"doi":"10.1017/jfm.2022.1001","file_date_updated":"2023-02-02T12:34:54Z","date_published":"2023-01-10T00:00:00Z","external_id":{"isi":["000903336600001"],"arxiv":["2101.07516"]},"language":[{"iso":"eng"}],"month":"01","isi":1,"day":"10","date_updated":"2023-08-01T12:53:23Z","quality_controlled":"1","acknowledgement":"E.M. acknowledges funding from the ISTplus fellowship programme. G.Y. and B.H. acknowledge\r\na grant from the Simons Foundation (662960, BH).","article_processing_charge":"Yes (via OA deal)","ddc":["530"],"article_number":"A10","publication_identifier":{"eissn":["1469-7645"],"issn":["0022-1120"]},"_id":"12105","publisher":"Cambridge University Press","author":[{"first_name":"Elena","id":"0BE7553A-1004-11EA-B805-18983DDC885E","full_name":"Marensi, Elena","last_name":"Marensi"},{"id":"66E74FA2-D8BF-11E9-8249-8DE2E5697425","full_name":"Yalniz, Gökhan","last_name":"Yalniz","orcid":"0000-0002-8490-9312","first_name":"Gökhan"},{"last_name":"Hof","id":"3A374330-F248-11E8-B48F-1D18A9856A87","full_name":"Hof, Björn","first_name":"Björn","orcid":"0000-0003-2057-2754"},{"last_name":"Budanur","id":"3EA1010E-F248-11E8-B48F-1D18A9856A87","full_name":"Budanur, Nazmi B","first_name":"Nazmi B","orcid":"0000-0003-0423-5010"}],"type":"journal_article","scopus_import":"1","volume":954,"has_accepted_license":"1"},{"issue":"1","intvolume":" 77","publication":"Evolution: International journal of organic evolution","department":[{"_id":"NiBa"}],"status":"public","publication_status":"published","year":"2023","citation":{"mla":"Bolnick, Daniel I., et al. “A Multivariate View of the Speciation Continuum.” Evolution: International Journal of Organic Evolution, vol. 77, no. 1, Oxford University Press, 2023, pp. 318–28, doi:10.1093/evolut/qpac004.","short":"D.I. Bolnick, A.K. Hund, P. Nosil, F. Peng, M. Ravinet, S. Stankowski, S. Subramanian, J.B.W. Wolf, R. Yukilevich, Evolution: International Journal of Organic Evolution 77 (2023) 318–328.","ama":"Bolnick DI, Hund AK, Nosil P, et al. A multivariate view of the speciation continuum. Evolution: International journal of organic evolution. 2023;77(1):318-328. doi:10.1093/evolut/qpac004","ieee":"D. I. Bolnick et al., “A multivariate view of the speciation continuum,” Evolution: International journal of organic evolution, vol. 77, no. 1. Oxford University Press, pp. 318–328, 2023.","apa":"Bolnick, D. I., Hund, A. K., Nosil, P., Peng, F., Ravinet, M., Stankowski, S., … Yukilevich, R. (2023). A multivariate view of the speciation continuum. Evolution: International Journal of Organic Evolution. Oxford University Press. https://doi.org/10.1093/evolut/qpac004","chicago":"Bolnick, Daniel I., Amanda K. Hund, Patrik Nosil, Foen Peng, Mark Ravinet, Sean Stankowski, Swapna Subramanian, Jochen B.W. Wolf, and Roman Yukilevich. “A Multivariate View of the Speciation Continuum.” Evolution: International Journal of Organic Evolution. Oxford University Press, 2023. https://doi.org/10.1093/evolut/qpac004.","ista":"Bolnick DI, Hund AK, Nosil P, Peng F, Ravinet M, Stankowski S, Subramanian S, Wolf JBW, Yukilevich R. 2023. A multivariate view of the speciation continuum. Evolution: International journal of organic evolution. 77(1), 318–328."},"title":"A multivariate view of the speciation continuum","date_created":"2023-02-05T23:00:59Z","main_file_link":[{"url":"https://doi.org/10.1093/evolut/qpac004","open_access":"1"}],"oa_version":"Published Version","article_type":"original","oa":1,"page":"318-328","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","abstract":[{"lang":"eng","text":"The concept of a “speciation continuum” has gained popularity in recent decades. It emphasizes speciation as a continuous process that may be studied by comparing contemporary population pairs that show differing levels of divergence. In their recent perspective article in Evolution, Stankowski and Ravinet provided a valuable service by formally defining the speciation continuum as a continuum of reproductive isolation, based on opinions gathered from a survey of speciation researchers. While we agree that the speciation continuum has been a useful concept to advance the understanding of the speciation process, some intrinsic limitations exist. Here, we advocate for a multivariate extension, the speciation hypercube, first proposed by Dieckmann et al. in 2004, but rarely used since. We extend the idea of the speciation cube and suggest it has strong conceptual and practical advantages over a one-dimensional model. We illustrate how the speciation hypercube can be used to visualize and compare different speciation trajectories, providing new insights into the processes and mechanisms of speciation. A key strength of the speciation hypercube is that it provides a unifying framework for speciation research, as it allows questions from apparently disparate subfields to be addressed in a single conceptual model."}],"doi":"10.1093/evolut/qpac004","language":[{"iso":"eng"}],"date_published":"2023-01-01T00:00:00Z","external_id":{"pmid":["36622661"],"isi":["001021686300024"]},"isi":1,"month":"01","day":"01","date_updated":"2023-08-01T12:58:30Z","article_processing_charge":"No","acknowledgement":"The authors of this article were supported by LMU Munich (J.B.W.W.), a James S. McDonnell Foundation postdoctoral fellowship (A.K.H.). P.N. received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (Grant agreement No. 770826 EE-Dynamics).\r\nWe thank participants in the 2019 Gordon Conference on Speciation for the extensive conversation on this topic. Thanks to Dan Funk for providing permission to use data from Funk et al. 2006, and for comments on the manuscript.","pmid":1,"quality_controlled":"1","publication_identifier":{"eissn":["1558-5646"]},"_id":"12514","publisher":"Oxford University Press","author":[{"last_name":"Bolnick","full_name":"Bolnick, Daniel I.","first_name":"Daniel I."},{"last_name":"Hund","full_name":"Hund, Amanda K.","first_name":"Amanda K."},{"first_name":"Patrik","full_name":"Nosil, Patrik","last_name":"Nosil"},{"first_name":"Foen","last_name":"Peng","full_name":"Peng, Foen"},{"first_name":"Mark","last_name":"Ravinet","full_name":"Ravinet, Mark"},{"first_name":"Sean","last_name":"Stankowski","full_name":"Stankowski, Sean","id":"43161670-5719-11EA-8025-FABC3DDC885E"},{"full_name":"Subramanian, Swapna","last_name":"Subramanian","first_name":"Swapna"},{"first_name":"Jochen B.W.","full_name":"Wolf, Jochen B.W.","last_name":"Wolf"},{"full_name":"Yukilevich, Roman","last_name":"Yukilevich","first_name":"Roman"}],"volume":77,"type":"journal_article","scopus_import":"1"}]