[{"external_id":{"arxiv":["2007.02894"]},"date_updated":"2025-07-10T11:57:06Z","quality_controlled":"1","license":"https://creativecommons.org/licenses/by/3.0/","month":"08","volume":170,"title":"Simplified game of life: Algorithms and complexity","acknowledgement":"Krishnendu Chatterjee: The research was partially supported by the Vienna Science and\r\nTechnology Fund (WWTF) Project ICT15-003.\r\nIsmaël Jecker: This project has received funding from the European Union’s Horizon 2020 research\r\nand innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 754411.","date_published":"2020-08-18T00:00:00Z","article_processing_charge":"No","arxiv":1,"publication_identifier":{"isbn":["9783959771597"],"issn":["1868-8969"]},"type":"conference","status":"public","oa_version":"Published Version","citation":{"ista":"Chatterjee K, Ibsen-Jensen R, Jecker IR, Svoboda J. 2020. Simplified game of life: Algorithms and complexity. 45th International Symposium on Mathematical Foundations of Computer Science. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 170, 22:1-22:13.","short":"K. Chatterjee, R. Ibsen-Jensen, I.R. Jecker, J. Svoboda, in:, 45th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","mla":"Chatterjee, Krishnendu, et al. “Simplified Game of Life: Algorithms and Complexity.” <i>45th International Symposium on Mathematical Foundations of Computer Science</i>, vol. 170, 22:1-22:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2020.22\">10.4230/LIPIcs.MFCS.2020.22</a>.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Ismael R Jecker, and Jakub Svoboda. “Simplified Game of Life: Algorithms and Complexity.” In <i>45th International Symposium on Mathematical Foundations of Computer Science</i>, Vol. 170. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2020.22\">https://doi.org/10.4230/LIPIcs.MFCS.2020.22</a>.","apa":"Chatterjee, K., Ibsen-Jensen, R., Jecker, I. R., &#38; Svoboda, J. (2020). Simplified game of life: Algorithms and complexity. In <i>45th International Symposium on Mathematical Foundations of Computer Science</i> (Vol. 170). Prague, Czech Republic: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2020.22\">https://doi.org/10.4230/LIPIcs.MFCS.2020.22</a>","ama":"Chatterjee K, Ibsen-Jensen R, Jecker IR, Svoboda J. Simplified game of life: Algorithms and complexity. In: <i>45th International Symposium on Mathematical Foundations of Computer Science</i>. Vol 170. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2020.22\">10.4230/LIPIcs.MFCS.2020.22</a>","ieee":"K. Chatterjee, R. Ibsen-Jensen, I. R. Jecker, and J. Svoboda, “Simplified game of life: Algorithms and complexity,” in <i>45th International Symposium on Mathematical Foundations of Computer Science</i>, Prague, Czech Republic, 2020, vol. 170."},"article_number":"22:1-22:13","abstract":[{"lang":"eng","text":"Game of Life is a simple and elegant model to study dynamical system over networks. The model consists of a graph where every vertex has one of two types, namely, dead or alive. A configuration is a mapping of the vertices to the types. An update rule describes how the type of a vertex is updated given the types of its neighbors. In every round, all vertices are updated synchronously, which leads to a configuration update. While in general, Game of Life allows a broad range of update rules, we focus on two simple families of update rules, namely, underpopulation and overpopulation, that model several interesting dynamics studied in the literature. In both settings, a dead vertex requires at least a desired number of live neighbors to become alive. For underpopulation (resp., overpopulation), a live vertex requires at least (resp. at most) a desired number of live neighbors to remain alive. We study the basic computation problems, e.g., configuration reachability, for these two families of rules. For underpopulation rules, we show that these problems can be solved in polynomial time, whereas for overpopulation rules they are PSPACE-complete."}],"scopus_import":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","file_date_updated":"2020-09-21T13:57:34Z","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Rasmus","last_name":"Ibsen-Jensen","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","full_name":"Ibsen-Jensen, Rasmus"},{"first_name":"Ismael R","last_name":"Jecker","full_name":"Jecker, Ismael R","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425"},{"first_name":"Jakub","last_name":"Svoboda","orcid":"0000-0002-1419-3267","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","full_name":"Svoboda, Jakub"}],"ddc":["000"],"language":[{"iso":"eng"}],"project":[{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"},{"name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"doi":"10.4230/LIPIcs.MFCS.2020.22","file":[{"file_id":"8550","success":1,"date_created":"2020-09-21T13:57:34Z","access_level":"open_access","file_name":"2020_LIPIcs_Chatterjee.pdf","creator":"dernst","checksum":"bbd7c4f55d45f2ff2a0a4ef0e10a77b1","date_updated":"2020-09-21T13:57:34Z","content_type":"application/pdf","relation":"main_file","file_size":491374}],"publication_status":"published","oa":1,"intvolume":"       170","year":"2020","date_created":"2020-09-20T22:01:36Z","alternative_title":["LIPIcs"],"day":"18","publication":"45th International Symposium on Mathematical Foundations of Computer Science","conference":{"location":"Prague, Czech Republic","end_date":"2020-08-28","name":"MFCS: Mathematical Foundations of Computer Science","start_date":"2020-08-24"},"department":[{"_id":"KrCh"}],"ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8533","has_accepted_license":"1","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","short":"CC BY (3.0)"}},{"doi":"10.4230/LIPIcs.MFCS.2020.51","project":[{"name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"}],"file":[{"date_updated":"2020-09-21T14:17:08Z","relation":"main_file","content_type":"application/pdf","file_size":597977,"file_name":"2020_LIPIcsMFCS_Jecker.pdf","access_level":"open_access","checksum":"2dc9e2fad6becd4563aef3e27a473f70","creator":"dernst","success":1,"file_id":"8552","date_created":"2020-09-21T14:17:08Z"}],"publication_status":"published","oa":1,"intvolume":"       170","file_date_updated":"2020-09-21T14:17:08Z","author":[{"full_name":"Jecker, Ismael R","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","first_name":"Ismael R","last_name":"Jecker"},{"full_name":"Kupferman, Orna","first_name":"Orna","last_name":"Kupferman"},{"last_name":"Mazzocchi","first_name":"Nicolas","full_name":"Mazzocchi, Nicolas"}],"ddc":["000"],"language":[{"iso":"eng"}],"date_created":"2020-09-20T22:01:36Z","alternative_title":["LIPIcs"],"year":"2020","corr_author":"1","publication":"45th International Symposium on Mathematical Foundations of Computer Science","day":"18","has_accepted_license":"1","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","short":"CC BY (3.0)"},"department":[{"_id":"KrCh"}],"conference":{"location":"Prague, Czech Republic","start_date":"2020-08-24","end_date":"2020-08-28","name":"MFCS: Mathematical Foundations of Computer Science"},"ec_funded":1,"_id":"8534","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"08","quality_controlled":"1","date_updated":"2025-07-10T11:57:07Z","title":"Unary prime languages","acknowledgement":"Ismaël Jecker: This project has received funding from the European Union’s Horizon\r\n2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No.\r\n754411. Nicolas Mazzocchi: PhD fellowship FRIA from the F.R.S.-FNRS.","article_processing_charge":"No","date_published":"2020-08-18T00:00:00Z","volume":170,"publication_identifier":{"issn":["1868-8969"],"isbn":["9783959771597"]},"type":"conference","status":"public","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa_version":"Published Version","citation":{"mla":"Jecker, Ismael R., et al. “Unary Prime Languages.” <i>45th International Symposium on Mathematical Foundations of Computer Science</i>, vol. 170, 51:1-51:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2020.51\">10.4230/LIPIcs.MFCS.2020.51</a>.","short":"I.R. Jecker, O. Kupferman, N. Mazzocchi, in:, 45th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","ista":"Jecker IR, Kupferman O, Mazzocchi N. 2020. Unary prime languages. 45th International Symposium on Mathematical Foundations of Computer Science. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 170, 51:1-51:12.","apa":"Jecker, I. R., Kupferman, O., &#38; Mazzocchi, N. (2020). Unary prime languages. In <i>45th International Symposium on Mathematical Foundations of Computer Science</i> (Vol. 170). Prague, Czech Republic: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2020.51\">https://doi.org/10.4230/LIPIcs.MFCS.2020.51</a>","chicago":"Jecker, Ismael R, Orna Kupferman, and Nicolas Mazzocchi. “Unary Prime Languages.” In <i>45th International Symposium on Mathematical Foundations of Computer Science</i>, Vol. 170. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2020.51\">https://doi.org/10.4230/LIPIcs.MFCS.2020.51</a>.","ama":"Jecker IR, Kupferman O, Mazzocchi N. Unary prime languages. In: <i>45th International Symposium on Mathematical Foundations of Computer Science</i>. Vol 170. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2020.51\">10.4230/LIPIcs.MFCS.2020.51</a>","ieee":"I. R. Jecker, O. Kupferman, and N. Mazzocchi, “Unary prime languages,” in <i>45th International Symposium on Mathematical Foundations of Computer Science</i>, Prague, Czech Republic, 2020, vol. 170."},"scopus_import":"1","abstract":[{"lang":"eng","text":"A regular language L of finite words is composite if there are regular languages L₁,L₂,…,L_t such that L = ⋂_{i = 1}^t L_i and the index (number of states in a minimal DFA) of every language L_i is strictly smaller than the index of L. Otherwise, L is prime. Primality of regular languages was introduced and studied in [O. Kupferman and J. Mosheiff, 2015], where the complexity of deciding the primality of the language of a given DFA was left open, with a doubly-exponential gap between the upper and lower bounds. We study primality for unary regular languages, namely regular languages with a singleton alphabet. A unary language corresponds to a subset of ℕ, making the study of unary prime languages closer to that of primality in number theory. We show that the setting of languages is richer. In particular, while every composite number is the product of two smaller numbers, the number t of languages necessary to decompose a composite unary language induces a strict hierarchy. In addition, a primality witness for a unary language L, namely a word that is not in L but is in all products of languages that contain L and have an index smaller than L’s, may be of exponential length. Still, we are able to characterize compositionality by structural properties of a DFA for L, leading to a LogSpace algorithm for primality checking of unary DFAs."}],"article_number":"51:1-51:12"},{"month":"07","external_id":{"isi":["000583700300038"]},"quality_controlled":"1","date_updated":"2026-04-16T08:26:38Z","title":"Wave curves: Simulating Lagrangian water waves on dynamically deforming surfaces","article_processing_charge":"No","date_published":"2020-07-08T00:00:00Z","isi":1,"acknowledgement":"We wish to thank the anonymous reviewers and the members of the Visual Computing Group at IST Austria for their valuable feedback. This research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by Scientific Computing. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme under grant agreement No. 638176 and Marie SkłodowskaCurie Grant Agreement No. 665385.","volume":39,"acknowledged_ssus":[{"_id":"ScienComp"}],"type":"journal_article","publication_identifier":{"issn":["0730-0301"],"eissn":["1557-7368"]},"status":"public","publisher":"Association for Computing Machinery","article_number":"65","citation":{"ieee":"T. Skrivan, A. Soderstrom, J. Johansson, C. Sprenger, K. Museth, and C. Wojtan, “Wave curves: Simulating Lagrangian water waves on dynamically deforming surfaces,” <i>ACM Transactions on Graphics</i>, vol. 39, no. 4. Association for Computing Machinery, 2020.","ama":"Skrivan T, Soderstrom A, Johansson J, Sprenger C, Museth K, Wojtan C. Wave curves: Simulating Lagrangian water waves on dynamically deforming surfaces. <i>ACM Transactions on Graphics</i>. 2020;39(4). doi:<a href=\"https://doi.org/10.1145/3386569.3392466\">10.1145/3386569.3392466</a>","apa":"Skrivan, T., Soderstrom, A., Johansson, J., Sprenger, C., Museth, K., &#38; Wojtan, C. (2020). Wave curves: Simulating Lagrangian water waves on dynamically deforming surfaces. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3386569.3392466\">https://doi.org/10.1145/3386569.3392466</a>","chicago":"Skrivan, Tomas, Andreas Soderstrom, John Johansson, Christoph Sprenger, Ken Museth, and Chris Wojtan. “Wave Curves: Simulating Lagrangian Water Waves on Dynamically Deforming Surfaces.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3386569.3392466\">https://doi.org/10.1145/3386569.3392466</a>.","mla":"Skrivan, Tomas, et al. “Wave Curves: Simulating Lagrangian Water Waves on Dynamically Deforming Surfaces.” <i>ACM Transactions on Graphics</i>, vol. 39, no. 4, 65, Association for Computing Machinery, 2020, doi:<a href=\"https://doi.org/10.1145/3386569.3392466\">10.1145/3386569.3392466</a>.","ista":"Skrivan T, Soderstrom A, Johansson J, Sprenger C, Museth K, Wojtan C. 2020. Wave curves: Simulating Lagrangian water waves on dynamically deforming surfaces. ACM Transactions on Graphics. 39(4), 65.","short":"T. Skrivan, A. Soderstrom, J. Johansson, C. Sprenger, K. Museth, C. Wojtan, ACM Transactions on Graphics 39 (2020)."},"abstract":[{"lang":"eng","text":"We propose a method to enhance the visual detail of a water surface simulation. Our method works as a post-processing step which takes a simulation as input and increases its apparent resolution by simulating many detailed Lagrangian water waves on top of it. We extend linear water wave theory to work in non-planar domains which deform over time, and we discretize the theory using Lagrangian wave packets attached to spline curves. The method is numerically stable and trivially parallelizable, and it produces high frequency ripples with dispersive wave-like behaviors customized to the underlying fluid simulation."}],"scopus_import":"1","oa_version":"Published Version","oa":1,"publication_status":"published","file":[{"creator":"dernst","checksum":"c3a680893f01cc4a9e961ff0a4cfa12f","access_level":"open_access","file_name":"2020_ACM_Skrivan.pdf","date_created":"2020-09-21T07:51:44Z","file_id":"8541","success":1,"file_size":20223953,"date_updated":"2020-09-21T07:51:44Z","content_type":"application/pdf","relation":"main_file"}],"doi":"10.1145/3386569.3392466","project":[{"call_identifier":"H2020","name":"Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large Scales","grant_number":"638176","_id":"2533E772-B435-11E9-9278-68D0E5697425"},{"grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"International IST Doctoral Program"}],"intvolume":"        39","file_date_updated":"2020-09-21T07:51:44Z","language":[{"iso":"eng"}],"ddc":["000"],"author":[{"id":"486A5A46-F248-11E8-B48F-1D18A9856A87","full_name":"Skrivan, Tomas","first_name":"Tomas","last_name":"Skrivan"},{"last_name":"Soderstrom","first_name":"Andreas","full_name":"Soderstrom, Andreas"},{"last_name":"Johansson","first_name":"John","full_name":"Johansson, John"},{"full_name":"Sprenger, Christoph","first_name":"Christoph","last_name":"Sprenger"},{"last_name":"Museth","first_name":"Ken","full_name":"Museth, Ken"},{"full_name":"Wojtan, Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6646-5546","first_name":"Christopher J","last_name":"Wojtan"}],"date_created":"2020-09-20T22:01:37Z","article_type":"original","year":"2020","corr_author":"1","publication":"ACM Transactions on Graphics","day":"08","has_accepted_license":"1","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","_id":"8535","ec_funded":1,"department":[{"_id":"ChWo"}],"issue":"4"},{"year":"2020","date_created":"2020-09-20T22:01:37Z","author":[{"last_name":"Mondelli","first_name":"Marco","orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425","full_name":"Mondelli, Marco"},{"full_name":"Hashemi, Seyyed Ali","first_name":"Seyyed Ali","last_name":"Hashemi"},{"full_name":"Cioffi, John","last_name":"Cioffi","first_name":"John"},{"first_name":"Andrea","last_name":"Goldsmith","full_name":"Goldsmith, Andrea"}],"language":[{"iso":"eng"}],"doi":"10.1109/ISIT44484.2020.9174141","publication_status":"published","oa":1,"conference":{"location":"Los Angeles, CA, United States","name":"ISIT: International Symposium on Information Theory","end_date":"2020-06-26","start_date":"2020-06-21"},"department":[{"_id":"MaMo"}],"_id":"8536","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","day":"01","publication":"IEEE International Symposium on Information Theory - Proceedings","volume":"2020-June","isi":1,"acknowledgement":"M. Mondelli was partially supported by grants NSF DMS-1613091, CCF-1714305, IIS-1741162 and ONR N00014-18-1-2729. S. A. Hashemi is supported by a Postdoctoral Fellowship from the Natural Sciences and Engineering Research Council of Canada (NSERC) and by Huawei.","arxiv":1,"date_published":"2020-06-01T00:00:00Z","article_processing_charge":"No","title":"Simplified successive cancellation decoding of polar codes has sublinear latency","quality_controlled":"1","date_updated":"2025-09-10T10:27:05Z","external_id":{"arxiv":["1909.04892"],"isi":["000714963400069"]},"month":"06","oa_version":"Preprint","abstract":[{"text":"This work analyzes the latency of the simplified successive cancellation (SSC) decoding scheme for polar codes proposed by Alamdar-Yazdi and Kschischang. It is shown that, unlike conventional successive cancellation decoding, where latency is linear in the block length, the latency of SSC decoding is sublinear. More specifically, the latency of SSC decoding is O(N 1−1/µ ), where N is the block length and µ is the scaling exponent of the channel, which captures the speed of convergence of the rate to capacity. Numerical results demonstrate the tightness of the bound and show that most of the latency reduction arises from the parallel decoding of subcodes of rate 0 and 1.","lang":"eng"}],"scopus_import":"1","article_number":"401-406","citation":{"chicago":"Mondelli, Marco, Seyyed Ali Hashemi, John Cioffi, and Andrea Goldsmith. “Simplified Successive Cancellation Decoding of Polar Codes Has Sublinear Latency.” In <i>IEEE International Symposium on Information Theory - Proceedings</i>, Vol. 2020–June. IEEE, 2020. <a href=\"https://doi.org/10.1109/ISIT44484.2020.9174141\">https://doi.org/10.1109/ISIT44484.2020.9174141</a>.","apa":"Mondelli, M., Hashemi, S. A., Cioffi, J., &#38; Goldsmith, A. (2020). Simplified successive cancellation decoding of polar codes has sublinear latency. In <i>IEEE International Symposium on Information Theory - Proceedings</i> (Vol. 2020–June). Los Angeles, CA, United States: IEEE. <a href=\"https://doi.org/10.1109/ISIT44484.2020.9174141\">https://doi.org/10.1109/ISIT44484.2020.9174141</a>","ista":"Mondelli M, Hashemi SA, Cioffi J, Goldsmith A. 2020. Simplified successive cancellation decoding of polar codes has sublinear latency. IEEE International Symposium on Information Theory - Proceedings. ISIT: International Symposium on Information Theory vol. 2020–June, 401–406.","short":"M. Mondelli, S.A. Hashemi, J. Cioffi, A. Goldsmith, in:, IEEE International Symposium on Information Theory - Proceedings, IEEE, 2020.","mla":"Mondelli, Marco, et al. “Simplified Successive Cancellation Decoding of Polar Codes Has Sublinear Latency.” <i>IEEE International Symposium on Information Theory - Proceedings</i>, vol. 2020–June, 401–406, IEEE, 2020, doi:<a href=\"https://doi.org/10.1109/ISIT44484.2020.9174141\">10.1109/ISIT44484.2020.9174141</a>.","ieee":"M. Mondelli, S. A. Hashemi, J. Cioffi, and A. Goldsmith, “Simplified successive cancellation decoding of polar codes has sublinear latency,” in <i>IEEE International Symposium on Information Theory - Proceedings</i>, Los Angeles, CA, United States, 2020, vol. 2020–June.","ama":"Mondelli M, Hashemi SA, Cioffi J, Goldsmith A. Simplified successive cancellation decoding of polar codes has sublinear latency. In: <i>IEEE International Symposium on Information Theory - Proceedings</i>. Vol 2020-June. IEEE; 2020. doi:<a href=\"https://doi.org/10.1109/ISIT44484.2020.9174141\">10.1109/ISIT44484.2020.9174141</a>"},"main_file_link":[{"url":"https://arxiv.org/abs/1909.04892","open_access":"1"}],"publisher":"IEEE","related_material":{"record":[{"relation":"later_version","id":"9047","status":"public"}]},"status":"public","publication_identifier":{"isbn":["9781728164328"],"issn":["2157-8095"]},"type":"conference"},{"issue":"6","department":[{"_id":"BeBi"}],"ec_funded":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"8562","has_accepted_license":"1","day":"26","corr_author":"1","publication":"ACM Transactions on Graphics","year":"2020","date_created":"2020-09-23T11:30:02Z","article_type":"original","file_date_updated":"2023-05-23T20:54:43Z","author":[{"first_name":"Konstantinos","last_name":"Gavriil","full_name":"Gavriil, Konstantinos"},{"full_name":"Guseinov, Ruslan","id":"3AB45EE2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9819-5077","last_name":"Guseinov","first_name":"Ruslan"},{"first_name":"Jesus","last_name":"Perez Rodriguez","id":"2DC83906-F248-11E8-B48F-1D18A9856A87","full_name":"Perez Rodriguez, Jesus"},{"full_name":"Pellis, Davide","last_name":"Pellis","first_name":"Davide"},{"id":"13C09E74-18D9-11E9-8878-32CFE5697425","full_name":"Henderson, Paul M","first_name":"Paul M","last_name":"Henderson","orcid":"0000-0002-5198-7445"},{"first_name":"Florian","last_name":"Rist","full_name":"Rist, Florian"},{"last_name":"Pottmann","first_name":"Helmut","full_name":"Pottmann, Helmut"},{"last_name":"Bickel","first_name":"Bernd","orcid":"0000-0001-6511-9385","id":"49876194-F248-11E8-B48F-1D18A9856A87","full_name":"Bickel, Bernd"}],"language":[{"iso":"eng"}],"ddc":["000"],"file":[{"checksum":"c7f67717ad74e670b7daeae732abe151","creator":"bbickel","file_name":"coldglass.pdf","access_level":"open_access","date_created":"2023-05-23T20:54:43Z","success":1,"file_id":"13084","file_size":28964641,"date_updated":"2023-05-23T20:54:43Z","relation":"main_file","content_type":"application/pdf"}],"doi":"10.1145/3414685.3417843","project":[{"_id":"24F9549A-B435-11E9-9278-68D0E5697425","grant_number":"715767","call_identifier":"H2020","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling"}],"publication_status":"published","oa":1,"intvolume":"        39","oa_version":"Submitted Version","scopus_import":"1","article_number":"208","abstract":[{"text":"Cold bent glass is a promising and cost-efficient method for realizing doubly curved glass facades. They are produced by attaching planar glass sheets to curved frames and require keeping the occurring stress within safe limits.\r\nHowever, it is very challenging to navigate the design space of cold bent glass panels due to the fragility of the material, which impedes the form-finding for practically feasible and aesthetically pleasing cold bent glass facades. We propose an interactive, data-driven approach for designing cold bent glass facades that can be seamlessly integrated into a typical architectural design pipeline. Our method allows non-expert users to interactively edit a parametric surface while providing real-time feedback on the deformed shape and maximum stress of cold bent glass panels. Designs are automatically refined to minimize several fairness criteria while maximal stresses are kept within glass limits. We achieve interactive frame rates by using a differentiable Mixture Density Network trained from more than a million simulations. Given a curved boundary, our regression model is capable of handling multistable\r\nconfigurations and accurately predicting the equilibrium shape of the panel and its corresponding maximal stress. We show predictions are highly accurate and validate our results with a physical realization of a cold bent glass surface.","lang":"eng"}],"citation":{"ieee":"K. Gavriil <i>et al.</i>, “Computational design of cold bent glass façades,” <i>ACM Transactions on Graphics</i>, vol. 39, no. 6. Association for Computing Machinery, 2020.","ama":"Gavriil K, Guseinov R, Perez Rodriguez J, et al. Computational design of cold bent glass façades. <i>ACM Transactions on Graphics</i>. 2020;39(6). doi:<a href=\"https://doi.org/10.1145/3414685.3417843\">10.1145/3414685.3417843</a>","apa":"Gavriil, K., Guseinov, R., Perez Rodriguez, J., Pellis, D., Henderson, P. M., Rist, F., … Bickel, B. (2020). Computational design of cold bent glass façades. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3414685.3417843\">https://doi.org/10.1145/3414685.3417843</a>","chicago":"Gavriil, Konstantinos, Ruslan Guseinov, Jesus Perez Rodriguez, Davide Pellis, Paul M Henderson, Florian Rist, Helmut Pottmann, and Bernd Bickel. “Computational Design of Cold Bent Glass Façades.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3414685.3417843\">https://doi.org/10.1145/3414685.3417843</a>.","mla":"Gavriil, Konstantinos, et al. “Computational Design of Cold Bent Glass Façades.” <i>ACM Transactions on Graphics</i>, vol. 39, no. 6, 208, Association for Computing Machinery, 2020, doi:<a href=\"https://doi.org/10.1145/3414685.3417843\">10.1145/3414685.3417843</a>.","short":"K. Gavriil, R. Guseinov, J. Perez Rodriguez, D. Pellis, P.M. Henderson, F. Rist, H. Pottmann, B. Bickel, ACM Transactions on Graphics 39 (2020).","ista":"Gavriil K, Guseinov R, Perez Rodriguez J, Pellis D, Henderson PM, Rist F, Pottmann H, Bickel B. 2020. Computational design of cold bent glass façades. ACM Transactions on Graphics. 39(6), 208."},"publisher":"Association for Computing Machinery","related_material":{"link":[{"description":"News on IST Homepage","url":"https://ist.ac.at/en/news/bend-dont-break/","relation":"press_release"}],"record":[{"relation":"research_data","id":"8761","status":"public"},{"status":"public","id":"8366","relation":"dissertation_contains"}]},"publication_identifier":{"issn":["0730-0301"],"eissn":["1557-7368"]},"type":"journal_article","status":"public","acknowledged_ssus":[{"_id":"ScienComp"}],"volume":39,"title":"Computational design of cold bent glass façades","isi":1,"acknowledgement":"We thank IST Austria’s Scientific Computing team for their support, Corinna Datsiou and Sophie Pennetier for their expert input on the practical applications of cold bent glass, and Zaha Hadid Architects and Waagner Biro for providing the architectural datasets. Photo of Fondation Louis Vuitton by Francisco Anzola / CC BY 2.0 / cropped.\r\nPhoto of Opus by Danica O. Kus. This project has received funding from the European Union’s\r\nHorizon 2020 research and innovation program under grant agreement No 675789 - Algebraic Representations in Computer-Aided Design for complEx Shapes (ARCADES), from the European Research Council (ERC) under grant agreement No 715767 - MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling, and SFB-Transregio “Discretization in Geometry and Dynamics” through grant I 2978 of the Austrian Science Fund (FWF). F. Rist and K. Gavriil have been partially supported by KAUST baseline funding.","date_published":"2020-11-26T00:00:00Z","arxiv":1,"article_processing_charge":"No","external_id":{"isi":["000595589100048"],"arxiv":["2009.03667"]},"date_updated":"2026-04-08T07:25:22Z","quality_controlled":"1","month":"11"},{"publisher":"Institute of Science and Technology Austria","tmp":{"short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8563","department":[{"_id":"JoCs"}],"citation":{"ama":"Csicsvari JL, Gridchyn I, Schönenberger P. Optogenetic alteration of hippocampal network activity. 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8563\">10.15479/AT:ISTA:8563</a>","ieee":"J. L. Csicsvari, I. Gridchyn, and P. Schönenberger, “Optogenetic alteration of hippocampal network activity.” Institute of Science and Technology Austria, 2020.","short":"J.L. Csicsvari, I. Gridchyn, P. Schönenberger, (2020).","ista":"Csicsvari JL, Gridchyn I, Schönenberger P. 2020. Optogenetic alteration of hippocampal network activity, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:8563\">10.15479/AT:ISTA:8563</a>.","mla":"Csicsvari, Jozsef L., et al. <i>Optogenetic Alteration of Hippocampal Network Activity</i>. Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8563\">10.15479/AT:ISTA:8563</a>.","chicago":"Csicsvari, Jozsef L, Igor Gridchyn, and Philipp Schönenberger. “Optogenetic Alteration of Hippocampal Network Activity.” Institute of Science and Technology Austria, 2020. <a href=\"https://doi.org/10.15479/AT:ISTA:8563\">https://doi.org/10.15479/AT:ISTA:8563</a>.","apa":"Csicsvari, J. L., Gridchyn, I., &#38; Schönenberger, P. (2020). Optogenetic alteration of hippocampal network activity. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:8563\">https://doi.org/10.15479/AT:ISTA:8563</a>"},"abstract":[{"lang":"eng","text":"Supplementary data  provided for the provided for the publication:\r\nIgor Gridchyn , Philipp Schoenenberger , Joseph O'Neill , Jozsef Csicsvari (2020) Optogenetic inhibition-mediated activity-dependent modification of CA1 pyramidal-interneuron connections during behavior. Elife."}],"oa_version":"Published Version","type":"research_data","corr_author":"1","status":"public","contributor":[{"contributor_type":"project_leader","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","last_name":"Csicsvari","first_name":"Jozsef L","orcid":"0000-0002-5193-4036"}],"related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"8740"}]},"day":"19","title":"Optogenetic alteration of hippocampal network activity","date_created":"2020-09-23T14:39:54Z","date_published":"2020-10-19T00:00:00Z","article_processing_charge":"No","year":"2020","oa":1,"doi":"10.15479/AT:ISTA:8563","file":[{"relation":"main_file","date_updated":"2020-09-23T14:36:17Z","content_type":"application/x-compressed","file_size":145243906,"file_name":"upload.tgz","access_level":"open_access","checksum":"a16098a6d172f9c42ab5af5f6991668c","creator":"jozsef","success":1,"file_id":"8564","date_created":"2020-09-23T14:36:17Z"},{"date_created":"2020-10-19T10:12:29Z","success":1,"file_id":"8675","checksum":"0bfc54b7e14c0694cd081617318ba606","creator":"jozsef","file_name":"redme.docx","access_level":"open_access","file_size":11648,"content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","relation":"main_file","date_updated":"2020-10-19T10:12:29Z"}],"month":"10","file_date_updated":"2020-10-19T10:12:29Z","ddc":["570"],"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","author":[{"id":"3FA14672-F248-11E8-B48F-1D18A9856A87","full_name":"Csicsvari, Jozsef L","first_name":"Jozsef L","last_name":"Csicsvari","orcid":"0000-0002-5193-4036"},{"full_name":"Gridchyn, Igor","id":"4B60654C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1807-1929","first_name":"Igor","last_name":"Gridchyn"},{"full_name":"Schönenberger, Philipp","id":"3B9D816C-F248-11E8-B48F-1D18A9856A87","first_name":"Philipp","last_name":"Schönenberger"}],"date_updated":"2026-04-07T08:37:11Z"},{"intvolume":"        11","doi":"10.1038/s41467-020-18610-6","file":[{"checksum":"eada7bc8dd16a49390137cff882ef328","creator":"dernst","file_name":"2020_NatureComm_Prehal.pdf","access_level":"open_access","date_created":"2020-09-28T13:16:15Z","success":1,"file_id":"8585","file_size":1822469,"relation":"main_file","content_type":"application/pdf","date_updated":"2020-09-28T13:16:15Z"}],"publication_status":"published","oa":1,"author":[{"last_name":"Prehal","first_name":"Christian","full_name":"Prehal, Christian"},{"full_name":"Fitzek, Harald","first_name":"Harald","last_name":"Fitzek"},{"first_name":"Gerald","last_name":"Kothleitner","full_name":"Kothleitner, Gerald"},{"full_name":"Presser, Volker","first_name":"Volker","last_name":"Presser"},{"first_name":"Bernhard","last_name":"Gollas","full_name":"Gollas, Bernhard"},{"full_name":"Freunberger, Stefan Alexander","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","orcid":"0000-0003-2902-5319","first_name":"Stefan Alexander","last_name":"Freunberger"},{"last_name":"Abbas","first_name":"Qamar","full_name":"Abbas, Qamar"}],"ddc":["530"],"language":[{"iso":"eng"}],"file_date_updated":"2020-09-28T13:16:15Z","article_type":"original","date_created":"2020-09-25T07:23:13Z","year":"2020","publication":"Nature Communications","corr_author":"1","day":"24","has_accepted_license":"1","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"pmid":1,"department":[{"_id":"StFr"}],"_id":"8568","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"09","date_updated":"2025-06-12T06:58:51Z","quality_controlled":"1","license":"https://creativecommons.org/licenses/by/4.0/","external_id":{"isi":["000573756600004"],"pmid":["32973214"]},"isi":1,"date_published":"2020-09-24T00:00:00Z","article_processing_charge":"No","title":"Persistent and reversible solid iodine electrodeposition in nanoporous carbons","volume":11,"status":"public","publication_identifier":{"issn":["2041-1723"]},"type":"journal_article","related_material":{"link":[{"url":"https://doi.org/10.1038/s41467-020-19720-x","relation":"erratum"}]},"publisher":"Springer Nature","oa_version":"Published Version","citation":{"ieee":"C. Prehal <i>et al.</i>, “Persistent and reversible solid iodine electrodeposition in nanoporous carbons,” <i>Nature Communications</i>, vol. 11. Springer Nature, 2020.","ama":"Prehal C, Fitzek H, Kothleitner G, et al. Persistent and reversible solid iodine electrodeposition in nanoporous carbons. <i>Nature Communications</i>. 2020;11. doi:<a href=\"https://doi.org/10.1038/s41467-020-18610-6\">10.1038/s41467-020-18610-6</a>","chicago":"Prehal, Christian, Harald Fitzek, Gerald Kothleitner, Volker Presser, Bernhard Gollas, Stefan Alexander Freunberger, and Qamar Abbas. “Persistent and Reversible Solid Iodine Electrodeposition in Nanoporous Carbons.” <i>Nature Communications</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1038/s41467-020-18610-6\">https://doi.org/10.1038/s41467-020-18610-6</a>.","apa":"Prehal, C., Fitzek, H., Kothleitner, G., Presser, V., Gollas, B., Freunberger, S. A., &#38; Abbas, Q. (2020). Persistent and reversible solid iodine electrodeposition in nanoporous carbons. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-020-18610-6\">https://doi.org/10.1038/s41467-020-18610-6</a>","ista":"Prehal C, Fitzek H, Kothleitner G, Presser V, Gollas B, Freunberger SA, Abbas Q. 2020. Persistent and reversible solid iodine electrodeposition in nanoporous carbons. Nature Communications. 11, 4838.","short":"C. Prehal, H. Fitzek, G. Kothleitner, V. Presser, B. Gollas, S.A. Freunberger, Q. Abbas, Nature Communications 11 (2020).","mla":"Prehal, Christian, et al. “Persistent and Reversible Solid Iodine Electrodeposition in Nanoporous Carbons.” <i>Nature Communications</i>, vol. 11, 4838, Springer Nature, 2020, doi:<a href=\"https://doi.org/10.1038/s41467-020-18610-6\">10.1038/s41467-020-18610-6</a>."},"article_number":"4838","scopus_import":"1","keyword":["General Biochemistry","Genetics and Molecular Biology","General Physics and Astronomy","General Chemistry"],"abstract":[{"lang":"eng","text":"Aqueous iodine based electrochemical energy storage is considered a potential candidate to improve sustainability and performance of current battery and supercapacitor technology. It harnesses the redox activity of iodide, iodine, and polyiodide species in the confined geometry of nanoporous carbon electrodes. However, current descriptions of the electrochemical reaction mechanism to interconvert these species are elusive. Here we show that electrochemical oxidation of iodide in nanoporous carbons forms persistent solid iodine deposits. Confinement slows down dissolution into triiodide and pentaiodide, responsible for otherwise significant self-discharge via shuttling. The main tools for these insights are in situ Raman spectroscopy and in situ small and wide-angle X-ray scattering (in situ SAXS/WAXS). In situ Raman confirms the reversible formation of triiodide and pentaiodide. In situ SAXS/WAXS indicates remarkable amounts of solid iodine deposited in the carbon nanopores. Combined with stochastic modeling, in situ SAXS allows quantifying the solid iodine volume fraction and visualizing the iodine structure on 3D lattice models at the sub-nanometer scale. Based on the derived mechanism, we demonstrate strategies for improved iodine pore filling capacity and prevention of self-discharge, applicable to hybrid supercapacitors and batteries."}]},{"year":"2020","date_created":"2020-09-26T14:41:29Z","language":[{"iso":"eng"}],"ddc":["000"],"author":[{"last_name":"Geretti","first_name":"Luca","full_name":"Geretti, Luca"},{"full_name":"Alexandre Dit Sandretto, Julien","last_name":"Alexandre Dit Sandretto","first_name":"Julien"},{"full_name":"Althoff, Matthias","first_name":"Matthias","last_name":"Althoff"},{"last_name":"Benet","first_name":"Luis","full_name":"Benet, Luis"},{"full_name":"Chapoutot, Alexandre","last_name":"Chapoutot","first_name":"Alexandre"},{"full_name":"Chen, Xin","last_name":"Chen","first_name":"Xin"},{"last_name":"Collins","first_name":"Pieter","full_name":"Collins, Pieter"},{"full_name":"Forets, Marcelo","last_name":"Forets","first_name":"Marcelo"},{"first_name":"Daniel","last_name":"Freire","full_name":"Freire, Daniel"},{"last_name":"Immler","first_name":"Fabian","full_name":"Immler, Fabian"},{"full_name":"Kochdumper, Niklas","last_name":"Kochdumper","first_name":"Niklas"},{"last_name":"Sanders","first_name":"David","full_name":"Sanders, David"},{"id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","full_name":"Schilling, Christian","first_name":"Christian","last_name":"Schilling","orcid":"0000-0003-3658-1065"}],"intvolume":"        74","oa":1,"publication_status":"published","project":[{"name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"},{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF"}],"doi":"10.29007/zkf6","_id":"8571","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"name":"ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems","end_date":"2020-07-12","start_date":"2020-07-12"},"ec_funded":1,"department":[{"_id":"ToHe"}],"page":"49-75","day":"25","publication":"EPiC Series in Computing","corr_author":"1","volume":74,"date_published":"2020-09-25T00:00:00Z","article_processing_charge":"No","acknowledgement":"Christian Schilling acknowledges support in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award) and the European Union’s Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie grant agreement No. 754411.","title":"ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics","date_updated":"2026-06-18T19:34:03Z","quality_controlled":"1","month":"09","abstract":[{"lang":"eng","text":"We present the results of a friendly competition for formal verification of continuous and hybrid systems with nonlinear continuous dynamics. The friendly competition took place as part of the workshop Applied Verification for Continuous and Hybrid Systems (ARCH) in 2020. This year, 6 tools Ariadne, CORA, DynIbex, Flow*, Isabelle/HOL, and JuliaReach (in alphabetic order) participated. These tools are applied to solve reachability analysis problems on six benchmark problems, two of them featuring hybrid dynamics. We do not rank the tools based on the results, but show the current status and discover the potential advantages of different tools."}],"citation":{"apa":"Geretti, L., Alexandre Dit Sandretto, J., Althoff, M., Benet, L., Chapoutot, A., Chen, X., … Schilling, C. (2020). ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics. In <i>EPiC Series in Computing</i> (Vol. 74, pp. 49–75). EasyChair. <a href=\"https://doi.org/10.29007/zkf6\">https://doi.org/10.29007/zkf6</a>","chicago":"Geretti, Luca, Julien Alexandre Dit Sandretto, Matthias Althoff, Luis Benet, Alexandre Chapoutot, Xin Chen, Pieter Collins, et al. “ARCH-COMP20 Category Report: Continuous and Hybrid Systems with Nonlinear Dynamics.” In <i>EPiC Series in Computing</i>, 74:49–75. EasyChair, 2020. <a href=\"https://doi.org/10.29007/zkf6\">https://doi.org/10.29007/zkf6</a>.","mla":"Geretti, Luca, et al. “ARCH-COMP20 Category Report: Continuous and Hybrid Systems with Nonlinear Dynamics.” <i>EPiC Series in Computing</i>, vol. 74, EasyChair, 2020, pp. 49–75, doi:<a href=\"https://doi.org/10.29007/zkf6\">10.29007/zkf6</a>.","short":"L. Geretti, J. Alexandre Dit Sandretto, M. Althoff, L. Benet, A. Chapoutot, X. Chen, P. Collins, M. Forets, D. Freire, F. Immler, N. Kochdumper, D. Sanders, C. Schilling, in:, EPiC Series in Computing, EasyChair, 2020, pp. 49–75.","ista":"Geretti L, Alexandre Dit Sandretto J, Althoff M, Benet L, Chapoutot A, Chen X, Collins P, Forets M, Freire D, Immler F, Kochdumper N, Sanders D, Schilling C. 2020. ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics. EPiC Series in Computing. ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems vol. 74, 49–75.","ieee":"L. Geretti <i>et al.</i>, “ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics,” in <i>EPiC Series in Computing</i>, 2020, vol. 74, pp. 49–75.","ama":"Geretti L, Alexandre Dit Sandretto J, Althoff M, et al. ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics. In: <i>EPiC Series in Computing</i>. Vol 74. EasyChair; 2020:49-75. doi:<a href=\"https://doi.org/10.29007/zkf6\">10.29007/zkf6</a>"},"scopus_import":"1","oa_version":"Published Version","main_file_link":[{"open_access":"1","url":"https://easychair.org/publications/download/nrdD"}],"publisher":"EasyChair","status":"public","type":"conference"},{"date_created":"2020-09-26T14:49:43Z","year":"2020","oa":1,"publication_status":"published","doi":"10.29007/7dt2","project":[{"_id":"25C5A090-B435-11E9-9278-68D0E5697425","grant_number":"Z00312","call_identifier":"FWF","name":"Synaptic communication in neuronal microcircuits"},{"name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"}],"intvolume":"        74","ddc":["000"],"language":[{"iso":"eng"}],"author":[{"last_name":"Althoff","first_name":"Matthias","full_name":"Althoff, Matthias"},{"first_name":"Stanley","last_name":"Bak","full_name":"Bak, Stanley"},{"full_name":"Bao, Zongnan","first_name":"Zongnan","last_name":"Bao"},{"full_name":"Forets, Marcelo","last_name":"Forets","first_name":"Marcelo"},{"last_name":"Frehse","first_name":"Goran","full_name":"Frehse, Goran"},{"first_name":"Daniel","last_name":"Freire","full_name":"Freire, Daniel"},{"full_name":"Kochdumper, Niklas","last_name":"Kochdumper","first_name":"Niklas"},{"full_name":"Li, Yangge","first_name":"Yangge","last_name":"Li"},{"first_name":"Sayan","last_name":"Mitra","full_name":"Mitra, Sayan"},{"first_name":"Rajarshi","last_name":"Ray","full_name":"Ray, Rajarshi"},{"last_name":"Schilling","first_name":"Christian","orcid":"0000-0003-3658-1065","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","full_name":"Schilling, Christian"},{"last_name":"Schupp","first_name":"Stefan","full_name":"Schupp, Stefan"},{"full_name":"Wetzlinger, Mark","last_name":"Wetzlinger","first_name":"Mark"}],"page":"16-48","_id":"8572","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ec_funded":1,"conference":{"end_date":"2020-07-12","name":"ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems","start_date":"2020-07-12"},"department":[{"_id":"ToHe"}],"corr_author":"1","publication":"EPiC Series in Computing","day":"25","title":"ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics","date_published":"2020-09-25T00:00:00Z","article_processing_charge":"No","acknowledgement":"The authors gratefully acknowledge financial support by the European Commission project\r\njustITSELF under grant number 817629, by the Austrian Science Fund (FWF) under grant\r\nZ211-N23 (Wittgenstein Award), by the European Union’s Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie grant agreement No. 754411, and by the\r\nScience and Engineering Research Board (SERB) project with file number IMP/2018/000523.\r\nThis material is based upon work supported by the Air Force Office of Scientific Research under\r\naward number FA9550-19-1-0288. Any opinions, finding, and conclusions or recommendations\r\nexpressed in this material are those of the author(s) and do not necessarily reflect the views of\r\nthe United States Air Force.","volume":74,"month":"09","quality_controlled":"1","date_updated":"2026-06-18T19:34:29Z","publisher":"EasyChair","main_file_link":[{"open_access":"1","url":"https://easychair.org/publications/download/DRpS"}],"citation":{"ieee":"M. Althoff <i>et al.</i>, “ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics,” in <i>EPiC Series in Computing</i>, 2020, vol. 74, pp. 16–48.","ama":"Althoff M, Bak S, Bao Z, et al. ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics. In: <i>EPiC Series in Computing</i>. Vol 74. EasyChair; 2020:16-48. doi:<a href=\"https://doi.org/10.29007/7dt2\">10.29007/7dt2</a>","apa":"Althoff, M., Bak, S., Bao, Z., Forets, M., Frehse, G., Freire, D., … Wetzlinger, M. (2020). ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics. In <i>EPiC Series in Computing</i> (Vol. 74, pp. 16–48). EasyChair. <a href=\"https://doi.org/10.29007/7dt2\">https://doi.org/10.29007/7dt2</a>","chicago":"Althoff, Matthias, Stanley Bak, Zongnan Bao, Marcelo Forets, Goran Frehse, Daniel Freire, Niklas Kochdumper, et al. “ARCH-COMP20 Category Report: Continuous and Hybrid Systems with Linear Dynamics.” In <i>EPiC Series in Computing</i>, 74:16–48. EasyChair, 2020. <a href=\"https://doi.org/10.29007/7dt2\">https://doi.org/10.29007/7dt2</a>.","mla":"Althoff, Matthias, et al. “ARCH-COMP20 Category Report: Continuous and Hybrid Systems with Linear Dynamics.” <i>EPiC Series in Computing</i>, vol. 74, EasyChair, 2020, pp. 16–48, doi:<a href=\"https://doi.org/10.29007/7dt2\">10.29007/7dt2</a>.","ista":"Althoff M, Bak S, Bao Z, Forets M, Frehse G, Freire D, Kochdumper N, Li Y, Mitra S, Ray R, Schilling C, Schupp S, Wetzlinger M. 2020. ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics. EPiC Series in Computing. ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems vol. 74, 16–48.","short":"M. Althoff, S. Bak, Z. Bao, M. Forets, G. Frehse, D. Freire, N. Kochdumper, Y. Li, S. Mitra, R. Ray, C. Schilling, S. Schupp, M. Wetzlinger, in:, EPiC Series in Computing, EasyChair, 2020, pp. 16–48."},"abstract":[{"text":"We present the results of the ARCH 2020 friendly competition for formal verification of continuous and hybrid systems with linear continuous dynamics. In its fourth edition, eight tools have been applied to solve eight different benchmark problems in the category for linear continuous dynamics (in alphabetical order): CORA, C2E2, HyDRA, Hylaa, Hylaa-Continuous, JuliaReach, SpaceEx, and XSpeed. This report is a snapshot of the current landscape of tools and the types of benchmarks they are particularly suited for. Due to the diversity of problems, we are not ranking tools, yet the presented results provide one of the most complete assessments of tools for the safety verification of continuous and hybrid systems with linear continuous dynamics up to this date.","lang":"eng"}],"scopus_import":"1","oa_version":"Published Version","type":"conference","status":"public"},{"day":"20","corr_author":"1","OA_place":"publisher","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","_id":"8574","department":[{"_id":"NiBa"}],"page":"158","supervisor":[{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H","first_name":"Nicholas H","last_name":"Barton","orcid":"0000-0002-8548-5240"}],"has_accepted_license":"1","file_date_updated":"2020-09-28T07:25:37Z","degree_awarded":"PhD","language":[{"iso":"eng"}],"ddc":["570"],"author":[{"last_name":"Szep","first_name":"Eniko","id":"485BB5A4-F248-11E8-B48F-1D18A9856A87","full_name":"Szep, Eniko"}],"publication_status":"published","oa":1,"file":[{"date_created":"2020-09-28T07:25:35Z","success":1,"file_id":"8575","creator":"dernst","checksum":"20e71f015fbbd78fea708893ad634ed0","file_name":"thesis_EnikoSzep_final.pdf","access_level":"open_access","file_size":6354833,"date_updated":"2020-09-28T07:25:35Z","content_type":"application/pdf","relation":"main_file"},{"creator":"dernst","checksum":"a8de2c14a1bb4e53c857787efbb289e1","file_name":"thesisFiles_EnikoSzep.zip","access_level":"closed","date_created":"2020-09-28T07:25:37Z","file_id":"8576","file_size":23020401,"content_type":"application/x-zip-compressed","date_updated":"2020-09-28T07:25:37Z","relation":"source_file"}],"doi":"10.15479/AT:ISTA:8574","year":"2020","date_created":"2020-09-28T07:33:38Z","alternative_title":["ISTA Thesis"],"type":"dissertation","publication_identifier":{"eissn":["2663-337X"]},"status":"public","citation":{"ista":"Szep E. 2020. Local adaptation in metapopulations. Institute of Science and Technology Austria.","short":"E. Szep, Local Adaptation in Metapopulations, Institute of Science and Technology Austria, 2020.","mla":"Szep, Eniko. <i>Local Adaptation in Metapopulations</i>. Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8574\">10.15479/AT:ISTA:8574</a>.","chicago":"Szep, Eniko. “Local Adaptation in Metapopulations.” Institute of Science and Technology Austria, 2020. <a href=\"https://doi.org/10.15479/AT:ISTA:8574\">https://doi.org/10.15479/AT:ISTA:8574</a>.","apa":"Szep, E. (2020). <i>Local adaptation in metapopulations</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:8574\">https://doi.org/10.15479/AT:ISTA:8574</a>","ama":"Szep E. Local adaptation in metapopulations. 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8574\">10.15479/AT:ISTA:8574</a>","ieee":"E. Szep, “Local adaptation in metapopulations,” Institute of Science and Technology Austria, 2020."},"abstract":[{"lang":"eng","text":"This thesis concerns itself with the interactions of evolutionary and ecological forces and the consequences on genetic diversity and the ultimate survival of populations. It is important to understand what signals processes \r\nleave on the genome and what we can infer from such data, which is usually abundant but noisy. Furthermore, understanding how and when populations adapt or go extinct is important for practical purposes,  such as the genetic management of populations, as well as for theoretical questions, since local adaptation can be the first step toward speciation. \r\nIn Chapter 2, we introduce the method of maximum entropy to approximate the demographic changes of a population in a simple setting, namely the logistic growth model with immigration. We show that this method is not only a powerful \r\ntool in physics but can be gainfully applied in an ecological framework. We investigate how well it approximates the real \r\nbehavior of the system, and find that is does so, even in unexpected situations. Finally, we illustrate how it can model changing environments.\r\nIn Chapter 3, we analyze the co-evolution of allele frequencies and population sizes in an infinite island model.\r\nWe give conditions under which polygenic adaptation to a rare habitat is possible. The model we use is based on the diffusion approximation, considers eco-evolutionary feedback mechanisms (hard selection), and treats both \r\ndrift and environmental fluctuations explicitly. We also look at limiting scenarios, for which we derive analytical expressions. \r\nIn Chapter 4, we present a coalescent based simulation tool to obtain patterns of diversity in a spatially explicit subdivided population, in which the demographic history of each subpopulation can be specified. We compare \r\nthe results to existing predictions, and explore the relative importance of time and space under a variety of spatial arrangements and demographic histories, such as expansion and extinction. \r\nIn the last chapter, we give a brief outlook to further research. "}],"oa_version":"Published Version","publisher":"Institute of Science and Technology Austria","date_updated":"2026-04-08T07:21:44Z","month":"09","title":"Local adaptation in metapopulations","date_published":"2020-09-20T00:00:00Z","article_processing_charge":"No"},{"has_accepted_license":"1","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"department":[{"_id":"LeSa"}],"issue":"9","_id":"8579","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","publication":"Membranes","day":"01","date_created":"2020-09-28T08:59:26Z","article_type":"original","year":"2020","file":[{"creator":"dernst","checksum":"ceb43d7554e712dea6f36f9287271737","file_name":"2020_Membranes_Andrei.pdf","access_level":"open_access","date_created":"2020-09-28T11:36:50Z","success":1,"file_id":"8583","file_size":4612258,"date_updated":"2020-09-28T11:36:50Z","content_type":"application/pdf","relation":"main_file"}],"doi":"10.3390/membranes10090242","publication_status":"published","oa":1,"intvolume":"        10","file_date_updated":"2020-09-28T11:36:50Z","author":[{"full_name":"Andrei, Andreea","first_name":"Andreea","last_name":"Andrei"},{"last_name":"Öztürk","first_name":"Yavuz","full_name":"Öztürk, Yavuz"},{"last_name":"Khalfaoui-Hassani","first_name":"Bahia","full_name":"Khalfaoui-Hassani, Bahia"},{"first_name":"Juna","last_name":"Rauch","full_name":"Rauch, Juna"},{"first_name":"Dorian","last_name":"Marckmann","full_name":"Marckmann, Dorian"},{"first_name":"Petru Iulian","last_name":"Trasnea","id":"D560034C-10C4-11EA-ABF4-A4B43DDC885E","full_name":"Trasnea, Petru Iulian"},{"first_name":"Fevzi","last_name":"Daldal","full_name":"Daldal, Fevzi"},{"full_name":"Koch, Hans-Georg","last_name":"Koch","first_name":"Hans-Georg"}],"language":[{"iso":"eng"}],"ddc":["570"],"publisher":"MDPI","oa_version":"Published Version","citation":{"apa":"Andrei, A., Öztürk, Y., Khalfaoui-Hassani, B., Rauch, J., Marckmann, D., Trasnea, P. I., … Koch, H.-G. (2020). Cu homeostasis in bacteria: The ins and outs. <i>Membranes</i>. MDPI. <a href=\"https://doi.org/10.3390/membranes10090242\">https://doi.org/10.3390/membranes10090242</a>","chicago":"Andrei, Andreea, Yavuz Öztürk, Bahia Khalfaoui-Hassani, Juna Rauch, Dorian Marckmann, Petru Iulian Trasnea, Fevzi Daldal, and Hans-Georg Koch. “Cu Homeostasis in Bacteria: The Ins and Outs.” <i>Membranes</i>. MDPI, 2020. <a href=\"https://doi.org/10.3390/membranes10090242\">https://doi.org/10.3390/membranes10090242</a>.","mla":"Andrei, Andreea, et al. “Cu Homeostasis in Bacteria: The Ins and Outs.” <i>Membranes</i>, vol. 10, no. 9, 242, MDPI, 2020, doi:<a href=\"https://doi.org/10.3390/membranes10090242\">10.3390/membranes10090242</a>.","short":"A. Andrei, Y. Öztürk, B. Khalfaoui-Hassani, J. Rauch, D. Marckmann, P.I. Trasnea, F. Daldal, H.-G. Koch, Membranes 10 (2020).","ista":"Andrei A, Öztürk Y, Khalfaoui-Hassani B, Rauch J, Marckmann D, Trasnea PI, Daldal F, Koch H-G. 2020. Cu homeostasis in bacteria: The ins and outs. Membranes. 10(9), 242.","ieee":"A. Andrei <i>et al.</i>, “Cu homeostasis in bacteria: The ins and outs,” <i>Membranes</i>, vol. 10, no. 9. MDPI, 2020.","ama":"Andrei A, Öztürk Y, Khalfaoui-Hassani B, et al. Cu homeostasis in bacteria: The ins and outs. <i>Membranes</i>. 2020;10(9). doi:<a href=\"https://doi.org/10.3390/membranes10090242\">10.3390/membranes10090242</a>"},"abstract":[{"text":"Copper (Cu) is an essential trace element for all living organisms and used as cofactor in key enzymes of important biological processes, such as aerobic respiration or superoxide dismutation. However, due to its toxicity, cells have developed elaborate mechanisms for Cu homeostasis, which balance Cu supply for cuproprotein biogenesis with the need to remove excess Cu. This review summarizes our current knowledge on bacterial Cu homeostasis with a focus on Gram-negative bacteria and describes the multiple strategies that bacteria use for uptake, storage and export of Cu. We furthermore describe general mechanistic principles that aid the bacterial response to toxic Cu concentrations and illustrate dedicated Cu relay systems that facilitate Cu delivery for cuproenzyme biogenesis. Progress in understanding how bacteria avoid Cu poisoning while maintaining a certain Cu quota for cell proliferation is of particular importance for microbial pathogens because Cu is utilized by the host immune system for attenuating pathogen survival in host cells.","lang":"eng"}],"scopus_import":"1","article_number":"242","publication_identifier":{"eissn":["2077-0375"]},"type":"journal_article","status":"public","title":"Cu homeostasis in bacteria: The ins and outs","isi":1,"date_published":"2020-09-01T00:00:00Z","article_processing_charge":"No","volume":10,"month":"09","external_id":{"isi":["000581446000001"]},"date_updated":"2026-04-02T14:29:28Z","quality_controlled":"1"},{"article_processing_charge":"No","date_published":"2020-08-01T00:00:00Z","isi":1,"title":"The application of persistent homology in the analysis of heart rate variability","date_created":"2020-09-28T08:59:27Z","year":"2020","publication_status":"published","month":"08","doi":"10.1109/ESGCO49734.2020.9158054","language":[{"iso":"eng"}],"quality_controlled":"1","author":[{"full_name":"Graff, Grzegorz","first_name":"Grzegorz","last_name":"Graff"},{"full_name":"Graff, Beata","last_name":"Graff","first_name":"Beata"},{"orcid":"0000-0002-3536-9866","first_name":"Grzegorz","last_name":"Jablonski","full_name":"Jablonski, Grzegorz","id":"4483EF78-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Krzysztof","last_name":"Narkiewicz","full_name":"Narkiewicz, Krzysztof"}],"date_updated":"2023-08-22T09:33:34Z","external_id":{"isi":["000621172600045"]},"publisher":"IEEE","scopus_import":"1","article_number":"9158054","citation":{"short":"G. Graff, B. Graff, G. Jablonski, K. Narkiewicz, in:, 11th Conference of the European Study Group on Cardiovascular Oscillations: Computation and Modelling in Physiology: New Challenges and Opportunities, , IEEE, 2020.","ista":"Graff G, Graff B, Jablonski G, Narkiewicz K. 2020. The application of persistent homology in the analysis of heart rate variability. 11th Conference of the European Study Group on Cardiovascular Oscillations: Computation and Modelling in Physiology: New Challenges and Opportunities, . ESGCO: European Study Group on Cardiovascular Oscillations, 9158054.","mla":"Graff, Grzegorz, et al. “The Application of Persistent Homology in the Analysis of Heart Rate Variability.” <i>11th Conference of the European Study Group on Cardiovascular Oscillations: Computation and Modelling in Physiology: New Challenges and Opportunities, </i>, 9158054, IEEE, 2020, doi:<a href=\"https://doi.org/10.1109/ESGCO49734.2020.9158054\">10.1109/ESGCO49734.2020.9158054</a>.","chicago":"Graff, Grzegorz, Beata Graff, Grzegorz Jablonski, and Krzysztof Narkiewicz. “The Application of Persistent Homology in the Analysis of Heart Rate Variability.” In <i>11th Conference of the European Study Group on Cardiovascular Oscillations: Computation and Modelling in Physiology: New Challenges and Opportunities, </i>. IEEE, 2020. <a href=\"https://doi.org/10.1109/ESGCO49734.2020.9158054\">https://doi.org/10.1109/ESGCO49734.2020.9158054</a>.","apa":"Graff, G., Graff, B., Jablonski, G., &#38; Narkiewicz, K. (2020). The application of persistent homology in the analysis of heart rate variability. In <i>11th Conference of the European Study Group on Cardiovascular Oscillations: Computation and Modelling in Physiology: New Challenges and Opportunities, </i>. Pisa, Italy: IEEE. <a href=\"https://doi.org/10.1109/ESGCO49734.2020.9158054\">https://doi.org/10.1109/ESGCO49734.2020.9158054</a>","ama":"Graff G, Graff B, Jablonski G, Narkiewicz K. The application of persistent homology in the analysis of heart rate variability. In: <i>11th Conference of the European Study Group on Cardiovascular Oscillations: Computation and Modelling in Physiology: New Challenges and Opportunities, </i>. IEEE; 2020. doi:<a href=\"https://doi.org/10.1109/ESGCO49734.2020.9158054\">10.1109/ESGCO49734.2020.9158054</a>","ieee":"G. Graff, B. Graff, G. Jablonski, and K. Narkiewicz, “The application of persistent homology in the analysis of heart rate variability,” in <i>11th Conference of the European Study Group on Cardiovascular Oscillations: Computation and Modelling in Physiology: New Challenges and Opportunities, </i>, Pisa, Italy, 2020."},"abstract":[{"text":"We evaluate the usefulness of persistent homology in the analysis of heart rate variability. In our approach we extract several topological descriptors characterising datasets of RR-intervals, which are later used in classical machine learning algorithms. By this method we are able to differentiate the group of patients with the history of transient ischemic attack and the group of hypertensive patients.","lang":"eng"}],"oa_version":"None","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"8580","conference":{"end_date":"2020-07-15","name":"ESGCO: European Study Group on Cardiovascular Oscillations","start_date":"2020-07-15","location":"Pisa, Italy"},"department":[{"_id":"HeEd"}],"publication":"11th Conference of the European Study Group on Cardiovascular Oscillations: Computation and Modelling in Physiology: New Challenges and Opportunities, ","status":"public","type":"conference","publication_identifier":{"isbn":["9781728157511"]},"day":"01"},{"status":"public","type":"journal_article","publication_identifier":{"eissn":["1545-9985"],"issn":["1545-9993"]},"related_material":{"link":[{"relation":"press_release","url":"https://ist.ac.at/en/news/structure-of-atpase-solved/","description":"News on IST Homepage"}]},"publisher":"Springer Nature","citation":{"mla":"Pinke, Gergely, et al. “Cryo-EM Structure of the Entire Mammalian F-Type ATP Synthase.” <i>Nature Structural and Molecular Biology</i>, vol. 27, no. 11, Springer Nature, 2020, pp. 1077–85, doi:<a href=\"https://doi.org/10.1038/s41594-020-0503-8\">10.1038/s41594-020-0503-8</a>.","short":"G. Pinke, L. Zhou, L.A. Sazanov, Nature Structural and Molecular Biology 27 (2020) 1077–1085.","ista":"Pinke G, Zhou L, Sazanov LA. 2020. Cryo-EM structure of the entire mammalian F-type ATP synthase. Nature Structural and Molecular Biology. 27(11), 1077–1085.","apa":"Pinke, G., Zhou, L., &#38; Sazanov, L. A. (2020). Cryo-EM structure of the entire mammalian F-type ATP synthase. <i>Nature Structural and Molecular Biology</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41594-020-0503-8\">https://doi.org/10.1038/s41594-020-0503-8</a>","chicago":"Pinke, Gergely, Long Zhou, and Leonid A Sazanov. “Cryo-EM Structure of the Entire Mammalian F-Type ATP Synthase.” <i>Nature Structural and Molecular Biology</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1038/s41594-020-0503-8\">https://doi.org/10.1038/s41594-020-0503-8</a>.","ama":"Pinke G, Zhou L, Sazanov LA. Cryo-EM structure of the entire mammalian F-type ATP synthase. <i>Nature Structural and Molecular Biology</i>. 2020;27(11):1077-1085. doi:<a href=\"https://doi.org/10.1038/s41594-020-0503-8\">10.1038/s41594-020-0503-8</a>","ieee":"G. Pinke, L. Zhou, and L. A. Sazanov, “Cryo-EM structure of the entire mammalian F-type ATP synthase,” <i>Nature Structural and Molecular Biology</i>, vol. 27, no. 11. Springer Nature, pp. 1077–1085, 2020."},"scopus_import":"1","abstract":[{"text":"The majority of adenosine triphosphate (ATP) powering cellular processes in eukaryotes is produced by the mitochondrial F1Fo ATP synthase. Here, we present the atomic models of the membrane Fo domain and the entire mammalian (ovine) F1Fo, determined by cryo-electron microscopy. Subunits in the membrane domain are arranged in the ‘proton translocation cluster’ attached to the c-ring and a more distant ‘hook apparatus’ holding subunit e. Unexpectedly, this subunit is anchored to a lipid ‘plug’ capping the c-ring. We present a detailed proton translocation pathway in mammalian Fo and key inter-monomer contacts in F1Fo multimers. Cryo-EM maps of F1Fo exposed to calcium reveal a retracted subunit e and a disassembled c-ring, suggesting permeability transition pore opening. We propose a model for the permeability transition pore opening, whereby subunit e pulls the lipid plug out of the c-ring. Our structure will allow the design of drugs for many emerging applications in medicine.","lang":"eng"}],"oa_version":"None","month":"11","date_updated":"2025-07-10T11:57:09Z","quality_controlled":"1","external_id":{"pmid":["32929284"],"isi":["000569299400004"]},"article_processing_charge":"No","date_published":"2020-11-01T00:00:00Z","isi":1,"acknowledgement":"We thank J. Novacek from CEITEC (Brno, Czech Republic) for assistance with collecting the FEI Krios dataset and iNEXT for providing access to CEITEC. We thank the IST Austria EM facility for access and assistance with collecting the FEI Glacios dataset. Data processing was performed at the IST high-performance computing cluster. This work has been supported by iNEXT EM HEDC (proposal 4506), funded by the Horizon 2020 Programme of the European Commission.","title":"Cryo-EM structure of the entire mammalian F-type ATP synthase","volume":27,"acknowledged_ssus":[{"_id":"EM-Fac"},{"_id":"ScienComp"}],"publication":"Nature Structural and Molecular Biology","day":"01","page":"1077-1085","pmid":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8581","department":[{"_id":"LeSa"}],"issue":"11","intvolume":"        27","publication_status":"published","doi":"10.1038/s41594-020-0503-8","language":[{"iso":"eng"}],"author":[{"last_name":"Pinke","first_name":"Gergely","id":"4D5303E6-F248-11E8-B48F-1D18A9856A87","full_name":"Pinke, Gergely"},{"id":"3E751364-F248-11E8-B48F-1D18A9856A87","full_name":"Zhou, Long","last_name":"Zhou","first_name":"Long","orcid":"0000-0002-1864-8951"},{"orcid":"0000-0002-0977-7989","last_name":"Sazanov","first_name":"Leonid A","full_name":"Sazanov, Leonid A","id":"338D39FE-F248-11E8-B48F-1D18A9856A87"}],"article_type":"original","date_created":"2020-09-28T08:59:27Z","year":"2020"},{"year":"2020","date_created":"2020-09-30T10:33:17Z","article_type":"original","language":[{"iso":"eng"}],"author":[{"full_name":"Li, Xiang","id":"4B7E523C-F248-11E8-B48F-1D18A9856A87","first_name":"Xiang","last_name":"Li"},{"orcid":"0000-0001-5973-0874","first_name":"Enderalp","last_name":"Yakaboylu","full_name":"Yakaboylu, Enderalp","id":"38CB71F6-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Bighin","first_name":"Giacomo","orcid":"0000-0001-8823-9777","id":"4CA96FD4-F248-11E8-B48F-1D18A9856A87","full_name":"Bighin, Giacomo"},{"last_name":"Schmidt","first_name":"Richard","full_name":"Schmidt, Richard"},{"full_name":"Lemeshko, Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6990-7802","first_name":"Mikhail","last_name":"Lemeshko"},{"orcid":"0000-0003-3146-6746","last_name":"Deuchert","first_name":"Andreas","full_name":"Deuchert, Andreas","id":"4DA65CD0-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","oa":1,"project":[{"name":"Quantum rotations in the presence of a many-body environment","call_identifier":"FWF","_id":"26031614-B435-11E9-9278-68D0E5697425","grant_number":"P29902"},{"name":"Angulon: physics and applications of a new quasiparticle","call_identifier":"H2020","_id":"2688CF98-B435-11E9-9278-68D0E5697425","grant_number":"801770"},{"call_identifier":"FWF","name":"A path-integral approach to composite impurities","grant_number":"M02641","_id":"26986C82-B435-11E9-9278-68D0E5697425"},{"grant_number":"694227","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Analysis of quantum many-body systems"}],"doi":"10.1063/1.5144759","intvolume":"       152","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8587","issue":"16","department":[{"_id":"MiLe"},{"_id":"RoSe"}],"ec_funded":1,"pmid":1,"day":"27","corr_author":"1","publication":"The Journal of Chemical Physics","volume":152,"title":"Intermolecular forces and correlations mediated by a phonon bath","article_processing_charge":"No","date_published":"2020-04-27T00:00:00Z","arxiv":1,"isi":1,"acknowledgement":"We are grateful to Areg Ghazaryan for valuable discussions. M.L. acknowledges support from the Austrian Science Fund (FWF) under Project No. P29902-N27 and from the European Research Council (ERC) Starting Grant No. 801770 (ANGULON). G.B. acknowledges support from the Austrian Science Fund (FWF) under Project No. M2461-N27. A.D. acknowledges funding from the European Union’s Horizon 2020 research and innovation programme under the European Research Council (ERC) Grant Agreement No. 694227 and under the Marie Sklodowska-Curie Grant Agreement No. 836146. R.S. was supported by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy – EXC-2111 – 390814868.","external_id":{"arxiv":["1912.02658"],"isi":["000530448300001"],"pmid":["32357791"]},"date_updated":"2026-04-08T07:26:09Z","quality_controlled":"1","month":"04","article_number":"164302","keyword":["Physical and Theoretical Chemistry","General Physics and Astronomy"],"citation":{"apa":"Li, X., Yakaboylu, E., Bighin, G., Schmidt, R., Lemeshko, M., &#38; Deuchert, A. (2020). Intermolecular forces and correlations mediated by a phonon bath. <i>The Journal of Chemical Physics</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/1.5144759\">https://doi.org/10.1063/1.5144759</a>","chicago":"Li, Xiang, Enderalp Yakaboylu, Giacomo Bighin, Richard Schmidt, Mikhail Lemeshko, and Andreas Deuchert. “Intermolecular Forces and Correlations Mediated by a Phonon Bath.” <i>The Journal of Chemical Physics</i>. AIP Publishing, 2020. <a href=\"https://doi.org/10.1063/1.5144759\">https://doi.org/10.1063/1.5144759</a>.","mla":"Li, Xiang, et al. “Intermolecular Forces and Correlations Mediated by a Phonon Bath.” <i>The Journal of Chemical Physics</i>, vol. 152, no. 16, 164302, AIP Publishing, 2020, doi:<a href=\"https://doi.org/10.1063/1.5144759\">10.1063/1.5144759</a>.","ista":"Li X, Yakaboylu E, Bighin G, Schmidt R, Lemeshko M, Deuchert A. 2020. Intermolecular forces and correlations mediated by a phonon bath. The Journal of Chemical Physics. 152(16), 164302.","short":"X. Li, E. Yakaboylu, G. Bighin, R. Schmidt, M. Lemeshko, A. Deuchert, The Journal of Chemical Physics 152 (2020).","ieee":"X. Li, E. Yakaboylu, G. Bighin, R. Schmidt, M. Lemeshko, and A. Deuchert, “Intermolecular forces and correlations mediated by a phonon bath,” <i>The Journal of Chemical Physics</i>, vol. 152, no. 16. AIP Publishing, 2020.","ama":"Li X, Yakaboylu E, Bighin G, Schmidt R, Lemeshko M, Deuchert A. Intermolecular forces and correlations mediated by a phonon bath. <i>The Journal of Chemical Physics</i>. 2020;152(16). doi:<a href=\"https://doi.org/10.1063/1.5144759\">10.1063/1.5144759</a>"},"abstract":[{"text":"Inspired by the possibility to experimentally manipulate and enhance chemical reactivity in helium nanodroplets, we investigate the effective interaction and the resulting correlations between two diatomic molecules immersed in a bath of bosons. By analogy with the bipolaron, we introduce the biangulon quasiparticle describing two rotating molecules that align with respect to each other due to the effective attractive interaction mediated by the excitations of the bath. We study this system in different parameter regimes and apply several theoretical approaches to describe its properties. Using a Born–Oppenheimer approximation, we investigate the dependence of the effective intermolecular interaction on the rotational state of the two molecules. In the strong-coupling regime, a product-state ansatz shows that the molecules tend to have a strong alignment in the ground state. To investigate the system in the weak-coupling regime, we apply a one-phonon excitation variational ansatz, which allows us to access the energy spectrum. In comparison to the angulon quasiparticle, the biangulon shows shifted angulon instabilities and an additional spectral instability, where resonant angular momentum transfer between the molecules and the bath takes place. These features are proposed as an experimentally observable signature for the formation of the biangulon quasiparticle. Finally, by using products of single angulon and bare impurity wave functions as basis states, we introduce a diagonalization scheme that allows us to describe the transition from two separated angulons to a biangulon as a function of the distance between the two molecules.","lang":"eng"}],"oa_version":"Preprint","publisher":"AIP Publishing","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1912.02658"}],"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"8958"}]},"type":"journal_article","publication_identifier":{"eissn":["1089-7690"],"issn":["0021-9606"]},"status":"public"},{"status":"public","publication_identifier":{"issn":["2469-9950"],"eissn":["2469-9969"]},"type":"journal_article","oa_version":"Preprint","abstract":[{"text":"Dipolar (or spatially indirect) excitons (IXs) in semiconductor double quantum well (DQW) subjected to an electric field are neutral species with a dipole moment oriented perpendicular to the DQW plane. Here, we theoretically study interactions between IXs in stacked DQW bilayers, where the dipolar coupling can be either attractive or repulsive depending on the relative positions of the particles. By using microscopic band structure calculations to determine the electronic states forming the excitons, we show that the attractive dipolar interaction between stacked IXs deforms their electronic wave function, thereby increasing the inter-DQW interaction energy and making the IX even more electrically polarizable. Many-particle interaction effects are addressed by considering the coupling between a single IX in one of the DQWs to a cloud of IXs in the other DQW, which is modeled either as a closed-packed lattice or as a continuum IX fluid. We find that the lattice model yields IX interlayer binding energies decreasing with increasing lattice density. This behavior is due to the dominating role of the intra-DQW dipolar repulsion, which prevents more than one exciton from entering the attractive region of the inter-DQW coupling. Finally, both models shows that the single IX distorts the distribution of IXs in the adjacent DQW, thus inducing the formation of an IX dipolar polaron (dipolaron). While the interlayer binding energy reduces with IX density for lattice dipolarons, the continuous polaron model predicts a nonmonotonous dependence on density in semiquantitative agreement with a recent experimental study [cf. Hubert et al., Phys. Rev. X 9, 021026 (2019)].","lang":"eng"}],"article_number":"045307","scopus_import":"1","citation":{"ieee":"C. Hubert, K. Cohen, A. Ghazaryan, M. Lemeshko, R. Rapaport, and P. V. Santos, “Attractive interactions, molecular complexes, and polarons in coupled dipolar exciton fluids,” <i>Physical Review B</i>, vol. 102, no. 4. American Physical Society, 2020.","ama":"Hubert C, Cohen K, Ghazaryan A, Lemeshko M, Rapaport R, Santos PV. Attractive interactions, molecular complexes, and polarons in coupled dipolar exciton fluids. <i>Physical Review B</i>. 2020;102(4). doi:<a href=\"https://doi.org/10.1103/physrevb.102.045307\">10.1103/physrevb.102.045307</a>","apa":"Hubert, C., Cohen, K., Ghazaryan, A., Lemeshko, M., Rapaport, R., &#38; Santos, P. V. (2020). Attractive interactions, molecular complexes, and polarons in coupled dipolar exciton fluids. <i>Physical Review B</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevb.102.045307\">https://doi.org/10.1103/physrevb.102.045307</a>","chicago":"Hubert, C., K. Cohen, Areg Ghazaryan, Mikhail Lemeshko, R. Rapaport, and P. V. Santos. “Attractive Interactions, Molecular Complexes, and Polarons in Coupled Dipolar Exciton Fluids.” <i>Physical Review B</i>. American Physical Society, 2020. <a href=\"https://doi.org/10.1103/physrevb.102.045307\">https://doi.org/10.1103/physrevb.102.045307</a>.","mla":"Hubert, C., et al. “Attractive Interactions, Molecular Complexes, and Polarons in Coupled Dipolar Exciton Fluids.” <i>Physical Review B</i>, vol. 102, no. 4, 045307, American Physical Society, 2020, doi:<a href=\"https://doi.org/10.1103/physrevb.102.045307\">10.1103/physrevb.102.045307</a>.","short":"C. Hubert, K. Cohen, A. Ghazaryan, M. Lemeshko, R. Rapaport, P.V. Santos, Physical Review B 102 (2020).","ista":"Hubert C, Cohen K, Ghazaryan A, Lemeshko M, Rapaport R, Santos PV. 2020. Attractive interactions, molecular complexes, and polarons in coupled dipolar exciton fluids. Physical Review B. 102(4), 045307."},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1910.06015"}],"publisher":"American Physical Society","quality_controlled":"1","date_updated":"2025-04-14T07:43:49Z","external_id":{"isi":["000550579100004"],"arxiv":["1910.06015"]},"month":"07","volume":102,"isi":1,"acknowledgement":"We thank W. Kaganer for discussions and for comment on the manuscript. We acknowledge the financial support from the German-Israeli Foundation (GIF), grant agreement I-1277-303.10/2014. M.L. acknowledges support by the Austrian Science Fund (FWF), under project No. P29902-N27, and by the European Research Council (ERC) Starting Grant No. 801770 (ANGULON). A.G. acknowledges support by the European Unions Horizon 2020 research and innovation\r\nprogram under the Marie Skodowska-Curie grant agreement No 754411. P.V.S acknowledges financial support\r\nfrom the Deutsche Forschungsgemeinschaft (DFG) under\r\nProject No. SA 598/12-1.","date_published":"2020-07-21T00:00:00Z","arxiv":1,"article_processing_charge":"No","title":"Attractive interactions, molecular complexes, and polarons in coupled dipolar exciton fluids","day":"21","publication":"Physical Review B","ec_funded":1,"department":[{"_id":"MiLe"}],"issue":"4","_id":"8588","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"last_name":"Hubert","first_name":"C.","full_name":"Hubert, C."},{"full_name":"Cohen, K.","first_name":"K.","last_name":"Cohen"},{"orcid":"0000-0001-9666-3543","last_name":"Ghazaryan","first_name":"Areg","full_name":"Ghazaryan, Areg","id":"4AF46FD6-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Lemeshko, Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6990-7802","first_name":"Mikhail","last_name":"Lemeshko"},{"first_name":"R.","last_name":"Rapaport","full_name":"Rapaport, R."},{"full_name":"Santos, P. V.","first_name":"P. V.","last_name":"Santos"}],"language":[{"iso":"eng"}],"intvolume":"       102","project":[{"name":"Quantum rotations in the presence of a many-body environment","call_identifier":"FWF","_id":"26031614-B435-11E9-9278-68D0E5697425","grant_number":"P29902"},{"name":"Angulon: physics and applications of a new quasiparticle","call_identifier":"H2020","_id":"2688CF98-B435-11E9-9278-68D0E5697425","grant_number":"801770"},{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships"}],"doi":"10.1103/physrevb.102.045307","oa":1,"publication_status":"published","year":"2020","article_type":"original","date_created":"2020-09-30T10:33:43Z"},{"ec_funded":1,"issue":"21","department":[{"_id":"SiHi"}],"_id":"8592","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","pmid":1,"has_accepted_license":"1","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"day":"04","publication":"Advanced Science","year":"2020","date_created":"2020-10-01T09:44:13Z","article_type":"original","file_date_updated":"2020-12-10T14:07:24Z","author":[{"first_name":"Anhao","last_name":"Tian","full_name":"Tian, Anhao"},{"full_name":"Kang, Bo","last_name":"Kang","first_name":"Bo"},{"full_name":"Li, Baizhou","last_name":"Li","first_name":"Baizhou"},{"full_name":"Qiu, Biying","last_name":"Qiu","first_name":"Biying"},{"first_name":"Wenhong","last_name":"Jiang","full_name":"Jiang, Wenhong"},{"last_name":"Shao","first_name":"Fangjie","full_name":"Shao, Fangjie"},{"last_name":"Gao","first_name":"Qingqing","full_name":"Gao, Qingqing"},{"first_name":"Rui","last_name":"Liu","full_name":"Liu, Rui"},{"first_name":"Chengwei","last_name":"Cai","full_name":"Cai, Chengwei"},{"full_name":"Jing, Rui","first_name":"Rui","last_name":"Jing"},{"full_name":"Wang, Wei","first_name":"Wei","last_name":"Wang"},{"full_name":"Chen, Pengxiang","last_name":"Chen","first_name":"Pengxiang"},{"full_name":"Liang, Qinghui","first_name":"Qinghui","last_name":"Liang"},{"full_name":"Bao, Lili","last_name":"Bao","first_name":"Lili"},{"full_name":"Man, Jianghong","last_name":"Man","first_name":"Jianghong"},{"first_name":"Yan","last_name":"Wang","full_name":"Wang, Yan"},{"last_name":"Shi","first_name":"Yu","full_name":"Shi, Yu"},{"last_name":"Li","first_name":"Jin","full_name":"Li, Jin"},{"last_name":"Yang","first_name":"Minmin","full_name":"Yang, Minmin"},{"first_name":"Lisha","last_name":"Wang","full_name":"Wang, Lisha"},{"first_name":"Jianmin","last_name":"Zhang","full_name":"Zhang, Jianmin"},{"id":"37B36620-F248-11E8-B48F-1D18A9856A87","full_name":"Hippenmeyer, Simon","first_name":"Simon","last_name":"Hippenmeyer","orcid":"0000-0003-2279-1061"},{"first_name":"Junming","last_name":"Zhu","full_name":"Zhu, Junming"},{"full_name":"Bian, Xiuwu","first_name":"Xiuwu","last_name":"Bian"},{"last_name":"Wang","first_name":"Ying‐Jie","full_name":"Wang, Ying‐Jie"},{"first_name":"Chong","last_name":"Liu","full_name":"Liu, Chong"}],"language":[{"iso":"eng"}],"ddc":["570"],"project":[{"_id":"260018B0-B435-11E9-9278-68D0E5697425","grant_number":"725780","call_identifier":"H2020","name":"Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development"}],"doi":"10.1002/advs.202001724","file":[{"date_updated":"2020-12-10T14:07:24Z","relation":"main_file","content_type":"application/pdf","file_size":7835833,"file_name":"2020_AdvScience_Tian.pdf","access_level":"open_access","checksum":"92818c23ecc70e35acfa671f3cfb9909","creator":"dernst","success":1,"file_id":"8938","date_created":"2020-12-10T14:07:24Z"}],"publication_status":"published","oa":1,"intvolume":"         7","oa_version":"Published Version","keyword":["General Engineering","General Physics and Astronomy","General Materials Science","Medicine (miscellaneous)","General Chemical Engineering","Biochemistry","Genetics and Molecular Biology (miscellaneous)"],"abstract":[{"text":"Glioblastoma is the most malignant cancer in the brain and currently incurable. It is urgent to identify effective targets for this lethal disease. Inhibition of such targets should suppress the growth of cancer cells and, ideally also precancerous cells for early prevention, but minimally affect their normal counterparts. Using genetic mouse models with neural stem cells (NSCs) or oligodendrocyte precursor cells (OPCs) as the cells‐of‐origin/mutation, it is shown that the susceptibility of cells within the development hierarchy of glioma to the knockout of insulin‐like growth factor I receptor (IGF1R) is determined not only by their oncogenic states, but also by their cell identities/states. Knockout of IGF1R selectively disrupts the growth of mutant and transformed, but not normal OPCs, or NSCs. The desirable outcome of IGF1R knockout on cell growth requires the mutant cells to commit to the OPC identity regardless of its development hierarchical status. At the molecular level, oncogenic mutations reprogram the cellular network of OPCs and force them to depend more on IGF1R for their growth. A new‐generation brain‐penetrable, orally available IGF1R inhibitor harnessing tumor OPCs in the brain is also developed. The findings reveal the cellular window of IGF1R targeting and establish IGF1R as an effective target for the prevention and treatment of glioblastoma.","lang":"eng"}],"citation":{"ieee":"A. Tian <i>et al.</i>, “Oncogenic state and cell identity combinatorially dictate the susceptibility of cells within glioma development hierarchy to IGF1R targeting,” <i>Advanced Science</i>, vol. 7, no. 21. Wiley, 2020.","ama":"Tian A, Kang B, Li B, et al. Oncogenic state and cell identity combinatorially dictate the susceptibility of cells within glioma development hierarchy to IGF1R targeting. <i>Advanced Science</i>. 2020;7(21). doi:<a href=\"https://doi.org/10.1002/advs.202001724\">10.1002/advs.202001724</a>","chicago":"Tian, Anhao, Bo Kang, Baizhou Li, Biying Qiu, Wenhong Jiang, Fangjie Shao, Qingqing Gao, et al. “Oncogenic State and Cell Identity Combinatorially Dictate the Susceptibility of Cells within Glioma Development Hierarchy to IGF1R Targeting.” <i>Advanced Science</i>. Wiley, 2020. <a href=\"https://doi.org/10.1002/advs.202001724\">https://doi.org/10.1002/advs.202001724</a>.","apa":"Tian, A., Kang, B., Li, B., Qiu, B., Jiang, W., Shao, F., … Liu, C. (2020). Oncogenic state and cell identity combinatorially dictate the susceptibility of cells within glioma development hierarchy to IGF1R targeting. <i>Advanced Science</i>. Wiley. <a href=\"https://doi.org/10.1002/advs.202001724\">https://doi.org/10.1002/advs.202001724</a>","ista":"Tian A, Kang B, Li B, Qiu B, Jiang W, Shao F, Gao Q, Liu R, Cai C, Jing R, Wang W, Chen P, Liang Q, Bao L, Man J, Wang Y, Shi Y, Li J, Yang M, Wang L, Zhang J, Hippenmeyer S, Zhu J, Bian X, Wang Y, Liu C. 2020. Oncogenic state and cell identity combinatorially dictate the susceptibility of cells within glioma development hierarchy to IGF1R targeting. Advanced Science. 7(21), 2001724.","short":"A. Tian, B. Kang, B. Li, B. Qiu, W. Jiang, F. Shao, Q. Gao, R. Liu, C. Cai, R. Jing, W. Wang, P. Chen, Q. Liang, L. Bao, J. Man, Y. Wang, Y. Shi, J. Li, M. Yang, L. Wang, J. Zhang, S. Hippenmeyer, J. Zhu, X. Bian, Y. Wang, C. Liu, Advanced Science 7 (2020).","mla":"Tian, Anhao, et al. “Oncogenic State and Cell Identity Combinatorially Dictate the Susceptibility of Cells within Glioma Development Hierarchy to IGF1R Targeting.” <i>Advanced Science</i>, vol. 7, no. 21, 2001724, Wiley, 2020, doi:<a href=\"https://doi.org/10.1002/advs.202001724\">10.1002/advs.202001724</a>."},"article_number":"2001724","scopus_import":"1","publisher":"Wiley","publication_identifier":{"issn":["2198-3844"]},"type":"journal_article","status":"public","volume":7,"title":"Oncogenic state and cell identity combinatorially dictate the susceptibility of cells within glioma development hierarchy to IGF1R targeting","isi":1,"acknowledgement":"The authors thank Drs. J. Eisen, QR. Lu, S. Duan, Z‐H. Li, W. Mo, and Q. Wu for their critical comments on the manuscript. They also thank Dr. H. Zong for providing the CKO_NG2‐CreER model. This work is supported by the National Key Research and Development Program of China, Stem Cell and Translational Research (2016YFA0101201 to C.L., 2016YFA0100303 to Y.J.W.), the National Natural Science Foundation of China (81673035 and 81972915 to C.L., 81472722 to Y.J.W.), the Science Foundation for Distinguished Young Scientists of Zhejiang Province (LR17H160001 to C.L.), Fundamental Research Funds for the Central Universities (2016QNA7023 and 2017QNA7028 to C.L.) and the Thousand Talent Program for Young Outstanding Scientists, China (to C.L.), IST Austria institutional funds (to S.H.), European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme (725780 LinPro to S.H.). C.L. is a scholar of K. C. Wong Education Foundation.","article_processing_charge":"No","date_published":"2020-11-04T00:00:00Z","external_id":{"pmid":["33173731"],"isi":["000573860700001"]},"quality_controlled":"1","date_updated":"2025-06-12T06:59:38Z","month":"11"},{"type":"journal_article","publication_identifier":{"eissn":["1478-3975"]},"status":"public","publisher":"IOP Publishing","scopus_import":"1","abstract":[{"lang":"eng","text":"Error analysis and data visualization of positive COVID-19 cases in 27 countries have been performed up to August 8, 2020. This survey generally observes a progression from early exponential growth transitioning to an intermediate power-law growth phase, as recently suggested by Ziff and Ziff. The occurrence of logistic growth after the power-law phase with lockdowns or social distancing may be described as an effect of avoidance. A visualization of the power-law growth exponent over short time windows is qualitatively similar to the Bhatia visualization for pandemic progression. Visualizations like these can indicate the onset of second waves and may influence social policy."}],"article_number":"065005","citation":{"mla":"Merrin, Jack. “Differences in Power Law Growth over Time and Indicators of COVID-19 Pandemic Progression Worldwide.” <i>Physical Biology</i>, vol. 17, no. 6, 065005, IOP Publishing, 2020, doi:<a href=\"https://doi.org/10.1088/1478-3975/abb2db\">10.1088/1478-3975/abb2db</a>.","ista":"Merrin J. 2020. Differences in power law growth over time and indicators of COVID-19 pandemic progression worldwide. Physical Biology. 17(6), 065005.","short":"J. Merrin, Physical Biology 17 (2020).","apa":"Merrin, J. (2020). Differences in power law growth over time and indicators of COVID-19 pandemic progression worldwide. <i>Physical Biology</i>. IOP Publishing. <a href=\"https://doi.org/10.1088/1478-3975/abb2db\">https://doi.org/10.1088/1478-3975/abb2db</a>","chicago":"Merrin, Jack. “Differences in Power Law Growth over Time and Indicators of COVID-19 Pandemic Progression Worldwide.” <i>Physical Biology</i>. IOP Publishing, 2020. <a href=\"https://doi.org/10.1088/1478-3975/abb2db\">https://doi.org/10.1088/1478-3975/abb2db</a>.","ama":"Merrin J. Differences in power law growth over time and indicators of COVID-19 pandemic progression worldwide. <i>Physical Biology</i>. 2020;17(6). doi:<a href=\"https://doi.org/10.1088/1478-3975/abb2db\">10.1088/1478-3975/abb2db</a>","ieee":"J. Merrin, “Differences in power law growth over time and indicators of COVID-19 pandemic progression worldwide,” <i>Physical Biology</i>, vol. 17, no. 6. IOP Publishing, 2020."},"oa_version":"Published Version","month":"09","external_id":{"isi":["000575539700001"]},"date_updated":"2026-04-02T14:29:42Z","quality_controlled":"1","title":"Differences in power law growth over time and indicators of COVID-19 pandemic progression worldwide","article_processing_charge":"Yes (via OA deal)","date_published":"2020-09-23T00:00:00Z","acknowledgement":"I would especially like to thank Michael Sixt for encouraging me to think about these problems while working at home due to restrictions in place. I want to thank Nick Barton, Katka Bodova, Matthew Robinson, Simon Rella, Federico Sau, Ivan Prieto, and Pradeep Kumar for useful discussions.","isi":1,"volume":17,"corr_author":"1","publication":"Physical Biology","day":"23","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"has_accepted_license":"1","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","_id":"8597","issue":"6","department":[{"_id":"NanoFab"}],"oa":1,"publication_status":"published","doi":"10.1088/1478-3975/abb2db","file":[{"date_created":"2020-10-05T13:53:59Z","success":1,"file_id":"8609","checksum":"fec9bdd355ed349f09990faab20838a7","creator":"dernst","file_name":"2020_PhysBio_Merrin.pdf","access_level":"open_access","file_size":1667111,"relation":"main_file","date_updated":"2020-10-05T13:53:59Z","content_type":"application/pdf"}],"intvolume":"        17","file_date_updated":"2020-10-05T13:53:59Z","ddc":["510","570"],"language":[{"iso":"eng"}],"author":[{"id":"4515C308-F248-11E8-B48F-1D18A9856A87","full_name":"Merrin, Jack","first_name":"Jack","last_name":"Merrin","orcid":"0000-0001-5145-4609"}],"date_created":"2020-10-04T22:01:35Z","article_type":"original","year":"2020"},{"type":"conference","publication_identifier":{"isbn":["9783959771603"],"issn":["1868-8969"]},"status":"public","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","article_number":"2","scopus_import":"1","abstract":[{"lang":"eng","text":"A graph game is a two-player zero-sum game in which the players move a token throughout a graph to produce an infinite path, which determines the winner or payoff of the game. In bidding games, both players have budgets, and in each turn, we hold an \"auction\" (bidding) to determine which player moves the token. In this survey, we consider several bidding mechanisms and study their effect on the properties of the game. Specifically, bidding games, and in particular bidding games of infinite duration, have an intriguing equivalence with random-turn games in which in each turn, the player who moves is chosen randomly. We show how minor changes in the bidding mechanism lead to unexpected differences in the equivalence with random-turn games."}],"citation":{"mla":"Avni, Guy, and Thomas A. Henzinger. “A Survey of Bidding Games on Graphs.” <i>31st International Conference on Concurrency Theory</i>, vol. 171, 2, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2020.2\">10.4230/LIPIcs.CONCUR.2020.2</a>.","short":"G. Avni, T.A. Henzinger, in:, 31st International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","ista":"Avni G, Henzinger TA. 2020. A survey of bidding games on graphs. 31st International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 171, 2.","apa":"Avni, G., &#38; Henzinger, T. A. (2020). A survey of bidding games on graphs. In <i>31st International Conference on Concurrency Theory</i> (Vol. 171). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2020.2\">https://doi.org/10.4230/LIPIcs.CONCUR.2020.2</a>","chicago":"Avni, Guy, and Thomas A Henzinger. “A Survey of Bidding Games on Graphs.” In <i>31st International Conference on Concurrency Theory</i>, Vol. 171. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2020.2\">https://doi.org/10.4230/LIPIcs.CONCUR.2020.2</a>.","ama":"Avni G, Henzinger TA. A survey of bidding games on graphs. In: <i>31st International Conference on Concurrency Theory</i>. Vol 171. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2020.2\">10.4230/LIPIcs.CONCUR.2020.2</a>","ieee":"G. Avni and T. A. Henzinger, “A survey of bidding games on graphs,” in <i>31st International Conference on Concurrency Theory</i>, Virtual, 2020, vol. 171."},"oa_version":"Published Version","month":"08","date_updated":"2025-07-10T11:57:09Z","quality_controlled":"1","title":"A survey of bidding games on graphs","date_published":"2020-08-06T00:00:00Z","article_processing_charge":"No","acknowledgement":"We would like to thank all our collaborators Milad Aghajohari, Ventsislav Chonev, Rasmus Ibsen-Jensen, Ismäel Jecker, Petr Novotný, Josef Tkadlec, and Ðorđe Žikelić; we hope the collaboration was as fun and meaningful for you as it was for us.","volume":171,"corr_author":"1","publication":"31st International Conference on Concurrency Theory","day":"06","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","short":"CC BY (3.0)"},"has_accepted_license":"1","_id":"8599","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"ToHe"}],"conference":{"location":"Virtual","name":"CONCUR: Conference on Concurrency Theory","end_date":"2020-09-04","start_date":"2020-09-01"},"publication_status":"published","oa":1,"file":[{"file_size":868510,"relation":"main_file","date_updated":"2020-10-05T14:13:19Z","content_type":"application/pdf","checksum":"8f33b098e73724e0ac817f764d8e1a2d","creator":"dernst","access_level":"open_access","file_name":"2020_LIPIcsCONCUR_Avni.pdf","date_created":"2020-10-05T14:13:19Z","file_id":"8611","success":1}],"doi":"10.4230/LIPIcs.CONCUR.2020.2","project":[{"name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"}],"intvolume":"       171","file_date_updated":"2020-10-05T14:13:19Z","language":[{"iso":"eng"}],"ddc":["000"],"author":[{"last_name":"Avni","first_name":"Guy","orcid":"0000-0001-5588-8287","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","full_name":"Avni, Guy"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000-0002-2985-7724"}],"date_created":"2020-10-04T22:01:36Z","alternative_title":["LIPIcs"],"year":"2020"},{"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","citation":{"apa":"Chatterjee, K., Henzinger, T. A., &#38; Otop, J. (2020). Multi-dimensional long-run average problems for vector addition systems with states. In <i>31st International Conference on Concurrency Theory</i> (Vol. 171). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2020.23\">https://doi.org/10.4230/LIPIcs.CONCUR.2020.23</a>","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States.” In <i>31st International Conference on Concurrency Theory</i>, Vol. 171. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2020.23\">https://doi.org/10.4230/LIPIcs.CONCUR.2020.23</a>.","mla":"Chatterjee, Krishnendu, et al. “Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States.” <i>31st International Conference on Concurrency Theory</i>, vol. 171, 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2020.23\">10.4230/LIPIcs.CONCUR.2020.23</a>.","ista":"Chatterjee K, Henzinger TA, Otop J. 2020. Multi-dimensional long-run average problems for vector addition systems with states. 31st International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 171, 23.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, in:, 31st International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Multi-dimensional long-run average problems for vector addition systems with states,” in <i>31st International Conference on Concurrency Theory</i>, Virtual, 2020, vol. 171.","ama":"Chatterjee K, Henzinger TA, Otop J. Multi-dimensional long-run average problems for vector addition systems with states. In: <i>31st International Conference on Concurrency Theory</i>. Vol 171. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2020.23\">10.4230/LIPIcs.CONCUR.2020.23</a>"},"scopus_import":"1","article_number":"23","abstract":[{"text":"A vector addition system with states (VASS) consists of a finite set of states and counters. A transition changes the current state to the next state, and every counter is either incremented, or decremented, or left unchanged. A state and value for each counter is a configuration; and a computation is an infinite sequence of configurations with transitions between successive configurations. A probabilistic VASS consists of a VASS along with a probability distribution over the transitions for each state. Qualitative properties such as state and configuration reachability have been widely studied for VASS. In this work we consider multi-dimensional long-run average objectives for VASS and probabilistic VASS. For a counter, the cost of a configuration is the value of the counter; and the long-run average value of a computation for the counter is the long-run average of the costs of the configurations in the computation. The multi-dimensional long-run average problem given a VASS and a threshold value for each counter, asks whether there is a computation such that for each counter the long-run average value for the counter does not exceed the respective threshold. For probabilistic VASS, instead of the existence of a computation, we consider whether the expected long-run average value for each counter does not exceed the respective threshold. Our main results are as follows: we show that the multi-dimensional long-run average problem (a) is NP-complete for integer-valued VASS; (b) is undecidable for natural-valued VASS (i.e., nonnegative counters); and (c) can be solved in polynomial time for probabilistic integer-valued VASS, and probabilistic natural-valued VASS when all computations are non-terminating.","lang":"eng"}],"oa_version":"Published Version","status":"public","type":"conference","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959771603"]},"article_processing_charge":"No","arxiv":1,"date_published":"2020-08-06T00:00:00Z","title":"Multi-dimensional long-run average problems for vector addition systems with states","volume":171,"month":"08","quality_controlled":"1","date_updated":"2025-07-10T11:57:10Z","external_id":{"arxiv":["2007.08917"]},"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","short":"CC BY (3.0)"},"has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8600","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"conference":{"location":"Virtual","start_date":"2020-09-01","name":"CONCUR: Conference on Concurrency Theory","end_date":"2020-09-04"},"publication":"31st International Conference on Concurrency Theory","corr_author":"1","day":"06","alternative_title":["LIPIcs"],"date_created":"2020-10-04T22:01:36Z","year":"2020","intvolume":"       171","oa":1,"publication_status":"published","project":[{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23"},{"call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"file":[{"content_type":"application/pdf","relation":"main_file","date_updated":"2020-10-05T14:04:25Z","file_size":601231,"file_id":"8610","success":1,"date_created":"2020-10-05T14:04:25Z","access_level":"open_access","file_name":"2020_LIPIcsCONCUR_Chatterjee.pdf","creator":"dernst","checksum":"5039752f644c4b72b9361d21a5e31baf"}],"doi":"10.4230/LIPIcs.CONCUR.2020.23","ddc":["000"],"language":[{"iso":"eng"}],"author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","first_name":"Thomas A","last_name":"Henzinger"},{"first_name":"Jan","last_name":"Otop","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","full_name":"Otop, Jan"}],"file_date_updated":"2020-10-05T14:04:25Z"},{"oa_version":"Published Version","citation":{"apa":"Liu, D., Kumar, R., LAN, C., Johnson, A. J., Siao, W., Vanhoutte, I., … Russinova, E. (2020). Endocytosis of BRASSINOSTEROID INSENSITIVE1 is partly driven by a canonical tyrosine-based Motif. <i>Plant Cell</i>. American Society of Plant Biologists. <a href=\"https://doi.org/10.1105/tpc.20.00384\">https://doi.org/10.1105/tpc.20.00384</a>","chicago":"Liu, D, R Kumar, Claus LAN, Alexander J Johnson, W Siao, I Vanhoutte, P Wang, et al. “Endocytosis of BRASSINOSTEROID INSENSITIVE1 Is Partly Driven by a Canonical Tyrosine-Based Motif.” <i>Plant Cell</i>. American Society of Plant Biologists, 2020. <a href=\"https://doi.org/10.1105/tpc.20.00384\">https://doi.org/10.1105/tpc.20.00384</a>.","mla":"Liu, D., et al. “Endocytosis of BRASSINOSTEROID INSENSITIVE1 Is Partly Driven by a Canonical Tyrosine-Based Motif.” <i>Plant Cell</i>, vol. 32, no. 11, American Society of Plant Biologists, 2020, pp. 3598–612, doi:<a href=\"https://doi.org/10.1105/tpc.20.00384\">10.1105/tpc.20.00384</a>.","ista":"Liu D, Kumar R, LAN C, Johnson AJ, Siao W, Vanhoutte I, Wang P, Bender K, Yperman K, Martins S, Zhao X, Vert G, Van Damme D, Friml J, Russinova E. 2020. Endocytosis of BRASSINOSTEROID INSENSITIVE1 is partly driven by a canonical tyrosine-based Motif. Plant Cell. 32(11), 3598–3612.","short":"D. Liu, R. Kumar, C. LAN, A.J. Johnson, W. Siao, I. Vanhoutte, P. Wang, K. Bender, K. Yperman, S. Martins, X. Zhao, G. Vert, D. Van Damme, J. Friml, E. Russinova, Plant Cell 32 (2020) 3598–3612.","ieee":"D. Liu <i>et al.</i>, “Endocytosis of BRASSINOSTEROID INSENSITIVE1 is partly driven by a canonical tyrosine-based Motif,” <i>Plant Cell</i>, vol. 32, no. 11. American Society of Plant Biologists, pp. 3598–3612, 2020.","ama":"Liu D, Kumar R, LAN C, et al. Endocytosis of BRASSINOSTEROID INSENSITIVE1 is partly driven by a canonical tyrosine-based Motif. <i>Plant Cell</i>. 2020;32(11):3598-3612. doi:<a href=\"https://doi.org/10.1105/tpc.20.00384\">10.1105/tpc.20.00384</a>"},"scopus_import":"1","abstract":[{"lang":"eng","text":"Clathrin-mediated endocytosis (CME) and its core endocytic machinery are evolutionarily conserved across all eukaryotes. In mammals, the heterotetrameric adaptor protein complex-2 (AP-2) sorts plasma membrane (PM) cargoes into vesicles through the recognition of motifs based on tyrosine or di-leucine in their cytoplasmic tails. However, in plants, very little is known on how PM proteins are sorted for CME and whether similar motifs are required. In Arabidopsis thaliana, the brassinosteroid (BR) receptor, BR INSENSITIVE1 (BRI1), undergoes endocytosis that depends on clathrin and AP-2. Here we demonstrate that BRI1 binds directly to the medium AP-2 subunit, AP2M. The cytoplasmic domain of BRI1 contains five putative canonical surface-exposed tyrosine-based endocytic motifs. The tyrosine-to-phenylalanine substitution in Y898KAI reduced BRI1 internalization without affecting its kinase activity. Consistently, plants carrying the BRI1Y898F mutation were hypersensitive to BRs. Our study demonstrates that AP-2-dependent internalization of PM proteins via the recognition of functional tyrosine motifs also operates in plants."}],"publisher":"American Society of Plant Biologists","main_file_link":[{"open_access":"1","url":"https://europepmc.org/article/MED/32958564"}],"publication_identifier":{"eissn":["1532-298x"],"issn":["1040-4651"]},"type":"journal_article","status":"public","volume":32,"title":"Endocytosis of BRASSINOSTEROID INSENSITIVE1 is partly driven by a canonical tyrosine-based Motif","isi":1,"date_published":"2020-11-01T00:00:00Z","article_processing_charge":"No","external_id":{"pmid":["32958564"],"isi":["000600226800021"]},"quality_controlled":"1","date_updated":"2026-06-18T19:35:07Z","month":"11","issue":"11","ec_funded":1,"department":[{"_id":"JiFr"}],"_id":"8607","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","pmid":1,"page":"3598-3612","day":"01","publication":"Plant Cell","year":"2020","date_created":"2020-10-05T12:45:16Z","article_type":"original","author":[{"first_name":"D","last_name":"Liu","full_name":"Liu, D"},{"full_name":"Kumar, R","first_name":"R","last_name":"Kumar"},{"last_name":"LAN","first_name":"Claus","full_name":"LAN, Claus"},{"orcid":"0000-0002-2739-8843","last_name":"Johnson","first_name":"Alexander J","full_name":"Johnson, Alexander J","id":"46A62C3A-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Siao, W","last_name":"Siao","first_name":"W"},{"full_name":"Vanhoutte, I","last_name":"Vanhoutte","first_name":"I"},{"full_name":"Wang, P","first_name":"P","last_name":"Wang"},{"full_name":"Bender, KW","last_name":"Bender","first_name":"KW"},{"full_name":"Yperman, K","first_name":"K","last_name":"Yperman"},{"full_name":"Martins, S","first_name":"S","last_name":"Martins"},{"first_name":"X","last_name":"Zhao","full_name":"Zhao, X"},{"full_name":"Vert, G","first_name":"G","last_name":"Vert"},{"first_name":"D","last_name":"Van Damme","full_name":"Van Damme, D"},{"orcid":"0000-0002-8302-7596","first_name":"Jiří","last_name":"Friml","full_name":"Friml, Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Russinova, E","first_name":"E","last_name":"Russinova"}],"ddc":["580"],"language":[{"iso":"eng"}],"project":[{"_id":"26538374-B435-11E9-9278-68D0E5697425","grant_number":"I03630","call_identifier":"FWF","name":"Molecular mechanisms of endocytic cargo recognition in plants"},{"grant_number":"742985","_id":"261099A6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Tracing Evolution of Auxin Transport and Polarity in Plants"}],"doi":"10.1105/tpc.20.00384","oa":1,"publication_status":"published","intvolume":"        32"}]