[{"project":[{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","call_identifier":"FWF"}],"publication_identifier":{"issn":["2640-3498"]},"status":"public","publication_status":"published","acknowledgement":"Z.B. is supported by the Doctoral College Resilient Embedded Systems, which is run jointly by the TU Wien’s Faculty of Informatics and the UAS Technikum Wien. R.G. is partially supported by the Horizon 2020 Era-Permed project Persorad, and ECSEL Project grant no. 783163 (iDev40). R.H and D.R were partially supported by Boeing and MIT. M.L. is supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","_id":"10668","author":[{"full_name":"Babaiee, Zahra","last_name":"Babaiee","first_name":"Zahra"},{"first_name":"Ramin","last_name":"Hasani","full_name":"Hasani, Ramin"},{"first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner","full_name":"Lechner, Mathias"},{"first_name":"Daniela","full_name":"Rus, Daniela","last_name":"Rus"},{"first_name":"Radu","last_name":"Grosu","full_name":"Grosu, Radu"}],"title":"On-off center-surround receptive fields for accurate and robust image classification","abstract":[{"lang":"eng","text":"Robustness to variations in lighting conditions is a key objective for any deep vision system. To this end, our paper extends the receptive field of convolutional neural networks with two residual components, ubiquitous in the visual processing system of vertebrates: On-center and off-center pathways, with an excitatory center and inhibitory surround; OOCS for short. The On-center pathway is excited by the presence of a light stimulus in its center, but not in its surround, whereas the Off-center pathway is excited by the absence of a light stimulus in its center, but not in its surround. We design OOCS pathways via a difference of Gaussians, with their variance computed analytically from the size of the receptive fields. OOCS pathways complement each other in their response to light stimuli, ensuring this way a strong edge-detection capability, and as a result an accurate and robust inference under challenging lighting conditions. We provide extensive empirical evidence showing that networks supplied with OOCS pathways gain accuracy and illumination-robustness from the novel edge representation, compared to other baselines."}],"tmp":{"image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","short":"CC BY-NC-ND (3.0)"},"file":[{"date_updated":"2022-01-26T07:38:32Z","success":1,"content_type":"application/pdf","checksum":"d30eae62561bb517d9f978437d7677db","access_level":"open_access","file_size":4246561,"creator":"mlechner","relation":"main_file","file_name":"babaiee21a.pdf","date_created":"2022-01-26T07:38:32Z","file_id":"10681"}],"article_processing_charge":"No","volume":139,"has_accepted_license":"1","file_date_updated":"2022-01-26T07:38:32Z","month":"07","ddc":["000"],"day":"01","citation":{"chicago":"Babaiee, Zahra, Ramin Hasani, Mathias Lechner, Daniela Rus, and Radu Grosu. “On-off Center-Surround Receptive Fields for Accurate and Robust Image Classification.” In <i>Proceedings of the 38th International Conference on Machine Learning</i>, 139:478–89. ML Research Press, 2021.","mla":"Babaiee, Zahra, et al. “On-off Center-Surround Receptive Fields for Accurate and Robust Image Classification.” <i>Proceedings of the 38th International Conference on Machine Learning</i>, vol. 139, ML Research Press, 2021, pp. 478–89.","ieee":"Z. Babaiee, R. Hasani, M. Lechner, D. Rus, and R. Grosu, “On-off center-surround receptive fields for accurate and robust image classification,” in <i>Proceedings of the 38th International Conference on Machine Learning</i>, Virtual, 2021, vol. 139, pp. 478–489.","apa":"Babaiee, Z., Hasani, R., Lechner, M., Rus, D., &#38; Grosu, R. (2021). On-off center-surround receptive fields for accurate and robust image classification. In <i>Proceedings of the 38th International Conference on Machine Learning</i> (Vol. 139, pp. 478–489). Virtual: ML Research Press.","ama":"Babaiee Z, Hasani R, Lechner M, Rus D, Grosu R. On-off center-surround receptive fields for accurate and robust image classification. In: <i>Proceedings of the 38th International Conference on Machine Learning</i>. Vol 139. ML Research Press; 2021:478-489.","ista":"Babaiee Z, Hasani R, Lechner M, Rus D, Grosu R. 2021. On-off center-surround receptive fields for accurate and robust image classification. Proceedings of the 38th International Conference on Machine Learning. ML: Machine Learning, PMLR, vol. 139, 478–489.","short":"Z. Babaiee, R. Hasani, M. Lechner, D. Rus, R. Grosu, in:, Proceedings of the 38th International Conference on Machine Learning, ML Research Press, 2021, pp. 478–489."},"conference":{"name":"ML: Machine Learning","start_date":"2021-07-18","location":"Virtual","end_date":"2021-07-24"},"oa_version":"Published Version","license":"https://creativecommons.org/licenses/by-nc-nd/3.0/","date_updated":"2022-05-04T15:02:27Z","publication":"Proceedings of the 38th International Conference on Machine Learning","page":"478-489","oa":1,"alternative_title":["PMLR"],"year":"2021","main_file_link":[{"open_access":"1","url":"https://proceedings.mlr.press/v139/babaiee21a"}],"intvolume":"       139","publisher":"ML Research Press","quality_controlled":"1","type":"conference","language":[{"iso":"eng"}],"user_id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"date_created":"2022-01-25T15:46:33Z","date_published":"2021-07-01T00:00:00Z"},{"publication":"Proceedings of the AAAI Conference on Artificial Intelligence","date_updated":"2022-05-24T06:33:14Z","page":"11525-11535","oa":1,"year":"2021","alternative_title":["Technical Tracks"],"publisher":"AAAI Press","intvolume":"        35","main_file_link":[{"url":"https://ojs.aaai.org/index.php/AAAI/article/view/17372","open_access":"1"}],"language":[{"iso":"eng"}],"quality_controlled":"1","type":"conference","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2021-05-28T00:00:00Z","external_id":{"arxiv":["2012.08863"]},"date_created":"2022-01-25T15:47:20Z","publication_identifier":{"issn":["2159-5399"],"isbn":["978-1-57735-866-4"],"eissn":["2374-3468"]},"project":[{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize"}],"publication_status":"published","status":"public","acknowledgement":"The authors would like to thank the reviewers for their insightful comments. RH and RG were partially supported by\r\nHorizon-2020 ECSEL Project grant No. 783163 (iDev40). RH was partially supported by Boeing. ML was supported\r\nin part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). SG was funded by FWF\r\nproject W1255-N23. JC was partially supported by NAWA Polish Returns grant PPN/PPO/2018/1/00029. SS was supported by NSF awards DCL-2040599, CCF-1918225, and CPS-1446832.\r\n","title":"On the verification of neural ODEs with stochastic guarantees","author":[{"first_name":"Sophie","last_name":"Grunbacher","full_name":"Grunbacher, Sophie"},{"first_name":"Ramin","last_name":"Hasani","full_name":"Hasani, Ramin"},{"last_name":"Lechner","full_name":"Lechner, Mathias","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jacek","last_name":"Cyranka","full_name":"Cyranka, Jacek"},{"full_name":"Smolka, Scott A","last_name":"Smolka","first_name":"Scott A"},{"first_name":"Radu","last_name":"Grosu","full_name":"Grosu, Radu"}],"_id":"10669","abstract":[{"text":"We show that Neural ODEs, an emerging class of timecontinuous neural networks, can be verified by solving a set of global-optimization problems. For this purpose, we introduce Stochastic Lagrangian Reachability (SLR), an\r\nabstraction-based technique for constructing a tight Reachtube (an over-approximation of the set of reachable states\r\nover a given time-horizon), and provide stochastic guarantees in the form of confidence intervals for the Reachtube bounds. SLR inherently avoids the infamous wrapping effect (accumulation of over-approximation errors) by performing local optimization steps to expand safe regions instead of repeatedly forward-propagating them as is done by deterministic reachability methods. To enable fast local optimizations, we introduce a novel forward-mode adjoint sensitivity method to compute gradients without the need for backpropagation. Finally, we establish asymptotic and non-asymptotic convergence rates for SLR.","lang":"eng"}],"issue":"13","arxiv":1,"file":[{"access_level":"open_access","content_type":"application/pdf","checksum":"468d07041e282a1d46ffdae92f709630","success":1,"date_updated":"2022-01-26T07:38:08Z","file_name":"17372-Article Text-20866-1-2-20210518.pdf","creator":"mlechner","file_size":286906,"relation":"main_file","file_id":"10680","date_created":"2022-01-26T07:38:08Z"}],"has_accepted_license":"1","volume":35,"article_processing_charge":"No","citation":{"ama":"Grunbacher S, Hasani R, Lechner M, Cyranka J, Smolka SA, Grosu R. On the verification of neural ODEs with stochastic guarantees. In: <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Vol 35. AAAI Press; 2021:11525-11535.","ista":"Grunbacher S, Hasani R, Lechner M, Cyranka J, Smolka SA, Grosu R. 2021. On the verification of neural ODEs with stochastic guarantees. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI: Association for the Advancement of Artificial Intelligence, Technical Tracks, vol. 35, 11525–11535.","short":"S. Grunbacher, R. Hasani, M. Lechner, J. Cyranka, S.A. Smolka, R. Grosu, in:, Proceedings of the AAAI Conference on Artificial Intelligence, AAAI Press, 2021, pp. 11525–11535.","apa":"Grunbacher, S., Hasani, R., Lechner, M., Cyranka, J., Smolka, S. A., &#38; Grosu, R. (2021). On the verification of neural ODEs with stochastic guarantees. In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i> (Vol. 35, pp. 11525–11535). Virtual: AAAI Press.","ieee":"S. Grunbacher, R. Hasani, M. Lechner, J. Cyranka, S. A. Smolka, and R. Grosu, “On the verification of neural ODEs with stochastic guarantees,” in <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, Virtual, 2021, vol. 35, no. 13, pp. 11525–11535.","mla":"Grunbacher, Sophie, et al. “On the Verification of Neural ODEs with Stochastic Guarantees.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 35, no. 13, AAAI Press, 2021, pp. 11525–35.","chicago":"Grunbacher, Sophie, Ramin Hasani, Mathias Lechner, Jacek Cyranka, Scott A Smolka, and Radu Grosu. “On the Verification of Neural ODEs with Stochastic Guarantees.” In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, 35:11525–35. AAAI Press, 2021."},"day":"28","month":"05","ddc":["000"],"file_date_updated":"2022-01-26T07:38:08Z","oa_version":"Published Version","conference":{"name":"AAAI: Association for the Advancement of Artificial Intelligence","location":"Virtual","start_date":"2021-02-02","end_date":"2021-02-09"}},{"oa":1,"year":"2021","alternative_title":[" Advances in Neural Information Processing Systems"],"publication":"35th Conference on Neural Information Processing Systems","date_updated":"2022-01-26T14:33:31Z","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","external_id":{"arxiv":["2106.08314"]},"date_published":"2021-12-01T00:00:00Z","date_created":"2022-01-25T15:47:50Z","main_file_link":[{"url":"https://proceedings.neurips.cc/paper/2021/hash/67ba02d73c54f0b83c05507b7fb7267f-Abstract.html","open_access":"1"}],"quality_controlled":"1","language":[{"iso":"eng"}],"type":"conference","title":"Causal navigation by continuous-time neural networks","author":[{"full_name":"Vorbach, Charles J","last_name":"Vorbach","first_name":"Charles J"},{"full_name":"Hasani, Ramin","last_name":"Hasani","first_name":"Ramin"},{"full_name":"Amini, Alexander","last_name":"Amini","first_name":"Alexander"},{"first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner","full_name":"Lechner, Mathias"},{"first_name":"Daniela","full_name":"Rus, Daniela","last_name":"Rus"}],"_id":"10670","abstract":[{"lang":"eng","text":"Imitation learning enables high-fidelity, vision-based learning of policies within rich, photorealistic environments. However, such techniques often rely on traditional discrete-time neural models and face difficulties in generalizing to domain shifts by failing to account for the causal relationships between the agent and the environment. In this paper, we propose a theoretical and experimental framework for learning causal representations using continuous-time neural networks, specifically over their discrete-time counterparts. We evaluate our method in the context of visual-control learning of drones over a series of complex tasks, ranging from short- and long-term navigation, to chasing static and dynamic objects through photorealistic environments. Our results demonstrate that causal continuous-time\r\ndeep models can perform robust navigation tasks, where advanced recurrent models fail. These models learn complex causal control representations directly from raw visual inputs and scale to solve a variety of tasks using imitation learning."}],"project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF"}],"status":"public","acknowledgement":"C.V., R.H. A.A. and D.R. are partially supported by Boeing and MIT. A.A. is supported by the National Science Foundation (NSF) Graduate Research Fellowship Program. M.L. is supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). Research was sponsored by the United States Air Force Research Laboratory and the United States Air Force Artificial Intelligence Accelerator and was accomplished under Cooperative Agreement Number FA8750-19-2-1000. The views and conclusions contained in this document are those of the authors\r\nand should not be interpreted as representing the official policies, either expressed or implied, of the United States Air Force or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation herein.\r\n","publication_status":"published","citation":{"ista":"Vorbach CJ, Hasani R, Amini A, Lechner M, Rus D. 2021. Causal navigation by continuous-time neural networks. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems,  Advances in Neural Information Processing Systems, .","ama":"Vorbach CJ, Hasani R, Amini A, Lechner M, Rus D. Causal navigation by continuous-time neural networks. In: <i>35th Conference on Neural Information Processing Systems</i>. ; 2021.","short":"C.J. Vorbach, R. Hasani, A. Amini, M. Lechner, D. Rus, in:, 35th Conference on Neural Information Processing Systems, 2021.","apa":"Vorbach, C. J., Hasani, R., Amini, A., Lechner, M., &#38; Rus, D. (2021). Causal navigation by continuous-time neural networks. In <i>35th Conference on Neural Information Processing Systems</i>. Virtual.","ieee":"C. J. Vorbach, R. Hasani, A. Amini, M. Lechner, and D. Rus, “Causal navigation by continuous-time neural networks,” in <i>35th Conference on Neural Information Processing Systems</i>, Virtual, 2021.","chicago":"Vorbach, Charles J, Ramin Hasani, Alexander Amini, Mathias Lechner, and Daniela Rus. “Causal Navigation by Continuous-Time Neural Networks.” In <i>35th Conference on Neural Information Processing Systems</i>, 2021.","mla":"Vorbach, Charles J., et al. “Causal Navigation by Continuous-Time Neural Networks.” <i>35th Conference on Neural Information Processing Systems</i>, 2021."},"day":"01","ddc":["000"],"month":"12","file_date_updated":"2022-01-26T07:37:24Z","oa_version":"Published Version","conference":{"name":"NeurIPS: Neural Information Processing Systems","start_date":"2021-12-06","location":"Virtual","end_date":"2021-12-10"},"arxiv":1,"tmp":{"image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","short":"CC BY-NC-ND (3.0)"},"file":[{"file_size":6841228,"creator":"mlechner","relation":"main_file","file_name":"NeurIPS-2021-causal-navigation-by-continuous-time-neural-networks-Paper.pdf","content_type":"application/pdf","checksum":"be81f0ade174a8c9b2d4fe09590b2021","access_level":"open_access","date_updated":"2022-01-26T07:37:24Z","success":1,"date_created":"2022-01-26T07:37:24Z","file_id":"10679"}],"has_accepted_license":"1","article_processing_charge":"No"},{"has_accepted_license":"1","article_processing_charge":"No","volume":35,"arxiv":1,"file":[{"file_id":"10678","date_created":"2022-01-26T07:36:03Z","file_name":"16936-Article Text-20430-1-2-20210518 (1).pdf","relation":"main_file","creator":"mlechner","file_size":4302669,"success":1,"date_updated":"2022-01-26T07:36:03Z","access_level":"open_access","content_type":"application/pdf","checksum":"0f06995fba06dbcfa7ed965fc66027ff"}],"oa_version":"Published Version","conference":{"start_date":"2021-02-02","location":"Virtual","end_date":"2021-02-09","name":"AAAI: Association for the Advancement of Artificial Intelligence"},"citation":{"mla":"Hasani, Ramin, et al. “Liquid Time-Constant Networks.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 35, no. 9, AAAI Press, 2021, pp. 7657–66.","chicago":"Hasani, Ramin, Mathias Lechner, Alexander Amini, Daniela Rus, and Radu Grosu. “Liquid Time-Constant Networks.” In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, 35:7657–66. AAAI Press, 2021.","ieee":"R. Hasani, M. Lechner, A. Amini, D. Rus, and R. Grosu, “Liquid time-constant networks,” in <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, Virtual, 2021, vol. 35, no. 9, pp. 7657–7666.","apa":"Hasani, R., Lechner, M., Amini, A., Rus, D., &#38; Grosu, R. (2021). Liquid time-constant networks. In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i> (Vol. 35, pp. 7657–7666). Virtual: AAAI Press.","short":"R. Hasani, M. Lechner, A. Amini, D. Rus, R. Grosu, in:, Proceedings of the AAAI Conference on Artificial Intelligence, AAAI Press, 2021, pp. 7657–7666.","ista":"Hasani R, Lechner M, Amini A, Rus D, Grosu R. 2021. Liquid time-constant networks. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI: Association for the Advancement of Artificial Intelligence, Technical Tracks, vol. 35, 7657–7666.","ama":"Hasani R, Lechner M, Amini A, Rus D, Grosu R. Liquid time-constant networks. In: <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Vol 35. AAAI Press; 2021:7657-7666."},"day":"28","ddc":["000"],"month":"05","file_date_updated":"2022-01-26T07:36:03Z","publication_status":"published","status":"public","acknowledgement":"R.H. and D.R. are partially supported by Boeing. R.H. and R.G. were partially supported by the Horizon-2020 ECSEL\r\nProject grant No. 783163 (iDev40). M.L. was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). A.A. is supported by the National Science Foundation (NSF) Graduate Research Fellowship Program. This research work is partially drawn from the PhD dissertation of R.H.","publication_identifier":{"issn":["2159-5399"],"isbn":["978-1-57735-866-4"],"eissn":["2374-3468"]},"project":[{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","call_identifier":"FWF"}],"abstract":[{"text":"We introduce a new class of time-continuous recurrent neural network models. Instead of declaring a learning system’s dynamics by implicit nonlinearities, we construct networks of linear first-order dynamical systems modulated via nonlinear interlinked gates. The resulting models represent dynamical systems with varying (i.e., liquid) time-constants coupled to their hidden state, with outputs being computed by numerical differential equation solvers. These neural networks exhibit stable and bounded behavior, yield superior expressivity within the family of neural ordinary differential equations, and give rise to improved performance on time-series prediction tasks. To demonstrate these properties, we first take a theoretical approach to find bounds over their dynamics, and compute their expressive power by the trajectory length measure in a latent trajectory space. We then conduct a series of time-series prediction experiments to manifest the approximation capability of Liquid Time-Constant Networks (LTCs) compared to classical and modern RNNs.","lang":"eng"}],"issue":"9","title":"Liquid time-constant networks","author":[{"first_name":"Ramin","last_name":"Hasani","full_name":"Hasani, Ramin"},{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias","full_name":"Lechner, Mathias","last_name":"Lechner"},{"full_name":"Amini, Alexander","last_name":"Amini","first_name":"Alexander"},{"first_name":"Daniela","full_name":"Rus, Daniela","last_name":"Rus"},{"first_name":"Radu","full_name":"Grosu, Radu","last_name":"Grosu"}],"_id":"10671","language":[{"iso":"eng"}],"quality_controlled":"1","type":"conference","publisher":"AAAI Press","intvolume":"        35","main_file_link":[{"open_access":"1","url":"https://ojs.aaai.org/index.php/AAAI/article/view/16936"}],"date_published":"2021-05-28T00:00:00Z","external_id":{"arxiv":["2006.04439"]},"date_created":"2022-01-25T15:48:36Z","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"7657-7666","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","date_updated":"2022-05-24T06:36:54Z","alternative_title":["Technical Tracks"],"year":"2021","oa":1},{"file":[{"success":1,"date_updated":"2022-01-26T08:04:50Z","access_level":"open_access","checksum":"b35586a50ed1ca8f44767de116d18d81","content_type":"application/pdf","file_name":"2021_LMCS_AGHAJOHAR.pdf","file_size":819878,"relation":"main_file","creator":"alisjak","file_id":"10690","date_created":"2022-01-26T08:04:50Z"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"arxiv":1,"volume":17,"article_processing_charge":"No","has_accepted_license":"1","ddc":["510"],"file_date_updated":"2022-01-26T08:04:50Z","month":"02","citation":{"short":"M. Aghajohari, G. Avni, T.A. Henzinger, Logical Methods in Computer Science 17 (2021) 10:1-10:23.","ama":"Aghajohari M, Avni G, Henzinger TA. Determinacy in discrete-bidding infinite-duration games. <i>Logical Methods in Computer Science</i>. 2021;17(1):10:1-10:23. doi:<a href=\"https://doi.org/10.23638/LMCS-17(1:10)2021\">10.23638/LMCS-17(1:10)2021</a>","ista":"Aghajohari M, Avni G, Henzinger TA. 2021. Determinacy in discrete-bidding infinite-duration games. Logical Methods in Computer Science. 17(1), 10:1-10:23.","ieee":"M. Aghajohari, G. Avni, and T. A. Henzinger, “Determinacy in discrete-bidding infinite-duration games,” <i>Logical Methods in Computer Science</i>, vol. 17, no. 1. International Federation for Computational Logic, p. 10:1-10:23, 2021.","apa":"Aghajohari, M., Avni, G., &#38; Henzinger, T. A. (2021). Determinacy in discrete-bidding infinite-duration games. <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic. <a href=\"https://doi.org/10.23638/LMCS-17(1:10)2021\">https://doi.org/10.23638/LMCS-17(1:10)2021</a>","chicago":"Aghajohari, Milad, Guy Avni, and Thomas A Henzinger. “Determinacy in Discrete-Bidding Infinite-Duration Games.” <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic, 2021. <a href=\"https://doi.org/10.23638/LMCS-17(1:10)2021\">https://doi.org/10.23638/LMCS-17(1:10)2021</a>.","mla":"Aghajohari, Milad, et al. “Determinacy in Discrete-Bidding Infinite-Duration Games.” <i>Logical Methods in Computer Science</i>, vol. 17, no. 1, International Federation for Computational Logic, 2021, p. 10:1-10:23, doi:<a href=\"https://doi.org/10.23638/LMCS-17(1:10)2021\">10.23638/LMCS-17(1:10)2021</a>."},"day":"03","oa_version":"Published Version","license":"https://creativecommons.org/licenses/by/4.0/","project":[{"grant_number":"M02369","_id":"264B3912-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Formal Methods meets Algorithmic Game Theory"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S11402-N23","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425"},{"name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"}],"publication_identifier":{"eissn":["1860-5974"]},"status":"public","publication_status":"published","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23 (RiSE/SHiNE), Z211-N23 (Wittgenstein Award), and M 2369-N33 (Meitner fellowship).\r\n","_id":"10674","title":"Determinacy in discrete-bidding infinite-duration games","author":[{"last_name":"Aghajohari","full_name":"Aghajohari, Milad","first_name":"Milad"},{"last_name":"Avni","full_name":"Avni, Guy","first_name":"Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5588-8287"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724"}],"doi":"10.23638/LMCS-17(1:10)2021","abstract":[{"lang":"eng","text":"In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the winner of the game. Such games are central in formal methods since they model the interaction between a non-terminating system and its environment. In bidding games the players bid for the right to move the token: in each round, the players simultaneously submit bids, and the higher bidder moves the token and pays the other player. Bidding games are known to have a clean and elegant mathematical structure that relies on the ability of the players to submit arbitrarily small bids. Many applications, however, require a fixed granularity for the bids, which can represent, for example, the monetary value expressed in cents. We study, for the first time, the combination of discrete-bidding and infinite-duration games. Our most important result proves that these games form a large determined subclass of concurrent games, where determinacy is the strong property that there always exists exactly one player who can guarantee winning the game. In particular, we show that, in contrast to non-discrete bidding games, the mechanism with which tied bids are resolved plays an important role in discrete-bidding games. We study several natural tie-breaking mechanisms and show that, while some do not admit determinacy, most natural mechanisms imply determinacy for every pair of initial budgets."}],"issue":"1","publisher":"International Federation for Computational Logic","intvolume":"        17","quality_controlled":"1","type":"journal_article","language":[{"iso":"eng"}],"isi":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"ToHe"}],"date_created":"2022-01-25T16:32:13Z","scopus_import":"1","date_published":"2021-02-03T00:00:00Z","external_id":{"arxiv":["1905.03588"],"isi":["000658724600010"]},"date_updated":"2023-08-17T06:56:42Z","publication":"Logical Methods in Computer Science","page":"10:1-10:23","article_type":"original","oa":1,"keyword":["computer science","computer science and game theory","logic in computer science"],"year":"2021"},{"publication_status":"published","acknowledgement":"This research was performed while Bernhard Kragl was at IST Austria, supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","status":"public","project":[{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize"}],"publication_identifier":{"isbn":["978-3-85448-046-4"]},"doi":"10.34727/2021/isbn.978-3-85448-046-4_23","abstract":[{"lang":"eng","text":"Civl is a static verifier for concurrent programs designed around the conceptual framework of layered refinement,\r\nwhich views the task of verifying a program as a sequence of program simplification steps each justified by its own invariant. Civl verifies a layered concurrent program that compactly expresses all the programs in this sequence and the supporting invariants. This paper presents the design and implementation of the Civl verifier."}],"editor":[{"last_name":"Ruzica","full_name":"Ruzica, Piskac","first_name":"Piskac"},{"first_name":"Michael W.","last_name":"Whalen","full_name":"Whalen, Michael W."}],"_id":"10688","title":"The Civl verifier","author":[{"orcid":"0000-0001-7745-9117","id":"320FC952-F248-11E8-B48F-1D18A9856A87","first_name":"Bernhard","full_name":"Kragl, Bernhard","last_name":"Kragl"},{"full_name":"Qadeer, Shaz","last_name":"Qadeer","first_name":"Shaz"}],"volume":2,"article_processing_charge":"No","has_accepted_license":"1","file":[{"success":1,"date_updated":"2022-01-26T08:04:29Z","access_level":"open_access","checksum":"35438ac9f9750340b7f8ae4ae3220d9f","content_type":"application/pdf","file_name":"2021_FCAD2021_Kragl.pdf","creator":"cchlebak","file_size":390555,"relation":"main_file","file_id":"10689","date_created":"2022-01-26T08:04:29Z"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Published Version","conference":{"name":"FMCAD: Formal Methods in Computer-Aided Design","start_date":"2021-10-20","location":"Virtual","end_date":"2021-10-22"},"month":"10","file_date_updated":"2022-01-26T08:04:29Z","ddc":["000"],"citation":{"short":"B. Kragl, S. Qadeer, in:, P. Ruzica, M.W. Whalen (Eds.), Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design, TU Wien Academic Press, 2021, pp. 143–152.","ista":"Kragl B, Qadeer S. 2021. The Civl verifier. Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, Conference Series, vol. 2, 143–152.","ama":"Kragl B, Qadeer S. The Civl verifier. In: Ruzica P, Whalen MW, eds. <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i>. Vol 2. TU Wien Academic Press; 2021:143–152. doi:<a href=\"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23\">10.34727/2021/isbn.978-3-85448-046-4_23</a>","apa":"Kragl, B., &#38; Qadeer, S. (2021). The Civl verifier. In P. Ruzica &#38; M. W. Whalen (Eds.), <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i> (Vol. 2, pp. 143–152). Virtual: TU Wien Academic Press. <a href=\"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23\">https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23</a>","ieee":"B. Kragl and S. Qadeer, “The Civl verifier,” in <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i>, Virtual, 2021, vol. 2, pp. 143–152.","mla":"Kragl, Bernhard, and Shaz Qadeer. “The Civl Verifier.” <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i>, edited by Piskac Ruzica and Michael W. Whalen, vol. 2, TU Wien Academic Press, 2021, pp. 143–152, doi:<a href=\"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23\">10.34727/2021/isbn.978-3-85448-046-4_23</a>.","chicago":"Kragl, Bernhard, and Shaz Qadeer. “The Civl Verifier.” In <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i>, edited by Piskac Ruzica and Michael W. Whalen, 2:143–152. TU Wien Academic Press, 2021. <a href=\"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23\">https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23</a>."},"day":"01","page":"143–152","date_updated":"2022-01-26T08:20:41Z","publication":"Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design","alternative_title":["Conference Series"],"year":"2021","oa":1,"quality_controlled":"1","language":[{"iso":"eng"}],"type":"conference","publisher":"TU Wien Academic Press","intvolume":"         2","date_created":"2022-01-26T08:01:30Z","date_published":"2021-10-01T00:00:00Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","department":[{"_id":"ToHe"}]},{"citation":{"ama":"Avni G, Jecker IR, Zikelic D. Infinite-duration all-pay bidding games. In: Marx D, ed. <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i>. Society for Industrial and Applied Mathematics; 2021:617-636. doi:<a href=\"https://doi.org/10.1137/1.9781611976465.38\">10.1137/1.9781611976465.38</a>","short":"G. Avni, I.R. Jecker, D. Zikelic, in:, D. Marx (Ed.), Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2021, pp. 617–636.","ista":"Avni G, Jecker IR, Zikelic D. 2021. Infinite-duration all-pay bidding games. Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 617–636.","ieee":"G. Avni, I. R. Jecker, and D. Zikelic, “Infinite-duration all-pay bidding games,” in <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i>, Virtual, 2021, pp. 617–636.","apa":"Avni, G., Jecker, I. R., &#38; Zikelic, D. (2021). Infinite-duration all-pay bidding games. In D. Marx (Ed.), <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 617–636). Virtual: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611976465.38\">https://doi.org/10.1137/1.9781611976465.38</a>","chicago":"Avni, Guy, Ismael R Jecker, and Dorde Zikelic. “Infinite-Duration All-Pay Bidding Games.” In <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i>, edited by Dániel Marx, 617–36. Society for Industrial and Applied Mathematics, 2021. <a href=\"https://doi.org/10.1137/1.9781611976465.38\">https://doi.org/10.1137/1.9781611976465.38</a>.","mla":"Avni, Guy, et al. “Infinite-Duration All-Pay Bidding Games.” <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i>, edited by Dániel Marx, Society for Industrial and Applied Mathematics, 2021, pp. 617–36, doi:<a href=\"https://doi.org/10.1137/1.9781611976465.38\">10.1137/1.9781611976465.38</a>."},"day":"01","month":"01","oa_version":"Preprint","conference":{"location":"Virtual","start_date":"2021-01-10","end_date":"2021-01-13","name":"SODA: Symposium on Discrete Algorithms"},"arxiv":1,"article_processing_charge":"No","title":"Infinite-duration all-pay bidding games","author":[{"orcid":"0000-0001-5588-8287","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","first_name":"Guy","full_name":"Avni, Guy","last_name":"Avni"},{"full_name":"Jecker, Ismael R","last_name":"Jecker","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","first_name":"Ismael R"},{"first_name":"Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","last_name":"Zikelic","full_name":"Zikelic, Dorde","orcid":"0000-0002-4681-1699"}],"_id":"10694","editor":[{"first_name":"Dániel","last_name":"Marx","full_name":"Marx, Dániel"}],"abstract":[{"lang":"eng","text":"In a two-player zero-sum graph game the players move a token throughout a graph to produce an infinite path, which determines the winner or payoff of the game. Traditionally, the players alternate turns in moving the token. In bidding games, however, the players have budgets, and in each turn, we hold an “auction” (bidding) to determine which player moves the token: both players simultaneously submit bids and the higher bidder moves the token. The bidding mechanisms differ in their payment schemes. Bidding games were largely studied with variants of first-price bidding in which only the higher bidder pays his bid. We focus on all-pay bidding, where both players pay their bids. Finite-duration all-pay bidding games were studied and shown to be technically more challenging than their first-price counterparts. We study for the first time, infinite-duration all-pay bidding games. Our most interesting results are for mean-payoff objectives: we portray a complete picture for games played on strongly-connected graphs. We study both pure (deterministic) and mixed (probabilistic) strategies and completely characterize the optimal and almost-sure (with probability 1) payoffs the players can respectively guarantee. We show that mean-payoff games under all-pay bidding exhibit the intriguing mathematical properties of their first-price counterparts; namely, an equivalence with random-turn games in which in each turn, the player who moves is selected according to a (biased) coin toss. The equivalences for all-pay bidding are more intricate and unexpected than for first-price bidding."}],"doi":"10.1137/1.9781611976465.38","publication_identifier":{"isbn":["978-1-61197-646-5"]},"project":[{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize"},{"call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"call_identifier":"H2020","name":"International IST Doctoral Program","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"status":"public","publication_status":"published","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award), ERC CoG 863818 (FoRM-SMArt), and by the European Union's Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","ec_funded":1,"department":[{"_id":"GradSch"},{"_id":"KrCh"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_published":"2021-01-01T00:00:00Z","external_id":{"arxiv":["2005.06636"]},"date_created":"2022-01-27T12:11:23Z","scopus_import":"1","publisher":"Society for Industrial and Applied Mathematics","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2005.06636"}],"type":"conference","language":[{"iso":"eng"}],"quality_controlled":"1","oa":1,"year":"2021","publication":"Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms","date_updated":"2025-07-14T09:10:12Z","page":"617-636"},{"date_updated":"2023-08-17T06:59:16Z","publication":"Compositio Mathematica","article_type":"original","page":"1610-1651","oa":1,"keyword":["Algebra and Number Theory"],"year":"2021","intvolume":"       157","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1909.03266"}],"publisher":"Cambridge University Press","quality_controlled":"1","language":[{"iso":"eng"}],"type":"journal_article","isi":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"TiBr"}],"date_created":"2022-02-01T08:10:43Z","external_id":{"isi":["000667289300001"],"arxiv":["1909.03266"]},"date_published":"2021-06-28T00:00:00Z","publication_identifier":{"eissn":["1570-5846"],"issn":["0010-437X"]},"publication_status":"published","acknowledgement":"We would like to thank the anonymous referees for carefully reading the paper and for their remarks and suggestions.","status":"public","_id":"10711","author":[{"first_name":"Pascal","full_name":"Autissier, Pascal","last_name":"Autissier"},{"id":"6A459894-5FDD-11E9-AF35-BB24E6697425","first_name":"Dante","full_name":"Bonolis, Dante","last_name":"Bonolis"},{"full_name":"Lamzouri, Youness","last_name":"Lamzouri","first_name":"Youness"}],"title":"The distribution of the maximum of partial sums of Kloosterman sums and other trace functions","doi":"10.1112/s0010437x21007351","issue":"7","abstract":[{"lang":"eng","text":"In this paper, we investigate the distribution of the maximum of partial sums of families of  m -periodic complex-valued functions satisfying certain conditions. We obtain precise uniform estimates for the distribution function of this maximum in a near-optimal range. Our results apply to partial sums of Kloosterman sums and other families of  ℓ -adic trace functions, and are as strong as those obtained by Bober, Goldmakher, Granville and Koukoulopoulos for character sums. In particular, we improve on the recent work of the third author for Birch sums. However, unlike character sums, we are able to construct families of  m -periodic complex-valued functions which satisfy our conditions, but for which the Pólya–Vinogradov inequality is sharp."}],"arxiv":1,"article_processing_charge":"No","volume":157,"month":"06","day":"28","citation":{"chicago":"Autissier, Pascal, Dante Bonolis, and Youness Lamzouri. “The Distribution of the Maximum of Partial Sums of Kloosterman Sums and Other Trace Functions.” <i>Compositio Mathematica</i>. Cambridge University Press, 2021. <a href=\"https://doi.org/10.1112/s0010437x21007351\">https://doi.org/10.1112/s0010437x21007351</a>.","mla":"Autissier, Pascal, et al. “The Distribution of the Maximum of Partial Sums of Kloosterman Sums and Other Trace Functions.” <i>Compositio Mathematica</i>, vol. 157, no. 7, Cambridge University Press, 2021, pp. 1610–51, doi:<a href=\"https://doi.org/10.1112/s0010437x21007351\">10.1112/s0010437x21007351</a>.","ama":"Autissier P, Bonolis D, Lamzouri Y. The distribution of the maximum of partial sums of Kloosterman sums and other trace functions. <i>Compositio Mathematica</i>. 2021;157(7):1610-1651. doi:<a href=\"https://doi.org/10.1112/s0010437x21007351\">10.1112/s0010437x21007351</a>","ista":"Autissier P, Bonolis D, Lamzouri Y. 2021. The distribution of the maximum of partial sums of Kloosterman sums and other trace functions. Compositio Mathematica. 157(7), 1610–1651.","short":"P. Autissier, D. Bonolis, Y. Lamzouri, Compositio Mathematica 157 (2021) 1610–1651.","ieee":"P. Autissier, D. Bonolis, and Y. Lamzouri, “The distribution of the maximum of partial sums of Kloosterman sums and other trace functions,” <i>Compositio Mathematica</i>, vol. 157, no. 7. Cambridge University Press, pp. 1610–1651, 2021.","apa":"Autissier, P., Bonolis, D., &#38; Lamzouri, Y. (2021). The distribution of the maximum of partial sums of Kloosterman sums and other trace functions. <i>Compositio Mathematica</i>. Cambridge University Press. <a href=\"https://doi.org/10.1112/s0010437x21007351\">https://doi.org/10.1112/s0010437x21007351</a>"},"oa_version":"Preprint"},{"ec_funded":1,"status":"public","acknowledgement":"N. L. and R. S. gratefully acknowledge financial support by the European Research Council\r\n(ERC) under the European Union’s Horizon 2020 research and innovation programme (grant\r\nagreement No 694227). B. S. acknowledges support from the Swiss National Science Foundation (grant 200020_172623) and from the NCCR SwissMAP. N. L. would like to thank\r\nAndreas Deuchert and David Mitrouskas for interesting discussions. B. S. and R. S. would\r\nlike to thank Rupert Frank for stimulating discussions about the time-evolution of a polaron.\r\n","publication_status":"published","project":[{"_id":"25C6DC12-B435-11E9-9278-68D0E5697425","grant_number":"694227","call_identifier":"H2020","name":"Analysis of quantum many-body systems"}],"publication_identifier":{"issn":["2157-5045"],"eissn":["1948-206X"]},"doi":"10.2140/APDE.2021.14.2079","issue":"7","abstract":[{"text":"We prove an adiabatic theorem for the Landau–Pekar equations. This allows us to derive new results on the accuracy of their use as effective equations for the time evolution generated by the Fröhlich Hamiltonian with large coupling constant α. In particular, we show that the time evolution of Pekar product states with coherent phonon field and the electron being trapped by the phonons is well approximated by the Landau–Pekar equations until times short compared to α2.","lang":"eng"}],"_id":"10738","author":[{"orcid":"0000-0002-0495-6822","full_name":"Leopold, Nikolai K","last_name":"Leopold","id":"4BC40BEC-F248-11E8-B48F-1D18A9856A87","first_name":"Nikolai K"},{"first_name":"Simone Anna Elvira","id":"856966FE-A408-11E9-977E-802DE6697425","last_name":"Rademacher","full_name":"Rademacher, Simone Anna Elvira","orcid":"0000-0001-5059-4466"},{"full_name":"Schlein, Benjamin","last_name":"Schlein","first_name":"Benjamin"},{"orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert","last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert"}],"title":" The Landau–Pekar equations: Adiabatic theorem and accuracy","volume":14,"article_processing_charge":"No","arxiv":1,"oa_version":"Preprint","month":"11","day":"10","citation":{"chicago":"Leopold, Nikolai K, Simone Anna Elvira Rademacher, Benjamin Schlein, and Robert Seiringer. “ The Landau–Pekar Equations: Adiabatic Theorem and Accuracy.” <i>Analysis and PDE</i>. Mathematical Sciences Publishers, 2021. <a href=\"https://doi.org/10.2140/APDE.2021.14.2079\">https://doi.org/10.2140/APDE.2021.14.2079</a>.","mla":"Leopold, Nikolai K., et al. “ The Landau–Pekar Equations: Adiabatic Theorem and Accuracy.” <i>Analysis and PDE</i>, vol. 14, no. 7, Mathematical Sciences Publishers, 2021, pp. 2079–100, doi:<a href=\"https://doi.org/10.2140/APDE.2021.14.2079\">10.2140/APDE.2021.14.2079</a>.","ieee":"N. K. Leopold, S. A. E. Rademacher, B. Schlein, and R. Seiringer, “ The Landau–Pekar equations: Adiabatic theorem and accuracy,” <i>Analysis and PDE</i>, vol. 14, no. 7. Mathematical Sciences Publishers, pp. 2079–2100, 2021.","apa":"Leopold, N. K., Rademacher, S. A. E., Schlein, B., &#38; Seiringer, R. (2021).  The Landau–Pekar equations: Adiabatic theorem and accuracy. <i>Analysis and PDE</i>. Mathematical Sciences Publishers. <a href=\"https://doi.org/10.2140/APDE.2021.14.2079\">https://doi.org/10.2140/APDE.2021.14.2079</a>","ista":"Leopold NK, Rademacher SAE, Schlein B, Seiringer R. 2021.  The Landau–Pekar equations: Adiabatic theorem and accuracy. Analysis and PDE. 14(7), 2079–2100.","short":"N.K. Leopold, S.A.E. Rademacher, B. Schlein, R. Seiringer, Analysis and PDE 14 (2021) 2079–2100.","ama":"Leopold NK, Rademacher SAE, Schlein B, Seiringer R.  The Landau–Pekar equations: Adiabatic theorem and accuracy. <i>Analysis and PDE</i>. 2021;14(7):2079-2100. doi:<a href=\"https://doi.org/10.2140/APDE.2021.14.2079\">10.2140/APDE.2021.14.2079</a>"},"article_type":"original","page":"2079-2100","date_updated":"2023-10-17T11:26:45Z","publication":"Analysis and PDE","year":"2021","oa":1,"type":"journal_article","quality_controlled":"1","language":[{"iso":"eng"}],"isi":1,"main_file_link":[{"url":"https://arxiv.org/abs/1904.12532","open_access":"1"}],"intvolume":"        14","publisher":"Mathematical Sciences Publishers","scopus_import":"1","date_created":"2022-02-06T23:01:33Z","date_published":"2021-11-10T00:00:00Z","external_id":{"isi":["000733976600004"],"arxiv":["1904.12532"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"RoSe"}]},{"doi":"10.48550/arXiv.2105.15193","abstract":[{"text":"Methods inspired from machine learning have recently attracted great interest in the computational study of quantum many-particle systems. So far, however, it has proven challenging to deal with microscopic models in which the total number of particles is not conserved. To address this issue, we propose a new variant of neural network states, which we term neural coherent states. Taking the Fröhlich impurity model as a case study, we show that neural coherent states can learn the ground state of non-additive systems very well. In particular, we observe substantial improvement over the standard coherent state estimates in the most challenging intermediate coupling regime. Our approach is generic and does not assume specific details of the system, suggesting wide applications.","lang":"eng"}],"year":"2021","_id":"10762","title":"Artificial neural network states for non-additive systems","oa":1,"author":[{"first_name":"Wojciech","id":"48C55298-F248-11E8-B48F-1D18A9856A87","last_name":"Rzadkowski","full_name":"Rzadkowski, Wojciech","orcid":"0000-0002-1106-4419"},{"orcid":"0000-0002-6990-7802","first_name":"Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","last_name":"Lemeshko","full_name":"Lemeshko, Mikhail"},{"first_name":"Johan H.","last_name":"Mentink","full_name":"Mentink, Johan H."}],"page":"2105.15193","ec_funded":1,"related_material":{"record":[{"id":"10759","status":"public","relation":"dissertation_contains"}]},"publication_status":"submitted","acknowledgement":"We acknowledge fruitful discussions with Giacomo Bighin, Giammarco Fabiani, Areg Ghazaryan, Christoph\r\nLampert, and Artem Volosniev at various stages of this work. W.R. is a recipient of a DOC Fellowship of the\r\nAustrian Academy of Sciences and has received funding from the EU Horizon 2020 programme under the Marie\r\nSkłodowska-Curie Grant Agreement No. 665385. M. L. acknowledges support by the European Research Council (ERC) Starting Grant No. 801770 (ANGULON). This work is part of the Shell-NWO/FOM-initiative “Computational sciences for energy research” of Shell and Chemical Sciences, Earth and Life Sciences, Physical Sciences, FOM and STW.","status":"public","date_updated":"2023-09-07T13:44:16Z","project":[{"name":"Angulon: physics and applications of a new quasiparticle","call_identifier":"H2020","grant_number":"801770","_id":"2688CF98-B435-11E9-9278-68D0E5697425"},{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","name":"International IST Doctoral Program","call_identifier":"H2020"}],"publication":"arXiv","oa_version":"Preprint","date_created":"2022-02-17T11:18:57Z","external_id":{"arxiv":["2105.15193"]},"date_published":"2021-05-31T00:00:00Z","month":"05","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Rzadkowski, Wojciech, et al. “Artificial Neural Network States for Non-Additive Systems.” <i>ArXiv</i>, doi:<a href=\"https://doi.org/10.48550/arXiv.2105.15193\">10.48550/arXiv.2105.15193</a>.","chicago":"Rzadkowski, Wojciech, Mikhail Lemeshko, and Johan H. Mentink. “Artificial Neural Network States for Non-Additive Systems.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2105.15193\">https://doi.org/10.48550/arXiv.2105.15193</a>.","ista":"Rzadkowski W, Lemeshko M, Mentink JH. Artificial neural network states for non-additive systems. arXiv, <a href=\"https://doi.org/10.48550/arXiv.2105.15193\">10.48550/arXiv.2105.15193</a>.","ama":"Rzadkowski W, Lemeshko M, Mentink JH. Artificial neural network states for non-additive systems. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2105.15193\">10.48550/arXiv.2105.15193</a>","short":"W. Rzadkowski, M. Lemeshko, J.H. Mentink, ArXiv (n.d.).","apa":"Rzadkowski, W., Lemeshko, M., &#38; Mentink, J. H. (n.d.). Artificial neural network states for non-additive systems. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2105.15193\">https://doi.org/10.48550/arXiv.2105.15193</a>","ieee":"W. Rzadkowski, M. Lemeshko, and J. H. Mentink, “Artificial neural network states for non-additive systems,” <i>arXiv</i>. ."},"day":"31","department":[{"_id":"MiLe"}],"article_processing_charge":"No","language":[{"iso":"eng"}],"type":"preprint","arxiv":1,"main_file_link":[{"url":"https://arxiv.org/abs/2105.15193","open_access":"1"}]},{"article_number":"2102.05996","related_material":{"record":[{"id":"10799","status":"public","relation":"dissertation_contains"}]},"publication_status":"submitted","status":"public","date_updated":"2023-09-07T13:42:08Z","publication":"arXiv","doi":"10.48550/arXiv.2102.05996","abstract":[{"text":"Given the abundance of applications of ranking in recent years, addressing fairness concerns around automated ranking systems becomes necessary for increasing the trust among end-users. Previous work on fair ranking has mostly focused on application-specific fairness notions, often tailored to online advertising, and it rarely considers learning as part of the process. In this work, we show how to transfer numerous fairness notions from binary classification to a learning to rank setting. Our formalism allows us to design methods for incorporating fairness objectives with provable generalization guarantees. An extensive experimental evaluation shows that our method can improve ranking fairness substantially with no or only little loss of model quality.","lang":"eng"}],"year":"2021","_id":"10803","oa":1,"title":"Fairness through regularization for learning to rank","author":[{"id":"4B9D76E4-F248-11E8-B48F-1D18A9856A87","first_name":"Nikola H","full_name":"Konstantinov, Nikola H","last_name":"Konstantinov"},{"full_name":"Lampert, Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","orcid":"0000-0002-4561-241X"}],"article_processing_charge":"No","type":"preprint","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/2102.05996","open_access":"1"}],"arxiv":1,"date_created":"2022-02-28T14:13:59Z","oa_version":"Preprint","external_id":{"arxiv":["2102.05996"]},"date_published":"2021-06-07T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"06","citation":{"chicago":"Konstantinov, Nikola H, and Christoph Lampert. “Fairness through Regularization for Learning to Rank.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2102.05996\">https://doi.org/10.48550/arXiv.2102.05996</a>.","mla":"Konstantinov, Nikola H., and Christoph Lampert. “Fairness through Regularization for Learning to Rank.” <i>ArXiv</i>, 2102.05996, doi:<a href=\"https://doi.org/10.48550/arXiv.2102.05996\">10.48550/arXiv.2102.05996</a>.","ama":"Konstantinov NH, Lampert C. Fairness through regularization for learning to rank. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2102.05996\">10.48550/arXiv.2102.05996</a>","ista":"Konstantinov NH, Lampert C. Fairness through regularization for learning to rank. arXiv, 2102.05996.","short":"N.H. Konstantinov, C. Lampert, ArXiv (n.d.).","apa":"Konstantinov, N. H., &#38; Lampert, C. (n.d.). Fairness through regularization for learning to rank. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2102.05996\">https://doi.org/10.48550/arXiv.2102.05996</a>","ieee":"N. H. Konstantinov and C. Lampert, “Fairness through regularization for learning to rank,” <i>arXiv</i>. ."},"day":"07","department":[{"_id":"ChLa"}]},{"article_processing_charge":"Yes (via OA deal)","volume":1,"has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"file_name":"2021_JACSAu_Calcabrini.pdf","relation":"main_file","file_size":1257973,"creator":"cchlebak","success":1,"date_updated":"2022-03-02T15:33:18Z","access_level":"open_access","checksum":"1c66a35369e911312a359111420318a9","content_type":"application/pdf","file_id":"10807","date_created":"2022-03-02T15:33:18Z"}],"oa_version":"Published Version","ddc":["540"],"file_date_updated":"2022-03-02T15:33:18Z","month":"11","citation":{"ama":"Calcabrini M, Van den Eynden D, Sanchez Ribot S, et al. Ligand conversion in nanocrystal synthesis: The oxidation of alkylamines to fatty acids by nitrate. <i>JACS Au</i>. 2021;1(11):1898-1903. doi:<a href=\"https://doi.org/10.1021/jacsau.1c00349\">10.1021/jacsau.1c00349</a>","ista":"Calcabrini M, Van den Eynden D, Sanchez Ribot S, Pokratath R, Llorca J, De Roo J, Ibáñez M. 2021. Ligand conversion in nanocrystal synthesis: The oxidation of alkylamines to fatty acids by nitrate. JACS Au. 1(11), 1898–1903.","short":"M. Calcabrini, D. Van den Eynden, S. Sanchez Ribot, R. Pokratath, J. Llorca, J. De Roo, M. Ibáñez, JACS Au 1 (2021) 1898–1903.","ieee":"M. Calcabrini <i>et al.</i>, “Ligand conversion in nanocrystal synthesis: The oxidation of alkylamines to fatty acids by nitrate,” <i>JACS Au</i>, vol. 1, no. 11. American Chemical Society, pp. 1898–1903, 2021.","apa":"Calcabrini, M., Van den Eynden, D., Sanchez Ribot, S., Pokratath, R., Llorca, J., De Roo, J., &#38; Ibáñez, M. (2021). Ligand conversion in nanocrystal synthesis: The oxidation of alkylamines to fatty acids by nitrate. <i>JACS Au</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/jacsau.1c00349\">https://doi.org/10.1021/jacsau.1c00349</a>","mla":"Calcabrini, Mariano, et al. “Ligand Conversion in Nanocrystal Synthesis: The Oxidation of Alkylamines to Fatty Acids by Nitrate.” <i>JACS Au</i>, vol. 1, no. 11, American Chemical Society, 2021, pp. 1898–903, doi:<a href=\"https://doi.org/10.1021/jacsau.1c00349\">10.1021/jacsau.1c00349</a>.","chicago":"Calcabrini, Mariano, Dietger Van den Eynden, Sergi Sanchez Ribot, Rohan Pokratath, Jordi Llorca, Jonathan De Roo, and Maria Ibáñez. “Ligand Conversion in Nanocrystal Synthesis: The Oxidation of Alkylamines to Fatty Acids by Nitrate.” <i>JACS Au</i>. American Chemical Society, 2021. <a href=\"https://doi.org/10.1021/jacsau.1c00349\">https://doi.org/10.1021/jacsau.1c00349</a>."},"day":"22","ec_funded":1,"status":"public","publication_status":"published","acknowledgement":"This work was financially supported by IST Austria and the Werner Siemens Foundation. M.C. has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385. The work was also financially supported by University of Basel, SNSF NCCR Molecular Systems Engineering (project number: 182895) and SNSF R’equip (project number: 189622). J.L. is a Serra Húnter Fellow and is grateful to ICREA Academia program and MICINN/FEDER RTI2018-093996-B-C31 and GC 2017 SGR 128 projects.","project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","call_identifier":"H2020","name":"International IST Doctoral Program"},{"_id":"9B8F7476-BA93-11EA-9121-9846C619BF3A","name":"HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of Semiconductors for Waste Heat Recovery"},{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"publication_identifier":{"eissn":["2691-3704"],"issn":["2691-3704"]},"doi":"10.1021/jacsau.1c00349","abstract":[{"text":"Ligands are a fundamental part of nanocrystals. They control and direct nanocrystal syntheses and provide colloidal stability. Bound ligands also affect the nanocrystals’ chemical reactivity and electronic structure. Surface chemistry is thus crucial to understand nanocrystal properties and functionality. Here, we investigate the synthesis of metal oxide nanocrystals (CeO2-x, ZnO, and NiO) from metal nitrate precursors, in the presence of oleylamine ligands. Surprisingly, the nanocrystals are capped exclusively with a fatty acid instead of oleylamine. Analysis of the reaction mixtures with nuclear magnetic resonance spectroscopy revealed several reaction byproducts and intermediates that are common to the decomposition of Ce, Zn, Ni, and Zr nitrate precursors. Our evidence supports the oxidation of alkylamine and formation of a carboxylic acid, thus unraveling this counterintuitive surface chemistry.","lang":"eng"}],"issue":"11","_id":"10806","title":"Ligand conversion in nanocrystal synthesis: The oxidation of alkylamines to fatty acids by nitrate","author":[{"last_name":"Calcabrini","full_name":"Calcabrini, Mariano","first_name":"Mariano","id":"45D7531A-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Dietger","full_name":"Van den Eynden, Dietger","last_name":"Van den Eynden"},{"full_name":"Sanchez Ribot, Sergi","last_name":"Sanchez Ribot","id":"ddae5a59-f6e0-11ea-865d-d9dc61e77a2a","first_name":"Sergi"},{"full_name":"Pokratath, Rohan","last_name":"Pokratath","first_name":"Rohan"},{"first_name":"Jordi","full_name":"Llorca, Jordi","last_name":"Llorca"},{"last_name":"De Roo","full_name":"De Roo, Jonathan","first_name":"Jonathan"},{"full_name":"Ibáñez, Maria","last_name":"Ibáñez","id":"43C61214-F248-11E8-B48F-1D18A9856A87","first_name":"Maria","orcid":"0000-0001-5013-2843"}],"language":[{"iso":"eng"}],"type":"journal_article","quality_controlled":"1","publisher":"American Chemical Society","intvolume":"         1","date_created":"2022-03-02T15:24:16Z","date_published":"2021-11-22T00:00:00Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","department":[{"_id":"MaIb"}],"page":"1898-1903","article_type":"original","related_material":{"link":[{"url":"https://doi.org/10.26434/chemrxiv-2021-cn2fr","relation":"earlier_version"}],"record":[{"status":"public","relation":"dissertation_contains","id":"12885"}]},"date_updated":"2023-05-05T08:45:36Z","publication":"JACS Au","keyword":["general medicine"],"year":"2021","oa":1},{"article_processing_charge":"No","volume":371,"month":"02","pmid":1,"day":"12","citation":{"mla":"Liu, Yu, and Maria Ibáñez. “Tidying up the Mess.” <i>Science</i>, vol. 371, no. 6530, American Association for the Advancement of Science, 2021, pp. 678–79, doi:<a href=\"https://doi.org/10.1126/science.abg0886\">10.1126/science.abg0886</a>.","chicago":"Liu, Yu, and Maria Ibáñez. “Tidying up the Mess.” <i>Science</i>. American Association for the Advancement of Science, 2021. <a href=\"https://doi.org/10.1126/science.abg0886\">https://doi.org/10.1126/science.abg0886</a>.","ieee":"Y. Liu and M. Ibáñez, “Tidying up the mess,” <i>Science</i>, vol. 371, no. 6530. American Association for the Advancement of Science, pp. 678–679, 2021.","apa":"Liu, Y., &#38; Ibáñez, M. (2021). Tidying up the mess. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.abg0886\">https://doi.org/10.1126/science.abg0886</a>","ama":"Liu Y, Ibáñez M. Tidying up the mess. <i>Science</i>. 2021;371(6530):678-679. doi:<a href=\"https://doi.org/10.1126/science.abg0886\">10.1126/science.abg0886</a>","ista":"Liu Y, Ibáñez M. 2021. Tidying up the mess. Science. 371(6530), 678–679.","short":"Y. Liu, M. Ibáñez, Science 371 (2021) 678–679."},"oa_version":"None","publication_identifier":{"issn":["0036-8075"],"eissn":["1095-9203"]},"status":"public","publication_status":"published","_id":"10809","author":[{"first_name":"Yu","id":"2A70014E-F248-11E8-B48F-1D18A9856A87","last_name":"Liu","full_name":"Liu, Yu","orcid":"0000-0001-7313-6740"},{"orcid":"0000-0001-5013-2843","last_name":"Ibáñez","full_name":"Ibáñez, Maria","first_name":"Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87"}],"title":"Tidying up the mess","doi":"10.1126/science.abg0886","issue":"6530","abstract":[{"lang":"eng","text":"Thermoelectric materials are engines that convert heat into an electrical current. Intuitively, the efficiency of this process depends on how many electrons (charge carriers) can move and how easily they do so, how much energy those moving electrons transport, and how easily the temperature gradient is maintained. In terms of material properties, an excellent thermoelectric material requires a high electrical conductivity σ, a high Seebeck coefficient S (a measure of the induced thermoelectric voltage as a function of temperature gradient), and a low thermal conductivity κ. The challenge is that these three properties are strongly interrelated in a conflicting manner (1). On page 722 of this issue, Roychowdhury et al. (2) have found a way to partially break these ties in silver antimony telluride (AgSbTe2) with the addition of cadmium (Cd) cations, which increase the ordering in this inherently disordered thermoelectric material."}],"intvolume":"       371","publisher":"American Association for the Advancement of Science","quality_controlled":"1","language":[{"iso":"eng"}],"type":"journal_article","isi":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"MaIb"}],"scopus_import":"1","date_created":"2022-03-03T09:51:48Z","external_id":{"isi":["000617551600027"],"pmid":["33574201"]},"date_published":"2021-02-12T00:00:00Z","date_updated":"2023-08-17T07:00:35Z","publication":"Science","article_type":"letter_note","page":"678-679","keyword":["multidisciplinary"],"year":"2021"},{"abstract":[{"text":"Pattern separation is a fundamental brain computation that converts small differences in input patterns into large differences in output patterns. Several synaptic mechanisms of pattern separation have been proposed, including code expansion, inhibition and plasticity; however, which of these mechanisms play a role in the entorhinal cortex (EC)–dentate gyrus (DG)–CA3 circuit, a classical pattern separation circuit, remains unclear. Here we show that a biologically realistic, full-scale EC–DG–CA3 circuit model, including granule cells (GCs) and parvalbumin-positive inhibitory interneurons (PV+-INs) in the DG, is an efficient pattern separator. Both external gamma-modulated inhibition and internal lateral inhibition mediated by PV+-INs substantially contributed to pattern separation. Both local connectivity and fast signaling at GC–PV+-IN synapses were important for maximum effectiveness. Similarly, mossy fiber synapses with conditional detonator properties contributed to pattern separation. By contrast, perforant path synapses with Hebbian synaptic plasticity and direct EC–CA3 connection shifted the network towards pattern completion. Our results demonstrate that the specific properties of cells and synapses optimize higher-order computations in biological networks and might be useful to improve the deep learning capabilities of technical networks.","lang":"eng"}],"issue":"12","doi":"10.1038/s43588-021-00157-1","title":"How connectivity rules and synaptic properties shape the efficacy of pattern separation in the entorhinal cortex–dentate gyrus–CA3 network","author":[{"orcid":"0000-0003-2209-5242","full_name":"Guzmán, José","last_name":"Guzmán","id":"30CC5506-F248-11E8-B48F-1D18A9856A87","first_name":"José"},{"orcid":"0000-0002-5621-8100","first_name":"Alois","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","last_name":"Schlögl","full_name":"Schlögl, Alois"},{"orcid":"0000-0003-4710-2082","id":"31FFEE2E-F248-11E8-B48F-1D18A9856A87","first_name":"Claudia ","full_name":"Espinoza Martinez, Claudia ","last_name":"Espinoza Martinez"},{"last_name":"Zhang","full_name":"Zhang, Xiaomin","first_name":"Xiaomin","id":"423EC9C2-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Benjamin","id":"4952F31E-F248-11E8-B48F-1D18A9856A87","last_name":"Suter","full_name":"Suter, Benjamin","orcid":"0000-0002-9885-6936"},{"orcid":"0000-0001-5001-4804","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","first_name":"Peter M","full_name":"Jonas, Peter M","last_name":"Jonas"}],"_id":"10816","acknowledgement":"We thank A. Aertsen, N. Kopell, W. Maass, A. Roth, F. Stella and T. Vogels for critically reading earlier versions of the manuscript. We are grateful to F. Marr and C. Altmutter for excellent technical assistance, E. Kralli-Beller for manuscript editing, and the Scientific Service Units of IST Austria for efficient support. Finally, we thank T. Carnevale, L. Erdös, M. Hines, D. Nykamp and D. Schröder for useful discussions, and R. Friedrich and S. Wiechert for sharing unpublished data. This project received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement no. 692692, P.J.) and the Fond zur Förderung der Wissenschaftlichen Forschung (Z 312-B27, Wittgenstein award to P.J. and P 31815 to S.J.G.).","publication_status":"published","status":"public","ec_funded":1,"publication_identifier":{"issn":["2662-8457"]},"project":[{"name":"Biophysics and circuit function of a giant cortical glumatergic synapse","call_identifier":"H2020","_id":"25B7EB9E-B435-11E9-9278-68D0E5697425","grant_number":"692692"},{"_id":"25C5A090-B435-11E9-9278-68D0E5697425","grant_number":"Z00312","call_identifier":"FWF","name":"The Wittgenstein Prize"}],"oa_version":"Submitted Version","citation":{"chicago":"Guzmán, José, Alois Schlögl, Claudia  Espinoza Martinez, Xiaomin Zhang, Benjamin Suter, and Peter M Jonas. “How Connectivity Rules and Synaptic Properties Shape the Efficacy of Pattern Separation in the Entorhinal Cortex–Dentate Gyrus–CA3 Network.” <i>Nature Computational Science</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1038/s43588-021-00157-1\">https://doi.org/10.1038/s43588-021-00157-1</a>.","mla":"Guzmán, José, et al. “How Connectivity Rules and Synaptic Properties Shape the Efficacy of Pattern Separation in the Entorhinal Cortex–Dentate Gyrus–CA3 Network.” <i>Nature Computational Science</i>, vol. 1, no. 12, Springer Nature, 2021, pp. 830–42, doi:<a href=\"https://doi.org/10.1038/s43588-021-00157-1\">10.1038/s43588-021-00157-1</a>.","ieee":"J. Guzmán, A. Schlögl, C. Espinoza Martinez, X. Zhang, B. Suter, and P. M. Jonas, “How connectivity rules and synaptic properties shape the efficacy of pattern separation in the entorhinal cortex–dentate gyrus–CA3 network,” <i>Nature Computational Science</i>, vol. 1, no. 12. Springer Nature, pp. 830–842, 2021.","apa":"Guzmán, J., Schlögl, A., Espinoza Martinez, C., Zhang, X., Suter, B., &#38; Jonas, P. M. (2021). How connectivity rules and synaptic properties shape the efficacy of pattern separation in the entorhinal cortex–dentate gyrus–CA3 network. <i>Nature Computational Science</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s43588-021-00157-1\">https://doi.org/10.1038/s43588-021-00157-1</a>","short":"J. Guzmán, A. Schlögl, C. Espinoza Martinez, X. Zhang, B. Suter, P.M. Jonas, Nature Computational Science 1 (2021) 830–842.","ama":"Guzmán J, Schlögl A, Espinoza Martinez C, Zhang X, Suter B, Jonas PM. How connectivity rules and synaptic properties shape the efficacy of pattern separation in the entorhinal cortex–dentate gyrus–CA3 network. <i>Nature Computational Science</i>. 2021;1(12):830-842. doi:<a href=\"https://doi.org/10.1038/s43588-021-00157-1\">10.1038/s43588-021-00157-1</a>","ista":"Guzmán J, Schlögl A, Espinoza Martinez C, Zhang X, Suter B, Jonas PM. 2021. How connectivity rules and synaptic properties shape the efficacy of pattern separation in the entorhinal cortex–dentate gyrus–CA3 network. Nature Computational Science. 1(12), 830–842."},"day":"16","file_date_updated":"2022-06-18T22:30:03Z","ddc":["610"],"month":"12","has_accepted_license":"1","volume":1,"article_processing_charge":"No","file":[{"date_updated":"2022-06-18T22:30:03Z","access_level":"open_access","content_type":"application/pdf","checksum":"9fec5b667909ef52be96d502e4f8c2ae","embargo":"2022-06-17","file_name":"Guzmanetal2021.pdf","file_size":1699466,"creator":"patrickd","relation":"main_file","file_id":"11430","date_created":"2022-06-02T12:51:07Z"},{"file_id":"11431","date_created":"2022-06-02T12:53:47Z","title":"Supplementary Material","file_name":"Guzmanetal2021Suppl.pdf","relation":"supplementary_material","file_size":3005651,"creator":"patrickd","embargo":"2022-06-17","access_level":"open_access","checksum":"52a005b13a114e3c3a28fa6bbe8b1a8d","content_type":"application/pdf","date_updated":"2022-06-18T22:30:03Z"}],"year":"2021","keyword":["general medicine"],"oa":1,"related_material":{"link":[{"relation":"press_release","url":"https://ista.ac.at/en/news/spot-the-difference/"}],"record":[{"relation":"software","status":"public","id":"10110"}]},"page":"830-842","article_type":"original","publication":"Nature Computational Science","date_updated":"2023-08-10T22:30:10Z","date_published":"2021-12-16T00:00:00Z","date_created":"2022-03-04T08:32:36Z","acknowledged_ssus":[{"_id":"SSU"}],"scopus_import":"1","department":[{"_id":"PeJo"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","language":[{"iso":"eng"}],"quality_controlled":"1","publisher":"Springer Nature","intvolume":"         1","main_file_link":[{"url":"https://www.biorxiv.org/content/10.1101/647800","open_access":"1"}]},{"oa_version":"Preprint","citation":{"mla":"Stahnke, Stephanie, et al. “Loss of Hem1 Disrupts Macrophage Function and Impacts Migration, Phagocytosis, and Integrin-Mediated Adhesion.” <i>Current Biology</i>, vol. 31, no. 10, Elsevier, 2021, p. 2051–2064.e8, doi:<a href=\"https://doi.org/10.1016/j.cub.2021.02.043\">10.1016/j.cub.2021.02.043</a>.","chicago":"Stahnke, Stephanie, Hermann Döring, Charly Kusch, David J.J. de Gorter, Sebastian Dütting, Aleks Guledani, Irina Pleines, et al. “Loss of Hem1 Disrupts Macrophage Function and Impacts Migration, Phagocytosis, and Integrin-Mediated Adhesion.” <i>Current Biology</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.cub.2021.02.043\">https://doi.org/10.1016/j.cub.2021.02.043</a>.","short":"S. Stahnke, H. Döring, C. Kusch, D.J.J. de Gorter, S. Dütting, A. Guledani, I. Pleines, M. Schnoor, M.K. Sixt, R. Geffers, M. Rohde, M. Müsken, F. Kage, A. Steffen, J. Faix, B. Nieswandt, K. Rottner, T.E.B. Stradal, Current Biology 31 (2021) 2051–2064.e8.","ama":"Stahnke S, Döring H, Kusch C, et al. Loss of Hem1 disrupts macrophage function and impacts migration, phagocytosis, and integrin-mediated adhesion. <i>Current Biology</i>. 2021;31(10):2051-2064.e8. doi:<a href=\"https://doi.org/10.1016/j.cub.2021.02.043\">10.1016/j.cub.2021.02.043</a>","ista":"Stahnke S, Döring H, Kusch C, de Gorter DJJ, Dütting S, Guledani A, Pleines I, Schnoor M, Sixt MK, Geffers R, Rohde M, Müsken M, Kage F, Steffen A, Faix J, Nieswandt B, Rottner K, Stradal TEB. 2021. Loss of Hem1 disrupts macrophage function and impacts migration, phagocytosis, and integrin-mediated adhesion. Current Biology. 31(10), 2051–2064.e8.","apa":"Stahnke, S., Döring, H., Kusch, C., de Gorter, D. J. J., Dütting, S., Guledani, A., … Stradal, T. E. B. (2021). Loss of Hem1 disrupts macrophage function and impacts migration, phagocytosis, and integrin-mediated adhesion. <i>Current Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.cub.2021.02.043\">https://doi.org/10.1016/j.cub.2021.02.043</a>","ieee":"S. Stahnke <i>et al.</i>, “Loss of Hem1 disrupts macrophage function and impacts migration, phagocytosis, and integrin-mediated adhesion,” <i>Current Biology</i>, vol. 31, no. 10. Elsevier, p. 2051–2064.e8, 2021."},"day":"24","month":"05","pmid":1,"volume":31,"article_processing_charge":"No","abstract":[{"lang":"eng","text":"Hematopoietic-specific protein 1 (Hem1) is an essential subunit of the WAVE regulatory complex (WRC) in immune cells. WRC is crucial for Arp2/3 complex activation and the protrusion of branched actin filament networks. Moreover, Hem1 loss of function in immune cells causes autoimmune diseases in humans. Here, we show that genetic removal of Hem1 in macrophages diminishes frequency and efficacy of phagocytosis as well as phagocytic cup formation in addition to defects in lamellipodial protrusion and migration. Moreover, Hem1-null macrophages displayed strong defects in cell adhesion despite unaltered podosome formation and concomitant extracellular matrix degradation. Specifically, dynamics of both adhesion and de-adhesion as well as concomitant phosphorylation of paxillin and focal adhesion kinase (FAK) were significantly compromised. Accordingly, disruption of WRC function in non-hematopoietic cells coincided with both defects in adhesion turnover and altered FAK and paxillin phosphorylation. Consistently, platelets exhibited reduced adhesion and diminished integrin αIIbβ3 activation upon WRC removal. Interestingly, adhesion phenotypes, but not lamellipodia formation, were partially rescued by small molecule activation of FAK. A full rescue of the phenotype, including lamellipodia formation, required not only the presence of WRCs but also their binding to and activation by Rac. Collectively, our results uncover that WRC impacts on integrin-dependent processes in a FAK-dependent manner, controlling formation and dismantling of adhesions, relevant for properly grabbing onto extracellular surfaces and particles during cell edge expansion, like in migration or phagocytosis."}],"issue":"10","doi":"10.1016/j.cub.2021.02.043","title":"Loss of Hem1 disrupts macrophage function and impacts migration, phagocytosis, and integrin-mediated adhesion","author":[{"last_name":"Stahnke","full_name":"Stahnke, Stephanie","first_name":"Stephanie"},{"last_name":"Döring","full_name":"Döring, Hermann","first_name":"Hermann"},{"first_name":"Charly","last_name":"Kusch","full_name":"Kusch, Charly"},{"full_name":"de Gorter, David J.J.","last_name":"de Gorter","first_name":"David J.J."},{"first_name":"Sebastian","last_name":"Dütting","full_name":"Dütting, Sebastian"},{"full_name":"Guledani, Aleks","last_name":"Guledani","first_name":"Aleks"},{"last_name":"Pleines","full_name":"Pleines, Irina","first_name":"Irina"},{"first_name":"Michael","full_name":"Schnoor, Michael","last_name":"Schnoor"},{"orcid":"0000-0002-6620-9179","first_name":"Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","last_name":"Sixt","full_name":"Sixt, Michael K"},{"full_name":"Geffers, Robert","last_name":"Geffers","first_name":"Robert"},{"first_name":"Manfred","full_name":"Rohde, Manfred","last_name":"Rohde"},{"first_name":"Mathias","last_name":"Müsken","full_name":"Müsken, Mathias"},{"first_name":"Frieda","full_name":"Kage, Frieda","last_name":"Kage"},{"first_name":"Anika","last_name":"Steffen","full_name":"Steffen, Anika"},{"first_name":"Jan","last_name":"Faix","full_name":"Faix, Jan"},{"last_name":"Nieswandt","full_name":"Nieswandt, Bernhard","first_name":"Bernhard"},{"first_name":"Klemens","last_name":"Rottner","full_name":"Rottner, Klemens"},{"full_name":"Stradal, Theresia E.B.","last_name":"Stradal","first_name":"Theresia E.B."}],"_id":"10834","publication_status":"published","status":"public","acknowledgement":"We are grateful to Silvia Prettin, Ina Schleicher, and Petra Hagendorff for expert technical assistance; David Dettbarn for animal keeping and breeding; and Lothar Gröbe and Maria Höxter for cell sorting. We also thank Werner Tegge for peptides and Giorgio Scita for antibodies. This work was supported, in part, by the Deutsche Forschungsgemeinschaft (DFG), Priority Programm SPP1150 (to T.E.B.S., K.R., and M. Sixt), and by DFG grant GRK2223/1 (to K.R.). T.E.B.S. acknowledges support by the Helmholtz Society through HGF impulse fund W2/W3-066 and M. Schnoor by the Mexican Council for Science and Technology (CONACyT, 284292 ), Fund SEP-Cinvestav ( 108 ), and the Royal Society, UK (Newton Advanced Fellowship, NAF/R1/180017 ).","publication_identifier":{"issn":["0960-9822"]},"external_id":{"pmid":["33711252"],"isi":["000654652200002"]},"date_published":"2021-05-24T00:00:00Z","date_created":"2022-03-08T07:51:04Z","scopus_import":"1","department":[{"_id":"MiSi"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","isi":1,"type":"journal_article","language":[{"iso":"eng"}],"quality_controlled":"1","publisher":"Elsevier","main_file_link":[{"url":"https://doi.org/10.1101/2020.03.24.005835","open_access":"1"}],"intvolume":"        31","year":"2021","keyword":["General Agricultural and Biological Sciences","General Biochemistry","Genetics and Molecular Biology"],"oa":1,"page":"2051-2064.e8","article_type":"original","publication":"Current Biology","date_updated":"2023-08-17T07:01:14Z"},{"oa":1,"year":"2021","keyword":["Immunology","Immunology and Allergy"],"publication":"Allergy","date_updated":"2023-09-05T15:58:53Z","article_type":"letter_note","page":"1553-1556","department":[{"_id":"Bio"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","external_id":{"isi":["000577708800001"],"pmid":["32990982"]},"date_published":"2021-05-01T00:00:00Z","scopus_import":"1","date_created":"2022-03-08T11:19:05Z","intvolume":"        76","publisher":"Wiley","isi":1,"language":[{"iso":"eng"}],"type":"journal_article","quality_controlled":"1","author":[{"first_name":"Christina L.","full_name":"Pranger, Christina L.","last_name":"Pranger"},{"full_name":"Fazekas-Singer, Judit","last_name":"Fazekas-Singer","id":"36432834-F248-11E8-B48F-1D18A9856A87","first_name":"Judit","orcid":"0000-0002-8777-3502"},{"first_name":"Verena K.","last_name":"Köhler","full_name":"Köhler, Verena K."},{"full_name":"Pali‐Schöll, Isabella","last_name":"Pali‐Schöll","first_name":"Isabella"},{"first_name":"Alessandro","full_name":"Fiocchi, Alessandro","last_name":"Fiocchi"},{"full_name":"Karagiannis, Sophia N.","last_name":"Karagiannis","first_name":"Sophia N."},{"last_name":"Zenarruzabeitia","full_name":"Zenarruzabeitia, Olatz","first_name":"Olatz"},{"last_name":"Borrego","full_name":"Borrego, Francisco","first_name":"Francisco"},{"first_name":"Erika","full_name":"Jensen‐Jarolim, Erika","last_name":"Jensen‐Jarolim"}],"title":"PIPE‐cloned human IgE and IgG4 antibodies: New tools for investigating cow's milk allergy and tolerance","_id":"10836","issue":"5","doi":"10.1111/all.14604","publication_identifier":{"eissn":["1398-9995"],"issn":["0105-4538"]},"status":"public","publication_status":"published","acknowledgement":"This  work  was  supported  by  the  Austrian  Science  Fund  (FWF)  grants  MCCA  W1248-B30  and  SFB  F4606-B28  to  EJJ.  CP  received  a  short-term research fellowship of the European Federation of Immunological Societies  (EFIS-IL)  for  a  research  visit  at  Biocruces  Bizkaia  Health  Research  Institute,  Barakaldo,  Spain.  VKK  received  an  EFIS-IL  short-term  research  fellowship  for  a  research  visit  at  King’s  College  London.  The research was funded by the National Institute for Health Research (NIHR) Biomedical Research Centre (BRC) based at Guy's and St Thomas' NHS Foundation Trust and King's College London (IS-BRC-1215-20006) (SNK).  The  authors  acknowledge  support  by  the  Medical  Research  Council (MR/L023091/1) (SNK); Breast Cancer Now (147; KCL-BCN-Q3)(SNK); Cancer Research UK (C30122/A11527; C30122/A15774) (SNK); Cancer  Research  UK  King's  Health  Partners  Centre  at  King's  College  London   (C604/A25135)   (SNK);   CRUK/NIHR   in   England/DoH   for   Scotland,  Wales  and  Northern  Ireland  Experimental  Cancer  Medicine  Centre  (C10355/A15587)  (SNK).  The  views  expressed  are  those  of  the  author(s)  and  not  necessarily  those  of  the  NHS,  the  NIHR  or  the  Department  of  Health.  Additionally,  this  work  was  funded  by  Instituto  de  Salud  Carlos  III  through  the  project  \"PI16/01223\"  (Co-funded  by  European Regional Development Fund; “A way to make Europe”) to FB and  by  the  Department  of  Health,  Basque  Government  through  the  project “2019111031” to OZ. OZ is recipient of a Sara Borrell 2017 post-doctoral contract “CD17/00128” funded by Instituto de Salud Carlos III (Co-funded by European Social Fund; “Investing in your future”).","day":"01","citation":{"apa":"Pranger, C. L., Singer, J., Köhler, V. K., Pali‐Schöll, I., Fiocchi, A., Karagiannis, S. N., … Jensen‐Jarolim, E. (2021). PIPE‐cloned human IgE and IgG4 antibodies: New tools for investigating cow’s milk allergy and tolerance. <i>Allergy</i>. Wiley. <a href=\"https://doi.org/10.1111/all.14604\">https://doi.org/10.1111/all.14604</a>","ieee":"C. L. Pranger <i>et al.</i>, “PIPE‐cloned human IgE and IgG4 antibodies: New tools for investigating cow’s milk allergy and tolerance,” <i>Allergy</i>, vol. 76, no. 5. Wiley, pp. 1553–1556, 2021.","ista":"Pranger CL, Singer J, Köhler VK, Pali‐Schöll I, Fiocchi A, Karagiannis SN, Zenarruzabeitia O, Borrego F, Jensen‐Jarolim E. 2021. PIPE‐cloned human IgE and IgG4 antibodies: New tools for investigating cow’s milk allergy and tolerance. Allergy. 76(5), 1553–1556.","ama":"Pranger CL, Singer J, Köhler VK, et al. PIPE‐cloned human IgE and IgG4 antibodies: New tools for investigating cow’s milk allergy and tolerance. <i>Allergy</i>. 2021;76(5):1553-1556. doi:<a href=\"https://doi.org/10.1111/all.14604\">10.1111/all.14604</a>","short":"C.L. Pranger, J. Singer, V.K. Köhler, I. Pali‐Schöll, A. Fiocchi, S.N. Karagiannis, O. Zenarruzabeitia, F. Borrego, E. Jensen‐Jarolim, Allergy 76 (2021) 1553–1556.","chicago":"Pranger, Christina L., Judit Singer, Verena K. Köhler, Isabella Pali‐Schöll, Alessandro Fiocchi, Sophia N. Karagiannis, Olatz Zenarruzabeitia, Francisco Borrego, and Erika Jensen‐Jarolim. “PIPE‐cloned Human IgE and IgG4 Antibodies: New Tools for Investigating Cow’s Milk Allergy and Tolerance.” <i>Allergy</i>. Wiley, 2021. <a href=\"https://doi.org/10.1111/all.14604\">https://doi.org/10.1111/all.14604</a>.","mla":"Pranger, Christina L., et al. “PIPE‐cloned Human IgE and IgG4 Antibodies: New Tools for Investigating Cow’s Milk Allergy and Tolerance.” <i>Allergy</i>, vol. 76, no. 5, Wiley, 2021, pp. 1553–56, doi:<a href=\"https://doi.org/10.1111/all.14604\">10.1111/all.14604</a>."},"month":"05","pmid":1,"ddc":["570"],"file_date_updated":"2022-03-08T11:23:16Z","oa_version":"Published Version","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"file_id":"10837","date_created":"2022-03-08T11:23:16Z","success":1,"date_updated":"2022-03-08T11:23:16Z","access_level":"open_access","checksum":"9526f9554112fc027c9f7fa540c488cd","content_type":"application/pdf","file_name":"2021_Allergy_Pranger.pdf","relation":"main_file","creator":"dernst","file_size":626081}],"has_accepted_license":"1","volume":76,"article_processing_charge":"No"},{"year":"2021","keyword":["Genetics","Ecology","Evolution","Behavior and Systematics"],"oa":1,"article_type":"original","page":"3797-3814","publication":"Molecular Ecology","date_updated":"2023-09-05T16:02:19Z","date_published":"2021-08-01T00:00:00Z","external_id":{"isi":["000669439700001"],"pmid":["33638231"]},"scopus_import":"1","date_created":"2022-03-08T11:28:32Z","department":[{"_id":"BeVi"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","isi":1,"language":[{"iso":"eng"}],"type":"journal_article","quality_controlled":"1","intvolume":"        30","publisher":"Wiley","issue":"15","abstract":[{"text":"Combining hybrid zone analysis with genomic data is a promising approach to understanding the genomic basis of adaptive divergence. It allows for the identification of genomic regions underlying barriers to gene flow. It also provides insights into spatial patterns of allele frequency change, informing about the interplay between environmental factors, dispersal and selection. However, when only a single hybrid zone is analysed, it is difficult to separate patterns generated by selection from those resulting from chance. Therefore, it is beneficial to look for repeatable patterns across replicate hybrid zones in the same system. We applied this approach to the marine snail Littorina saxatilis, which contains two ecotypes, adapted to wave-exposed rocks vs. high-predation boulder fields. The existence of numerous hybrid zones between ecotypes offered the opportunity to test for the repeatability of genomic architectures and spatial patterns of divergence. We sampled and phenotyped snails from seven replicate hybrid zones on the Swedish west coast and genotyped them for thousands of single nucleotide polymorphisms. Shell shape and size showed parallel clines across all zones. Many genomic regions showing steep clines and/or high differentiation were shared among hybrid zones, consistent with a common evolutionary history and extensive gene flow between zones, and supporting the importance of these regions for divergence. In particular, we found that several large putative inversions contribute to divergence in all locations. Additionally, we found evidence for consistent displacement of clines from the boulder–rock transition. Our results demonstrate patterns of spatial variation that would not be accessible without continuous spatial sampling, a large genomic data set and replicate hybrid zones.","lang":"eng"}],"doi":"10.1111/mec.15861","author":[{"orcid":"0000-0003-1050-4969","first_name":"Anja M","id":"3C147470-F248-11E8-B48F-1D18A9856A87","last_name":"Westram","full_name":"Westram, Anja M"},{"full_name":"Faria, Rui","last_name":"Faria","first_name":"Rui"},{"last_name":"Johannesson","full_name":"Johannesson, Kerstin","first_name":"Kerstin"},{"first_name":"Roger","full_name":"Butlin, Roger","last_name":"Butlin"}],"title":"Using replicate hybrid zones to understand the genomic basis of adaptive divergence","_id":"10838","publication_status":"published","acknowledgement":"We thank everyone who helped with fieldwork, snail processing and DNA extractions, particularly Laura Brettell, Mårten Duvetorp, Juan Galindo, Anne-Lise Liabot, Mark Ravinet, Irena Senčić and Zuzanna Zagrodzka. We are also grateful to Edinburgh Genomics for library preparation and sequencing, to Stuart Baird and Mark Ravinet for helpful discussions, and to three anonymous reviewers for their constructive comments. This work was supported by the Natural Environment Research Council (NE/K014021/1), the European Research Council (AdG-693030-BARRIERS), Swedish Research Councils Formas and Vetenskapsrådet through a Linnaeus grant to the Centre for Marine Evolutionary Biology (217-2008-1719), the European Regional Development Fund (POCI-01-0145-FEDER-030628), and the Fundação para a iência e a Tecnologia,\r\nPortugal (PTDC/BIA-EVL/\r\n30628/2017). A.M.W. and R.F. were\r\nfunded by the European Union’s Horizon 2020 research and innovation\r\nprogramme under Marie Skłodowska-Curie\r\ngrant agreements\r\nno. 754411/797747 and no. 706376, respectively.","status":"public","publication_identifier":{"eissn":["1365-294X"],"issn":["0962-1083"]},"oa_version":"Published Version","day":"01","citation":{"ista":"Westram AM, Faria R, Johannesson K, Butlin R. 2021. Using replicate hybrid zones to understand the genomic basis of adaptive divergence. Molecular Ecology. 30(15), 3797–3814.","ama":"Westram AM, Faria R, Johannesson K, Butlin R. Using replicate hybrid zones to understand the genomic basis of adaptive divergence. <i>Molecular Ecology</i>. 2021;30(15):3797-3814. doi:<a href=\"https://doi.org/10.1111/mec.15861\">10.1111/mec.15861</a>","short":"A.M. Westram, R. Faria, K. Johannesson, R. Butlin, Molecular Ecology 30 (2021) 3797–3814.","apa":"Westram, A. M., Faria, R., Johannesson, K., &#38; Butlin, R. (2021). Using replicate hybrid zones to understand the genomic basis of adaptive divergence. <i>Molecular Ecology</i>. Wiley. <a href=\"https://doi.org/10.1111/mec.15861\">https://doi.org/10.1111/mec.15861</a>","ieee":"A. M. Westram, R. Faria, K. Johannesson, and R. Butlin, “Using replicate hybrid zones to understand the genomic basis of adaptive divergence,” <i>Molecular Ecology</i>, vol. 30, no. 15. Wiley, pp. 3797–3814, 2021.","chicago":"Westram, Anja M, Rui Faria, Kerstin Johannesson, and Roger Butlin. “Using Replicate Hybrid Zones to Understand the Genomic Basis of Adaptive Divergence.” <i>Molecular Ecology</i>. Wiley, 2021. <a href=\"https://doi.org/10.1111/mec.15861\">https://doi.org/10.1111/mec.15861</a>.","mla":"Westram, Anja M., et al. “Using Replicate Hybrid Zones to Understand the Genomic Basis of Adaptive Divergence.” <i>Molecular Ecology</i>, vol. 30, no. 15, Wiley, 2021, pp. 3797–814, doi:<a href=\"https://doi.org/10.1111/mec.15861\">10.1111/mec.15861</a>."},"month":"08","file_date_updated":"2022-03-08T11:31:30Z","ddc":["570"],"pmid":1,"has_accepted_license":"1","article_processing_charge":"No","volume":30,"file":[{"file_name":"2021_MolecularEcology_Westram.pdf","creator":"dernst","relation":"main_file","file_size":1726548,"success":1,"date_updated":"2022-03-08T11:31:30Z","access_level":"open_access","checksum":"d5611f243ceb63a0e091d6662ebd9cda","content_type":"application/pdf","file_id":"10839","date_created":"2022-03-08T11:31:30Z"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"}},{"project":[{"call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"publication_identifier":{"issn":["1045-0823"],"isbn":["9780999241196"]},"ec_funded":1,"publication_status":"published","status":"public","acknowledgement":"This research was supported by the Czech Science Foundation (no. 19-24384Y), by the OP VVV MEYS funded project CZ.02.1.01/0.0/0.0/16 019/0000765 “Research Center for Informatics”, by the ERC CoG 863818 (ForM-SMArt), and by the Combat Capabilities Development Command Army Research Laboratory and was accomplished under Cooperative\r\nAgreement Number W911NF-13-2-0045 (ARL Cyber Security CRA). The views and conclusions contained in this document are those of the authors and should not be interpreted as\r\nrepresenting the official policies, either expressed or implied, of the Combat Capabilities Development Command Army Research Laboratory or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes not withstanding any copyright notation here on. ","_id":"10847","author":[{"first_name":"Petr","full_name":"Tomášek, Petr","last_name":"Tomášek"},{"last_name":"Horák","full_name":"Horák, Karel","first_name":"Karel"},{"first_name":"Aditya","last_name":"Aradhye","full_name":"Aradhye, Aditya"},{"full_name":"Bošanský, Branislav","last_name":"Bošanský","first_name":"Branislav"},{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"}],"title":"Solving partially observable stochastic shortest-path games","doi":"10.24963/ijcai.2021/575","abstract":[{"text":"We study the two-player zero-sum extension of the partially observable stochastic shortest-path problem where one agent has only partial information about the environment. We formulate this problem as a partially observable stochastic game (POSG): given a set of target states and negative rewards for each transition, the player with imperfect information maximizes the expected undiscounted total reward until a target state is reached. The second player with the perfect information aims for the opposite. We base our formalism on POSGs with one-sided observability (OS-POSGs) and give the following contributions: (1) we introduce a novel heuristic search value iteration algorithm that iteratively solves depth-limited variants of the game, (2) we derive the bound on the depth guaranteeing an arbitrary precision, (3) we propose a novel upper-bound estimation that allows early terminations, and (4) we experimentally evaluate the algorithm on a pursuit-evasion game.","lang":"eng"}],"article_processing_charge":"No","month":"09","day":"01","citation":{"apa":"Tomášek, P., Horák, K., Aradhye, A., Bošanský, B., &#38; Chatterjee, K. (2021). Solving partially observable stochastic shortest-path games. In <i>30th International Joint Conference on Artificial Intelligence</i> (pp. 4182–4189). Virtual, Online: International Joint Conferences on Artificial Intelligence. <a href=\"https://doi.org/10.24963/ijcai.2021/575\">https://doi.org/10.24963/ijcai.2021/575</a>","ieee":"P. Tomášek, K. Horák, A. Aradhye, B. Bošanský, and K. Chatterjee, “Solving partially observable stochastic shortest-path games,” in <i>30th International Joint Conference on Artificial Intelligence</i>, Virtual, Online, 2021, pp. 4182–4189.","ama":"Tomášek P, Horák K, Aradhye A, Bošanský B, Chatterjee K. Solving partially observable stochastic shortest-path games. In: <i>30th International Joint Conference on Artificial Intelligence</i>. International Joint Conferences on Artificial Intelligence; 2021:4182-4189. doi:<a href=\"https://doi.org/10.24963/ijcai.2021/575\">10.24963/ijcai.2021/575</a>","short":"P. Tomášek, K. Horák, A. Aradhye, B. Bošanský, K. Chatterjee, in:, 30th International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence, 2021, pp. 4182–4189.","ista":"Tomášek P, Horák K, Aradhye A, Bošanský B, Chatterjee K. 2021. Solving partially observable stochastic shortest-path games. 30th International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conferences on Artificial Intelligence Organization, 4182–4189.","chicago":"Tomášek, Petr, Karel Horák, Aditya Aradhye, Branislav Bošanský, and Krishnendu Chatterjee. “Solving Partially Observable Stochastic Shortest-Path Games.” In <i>30th International Joint Conference on Artificial Intelligence</i>, 4182–89. International Joint Conferences on Artificial Intelligence, 2021. <a href=\"https://doi.org/10.24963/ijcai.2021/575\">https://doi.org/10.24963/ijcai.2021/575</a>.","mla":"Tomášek, Petr, et al. “Solving Partially Observable Stochastic Shortest-Path Games.” <i>30th International Joint Conference on Artificial Intelligence</i>, International Joint Conferences on Artificial Intelligence, 2021, pp. 4182–89, doi:<a href=\"https://doi.org/10.24963/ijcai.2021/575\">10.24963/ijcai.2021/575</a>."},"conference":{"start_date":"2021-08-19","location":"Virtual, Online","end_date":"2021-08-27","name":"IJCAI: International Joint Conferences on Artificial Intelligence Organization"},"oa_version":"Published Version","date_updated":"2025-07-14T09:10:13Z","publication":"30th International Joint Conference on Artificial Intelligence","page":"4182-4189","oa":1,"year":"2021","main_file_link":[{"open_access":"1","url":"https://doi.org/10.24963/ijcai.2021/575"}],"publisher":"International Joint Conferences on Artificial Intelligence","quality_controlled":"1","language":[{"iso":"eng"}],"type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrCh"}],"scopus_import":"1","date_created":"2022-03-13T23:01:47Z","date_published":"2021-09-01T00:00:00Z"},{"article_processing_charge":"No","volume":33,"arxiv":1,"oa_version":"Preprint","month":"02","citation":{"ieee":"R. Seiringer, “The polaron at strong coupling,” <i>Reviews in Mathematical Physics</i>, vol. 33, no. 01. World Scientific Publishing, 2021.","apa":"Seiringer, R. (2021). The polaron at strong coupling. <i>Reviews in Mathematical Physics</i>. World Scientific Publishing. <a href=\"https://doi.org/10.1142/s0129055x20600120\">https://doi.org/10.1142/s0129055x20600120</a>","ista":"Seiringer R. 2021. The polaron at strong coupling. Reviews in Mathematical Physics. 33(01), 2060012.","ama":"Seiringer R. The polaron at strong coupling. <i>Reviews in Mathematical Physics</i>. 2021;33(01). doi:<a href=\"https://doi.org/10.1142/s0129055x20600120\">10.1142/s0129055x20600120</a>","short":"R. Seiringer, Reviews in Mathematical Physics 33 (2021).","mla":"Seiringer, Robert. “The Polaron at Strong Coupling.” <i>Reviews in Mathematical Physics</i>, vol. 33, no. 01, 2060012, World Scientific Publishing, 2021, doi:<a href=\"https://doi.org/10.1142/s0129055x20600120\">10.1142/s0129055x20600120</a>.","chicago":"Seiringer, Robert. “The Polaron at Strong Coupling.” <i>Reviews in Mathematical Physics</i>. World Scientific Publishing, 2021. <a href=\"https://doi.org/10.1142/s0129055x20600120\">https://doi.org/10.1142/s0129055x20600120</a>."},"day":"01","ec_funded":1,"publication_status":"published","status":"public","acknowledgement":"This work was supported by the European Research Council (ERC) under the Euro-pean Union’s Horizon 2020 research and innovation programme (grant agreementNo. 694227).","project":[{"grant_number":"694227","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","name":"Analysis of quantum many-body systems","call_identifier":"H2020"}],"publication_identifier":{"eissn":["1793-6659"],"issn":["0129-055X"]},"doi":"10.1142/s0129055x20600120","abstract":[{"text":" We review old and new results on the Fröhlich polaron model. The discussion includes the validity of the (classical) Pekar approximation in the strong coupling limit, quantum corrections to this limit, as well as the divergence of the effective polaron mass.","lang":"eng"}],"issue":"01","_id":"10852","title":"The polaron at strong coupling","author":[{"orcid":"0000-0002-6781-0521","first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","full_name":"Seiringer, Robert"}],"quality_controlled":"1","language":[{"iso":"eng"}],"type":"journal_article","isi":1,"publisher":"World Scientific Publishing","intvolume":"        33","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1912.12509"}],"date_created":"2022-03-18T08:11:34Z","scopus_import":"1","date_published":"2021-02-01T00:00:00Z","external_id":{"arxiv":["1912.12509"],"isi":["000613313200013"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","department":[{"_id":"RoSe"}],"article_number":"2060012","article_type":"original","date_updated":"2023-09-05T16:08:02Z","publication":"Reviews in Mathematical Physics","keyword":["Mathematical Physics","Statistical and Nonlinear Physics"],"year":"2021","oa":1},{"month":"07","day":"01","citation":{"mla":"Fedorov, Alexander, et al. “A Scalable Concurrent Algorithm for Dynamic Connectivity.” <i>Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures</i>, Association for Computing Machinery, 2021, pp. 208–20, doi:<a href=\"https://doi.org/10.1145/3409964.3461810\">10.1145/3409964.3461810</a>.","chicago":"Fedorov, Alexander, Nikita Koval, and Dan-Adrian Alistarh. “A Scalable Concurrent Algorithm for Dynamic Connectivity.” In <i>Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures</i>, 208–20. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3409964.3461810\">https://doi.org/10.1145/3409964.3461810</a>.","apa":"Fedorov, A., Koval, N., &#38; Alistarh, D.-A. (2021). A scalable concurrent algorithm for dynamic connectivity. In <i>Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures</i> (pp. 208–220). Virtual, Online: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3409964.3461810\">https://doi.org/10.1145/3409964.3461810</a>","ieee":"A. Fedorov, N. Koval, and D.-A. Alistarh, “A scalable concurrent algorithm for dynamic connectivity,” in <i>Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures</i>, Virtual, Online, 2021, pp. 208–220.","ista":"Fedorov A, Koval N, Alistarh D-A. 2021. A scalable concurrent algorithm for dynamic connectivity. Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures. SPAA: Symposium on Parallelism in Algorithms and Architectures, 208–220.","ama":"Fedorov A, Koval N, Alistarh D-A. A scalable concurrent algorithm for dynamic connectivity. In: <i>Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures</i>. Association for Computing Machinery; 2021:208-220. doi:<a href=\"https://doi.org/10.1145/3409964.3461810\">10.1145/3409964.3461810</a>","short":"A. Fedorov, N. Koval, D.-A. Alistarh, in:, Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2021, pp. 208–220."},"conference":{"name":"SPAA: Symposium on Parallelism in Algorithms and Architectures","location":"Virtual, Online","start_date":"2021-07-06","end_date":"2021-07-08"},"oa_version":"Preprint","arxiv":1,"article_processing_charge":"No","_id":"10853","author":[{"last_name":"Fedorov","full_name":"Fedorov, Alexander","first_name":"Alexander"},{"first_name":"Nikita","full_name":"Koval, Nikita","last_name":"Koval"},{"first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X"}],"title":"A scalable concurrent algorithm for dynamic connectivity","doi":"10.1145/3409964.3461810","abstract":[{"lang":"eng","text":"Dynamic Connectivity is a fundamental algorithmic graph problem, motivated by a wide range of applications to social and communication networks and used as a building block in various other algorithms, such as the bi-connectivity and the dynamic minimal spanning tree problems. In brief, we wish to maintain the connected components of the graph under dynamic edge insertions and deletions. In the sequential case, the problem has been well-studied from both theoretical and practical perspectives. However, much less is known about efficient concurrent solutions to this problem. This is the gap we address in this paper. We start from one of the classic data structures used to solve this problem, the Euler Tour Tree. Our first contribution is a non-blocking single-writer implementation of it. We leverage this data structure to obtain the first truly concurrent generalization of dynamic connectivity, which preserves the time complexity of its sequential counterpart, but is also scalable in practice. To achieve this, we rely on three main techniques. The first is to ensure that connectivity queries, which usually dominate real-world workloads, are non-blocking. The second non-trivial technique expands the above idea by making all queries that do not change the connectivity structure non-blocking. The third ingredient is applying fine-grained locking for updating the connected components, which allows operations on disjoint components to occur in parallel. We evaluate the resulting algorithm on various workloads, executing on both real and synthetic graphs. The results show the efficiency of each of the proposed optimizations; the most efficient variant improves the performance of a coarse-grained based implementation on realistic scenarios up to 6x on average and up to 30x when connectivity queries dominate."}],"publication_identifier":{"isbn":["9781450380706"]},"publication_status":"published","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"DaAl"}],"scopus_import":"1","date_created":"2022-03-18T08:21:47Z","date_published":"2021-07-01T00:00:00Z","external_id":{"arxiv":["2105.08098"]},"main_file_link":[{"url":"https://arxiv.org/abs/2105.08098","open_access":"1"}],"publisher":"Association for Computing Machinery","type":"conference","quality_controlled":"1","language":[{"iso":"eng"}],"oa":1,"year":"2021","date_updated":"2022-03-18T08:45:46Z","publication":"Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures","page":"208-220"}]