[{"department":[{"_id":"KrCh"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","external_id":{"arxiv":["2110.01279"]},"publication_status":"published","status":"public","has_accepted_license":"1","alternative_title":["LIPIcs"],"day":"29","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-9597-7215-0"]},"file_date_updated":"2022-01-17T10:49:03Z","file":[{"relation":"main_file","date_updated":"2022-01-17T10:49:03Z","file_id":"10634","success":1,"access_level":"open_access","content_type":"application/pdf","checksum":"d5a82ba893c3bc5da5914edbb3efb92b","file_name":"2021_LIPIcs_Arrighi.pdf","creator":"cchlebak","date_created":"2022-01-17T10:49:03Z","file_size":844224}],"ec_funded":1,"author":[{"last_name":"Arrighi","first_name":"Emmanuel","full_name":"Arrighi, Emmanuel"},{"first_name":"Henning","full_name":"Fernau, Henning","last_name":"Fernau"},{"first_name":"Stefan","full_name":"Hoffmann, Stefan","last_name":"Hoffmann"},{"last_name":"Holzer","first_name":"Markus","full_name":"Holzer, Markus"},{"first_name":"Ismael R","full_name":"Jecker, Ismael R","last_name":"Jecker","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425"},{"full_name":"De Oliveira Oliveira, Mateus","first_name":"Mateus","last_name":"De Oliveira Oliveira"},{"first_name":"Petra","full_name":"Wolf, Petra","last_name":"Wolf"}],"title":"On the complexity of intersection non-emptiness for star-free language classes","article_number":"34","date_created":"2022-01-16T23:01:29Z","project":[{"name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"date_published":"2021-11-29T00:00:00Z","volume":213,"publication":"41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science","year":"2021","scopus_import":"1","intvolume":"       213","ddc":["000"],"acknowledgement":"We like to thank Lukas Fleischer and Michael Wehar for our discussions. This work started at the Schloss Dagstuhl Event 20483 Moderne Aspekte der Komplexitätstheorie in der Automatentheorie https://www.dagstuhl.de/20483.\r\n","doi":"10.4230/LIPIcs.FSTTCS.2021.34","date_updated":"2025-05-14T10:53:59Z","language":[{"iso":"eng"}],"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"corr_author":"1","oa_version":"Published Version","quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","month":"11","citation":{"mla":"Arrighi, Emmanuel, et al. “On the Complexity of Intersection Non-Emptiness for Star-Free Language Classes.” <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, vol. 213, 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34\">10.4230/LIPIcs.FSTTCS.2021.34</a>.","ieee":"E. Arrighi <i>et al.</i>, “On the complexity of intersection non-emptiness for star-free language classes,” in <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, Virtual, 2021, vol. 213.","ista":"Arrighi E, Fernau H, Hoffmann S, Holzer M, Jecker IR, De Oliveira Oliveira M, Wolf P. 2021. On the complexity of intersection non-emptiness for star-free language classes. 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 213, 34.","chicago":"Arrighi, Emmanuel, Henning Fernau, Stefan Hoffmann, Markus Holzer, Ismael R Jecker, Mateus De Oliveira Oliveira, and Petra Wolf. “On the Complexity of Intersection Non-Emptiness for Star-Free Language Classes.” In <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, Vol. 213. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34\">https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34</a>.","ama":"Arrighi E, Fernau H, Hoffmann S, et al. On the complexity of intersection non-emptiness for star-free language classes. In: <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>. Vol 213. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34\">10.4230/LIPIcs.FSTTCS.2021.34</a>","short":"E. Arrighi, H. Fernau, S. Hoffmann, M. Holzer, I.R. Jecker, M. De Oliveira Oliveira, P. Wolf, in:, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.","apa":"Arrighi, E., Fernau, H., Hoffmann, S., Holzer, M., Jecker, I. R., De Oliveira Oliveira, M., &#38; Wolf, P. (2021). On the complexity of intersection non-emptiness for star-free language classes. In <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i> (Vol. 213). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34\">https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34</a>"},"type":"conference","oa":1,"conference":{"end_date":"2021-12-17","name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science","start_date":"2021-12-15","location":"Virtual"},"abstract":[{"lang":"eng","text":"In the Intersection Non-emptiness problem, we are given a list of finite automata A_1, A_2,… , A_m over a common alphabet Σ as input, and the goal is to determine whether some string w ∈ Σ^* lies in the intersection of the languages accepted by the automata in the list. We analyze the complexity of the Intersection Non-emptiness problem under the promise that all input automata accept a language in some level of the dot-depth hierarchy, or some level of the Straubing-Thérien hierarchy. Automata accepting languages from the lowest levels of these hierarchies arise naturally in the context of model checking. We identify a dichotomy in the dot-depth hierarchy by showing that the problem is already NP-complete when all input automata accept languages of the levels B_0 or B_{1/2} and already PSPACE-hard when all automata accept a language from the level B_1. Conversely, we identify a tetrachotomy in the Straubing-Thérien hierarchy. More precisely, we show that the problem is in AC^0 when restricted to level L_0; complete for L or NL, depending on the input representation, when restricted to languages in the level L_{1/2}; NP-complete when the input is given as DFAs accepting a language in L_1 or L_{3/2}; and finally, PSPACE-complete when the input automata accept languages in level L_2 or higher. Moreover, we show that the proof technique used to show containment in NP for DFAs accepting languages in L_1 or L_{3/2} does not generalize to the context of NFAs. To prove this, we identify a family of languages that provide an exponential separation between the state complexity of general NFAs and that of partially ordered NFAs. To the best of our knowledge, this is the first superpolynomial separation between these two models of computation."}],"_id":"10630","license":"https://creativecommons.org/licenses/by/4.0/","arxiv":1},{"date_updated":"2025-03-31T16:00:55Z","language":[{"iso":"eng"}],"quality_controlled":"1","publisher":"American Physical Society","corr_author":"1","oa_version":"Preprint","oa":1,"type":"journal_article","citation":{"mla":"Cherepanov, Igor, et al. “Excited Rotational States of Molecules in a Superfluid.” <i>Physical Review A</i>, vol. 104, no. 6, L061303, American Physical Society, 2021, doi:<a href=\"https://doi.org/10.1103/PhysRevA.104.L061303\">10.1103/PhysRevA.104.L061303</a>.","ieee":"I. Cherepanov <i>et al.</i>, “Excited rotational states of molecules in a superfluid,” <i>Physical Review A</i>, vol. 104, no. 6. American Physical Society, 2021.","ama":"Cherepanov I, Bighin G, Schouder CA, et al. Excited rotational states of molecules in a superfluid. <i>Physical Review A</i>. 2021;104(6). doi:<a href=\"https://doi.org/10.1103/PhysRevA.104.L061303\">10.1103/PhysRevA.104.L061303</a>","ista":"Cherepanov I, Bighin G, Schouder CA, Chatterley AS, Albrechtsen SH, Muñoz AV, Christiansen L, Stapelfeldt H, Lemeshko M. 2021. Excited rotational states of molecules in a superfluid. Physical Review A. 104(6), L061303.","chicago":"Cherepanov, Igor, Giacomo Bighin, Constant A. Schouder, Adam S. Chatterley, Simon H. Albrechtsen, Alberto Viñas Muñoz, Lars Christiansen, Henrik Stapelfeldt, and Mikhail Lemeshko. “Excited Rotational States of Molecules in a Superfluid.” <i>Physical Review A</i>. American Physical Society, 2021. <a href=\"https://doi.org/10.1103/PhysRevA.104.L061303\">https://doi.org/10.1103/PhysRevA.104.L061303</a>.","apa":"Cherepanov, I., Bighin, G., Schouder, C. A., Chatterley, A. S., Albrechtsen, S. H., Muñoz, A. V., … Lemeshko, M. (2021). Excited rotational states of molecules in a superfluid. <i>Physical Review A</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevA.104.L061303\">https://doi.org/10.1103/PhysRevA.104.L061303</a>","short":"I. Cherepanov, G. Bighin, C.A. Schouder, A.S. Chatterley, S.H. Albrechtsen, A.V. Muñoz, L. Christiansen, H. Stapelfeldt, M. Lemeshko, Physical Review A 104 (2021)."},"month":"12","_id":"10631","abstract":[{"text":"We combine experimental and theoretical approaches to explore excited rotational states of molecules embedded in helium nanodroplets using CS2 and I2 as examples. Laser-induced nonadiabatic molecular alignment is employed to measure spectral lines for rotational states extending beyond those initially populated at the 0.37 K droplet temperature. We construct a simple quantum-mechanical model, based on a linear rotor coupled to a single-mode bosonic bath, to determine the rotational energy structure in its entirety. The calculated and measured spectral lines are in good agreement. We show that the effect of the surrounding superfluid on molecular rotation can be rationalized by a single quantity, the angular momentum, transferred from the molecule to the droplet.","lang":"eng"}],"arxiv":1,"external_id":{"isi":["000739618300001"],"arxiv":["2107.00468"]},"publication_status":"published","department":[{"_id":"MiLe"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","article_processing_charge":"No","day":"30","publication_identifier":{"issn":["2469-9926"],"eissn":["2469-9934"]},"main_file_link":[{"open_access":"1","url":"http://128.84.4.18/abs/2107.00468"}],"status":"public","isi":1,"ec_funded":1,"title":"Excited rotational states of molecules in a superfluid","author":[{"full_name":"Cherepanov, Igor","first_name":"Igor","id":"339C7E5A-F248-11E8-B48F-1D18A9856A87","last_name":"Cherepanov"},{"orcid":"0000-0001-8823-9777","last_name":"Bighin","id":"4CA96FD4-F248-11E8-B48F-1D18A9856A87","full_name":"Bighin, Giacomo","first_name":"Giacomo"},{"first_name":"Constant A.","full_name":"Schouder, Constant A.","last_name":"Schouder"},{"first_name":"Adam S.","full_name":"Chatterley, Adam S.","last_name":"Chatterley"},{"full_name":"Albrechtsen, Simon H.","first_name":"Simon H.","last_name":"Albrechtsen"},{"last_name":"Muñoz","first_name":"Alberto Viñas","full_name":"Muñoz, Alberto Viñas"},{"last_name":"Christiansen","first_name":"Lars","full_name":"Christiansen, Lars"},{"last_name":"Stapelfeldt","first_name":"Henrik","full_name":"Stapelfeldt, Henrik"},{"id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","last_name":"Lemeshko","orcid":"0000-0002-6990-7802","first_name":"Mikhail","full_name":"Lemeshko, Mikhail"}],"date_created":"2022-01-16T23:01:29Z","article_number":"L061303","issue":"6","date_published":"2021-12-30T00:00:00Z","article_type":"original","project":[{"_id":"26031614-B435-11E9-9278-68D0E5697425","grant_number":"P29902","name":"Quantum rotations in the presence of a many-body environment","call_identifier":"FWF"},{"call_identifier":"H2020","name":"Angulon: physics and applications of a new quasiparticle","_id":"2688CF98-B435-11E9-9278-68D0E5697425","grant_number":"801770"},{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","call_identifier":"H2020","name":"International IST Doctoral Program"},{"call_identifier":"FWF","name":"A path-integral approach to composite impurities","_id":"26986C82-B435-11E9-9278-68D0E5697425","grant_number":"M02641"}],"publication":"Physical Review A","year":"2021","scopus_import":"1","volume":104,"acknowledgement":"I.C. acknowledges the support by the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie Grant Agreement No. 665385. G.B. acknowledges support from the Austrian Science Fund (FWF), under project No. M2461-N27. M.L. acknowledges support by the Austrian Science Fund (FWF), under project No. P29902-N27, and by the European Research Council (ERC) Starting Grant No. 801770 (ANGULON). H.S acknowledges support from the European Research Council-AdG (Project No. 320459, DropletControl) and from The Villum Foundation through a Villum Investigator grant no. 25886.","doi":"10.1103/PhysRevA.104.L061303","intvolume":"       104"},{"oa":1,"citation":{"short":"M. Nardin, J.W. Phillips, W.F. Podlaski, S.W. Keemink, Peer Community Journal 1 (2021).","apa":"Nardin, M., Phillips, J. W., Podlaski, W. F., &#38; Keemink, S. W. (2021). Nonlinear computations in spiking neural networks through multiplicative synapses. <i>Peer Community Journal</i>. Peer Community In. <a href=\"https://doi.org/10.24072/pcjournal.69\">https://doi.org/10.24072/pcjournal.69</a>","ama":"Nardin M, Phillips JW, Podlaski WF, Keemink SW. Nonlinear computations in spiking neural networks through multiplicative synapses. <i>Peer Community Journal</i>. 2021;1. doi:<a href=\"https://doi.org/10.24072/pcjournal.69\">10.24072/pcjournal.69</a>","chicago":"Nardin, Michele, James W. Phillips, William F. Podlaski, and Sander W. Keemink. “Nonlinear Computations in Spiking Neural Networks through Multiplicative Synapses.” <i>Peer Community Journal</i>. Peer Community In, 2021. <a href=\"https://doi.org/10.24072/pcjournal.69\">https://doi.org/10.24072/pcjournal.69</a>.","ista":"Nardin M, Phillips JW, Podlaski WF, Keemink SW. 2021. Nonlinear computations in spiking neural networks through multiplicative synapses. Peer Community Journal. 1, e68.","ieee":"M. Nardin, J. W. Phillips, W. F. Podlaski, and S. W. Keemink, “Nonlinear computations in spiking neural networks through multiplicative synapses,” <i>Peer Community Journal</i>, vol. 1. Peer Community In, 2021.","mla":"Nardin, Michele, et al. “Nonlinear Computations in Spiking Neural Networks through Multiplicative Synapses.” <i>Peer Community Journal</i>, vol. 1, e68, Peer Community In, 2021, doi:<a href=\"https://doi.org/10.24072/pcjournal.69\">10.24072/pcjournal.69</a>."},"month":"12","type":"journal_article","_id":"10635","abstract":[{"lang":"eng","text":"The brain efficiently performs nonlinear computations through its intricate networks of spiking neurons, but how this is done remains elusive. While nonlinear computations can be implemented successfully in spiking neural networks, this requires supervised training and the resulting connectivity can be hard to interpret. In contrast, the required connectivity for any computation in the form of a linear dynamical system can be directly derived and understood with the spike coding network (SCN) framework. These networks also have biologically realistic activity patterns and are highly robust to cell death. Here we extend the SCN framework to directly implement any polynomial dynamical system, without the need for training. This results in networks requiring a mix of synapse types (fast, slow, and multiplicative), which we term multiplicative spike coding networks (mSCNs). Using mSCNs, we demonstrate how to directly derive the required connectivity for several nonlinear dynamical systems. We also show how to carry out higher-order polynomials with coupled networks that use only pair-wise multiplicative synapses, and provide expected numbers of connections for each synapse type. Overall, our work demonstrates a novel method for implementing nonlinear computations in spiking neural networks, while keeping the attractive features of standard SCNs (robustness, realistic activity patterns, and interpretable connectivity). Finally, we discuss the biological plausibility of our approach, and how the high accuracy and robustness of the approach may be of interest for neuromorphic computing."}],"arxiv":1,"date_updated":"2025-05-14T11:23:19Z","language":[{"iso":"eng"}],"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"quality_controlled":"1","publisher":"Peer Community In","corr_author":"1","oa_version":"Published Version","ec_funded":1,"title":"Nonlinear computations in spiking neural networks through multiplicative synapses","date_created":"2022-01-17T11:12:40Z","article_number":"e68","author":[{"first_name":"Michele","full_name":"Nardin, Michele","id":"30BD0376-F248-11E8-B48F-1D18A9856A87","last_name":"Nardin","orcid":"0000-0001-8849-6570"},{"first_name":"James W.","full_name":"Phillips, James W.","last_name":"Phillips"},{"full_name":"Podlaski, William F.","first_name":"William F.","last_name":"Podlaski"},{"full_name":"Keemink, Sander W.","first_name":"Sander W.","last_name":"Keemink"}],"file":[{"date_created":"2022-01-17T11:15:26Z","creator":"mnardin","file_size":3311494,"success":1,"access_level":"open_access","file_id":"10636","content_type":"application/pdf","checksum":"cd9af6b331918608f2e3d1c7940cbf4f","date_updated":"2022-01-17T11:15:26Z","relation":"main_file","file_name":"10_24072_pcjournal_69.pdf"}],"date_published":"2021-12-15T00:00:00Z","article_type":"original","project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","call_identifier":"H2020","name":"International IST Doctoral Program"}],"year":"2021","publication":"Peer Community Journal","scopus_import":"1","volume":1,"ddc":["519"],"acknowledgement":"A preprint version of this article has been peer-reviewed and recommended by Peer Community In Neuroscience (DOI link to the recommendation: https://doi.org/10.24072/pci.cneuro.100003).\r\nWe thank Christian Machens and Nuno Calaim for useful discussions on the project. This report\r\ncame out of a collaboration started at the CAJAL Advanced Neuroscience Training Programme in\r\nComputational Neuroscience in Lisbon, Portugal, during the 2019 summer. The authors would\r\nlike to thank the participants, TAs, lecturers, and organizers of the summer school. SWK was\r\nsupported by the Simons Collaboration on the Global Brain (543009). WFP was supported by\r\nFCT (032077). MN was supported by European Union Horizon 2020 (665385).\r\n","doi":"10.24072/pcjournal.69","intvolume":"         1","external_id":{"arxiv":["2009.03857"]},"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","department":[{"_id":"GradSch"},{"_id":"JoCs"}],"publication_identifier":{"eissn":["2804-3871"]},"day":"15","has_accepted_license":"1","status":"public","file_date_updated":"2022-01-17T11:15:26Z"},{"abstract":[{"lang":"eng","text":"Adeno-associated viruses (AAVs) are widely used to deliver genetic material in vivo to distinct cell types such as neurons or glial cells, allowing for targeted manipulation. Transduction of microglia is mostly excluded from this strategy, likely due to the cells’ heterogeneous state upon environmental changes, which makes AAV design challenging. Here, we established the retina as a model system for microglial AAV validation and optimization. First, we show that AAV2/6 transduced microglia in both synaptic layers, where layer preference corresponds to the intravitreal or subretinal delivery method. Surprisingly, we observed significantly enhanced microglial transduction during photoreceptor degeneration. Thus, we modified the AAV6 capsid to reduce heparin binding by introducing four point mutations (K531E, R576Q, K493S, and K459S), resulting in increased microglial transduction in the outer plexiform layer. Finally, to improve microglial-specific transduction, we validated a Cre-dependent transgene delivery cassette for use in combination with the Cx3cr1CreERT2 mouse line. Together, our results provide a foundation for future studies optimizing AAV-mediated microglia transduction and highlight that environmental conditions influence microglial transduction efficiency.\r\n"}],"_id":"10655","month":"12","citation":{"ieee":"M. E. Maes, G. M. Wögenstein, G. Colombo, R. Casado Polanco, and S. Siegert, “Optimizing AAV2/6 microglial targeting identified enhanced efficiency in the photoreceptor degenerative environment,” <i>Molecular Therapy - Methods and Clinical Development</i>, vol. 23. Elsevier, pp. 210–224, 2021.","mla":"Maes, Margaret E., et al. “Optimizing AAV2/6 Microglial Targeting Identified Enhanced Efficiency in the Photoreceptor Degenerative Environment.” <i>Molecular Therapy - Methods and Clinical Development</i>, vol. 23, Elsevier, 2021, pp. 210–24, doi:<a href=\"https://doi.org/10.1016/j.omtm.2021.09.006\">10.1016/j.omtm.2021.09.006</a>.","short":"M.E. Maes, G.M. Wögenstein, G. Colombo, R. Casado Polanco, S. Siegert, Molecular Therapy - Methods and Clinical Development 23 (2021) 210–224.","apa":"Maes, M. E., Wögenstein, G. M., Colombo, G., Casado Polanco, R., &#38; Siegert, S. (2021). Optimizing AAV2/6 microglial targeting identified enhanced efficiency in the photoreceptor degenerative environment. <i>Molecular Therapy - Methods and Clinical Development</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.omtm.2021.09.006\">https://doi.org/10.1016/j.omtm.2021.09.006</a>","ama":"Maes ME, Wögenstein GM, Colombo G, Casado Polanco R, Siegert S. Optimizing AAV2/6 microglial targeting identified enhanced efficiency in the photoreceptor degenerative environment. <i>Molecular Therapy - Methods and Clinical Development</i>. 2021;23:210-224. doi:<a href=\"https://doi.org/10.1016/j.omtm.2021.09.006\">10.1016/j.omtm.2021.09.006</a>","ista":"Maes ME, Wögenstein GM, Colombo G, Casado Polanco R, Siegert S. 2021. Optimizing AAV2/6 microglial targeting identified enhanced efficiency in the photoreceptor degenerative environment. Molecular Therapy - Methods and Clinical Development. 23, 210–224.","chicago":"Maes, Margaret E, Gabriele M. Wögenstein, Gloria Colombo, Raquel Casado Polanco, and Sandra Siegert. “Optimizing AAV2/6 Microglial Targeting Identified Enhanced Efficiency in the Photoreceptor Degenerative Environment.” <i>Molecular Therapy - Methods and Clinical Development</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.omtm.2021.09.006\">https://doi.org/10.1016/j.omtm.2021.09.006</a>."},"type":"journal_article","page":"210-224","oa":1,"oa_version":"Published Version","corr_author":"1","publisher":"Elsevier","quality_controlled":"1","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"date_updated":"2025-04-14T07:41:46Z","language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"},{"_id":"PreCl"}],"intvolume":"        23","doi":"10.1016/j.omtm.2021.09.006","acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement no. 715571). The research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by the Bioimaging Facility, the Life Science Facility, and the Pre-Clinical Facility, namely Sonja Haslinger and Michael Schunn for their animal colony management and support. We would also like to thank Chakrabarty Lab for sharing the plasmids for AAV2/6 production. Finally, we would like to thank the Siegert team members for discussion about the manuscript.","ddc":["570"],"volume":23,"scopus_import":"1","year":"2021","publication":"Molecular Therapy - Methods and Clinical Development","project":[{"call_identifier":"H2020","name":"Microglia action towards neuronal circuit formation and function in health and disease","_id":"25D4A630-B435-11E9-9278-68D0E5697425","grant_number":"715571"}],"article_type":"original","date_published":"2021-12-10T00:00:00Z","file":[{"file_name":"2021_MolTherMethodsClinDev_Maes.pdf","date_updated":"2022-01-24T07:43:09Z","relation":"main_file","file_id":"10657","success":1,"access_level":"open_access","checksum":"77dc540e8011c5475031bdf6ccef20a6","content_type":"application/pdf","file_size":4794147,"creator":"cchlebak","date_created":"2022-01-24T07:43:09Z"}],"title":"Optimizing AAV2/6 microglial targeting identified enhanced efficiency in the photoreceptor degenerative environment","author":[{"first_name":"Margaret E","full_name":"Maes, Margaret E","last_name":"Maes","id":"3838F452-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9642-1085"},{"first_name":"Gabriele M.","full_name":"Wögenstein, Gabriele M.","last_name":"Wögenstein"},{"last_name":"Colombo","id":"3483CF6C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9434-8902","first_name":"Gloria","full_name":"Colombo, Gloria"},{"full_name":"Casado Polanco, Raquel","first_name":"Raquel","orcid":"0000-0001-8293-4568","id":"15240fc1-dbcd-11ea-9d1d-ac5a786425fd","last_name":"Casado Polanco"},{"orcid":"0000-0001-8635-0877","last_name":"Siegert","id":"36ACD32E-F248-11E8-B48F-1D18A9856A87","full_name":"Siegert, Sandra","first_name":"Sandra"}],"date_created":"2022-01-23T23:01:28Z","ec_funded":1,"file_date_updated":"2022-01-24T07:43:09Z","has_accepted_license":"1","isi":1,"status":"public","day":"10","publication_identifier":{"eissn":["2329-0501"]},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"SaSi"},{"_id":"SiHi"}],"article_processing_charge":"Yes","publication_status":"published","external_id":{"isi":["000748748500019"]}},{"file_date_updated":"2022-01-26T07:38:32Z","external_id":{"arxiv":["2106.07091"]},"publication_status":"published","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","publication_identifier":{"issn":["2640-3498"]},"main_file_link":[{"url":"https://proceedings.mlr.press/v139/babaiee21a","open_access":"1"}],"has_accepted_license":"1","status":"public","alternative_title":["PMLR"],"publication":"Proceedings of the 38th International Conference on Machine Learning","year":"2021","volume":139,"ddc":["000"],"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).","intvolume":"       139","author":[{"last_name":"Babaiee","first_name":"Zahra","full_name":"Babaiee, Zahra"},{"first_name":"Ramin","full_name":"Hasani, Ramin","last_name":"Hasani"},{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner","full_name":"Lechner, Mathias","first_name":"Mathias"},{"first_name":"Daniela","full_name":"Rus, Daniela","last_name":"Rus"},{"full_name":"Grosu, Radu","first_name":"Radu","last_name":"Grosu"}],"title":"On-off center-surround receptive fields for accurate and robust image classification","date_created":"2022-01-25T15:46:33Z","file":[{"file_name":"babaiee21a.pdf","relation":"main_file","date_updated":"2022-01-26T07:38:32Z","file_id":"10681","access_level":"open_access","success":1,"checksum":"d30eae62561bb517d9f978437d7677db","content_type":"application/pdf","file_size":4246561,"creator":"mlechner","date_created":"2022-01-26T07:38:32Z"}],"date_published":"2021-07-01T00:00:00Z","project":[{"name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"date_updated":"2025-05-19T11:28:08Z","language":[{"iso":"eng"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","short":"CC BY-NC-ND (3.0)","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)"},"quality_controlled":"1","publisher":"ML Research Press","oa_version":"Published Version","license":"https://creativecommons.org/licenses/by-nc-nd/3.0/","arxiv":1,"oa":1,"conference":{"location":"Virtual","end_date":"2021-07-24","name":"ML: Machine Learning","start_date":"2021-07-18"},"page":"478-489","month":"07","citation":{"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.","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.","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.","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.","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.","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."},"type":"conference","_id":"10668","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."}]},{"date_created":"2022-01-25T15:47:20Z","author":[{"last_name":"Grunbacher","full_name":"Grunbacher, Sophie","first_name":"Sophie"},{"full_name":"Hasani, Ramin","first_name":"Ramin","last_name":"Hasani"},{"full_name":"Lechner, Mathias","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner"},{"full_name":"Cyranka, Jacek","first_name":"Jacek","last_name":"Cyranka"},{"last_name":"Smolka","first_name":"Scott A","full_name":"Smolka, Scott A"},{"full_name":"Grosu, Radu","first_name":"Radu","last_name":"Grosu"}],"title":"On the verification of neural ODEs with stochastic guarantees","issue":"13","file":[{"file_size":286906,"creator":"mlechner","date_created":"2022-01-26T07:38:08Z","file_name":"17372-Article Text-20866-1-2-20210518.pdf","date_updated":"2022-01-26T07:38:08Z","relation":"main_file","checksum":"468d07041e282a1d46ffdae92f709630","content_type":"application/pdf","file_id":"10680","access_level":"open_access","success":1}],"date_published":"2021-05-28T00:00:00Z","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems"}],"year":"2021","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","volume":35,"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","ddc":["000"],"intvolume":"        35","publication_status":"published","external_id":{"arxiv":["2012.08863"]},"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"28","publication_identifier":{"issn":["2159-5399"],"eissn":["2374-3468"],"isbn":["978-1-57735-866-4"]},"alternative_title":["Technical Tracks"],"has_accepted_license":"1","status":"public","main_file_link":[{"open_access":"1","url":"https://ojs.aaai.org/index.php/AAAI/article/view/17372"}],"file_date_updated":"2022-01-26T07:38:08Z","conference":{"start_date":"2021-02-02","name":"AAAI: Association for the Advancement of Artificial Intelligence","end_date":"2021-02-09","location":"Virtual"},"page":"11525-11535","oa":1,"type":"conference","month":"05","citation":{"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.","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.","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.","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.","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.","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.","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."},"_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"}],"arxiv":1,"language":[{"iso":"eng"}],"date_updated":"2025-04-15T06:25:56Z","publisher":"AAAI Press","quality_controlled":"1","oa_version":"Published Version","corr_author":"1"},{"oa_version":"Published Version","quality_controlled":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","short":"CC BY-NC-ND (3.0)","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)"},"language":[{"iso":"eng"}],"date_updated":"2025-04-15T06:25:56Z","abstract":[{"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.","lang":"eng"}],"_id":"10670","citation":{"mla":"Vorbach, Charles J., et al. “Causal Navigation by Continuous-Time Neural Networks.” <i>35th Conference on Neural Information Processing Systems</i>, 2021.","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.","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.","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, .","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.","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."},"type":"conference","month":"12","conference":{"start_date":"2021-12-06","name":"NeurIPS: Neural Information Processing Systems","end_date":"2021-12-10","location":"Virtual"},"oa":1,"arxiv":1,"alternative_title":[" Advances in Neural Information Processing Systems"],"has_accepted_license":"1","status":"public","main_file_link":[{"url":"https://proceedings.neurips.cc/paper/2021/hash/67ba02d73c54f0b83c05507b7fb7267f-Abstract.html","open_access":"1"}],"day":"01","article_processing_charge":"No","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"publication_status":"published","external_id":{"arxiv":["2106.08314"]},"file_date_updated":"2022-01-26T07:37:24Z","project":[{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems"}],"date_published":"2021-12-01T00:00:00Z","file":[{"date_created":"2022-01-26T07:37:24Z","creator":"mlechner","file_size":6841228,"success":1,"access_level":"open_access","file_id":"10679","checksum":"be81f0ade174a8c9b2d4fe09590b2021","content_type":"application/pdf","relation":"main_file","date_updated":"2022-01-26T07:37:24Z","file_name":"NeurIPS-2021-causal-navigation-by-continuous-time-neural-networks-Paper.pdf"}],"date_created":"2022-01-25T15:47:50Z","author":[{"full_name":"Vorbach, Charles J","first_name":"Charles J","last_name":"Vorbach"},{"last_name":"Hasani","first_name":"Ramin","full_name":"Hasani, Ramin"},{"full_name":"Amini, Alexander","first_name":"Alexander","last_name":"Amini"},{"full_name":"Lechner, Mathias","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner"},{"last_name":"Rus","full_name":"Rus, Daniela","first_name":"Daniela"}],"title":"Causal navigation by continuous-time neural networks","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","ddc":["000"],"year":"2021","publication":"35th Conference on Neural Information Processing Systems"},{"arxiv":1,"abstract":[{"lang":"eng","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."}],"_id":"10671","type":"conference","citation":{"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.","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.","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.","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.","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.","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.","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."},"month":"05","page":"7657-7666","conference":{"start_date":"2021-02-02","name":"AAAI: Association for the Advancement of Artificial Intelligence","end_date":"2021-02-09","location":"Virtual"},"oa":1,"oa_version":"Published Version","corr_author":"1","publisher":"AAAI Press","quality_controlled":"1","language":[{"iso":"eng"}],"date_updated":"2025-04-15T06:25:56Z","intvolume":"        35","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.","ddc":["000"],"volume":35,"publication":"Proceedings of the AAAI Conference on Artificial Intelligence","year":"2021","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF"}],"date_published":"2021-05-28T00:00:00Z","issue":"9","file":[{"file_size":4302669,"date_created":"2022-01-26T07:36:03Z","creator":"mlechner","file_name":"16936-Article Text-20430-1-2-20210518 (1).pdf","content_type":"application/pdf","checksum":"0f06995fba06dbcfa7ed965fc66027ff","success":1,"file_id":"10678","access_level":"open_access","date_updated":"2022-01-26T07:36:03Z","relation":"main_file"}],"title":"Liquid time-constant networks","author":[{"last_name":"Hasani","full_name":"Hasani, Ramin","first_name":"Ramin"},{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner","full_name":"Lechner, Mathias","first_name":"Mathias"},{"last_name":"Amini","full_name":"Amini, Alexander","first_name":"Alexander"},{"full_name":"Rus, Daniela","first_name":"Daniela","last_name":"Rus"},{"first_name":"Radu","full_name":"Grosu, Radu","last_name":"Grosu"}],"date_created":"2022-01-25T15:48:36Z","file_date_updated":"2022-01-26T07:36:03Z","alternative_title":["Technical Tracks"],"main_file_link":[{"url":"https://ojs.aaai.org/index.php/AAAI/article/view/16936","open_access":"1"}],"status":"public","has_accepted_license":"1","day":"28","publication_identifier":{"issn":["2159-5399"],"eissn":["2374-3468"],"isbn":["978-1-57735-866-4"]},"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"publication_status":"published","external_id":{"arxiv":["2006.04439"]}},{"file_date_updated":"2022-01-26T08:04:50Z","external_id":{"isi":["000658724600010"],"arxiv":["1905.03588"]},"publication_status":"published","department":[{"_id":"ToHe"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","article_processing_charge":"No","publication_identifier":{"eissn":["1860-5974"]},"day":"03","status":"public","has_accepted_license":"1","isi":1,"year":"2021","publication":"Logical Methods in Computer Science","scopus_import":"1","volume":17,"ddc":["510"],"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","doi":"10.23638/LMCS-17(1:10)2021","intvolume":"        17","author":[{"first_name":"Milad","full_name":"Aghajohari, Milad","last_name":"Aghajohari"},{"last_name":"Avni","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5588-8287","first_name":"Guy","full_name":"Avni, Guy"},{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724"}],"title":"Determinacy in discrete-bidding infinite-duration games","date_created":"2022-01-25T16:32:13Z","file":[{"file_name":"2021_LMCS_AGHAJOHAR.pdf","success":1,"file_id":"10690","access_level":"open_access","checksum":"b35586a50ed1ca8f44767de116d18d81","content_type":"application/pdf","relation":"main_file","date_updated":"2022-01-26T08:04:50Z","file_size":819878,"date_created":"2022-01-26T08:04:50Z","creator":"alisjak"}],"issue":"1","date_published":"2021-02-03T00:00:00Z","article_type":"original","project":[{"grant_number":"M02369","_id":"264B3912-B435-11E9-9278-68D0E5697425","name":"Formal Methods meets Algorithmic Game Theory","call_identifier":"FWF"},{"grant_number":"S11402-N23","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF"}],"language":[{"iso":"eng"}],"date_updated":"2025-04-15T06:25:56Z","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"quality_controlled":"1","publisher":"International Federation for Computational Logic","corr_author":"1","oa_version":"Published Version","arxiv":1,"oa":1,"page":"10:1-10:23","type":"journal_article","month":"02","citation":{"mla":"Aghajohari, Milad, et al. “Determinacy in Discrete-Bidding Infinite-Duration Games.” <i>Logical Methods in Computer Science</i>, vol. 17, no. 1, International Federation for Computational Logic, 2021, p. 10:1-10:23, doi:<a href=\"https://doi.org/10.23638/LMCS-17(1:10)2021\">10.23638/LMCS-17(1:10)2021</a>.","ieee":"M. Aghajohari, G. Avni, and T. A. Henzinger, “Determinacy in discrete-bidding infinite-duration games,” <i>Logical Methods in Computer Science</i>, vol. 17, no. 1. International Federation for Computational Logic, p. 10:1-10:23, 2021.","short":"M. Aghajohari, G. Avni, T.A. Henzinger, Logical Methods in Computer Science 17 (2021) 10:1-10:23.","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>","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>","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>.","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."},"keyword":["computer science","computer science and game theory","logic in computer science"],"_id":"10674","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."}]},{"file_date_updated":"2022-01-26T08:04:29Z","publication_identifier":{"isbn":["978-3-85448-046-4"]},"day":"01","status":"public","has_accepted_license":"1","alternative_title":["Conference Series"],"publication_status":"published","article_processing_charge":"No","department":[{"_id":"ToHe"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","ddc":["000"],"doi":"10.34727/2021/isbn.978-3-85448-046-4_23","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).","intvolume":"         2","year":"2021","publication":"Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design","scopus_import":"1","volume":2,"date_published":"2021-10-01T00:00:00Z","project":[{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems"}],"author":[{"last_name":"Kragl","id":"320FC952-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7745-9117","first_name":"Bernhard","full_name":"Kragl, Bernhard"},{"full_name":"Qadeer, Shaz","first_name":"Shaz","last_name":"Qadeer"}],"date_created":"2022-01-26T08:01:30Z","title":"The Civl verifier","file":[{"file_name":"2021_FCAD2021_Kragl.pdf","checksum":"35438ac9f9750340b7f8ae4ae3220d9f","content_type":"application/pdf","file_id":"10689","access_level":"open_access","success":1,"relation":"main_file","date_updated":"2022-01-26T08:04:29Z","file_size":390555,"date_created":"2022-01-26T08:04:29Z","creator":"cchlebak"}],"quality_controlled":"1","publisher":"TU Wien Academic Press","corr_author":"1","oa_version":"Published Version","language":[{"iso":"eng"}],"date_updated":"2025-04-15T06:25:56Z","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"_id":"10688","abstract":[{"text":"Civl is a static verifier for concurrent programs designed around the conceptual framework of layered refinement,\r\nwhich views the task of verifying a program as a sequence of program simplification steps each justified by its own invariant. Civl verifies a layered concurrent program that compactly expresses all the programs in this sequence and the supporting invariants. This paper presents the design and implementation of the Civl verifier.","lang":"eng"}],"oa":1,"editor":[{"last_name":"Ruzica","full_name":"Ruzica, Piskac","first_name":"Piskac"},{"full_name":"Whalen, Michael W.","first_name":"Michael W.","last_name":"Whalen"}],"page":"143–152","conference":{"location":"Virtual","start_date":"2021-10-20","name":"FMCAD: Formal Methods in Computer-Aided Design","end_date":"2021-10-22"},"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.","apa":"Kragl, B., &#38; Qadeer, S. (2021). The Civl verifier. In P. Ruzica &#38; M. W. Whalen (Eds.), <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i> (Vol. 2, pp. 143–152). Virtual: TU Wien Academic Press. <a href=\"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23\">https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23</a>","ama":"Kragl B, Qadeer S. The Civl verifier. In: Ruzica P, Whalen MW, eds. <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i>. Vol 2. TU Wien Academic Press; 2021:143–152. doi:<a href=\"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23\">10.34727/2021/isbn.978-3-85448-046-4_23</a>","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>.","ista":"Kragl B, Qadeer S. 2021. The Civl verifier. Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, Conference Series, vol. 2, 143–152.","ieee":"B. Kragl and S. Qadeer, “The Civl verifier,” in <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i>, Virtual, 2021, vol. 2, pp. 143–152.","mla":"Kragl, Bernhard, and Shaz Qadeer. “The Civl Verifier.” <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i>, edited by Piskac Ruzica and Michael W. Whalen, vol. 2, TU Wien Academic Press, 2021, pp. 143–152, doi:<a href=\"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23\">10.34727/2021/isbn.978-3-85448-046-4_23</a>."},"month":"10","type":"conference"},{"arxiv":1,"conference":{"name":"SODA: Symposium on Discrete Algorithms","start_date":"2021-01-10","end_date":"2021-01-13","location":"Virtual"},"page":"617-636","oa":1,"editor":[{"last_name":"Marx","full_name":"Marx, Dániel","first_name":"Dániel"}],"month":"01","citation":{"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>","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.","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>","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>.","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.","mla":"Avni, Guy, et al. “Infinite-Duration All-Pay Bidding Games.” <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i>, edited by Dániel Marx, Society for Industrial and Applied Mathematics, 2021, pp. 617–36, doi:<a href=\"https://doi.org/10.1137/1.9781611976465.38\">10.1137/1.9781611976465.38</a>.","ieee":"G. Avni, I. R. Jecker, and D. Zikelic, “Infinite-duration all-pay bidding games,” in <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i>, Virtual, 2021, pp. 617–636."},"type":"conference","_id":"10694","abstract":[{"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.","lang":"eng"}],"language":[{"iso":"eng"}],"date_updated":"2025-04-15T06:26:15Z","publisher":"Society for Industrial and Applied Mathematics","quality_controlled":"1","oa_version":"Preprint","corr_author":"1","scopus_import":"1","publication":"Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms","year":"2021","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.","doi":"10.1137/1.9781611976465.38","title":"Infinite-duration all-pay bidding games","author":[{"full_name":"Avni, Guy","first_name":"Guy","orcid":"0000-0001-5588-8287","last_name":"Avni","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Ismael R","full_name":"Jecker, Ismael R","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","last_name":"Jecker"},{"first_name":"Dorde","full_name":"Zikelic, Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","last_name":"Zikelic","orcid":"0000-0002-4681-1699"}],"date_created":"2022-01-27T12:11:23Z","ec_funded":1,"date_published":"2021-01-01T00:00:00Z","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF"},{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","call_identifier":"H2020","name":"International IST Doctoral Program"}],"publication_status":"published","external_id":{"arxiv":["2005.06636"]},"department":[{"_id":"GradSch"},{"_id":"KrCh"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","article_processing_charge":"No","publication_identifier":{"isbn":["978-1-61197-646-5"]},"day":"01","main_file_link":[{"url":"https://arxiv.org/abs/2005.06636","open_access":"1"}],"status":"public"},{"arxiv":1,"keyword":["Algebra and Number Theory"],"_id":"10711","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."}],"page":"1610-1651","oa":1,"citation":{"ieee":"P. Autissier, D. Bonolis, and Y. Lamzouri, “The distribution of the maximum of partial sums of Kloosterman sums and other trace functions,” <i>Compositio Mathematica</i>, vol. 157, no. 7. Cambridge University Press, pp. 1610–1651, 2021.","mla":"Autissier, Pascal, et al. “The Distribution of the Maximum of Partial Sums of Kloosterman Sums and Other Trace Functions.” <i>Compositio Mathematica</i>, vol. 157, no. 7, Cambridge University Press, 2021, pp. 1610–51, doi:<a href=\"https://doi.org/10.1112/s0010437x21007351\">10.1112/s0010437x21007351</a>.","ista":"Autissier P, Bonolis D, Lamzouri Y. 2021. The distribution of the maximum of partial sums of Kloosterman sums and other trace functions. Compositio Mathematica. 157(7), 1610–1651.","chicago":"Autissier, Pascal, Dante Bonolis, and Youness Lamzouri. “The Distribution of the Maximum of Partial Sums of Kloosterman Sums and Other Trace Functions.” <i>Compositio Mathematica</i>. Cambridge University Press, 2021. <a href=\"https://doi.org/10.1112/s0010437x21007351\">https://doi.org/10.1112/s0010437x21007351</a>.","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>","short":"P. Autissier, D. Bonolis, Y. Lamzouri, Compositio Mathematica 157 (2021) 1610–1651.","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>"},"type":"journal_article","month":"06","publisher":"Cambridge University Press","quality_controlled":"1","oa_version":"Preprint","corr_author":"1","language":[{"iso":"eng"}],"date_updated":"2024-10-21T06:02:06Z","doi":"10.1112/s0010437x21007351","acknowledgement":"We would like to thank the anonymous referees for carefully reading the paper and for their remarks and suggestions.","intvolume":"       157","scopus_import":"1","year":"2021","publication":"Compositio Mathematica","volume":157,"date_published":"2021-06-28T00:00:00Z","article_type":"original","title":"The distribution of the maximum of partial sums of Kloosterman sums and other trace functions","author":[{"first_name":"Pascal","full_name":"Autissier, Pascal","last_name":"Autissier"},{"id":"6A459894-5FDD-11E9-AF35-BB24E6697425","last_name":"Bonolis","first_name":"Dante","full_name":"Bonolis, Dante"},{"last_name":"Lamzouri","full_name":"Lamzouri, Youness","first_name":"Youness"}],"date_created":"2022-02-01T08:10:43Z","issue":"7","day":"28","publication_identifier":{"issn":["0010-437X"],"eissn":["1570-5846"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1909.03266"}],"status":"public","isi":1,"publication_status":"published","external_id":{"isi":["000667289300001"],"arxiv":["1909.03266"]},"department":[{"_id":"TiBr"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","article_processing_charge":"No"},{"date_created":"2022-02-06T23:01:33Z","author":[{"full_name":"Leopold, Nikolai K","first_name":"Nikolai K","orcid":"0000-0002-0495-6822","id":"4BC40BEC-F248-11E8-B48F-1D18A9856A87","last_name":"Leopold"},{"orcid":"0000-0001-5059-4466","id":"856966FE-A408-11E9-977E-802DE6697425","last_name":"Rademacher","full_name":"Rademacher, Simone Anna Elvira","first_name":"Simone Anna Elvira"},{"last_name":"Schlein","full_name":"Schlein, Benjamin","first_name":"Benjamin"},{"full_name":"Seiringer, Robert","first_name":"Robert","orcid":"0000-0002-6781-0521","last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"}],"title":" The Landau–Pekar equations: Adiabatic theorem and accuracy","ec_funded":1,"issue":"7","date_published":"2021-11-10T00:00:00Z","project":[{"_id":"25C6DC12-B435-11E9-9278-68D0E5697425","grant_number":"694227","call_identifier":"H2020","name":"Analysis of quantum many-body systems"}],"article_type":"original","scopus_import":"1","publication":"Analysis and PDE","year":"2021","volume":14,"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","doi":"10.2140/APDE.2021.14.2079","intvolume":"        14","publication_status":"published","external_id":{"isi":["000733976600004"],"arxiv":["1904.12532"]},"department":[{"_id":"RoSe"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","day":"10","publication_identifier":{"eissn":["1948-206X"],"issn":["2157-5045"]},"isi":1,"status":"public","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1904.12532"}],"page":"2079-2100","oa":1,"type":"journal_article","citation":{"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>","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>.","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.","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>","short":"N.K. Leopold, S.A.E. Rademacher, B. Schlein, R. Seiringer, Analysis and PDE 14 (2021) 2079–2100.","mla":"Leopold, Nikolai K., et al. “ The Landau–Pekar Equations: Adiabatic Theorem and Accuracy.” <i>Analysis and PDE</i>, vol. 14, no. 7, Mathematical Sciences Publishers, 2021, pp. 2079–100, doi:<a href=\"https://doi.org/10.2140/APDE.2021.14.2079\">10.2140/APDE.2021.14.2079</a>.","ieee":"N. K. Leopold, S. A. E. Rademacher, B. Schlein, and R. Seiringer, “ The Landau–Pekar equations: Adiabatic theorem and accuracy,” <i>Analysis and PDE</i>, vol. 14, no. 7. Mathematical Sciences Publishers, pp. 2079–2100, 2021."},"month":"11","_id":"10738","abstract":[{"lang":"eng","text":"We prove an adiabatic theorem for the Landau–Pekar equations. This allows us to derive new results on the accuracy of their use as effective equations for the time evolution generated by the Fröhlich Hamiltonian with large coupling constant α. In particular, we show that the time evolution of Pekar product states with coherent phonon field and the electron being trapped by the phonons is well approximated by the Landau–Pekar equations until times short compared to α2."}],"arxiv":1,"date_updated":"2025-04-14T07:26:53Z","language":[{"iso":"eng"}],"publisher":"Mathematical Sciences Publishers","quality_controlled":"1","oa_version":"Preprint","corr_author":"1"},{"external_id":{"pmid":["33574201"],"isi":["000617551600027"]},"publication_status":"published","department":[{"_id":"MaIb"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","article_processing_charge":"No","day":"12","publication_identifier":{"eissn":["1095-9203"],"issn":["0036-8075"]},"isi":1,"status":"public","author":[{"orcid":"0000-0001-7313-6740","id":"2A70014E-F248-11E8-B48F-1D18A9856A87","last_name":"Liu","full_name":"Liu, Yu","first_name":"Yu"},{"orcid":"0000-0001-5013-2843","last_name":"Ibáñez","id":"43C61214-F248-11E8-B48F-1D18A9856A87","full_name":"Ibáñez, Maria","first_name":"Maria"}],"title":"Tidying up the mess","date_created":"2022-03-03T09:51:48Z","issue":"6530","date_published":"2021-02-12T00:00:00Z","article_type":"letter_note","year":"2021","publication":"Science","pmid":1,"scopus_import":"1","volume":371,"doi":"10.1126/science.abg0886","intvolume":"       371","date_updated":"2024-10-09T21:01:45Z","language":[{"iso":"eng"}],"quality_controlled":"1","publisher":"American Association for the Advancement of Science","corr_author":"1","oa_version":"None","page":"678-679","citation":{"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.","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>.","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.","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>.","apa":"Liu, Y., &#38; Ibáñez, M. (2021). Tidying up the mess. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.abg0886\">https://doi.org/10.1126/science.abg0886</a>","short":"Y. Liu, M. Ibáñez, Science 371 (2021) 678–679."},"type":"journal_article","month":"02","_id":"10809","keyword":["multidisciplinary"],"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."}]},{"abstract":[{"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.","lang":"eng"}],"keyword":["General Agricultural and Biological Sciences","General Biochemistry","Genetics and Molecular Biology"],"_id":"10834","citation":{"apa":"Stahnke, S., Döring, H., Kusch, C., de Gorter, D. J. J., Dütting, S., Guledani, A., … Stradal, T. E. B. (2021). Loss of Hem1 disrupts macrophage function and impacts migration, phagocytosis, and integrin-mediated adhesion. <i>Current Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.cub.2021.02.043\">https://doi.org/10.1016/j.cub.2021.02.043</a>","short":"S. Stahnke, H. Döring, C. Kusch, D.J.J. de Gorter, S. Dütting, A. Guledani, I. Pleines, M. Schnoor, M.K. Sixt, R. Geffers, M. Rohde, M. Müsken, F. Kage, A. Steffen, J. Faix, B. Nieswandt, K. Rottner, T.E.B. Stradal, Current Biology 31 (2021) 2051–2064.e8.","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.","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>.","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>.","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."},"month":"05","type":"journal_article","oa":1,"page":"2051-2064.e8","oa_version":"Preprint","quality_controlled":"1","publisher":"Elsevier","language":[{"iso":"eng"}],"date_updated":"2023-08-17T07:01:14Z","article_type":"original","date_published":"2021-05-24T00:00:00Z","issue":"10","date_created":"2022-03-08T07:51:04Z","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"},{"full_name":"Döring, Hermann","first_name":"Hermann","last_name":"Döring"},{"last_name":"Kusch","full_name":"Kusch, Charly","first_name":"Charly"},{"last_name":"de Gorter","full_name":"de Gorter, David J.J.","first_name":"David J.J."},{"full_name":"Dütting, Sebastian","first_name":"Sebastian","last_name":"Dütting"},{"last_name":"Guledani","first_name":"Aleks","full_name":"Guledani, Aleks"},{"last_name":"Pleines","first_name":"Irina","full_name":"Pleines, Irina"},{"full_name":"Schnoor, Michael","first_name":"Michael","last_name":"Schnoor"},{"full_name":"Sixt, Michael K","first_name":"Michael K","orcid":"0000-0002-6620-9179","last_name":"Sixt","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Robert","full_name":"Geffers, Robert","last_name":"Geffers"},{"first_name":"Manfred","full_name":"Rohde, Manfred","last_name":"Rohde"},{"full_name":"Müsken, Mathias","first_name":"Mathias","last_name":"Müsken"},{"last_name":"Kage","first_name":"Frieda","full_name":"Kage, Frieda"},{"full_name":"Steffen, Anika","first_name":"Anika","last_name":"Steffen"},{"first_name":"Jan","full_name":"Faix, Jan","last_name":"Faix"},{"last_name":"Nieswandt","full_name":"Nieswandt, Bernhard","first_name":"Bernhard"},{"full_name":"Rottner, Klemens","first_name":"Klemens","last_name":"Rottner"},{"last_name":"Stradal","full_name":"Stradal, Theresia E.B.","first_name":"Theresia E.B."}],"intvolume":"        31","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 ).","doi":"10.1016/j.cub.2021.02.043","volume":31,"publication":"Current Biology","year":"2021","scopus_import":"1","pmid":1,"isi":1,"main_file_link":[{"url":"https://doi.org/10.1101/2020.03.24.005835","open_access":"1"}],"status":"public","day":"24","publication_identifier":{"issn":["0960-9822"]},"article_processing_charge":"No","department":[{"_id":"MiSi"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","external_id":{"isi":["000654652200002"],"pmid":["33711252"]},"publication_status":"published"},{"isi":1,"has_accepted_license":"1","status":"public","publication_identifier":{"eissn":["1365-294X"],"issn":["0962-1083"]},"day":"01","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","department":[{"_id":"BeVi"}],"article_processing_charge":"No","external_id":{"pmid":["33638231"],"isi":["000669439700001"]},"publication_status":"published","file_date_updated":"2022-03-08T11:31:30Z","article_type":"original","date_published":"2021-08-01T00:00:00Z","file":[{"date_created":"2022-03-08T11:31:30Z","creator":"dernst","file_size":1726548,"checksum":"d5611f243ceb63a0e091d6662ebd9cda","content_type":"application/pdf","success":1,"file_id":"10839","access_level":"open_access","relation":"main_file","date_updated":"2022-03-08T11:31:30Z","file_name":"2021_MolecularEcology_Westram.pdf"}],"issue":"15","date_created":"2022-03-08T11:28:32Z","author":[{"id":"3C147470-F248-11E8-B48F-1D18A9856A87","last_name":"Westram","orcid":"0000-0003-1050-4969","first_name":"Anja M","full_name":"Westram, Anja M"},{"full_name":"Faria, Rui","first_name":"Rui","last_name":"Faria"},{"full_name":"Johannesson, Kerstin","first_name":"Kerstin","last_name":"Johannesson"},{"last_name":"Butlin","first_name":"Roger","full_name":"Butlin, Roger"}],"title":"Using replicate hybrid zones to understand the genomic basis of adaptive divergence","intvolume":"        30","ddc":["570"],"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.","doi":"10.1111/mec.15861","volume":30,"publication":"Molecular Ecology","year":"2021","pmid":1,"scopus_import":"1","corr_author":"1","oa_version":"Published Version","quality_controlled":"1","publisher":"Wiley","date_updated":"2024-10-09T21:01:47Z","language":[{"iso":"eng"}],"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"abstract":[{"lang":"eng","text":"Combining hybrid zone analysis with genomic data is a promising approach to understanding the genomic basis of adaptive divergence. It allows for the identification of genomic regions underlying barriers to gene flow. It also provides insights into spatial patterns of allele frequency change, informing about the interplay between environmental factors, dispersal and selection. However, when only a single hybrid zone is analysed, it is difficult to separate patterns generated by selection from those resulting from chance. Therefore, it is beneficial to look for repeatable patterns across replicate hybrid zones in the same system. We applied this approach to the marine snail Littorina saxatilis, which contains two ecotypes, adapted to wave-exposed rocks vs. high-predation boulder fields. The existence of numerous hybrid zones between ecotypes offered the opportunity to test for the repeatability of genomic architectures and spatial patterns of divergence. We sampled and phenotyped snails from seven replicate hybrid zones on the Swedish west coast and genotyped them for thousands of single nucleotide polymorphisms. Shell shape and size showed parallel clines across all zones. Many genomic regions showing steep clines and/or high differentiation were shared among hybrid zones, consistent with a common evolutionary history and extensive gene flow between zones, and supporting the importance of these regions for divergence. In particular, we found that several large putative inversions contribute to divergence in all locations. Additionally, we found evidence for consistent displacement of clines from the boulder–rock transition. Our results demonstrate patterns of spatial variation that would not be accessible without continuous spatial sampling, a large genomic data set and replicate hybrid zones."}],"keyword":["Genetics","Ecology","Evolution","Behavior and Systematics"],"_id":"10838","month":"08","citation":{"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.","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>.","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>","short":"A.M. Westram, R. Faria, K. Johannesson, R. Butlin, Molecular Ecology 30 (2021) 3797–3814.","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.","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>.","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>"},"type":"journal_article","oa":1,"page":"3797-3814"},{"article_processing_charge":"No","department":[{"_id":"RoSe"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publication_status":"published","external_id":{"arxiv":["1912.12509"],"isi":["000613313200013"]},"status":"public","isi":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1912.12509"}],"publication_identifier":{"eissn":["1793-6659"],"issn":["0129-055X"]},"day":"01","issue":"01","author":[{"orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","full_name":"Seiringer, Robert","first_name":"Robert"}],"article_number":"2060012","date_created":"2022-03-18T08:11:34Z","title":"The polaron at strong coupling","ec_funded":1,"project":[{"call_identifier":"H2020","name":"Analysis of quantum many-body systems","grant_number":"694227","_id":"25C6DC12-B435-11E9-9278-68D0E5697425"}],"article_type":"original","date_published":"2021-02-01T00:00:00Z","volume":33,"scopus_import":"1","publication":"Reviews in Mathematical Physics","year":"2021","intvolume":"        33","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).","doi":"10.1142/s0129055x20600120","date_updated":"2025-04-14T07:26:58Z","language":[{"iso":"eng"}],"oa_version":"Preprint","corr_author":"1","publisher":"World Scientific Publishing","quality_controlled":"1","type":"journal_article","month":"02","citation":{"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>.","ieee":"R. Seiringer, “The polaron at strong coupling,” <i>Reviews in Mathematical Physics</i>, vol. 33, no. 01. World Scientific Publishing, 2021.","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>","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>.","ista":"Seiringer R. 2021. The polaron at strong coupling. Reviews in Mathematical Physics. 33(01), 2060012.","short":"R. Seiringer, Reviews in Mathematical Physics 33 (2021).","apa":"Seiringer, R. (2021). The polaron at strong coupling. <i>Reviews in Mathematical Physics</i>. World Scientific Publishing. <a href=\"https://doi.org/10.1142/s0129055x20600120\">https://doi.org/10.1142/s0129055x20600120</a>"},"oa":1,"abstract":[{"lang":"eng","text":" We review old and new results on the Fröhlich polaron model. The discussion includes the validity of the (classical) Pekar approximation in the strong coupling limit, quantum corrections to this limit, as well as the divergence of the effective polaron mass."}],"_id":"10852","keyword":["Mathematical Physics","Statistical and Nonlinear Physics"],"arxiv":1},{"oa_version":"Preprint","quality_controlled":"1","publisher":"Association for Computing Machinery","date_updated":"2022-03-18T08:45:46Z","language":[{"iso":"eng"}],"arxiv":1,"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."}],"_id":"10853","type":"conference","citation":{"chicago":"Fedorov, Alexander, Nikita Koval, and Dan-Adrian Alistarh. “A Scalable Concurrent Algorithm for Dynamic Connectivity.” In <i>Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures</i>, 208–20. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3409964.3461810\">https://doi.org/10.1145/3409964.3461810</a>.","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>","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>","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.","ieee":"A. Fedorov, N. Koval, and D.-A. Alistarh, “A scalable concurrent algorithm for dynamic connectivity,” in <i>Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures</i>, Virtual, Online, 2021, pp. 208–220.","mla":"Fedorov, Alexander, et al. “A Scalable Concurrent Algorithm for Dynamic Connectivity.” <i>Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures</i>, Association for Computing Machinery, 2021, pp. 208–20, doi:<a href=\"https://doi.org/10.1145/3409964.3461810\">10.1145/3409964.3461810</a>."},"month":"07","oa":1,"conference":{"name":"SPAA: Symposium on Parallelism in Algorithms and Architectures","start_date":"2021-07-06","end_date":"2021-07-08","location":"Virtual, Online"},"page":"208-220","status":"public","main_file_link":[{"url":"https://arxiv.org/abs/2105.08098","open_access":"1"}],"publication_identifier":{"isbn":["9781450380706"]},"day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","department":[{"_id":"DaAl"}],"external_id":{"arxiv":["2105.08098"]},"publication_status":"published","doi":"10.1145/3409964.3461810","publication":"Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures","year":"2021","scopus_import":"1","date_published":"2021-07-01T00:00:00Z","author":[{"first_name":"Alexander","full_name":"Fedorov, Alexander","last_name":"Fedorov"},{"first_name":"Nikita","full_name":"Koval, Nikita","last_name":"Koval"},{"full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh"}],"title":"A scalable concurrent algorithm for dynamic connectivity","date_created":"2022-03-18T08:21:47Z"},{"arxiv":1,"_id":"10854","abstract":[{"text":"Consider a distributed task where the communication network is fixed but the local inputs given to the nodes of the distributed system may change over time. In this work, we explore the following question: if some of the local inputs change, can an existing solution be updated efficiently, in a dynamic and distributed manner?\r\nTo address this question, we define the batch dynamic CONGEST model in which we are given a bandwidth-limited communication network and a dynamic edge labelling defines the problem input. The task is to maintain a solution to a graph problem on the labelled graph under batch changes. We investigate, when a batch of alpha edge label changes arrive, - how much time as a function of alpha we need to update an existing solution, and - how much information the nodes have to keep in local memory between batches in order to update the solution quickly.\r\nOur work lays the foundations for the theory of input-dynamic distributed network algorithms. We give a general picture of the complexity landscape in this model, design both universal algorithms and algorithms for concrete problems, and present a general framework for lower bounds. The diverse time complexity of our model spans from constant time, through time polynomial in alpha, and to alpha time, which we show to be enough for any task.","lang":"eng"}],"page":"71-72","conference":{"end_date":"2021-06-18","start_date":"2021-06-14","name":"SIGMETRICS: International Conference on Measurement and Modeling of Computer Systems","location":"Virtual, Online"},"oa":1,"type":"conference","related_material":{"record":[{"id":"10855","status":"public","relation":"extended_version"}]},"month":"05","citation":{"ieee":"K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, and S. Schmid, “Input-dynamic distributed algorithms for communication networks,” in <i>Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems</i>, Virtual, Online, 2021, pp. 71–72.","mla":"Foerster, Klaus-Tycho, et al. “Input-Dynamic Distributed Algorithms for Communication Networks.” <i>Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems</i>, Association for Computing Machinery, 2021, pp. 71–72, doi:<a href=\"https://doi.org/10.1145/3410220.3453923\">10.1145/3410220.3453923</a>.","apa":"Foerster, K.-T., Korhonen, J., Paz, A., Rybicki, J., &#38; Schmid, S. (2021). Input-dynamic distributed algorithms for communication networks. In <i>Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems</i> (pp. 71–72). Virtual, Online: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3410220.3453923\">https://doi.org/10.1145/3410220.3453923</a>","short":"K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, S. Schmid, in:, Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, Association for Computing Machinery, 2021, pp. 71–72.","chicago":"Foerster, Klaus-Tycho, Janne Korhonen, Ami Paz, Joel Rybicki, and Stefan Schmid. “Input-Dynamic Distributed Algorithms for Communication Networks.” In <i>Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems</i>, 71–72. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3410220.3453923\">https://doi.org/10.1145/3410220.3453923</a>.","ista":"Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. 2021. Input-dynamic distributed algorithms for communication networks. Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems. SIGMETRICS: International Conference on Measurement and Modeling of Computer Systems, 71–72.","ama":"Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. Input-dynamic distributed algorithms for communication networks. In: <i>Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems</i>. Association for Computing Machinery; 2021:71-72. doi:<a href=\"https://doi.org/10.1145/3410220.3453923\">10.1145/3410220.3453923</a>"},"publisher":"Association for Computing Machinery","quality_controlled":"1","oa_version":"Preprint","language":[{"iso":"eng"}],"date_updated":"2025-04-14T13:52:09Z","doi":"10.1145/3410220.3453923","acknowledgement":"We thank Jukka Suomela for discussions. We also thank our shepherd Mohammad Hajiesmaili and the reviewers for their time and suggestions on how to improve the paper. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML), from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska–Curie grant agreement No. 840605, from the Vienna Science and Technology Fund (WWTF) project WHATIF, ICT19-045, 2020-2024, and from the Austrian Science Fund (FWF) and netIDEE SCIENCE project P 33775-N.","scopus_import":"1","year":"2021","publication":"Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems","date_published":"2021-05-01T00:00:00Z","project":[{"_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223","call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning"},{"_id":"26A5D39A-B435-11E9-9278-68D0E5697425","grant_number":"840605","call_identifier":"H2020","name":"Coordination in constrained and natural distributed systems"}],"author":[{"last_name":"Foerster","full_name":"Foerster, Klaus-Tycho","first_name":"Klaus-Tycho"},{"last_name":"Korhonen","id":"C5402D42-15BC-11E9-A202-CA2BE6697425","full_name":"Korhonen, Janne","first_name":"Janne"},{"full_name":"Paz, Ami","first_name":"Ami","last_name":"Paz"},{"last_name":"Rybicki","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6432-6646","first_name":"Joel","full_name":"Rybicki, Joel"},{"last_name":"Schmid","full_name":"Schmid, Stefan","first_name":"Stefan"}],"title":"Input-dynamic distributed algorithms for communication networks","date_created":"2022-03-18T08:48:41Z","ec_funded":1,"publication_identifier":{"isbn":["9781450380720"]},"day":"01","status":"public","main_file_link":[{"url":"https://arxiv.org/abs/2005.07637","open_access":"1"}],"publication_status":"published","external_id":{"arxiv":["2005.07637"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"DaAl"}],"article_processing_charge":"No"},{"article_type":"original","project":[{"call_identifier":"H2020","name":"Coordination in constrained and natural distributed systems","_id":"26A5D39A-B435-11E9-9278-68D0E5697425","grant_number":"840605"},{"name":"Elastic Coordination for Scalable Machine Learning","call_identifier":"H2020","_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223"}],"date_published":"2021-03-01T00:00:00Z","issue":"1","ec_funded":1,"author":[{"last_name":"Foerster","first_name":"Klaus-Tycho","full_name":"Foerster, Klaus-Tycho"},{"last_name":"Korhonen","id":"C5402D42-15BC-11E9-A202-CA2BE6697425","full_name":"Korhonen, Janne","first_name":"Janne"},{"last_name":"Paz","full_name":"Paz, Ami","first_name":"Ami"},{"first_name":"Joel","full_name":"Rybicki, Joel","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","last_name":"Rybicki","orcid":"0000-0002-6432-6646"},{"first_name":"Stefan","full_name":"Schmid, Stefan","last_name":"Schmid"}],"date_created":"2022-03-18T09:10:27Z","title":"Input-dynamic distributed algorithms for communication networks","intvolume":"         5","doi":"10.1145/3447384","acknowledgement":"We thank Jukka Suomela for discussions. We also thank our shepherd Mohammad Hajiesmaili\r\nand the reviewers for their time and suggestions on how to improve the paper. This project\r\nhas received funding from the European Research Council (ERC) under the European Union’s\r\nHorizon 2020 research and innovation programme (grant agreement No 805223 ScaleML), from the European Union’s Horizon 2020 research and innovation programme under the Marie\r\nSk lodowska–Curie grant agreement No. 840605, from the Vienna Science and Technology Fund (WWTF) project WHATIF, ICT19-045, 2020-2024, and from the Austrian Science Fund (FWF) and netIDEE SCIENCE project P 33775-N.","volume":5,"year":"2021","publication":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2005.07637"}],"status":"public","day":"01","publication_identifier":{"issn":["2476-1249"]},"department":[{"_id":"DaAl"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","external_id":{"arxiv":["2005.07637"]},"publication_status":"published","abstract":[{"lang":"eng","text":"Consider a distributed task where the communication network is fixed but the local inputs given to the nodes of the distributed system may change over time. In this work, we explore the following question: if some of the local inputs change, can an existing solution be updated efficiently, in a dynamic and distributed manner? To address this question, we define the batch dynamic \\congest model in which we are given a bandwidth-limited communication network and a dynamic edge labelling defines the problem input. The task is to maintain a solution to a graph problem on the labeled graph under batch changes. We investigate, when a batch of α edge label changes arrive, \\beginitemize \\item how much time as a function of α we need to update an existing solution, and \\item how much information the nodes have to keep in local memory between batches in order to update the solution quickly. \\enditemize Our work lays the foundations for the theory of input-dynamic distributed network algorithms. We give a general picture of the complexity landscape in this model, design both universal algorithms and algorithms for concrete problems, and present a general framework for lower bounds. In particular, we derive non-trivial upper bounds for two selected, contrasting problems: maintaining a minimum spanning tree and detecting cliques."}],"keyword":["Computer Networks and Communications","Hardware and Architecture","Safety","Risk","Reliability and Quality","Computer Science (miscellaneous)"],"_id":"10855","type":"journal_article","citation":{"mla":"Foerster, Klaus-Tycho, et al. “Input-Dynamic Distributed Algorithms for Communication Networks.” <i>Proceedings of the ACM on Measurement and Analysis of Computing Systems</i>, vol. 5, no. 1, Association for Computing Machinery, 2021, pp. 1–33, doi:<a href=\"https://doi.org/10.1145/3447384\">10.1145/3447384</a>.","ieee":"K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, and S. Schmid, “Input-dynamic distributed algorithms for communication networks,” <i>Proceedings of the ACM on Measurement and Analysis of Computing Systems</i>, vol. 5, no. 1. Association for Computing Machinery, pp. 1–33, 2021.","ista":"Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. 2021. Input-dynamic distributed algorithms for communication networks. Proceedings of the ACM on Measurement and Analysis of Computing Systems. 5(1), 1–33.","chicago":"Foerster, Klaus-Tycho, Janne Korhonen, Ami Paz, Joel Rybicki, and Stefan Schmid. “Input-Dynamic Distributed Algorithms for Communication Networks.” <i>Proceedings of the ACM on Measurement and Analysis of Computing Systems</i>. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3447384\">https://doi.org/10.1145/3447384</a>.","ama":"Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. Input-dynamic distributed algorithms for communication networks. <i>Proceedings of the ACM on Measurement and Analysis of Computing Systems</i>. 2021;5(1):1-33. doi:<a href=\"https://doi.org/10.1145/3447384\">10.1145/3447384</a>","apa":"Foerster, K.-T., Korhonen, J., Paz, A., Rybicki, J., &#38; Schmid, S. (2021). Input-dynamic distributed algorithms for communication networks. <i>Proceedings of the ACM on Measurement and Analysis of Computing Systems</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3447384\">https://doi.org/10.1145/3447384</a>","short":"K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, S. Schmid, Proceedings of the ACM on Measurement and Analysis of Computing Systems 5 (2021) 1–33."},"related_material":{"record":[{"relation":"shorter_version","status":"public","id":"10854"}]},"month":"03","oa":1,"page":"1-33","arxiv":1,"oa_version":"Preprint","quality_controlled":"1","publisher":"Association for Computing Machinery","date_updated":"2025-04-14T13:52:09Z","language":[{"iso":"eng"}]}]