[{"has_accepted_license":"1","scopus_import":"1","quality_controlled":"1","citation":{"chicago":"Aghajohari, Milad, Guy Avni, and Thomas A Henzinger. “Determinacy in Discrete-Bidding Infinite-Duration Games.” <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic, 2021. <a href=\"https://doi.org/10.23638/LMCS-17(1:10)2021\">https://doi.org/10.23638/LMCS-17(1:10)2021</a>.","apa":"Aghajohari, M., Avni, G., &#38; Henzinger, T. A. (2021). Determinacy in discrete-bidding infinite-duration games. <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic. <a href=\"https://doi.org/10.23638/LMCS-17(1:10)2021\">https://doi.org/10.23638/LMCS-17(1:10)2021</a>","short":"M. Aghajohari, G. Avni, T.A. Henzinger, Logical Methods in Computer Science 17 (2021) 10:1-10:23.","ama":"Aghajohari M, Avni G, Henzinger TA. Determinacy in discrete-bidding infinite-duration games. <i>Logical Methods in Computer Science</i>. 2021;17(1):10:1-10:23. doi:<a href=\"https://doi.org/10.23638/LMCS-17(1:10)2021\">10.23638/LMCS-17(1:10)2021</a>","ista":"Aghajohari M, Avni G, Henzinger TA. 2021. Determinacy in discrete-bidding infinite-duration games. Logical Methods in Computer Science. 17(1), 10:1-10:23.","mla":"Aghajohari, Milad, et al. “Determinacy in Discrete-Bidding Infinite-Duration Games.” <i>Logical Methods in Computer Science</i>, vol. 17, no. 1, International Federation for Computational Logic, 2021, p. 10:1-10:23, doi:<a href=\"https://doi.org/10.23638/LMCS-17(1:10)2021\">10.23638/LMCS-17(1:10)2021</a>.","ieee":"M. Aghajohari, G. Avni, and T. A. Henzinger, “Determinacy in discrete-bidding infinite-duration games,” <i>Logical Methods in Computer Science</i>, vol. 17, no. 1. International Federation for Computational Logic, p. 10:1-10:23, 2021."},"keyword":["computer science","computer science and game theory","logic in computer science"],"author":[{"full_name":"Aghajohari, Milad","first_name":"Milad","last_name":"Aghajohari"},{"first_name":"Guy","last_name":"Avni","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5588-8287","full_name":"Avni, Guy"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","first_name":"Thomas A"}],"file_date_updated":"2022-01-26T08:04:50Z","_id":"10674","intvolume":"        17","publisher":"International Federation for Computational Logic","type":"journal_article","isi":1,"page":"10:1-10:23","article_type":"original","title":"Determinacy in discrete-bidding infinite-duration games","external_id":{"arxiv":["1905.03588"],"isi":["000658724600010"]},"volume":17,"year":"2021","publication":"Logical Methods in Computer Science","project":[{"name":"Formal Methods meets Algorithmic Game Theory","_id":"264B3912-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"M02369"},{"name":"Rigorous Systems Engineering","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","call_identifier":"FWF"},{"grant_number":"Z211","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23 (RiSE/SHiNE), Z211-N23 (Wittgenstein Award), and M 2369-N33 (Meitner fellowship).\r\n","date_created":"2022-01-25T16:32:13Z","article_processing_charge":"No","publication_identifier":{"eissn":["1860-5974"]},"department":[{"_id":"ToHe"}],"issue":"1","date_updated":"2025-04-15T06:25:56Z","oa_version":"Published Version","arxiv":1,"oa":1,"language":[{"iso":"eng"}],"day":"03","license":"https://creativecommons.org/licenses/by/4.0/","corr_author":"1","file":[{"success":1,"file_name":"2021_LMCS_AGHAJOHAR.pdf","file_size":819878,"checksum":"b35586a50ed1ca8f44767de116d18d81","date_created":"2022-01-26T08:04:50Z","file_id":"10690","content_type":"application/pdf","relation":"main_file","creator":"alisjak","access_level":"open_access","date_updated":"2022-01-26T08:04:50Z"}],"abstract":[{"lang":"eng","text":"In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the winner of the game. Such games are central in formal methods since they model the interaction between a non-terminating system and its environment. In bidding games the players bid for the right to move the token: in each round, the players simultaneously submit bids, and the higher bidder moves the token and pays the other player. Bidding games are known to have a clean and elegant mathematical structure that relies on the ability of the players to submit arbitrarily small bids. Many applications, however, require a fixed granularity for the bids, which can represent, for example, the monetary value expressed in cents. We study, for the first time, the combination of discrete-bidding and infinite-duration games. Our most important result proves that these games form a large determined subclass of concurrent games, where determinacy is the strong property that there always exists exactly one player who can guarantee winning the game. In particular, we show that, in contrast to non-discrete bidding games, the mechanism with which tied bids are resolved plays an important role in discrete-bidding games. We study several natural tie-breaking mechanisms and show that, while some do not admit determinacy, most natural mechanisms imply determinacy for every pair of initial budgets."}],"publication_status":"published","ddc":["510"],"date_published":"2021-02-03T00:00:00Z","status":"public","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"month":"02","doi":"10.23638/LMCS-17(1:10)2021","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8"},{"language":[{"iso":"eng"}],"oa":1,"date_updated":"2025-04-15T06:25:56Z","oa_version":"Published Version","alternative_title":["Conference Series"],"corr_author":"1","file":[{"content_type":"application/pdf","relation":"main_file","creator":"cchlebak","access_level":"open_access","date_updated":"2022-01-26T08:04:29Z","success":1,"file_size":390555,"file_name":"2021_FCAD2021_Kragl.pdf","checksum":"35438ac9f9750340b7f8ae4ae3220d9f","date_created":"2022-01-26T08:04:29Z","file_id":"10689"}],"day":"01","date_published":"2021-10-01T00:00:00Z","status":"public","publication_status":"published","abstract":[{"text":"Civl is a static verifier for concurrent programs designed around the conceptual framework of layered refinement,\r\nwhich views the task of verifying a program as a sequence of program simplification steps each justified by its own invariant. Civl verifies a layered concurrent program that compactly expresses all the programs in this sequence and the supporting invariants. This paper presents the design and implementation of the Civl verifier.","lang":"eng"}],"ddc":["000"],"doi":"10.34727/2021/isbn.978-3-85448-046-4_23","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"month":"10","author":[{"full_name":"Kragl, Bernhard","first_name":"Bernhard","orcid":"0000-0001-7745-9117","id":"320FC952-F248-11E8-B48F-1D18A9856A87","last_name":"Kragl"},{"full_name":"Qadeer, Shaz","first_name":"Shaz","last_name":"Qadeer"}],"_id":"10688","file_date_updated":"2022-01-26T08:04:29Z","has_accepted_license":"1","scopus_import":"1","quality_controlled":"1","citation":{"chicago":"Kragl, Bernhard, and Shaz Qadeer. “The Civl Verifier.” In <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i>, edited by Piskac Ruzica and Michael W. Whalen, 2:143–152. TU Wien Academic Press, 2021. <a href=\"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23\">https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23</a>.","short":"B. Kragl, S. Qadeer, in:, P. Ruzica, M.W. Whalen (Eds.), Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design, TU Wien Academic Press, 2021, pp. 143–152.","apa":"Kragl, B., &#38; Qadeer, S. (2021). The Civl verifier. In P. Ruzica &#38; M. W. Whalen (Eds.), <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i> (Vol. 2, pp. 143–152). Virtual: TU Wien Academic Press. <a href=\"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23\">https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23</a>","ama":"Kragl B, Qadeer S. The Civl verifier. In: Ruzica P, Whalen MW, eds. <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i>. Vol 2. TU Wien Academic Press; 2021:143–152. doi:<a href=\"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23\">10.34727/2021/isbn.978-3-85448-046-4_23</a>","ista":"Kragl B, Qadeer S. 2021. The Civl verifier. Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, Conference Series, vol. 2, 143–152.","ieee":"B. Kragl and S. Qadeer, “The Civl verifier,” in <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i>, Virtual, 2021, vol. 2, pp. 143–152.","mla":"Kragl, Bernhard, and Shaz Qadeer. “The Civl Verifier.” <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i>, edited by Piskac Ruzica and Michael W. Whalen, vol. 2, TU Wien Academic Press, 2021, pp. 143–152, doi:<a href=\"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23\">10.34727/2021/isbn.978-3-85448-046-4_23</a>."},"type":"conference","intvolume":"         2","editor":[{"last_name":"Ruzica","first_name":"Piskac","full_name":"Ruzica, Piskac"},{"full_name":"Whalen, Michael W.","last_name":"Whalen","first_name":"Michael W."}],"publisher":"TU Wien Academic Press","title":"The Civl verifier","volume":2,"year":"2021","publication":"Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design","project":[{"grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems"}],"page":"143–152","conference":{"end_date":"2021-10-22","start_date":"2021-10-20","location":"Virtual","name":"FMCAD: Formal Methods in Computer-Aided Design"},"department":[{"_id":"ToHe"}],"date_created":"2022-01-26T08:01:30Z","acknowledgement":"This research was performed while Bernhard Kragl was at IST Austria, supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","article_processing_charge":"No","publication_identifier":{"isbn":["978-3-85448-046-4"]}},{"corr_author":"1","day":"01","ec_funded":1,"oa":1,"language":[{"iso":"eng"}],"arxiv":1,"date_updated":"2025-04-15T06:26:15Z","oa_version":"Preprint","doi":"10.1137/1.9781611976465.38","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2005.06636"}],"month":"01","status":"public","date_published":"2021-01-01T00:00:00Z","abstract":[{"lang":"eng","text":"In a two-player zero-sum graph game the players move a token throughout a graph to produce an infinite path, which determines the winner or payoff of the game. Traditionally, the players alternate turns in moving the token. In bidding games, however, the players have budgets, and in each turn, we hold an “auction” (bidding) to determine which player moves the token: both players simultaneously submit bids and the higher bidder moves the token. The bidding mechanisms differ in their payment schemes. Bidding games were largely studied with variants of first-price bidding in which only the higher bidder pays his bid. We focus on all-pay bidding, where both players pay their bids. Finite-duration all-pay bidding games were studied and shown to be technically more challenging than their first-price counterparts. We study for the first time, infinite-duration all-pay bidding games. Our most interesting results are for mean-payoff objectives: we portray a complete picture for games played on strongly-connected graphs. We study both pure (deterministic) and mixed (probabilistic) strategies and completely characterize the optimal and almost-sure (with probability 1) payoffs the players can respectively guarantee. We show that mean-payoff games under all-pay bidding exhibit the intriguing mathematical properties of their first-price counterparts; namely, an equivalence with random-turn games in which in each turn, the player who moves is selected according to a (biased) coin toss. The equivalences for all-pay bidding are more intricate and unexpected than for first-price bidding."}],"publication_status":"published","type":"conference","publisher":"Society for Industrial and Applied Mathematics","editor":[{"first_name":"Dániel","last_name":"Marx","full_name":"Marx, Dániel"}],"author":[{"orcid":"0000-0001-5588-8287","last_name":"Avni","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","first_name":"Guy","full_name":"Avni, Guy"},{"full_name":"Jecker, Ismael R","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","last_name":"Jecker","first_name":"Ismael R"},{"orcid":"0000-0002-4681-1699","last_name":"Zikelic","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","first_name":"Dorde","full_name":"Zikelic, Dorde"}],"_id":"10694","citation":{"short":"G. Avni, I.R. Jecker, D. Zikelic, in:, D. Marx (Ed.), Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2021, pp. 617–636.","apa":"Avni, G., Jecker, I. R., &#38; Zikelic, D. (2021). Infinite-duration all-pay bidding games. In D. Marx (Ed.), <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 617–636). Virtual: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611976465.38\">https://doi.org/10.1137/1.9781611976465.38</a>","chicago":"Avni, Guy, Ismael R Jecker, and Dorde Zikelic. “Infinite-Duration All-Pay Bidding Games.” In <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i>, edited by Dániel Marx, 617–36. Society for Industrial and Applied Mathematics, 2021. <a href=\"https://doi.org/10.1137/1.9781611976465.38\">https://doi.org/10.1137/1.9781611976465.38</a>.","mla":"Avni, Guy, et al. “Infinite-Duration All-Pay Bidding Games.” <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i>, edited by Dániel Marx, Society for Industrial and Applied Mathematics, 2021, pp. 617–36, doi:<a href=\"https://doi.org/10.1137/1.9781611976465.38\">10.1137/1.9781611976465.38</a>.","ieee":"G. Avni, I. R. Jecker, and D. Zikelic, “Infinite-duration all-pay bidding games,” in <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i>, Virtual, 2021, pp. 617–636.","ista":"Avni G, Jecker IR, Zikelic D. 2021. Infinite-duration all-pay bidding games. Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 617–636.","ama":"Avni G, Jecker IR, Zikelic D. Infinite-duration all-pay bidding games. In: Marx D, ed. <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i>. Society for Industrial and Applied Mathematics; 2021:617-636. doi:<a href=\"https://doi.org/10.1137/1.9781611976465.38\">10.1137/1.9781611976465.38</a>"},"quality_controlled":"1","scopus_import":"1","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"conference":{"name":"SODA: Symposium on Discrete Algorithms","end_date":"2021-01-13","start_date":"2021-01-10","location":"Virtual"},"publication_identifier":{"isbn":["978-1-61197-646-5"]},"date_created":"2022-01-27T12:11:23Z","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award), ERC CoG 863818 (FoRM-SMArt), and by the European Union's Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","article_processing_charge":"No","year":"2021","publication":"Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms","project":[{"grant_number":"Z211","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","call_identifier":"H2020"},{"call_identifier":"H2020","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program"}],"title":"Infinite-duration all-pay bidding games","external_id":{"arxiv":["2005.06636"]},"page":"617-636"},{"language":[{"iso":"eng"}],"oa":1,"arxiv":1,"date_updated":"2024-10-21T06:02:06Z","oa_version":"Preprint","issue":"7","corr_author":"1","day":"28","status":"public","date_published":"2021-06-28T00:00:00Z","abstract":[{"text":"In this paper, we investigate the distribution of the maximum of partial sums of families of  m -periodic complex-valued functions satisfying certain conditions. We obtain precise uniform estimates for the distribution function of this maximum in a near-optimal range. Our results apply to partial sums of Kloosterman sums and other families of  ℓ -adic trace functions, and are as strong as those obtained by Bober, Goldmakher, Granville and Koukoulopoulos for character sums. In particular, we improve on the recent work of the third author for Birch sums. However, unlike character sums, we are able to construct families of  m -periodic complex-valued functions which satisfy our conditions, but for which the Pólya–Vinogradov inequality is sharp.","lang":"eng"}],"publication_status":"published","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","doi":"10.1112/s0010437x21007351","main_file_link":[{"url":"https://arxiv.org/abs/1909.03266","open_access":"1"}],"month":"06","_id":"10711","author":[{"full_name":"Autissier, Pascal","first_name":"Pascal","last_name":"Autissier"},{"full_name":"Bonolis, Dante","last_name":"Bonolis","id":"6A459894-5FDD-11E9-AF35-BB24E6697425","first_name":"Dante"},{"full_name":"Lamzouri, Youness","last_name":"Lamzouri","first_name":"Youness"}],"keyword":["Algebra and Number Theory"],"citation":{"ama":"Autissier P, Bonolis D, Lamzouri Y. The distribution of the maximum of partial sums of Kloosterman sums and other trace functions. <i>Compositio Mathematica</i>. 2021;157(7):1610-1651. doi:<a href=\"https://doi.org/10.1112/s0010437x21007351\">10.1112/s0010437x21007351</a>","ieee":"P. Autissier, D. Bonolis, and Y. Lamzouri, “The distribution of the maximum of partial sums of Kloosterman sums and other trace functions,” <i>Compositio Mathematica</i>, vol. 157, no. 7. Cambridge University Press, pp. 1610–1651, 2021.","mla":"Autissier, Pascal, et al. “The Distribution of the Maximum of Partial Sums of Kloosterman Sums and Other Trace Functions.” <i>Compositio Mathematica</i>, vol. 157, no. 7, Cambridge University Press, 2021, pp. 1610–51, doi:<a href=\"https://doi.org/10.1112/s0010437x21007351\">10.1112/s0010437x21007351</a>.","ista":"Autissier P, Bonolis D, Lamzouri Y. 2021. The distribution of the maximum of partial sums of Kloosterman sums and other trace functions. Compositio Mathematica. 157(7), 1610–1651.","chicago":"Autissier, Pascal, Dante Bonolis, and Youness Lamzouri. “The Distribution of the Maximum of Partial Sums of Kloosterman Sums and Other Trace Functions.” <i>Compositio Mathematica</i>. Cambridge University Press, 2021. <a href=\"https://doi.org/10.1112/s0010437x21007351\">https://doi.org/10.1112/s0010437x21007351</a>.","apa":"Autissier, P., Bonolis, D., &#38; Lamzouri, Y. (2021). The distribution of the maximum of partial sums of Kloosterman sums and other trace functions. <i>Compositio Mathematica</i>. Cambridge University Press. <a href=\"https://doi.org/10.1112/s0010437x21007351\">https://doi.org/10.1112/s0010437x21007351</a>","short":"P. Autissier, D. Bonolis, Y. Lamzouri, Compositio Mathematica 157 (2021) 1610–1651."},"scopus_import":"1","quality_controlled":"1","isi":1,"type":"journal_article","publisher":"Cambridge University Press","intvolume":"       157","publication":"Compositio Mathematica","year":"2021","volume":157,"title":"The distribution of the maximum of partial sums of Kloosterman sums and other trace functions","external_id":{"isi":["000667289300001"],"arxiv":["1909.03266"]},"article_type":"original","page":"1610-1651","department":[{"_id":"TiBr"}],"publication_identifier":{"eissn":["1570-5846"],"issn":["0010-437X"]},"article_processing_charge":"No","acknowledgement":"We would like to thank the anonymous referees for carefully reading the paper and for their remarks and suggestions.","date_created":"2022-02-01T08:10:43Z"},{"corr_author":"1","day":"10","ec_funded":1,"language":[{"iso":"eng"}],"oa":1,"oa_version":"Preprint","date_updated":"2025-04-14T07:26:53Z","issue":"7","arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.2140/APDE.2021.14.2079","month":"11","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1904.12532"}],"date_published":"2021-11-10T00:00:00Z","status":"public","abstract":[{"lang":"eng","text":"We prove an adiabatic theorem for the Landau–Pekar equations. This allows us to derive new results on the accuracy of their use as effective equations for the time evolution generated by the Fröhlich Hamiltonian with large coupling constant α. In particular, we show that the time evolution of Pekar product states with coherent phonon field and the electron being trapped by the phonons is well approximated by the Landau–Pekar equations until times short compared to α2."}],"publication_status":"published","isi":1,"type":"journal_article","intvolume":"        14","publisher":"Mathematical Sciences Publishers","_id":"10738","author":[{"full_name":"Leopold, Nikolai K","first_name":"Nikolai K","id":"4BC40BEC-F248-11E8-B48F-1D18A9856A87","last_name":"Leopold","orcid":"0000-0002-0495-6822"},{"full_name":"Rademacher, Simone Anna Elvira","last_name":"Rademacher","id":"856966FE-A408-11E9-977E-802DE6697425","orcid":"0000-0001-5059-4466","first_name":"Simone Anna Elvira"},{"first_name":"Benjamin","last_name":"Schlein","full_name":"Schlein, Benjamin"},{"full_name":"Seiringer, Robert","first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","orcid":"0000-0002-6781-0521"}],"scopus_import":"1","quality_controlled":"1","citation":{"chicago":"Leopold, Nikolai K, Simone Anna Elvira Rademacher, Benjamin Schlein, and Robert Seiringer. “ The Landau–Pekar Equations: Adiabatic Theorem and Accuracy.” <i>Analysis and PDE</i>. Mathematical Sciences Publishers, 2021. <a href=\"https://doi.org/10.2140/APDE.2021.14.2079\">https://doi.org/10.2140/APDE.2021.14.2079</a>.","short":"N.K. Leopold, S.A.E. Rademacher, B. Schlein, R. Seiringer, Analysis and PDE 14 (2021) 2079–2100.","apa":"Leopold, N. K., Rademacher, S. A. E., Schlein, B., &#38; Seiringer, R. (2021).  The Landau–Pekar equations: Adiabatic theorem and accuracy. <i>Analysis and PDE</i>. Mathematical Sciences Publishers. <a href=\"https://doi.org/10.2140/APDE.2021.14.2079\">https://doi.org/10.2140/APDE.2021.14.2079</a>","ama":"Leopold NK, Rademacher SAE, Schlein B, Seiringer R.  The Landau–Pekar equations: Adiabatic theorem and accuracy. <i>Analysis and PDE</i>. 2021;14(7):2079-2100. doi:<a href=\"https://doi.org/10.2140/APDE.2021.14.2079\">10.2140/APDE.2021.14.2079</a>","ista":"Leopold NK, Rademacher SAE, Schlein B, Seiringer R. 2021.  The Landau–Pekar equations: Adiabatic theorem and accuracy. Analysis and PDE. 14(7), 2079–2100.","mla":"Leopold, Nikolai K., et al. “ The Landau–Pekar Equations: Adiabatic Theorem and Accuracy.” <i>Analysis and PDE</i>, vol. 14, no. 7, Mathematical Sciences Publishers, 2021, pp. 2079–100, doi:<a href=\"https://doi.org/10.2140/APDE.2021.14.2079\">10.2140/APDE.2021.14.2079</a>.","ieee":"N. K. Leopold, S. A. E. Rademacher, B. Schlein, and R. Seiringer, “ The Landau–Pekar equations: Adiabatic theorem and accuracy,” <i>Analysis and PDE</i>, vol. 14, no. 7. Mathematical Sciences Publishers, pp. 2079–2100, 2021."},"department":[{"_id":"RoSe"}],"article_processing_charge":"No","acknowledgement":"N. L. and R. S. gratefully acknowledge financial support by the European Research Council\r\n(ERC) under the European Union’s Horizon 2020 research and innovation programme (grant\r\nagreement No 694227). B. S. acknowledges support from the Swiss National Science Foundation (grant 200020_172623) and from the NCCR SwissMAP. N. L. would like to thank\r\nAndreas Deuchert and David Mitrouskas for interesting discussions. B. S. and R. S. would\r\nlike to thank Rupert Frank for stimulating discussions about the time-evolution of a polaron.\r\n","date_created":"2022-02-06T23:01:33Z","publication_identifier":{"eissn":["1948-206X"],"issn":["2157-5045"]},"volume":14,"article_type":"original","title":" The Landau–Pekar equations: Adiabatic theorem and accuracy","external_id":{"arxiv":["1904.12532"],"isi":["000733976600004"]},"publication":"Analysis and PDE","project":[{"grant_number":"694227","call_identifier":"H2020","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","name":"Analysis of quantum many-body systems"}],"year":"2021","page":"2079-2100"},{"intvolume":"       371","publisher":"American Association for the Advancement of Science","type":"journal_article","isi":1,"quality_controlled":"1","scopus_import":"1","citation":{"mla":"Liu, Yu, and Maria Ibáñez. “Tidying up the Mess.” <i>Science</i>, vol. 371, no. 6530, American Association for the Advancement of Science, 2021, pp. 678–79, doi:<a href=\"https://doi.org/10.1126/science.abg0886\">10.1126/science.abg0886</a>.","ieee":"Y. Liu and M. Ibáñez, “Tidying up the mess,” <i>Science</i>, vol. 371, no. 6530. American Association for the Advancement of Science, pp. 678–679, 2021.","ista":"Liu Y, Ibáñez M. 2021. Tidying up the mess. Science. 371(6530), 678–679.","ama":"Liu Y, Ibáñez M. Tidying up the mess. <i>Science</i>. 2021;371(6530):678-679. doi:<a href=\"https://doi.org/10.1126/science.abg0886\">10.1126/science.abg0886</a>","apa":"Liu, Y., &#38; Ibáñez, M. (2021). Tidying up the mess. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.abg0886\">https://doi.org/10.1126/science.abg0886</a>","short":"Y. Liu, M. Ibáñez, Science 371 (2021) 678–679.","chicago":"Liu, Yu, and Maria Ibáñez. “Tidying up the Mess.” <i>Science</i>. American Association for the Advancement of Science, 2021. <a href=\"https://doi.org/10.1126/science.abg0886\">https://doi.org/10.1126/science.abg0886</a>."},"keyword":["multidisciplinary"],"author":[{"first_name":"Yu","orcid":"0000-0001-7313-6740","last_name":"Liu","id":"2A70014E-F248-11E8-B48F-1D18A9856A87","full_name":"Liu, Yu"},{"last_name":"Ibáñez","id":"43C61214-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5013-2843","first_name":"Maria","full_name":"Ibáñez, Maria"}],"_id":"10809","date_created":"2022-03-03T09:51:48Z","article_processing_charge":"No","publication_identifier":{"eissn":["1095-9203"],"issn":["0036-8075"]},"department":[{"_id":"MaIb"}],"page":"678-679","external_id":{"pmid":["33574201"],"isi":["000617551600027"]},"title":"Tidying up the mess","article_type":"letter_note","volume":371,"year":"2021","publication":"Science","day":"12","corr_author":"1","issue":"6530","date_updated":"2024-10-09T21:01:45Z","oa_version":"None","language":[{"iso":"eng"}],"month":"02","pmid":1,"doi":"10.1126/science.abg0886","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","abstract":[{"text":"Thermoelectric materials are engines that convert heat into an electrical current. Intuitively, the efficiency of this process depends on how many electrons (charge carriers) can move and how easily they do so, how much energy those moving electrons transport, and how easily the temperature gradient is maintained. In terms of material properties, an excellent thermoelectric material requires a high electrical conductivity σ, a high Seebeck coefficient S (a measure of the induced thermoelectric voltage as a function of temperature gradient), and a low thermal conductivity κ. The challenge is that these three properties are strongly interrelated in a conflicting manner (1). On page 722 of this issue, Roychowdhury et al. (2) have found a way to partially break these ties in silver antimony telluride (AgSbTe2) with the addition of cadmium (Cd) cations, which increase the ordering in this inherently disordered thermoelectric material.","lang":"eng"}],"publication_status":"published","date_published":"2021-02-12T00:00:00Z","status":"public"},{"language":[{"iso":"eng"}],"oa":1,"issue":"10","date_updated":"2023-08-17T07:01:14Z","oa_version":"Preprint","day":"24","status":"public","date_published":"2021-05-24T00:00:00Z","publication_status":"published","abstract":[{"lang":"eng","text":"Hematopoietic-specific protein 1 (Hem1) is an essential subunit of the WAVE regulatory complex (WRC) in immune cells. WRC is crucial for Arp2/3 complex activation and the protrusion of branched actin filament networks. Moreover, Hem1 loss of function in immune cells causes autoimmune diseases in humans. Here, we show that genetic removal of Hem1 in macrophages diminishes frequency and efficacy of phagocytosis as well as phagocytic cup formation in addition to defects in lamellipodial protrusion and migration. Moreover, Hem1-null macrophages displayed strong defects in cell adhesion despite unaltered podosome formation and concomitant extracellular matrix degradation. Specifically, dynamics of both adhesion and de-adhesion as well as concomitant phosphorylation of paxillin and focal adhesion kinase (FAK) were significantly compromised. Accordingly, disruption of WRC function in non-hematopoietic cells coincided with both defects in adhesion turnover and altered FAK and paxillin phosphorylation. Consistently, platelets exhibited reduced adhesion and diminished integrin αIIbβ3 activation upon WRC removal. Interestingly, adhesion phenotypes, but not lamellipodia formation, were partially rescued by small molecule activation of FAK. A full rescue of the phenotype, including lamellipodia formation, required not only the presence of WRCs but also their binding to and activation by Rac. Collectively, our results uncover that WRC impacts on integrin-dependent processes in a FAK-dependent manner, controlling formation and dismantling of adhesions, relevant for properly grabbing onto extracellular surfaces and particles during cell edge expansion, like in migration or phagocytosis."}],"doi":"10.1016/j.cub.2021.02.043","pmid":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1101/2020.03.24.005835"}],"month":"05","author":[{"first_name":"Stephanie","last_name":"Stahnke","full_name":"Stahnke, Stephanie"},{"full_name":"Döring, Hermann","last_name":"Döring","first_name":"Hermann"},{"first_name":"Charly","last_name":"Kusch","full_name":"Kusch, Charly"},{"full_name":"de Gorter, David J.J.","first_name":"David J.J.","last_name":"de Gorter"},{"last_name":"Dütting","first_name":"Sebastian","full_name":"Dütting, Sebastian"},{"first_name":"Aleks","last_name":"Guledani","full_name":"Guledani, Aleks"},{"last_name":"Pleines","first_name":"Irina","full_name":"Pleines, Irina"},{"full_name":"Schnoor, Michael","last_name":"Schnoor","first_name":"Michael"},{"full_name":"Sixt, Michael K","first_name":"Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","last_name":"Sixt","orcid":"0000-0002-6620-9179"},{"full_name":"Geffers, Robert","first_name":"Robert","last_name":"Geffers"},{"full_name":"Rohde, Manfred","first_name":"Manfred","last_name":"Rohde"},{"full_name":"Müsken, Mathias","first_name":"Mathias","last_name":"Müsken"},{"last_name":"Kage","first_name":"Frieda","full_name":"Kage, Frieda"},{"first_name":"Anika","last_name":"Steffen","full_name":"Steffen, Anika"},{"full_name":"Faix, Jan","last_name":"Faix","first_name":"Jan"},{"full_name":"Nieswandt, Bernhard","first_name":"Bernhard","last_name":"Nieswandt"},{"full_name":"Rottner, Klemens","last_name":"Rottner","first_name":"Klemens"},{"last_name":"Stradal","first_name":"Theresia E.B.","full_name":"Stradal, Theresia E.B."}],"_id":"10834","citation":{"ama":"Stahnke S, Döring H, Kusch C, et al. Loss of Hem1 disrupts macrophage function and impacts migration, phagocytosis, and integrin-mediated adhesion. <i>Current Biology</i>. 2021;31(10):2051-2064.e8. doi:<a href=\"https://doi.org/10.1016/j.cub.2021.02.043\">10.1016/j.cub.2021.02.043</a>","ista":"Stahnke S, Döring H, Kusch C, de Gorter DJJ, Dütting S, Guledani A, Pleines I, Schnoor M, Sixt MK, Geffers R, Rohde M, Müsken M, Kage F, Steffen A, Faix J, Nieswandt B, Rottner K, Stradal TEB. 2021. Loss of Hem1 disrupts macrophage function and impacts migration, phagocytosis, and integrin-mediated adhesion. Current Biology. 31(10), 2051–2064.e8.","ieee":"S. Stahnke <i>et al.</i>, “Loss of Hem1 disrupts macrophage function and impacts migration, phagocytosis, and integrin-mediated adhesion,” <i>Current Biology</i>, vol. 31, no. 10. Elsevier, p. 2051–2064.e8, 2021.","mla":"Stahnke, Stephanie, et al. “Loss of Hem1 Disrupts Macrophage Function and Impacts Migration, Phagocytosis, and Integrin-Mediated Adhesion.” <i>Current Biology</i>, vol. 31, no. 10, Elsevier, 2021, p. 2051–2064.e8, doi:<a href=\"https://doi.org/10.1016/j.cub.2021.02.043\">10.1016/j.cub.2021.02.043</a>.","chicago":"Stahnke, Stephanie, Hermann Döring, Charly Kusch, David J.J. de Gorter, Sebastian Dütting, Aleks Guledani, Irina Pleines, et al. “Loss of Hem1 Disrupts Macrophage Function and Impacts Migration, Phagocytosis, and Integrin-Mediated Adhesion.” <i>Current Biology</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.cub.2021.02.043\">https://doi.org/10.1016/j.cub.2021.02.043</a>.","apa":"Stahnke, S., Döring, H., Kusch, C., de Gorter, D. J. J., Dütting, S., Guledani, A., … Stradal, T. E. B. (2021). Loss of Hem1 disrupts macrophage function and impacts migration, phagocytosis, and integrin-mediated adhesion. <i>Current Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.cub.2021.02.043\">https://doi.org/10.1016/j.cub.2021.02.043</a>","short":"S. Stahnke, H. Döring, C. Kusch, D.J.J. de Gorter, S. Dütting, A. Guledani, I. Pleines, M. Schnoor, M.K. Sixt, R. Geffers, M. Rohde, M. Müsken, F. Kage, A. Steffen, J. Faix, B. Nieswandt, K. Rottner, T.E.B. Stradal, Current Biology 31 (2021) 2051–2064.e8."},"keyword":["General Agricultural and Biological Sciences","General Biochemistry","Genetics and Molecular Biology"],"scopus_import":"1","quality_controlled":"1","type":"journal_article","isi":1,"publisher":"Elsevier","intvolume":"        31","year":"2021","publication":"Current Biology","title":"Loss of Hem1 disrupts macrophage function and impacts migration, phagocytosis, and integrin-mediated adhesion","external_id":{"isi":["000654652200002"],"pmid":["33711252"]},"article_type":"original","volume":31,"page":"2051-2064.e8","department":[{"_id":"MiSi"}],"publication_identifier":{"issn":["0960-9822"]},"date_created":"2022-03-08T07:51:04Z","acknowledgement":"We are grateful to Silvia Prettin, Ina Schleicher, and Petra Hagendorff for expert technical assistance; David Dettbarn for animal keeping and breeding; and Lothar Gröbe and Maria Höxter for cell sorting. We also thank Werner Tegge for peptides and Giorgio Scita for antibodies. This work was supported, in part, by the Deutsche Forschungsgemeinschaft (DFG), Priority Programm SPP1150 (to T.E.B.S., K.R., and M. Sixt), and by DFG grant GRK2223/1 (to K.R.). T.E.B.S. acknowledges support by the Helmholtz Society through HGF impulse fund W2/W3-066 and M. Schnoor by the Mexican Council for Science and Technology (CONACyT, 284292 ), Fund SEP-Cinvestav ( 108 ), and the Royal Society, UK (Newton Advanced Fellowship, NAF/R1/180017 ).","article_processing_charge":"No"},{"department":[{"_id":"Bio"}],"article_processing_charge":"No","acknowledgement":"This  work  was  supported  by  the  Austrian  Science  Fund  (FWF)  grants  MCCA  W1248-B30  and  SFB  F4606-B28  to  EJJ.  CP  received  a  short-term research fellowship of the European Federation of Immunological Societies  (EFIS-IL)  for  a  research  visit  at  Biocruces  Bizkaia  Health  Research  Institute,  Barakaldo,  Spain.  VKK  received  an  EFIS-IL  short-term  research  fellowship  for  a  research  visit  at  King’s  College  London.  The research was funded by the National Institute for Health Research (NIHR) Biomedical Research Centre (BRC) based at Guy's and St Thomas' NHS Foundation Trust and King's College London (IS-BRC-1215-20006) (SNK).  The  authors  acknowledge  support  by  the  Medical  Research  Council (MR/L023091/1) (SNK); Breast Cancer Now (147; KCL-BCN-Q3)(SNK); Cancer Research UK (C30122/A11527; C30122/A15774) (SNK); Cancer  Research  UK  King's  Health  Partners  Centre  at  King's  College  London   (C604/A25135)   (SNK);   CRUK/NIHR   in   England/DoH   for   Scotland,  Wales  and  Northern  Ireland  Experimental  Cancer  Medicine  Centre  (C10355/A15587)  (SNK).  The  views  expressed  are  those  of  the  author(s)  and  not  necessarily  those  of  the  NHS,  the  NIHR  or  the  Department  of  Health.  Additionally,  this  work  was  funded  by  Instituto  de  Salud  Carlos  III  through  the  project  \"PI16/01223\"  (Co-funded  by  European Regional Development Fund; “A way to make Europe”) to FB and  by  the  Department  of  Health,  Basque  Government  through  the  project “2019111031” to OZ. OZ is recipient of a Sara Borrell 2017 post-doctoral contract “CD17/00128” funded by Instituto de Salud Carlos III (Co-funded by European Social Fund; “Investing in your future”).","date_created":"2022-03-08T11:19:05Z","publication_identifier":{"issn":["0105-4538"],"eissn":["1398-9995"]},"volume":76,"title":"PIPE‐cloned human IgE and IgG4 antibodies: New tools for investigating cow's milk allergy and tolerance","article_type":"letter_note","external_id":{"isi":["000577708800001"],"pmid":["32990982"]},"publication":"Allergy","year":"2021","page":"1553-1556","isi":1,"type":"journal_article","intvolume":"        76","publisher":"Wiley","file_date_updated":"2022-03-08T11:23:16Z","_id":"10836","author":[{"first_name":"Christina L.","last_name":"Pranger","full_name":"Pranger, Christina L."},{"id":"36432834-F248-11E8-B48F-1D18A9856A87","last_name":"Fazekas-Singer","orcid":"0000-0002-8777-3502","first_name":"Judit","full_name":"Fazekas-Singer, Judit"},{"first_name":"Verena K.","last_name":"Köhler","full_name":"Köhler, Verena K."},{"full_name":"Pali‐Schöll, Isabella","first_name":"Isabella","last_name":"Pali‐Schöll"},{"last_name":"Fiocchi","first_name":"Alessandro","full_name":"Fiocchi, Alessandro"},{"last_name":"Karagiannis","first_name":"Sophia N.","full_name":"Karagiannis, Sophia N."},{"last_name":"Zenarruzabeitia","first_name":"Olatz","full_name":"Zenarruzabeitia, Olatz"},{"full_name":"Borrego, Francisco","first_name":"Francisco","last_name":"Borrego"},{"last_name":"Jensen‐Jarolim","first_name":"Erika","full_name":"Jensen‐Jarolim, Erika"}],"quality_controlled":"1","scopus_import":"1","has_accepted_license":"1","keyword":["Immunology","Immunology and Allergy"],"citation":{"apa":"Pranger, C. L., Singer, J., Köhler, V. K., Pali‐Schöll, I., Fiocchi, A., Karagiannis, S. N., … Jensen‐Jarolim, E. (2021). PIPE‐cloned human IgE and IgG4 antibodies: New tools for investigating cow’s milk allergy and tolerance. <i>Allergy</i>. Wiley. <a href=\"https://doi.org/10.1111/all.14604\">https://doi.org/10.1111/all.14604</a>","short":"C.L. Pranger, J. Singer, V.K. Köhler, I. Pali‐Schöll, A. Fiocchi, S.N. Karagiannis, O. Zenarruzabeitia, F. Borrego, E. Jensen‐Jarolim, Allergy 76 (2021) 1553–1556.","chicago":"Pranger, Christina L., Judit Singer, Verena K. Köhler, Isabella Pali‐Schöll, Alessandro Fiocchi, Sophia N. Karagiannis, Olatz Zenarruzabeitia, Francisco Borrego, and Erika Jensen‐Jarolim. “PIPE‐cloned Human IgE and IgG4 Antibodies: New Tools for Investigating Cow’s Milk Allergy and Tolerance.” <i>Allergy</i>. Wiley, 2021. <a href=\"https://doi.org/10.1111/all.14604\">https://doi.org/10.1111/all.14604</a>.","mla":"Pranger, Christina L., et al. “PIPE‐cloned Human IgE and IgG4 Antibodies: New Tools for Investigating Cow’s Milk Allergy and Tolerance.” <i>Allergy</i>, vol. 76, no. 5, Wiley, 2021, pp. 1553–56, doi:<a href=\"https://doi.org/10.1111/all.14604\">10.1111/all.14604</a>.","ista":"Pranger CL, Singer J, Köhler VK, Pali‐Schöll I, Fiocchi A, Karagiannis SN, Zenarruzabeitia O, Borrego F, Jensen‐Jarolim E. 2021. PIPE‐cloned human IgE and IgG4 antibodies: New tools for investigating cow’s milk allergy and tolerance. Allergy. 76(5), 1553–1556.","ieee":"C. L. Pranger <i>et al.</i>, “PIPE‐cloned human IgE and IgG4 antibodies: New tools for investigating cow’s milk allergy and tolerance,” <i>Allergy</i>, vol. 76, no. 5. Wiley, pp. 1553–1556, 2021.","ama":"Pranger CL, Singer J, Köhler VK, et al. PIPE‐cloned human IgE and IgG4 antibodies: New tools for investigating cow’s milk allergy and tolerance. <i>Allergy</i>. 2021;76(5):1553-1556. doi:<a href=\"https://doi.org/10.1111/all.14604\">10.1111/all.14604</a>"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","doi":"10.1111/all.14604","pmid":1,"month":"05","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_published":"2021-05-01T00:00:00Z","status":"public","ddc":["570"],"publication_status":"published","file":[{"file_size":626081,"file_name":"2021_Allergy_Pranger.pdf","success":1,"file_id":"10837","date_created":"2022-03-08T11:23:16Z","checksum":"9526f9554112fc027c9f7fa540c488cd","relation":"main_file","content_type":"application/pdf","date_updated":"2022-03-08T11:23:16Z","access_level":"open_access","creator":"dernst"}],"day":"01","oa":1,"language":[{"iso":"eng"}],"oa_version":"Published Version","date_updated":"2023-09-05T15:58:53Z","issue":"5"},{"file_date_updated":"2022-03-08T11:31:30Z","_id":"10838","author":[{"first_name":"Anja M","orcid":"0000-0003-1050-4969","id":"3C147470-F248-11E8-B48F-1D18A9856A87","last_name":"Westram","full_name":"Westram, Anja M"},{"full_name":"Faria, Rui","last_name":"Faria","first_name":"Rui"},{"last_name":"Johannesson","first_name":"Kerstin","full_name":"Johannesson, Kerstin"},{"full_name":"Butlin, Roger","last_name":"Butlin","first_name":"Roger"}],"keyword":["Genetics","Ecology","Evolution","Behavior and Systematics"],"citation":{"chicago":"Westram, Anja M, Rui Faria, Kerstin Johannesson, and Roger Butlin. “Using Replicate Hybrid Zones to Understand the Genomic Basis of Adaptive Divergence.” <i>Molecular Ecology</i>. Wiley, 2021. <a href=\"https://doi.org/10.1111/mec.15861\">https://doi.org/10.1111/mec.15861</a>.","short":"A.M. Westram, R. Faria, K. Johannesson, R. Butlin, Molecular Ecology 30 (2021) 3797–3814.","apa":"Westram, A. M., Faria, R., Johannesson, K., &#38; Butlin, R. (2021). Using replicate hybrid zones to understand the genomic basis of adaptive divergence. <i>Molecular Ecology</i>. Wiley. <a href=\"https://doi.org/10.1111/mec.15861\">https://doi.org/10.1111/mec.15861</a>","ama":"Westram AM, Faria R, Johannesson K, Butlin R. Using replicate hybrid zones to understand the genomic basis of adaptive divergence. <i>Molecular Ecology</i>. 2021;30(15):3797-3814. doi:<a href=\"https://doi.org/10.1111/mec.15861\">10.1111/mec.15861</a>","ista":"Westram AM, Faria R, Johannesson K, Butlin R. 2021. Using replicate hybrid zones to understand the genomic basis of adaptive divergence. Molecular Ecology. 30(15), 3797–3814.","mla":"Westram, Anja M., et al. “Using Replicate Hybrid Zones to Understand the Genomic Basis of Adaptive Divergence.” <i>Molecular Ecology</i>, vol. 30, no. 15, Wiley, 2021, pp. 3797–814, doi:<a href=\"https://doi.org/10.1111/mec.15861\">10.1111/mec.15861</a>.","ieee":"A. M. Westram, R. Faria, K. Johannesson, and R. Butlin, “Using replicate hybrid zones to understand the genomic basis of adaptive divergence,” <i>Molecular Ecology</i>, vol. 30, no. 15. Wiley, pp. 3797–3814, 2021."},"quality_controlled":"1","scopus_import":"1","has_accepted_license":"1","isi":1,"type":"journal_article","publisher":"Wiley","intvolume":"        30","publication":"Molecular Ecology","year":"2021","volume":30,"external_id":{"pmid":["33638231"],"isi":["000669439700001"]},"article_type":"original","title":"Using replicate hybrid zones to understand the genomic basis of adaptive divergence","page":"3797-3814","department":[{"_id":"BeVi"}],"publication_identifier":{"issn":["0962-1083"],"eissn":["1365-294X"]},"article_processing_charge":"No","date_created":"2022-03-08T11:28:32Z","acknowledgement":"We thank everyone who helped with fieldwork, snail processing and DNA extractions, particularly Laura Brettell, Mårten Duvetorp, Juan Galindo, Anne-Lise Liabot, Mark Ravinet, Irena Senčić and Zuzanna Zagrodzka. We are also grateful to Edinburgh Genomics for library preparation and sequencing, to Stuart Baird and Mark Ravinet for helpful discussions, and to three anonymous reviewers for their constructive comments. This work was supported by the Natural Environment Research Council (NE/K014021/1), the European Research Council (AdG-693030-BARRIERS), Swedish Research Councils Formas and Vetenskapsrådet through a Linnaeus grant to the Centre for Marine Evolutionary Biology (217-2008-1719), the European Regional Development Fund (POCI-01-0145-FEDER-030628), and the Fundação para a iência e a Tecnologia,\r\nPortugal (PTDC/BIA-EVL/\r\n30628/2017). A.M.W. and R.F. were\r\nfunded by the European Union’s Horizon 2020 research and innovation\r\nprogramme under Marie Skłodowska-Curie\r\ngrant agreements\r\nno. 754411/797747 and no. 706376, respectively.","oa":1,"language":[{"iso":"eng"}],"date_updated":"2024-10-09T21:01:47Z","oa_version":"Published Version","issue":"15","file":[{"success":1,"file_name":"2021_MolecularEcology_Westram.pdf","file_size":1726548,"checksum":"d5611f243ceb63a0e091d6662ebd9cda","date_created":"2022-03-08T11:31:30Z","file_id":"10839","content_type":"application/pdf","relation":"main_file","creator":"dernst","access_level":"open_access","date_updated":"2022-03-08T11:31:30Z"}],"corr_author":"1","day":"01","status":"public","date_published":"2021-08-01T00:00:00Z","ddc":["570"],"abstract":[{"lang":"eng","text":"Combining hybrid zone analysis with genomic data is a promising approach to understanding the genomic basis of adaptive divergence. It allows for the identification of genomic regions underlying barriers to gene flow. It also provides insights into spatial patterns of allele frequency change, informing about the interplay between environmental factors, dispersal and selection. However, when only a single hybrid zone is analysed, it is difficult to separate patterns generated by selection from those resulting from chance. Therefore, it is beneficial to look for repeatable patterns across replicate hybrid zones in the same system. We applied this approach to the marine snail Littorina saxatilis, which contains two ecotypes, adapted to wave-exposed rocks vs. high-predation boulder fields. The existence of numerous hybrid zones between ecotypes offered the opportunity to test for the repeatability of genomic architectures and spatial patterns of divergence. We sampled and phenotyped snails from seven replicate hybrid zones on the Swedish west coast and genotyped them for thousands of single nucleotide polymorphisms. Shell shape and size showed parallel clines across all zones. Many genomic regions showing steep clines and/or high differentiation were shared among hybrid zones, consistent with a common evolutionary history and extensive gene flow between zones, and supporting the importance of these regions for divergence. In particular, we found that several large putative inversions contribute to divergence in all locations. Additionally, we found evidence for consistent displacement of clines from the boulder–rock transition. Our results demonstrate patterns of spatial variation that would not be accessible without continuous spatial sampling, a large genomic data set and replicate hybrid zones."}],"publication_status":"published","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","pmid":1,"doi":"10.1111/mec.15861","month":"08","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"}},{"department":[{"_id":"KrCh"}],"conference":{"name":"IJCAI: International Joint Conferences on Artificial Intelligence","location":"Virtual, Online","end_date":"2021-08-27","start_date":"2021-08-19"},"publication_identifier":{"issn":["1045-0823"],"isbn":["9780999241196"]},"article_processing_charge":"No","date_created":"2022-03-13T23:01:47Z","acknowledgement":"This research was supported by the Czech Science Foundation (no. 19-24384Y), by the OP VVV MEYS funded project CZ.02.1.01/0.0/0.0/16 019/0000765 “Research Center for Informatics”, by the ERC CoG 863818 (ForM-SMArt), and by the Combat Capabilities Development Command Army Research Laboratory and was accomplished under Cooperative\r\nAgreement Number W911NF-13-2-0045 (ARL Cyber Security CRA). The views and conclusions contained in this document are those of the authors and should not be interpreted as\r\nrepresenting the official policies, either expressed or implied, of the Combat Capabilities Development Command Army Research Laboratory or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes not withstanding any copyright notation here on. ","publication":"30th International Joint Conference on Artificial Intelligence","project":[{"call_identifier":"H2020","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"year":"2021","title":"Solving partially observable stochastic shortest-path games","page":"4182-4189","type":"conference","publisher":"International Joint Conferences on Artificial Intelligence","_id":"10847","author":[{"last_name":"Tomášek","first_name":"Petr","full_name":"Tomášek, Petr"},{"last_name":"Horák","first_name":"Karel","full_name":"Horák, Karel"},{"full_name":"Aradhye, Aditya","first_name":"Aditya","last_name":"Aradhye"},{"last_name":"Bošanský","first_name":"Branislav","full_name":"Bošanský, Branislav"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"}],"citation":{"chicago":"Tomášek, Petr, Karel Horák, Aditya Aradhye, Branislav Bošanský, and Krishnendu Chatterjee. “Solving Partially Observable Stochastic Shortest-Path Games.” In <i>30th International Joint Conference on Artificial Intelligence</i>, 4182–89. International Joint Conferences on Artificial Intelligence, 2021. <a href=\"https://doi.org/10.24963/ijcai.2021/575\">https://doi.org/10.24963/ijcai.2021/575</a>.","short":"P. Tomášek, K. Horák, A. Aradhye, B. Bošanský, K. Chatterjee, in:, 30th International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence, 2021, pp. 4182–4189.","apa":"Tomášek, P., Horák, K., Aradhye, A., Bošanský, B., &#38; Chatterjee, K. (2021). Solving partially observable stochastic shortest-path games. In <i>30th International Joint Conference on Artificial Intelligence</i> (pp. 4182–4189). Virtual, Online: International Joint Conferences on Artificial Intelligence. <a href=\"https://doi.org/10.24963/ijcai.2021/575\">https://doi.org/10.24963/ijcai.2021/575</a>","ama":"Tomášek P, Horák K, Aradhye A, Bošanský B, Chatterjee K. Solving partially observable stochastic shortest-path games. In: <i>30th International Joint Conference on Artificial Intelligence</i>. International Joint Conferences on Artificial Intelligence; 2021:4182-4189. doi:<a href=\"https://doi.org/10.24963/ijcai.2021/575\">10.24963/ijcai.2021/575</a>","ista":"Tomášek P, Horák K, Aradhye A, Bošanský B, Chatterjee K. 2021. Solving partially observable stochastic shortest-path games. 30th International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conferences on Artificial Intelligence, 4182–4189.","ieee":"P. Tomášek, K. Horák, A. Aradhye, B. Bošanský, and K. Chatterjee, “Solving partially observable stochastic shortest-path games,” in <i>30th International Joint Conference on Artificial Intelligence</i>, Virtual, Online, 2021, pp. 4182–4189.","mla":"Tomášek, Petr, et al. “Solving Partially Observable Stochastic Shortest-Path Games.” <i>30th International Joint Conference on Artificial Intelligence</i>, International Joint Conferences on Artificial Intelligence, 2021, pp. 4182–89, doi:<a href=\"https://doi.org/10.24963/ijcai.2021/575\">10.24963/ijcai.2021/575</a>."},"quality_controlled":"1","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.24963/ijcai.2021/575","main_file_link":[{"open_access":"1","url":"https://doi.org/10.24963/ijcai.2021/575"}],"month":"09","status":"public","date_published":"2021-09-01T00:00:00Z","publication_status":"published","abstract":[{"text":"We study the two-player zero-sum extension of the partially observable stochastic shortest-path problem where one agent has only partial information about the environment. We formulate this problem as a partially observable stochastic game (POSG): given a set of target states and negative rewards for each transition, the player with imperfect information maximizes the expected undiscounted total reward until a target state is reached. The second player with the perfect information aims for the opposite. We base our formalism on POSGs with one-sided observability (OS-POSGs) and give the following contributions: (1) we introduce a novel heuristic search value iteration algorithm that iteratively solves depth-limited variants of the game, (2) we derive the bound on the depth guaranteeing an arbitrary precision, (3) we propose a novel upper-bound estimation that allows early terminations, and (4) we experimentally evaluate the algorithm on a pursuit-evasion game.","lang":"eng"}],"day":"01","oa":1,"ec_funded":1,"language":[{"iso":"eng"}],"oa_version":"Published Version","date_updated":"2025-07-10T11:50:01Z"},{"type":"journal_article","isi":1,"intvolume":"        33","publisher":"World Scientific Publishing","author":[{"last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521","first_name":"Robert","full_name":"Seiringer, Robert"}],"_id":"10852","quality_controlled":"1","article_number":"2060012","scopus_import":"1","citation":{"ieee":"R. Seiringer, “The polaron at strong coupling,” <i>Reviews in Mathematical Physics</i>, vol. 33, no. 01. World Scientific Publishing, 2021.","ista":"Seiringer R. 2021. The polaron at strong coupling. Reviews in Mathematical Physics. 33(01), 2060012.","mla":"Seiringer, Robert. “The Polaron at Strong Coupling.” <i>Reviews in Mathematical Physics</i>, vol. 33, no. 01, 2060012, World Scientific Publishing, 2021, doi:<a href=\"https://doi.org/10.1142/s0129055x20600120\">10.1142/s0129055x20600120</a>.","ama":"Seiringer R. The polaron at strong coupling. <i>Reviews in Mathematical Physics</i>. 2021;33(01). doi:<a href=\"https://doi.org/10.1142/s0129055x20600120\">10.1142/s0129055x20600120</a>","short":"R. Seiringer, Reviews in Mathematical Physics 33 (2021).","apa":"Seiringer, R. (2021). The polaron at strong coupling. <i>Reviews in Mathematical Physics</i>. World Scientific Publishing. <a href=\"https://doi.org/10.1142/s0129055x20600120\">https://doi.org/10.1142/s0129055x20600120</a>","chicago":"Seiringer, Robert. “The Polaron at Strong Coupling.” <i>Reviews in Mathematical Physics</i>. World Scientific Publishing, 2021. <a href=\"https://doi.org/10.1142/s0129055x20600120\">https://doi.org/10.1142/s0129055x20600120</a>."},"keyword":["Mathematical Physics","Statistical and Nonlinear Physics"],"department":[{"_id":"RoSe"}],"date_created":"2022-03-18T08:11:34Z","acknowledgement":"This work was supported by the European Research Council (ERC) under the Euro-pean Union’s Horizon 2020 research and innovation programme (grant agreementNo. 694227).","article_processing_charge":"No","publication_identifier":{"issn":["0129-055X"],"eissn":["1793-6659"]},"article_type":"original","title":"The polaron at strong coupling","external_id":{"arxiv":["1912.12509"],"isi":["000613313200013"]},"volume":33,"year":"2021","project":[{"call_identifier":"H2020","grant_number":"694227","name":"Analysis of quantum many-body systems","_id":"25C6DC12-B435-11E9-9278-68D0E5697425"}],"publication":"Reviews in Mathematical Physics","corr_author":"1","day":"01","oa":1,"ec_funded":1,"language":[{"iso":"eng"}],"issue":"01","date_updated":"2025-04-14T07:26:58Z","oa_version":"Preprint","arxiv":1,"doi":"10.1142/s0129055x20600120","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","month":"02","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1912.12509"}],"date_published":"2021-02-01T00:00:00Z","status":"public","abstract":[{"lang":"eng","text":" We review old and new results on the Fröhlich polaron model. The discussion includes the validity of the (classical) Pekar approximation in the strong coupling limit, quantum corrections to this limit, as well as the divergence of the effective polaron mass."}],"publication_status":"published"},{"status":"public","date_published":"2021-07-01T00:00:00Z","publication_status":"published","abstract":[{"text":"Dynamic Connectivity is a fundamental algorithmic graph problem, motivated by a wide range of applications to social and communication networks and used as a building block in various other algorithms, such as the bi-connectivity and the dynamic minimal spanning tree problems. In brief, we wish to maintain the connected components of the graph under dynamic edge insertions and deletions. In the sequential case, the problem has been well-studied from both theoretical and practical perspectives. However, much less is known about efficient concurrent solutions to this problem. This is the gap we address in this paper. We start from one of the classic data structures used to solve this problem, the Euler Tour Tree. Our first contribution is a non-blocking single-writer implementation of it. We leverage this data structure to obtain the first truly concurrent generalization of dynamic connectivity, which preserves the time complexity of its sequential counterpart, but is also scalable in practice. To achieve this, we rely on three main techniques. The first is to ensure that connectivity queries, which usually dominate real-world workloads, are non-blocking. The second non-trivial technique expands the above idea by making all queries that do not change the connectivity structure non-blocking. The third ingredient is applying fine-grained locking for updating the connected components, which allows operations on disjoint components to occur in parallel. We evaluate the resulting algorithm on various workloads, executing on both real and synthetic graphs. The results show the efficiency of each of the proposed optimizations; the most efficient variant improves the performance of a coarse-grained based implementation on realistic scenarios up to 6x on average and up to 30x when connectivity queries dominate.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1145/3409964.3461810","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2105.08098"}],"month":"07","language":[{"iso":"eng"}],"oa":1,"arxiv":1,"date_updated":"2022-03-18T08:45:46Z","oa_version":"Preprint","day":"01","publication":"Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures","year":"2021","external_id":{"arxiv":["2105.08098"]},"title":"A scalable concurrent algorithm for dynamic connectivity","page":"208-220","department":[{"_id":"DaAl"}],"conference":{"name":"SPAA: Symposium on Parallelism in Algorithms and Architectures","location":"Virtual, Online","start_date":"2021-07-06","end_date":"2021-07-08"},"publication_identifier":{"isbn":["9781450380706"]},"article_processing_charge":"No","date_created":"2022-03-18T08:21:47Z","_id":"10853","author":[{"full_name":"Fedorov, Alexander","first_name":"Alexander","last_name":"Fedorov"},{"full_name":"Koval, Nikita","last_name":"Koval","first_name":"Nikita"},{"full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"}],"citation":{"chicago":"Fedorov, Alexander, Nikita Koval, and Dan-Adrian Alistarh. “A Scalable Concurrent Algorithm for Dynamic Connectivity.” In <i>Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures</i>, 208–20. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3409964.3461810\">https://doi.org/10.1145/3409964.3461810</a>.","short":"A. Fedorov, N. Koval, D.-A. Alistarh, in:, Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2021, pp. 208–220.","apa":"Fedorov, A., Koval, N., &#38; Alistarh, D.-A. (2021). A scalable concurrent algorithm for dynamic connectivity. In <i>Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures</i> (pp. 208–220). Virtual, Online: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3409964.3461810\">https://doi.org/10.1145/3409964.3461810</a>","ama":"Fedorov A, Koval N, Alistarh D-A. A scalable concurrent algorithm for dynamic connectivity. In: <i>Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures</i>. Association for Computing Machinery; 2021:208-220. doi:<a href=\"https://doi.org/10.1145/3409964.3461810\">10.1145/3409964.3461810</a>","ieee":"A. Fedorov, N. Koval, and D.-A. Alistarh, “A scalable concurrent algorithm for dynamic connectivity,” in <i>Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures</i>, Virtual, Online, 2021, pp. 208–220.","mla":"Fedorov, Alexander, et al. “A Scalable Concurrent Algorithm for Dynamic Connectivity.” <i>Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures</i>, Association for Computing Machinery, 2021, pp. 208–20, doi:<a href=\"https://doi.org/10.1145/3409964.3461810\">10.1145/3409964.3461810</a>.","ista":"Fedorov A, Koval N, Alistarh D-A. 2021. A scalable concurrent algorithm for dynamic connectivity. Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures. SPAA: Symposium on Parallelism in Algorithms and Architectures, 208–220."},"quality_controlled":"1","scopus_import":"1","type":"conference","publisher":"Association for Computing Machinery"},{"publisher":"Association for Computing Machinery","type":"conference","citation":{"apa":"Foerster, K.-T., Korhonen, J., Paz, A., Rybicki, J., &#38; Schmid, S. (2021). Input-dynamic distributed algorithms for communication networks. In <i>Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems</i> (pp. 71–72). Virtual, Online: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3410220.3453923\">https://doi.org/10.1145/3410220.3453923</a>","short":"K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, S. Schmid, in:, Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, Association for Computing Machinery, 2021, pp. 71–72.","chicago":"Foerster, Klaus-Tycho, Janne Korhonen, Ami Paz, Joel Rybicki, and Stefan Schmid. “Input-Dynamic Distributed Algorithms for Communication Networks.” In <i>Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems</i>, 71–72. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3410220.3453923\">https://doi.org/10.1145/3410220.3453923</a>.","ista":"Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. 2021. Input-dynamic distributed algorithms for communication networks. Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems. SIGMETRICS: International Conference on Measurement and Modeling of Computer Systems, 71–72.","ieee":"K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, and S. Schmid, “Input-dynamic distributed algorithms for communication networks,” in <i>Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems</i>, Virtual, Online, 2021, pp. 71–72.","mla":"Foerster, Klaus-Tycho, et al. “Input-Dynamic Distributed Algorithms for Communication Networks.” <i>Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems</i>, Association for Computing Machinery, 2021, pp. 71–72, doi:<a href=\"https://doi.org/10.1145/3410220.3453923\">10.1145/3410220.3453923</a>.","ama":"Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. Input-dynamic distributed algorithms for communication networks. In: <i>Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems</i>. Association for Computing Machinery; 2021:71-72. doi:<a href=\"https://doi.org/10.1145/3410220.3453923\">10.1145/3410220.3453923</a>"},"quality_controlled":"1","scopus_import":"1","author":[{"last_name":"Foerster","first_name":"Klaus-Tycho","full_name":"Foerster, Klaus-Tycho"},{"full_name":"Korhonen, Janne","first_name":"Janne","last_name":"Korhonen","id":"C5402D42-15BC-11E9-A202-CA2BE6697425"},{"last_name":"Paz","first_name":"Ami","full_name":"Paz, Ami"},{"full_name":"Rybicki, Joel","last_name":"Rybicki","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6432-6646","first_name":"Joel"},{"last_name":"Schmid","first_name":"Stefan","full_name":"Schmid, Stefan"}],"_id":"10854","publication_identifier":{"isbn":["9781450380720"]},"acknowledgement":"We thank Jukka Suomela for discussions. We also thank our shepherd Mohammad Hajiesmaili and the reviewers for their time and suggestions on how to improve the 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 805223 ScaleML), from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska–Curie grant agreement No. 840605, from the Vienna Science and Technology Fund (WWTF) project WHATIF, ICT19-045, 2020-2024, and from the Austrian Science Fund (FWF) and netIDEE SCIENCE project P 33775-N.","date_created":"2022-03-18T08:48:41Z","article_processing_charge":"No","department":[{"_id":"DaAl"}],"conference":{"name":"SIGMETRICS: International Conference on Measurement and Modeling of Computer Systems","location":"Virtual, Online","end_date":"2021-06-18","start_date":"2021-06-14"},"related_material":{"record":[{"relation":"extended_version","id":"10855","status":"public"}]},"page":"71-72","year":"2021","project":[{"call_identifier":"H2020","grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425","name":"Elastic Coordination for Scalable Machine Learning"},{"call_identifier":"H2020","grant_number":"840605","_id":"26A5D39A-B435-11E9-9278-68D0E5697425","name":"Coordination in constrained and natural distributed systems"}],"publication":"Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems","title":"Input-dynamic distributed algorithms for communication networks","external_id":{"arxiv":["2005.07637"]},"day":"01","arxiv":1,"oa_version":"Preprint","date_updated":"2025-04-14T13:52:09Z","ec_funded":1,"language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/2005.07637","open_access":"1"}],"month":"05","doi":"10.1145/3410220.3453923","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"Consider a distributed task where the communication network is fixed but the local inputs given to the nodes of the distributed system may change over time. In this work, we explore the following question: if some of the local inputs change, can an existing solution be updated efficiently, in a dynamic and distributed manner?\r\nTo address this question, we define the batch dynamic CONGEST model in which we are given a bandwidth-limited communication network and a dynamic edge labelling defines the problem input. The task is to maintain a solution to a graph problem on the labelled graph under batch changes. We investigate, when a batch of alpha edge label changes arrive, - how much time as a function of alpha we need to update an existing solution, and - how much information the nodes have to keep in local memory between batches in order to update the solution quickly.\r\nOur work lays the foundations for the theory of input-dynamic distributed network algorithms. We give a general picture of the complexity landscape in this model, design both universal algorithms and algorithms for concrete problems, and present a general framework for lower bounds. The diverse time complexity of our model spans from constant time, through time polynomial in alpha, and to alpha time, which we show to be enough for any task.","lang":"eng"}],"publication_status":"published","status":"public","date_published":"2021-05-01T00:00:00Z"},{"day":"01","date_updated":"2025-04-14T13:52:09Z","oa_version":"Preprint","issue":"1","arxiv":1,"language":[{"iso":"eng"}],"ec_funded":1,"oa":1,"month":"03","main_file_link":[{"url":"https://arxiv.org/abs/2005.07637","open_access":"1"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1145/3447384","abstract":[{"text":"Consider a distributed task where the communication network is fixed but the local inputs given to the nodes of the distributed system may change over time. In this work, we explore the following question: if some of the local inputs change, can an existing solution be updated efficiently, in a dynamic and distributed manner? To address this question, we define the batch dynamic \\congest model in which we are given a bandwidth-limited communication network and a dynamic edge labelling defines the problem input. The task is to maintain a solution to a graph problem on the labeled graph under batch changes. We investigate, when a batch of α edge label changes arrive, \\beginitemize \\item how much time as a function of α we need to update an existing solution, and \\item how much information the nodes have to keep in local memory between batches in order to update the solution quickly. \\enditemize Our work lays the foundations for the theory of input-dynamic distributed network algorithms. We give a general picture of the complexity landscape in this model, design both universal algorithms and algorithms for concrete problems, and present a general framework for lower bounds. In particular, we derive non-trivial upper bounds for two selected, contrasting problems: maintaining a minimum spanning tree and detecting cliques.","lang":"eng"}],"publication_status":"published","date_published":"2021-03-01T00:00:00Z","status":"public","intvolume":"         5","publisher":"Association for Computing Machinery","type":"journal_article","scopus_import":"1","quality_controlled":"1","keyword":["Computer Networks and Communications","Hardware and Architecture","Safety","Risk","Reliability and Quality","Computer Science (miscellaneous)"],"citation":{"chicago":"Foerster, Klaus-Tycho, Janne Korhonen, Ami Paz, Joel Rybicki, and Stefan Schmid. “Input-Dynamic Distributed Algorithms for Communication Networks.” <i>Proceedings of the ACM on Measurement and Analysis of Computing Systems</i>. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3447384\">https://doi.org/10.1145/3447384</a>.","apa":"Foerster, K.-T., Korhonen, J., Paz, A., Rybicki, J., &#38; Schmid, S. (2021). Input-dynamic distributed algorithms for communication networks. <i>Proceedings of the ACM on Measurement and Analysis of Computing Systems</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3447384\">https://doi.org/10.1145/3447384</a>","short":"K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, S. Schmid, Proceedings of the ACM on Measurement and Analysis of Computing Systems 5 (2021) 1–33.","ama":"Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. Input-dynamic distributed algorithms for communication networks. <i>Proceedings of the ACM on Measurement and Analysis of Computing Systems</i>. 2021;5(1):1-33. doi:<a href=\"https://doi.org/10.1145/3447384\">10.1145/3447384</a>","mla":"Foerster, Klaus-Tycho, et al. “Input-Dynamic Distributed Algorithms for Communication Networks.” <i>Proceedings of the ACM on Measurement and Analysis of Computing Systems</i>, vol. 5, no. 1, Association for Computing Machinery, 2021, pp. 1–33, doi:<a href=\"https://doi.org/10.1145/3447384\">10.1145/3447384</a>.","ista":"Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. 2021. Input-dynamic distributed algorithms for communication networks. Proceedings of the ACM on Measurement and Analysis of Computing Systems. 5(1), 1–33.","ieee":"K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, and S. Schmid, “Input-dynamic distributed algorithms for communication networks,” <i>Proceedings of the ACM on Measurement and Analysis of Computing Systems</i>, vol. 5, no. 1. Association for Computing Machinery, pp. 1–33, 2021."},"_id":"10855","author":[{"full_name":"Foerster, Klaus-Tycho","first_name":"Klaus-Tycho","last_name":"Foerster"},{"full_name":"Korhonen, Janne","last_name":"Korhonen","id":"C5402D42-15BC-11E9-A202-CA2BE6697425","first_name":"Janne"},{"first_name":"Ami","last_name":"Paz","full_name":"Paz, Ami"},{"full_name":"Rybicki, Joel","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","last_name":"Rybicki","orcid":"0000-0002-6432-6646","first_name":"Joel"},{"full_name":"Schmid, Stefan","first_name":"Stefan","last_name":"Schmid"}],"article_processing_charge":"No","acknowledgement":"We thank Jukka Suomela for discussions. We also thank our shepherd Mohammad Hajiesmaili\r\nand the reviewers for their time and suggestions on how to improve the paper. This project\r\nhas received funding from the European Research Council (ERC) under the European Union’s\r\nHorizon 2020 research and innovation programme (grant agreement No 805223 ScaleML), from the European Union’s Horizon 2020 research and innovation programme under the Marie\r\nSk lodowska–Curie grant agreement No. 840605, from the Vienna Science and Technology Fund (WWTF) project WHATIF, ICT19-045, 2020-2024, and from the Austrian Science Fund (FWF) and netIDEE SCIENCE project P 33775-N.","date_created":"2022-03-18T09:10:27Z","publication_identifier":{"issn":["2476-1249"]},"department":[{"_id":"DaAl"}],"page":"1-33","related_material":{"record":[{"relation":"shorter_version","status":"public","id":"10854"}]},"volume":5,"title":"Input-dynamic distributed algorithms for communication networks","article_type":"original","external_id":{"arxiv":["2005.07637"]},"publication":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","project":[{"_id":"26A5D39A-B435-11E9-9278-68D0E5697425","name":"Coordination in constrained and natural distributed systems","call_identifier":"H2020","grant_number":"840605"},{"grant_number":"805223","call_identifier":"H2020","_id":"268A44D6-B435-11E9-9278-68D0E5697425","name":"Elastic Coordination for Scalable Machine Learning"}],"year":"2021"},{"publication_status":"published","abstract":[{"lang":"eng","text":"We study the properties of the maximal volume k-dimensional sections of the n-dimensional cube [−1, 1]n. We obtain a first order necessary condition for a k-dimensional subspace to be a local maximizer of the volume of such sections, which we formulate in a geometric way. We estimate the length of the projection of a vector of the standard basis of Rn onto a k-dimensional subspace that maximizes the volume of the intersection. We \u001cnd the optimal upper bound on the volume of a planar section of the cube [−1, 1]n , n ≥ 2."}],"ddc":["510"],"date_published":"2021-01-29T00:00:00Z","status":"public","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"month":"01","doi":"10.1515/agms-2020-0103","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","issue":"1","oa_version":"Published Version","date_updated":"2023-08-17T07:07:58Z","arxiv":1,"oa":1,"language":[{"iso":"eng"}],"day":"29","file":[{"success":1,"file_name":"2021_AnalysisMetricSpaces_Ivanov.pdf","file_size":789801,"checksum":"7e615ac8489f5eae580b6517debfdc53","date_created":"2022-03-18T09:31:59Z","file_id":"10857","content_type":"application/pdf","relation":"main_file","creator":"dernst","access_level":"open_access","date_updated":"2022-03-18T09:31:59Z"}],"page":"1-18","external_id":{"isi":["000734286800001"],"arxiv":["2004.02674"]},"title":"On the volume of sections of the cube","article_type":"original","volume":9,"year":"2021","publication":"Analysis and Geometry in Metric Spaces","date_created":"2022-03-18T09:25:14Z","acknowledgement":"The authors acknowledge the support of the grant of the Russian Government N 075-15-\r\n2019-1926. G.I.was supported also by the SwissNational Science Foundation grant 200021-179133. The authors are very grateful to the anonymous reviewer for valuable remarks.","article_processing_charge":"No","publication_identifier":{"issn":["2299-3274"]},"department":[{"_id":"UlWa"}],"has_accepted_license":"1","quality_controlled":"1","scopus_import":"1","citation":{"ama":"Ivanov G, Tsiutsiurupa I. On the volume of sections of the cube. <i>Analysis and Geometry in Metric Spaces</i>. 2021;9(1):1-18. doi:<a href=\"https://doi.org/10.1515/agms-2020-0103\">10.1515/agms-2020-0103</a>","ista":"Ivanov G, Tsiutsiurupa I. 2021. On the volume of sections of the cube. Analysis and Geometry in Metric Spaces. 9(1), 1–18.","mla":"Ivanov, Grigory, and Igor Tsiutsiurupa. “On the Volume of Sections of the Cube.” <i>Analysis and Geometry in Metric Spaces</i>, vol. 9, no. 1, De Gruyter, 2021, pp. 1–18, doi:<a href=\"https://doi.org/10.1515/agms-2020-0103\">10.1515/agms-2020-0103</a>.","ieee":"G. Ivanov and I. Tsiutsiurupa, “On the volume of sections of the cube,” <i>Analysis and Geometry in Metric Spaces</i>, vol. 9, no. 1. De Gruyter, pp. 1–18, 2021.","chicago":"Ivanov, Grigory, and Igor Tsiutsiurupa. “On the Volume of Sections of the Cube.” <i>Analysis and Geometry in Metric Spaces</i>. De Gruyter, 2021. <a href=\"https://doi.org/10.1515/agms-2020-0103\">https://doi.org/10.1515/agms-2020-0103</a>.","short":"G. Ivanov, I. Tsiutsiurupa, Analysis and Geometry in Metric Spaces 9 (2021) 1–18.","apa":"Ivanov, G., &#38; Tsiutsiurupa, I. (2021). On the volume of sections of the cube. <i>Analysis and Geometry in Metric Spaces</i>. De Gruyter. <a href=\"https://doi.org/10.1515/agms-2020-0103\">https://doi.org/10.1515/agms-2020-0103</a>"},"keyword":["Applied Mathematics","Geometry and Topology","Analysis"],"author":[{"full_name":"Ivanov, Grigory","id":"87744F66-5C6F-11EA-AFE0-D16B3DDC885E","last_name":"Ivanov","first_name":"Grigory"},{"last_name":"Tsiutsiurupa","first_name":"Igor","full_name":"Tsiutsiurupa, Igor"}],"_id":"10856","file_date_updated":"2022-03-18T09:31:59Z","intvolume":"         9","publisher":"De Gruyter","type":"journal_article","isi":1},{"day":"14","corr_author":"1","file":[{"checksum":"f28a8b5cf80f5605828359bb398463b0","date_created":"2022-03-18T09:53:15Z","file_id":"10859","success":1,"file_size":4867547,"file_name":"2021_Nanomaterials_Li.pdf","creator":"dernst","access_level":"open_access","date_updated":"2022-03-18T09:53:15Z","content_type":"application/pdf","relation":"main_file"}],"oa_version":"Published Version","date_updated":"2025-06-12T06:42:18Z","issue":"7","ec_funded":1,"oa":1,"language":[{"iso":"eng"}],"month":"07","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","pmid":1,"doi":"10.3390/nano11071827","ddc":["540"],"publication_status":"published","abstract":[{"lang":"eng","text":"The cost-effective conversion of low-grade heat into electricity using thermoelectric devices requires developing alternative materials and material processing technologies able to reduce the currently high device manufacturing costs. In this direction, thermoelectric materials that do not rely on rare or toxic elements such as tellurium or lead need to be produced using high-throughput technologies not involving high temperatures and long processes. Bi2Se3 is an obvious possible Te-free alternative to Bi2Te3 for ambient temperature thermoelectric applications, but its performance is still low for practical applications, and additional efforts toward finding proper dopants are required. Here, we report a scalable method to produce Bi2Se3 nanosheets at low synthesis temperatures. We studied the influence of different dopants on the thermoelectric properties of this material. Among the elements tested, we demonstrated that Sn doping resulted in the best performance. Sn incorporation resulted in a significant improvement to the Bi2Se3 Seebeck coefficient and a reduction in the thermal conductivity in the direction of the hot-press axis, resulting in an overall 60% improvement in the thermoelectric figure of merit of Bi2Se3."}],"date_published":"2021-07-14T00:00:00Z","status":"public","intvolume":"        11","publisher":"MDPI","isi":1,"type":"journal_article","scopus_import":"1","quality_controlled":"1","article_number":"1827","has_accepted_license":"1","keyword":["General Materials Science","General Chemical Engineering"],"citation":{"apa":"Li, M., Zhang, Y., Zhang, T., Zuo, Y., Xiao, K., Arbiol, J., … Cabot, A. (2021). Enhanced thermoelectric performance of n-type Bi2Se3 nanosheets through Sn doping. <i>Nanomaterials</i>. MDPI. <a href=\"https://doi.org/10.3390/nano11071827\">https://doi.org/10.3390/nano11071827</a>","short":"M. Li, Y. Zhang, T. Zhang, Y. Zuo, K. Xiao, J. Arbiol, J. Llorca, Y. Liu, A. Cabot, Nanomaterials 11 (2021).","chicago":"Li, Mengyao, Yu Zhang, Ting Zhang, Yong Zuo, Ke Xiao, Jordi Arbiol, Jordi Llorca, Yu Liu, and Andreu Cabot. “Enhanced Thermoelectric Performance of N-Type Bi2Se3 Nanosheets through Sn Doping.” <i>Nanomaterials</i>. MDPI, 2021. <a href=\"https://doi.org/10.3390/nano11071827\">https://doi.org/10.3390/nano11071827</a>.","ieee":"M. Li <i>et al.</i>, “Enhanced thermoelectric performance of n-type Bi2Se3 nanosheets through Sn doping,” <i>Nanomaterials</i>, vol. 11, no. 7. MDPI, 2021.","ista":"Li M, Zhang Y, Zhang T, Zuo Y, Xiao K, Arbiol J, Llorca J, Liu Y, Cabot A. 2021. Enhanced thermoelectric performance of n-type Bi2Se3 nanosheets through Sn doping. Nanomaterials. 11(7), 1827.","mla":"Li, Mengyao, et al. “Enhanced Thermoelectric Performance of N-Type Bi2Se3 Nanosheets through Sn Doping.” <i>Nanomaterials</i>, vol. 11, no. 7, 1827, MDPI, 2021, doi:<a href=\"https://doi.org/10.3390/nano11071827\">10.3390/nano11071827</a>.","ama":"Li M, Zhang Y, Zhang T, et al. Enhanced thermoelectric performance of n-type Bi2Se3 nanosheets through Sn doping. <i>Nanomaterials</i>. 2021;11(7). doi:<a href=\"https://doi.org/10.3390/nano11071827\">10.3390/nano11071827</a>"},"file_date_updated":"2022-03-18T09:53:15Z","_id":"10858","author":[{"full_name":"Li, Mengyao","last_name":"Li","first_name":"Mengyao"},{"full_name":"Zhang, Yu","first_name":"Yu","last_name":"Zhang"},{"last_name":"Zhang","first_name":"Ting","full_name":"Zhang, Ting"},{"last_name":"Zuo","first_name":"Yong","full_name":"Zuo, Yong"},{"last_name":"Xiao","first_name":"Ke","full_name":"Xiao, Ke"},{"full_name":"Arbiol, Jordi","first_name":"Jordi","last_name":"Arbiol"},{"last_name":"Llorca","first_name":"Jordi","full_name":"Llorca, Jordi"},{"first_name":"Yu","orcid":"0000-0001-7313-6740","last_name":"Liu","id":"2A70014E-F248-11E8-B48F-1D18A9856A87","full_name":"Liu, Yu"},{"full_name":"Cabot, Andreu","last_name":"Cabot","first_name":"Andreu"}],"article_processing_charge":"No","acknowledgement":"M.L., Y.Z., T.Z. and K.X. thank the China Scholarship Council for their scholarship\r\nsupport. Y.L. acknowledges funding from the European Union’s Horizon 2020 research and\r\ninnovation program under the Marie Sklodowska-Curie grant agreement No. 754411. J.L. thanks the ICREA Academia program and projects MICINN/FEDER RTI2018-093996-B-C31 and G.C. 2017 SGR 128. ICN2 acknowledges funding from the Generalitat de Catalunya 2017 SGR 327 and the Spanish MINECO ENE2017-85087-C3.","date_created":"2022-03-18T09:45:02Z","publication_identifier":{"issn":["2079-4991"]},"department":[{"_id":"MaIb"}],"volume":11,"article_type":"original","title":"Enhanced thermoelectric performance of n-type Bi2Se3 nanosheets through Sn doping","external_id":{"pmid":["34361214"],"isi":["000676570000001"]},"publication":"Nanomaterials","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","grant_number":"754411"}],"year":"2021"},{"isi":1,"type":"journal_article","publisher":"Canadian Mathematical Society","intvolume":"        64","_id":"10860","author":[{"first_name":"Grigory","id":"87744F66-5C6F-11EA-AFE0-D16B3DDC885E","last_name":"Ivanov","full_name":"Ivanov, Grigory"}],"keyword":["General Mathematics","Tight frame","Grassmannian","zonotope"],"citation":{"ista":"Ivanov G. 2021. Tight frames and related geometric problems. Canadian Mathematical Bulletin. 64(4), 942–963.","mla":"Ivanov, Grigory. “Tight Frames and Related Geometric Problems.” <i>Canadian Mathematical Bulletin</i>, vol. 64, no. 4, Canadian Mathematical Society, 2021, pp. 942–63, doi:<a href=\"https://doi.org/10.4153/s000843952000096x\">10.4153/s000843952000096x</a>.","ieee":"G. Ivanov, “Tight frames and related geometric problems,” <i>Canadian Mathematical Bulletin</i>, vol. 64, no. 4. Canadian Mathematical Society, pp. 942–963, 2021.","ama":"Ivanov G. Tight frames and related geometric problems. <i>Canadian Mathematical Bulletin</i>. 2021;64(4):942-963. doi:<a href=\"https://doi.org/10.4153/s000843952000096x\">10.4153/s000843952000096x</a>","apa":"Ivanov, G. (2021). Tight frames and related geometric problems. <i>Canadian Mathematical Bulletin</i>. Canadian Mathematical Society. <a href=\"https://doi.org/10.4153/s000843952000096x\">https://doi.org/10.4153/s000843952000096x</a>","short":"G. Ivanov, Canadian Mathematical Bulletin 64 (2021) 942–963.","chicago":"Ivanov, Grigory. “Tight Frames and Related Geometric Problems.” <i>Canadian Mathematical Bulletin</i>. Canadian Mathematical Society, 2021. <a href=\"https://doi.org/10.4153/s000843952000096x\">https://doi.org/10.4153/s000843952000096x</a>."},"quality_controlled":"1","scopus_import":"1","department":[{"_id":"UlWa"}],"publication_identifier":{"issn":["0008-4395"],"eissn":["1496-4287"]},"article_processing_charge":"No","date_created":"2022-03-18T09:55:59Z","acknowledgement":"The author was supported by the Swiss National Science Foundation grant 200021_179133. The author acknowledges the financial support from the Ministry of Education and Science of the Russian Federation in the framework of MegaGrant no. 075-15-2019-1926.","publication":"Canadian Mathematical Bulletin","year":"2021","volume":64,"external_id":{"isi":["000730165300021"],"arxiv":["1804.10055"]},"title":"Tight frames and related geometric problems","article_type":"original","page":"942-963","corr_author":"1","day":"18","oa":1,"language":[{"iso":"eng"}],"arxiv":1,"date_updated":"2024-10-09T21:01:50Z","oa_version":"Preprint","issue":"4","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","doi":"10.4153/s000843952000096x","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.10055"}],"month":"12","status":"public","date_published":"2021-12-18T00:00:00Z","abstract":[{"text":"A tight frame is the orthogonal projection of some orthonormal basis of Rn onto Rk. We show that a set of vectors is a tight frame if and only if the set of all cross products of these vectors is a tight frame. We reformulate a range of problems on the volume of projections (or sections) of regular polytopes in terms of tight frames and write a first-order necessary condition for local extrema of these problems. As applications, we prove new results for the problem of maximization of the volume of zonotopes.","lang":"eng"}],"publication_status":"published"},{"doi":"10.48550/ARXIV.2108.06686","department":[{"_id":"GaTk"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"url":"https://arxiv.org/abs/2108.06686","open_access":"1"}],"acknowledgement":"FL acknowledges support from the European Union’s Horizon 2020 research and innovation program under the Marie Sklodowska-Curie Grant Agreement No. 754411. GT\r\nacknowledges the support of the Austrian Science Fund (FWF) under Stand-Alone Grant\r\nNo. P34015.","date_created":"2022-03-21T11:41:28Z","article_processing_charge":"No","month":"08","status":"public","year":"2021","project":[{"grant_number":"754411","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425"},{"grant_number":"P34015","name":"Efficient coding with biophysical realism","_id":"626c45b5-2b32-11ec-9570-e509828c1ba6"}],"external_id":{"arxiv":["2108.06686"]},"title":"Quantifying the coexistence of neuronal oscillations and avalanches","date_published":"2021-08-17T00:00:00Z","publication_status":"submitted","abstract":[{"lang":"eng","text":"Brain dynamics display collective phenomena as diverse as neuronal oscillations and avalanches. Oscillations are rhythmic, with fluctuations occurring at a characteristic scale, whereas avalanches are scale-free cascades of neural activity. Here we show that such antithetic features can coexist in a very generic class of adaptive neural networks. In the most simple yet fully microscopic model from this class we make direct contact with human brain resting-state activity recordings via tractable inference of the model's two essential parameters. The inferred model quantitatively captures the dynamics over a broad range of scales, from single sensor fluctuations, collective behaviors of nearly-synchronous extreme events on multiple sensors, to neuronal avalanches unfolding over multiple sensors across multiple time-bins. Importantly, the inferred parameters correlate with model-independent signatures of \"closeness to criticality\", suggesting that the coexistence of scale-specific (neural oscillations) and scale-free (neuronal avalanches) dynamics in brain activity occurs close to a non-equilibrium critical point at the onset of self-sustained oscillations."}],"page":"37","ddc":["570"],"type":"preprint","publisher":"arXiv","day":"17","author":[{"full_name":"Lombardi, Fabrizio","last_name":"Lombardi","id":"A057D288-3E88-11E9-986D-0CF4E5697425","orcid":"0000-0003-2623-5249","first_name":"Fabrizio"},{"last_name":"Pepic","id":"F93245C4-C3CA-11E9-B4F0-C6F4E5697425","first_name":"Selver","full_name":"Pepic, Selver"},{"last_name":"Shriki","first_name":"Oren","full_name":"Shriki, Oren"},{"first_name":"Gašper","orcid":"0000-0002-6699-1455","last_name":"Tkačik","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","full_name":"Tkačik, Gašper"},{"last_name":"De Martino","first_name":"Daniele","full_name":"De Martino, Daniele"}],"language":[{"iso":"eng"}],"_id":"10912","ec_funded":1,"oa":1,"citation":{"chicago":"Lombardi, Fabrizio, Selver Pepic, Oren Shriki, Gašper Tkačik, and Daniele De Martino. “Quantifying the Coexistence of Neuronal Oscillations and Avalanches.” arXiv, n.d. <a href=\"https://doi.org/10.48550/ARXIV.2108.06686\">https://doi.org/10.48550/ARXIV.2108.06686</a>.","short":"F. Lombardi, S. Pepic, O. Shriki, G. Tkačik, D. De Martino, (n.d.).","apa":"Lombardi, F., Pepic, S., Shriki, O., Tkačik, G., &#38; De Martino, D. (n.d.). Quantifying the coexistence of neuronal oscillations and avalanches. arXiv. <a href=\"https://doi.org/10.48550/ARXIV.2108.06686\">https://doi.org/10.48550/ARXIV.2108.06686</a>","ama":"Lombardi F, Pepic S, Shriki O, Tkačik G, De Martino D. Quantifying the coexistence of neuronal oscillations and avalanches. doi:<a href=\"https://doi.org/10.48550/ARXIV.2108.06686\">10.48550/ARXIV.2108.06686</a>","ieee":"F. Lombardi, S. Pepic, O. Shriki, G. Tkačik, and D. De Martino, “Quantifying the coexistence of neuronal oscillations and avalanches.” arXiv.","mla":"Lombardi, Fabrizio, et al. <i>Quantifying the Coexistence of Neuronal Oscillations and Avalanches</i>. arXiv, doi:<a href=\"https://doi.org/10.48550/ARXIV.2108.06686\">10.48550/ARXIV.2108.06686</a>.","ista":"Lombardi F, Pepic S, Shriki O, Tkačik G, De Martino D. Quantifying the coexistence of neuronal oscillations and avalanches. <a href=\"https://doi.org/10.48550/ARXIV.2108.06686\">10.48550/ARXIV.2108.06686</a>."},"arxiv":1,"oa_version":"Preprint","date_updated":"2024-10-22T11:24:26Z"},{"month":"11","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","pmid":1,"doi":"10.1016/j.devcel.2021.10.008","extern":"1","publication_status":"published","abstract":[{"lang":"eng","text":"In order to combat molecular damage, most cellular proteins undergo rapid turnover. We have previously identified large nuclear protein assemblies that can persist for years in post-mitotic tissues and are subject to age-related decline. Here, we report that mitochondria can be long lived in the mouse brain and reveal that specific mitochondrial proteins have half-lives longer than the average proteome. These mitochondrial long-lived proteins (mitoLLPs) are core components of the electron transport chain (ETC) and display increased longevity in respiratory supercomplexes. We find that COX7C, a mitoLLP that forms a stable contact site between complexes I and IV, is required for complex IV and supercomplex assembly. Remarkably, even upon depletion of COX7C transcripts, ETC function is maintained for days, effectively uncoupling mitochondrial function from ongoing transcription of its mitoLLPs. Our results suggest that modulating protein longevity within the ETC is critical for mitochondrial proteome maintenance and the robustness of mitochondrial function."}],"date_published":"2021-11-08T00:00:00Z","status":"public","day":"08","oa_version":"None","date_updated":"2025-12-15T10:01:56Z","issue":"21","language":[{"iso":"eng"}],"article_processing_charge":"No","date_created":"2022-04-07T07:43:14Z","publication_identifier":{"issn":["1534-5807"]},"department":[{"_id":"MaHe"}],"page":"P2952-2965.e9","volume":56,"article_type":"original","title":"Identification of long-lived proteins in the mitochondria reveals increased stability of the electron transport chain","external_id":{"pmid":["34715012"]},"publication":"Developmental Cell","year":"2021","intvolume":"        56","publisher":"Elsevier","type":"journal_article","scopus_import":"1","quality_controlled":"1","keyword":["Developmental Biology","Cell Biology","General Biochemistry","Genetics and Molecular Biology","Molecular Biology"],"citation":{"short":"S. Krishna, R. Arrojo e Drigo, J.S. Capitanio, R. Ramachandra, M. Ellisman, M. Hetzer, Developmental Cell 56 (2021) P2952–2965.e9.","apa":"Krishna, S., Arrojo e Drigo, R., Capitanio, J. S., Ramachandra, R., Ellisman, M., &#38; Hetzer, M. (2021). Identification of long-lived proteins in the mitochondria reveals increased stability of the electron transport chain. <i>Developmental Cell</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.devcel.2021.10.008\">https://doi.org/10.1016/j.devcel.2021.10.008</a>","chicago":"Krishna, Shefali, Rafael Arrojo e Drigo, Juliana S. Capitanio, Ranjan Ramachandra, Mark Ellisman, and Martin Hetzer. “Identification of Long-Lived Proteins in the Mitochondria Reveals Increased Stability of the Electron Transport Chain.” <i>Developmental Cell</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.devcel.2021.10.008\">https://doi.org/10.1016/j.devcel.2021.10.008</a>.","ieee":"S. Krishna, R. Arrojo e Drigo, J. S. Capitanio, R. Ramachandra, M. Ellisman, and M. Hetzer, “Identification of long-lived proteins in the mitochondria reveals increased stability of the electron transport chain,” <i>Developmental Cell</i>, vol. 56, no. 21. Elsevier, p. P2952–2965.e9, 2021.","mla":"Krishna, Shefali, et al. “Identification of Long-Lived Proteins in the Mitochondria Reveals Increased Stability of the Electron Transport Chain.” <i>Developmental Cell</i>, vol. 56, no. 21, Elsevier, 2021, p. P2952–2965.e9, doi:<a href=\"https://doi.org/10.1016/j.devcel.2021.10.008\">10.1016/j.devcel.2021.10.008</a>.","ista":"Krishna S, Arrojo e Drigo R, Capitanio JS, Ramachandra R, Ellisman M, Hetzer M. 2021. Identification of long-lived proteins in the mitochondria reveals increased stability of the electron transport chain. Developmental Cell. 56(21), P2952–2965.e9.","ama":"Krishna S, Arrojo e Drigo R, Capitanio JS, Ramachandra R, Ellisman M, Hetzer M. Identification of long-lived proteins in the mitochondria reveals increased stability of the electron transport chain. <i>Developmental Cell</i>. 2021;56(21):P2952-2965.e9. doi:<a href=\"https://doi.org/10.1016/j.devcel.2021.10.008\">10.1016/j.devcel.2021.10.008</a>"},"_id":"11052","author":[{"full_name":"Krishna, Shefali","last_name":"Krishna","first_name":"Shefali"},{"first_name":"Rafael","last_name":"Arrojo e Drigo","full_name":"Arrojo e Drigo, Rafael"},{"first_name":"Juliana S.","last_name":"Capitanio","full_name":"Capitanio, Juliana S."},{"first_name":"Ranjan","last_name":"Ramachandra","full_name":"Ramachandra, Ranjan"},{"first_name":"Mark","last_name":"Ellisman","full_name":"Ellisman, Mark"},{"first_name":"Martin W","last_name":"HETZER","id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed","orcid":"0000-0002-2111-992X","full_name":"HETZER, Martin W"}]},{"day":"18","oa":1,"language":[{"iso":"eng"}],"ec_funded":1,"arxiv":1,"date_updated":"2025-04-14T07:43:57Z","oa_version":"Preprint","issue":"9B","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.1905.11845"}],"month":"05","status":"public","date_published":"2021-05-18T00:00:00Z","abstract":[{"lang":"eng","text":"Asynchronous distributed algorithms are a popular way to reduce synchronization costs in large-scale optimization, and in particular for neural network training. However, for nonsmooth and nonconvex objectives, few convergence guarantees exist beyond cases where closed-form proximal operator solutions are available. As training most popular deep neural networks corresponds to optimizing nonsmooth and nonconvex objectives, there is a pressing need for such convergence guarantees. In this paper, we analyze for the first time the convergence of stochastic asynchronous optimization for this general class of objectives. In particular, we focus on stochastic subgradient methods allowing for block variable partitioning, where the shared model is asynchronously updated by concurrent processes. To this end, we use a probabilistic model which captures key features of real asynchronous scheduling between concurrent processes. Under this model, we establish convergence with probability one to an invariant set for stochastic subgradient methods with momentum. From a practical perspective, one issue with the family of algorithms that we consider is that they are not efficiently supported by machine learning frameworks, which mostly focus on distributed data-parallel strategies. To address this, we propose a new implementation strategy for shared-memory based training of deep neural networks for a partitioned but shared model in single- and multi-GPU settings. Based on this implementation, we achieve on average1.2x speed-up in comparison to state-of-the-art training methods for popular image classification tasks, without compromising accuracy."}],"publication_status":"published","type":"conference","publisher":"AAAI Press","intvolume":"        35","_id":"11436","author":[{"full_name":"Kungurtsev, Vyacheslav","last_name":"Kungurtsev","first_name":"Vyacheslav"},{"first_name":"Malcolm","last_name":"Egan","full_name":"Egan, Malcolm"},{"full_name":"Chatterjee, Bapi","first_name":"Bapi","orcid":"0000-0002-2742-4028","last_name":"Chatterjee","id":"3C41A08A-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian"}],"citation":{"ama":"Kungurtsev V, Egan M, Chatterjee B, Alistarh D-A. Asynchronous optimization methods for efficient training of deep neural networks with guarantees. In: <i>35th AAAI Conference on Artificial Intelligence, AAAI 2021</i>. Vol 35. AAAI Press; 2021:8209-8216.","ista":"Kungurtsev V, Egan M, Chatterjee B, Alistarh D-A. 2021. Asynchronous optimization methods for efficient training of deep neural networks with guarantees. 35th AAAI Conference on Artificial Intelligence, AAAI 2021. AAAI: Conference on Artificial Intelligence vol. 35, 8209–8216.","ieee":"V. Kungurtsev, M. Egan, B. Chatterjee, and D.-A. Alistarh, “Asynchronous optimization methods for efficient training of deep neural networks with guarantees,” in <i>35th AAAI Conference on Artificial Intelligence, AAAI 2021</i>, Virtual, Online, 2021, vol. 35, no. 9B, pp. 8209–8216.","mla":"Kungurtsev, Vyacheslav, et al. “Asynchronous Optimization Methods for Efficient Training of Deep Neural Networks with Guarantees.” <i>35th AAAI Conference on Artificial Intelligence, AAAI 2021</i>, vol. 35, no. 9B, AAAI Press, 2021, pp. 8209–16.","chicago":"Kungurtsev, Vyacheslav, Malcolm Egan, Bapi Chatterjee, and Dan-Adrian Alistarh. “Asynchronous Optimization Methods for Efficient Training of Deep Neural Networks with Guarantees.” In <i>35th AAAI Conference on Artificial Intelligence, AAAI 2021</i>, 35:8209–16. AAAI Press, 2021.","short":"V. Kungurtsev, M. Egan, B. Chatterjee, D.-A. Alistarh, in:, 35th AAAI Conference on Artificial Intelligence, AAAI 2021, AAAI Press, 2021, pp. 8209–8216.","apa":"Kungurtsev, V., Egan, M., Chatterjee, B., &#38; Alistarh, D.-A. (2021). Asynchronous optimization methods for efficient training of deep neural networks with guarantees. In <i>35th AAAI Conference on Artificial Intelligence, AAAI 2021</i> (Vol. 35, pp. 8209–8216). Virtual, Online: AAAI Press."},"quality_controlled":"1","scopus_import":"1","department":[{"_id":"DaAl"}],"conference":{"name":"AAAI: Conference on Artificial Intelligence","location":"Virtual, Online","end_date":"2021-02-09","start_date":"2021-02-02"},"publication_identifier":{"issn":["2159-5399"],"eissn":["2374-3468"],"isbn":["9781713835974"]},"article_processing_charge":"No","date_created":"2022-06-05T22:01:52Z","acknowledgement":"Vyacheslav Kungurtsev was supported by the OP VVV project CZ.02.1.01/0.0/0.0/16 019/0000765 “Research Center for Informatics. Bapi Chatterjee was supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No. 754411 (ISTPlus). Dan Alistarh has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML).","publication":"35th AAAI Conference on Artificial Intelligence, AAAI 2021","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","call_identifier":"H2020"},{"name":"Elastic Coordination for Scalable Machine Learning","_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223","call_identifier":"H2020"}],"year":"2021","volume":35,"external_id":{"arxiv":["1905.11845"]},"title":"Asynchronous optimization methods for efficient training of deep neural networks with guarantees","page":"8209-8216"}]