[{"language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.FSTTCS.2021.42","ddc":["000"],"citation":{"short":"K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, in:, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.","ama":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Quantitative verification on product graphs of small treewidth. 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.42\">10.4230/LIPIcs.FSTTCS.2021.42</a>","apa":"Chatterjee, K., Ibsen-Jensen, R., &#38; Pavlogiannis, A. (2021). Quantitative verification on product graphs of small treewidth. 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.42\">https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42</a>","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Quantitative Verification on Product Graphs of Small Treewidth.” 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.42\">https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42</a>.","ista":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2021. Quantitative verification on product graphs of small treewidth. 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, 42.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Quantitative verification on product graphs of small treewidth,” in <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, Virtual, 2021, vol. 213.","mla":"Chatterjee, Krishnendu, et al. “Quantitative Verification on Product Graphs of Small Treewidth.” <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, vol. 213, 42, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42\">10.4230/LIPIcs.FSTTCS.2021.42</a>."},"conference":{"location":"Virtual","start_date":"2021-12-15","end_date":"2021-12-17","name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science"},"title":"Quantitative verification on product graphs of small treewidth","day":"29","alternative_title":["LIPIcs"],"author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389"},{"last_name":"Pavlogiannis","full_name":"Pavlogiannis, Andreas","first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722"}],"type":"conference","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","department":[{"_id":"KrCh"}],"publication":"41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science","status":"public","intvolume":"       213","month":"11","date_created":"2022-01-16T23:01:28Z","date_updated":"2022-01-17T10:39:40Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","scopus_import":"1","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-9597-7215-0"]},"oa_version":"Published Version","year":"2021","has_accepted_license":"1","publication_status":"published","oa":1,"file_date_updated":"2022-01-17T10:36:08Z","volume":213,"tmp":{"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","short":"CC BY (4.0)"},"article_processing_charge":"No","article_number":"42","file":[{"checksum":"71141acdeffa9056f24d6dbef952d254","access_level":"open_access","date_updated":"2022-01-17T10:36:08Z","file_size":891566,"creator":"cchlebak","file_name":"2021_LIPIcs_Chatterjee.pdf","date_created":"2022-01-17T10:36:08Z","success":1,"file_id":"10633","relation":"main_file","content_type":"application/pdf"}],"_id":"10629","abstract":[{"lang":"eng","text":"Product graphs arise naturally in formal verification and program analysis. For example, the analysis of two concurrent threads requires the product of two component control-flow graphs, and for language inclusion of deterministic automata the product of two automata is constructed. In many cases, the component graphs have constant treewidth, e.g., when the input contains control-flow graphs of programs. We consider the algorithmic analysis of products of two constant-treewidth graphs with respect to three classic specification languages, namely, (a) algebraic properties, (b) mean-payoff properties, and (c) initial credit for energy properties.\r\nOur main contributions are as follows. Consider a graph G that is the product of two constant-treewidth graphs of size n each. First, given an idempotent semiring, we present an algorithm that computes the semiring transitive closure of G in time Õ(n⁴). Since the output has size Θ(n⁴), our algorithm is optimal (up to polylog factors). Second, given a mean-payoff objective, we present an O(n³)-time algorithm for deciding whether the value of a starting state is non-negative, improving the previously known O(n⁴) bound. Third, given an initial credit for energy objective, we present an O(n⁵)-time algorithm for computing the minimum initial credit for all nodes of G, improving the previously known O(n⁸) bound. At the heart of our approach lies an algorithm for the efficient construction of strongly-balanced tree decompositions of constant-treewidth graphs. Given a constant-treewidth graph G' of n nodes and a positive integer λ, our algorithm constructs a binary tree decomposition of G' of width O(λ) with the property that the size of each subtree decreases geometrically with rate (1/2 + 2^{-λ})."}],"date_published":"2021-11-29T00:00:00Z"},{"file":[{"relation":"main_file","file_id":"10634","content_type":"application/pdf","success":1,"date_created":"2022-01-17T10:49:03Z","file_size":844224,"creator":"cchlebak","file_name":"2021_LIPIcs_Arrighi.pdf","access_level":"open_access","date_updated":"2022-01-17T10:49:03Z","checksum":"d5a82ba893c3bc5da5914edbb3efb92b"}],"article_number":"34","_id":"10630","date_published":"2021-11-29T00:00:00Z","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."}],"arxiv":1,"article_processing_charge":"No","file_date_updated":"2022-01-17T10:49:03Z","tmp":{"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","short":"CC BY (4.0)"},"volume":213,"publication_status":"published","oa":1,"oa_version":"Published Version","has_accepted_license":"1","year":"2021","scopus_import":"1","external_id":{"arxiv":["2110.01279"]},"date_updated":"2022-01-17T10:56:19Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","publication_identifier":{"isbn":["978-3-9597-7215-0"],"issn":["1868-8969"]},"month":"11","date_created":"2022-01-16T23:01:29Z","publication":"41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science","department":[{"_id":"KrCh"}],"quality_controlled":"1","intvolume":"       213","status":"public","publisher":"Schloss Dagstuhl - Leibniz Zentrum für Informatik","day":"29","type":"conference","author":[{"last_name":"Arrighi","full_name":"Arrighi, Emmanuel","first_name":"Emmanuel"},{"full_name":"Fernau, Henning","first_name":"Henning","last_name":"Fernau"},{"full_name":"Hoffmann, Stefan","first_name":"Stefan","last_name":"Hoffmann"},{"first_name":"Markus","full_name":"Holzer, Markus","last_name":"Holzer"},{"id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","last_name":"Jecker","full_name":"Jecker, Ismael R","first_name":"Ismael R"},{"first_name":"Mateus","full_name":"De Oliveira Oliveira, Mateus","last_name":"De Oliveira Oliveira"},{"last_name":"Wolf","full_name":"Wolf, Petra","first_name":"Petra"}],"alternative_title":["LIPIcs"],"citation":{"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>","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>","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.","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>.","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>.","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.","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."},"ec_funded":1,"title":"On the complexity of intersection non-emptiness for star-free language classes","conference":{"name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science","start_date":"2021-12-15","end_date":"2021-12-17","location":"Virtual"},"language":[{"iso":"eng"}],"ddc":["000"],"doi":"10.4230/LIPIcs.FSTTCS.2021.34","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships"}],"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"},{"_id":"10631","date_published":"2021-12-30T00:00:00Z","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"}],"article_number":"L061303","issue":"6","article_processing_charge":"No","arxiv":1,"volume":104,"oa":1,"main_file_link":[{"open_access":"1","url":"http://128.84.4.18/abs/2107.00468"}],"publication_status":"published","oa_version":"Preprint","year":"2021","article_type":"original","publication_identifier":{"eissn":["2469-9934"],"issn":["2469-9926"]},"date_updated":"2024-08-07T07:16:52Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","scopus_import":"1","external_id":{"arxiv":["2107.00468"],"isi":["000739618300001"]},"date_created":"2022-01-16T23:01:29Z","month":"12","status":"public","intvolume":"       104","quality_controlled":"1","department":[{"_id":"MiLe"}],"publication":"Physical Review A","isi":1,"publisher":"American Physical Society","type":"journal_article","author":[{"id":"339C7E5A-F248-11E8-B48F-1D18A9856A87","last_name":"Cherepanov","first_name":"Igor","full_name":"Cherepanov, Igor"},{"orcid":"0000-0001-8823-9777","id":"4CA96FD4-F248-11E8-B48F-1D18A9856A87","last_name":"Bighin","first_name":"Giacomo","full_name":"Bighin, Giacomo"},{"full_name":"Schouder, Constant A.","first_name":"Constant A.","last_name":"Schouder"},{"full_name":"Chatterley, Adam S.","first_name":"Adam S.","last_name":"Chatterley"},{"last_name":"Albrechtsen","first_name":"Simon H.","full_name":"Albrechtsen, Simon H."},{"last_name":"Muñoz","first_name":"Alberto Viñas","full_name":"Muñoz, Alberto Viñas"},{"last_name":"Christiansen","full_name":"Christiansen, Lars","first_name":"Lars"},{"last_name":"Stapelfeldt","full_name":"Stapelfeldt, Henrik","first_name":"Henrik"},{"orcid":"0000-0002-6990-7802","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","last_name":"Lemeshko","first_name":"Mikhail","full_name":"Lemeshko, Mikhail"}],"day":"30","title":"Excited rotational states of molecules in a superfluid","ec_funded":1,"citation":{"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).","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>","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.","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.","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>.","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>."},"doi":"10.1103/PhysRevA.104.L061303","language":[{"iso":"eng"}],"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.","project":[{"_id":"26031614-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P29902","name":"Quantum rotations in the presence of a many-body environment"},{"grant_number":"801770","name":"Angulon: physics and applications of a new quasiparticle","_id":"2688CF98-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"grant_number":"665385","name":"International IST Doctoral Program","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"},{"name":"A path-integral approach to composite impurities","grant_number":"M02641","call_identifier":"FWF","_id":"26986C82-B435-11E9-9278-68D0E5697425"}]},{"month":"12","date_created":"2022-01-17T11:12:40Z","department":[{"_id":"GradSch"},{"_id":"JoCs"}],"quality_controlled":"1","publication":"Peer Community Journal","intvolume":"         1","status":"public","publisher":"Centre Mersenne ; Peer Community In","day":"15","author":[{"last_name":"Nardin","first_name":"Michele","full_name":"Nardin, Michele","id":"30BD0376-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8849-6570"},{"full_name":"Phillips, James W.","first_name":"James W.","last_name":"Phillips"},{"last_name":"Podlaski","first_name":"William F.","full_name":"Podlaski, William F."},{"last_name":"Keemink","full_name":"Keemink, Sander W.","first_name":"Sander W."}],"type":"journal_article","ec_funded":1,"citation":{"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. Centre Mersenne ; Peer Community In, 2021.","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>. Centre Mersenne ; Peer Community In, 2021. <a href=\"https://doi.org/10.24072/pcjournal.69\">https://doi.org/10.24072/pcjournal.69</a>.","mla":"Nardin, Michele, et al. “Nonlinear Computations in Spiking Neural Networks through Multiplicative Synapses.” <i>Peer Community Journal</i>, vol. 1, e68, Centre Mersenne ; Peer Community In, 2021, doi:<a href=\"https://doi.org/10.24072/pcjournal.69\">10.24072/pcjournal.69</a>.","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>. Centre Mersenne ; 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>"},"title":"Nonlinear computations in spiking neural networks through multiplicative synapses","language":[{"iso":"eng"}],"doi":"10.24072/pcjournal.69","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","project":[{"call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","name":"International IST Doctoral Program"}],"file":[{"success":1,"date_created":"2022-01-17T11:15:26Z","content_type":"application/pdf","file_id":"10636","relation":"main_file","date_updated":"2022-01-17T11:15:26Z","access_level":"open_access","checksum":"cd9af6b331918608f2e3d1c7940cbf4f","file_name":"10_24072_pcjournal_69.pdf","file_size":3311494,"creator":"mnardin"}],"article_number":"e68","date_published":"2021-12-15T00:00:00Z","_id":"10635","abstract":[{"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.","lang":"eng"}],"arxiv":1,"article_processing_charge":"No","file_date_updated":"2022-01-17T11:15:26Z","volume":1,"tmp":{"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","short":"CC BY (4.0)"},"publication_status":"published","oa":1,"article_type":"original","year":"2021","oa_version":"Published Version","has_accepted_license":"1","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_updated":"2022-01-17T13:30:01Z","external_id":{"arxiv":["2009.03857"]},"publication_identifier":{"eissn":["2804-3871"]}},{"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","language":[{"iso":"eng"}],"date_updated":"2022-01-19T09:11:33Z","keyword":["Application note"],"citation":{"ieee":"R. Lake, S. Simbierowicz, P. Krantz, F. Hassani, and J. M. Fink, <i>The Bluefors dilution refrigerator as an integrated quantum measurement system</i>. Helsinki, Finland: Bluefors Oy, 2021.","ista":"Lake R, Simbierowicz S, Krantz P, Hassani F, Fink JM. 2021. The Bluefors dilution refrigerator as an integrated quantum measurement system, Helsinki, Finland: Bluefors Oy, 9p.","chicago":"Lake, Russell, Slawomir Simbierowicz, Philip Krantz, Farid Hassani, and Johannes M Fink. <i>The Bluefors Dilution Refrigerator as an Integrated Quantum Measurement System</i>. Helsinki, Finland: Bluefors Oy, 2021.","mla":"Lake, Russell, et al. <i>The Bluefors Dilution Refrigerator as an Integrated Quantum Measurement System</i>. Bluefors Oy, 2021.","short":"R. Lake, S. Simbierowicz, P. Krantz, F. Hassani, J.M. Fink, The Bluefors Dilution Refrigerator as an Integrated Quantum Measurement System, Bluefors Oy, Helsinki, Finland, 2021.","apa":"Lake, R., Simbierowicz, S., Krantz, P., Hassani, F., &#38; Fink, J. M. (2021). <i>The Bluefors dilution refrigerator as an integrated quantum measurement system</i>. Helsinki, Finland: Bluefors Oy.","ama":"Lake R, Simbierowicz S, Krantz P, Hassani F, Fink JM. <i>The Bluefors Dilution Refrigerator as an Integrated Quantum Measurement System</i>. Helsinki, Finland: Bluefors Oy; 2021."},"title":"The Bluefors dilution refrigerator as an integrated quantum measurement system","day":"20","alternative_title":["Bluefors Blog"],"year":"2021","oa_version":"Published Version","type":"other_academic_publication","author":[{"last_name":"Lake","full_name":"Lake, Russell","first_name":"Russell"},{"last_name":"Simbierowicz","full_name":"Simbierowicz, Slawomir","first_name":"Slawomir"},{"full_name":"Krantz, Philip","first_name":"Philip","last_name":"Krantz"},{"first_name":"Farid","full_name":"Hassani, Farid","last_name":"Hassani","id":"2AED110C-F248-11E8-B48F-1D18A9856A87"},{"id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8112-028X","last_name":"Fink","full_name":"Fink, Johannes M","first_name":"Johannes M"}],"publication_status":"published","publisher":"Bluefors Oy","main_file_link":[{"url":"https://bluefors.com/blog/integrated-quantum-measurement-system/","open_access":"1"}],"oa":1,"quality_controlled":"1","department":[{"_id":"JoFi"}],"status":"public","page":"9","article_processing_charge":"No","place":"Helsinki, Finland","month":"04","abstract":[{"text":"The purpose of this application note is to demonstrate a working example of a superconducting qubit measurement in a Bluefors cryostat using the Keysight quantum control hardware. Our motivation is twofold. First, we provide pre-qualification data that the Bluefors cryostat, including filtering and wiring, can support long-lived qubits. Second, we demonstrate that the Keysight system (controlled using Labber) provides a straightforward solution to perform these characterization measurements. This document is intended as a brief guide for starting an experimental platform for testing superconducting qubits. The setup described here is an immediate jumping off point for a suite of applications including testing quantum logical gates, quantum optics with microwaves, or even using the qubit itself as a sensitive probe of local electromagnetic fields. Qubit measurements rely on high performance of both the physical sample environment and the measurement electronics. An overview of the cryogenic system is shown in Figure 1, and an overview of the integration between the electronics and cryostat (including wiring details) is shown in Figure 2.","lang":"eng"}],"_id":"10644","date_published":"2021-04-20T00:00:00Z","date_created":"2022-01-19T08:29:57Z"},{"date_updated":"2022-01-19T09:11:39Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","language":[{"iso":"eng"}],"keyword":["Application note"],"day":"03","oa_version":"Published Version","alternative_title":["Bluefors Blog"],"year":"2021","type":"other_academic_publication","author":[{"last_name":"Simbierowicz","full_name":"Simbierowicz, Slawomir","first_name":"Slawomir"},{"full_name":"Shi, Chunyan","first_name":"Chunyan","last_name":"Shi"},{"full_name":"Collodo, Michele","first_name":"Michele","last_name":"Collodo"},{"full_name":"Kirste, Moritz","first_name":"Moritz","last_name":"Kirste"},{"id":"2AED110C-F248-11E8-B48F-1D18A9856A87","first_name":"Farid","full_name":"Hassani, Farid","last_name":"Hassani"},{"id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8112-028X","full_name":"Fink, Johannes M","first_name":"Johannes M","last_name":"Fink"},{"full_name":"Bylander, Jonas","first_name":"Jonas","last_name":"Bylander"},{"full_name":"Perez Lozano, Daniel","first_name":"Daniel","last_name":"Perez Lozano"},{"last_name":"Lake","full_name":"Lake, Russell","first_name":"Russell"}],"citation":{"mla":"Simbierowicz, Slawomir, et al. <i>Qubit Energy-Relaxation Statistics in the Bluefors Quantum Measurement System</i>. Bluefors Oy, 2021.","chicago":"Simbierowicz, Slawomir, Chunyan Shi, Michele Collodo, Moritz Kirste, Farid Hassani, Johannes M Fink, Jonas Bylander, Daniel Perez Lozano, and Russell Lake. <i>Qubit Energy-Relaxation Statistics in the Bluefors Quantum Measurement System</i>. Helsinki, Finland: Bluefors Oy, 2021.","ista":"Simbierowicz S, Shi C, Collodo M, Kirste M, Hassani F, Fink JM, Bylander J, Perez Lozano D, Lake R. 2021. Qubit energy-relaxation statistics in the Bluefors quantum measurement system, Helsinki, Finland: Bluefors Oy, 8p.","ieee":"S. Simbierowicz <i>et al.</i>, <i>Qubit energy-relaxation statistics in the Bluefors quantum measurement system</i>. Helsinki, Finland: Bluefors Oy, 2021.","ama":"Simbierowicz S, Shi C, Collodo M, et al. <i>Qubit Energy-Relaxation Statistics in the Bluefors Quantum Measurement System</i>. Helsinki, Finland: Bluefors Oy; 2021.","apa":"Simbierowicz, S., Shi, C., Collodo, M., Kirste, M., Hassani, F., Fink, J. M., … Lake, R. (2021). <i>Qubit energy-relaxation statistics in the Bluefors quantum measurement system</i>. Helsinki, Finland: Bluefors Oy.","short":"S. Simbierowicz, C. Shi, M. Collodo, M. Kirste, F. Hassani, J.M. Fink, J. Bylander, D. Perez Lozano, R. Lake, Qubit Energy-Relaxation Statistics in the Bluefors Quantum Measurement System, Bluefors Oy, Helsinki, Finland, 2021."},"title":"Qubit energy-relaxation statistics in the Bluefors quantum measurement system","quality_controlled":"1","department":[{"_id":"JoFi"}],"status":"public","publication_status":"published","publisher":"Bluefors Oy","oa":1,"main_file_link":[{"open_access":"1","url":"https://bluefors.com/blog/application-note-qubit-energy-relaxation-statistics-bluefors-quantum-measurement-system/"}],"place":"Helsinki, Finland","month":"06","_id":"10645","abstract":[{"text":"Superconducting qubits have emerged as a highly versatile and useful platform for quantum technological applications [1]. Bluefors and Zurich Instruments have supported the growth of this field from the 2010s onwards by providing well-engineered and reliable measurement infrastructure [2]– [6]. Having a long and stable qubit lifetime is a critical system property. Therefore, considerable effort has already gone into measuring qubit energy-relaxation timescales and their fluctuations, see Refs. [7]–[10] among others. Accurately extracting the statistics of a quantum device requires users to perform time consuming measurements. One measurement challenge is that the detection of the state-dependent\r\nresponse of a superconducting resonator due to a dispersively-coupled qubit requires an inherently low signal level. Consequently, measurements must be performed using a microwave probe that contains only a few microwave photons. Improving the signal-to-noise ratio (SNR) by using near-quantum limited parametric amplifiers as well as the use of optimized signal processing enabled by efficient room temperature instrumentation help to reduce measurement time. An empirical observation for fixed frequency transmons from recent literature is that as the energy-relaxation time 𝑇𝑇1 increases, so do its natural temporal fluctuations [7], [10]. This necessitates many repeated measurements to understand the statistics (see for example, Ref. [10]). In addition, as state-of-the-art qubits increase in lifetime, longer\r\nmeasurement times are expected to obtain accurate statistics. As described below, the scaling of the widths of the qubit energy-relaxation distributions also reveal clues about the origin of the energy-relaxation.","lang":"eng"}],"date_published":"2021-06-03T00:00:00Z","date_created":"2022-01-19T08:41:14Z","page":"8","article_processing_charge":"No"},{"title":"Imaging and controlling vortex dynamics in mesoscopic superconductor-normal-metal-superconductor arrays","citation":{"short":"T.R. Naibert, H. Polshyn, R. Garrido-Menacho, M. Durkin, B. Wolin, V. Chua, I. Mondragon-Shem, T. Hughes, N. Mason, R. Budakian, Physical Review B 103 (2021).","apa":"Naibert, T. R., Polshyn, H., Garrido-Menacho, R., Durkin, M., Wolin, B., Chua, V., … Budakian, R. (2021). Imaging and controlling vortex dynamics in mesoscopic superconductor-normal-metal-superconductor arrays. <i>Physical Review B</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevb.103.224526\">https://doi.org/10.1103/physrevb.103.224526</a>","ama":"Naibert TR, Polshyn H, Garrido-Menacho R, et al. Imaging and controlling vortex dynamics in mesoscopic superconductor-normal-metal-superconductor arrays. <i>Physical Review B</i>. 2021;103(22). doi:<a href=\"https://doi.org/10.1103/physrevb.103.224526\">10.1103/physrevb.103.224526</a>","ieee":"T. R. Naibert <i>et al.</i>, “Imaging and controlling vortex dynamics in mesoscopic superconductor-normal-metal-superconductor arrays,” <i>Physical Review B</i>, vol. 103, no. 22. American Physical Society, 2021.","ista":"Naibert TR, Polshyn H, Garrido-Menacho R, Durkin M, Wolin B, Chua V, Mondragon-Shem I, Hughes T, Mason N, Budakian R. 2021. Imaging and controlling vortex dynamics in mesoscopic superconductor-normal-metal-superconductor arrays. Physical Review B. 103(22), 224526.","chicago":"Naibert, Tyler R., Hryhoriy Polshyn, Rita Garrido-Menacho, Malcolm Durkin, Brian Wolin, Victor Chua, Ian Mondragon-Shem, Taylor Hughes, Nadya Mason, and Raffi Budakian. “Imaging and Controlling Vortex Dynamics in Mesoscopic Superconductor-Normal-Metal-Superconductor Arrays.” <i>Physical Review B</i>. American Physical Society, 2021. <a href=\"https://doi.org/10.1103/physrevb.103.224526\">https://doi.org/10.1103/physrevb.103.224526</a>.","mla":"Naibert, Tyler R., et al. “Imaging and Controlling Vortex Dynamics in Mesoscopic Superconductor-Normal-Metal-Superconductor Arrays.” <i>Physical Review B</i>, vol. 103, no. 22, 224526, American Physical Society, 2021, doi:<a href=\"https://doi.org/10.1103/physrevb.103.224526\">10.1103/physrevb.103.224526</a>."},"author":[{"last_name":"Naibert","first_name":"Tyler R.","full_name":"Naibert, Tyler R."},{"first_name":"Hryhoriy","full_name":"Polshyn, Hryhoriy","last_name":"Polshyn","id":"edfc7cb1-526e-11ec-b05a-e6ecc27e4e48","orcid":"0000-0001-8223-8896"},{"last_name":"Garrido-Menacho","full_name":"Garrido-Menacho, Rita","first_name":"Rita"},{"last_name":"Durkin","full_name":"Durkin, Malcolm","first_name":"Malcolm"},{"last_name":"Wolin","full_name":"Wolin, Brian","first_name":"Brian"},{"last_name":"Chua","first_name":"Victor","full_name":"Chua, Victor"},{"full_name":"Mondragon-Shem, Ian","first_name":"Ian","last_name":"Mondragon-Shem"},{"full_name":"Hughes, Taylor","first_name":"Taylor","last_name":"Hughes"},{"first_name":"Nadya","full_name":"Mason, Nadya","last_name":"Mason"},{"full_name":"Budakian, Raffi","first_name":"Raffi","last_name":"Budakian"}],"type":"journal_article","day":"24","acknowledgement":"This work was supported by the Department of Energy (DOE) Basic Energy Sciences under Grant No. DE-SC0012649 and the National Science Foundation (NSF) under Grant No. DMR 17-10437. V.C. was supported by the Gordon and Betty Moore Foundation EPiQS Initiative through Grant No. GBMF4305. N.M. also acknowledges support from DOE-EFRC under Grant No. DE-SC0021238 for analysis/manuscript preparation. This research was carried out in part in the Materials Research Laboratory Central Research Facilities, University of Illinois.","doi":"10.1103/physrevb.103.224526","language":[{"iso":"eng"}],"date_created":"2022-01-20T09:39:40Z","extern":"1","month":"06","publisher":"American Physical Society","status":"public","intvolume":"       103","quality_controlled":"1","publication":"Physical Review B","oa_version":"Preprint","year":"2021","article_type":"original","publication_identifier":{"issn":["2469-9950"],"eissn":["2469-9969"]},"date_updated":"2022-01-24T08:25:18Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","external_id":{"arxiv":["1705.08956"]},"issue":"22","article_processing_charge":"No","arxiv":1,"_id":"10649","date_published":"2021-06-24T00:00:00Z","abstract":[{"lang":"eng","text":"Harnessing the properties of vortices in superconductors is crucial for fundamental science and technological applications; thus, it has been an ongoing goal to locally probe and control vortices. Here, we use a scanning probe technique that enables studies of vortex dynamics in superconducting systems by leveraging the resonant behavior of a raster-scanned, magnetic-tipped cantilever. This experimental setup allows us to image and control vortices, as well as extract key energy scales of the vortex interactions. Applying this technique to lattices of superconductor island arrays on a metal, we obtain a variety of striking spatial patterns that encode information about the energy landscape for vortices in the system. We interpret these patterns in terms of local vortex dynamics and extract the relative strengths of the characteristic energy scales in the system, such as the vortex-magnetic field and vortex-vortex interaction strengths, as well as the vortex chemical potential. We also demonstrate that the relative strengths of the interactions can be tuned and show how these interactions shift with an applied bias. The high degree of tunability and local nature of such vortex imaging and control not only enable new understanding of vortex interactions, but also have potential applications in more complex systems such as those relevant to quantum computing."}],"article_number":"224526","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1705.08956","open_access":"1"}],"publication_status":"published","volume":103},{"year":"2021","oa_version":"None","publication_identifier":{"issn":["0003-0503"]},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_updated":"2022-01-27T09:37:51Z","article_processing_charge":"No","issue":"1","abstract":[{"lang":"eng","text":"Electrons in the moiré flat bands of magic angle twisted bilayer graphene aligned to hexagonal boron nitride can break time reversal symmetry and open an interaction-driven, topological gap. The resulting magnetic order and associated quantized anomalous Hall effect have properties that diverge substantially from quantized anomalous Hall effects observed in other systems. I will present transport data and scanning probe magnetometry data acquired using a nanoSQUID-on-tip microscope. A quantitative analysis of the magnitude of the magnetization of the Chern magnet shows that the magnetic moment per moiré unit cell substantially exceeds 1 μB and grows rapidly in the topological gap, consistent with an orbital origin for the magnetic order. We find that the Barkhausen jumps observed in transport measurements can be mapped directly to microscopic motion of ferromagnetic domain walls. These domain walls are strongly pinned to disorder in the device and are reproducible across thermal cycles, suggesting coupling between the magnetic degrees of freedom and structural inhomogeneity."}],"_id":"10651","date_published":"2021-03-01T00:00:00Z","article_number":"L42.00012","oa":1,"main_file_link":[{"open_access":"1","url":"https://meetings.aps.org/Meeting/MAR21/Session/L42.12"}],"publication_status":"published","volume":66,"title":"Probing orbital Chern ferromagnet phase in twisted bilayer graphene","conference":{"location":"Virtual, United States","name":"APS: American Physical Society","end_date":"2021-03-19","start_date":"2021-03-15"},"citation":{"mla":"Tschirhart, Charles, et al. “Probing Orbital Chern Ferromagnet Phase in Twisted Bilayer Graphene.” <i>APS March Meeting 2021</i>, vol. 66, no. 1, L42.00012, American Physical Society, 2021.","ieee":"C. Tschirhart <i>et al.</i>, “Probing orbital Chern ferromagnet phase in twisted bilayer graphene,” in <i>APS March Meeting 2021</i>, Virtual, United States, 2021, vol. 66, no. 1.","ista":"Tschirhart C, Serlin M, Polshyn H, Shragai AG, Xia Z, Zhu J, Zhang Y, Watanabe K, Taniguchi T, Huber ME, Young A. 2021. Probing orbital Chern ferromagnet phase in twisted bilayer graphene. APS March Meeting 2021. APS: American Physical Society, Bulletin of the American Physical Society, vol. 66, L42.00012.","chicago":"Tschirhart, Charles, Marec Serlin, Hryhoriy Polshyn, Avi G. Shragai, Zhengchao Xia, Jiacheng Zhu, Yuxuan Zhang, et al. “Probing Orbital Chern Ferromagnet Phase in Twisted Bilayer Graphene.” In <i>APS March Meeting 2021</i>, Vol. 66. American Physical Society, 2021.","apa":"Tschirhart, C., Serlin, M., Polshyn, H., Shragai, A. G., Xia, Z., Zhu, J., … Young, A. (2021). Probing orbital Chern ferromagnet phase in twisted bilayer graphene. In <i>APS March Meeting 2021</i> (Vol. 66). Virtual, United States: American Physical Society.","ama":"Tschirhart C, Serlin M, Polshyn H, et al. Probing orbital Chern ferromagnet phase in twisted bilayer graphene. In: <i>APS March Meeting 2021</i>. Vol 66. American Physical Society; 2021.","short":"C. Tschirhart, M. Serlin, H. Polshyn, A.G. Shragai, Z. Xia, J. Zhu, Y. Zhang, K. Watanabe, T. Taniguchi, M.E. Huber, A. Young, in:, APS March Meeting 2021, American Physical Society, 2021."},"type":"conference","author":[{"last_name":"Tschirhart","first_name":"Charles","full_name":"Tschirhart, Charles"},{"last_name":"Serlin","full_name":"Serlin, Marec","first_name":"Marec"},{"last_name":"Polshyn","first_name":"Hryhoriy","full_name":"Polshyn, Hryhoriy","id":"edfc7cb1-526e-11ec-b05a-e6ecc27e4e48","orcid":"0000-0001-8223-8896"},{"full_name":"Shragai, Avi G.","first_name":"Avi G.","last_name":"Shragai"},{"full_name":"Xia, Zhengchao","first_name":"Zhengchao","last_name":"Xia"},{"last_name":"Zhu","first_name":"Jiacheng","full_name":"Zhu, Jiacheng"},{"last_name":"Zhang","first_name":"Yuxuan","full_name":"Zhang, Yuxuan"},{"last_name":"Watanabe","first_name":"Kenji","full_name":"Watanabe, Kenji"},{"last_name":"Taniguchi","full_name":"Taniguchi, Takashi","first_name":"Takashi"},{"last_name":"Huber","first_name":"Martin E.","full_name":"Huber, Martin E."},{"first_name":"Andrea","full_name":"Young, Andrea","last_name":"Young"}],"alternative_title":["Bulletin of the American Physical Society"],"day":"01","acknowledgement":"I acknowledge and appreciate support from the Hertz Foundation and from the National Science Foundation Graduate Research Fellowship Program under grant 1650114.","language":[{"iso":"eng"}],"date_created":"2022-01-20T15:43:16Z","month":"03","extern":"1","publisher":"American Physical Society","intvolume":"        66","status":"public","publication":"APS March Meeting 2021","quality_controlled":"1"},{"page":"210-224","month":"12","date_created":"2022-01-23T23:01:28Z","publisher":"Elsevier","isi":1,"department":[{"_id":"SaSi"},{"_id":"SiHi"}],"quality_controlled":"1","publication":"Molecular Therapy - Methods and Clinical Development","status":"public","intvolume":"        23","ec_funded":1,"citation":{"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>","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.","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>.","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.","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>."},"title":"Optimizing AAV2/6 microglial targeting identified enhanced efficiency in the photoreceptor degenerative environment","day":"10","type":"journal_article","author":[{"full_name":"Maes, Margaret E","first_name":"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"},{"orcid":"0000-0001-9434-8902","id":"3483CF6C-F248-11E8-B48F-1D18A9856A87","first_name":"Gloria","full_name":"Colombo, Gloria","last_name":"Colombo"},{"last_name":"Casado Polanco","first_name":"Raquel","full_name":"Casado Polanco, Raquel","orcid":"0000-0001-8293-4568","id":"15240fc1-dbcd-11ea-9d1d-ac5a786425fd"},{"last_name":"Siegert","first_name":"Sandra","full_name":"Siegert, Sandra","id":"36ACD32E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8635-0877"}],"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.","project":[{"call_identifier":"H2020","_id":"25D4A630-B435-11E9-9278-68D0E5697425","grant_number":"715571","name":"Microglia action towards neuronal circuit formation and function in health and disease"}],"language":[{"iso":"eng"}],"doi":"10.1016/j.omtm.2021.09.006","ddc":["570"],"article_processing_charge":"Yes","file":[{"date_updated":"2022-01-24T07:43:09Z","access_level":"open_access","checksum":"77dc540e8011c5475031bdf6ccef20a6","file_name":"2021_MolTherMethodsClinDev_Maes.pdf","creator":"cchlebak","file_size":4794147,"success":1,"date_created":"2022-01-24T07:43:09Z","content_type":"application/pdf","file_id":"10657","relation":"main_file"}],"_id":"10655","date_published":"2021-12-10T00:00:00Z","abstract":[{"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","lang":"eng"}],"publication_status":"published","oa":1,"file_date_updated":"2022-01-24T07:43:09Z","volume":23,"tmp":{"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","short":"CC BY (4.0)"},"article_type":"original","oa_version":"Published Version","has_accepted_license":"1","year":"2021","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-11-16T13:12:03Z","external_id":{"isi":["000748748500019"]},"scopus_import":"1","acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"},{"_id":"PreCl"}],"publication_identifier":{"eissn":["2329-0501"]}},{"date_created":"2022-08-12T07:04:44Z","extern":"1","month":"08","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","status":"public","intvolume":"       204","quality_controlled":"1","publication":"29th Annual European Symposium on Algorithms","conference":{"location":"Lisbon, Portual","name":"ESA: Annual European Symposium on Algorithms","start_date":"2021-09-06","end_date":"2021-09-08"},"title":"Differentially private algorithms for graphs under continual observation","citation":{"mla":"Fichtenberger, Hendrik, et al. “Differentially Private Algorithms for Graphs under Continual Observation.” <i>29th Annual European Symposium on Algorithms</i>, vol. 204, 42, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2021.42\">10.4230/LIPIcs.ESA.2021.42</a>.","ista":"Fichtenberger H, Henzinger MH, Ost W. 2021. Differentially private algorithms for graphs under continual observation. 29th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 204, 42.","ieee":"H. Fichtenberger, M. H. Henzinger, and W. Ost, “Differentially private algorithms for graphs under continual observation,” in <i>29th Annual European Symposium on Algorithms</i>, Lisbon, Portual, 2021, vol. 204.","chicago":"Fichtenberger, Hendrik, Monika H Henzinger, and Wolfgang Ost. “Differentially Private Algorithms for Graphs under Continual Observation.” In <i>29th Annual European Symposium on Algorithms</i>, Vol. 204. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2021.42\">https://doi.org/10.4230/LIPIcs.ESA.2021.42</a>.","apa":"Fichtenberger, H., Henzinger, M. H., &#38; Ost, W. (2021). Differentially private algorithms for graphs under continual observation. In <i>29th Annual European Symposium on Algorithms</i> (Vol. 204). Lisbon, Portual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2021.42\">https://doi.org/10.4230/LIPIcs.ESA.2021.42</a>","ama":"Fichtenberger H, Henzinger MH, Ost W. Differentially private algorithms for graphs under continual observation. In: <i>29th Annual European Symposium on Algorithms</i>. Vol 204. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2021.42\">10.4230/LIPIcs.ESA.2021.42</a>","short":"H. Fichtenberger, M.H. Henzinger, W. Ost, in:, 29th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021."},"alternative_title":["LIPIcs"],"author":[{"first_name":"Hendrik","full_name":"Fichtenberger, Hendrik","last_name":"Fichtenberger"},{"orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","full_name":"Henzinger, Monika H","first_name":"Monika H"},{"full_name":"Ost, Wolfgang","first_name":"Wolfgang","last_name":"Ost"}],"type":"conference","day":"31","doi":"10.4230/LIPIcs.ESA.2021.42","language":[{"iso":"eng"}],"article_processing_charge":"No","arxiv":1,"_id":"11814","date_published":"2021-08-31T00:00:00Z","abstract":[{"lang":"eng","text":"Differentially private algorithms protect individuals in data analysis scenarios by ensuring that there is only a weak correlation between the existence of the user in the data and the result of the analysis. Dynamic graph algorithms maintain the solution to a problem (e.g., a matching) on an evolving input, i.e., a graph where nodes or edges are inserted or deleted over time. They output the value of the solution after each update operation, i.e., continuously. We study (event-level and user-level) differentially private algorithms for graph problems under continual observation, i.e., differentially private dynamic graph algorithms. We present event-level private algorithms for partially dynamic counting-based problems such as triangle count that improve the additive error by a polynomial factor (in the length T of the update sequence) on the state of the art, resulting in the first algorithms with additive error polylogarithmic in T.\r\nWe also give ε-differentially private and partially dynamic algorithms for minimum spanning tree, minimum cut, densest subgraph, and maximum matching. The additive error of our improved MST algorithm is O(W log^{3/2}T / ε), where W is the maximum weight of any edge, which, as we show, is tight up to a (√{log T} / ε)-factor. For the other problems, we present a partially-dynamic algorithm with multiplicative error (1+β) for any constant β > 0 and additive error O(W log(nW) log(T) / (ε β)). Finally, we show that the additive error for a broad class of dynamic graph algorithms with user-level privacy must be linear in the value of the output solution’s range."}],"article_number":"42","oa":1,"main_file_link":[{"url":"https://doi.org/10.4230/LIPIcs.ESA.2021.42","open_access":"1"}],"publication_status":"published","volume":204,"year":"2021","oa_version":"Published Version","publication_identifier":{"isbn":["9783959772044"],"issn":["1868-8969"]},"date_updated":"2023-02-14T08:28:56Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","external_id":{"arxiv":["2106.14756"]}},{"volume":50,"publication_status":"published","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1504.07056"}],"oa":1,"_id":"11886","date_published":"2021-05-01T00:00:00Z","abstract":[{"lang":"eng","text":"We present a deterministic (1+𝑜(1))-approximation (𝑛1/2+𝑜(1)+𝐷1+𝑜(1))-time algorithm for solving the single-source shortest paths problem on distributed weighted networks (the \\sf CONGEST model); here 𝑛 is the number of nodes in the network, 𝐷 is its (hop) diameter, and edge weights are positive integers from 1 to poly(𝑛). This is the first nontrivial deterministic algorithm for this problem. It also improves (i) the running time of the randomized (1+𝑜(1))-approximation 𝑂̃ (𝑛√𝐷1/4+𝐷)-time algorithm of Nanongkai [in Proceedings of STOC, 2014, pp. 565--573] by a factor of as large as 𝑛1/8, and (ii) the 𝑂(𝜖−1log𝜖−1)-approximation factor of Lenzen and Patt-Shamir's 𝑂̃ (𝑛1/2+𝜖+𝐷)-time algorithm [in Proceedings of STOC, 2013, pp. 381--390] within the same running time. (Throughout, we use 𝑂̃ (⋅) to hide polylogarithmic factors in 𝑛.) Our running time matches the known time lower bound of Ω(𝑛/log𝑛‾‾‾‾‾‾‾√+𝐷) [M. Elkin, SIAM J. Comput., 36 (2006), pp. 433--456], thus essentially settling the status of this problem which was raised at least a decade ago [M. Elkin, SIGACT News, 35 (2004), pp. 40--57]. It also implies a (2+𝑜(1))-approximation (𝑛1/2+𝑜(1)+𝐷1+𝑜(1))-time algorithm for approximating a network's weighted diameter which almost matches the lower bound by Holzer and Pinsker [in Proceedings of OPODIS, 2015, Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, Germany, 2016, 6]. In achieving this result, we develop two techniques which might be of independent interest and useful in other settings: (i) a deterministic process that replaces the “hitting set argument” commonly used for shortest paths computation in various settings, and (ii) a simple, deterministic construction of an (𝑛𝑜(1),𝑜(1))-hop set of size 𝑛1+𝑜(1). We combine these techniques with many distributed algorithmic techniques, some of which are from problems that are not directly related to shortest paths, e.g., ruling sets [A. V. Goldberg, S. A. Plotkin, and G. E. Shannon, SIAM J. Discrete Math., 1 (1988), pp. 434--446], source detection [C. Lenzen and D. Peleg, in Proceedings of PODC, 2013, pp. 375--382], and partial distance estimation [C. Lenzen and B. Patt-Shamir, in Proceedings of PODC, 2015, pp. 153--162]. Our hop set construction also leads to single-source shortest paths algorithms in two other settings: (i) a (1+𝑜(1))-approximation 𝑛𝑜(1)-time algorithm on congested cliques, and (ii) a (1+𝑜(1))-approximation 𝑛𝑜(1)-pass 𝑛1+𝑜(1)-space streaming algorithm. The first result answers an open problem in [D. Nanongkai, in Proceedings of STOC, 2014, pp. 565--573]. The second result partially answers an open problem raised by McGregor in 2006 [List of Open Problems in Sublinear Algorithms: Problem 14]."}],"arxiv":1,"issue":"3","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-17T14:12:49Z","external_id":{"arxiv":["1504.07056"]},"scopus_import":"1","publication_identifier":{"eissn":["1095-7111"],"issn":["0097-5397"]},"article_type":"original","oa_version":"Preprint","year":"2021","quality_controlled":"1","publication":"SIAM Journal on Computing","intvolume":"        50","status":"public","publisher":"Society for Industrial & Applied Mathematics","extern":"1","month":"05","date_created":"2022-08-17T07:54:45Z","page":"STOC16-98-STOC16-137","language":[{"iso":"eng"}],"doi":"10.1137/16m1097808","day":"01","author":[{"full_name":"Henzinger, Monika H","first_name":"Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"last_name":"Krinninger","full_name":"Krinninger, Sebastian","first_name":"Sebastian"},{"last_name":"Nanongkai","first_name":"Danupon","full_name":"Nanongkai, Danupon"}],"type":"journal_article","citation":{"chicago":"Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths.” <i>SIAM Journal on Computing</i>. Society for Industrial &#38; Applied Mathematics, 2021. <a href=\"https://doi.org/10.1137/16m1097808\">https://doi.org/10.1137/16m1097808</a>.","ista":"Henzinger MH, Krinninger S, Nanongkai D. 2021. A deterministic almost-tight distributed algorithm for approximating single-source shortest paths. SIAM Journal on Computing. 50(3), STOC16-98-STOC16-137.","ieee":"M. H. Henzinger, S. Krinninger, and D. Nanongkai, “A deterministic almost-tight distributed algorithm for approximating single-source shortest paths,” <i>SIAM Journal on Computing</i>, vol. 50, no. 3. Society for Industrial &#38; Applied Mathematics, pp. STOC16-98-STOC16-137, 2021.","mla":"Henzinger, Monika H., et al. “A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths.” <i>SIAM Journal on Computing</i>, vol. 50, no. 3, Society for Industrial &#38; Applied Mathematics, 2021, pp. STOC16-98-STOC16-137, doi:<a href=\"https://doi.org/10.1137/16m1097808\">10.1137/16m1097808</a>.","short":"M.H. Henzinger, S. Krinninger, D. Nanongkai, SIAM Journal on Computing 50 (2021) STOC16-98-STOC16-137.","ama":"Henzinger MH, Krinninger S, Nanongkai D. A deterministic almost-tight distributed algorithm for approximating single-source shortest paths. <i>SIAM Journal on Computing</i>. 2021;50(3):STOC16-98-STOC16-137. doi:<a href=\"https://doi.org/10.1137/16m1097808\">10.1137/16m1097808</a>","apa":"Henzinger, M. H., Krinninger, S., &#38; Nanongkai, D. (2021). A deterministic almost-tight distributed algorithm for approximating single-source shortest paths. <i>SIAM Journal on Computing</i>. Society for Industrial &#38; Applied Mathematics. <a href=\"https://doi.org/10.1137/16m1097808\">https://doi.org/10.1137/16m1097808</a>"},"title":"A deterministic almost-tight distributed algorithm for approximating single-source shortest paths"},{"author":[{"full_name":"Bergamaschi, Thiago","first_name":"Thiago","last_name":"Bergamaschi"},{"first_name":"Monika H","full_name":"Henzinger, Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"full_name":"Gutenberg, Maximilian Probst","first_name":"Maximilian Probst","last_name":"Gutenberg"},{"first_name":"Virginia Vassilevska","full_name":"Williams, Virginia Vassilevska","last_name":"Williams"},{"last_name":"Wein","first_name":"Nicole","full_name":"Wein, Nicole"}],"type":"conference","day":"01","title":"New techniques and fine-grained hardness for dynamic near-additive spanners","conference":{"start_date":"2021-01-10","end_date":"2021-01-13","name":"SODA: Symposium on Discrete Algorithms","location":"Alexandria, VA, United States"},"citation":{"ama":"Bergamaschi T, Henzinger MH, Gutenberg MP, Williams VV, Wein N. New techniques and fine-grained hardness for dynamic near-additive spanners. In: <i>32nd Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Society for Industrial and Applied Mathematics; 2021:1836-1855. doi:<a href=\"https://doi.org/10.1137/1.9781611976465.110\">10.1137/1.9781611976465.110</a>","apa":"Bergamaschi, T., Henzinger, M. H., Gutenberg, M. P., Williams, V. V., &#38; Wein, N. (2021). New techniques and fine-grained hardness for dynamic near-additive spanners. In <i>32nd Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 1836–1855). Alexandria, VA, United States: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611976465.110\">https://doi.org/10.1137/1.9781611976465.110</a>","short":"T. Bergamaschi, M.H. Henzinger, M.P. Gutenberg, V.V. Williams, N. Wein, in:, 32nd Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2021, pp. 1836–1855.","mla":"Bergamaschi, Thiago, et al. “New Techniques and Fine-Grained Hardness for Dynamic near-Additive Spanners.” <i>32nd Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Society for Industrial and Applied Mathematics, 2021, pp. 1836–55, doi:<a href=\"https://doi.org/10.1137/1.9781611976465.110\">10.1137/1.9781611976465.110</a>.","chicago":"Bergamaschi, Thiago, Monika H Henzinger, Maximilian Probst Gutenberg, Virginia Vassilevska Williams, and Nicole Wein. “New Techniques and Fine-Grained Hardness for Dynamic near-Additive Spanners.” In <i>32nd Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 1836–55. Society for Industrial and Applied Mathematics, 2021. <a href=\"https://doi.org/10.1137/1.9781611976465.110\">https://doi.org/10.1137/1.9781611976465.110</a>.","ieee":"T. Bergamaschi, M. H. Henzinger, M. P. Gutenberg, V. V. Williams, and N. Wein, “New techniques and fine-grained hardness for dynamic near-additive spanners,” in <i>32nd Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Alexandria, VA, United States, 2021, pp. 1836–1855.","ista":"Bergamaschi T, Henzinger MH, Gutenberg MP, Williams VV, Wein N. 2021. New techniques and fine-grained hardness for dynamic near-additive spanners. 32nd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1836–1855."},"doi":"10.1137/1.9781611976465.110","language":[{"iso":"eng"}],"date_created":"2022-08-18T07:37:36Z","month":"01","extern":"1","page":"1836-1855","status":"public","publication":"32nd Annual ACM-SIAM Symposium on Discrete Algorithms","quality_controlled":"1","publisher":"Society for Industrial and Applied Mathematics","year":"2021","oa_version":"Preprint","publication_identifier":{"eisbn":["978-1-61197-646-5"]},"scopus_import":"1","external_id":{"arxiv":["2010.10134"]},"date_updated":"2023-02-17T11:28:46Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2021-01-01T00:00:00Z","_id":"11919","abstract":[{"lang":"eng","text":"Maintaining and updating shortest paths information in a graph is a fundamental problem with many applications. As computations on dense graphs can be prohibitively expensive, and it is preferable to perform the computations on a sparse skeleton of the given graph that roughly preserves the shortest paths information. Spanners and emulators serve this purpose. Unfortunately, very little is known about dynamically maintaining sparse spanners and emulators as the graph is modified by a sequence of edge insertions and deletions. This paper develops fast dynamic algorithms for spanner and emulator maintenance and provides evidence from fine-grained complexity that these algorithms are tight. For unweighted undirected m-edge n-node graphs we obtain the following results.\r\n\r\nUnder the popular OMv conjecture, there can be no decremental or incremental algorithm that maintains an n1+o(1) edge (purely additive) +nδ-emulator for any δ < 1/2 with arbitrary polynomial preprocessing time and total update time m1+o(1). Also, under the Combinatorial k-Clique hypothesis, any fully dynamic combinatorial algorithm that maintains an n1+o(1) edge (1 + ∊, no(1))-spanner or emulator for small ∊ must either have preprocessing time mn1–o(1) or amortized update time m1–o(1). Both of our conditional lower bounds are tight.\r\n\r\nAs the above fully dynamic lower bound only applies to combinatorial algorithms, we also develop an algebraic spanner algorithm that improves over the m1–o(1) update time for dense graphs. For any constant ∊ ∊ (0, 1], there is a fully dynamic algorithm with worst-case update time O(n1.529) that whp maintains an n1+o(1) edge (1 + ∊, no(1))-spanner.\r\n\r\nOur new algebraic techniques allow us to also obtain a new fully dynamic algorithm for All-Pairs Shortest Paths (APSP) that can perform both edge updates and can report shortest paths in worst-case time O(n1.9), which are correct whp. This is the first path-reporting fully dynamic APSP algorithm with a truly subquadratic query time that beats O(n2.5) update time. It works against an oblivious adversary.\r\n\r\nFinally, we give two applications of our new dynamic spanner algorithms: (1) a fully dynamic (1 + ∊)-approximate APSP algorithm with update time O(n1.529) that can report approximate shortest paths in n1+o(1) time per query; previous subquadratic update/query algorithms could only report the distance, but not obtain the paths; (2) a fully dynamic algorithm for near-2-approximate Steiner tree maintenance with both terminal and edge updates."}],"article_processing_charge":"No","arxiv":1,"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2010.10134"}],"publication_status":"published"},{"publisher":"Society for Industrial and Applied Mathematics","quality_controlled":"1","publication":"32nd Annual ACM-SIAM Symposium on Discrete Algorithms","status":"public","page":"2537-2549","extern":"1","month":"01","date_created":"2022-08-18T07:46:54Z","language":[{"iso":"eng"}],"doi":"10.1137/1.9781611976465.150","citation":{"short":"S. Bhattacharya, M.H. Henzinger, D. Nanongkai, X. Wu, in:, 32nd Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2021, pp. 2537–2549.","apa":"Bhattacharya, S., Henzinger, M. H., Nanongkai, D., &#38; Wu, X. (2021). Dynamic set cover: Improved amortized and worst-case update time. In <i>32nd Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 2537–2549). Alexandria, VA, United States: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611976465.150\">https://doi.org/10.1137/1.9781611976465.150</a>","ama":"Bhattacharya S, Henzinger MH, Nanongkai D, Wu X. Dynamic set cover: Improved amortized and worst-case update time. In: <i>32nd Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Society for Industrial and Applied Mathematics; 2021:2537-2549. doi:<a href=\"https://doi.org/10.1137/1.9781611976465.150\">10.1137/1.9781611976465.150</a>","ista":"Bhattacharya S, Henzinger MH, Nanongkai D, Wu X. 2021. Dynamic set cover: Improved amortized and worst-case update time. 32nd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 2537–2549.","ieee":"S. Bhattacharya, M. H. Henzinger, D. Nanongkai, and X. Wu, “Dynamic set cover: Improved amortized and worst-case update time,” in <i>32nd Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Alexandria, VA, United States, 2021, pp. 2537–2549.","chicago":"Bhattacharya, Sayan, Monika H Henzinger, Danupon Nanongkai, and Xiaowei Wu. “Dynamic Set Cover: Improved Amortized and Worst-Case Update Time.” In <i>32nd Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 2537–49. Society for Industrial and Applied Mathematics, 2021. <a href=\"https://doi.org/10.1137/1.9781611976465.150\">https://doi.org/10.1137/1.9781611976465.150</a>.","mla":"Bhattacharya, Sayan, et al. “Dynamic Set Cover: Improved Amortized and Worst-Case Update Time.” <i>32nd Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Society for Industrial and Applied Mathematics, 2021, pp. 2537–49, doi:<a href=\"https://doi.org/10.1137/1.9781611976465.150\">10.1137/1.9781611976465.150</a>."},"conference":{"location":"Alexandria, VA, United States","name":"SODA: Symposium on Discrete Algorithms","start_date":"2021-01-10","end_date":"2021-01-13"},"title":"Dynamic set cover: Improved amortized and worst-case update time","day":"01","type":"conference","author":[{"first_name":"Sayan","full_name":"Bhattacharya, Sayan","last_name":"Bhattacharya"},{"last_name":"Henzinger","full_name":"Henzinger, Monika H","first_name":"Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"full_name":"Nanongkai, Danupon","first_name":"Danupon","last_name":"Nanongkai"},{"full_name":"Wu, Xiaowei","first_name":"Xiaowei","last_name":"Wu"}],"publication_status":"published","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/2002.11171","open_access":"1"}],"arxiv":1,"article_processing_charge":"No","_id":"11920","date_published":"2021-01-01T00:00:00Z","abstract":[{"text":"In the dynamic minimum set cover problem, a challenge is to minimize the update time while guaranteeing close to the optimal min(O(log n), f) approximation factor. (Throughout, m, n, f, and C are parameters denoting the maximum number of sets, number of elements, frequency, and the cost range.) In the high-frequency range, when f = Ω(log n), this was achieved by a deterministic O(log n)-approximation algorithm with O(f log n) amortized update time [Gupta et al. STOC'17]. In the low-frequency range, the line of work by Gupta et al. [STOC'17], Abboud et al. [STOC'19], and Bhattacharya et al. [ICALP'15, IPCO'17, FOCS'19] led to a deterministic (1 + ∊) f-approximation algorithm with O(f log(Cn)/∊2) amortized update time. In this paper we improve the latter update time and provide the first bounds that subsume (and sometimes improve) the state-of-the-art dynamic vertex cover algorithms. We obtain: (1) (1 + ∊) f-approximation ratio in O(f log2(Cn)/∊3) worst-case update time: No non-trivial worst-case update time was previously known for dynamic set cover. Our bound subsumes and improves by a logarithmic factor the O(log3 n/poly(∊)) worst-case update time for unweighted dynamic vertex cover (i.e., when f = 2 and C = 1) by Bhattacharya et al. [SODA'17]. (2) (1 + ∊) f-approximation ratio in O ((f2/∊3) + (f/∊2) log C) amortized update time: This result improves the previous O(f log (Cn)/∊2) update time bound for most values of f in the low-frequency range, i.e. whenever f = o(log n). It is the first that is independent of m and n. It subsumes the constant amortized update time of Bhattacharya and Kulkarni [SODA'19] for unweighted dynamic vertex cover (i.e., when f = 2 and C = 1). These results are achieved by leveraging the approximate complementary slackness and background schedulers techniques. These techniques were used in the local update scheme for dynamic vertex cover. Our main technical contribution is to adapt these techniques within the global update scheme of Bhattacharya et al. [FOCS'19] for the dynamic set cover problem.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-17T11:31:22Z","external_id":{"arxiv":["2002.11171"]},"scopus_import":"1","publication_identifier":{"eisbn":["978-1-61197-646-5"]},"oa_version":"Preprint","year":"2021"},{"month":"01","extern":"1","date_created":"2022-08-18T10:31:58Z","page":"2799-2818","publication":"32nd Annual ACM-SIAM Symposium on Discrete Algorithms","quality_controlled":"1","status":"public","publisher":"Society for Industrial and Applied Mathematics","day":"01","type":"conference","author":[{"last_name":"Henzinger","first_name":"Monika H","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"},{"last_name":"Neumann","first_name":"Stefan","full_name":"Neumann, Stefan"},{"last_name":"Räcke","first_name":"Harald","full_name":"Räcke, Harald"},{"first_name":"Stefan","full_name":"Schmid, Stefan","last_name":"Schmid"}],"citation":{"short":"M.H. Henzinger, S. Neumann, H. Räcke, S. Schmid, in:, 32nd Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2021, pp. 2799–2818.","ama":"Henzinger MH, Neumann S, Räcke H, Schmid S. Tight bounds for online graph partitioning. In: <i>32nd Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Society for Industrial and Applied Mathematics; 2021:2799-2818. doi:<a href=\"https://doi.org/10.1137/1.9781611976465.166\">10.1137/1.9781611976465.166</a>","apa":"Henzinger, M. H., Neumann, S., Räcke, H., &#38; Schmid, S. (2021). Tight bounds for online graph partitioning. In <i>32nd Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 2799–2818). Alexandria, VA, United States: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611976465.166\">https://doi.org/10.1137/1.9781611976465.166</a>","chicago":"Henzinger, Monika H, Stefan Neumann, Harald Räcke, and Stefan Schmid. “Tight Bounds for Online Graph Partitioning.” In <i>32nd Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 2799–2818. Society for Industrial and Applied Mathematics, 2021. <a href=\"https://doi.org/10.1137/1.9781611976465.166\">https://doi.org/10.1137/1.9781611976465.166</a>.","ieee":"M. H. Henzinger, S. Neumann, H. Räcke, and S. Schmid, “Tight bounds for online graph partitioning,” in <i>32nd Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Alexandria, VA, United States, 2021, pp. 2799–2818.","ista":"Henzinger MH, Neumann S, Räcke H, Schmid S. 2021. Tight bounds for online graph partitioning. 32nd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 2799–2818.","mla":"Henzinger, Monika H., et al. “Tight Bounds for Online Graph Partitioning.” <i>32nd Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Society for Industrial and Applied Mathematics, 2021, pp. 2799–818, doi:<a href=\"https://doi.org/10.1137/1.9781611976465.166\">10.1137/1.9781611976465.166</a>."},"title":"Tight bounds for online graph partitioning","conference":{"location":"Alexandria, VA, United States","end_date":"2021-01-13","start_date":"2021-01-10","name":"SODA: Symposium on Discrete Algorithms"},"language":[{"iso":"eng"}],"doi":"10.1137/1.9781611976465.166","_id":"11923","abstract":[{"text":"We consider the following online optimization problem. We are given a graph G and each vertex of the graph is assigned to one of ℓ servers, where servers have capacity k and we assume that the graph has ℓ · k vertices. Initially, G does not contain any edges and then the edges of G are revealed one-by-one. The goal is to design an online algorithm ONL, which always places the connected components induced by the revealed edges on the same server and never exceeds the server capacities by more than ∊k for constant ∊ > 0. Whenever ONL learns about a new edge, the algorithm is allowed to move vertices from one server to another. Its objective is to minimize the number of vertex moves. More specifically, ONL should minimize the competitive ratio: the total cost ONL incurs compared to an optimal offline algorithm OPT.\r\n\r\nThe problem was recently introduced by Henzinger et al. (SIGMETRICS'2019) and is related to classic online problems such as online paging and scheduling. It finds applications in the context of resource allocation in the cloud and for optimizing distributed data structures such as union–find data structures.\r\n\r\nOur main contribution is a polynomial-time randomized algorithm, that is asymptotically optimal: we derive an upper bound of O(log ℓ + log k) on its competitive ratio and show that no randomized online algorithm can achieve a competitive ratio of less than Ω(log ℓ + log k). We also settle the open problem of the achievable competitive ratio by deterministic online algorithms, by deriving a competitive ratio of Θ(ℓ log k); to this end, we present an improved lower bound as well as a deterministic polynomial-time online algorithm.\r\n\r\nOur algorithms rely on a novel technique which combines efficient integer programming with a combinatorial approach for maintaining ILP solutions. More precisely, we use an ILP to assign the connected components induced by the revealed edges to the servers; this is similar to existing approximation schemes for scheduling algorithms. However, we cannot obtain our competitive ratios if we run the ILP after each edge insertion. Instead, we identify certain types of edge insertions, after which we can manually obtain an optimal ILP solution at zero cost without resolving the ILP. We believe this technique is of independent interest and will find further applications in the future.","lang":"eng"}],"date_published":"2021-01-01T00:00:00Z","arxiv":1,"article_processing_charge":"No","publication_status":"published","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2011.01017"}],"year":"2021","oa_version":"Preprint","scopus_import":"1","external_id":{"arxiv":["2011.01017"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-17T11:32:38Z","publication_identifier":{"eisbn":["978-161197646-5"]}},{"conference":{"start_date":"2021-01-10","end_date":"2021-01-11","name":"ALENEX: Symposium on Algorithm Engineering and Experiments","location":"Alexandria, VA, United States"},"title":"Fully dynamic k-center clustering in low dimensional metrics","citation":{"short":"G. Goranci, M.H. Henzinger, D. Leniowski, C. Schulz, A. Svozil, in:, 2021 Proceedings of the Workshop on Algorithm Engineering and Experiments, Society for Industrial and Applied Mathematics, 2021, pp. 143–153.","apa":"Goranci, G., Henzinger, M. H., Leniowski, D., Schulz, C., &#38; Svozil, A. (2021). Fully dynamic k-center clustering in low dimensional metrics. In <i>2021 Proceedings of the Workshop on Algorithm Engineering and Experiments</i> (pp. 143–153). Alexandria, VA, United States: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611976472.11\">https://doi.org/10.1137/1.9781611976472.11</a>","ama":"Goranci G, Henzinger MH, Leniowski D, Schulz C, Svozil A. Fully dynamic k-center clustering in low dimensional metrics. In: <i>2021 Proceedings of the Workshop on Algorithm Engineering and Experiments</i>. Society for Industrial and Applied Mathematics; 2021:143-153. doi:<a href=\"https://doi.org/10.1137/1.9781611976472.11\">10.1137/1.9781611976472.11</a>","ieee":"G. Goranci, M. H. Henzinger, D. Leniowski, C. Schulz, and A. Svozil, “Fully dynamic k-center clustering in low dimensional metrics,” in <i>2021 Proceedings of the Workshop on Algorithm Engineering and Experiments</i>, Alexandria, VA, United States, 2021, pp. 143–153.","ista":"Goranci G, Henzinger MH, Leniowski D, Schulz C, Svozil A. 2021. Fully dynamic k-center clustering in low dimensional metrics. 2021 Proceedings of the Workshop on Algorithm Engineering and Experiments. ALENEX: Symposium on Algorithm Engineering and Experiments, 143–153.","chicago":"Goranci, Gramoz, Monika H Henzinger, Dariusz Leniowski, Christian Schulz, and Alexander Svozil. “Fully Dynamic K-Center Clustering in Low Dimensional Metrics.” In <i>2021 Proceedings of the Workshop on Algorithm Engineering and Experiments</i>, 143–53. Society for Industrial and Applied Mathematics, 2021. <a href=\"https://doi.org/10.1137/1.9781611976472.11\">https://doi.org/10.1137/1.9781611976472.11</a>.","mla":"Goranci, Gramoz, et al. “Fully Dynamic K-Center Clustering in Low Dimensional Metrics.” <i>2021 Proceedings of the Workshop on Algorithm Engineering and Experiments</i>, Society for Industrial and Applied Mathematics, 2021, pp. 143–53, doi:<a href=\"https://doi.org/10.1137/1.9781611976472.11\">10.1137/1.9781611976472.11</a>."},"year":"2021","oa_version":"Published Version","type":"conference","author":[{"full_name":"Goranci, Gramoz","first_name":"Gramoz","last_name":"Goranci"},{"first_name":"Monika H","full_name":"Henzinger, Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"},{"full_name":"Leniowski, Dariusz","first_name":"Dariusz","last_name":"Leniowski"},{"full_name":"Schulz, Christian","first_name":"Christian","last_name":"Schulz"},{"last_name":"Svozil","first_name":"Alexander","full_name":"Svozil, Alexander"}],"day":"01","doi":"10.1137/1.9781611976472.11","publication_identifier":{"issn":["2164-0300"],"eisbn":["978-1-61197-647-2"]},"date_updated":"2023-02-17T13:58:51Z","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","article_processing_charge":"No","page":"143 -153","date_published":"2021-01-01T00:00:00Z","_id":"11931","abstract":[{"text":"Clustering is one of the most fundamental problems in unsupervised learning with a large number of applications. However, classical clustering algorithms assume that the data is static, thus failing to capture many real-world applications where data is constantly changing and evolving. Driven by this, we study the metric k-center clustering problem in the fully dynamic setting, where the goal is to efficiently maintain a clustering while supporting an intermixed sequence of insertions and deletions of points. This model also supports queries of the form (1) report whether a given point is a center or (2) determine the cluster a point is assigned to. We present a deterministic dynamic algorithm for the k-center clustering problem that provably achieves a (2 + ∊)-approximation in nearly logarithmic update and query time, if the underlying metric has bounded doubling dimension, its aspect ratio is bounded by a polynomial and ∊ is a constant. An important feature of our algorithm is that the update and query times are independent of k. We confirm the practical relevance of this feature via an extensive experimental study which shows that for large values of k, our algorithmic construction outperforms the state-of-the-art algorithm in terms of solution quality and running time.","lang":"eng"}],"date_created":"2022-08-19T07:33:37Z","extern":"1","month":"01","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1137/1.9781611976472.11"}],"oa":1,"publisher":"Society for Industrial and Applied Mathematics","publication_status":"published","status":"public","quality_controlled":"1","publication":"2021 Proceedings of the Workshop on Algorithm Engineering and Experiments"},{"publication_identifier":{"eissn":["1521-3773"],"issn":["1433-7851"]},"scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-21T10:09:14Z","year":"2021","oa_version":"Published Version","article_type":"original","main_file_link":[{"url":"https://doi.org/10.1002/anie.202100164","open_access":"1"}],"oa":1,"publication_status":"published","volume":60,"article_processing_charge":"No","issue":"13","date_published":"2021-03-22T00:00:00Z","_id":"11956","abstract":[{"lang":"eng","text":"Controlling the selectivity of a chemical reaction with external stimuli is common in thermal processes, but rare in visible-light photocatalysis. Here we show that the redox potential of a carbon nitride photocatalyst (CN-OA-m) can be tuned by changing the irradiation wavelength to generate electron holes with different oxidation potentials. This tuning was the key to realizing photo-chemo-enzymatic cascades that give either the (S)- or the (R)-enantiomer of phenylethanol. In combination with an unspecific peroxygenase from Agrocybe aegerita, green light irradiation of CN-OA-m led to the enantioselective hydroxylation of ethylbenzene to (R)-1-phenylethanol (99 % ee). In contrast, blue light irradiation triggered the photocatalytic oxidation of ethylbenzene to acetophenone, which in turn was enantioselectively reduced with an alcohol dehydrogenase from Rhodococcus ruber to form (S)-1-phenylethanol (93 % ee)."}],"doi":"10.1002/anie.202100164","language":[{"iso":"eng"}],"title":"Chromoselective photocatalysis enables stereocomplementary biocatalytic pathways","citation":{"mla":"Schmermund, Luca, et al. “Chromoselective Photocatalysis Enables Stereocomplementary Biocatalytic Pathways.” <i>Angewandte Chemie International Edition</i>, vol. 60, no. 13, Wiley, 2021, pp. 6965–69, doi:<a href=\"https://doi.org/10.1002/anie.202100164\">10.1002/anie.202100164</a>.","ieee":"L. Schmermund <i>et al.</i>, “Chromoselective photocatalysis enables stereocomplementary biocatalytic pathways,” <i>Angewandte Chemie International Edition</i>, vol. 60, no. 13. Wiley, pp. 6965–6969, 2021.","ista":"Schmermund L, Reischauer S, Bierbaumer S, Winkler CK, Diaz‐Rodriguez A, Edwards LJ, Kara S, Mielke T, Cartwright J, Grogan G, Pieber B, Kroutil W. 2021. Chromoselective photocatalysis enables stereocomplementary biocatalytic pathways. Angewandte Chemie International Edition. 60(13), 6965–6969.","chicago":"Schmermund, Luca, Susanne Reischauer, Sarah Bierbaumer, Christoph K. Winkler, Alba Diaz‐Rodriguez, Lee J. Edwards, Selin Kara, et al. “Chromoselective Photocatalysis Enables Stereocomplementary Biocatalytic Pathways.” <i>Angewandte Chemie International Edition</i>. Wiley, 2021. <a href=\"https://doi.org/10.1002/anie.202100164\">https://doi.org/10.1002/anie.202100164</a>.","apa":"Schmermund, L., Reischauer, S., Bierbaumer, S., Winkler, C. K., Diaz‐Rodriguez, A., Edwards, L. J., … Kroutil, W. (2021). Chromoselective photocatalysis enables stereocomplementary biocatalytic pathways. <i>Angewandte Chemie International Edition</i>. Wiley. <a href=\"https://doi.org/10.1002/anie.202100164\">https://doi.org/10.1002/anie.202100164</a>","ama":"Schmermund L, Reischauer S, Bierbaumer S, et al. Chromoselective photocatalysis enables stereocomplementary biocatalytic pathways. <i>Angewandte Chemie International Edition</i>. 2021;60(13):6965-6969. doi:<a href=\"https://doi.org/10.1002/anie.202100164\">10.1002/anie.202100164</a>","short":"L. Schmermund, S. Reischauer, S. Bierbaumer, C.K. Winkler, A. Diaz‐Rodriguez, L.J. Edwards, S. Kara, T. Mielke, J. Cartwright, G. Grogan, B. Pieber, W. Kroutil, Angewandte Chemie International Edition 60 (2021) 6965–6969."},"type":"journal_article","author":[{"last_name":"Schmermund","first_name":"Luca","full_name":"Schmermund, Luca"},{"last_name":"Reischauer","full_name":"Reischauer, Susanne","first_name":"Susanne"},{"last_name":"Bierbaumer","first_name":"Sarah","full_name":"Bierbaumer, Sarah"},{"last_name":"Winkler","full_name":"Winkler, Christoph K.","first_name":"Christoph K."},{"last_name":"Diaz‐Rodriguez","full_name":"Diaz‐Rodriguez, Alba","first_name":"Alba"},{"full_name":"Edwards, Lee J.","first_name":"Lee J.","last_name":"Edwards"},{"first_name":"Selin","full_name":"Kara, Selin","last_name":"Kara"},{"first_name":"Tamara","full_name":"Mielke, Tamara","last_name":"Mielke"},{"first_name":"Jared","full_name":"Cartwright, Jared","last_name":"Cartwright"},{"full_name":"Grogan, Gideon","first_name":"Gideon","last_name":"Grogan"},{"first_name":"Bartholomäus","full_name":"Pieber, Bartholomäus","last_name":"Pieber","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","orcid":"0000-0001-8689-388X"},{"first_name":"Wolfgang","full_name":"Kroutil, Wolfgang","last_name":"Kroutil"}],"day":"22","publisher":"Wiley","status":"public","intvolume":"        60","publication":"Angewandte Chemie International Edition","quality_controlled":"1","page":"6965-6969","date_created":"2022-08-24T10:47:16Z","month":"03","extern":"1"},{"publisher":"Wiley","publication":"ChemPhotoChem","quality_controlled":"1","intvolume":"         5","status":"public","page":"716-720","month":"08","extern":"1","date_created":"2022-08-25T08:31:11Z","language":[{"iso":"eng"}],"doi":"10.1002/cptc.202100062","citation":{"short":"S. Reischauer, B. Pieber, ChemPhotoChem 5 (2021) 716–720.","apa":"Reischauer, S., &#38; Pieber, B. (2021). Recyclable, bifunctional metallaphotocatalysts for C−S cross‐coupling reactions. <i>ChemPhotoChem</i>. Wiley. <a href=\"https://doi.org/10.1002/cptc.202100062\">https://doi.org/10.1002/cptc.202100062</a>","ama":"Reischauer S, Pieber B. Recyclable, bifunctional metallaphotocatalysts for C−S cross‐coupling reactions. <i>ChemPhotoChem</i>. 2021;5(8):716-720. doi:<a href=\"https://doi.org/10.1002/cptc.202100062\">10.1002/cptc.202100062</a>","ista":"Reischauer S, Pieber B. 2021. Recyclable, bifunctional metallaphotocatalysts for C−S cross‐coupling reactions. ChemPhotoChem. 5(8), 716–720.","ieee":"S. Reischauer and B. Pieber, “Recyclable, bifunctional metallaphotocatalysts for C−S cross‐coupling reactions,” <i>ChemPhotoChem</i>, vol. 5, no. 8. Wiley, pp. 716–720, 2021.","chicago":"Reischauer, Susanne, and Bartholomäus Pieber. “Recyclable, Bifunctional Metallaphotocatalysts for C−S Cross‐coupling Reactions.” <i>ChemPhotoChem</i>. Wiley, 2021. <a href=\"https://doi.org/10.1002/cptc.202100062\">https://doi.org/10.1002/cptc.202100062</a>.","mla":"Reischauer, Susanne, and Bartholomäus Pieber. “Recyclable, Bifunctional Metallaphotocatalysts for C−S Cross‐coupling Reactions.” <i>ChemPhotoChem</i>, vol. 5, no. 8, Wiley, 2021, pp. 716–20, doi:<a href=\"https://doi.org/10.1002/cptc.202100062\">10.1002/cptc.202100062</a>."},"title":"Recyclable, bifunctional metallaphotocatalysts for C−S cross‐coupling reactions","day":"01","type":"journal_article","author":[{"first_name":"Susanne","full_name":"Reischauer, Susanne","last_name":"Reischauer"},{"last_name":"Pieber","full_name":"Pieber, Bartholomäus","first_name":"Bartholomäus","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","orcid":"0000-0001-8689-388X"}],"publication_status":"published","oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1002/cptc.202100062"}],"volume":5,"article_processing_charge":"No","issue":"8","_id":"11965","abstract":[{"text":"Metallaphotocatalytic cross-coupling reactions are typically carried out by combining homogeneous or heterogeneous photocatalysts with a soluble nickel complex. Previous attempts to realize recyclable catalytic systems use immobilized iridium complexes to harvest light. We present bifunctional materials based on semiconductors for metallaphotocatalytic C−S cross-coupling reactions that can be reused without losing their catalytic activity. Key to the success is the permanent immobilization of a nickel complex on the surface of a heterogeneous semiconductor through phosphonic acid anchors. The optimized catalyst harvests a broad range of the visible light spectrum and requires a nickel loading of only ∼0.1 mol %.","lang":"eng"}],"date_published":"2021-08-01T00:00:00Z","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-21T10:09:37Z","publication_identifier":{"eissn":["2367-0932"]},"article_type":"letter_note","year":"2021","oa_version":"Published Version"},{"article_type":"original","year":"2021","oa_version":"Published Version","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-21T10:09:52Z","publication_identifier":{"issn":["1463-9262"],"eissn":["1463-9270"]},"date_published":"2021-06-21T00:00:00Z","_id":"11972","abstract":[{"text":"Carbon dots have been previosly immobilized on titanium dioxide to generate photocatalysts for pollutant degradation and water splitting. Here we demonstrate that these nanocomposites are valuable photocatalysts for metallaphotocatalytic carbon–heteroatom cross-couplings. These sustainable materials show a large applicability, high photostability, excellent reusability, and broadly absorb across the visible-light spectrum.","lang":"eng"}],"article_processing_charge":"No","issue":"12","volume":23,"publication_status":"published","oa":1,"main_file_link":[{"url":"https://doi.org/10.1039/D1GC01284C","open_access":"1"}],"day":"21","type":"journal_article","author":[{"last_name":"Zhao","first_name":"Zhouxiang","full_name":"Zhao, Zhouxiang"},{"last_name":"Reischauer","first_name":"Susanne","full_name":"Reischauer, Susanne"},{"orcid":"0000-0001-8689-388X","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","last_name":"Pieber","first_name":"Bartholomäus","full_name":"Pieber, Bartholomäus"},{"last_name":"Delbianco","first_name":"Martina","full_name":"Delbianco, Martina"}],"citation":{"mla":"Zhao, Zhouxiang, et al. “Carbon Dot/TiO₂ Nanocomposites as Photocatalysts for Metallaphotocatalytic Carbon-Heteroatom Cross-Couplings.” <i>Green Chemistry</i>, vol. 23, no. 12, Royal Society of Chemistry, 2021, pp. 4524–30, doi:<a href=\"https://doi.org/10.1039/d1gc01284c\">10.1039/d1gc01284c</a>.","chicago":"Zhao, Zhouxiang, Susanne Reischauer, Bartholomäus Pieber, and Martina Delbianco. “Carbon Dot/TiO₂ Nanocomposites as Photocatalysts for Metallaphotocatalytic Carbon-Heteroatom Cross-Couplings.” <i>Green Chemistry</i>. Royal Society of Chemistry, 2021. <a href=\"https://doi.org/10.1039/d1gc01284c\">https://doi.org/10.1039/d1gc01284c</a>.","ista":"Zhao Z, Reischauer S, Pieber B, Delbianco M. 2021. Carbon dot/TiO₂ nanocomposites as photocatalysts for metallaphotocatalytic carbon-heteroatom cross-couplings. Green Chemistry. 23(12), 4524–4530.","ieee":"Z. Zhao, S. Reischauer, B. Pieber, and M. Delbianco, “Carbon dot/TiO₂ nanocomposites as photocatalysts for metallaphotocatalytic carbon-heteroatom cross-couplings,” <i>Green Chemistry</i>, vol. 23, no. 12. Royal Society of Chemistry, pp. 4524–4530, 2021.","ama":"Zhao Z, Reischauer S, Pieber B, Delbianco M. Carbon dot/TiO₂ nanocomposites as photocatalysts for metallaphotocatalytic carbon-heteroatom cross-couplings. <i>Green Chemistry</i>. 2021;23(12):4524-4530. doi:<a href=\"https://doi.org/10.1039/d1gc01284c\">10.1039/d1gc01284c</a>","apa":"Zhao, Z., Reischauer, S., Pieber, B., &#38; Delbianco, M. (2021). Carbon dot/TiO₂ nanocomposites as photocatalysts for metallaphotocatalytic carbon-heteroatom cross-couplings. <i>Green Chemistry</i>. Royal Society of Chemistry. <a href=\"https://doi.org/10.1039/d1gc01284c\">https://doi.org/10.1039/d1gc01284c</a>","short":"Z. Zhao, S. Reischauer, B. Pieber, M. Delbianco, Green Chemistry 23 (2021) 4524–4530."},"title":"Carbon dot/TiO₂ nanocomposites as photocatalysts for metallaphotocatalytic carbon-heteroatom cross-couplings","language":[{"iso":"eng"}],"doi":"10.1039/d1gc01284c","month":"06","extern":"1","date_created":"2022-08-25T10:25:46Z","page":"4524-4530","publication":"Green Chemistry","quality_controlled":"1","status":"public","intvolume":"        23","publisher":"Royal Society of Chemistry"},{"year":"2021","oa_version":"Published Version","article_type":"review","publication_identifier":{"eissn":["2589-0042"]},"scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-21T10:09:57Z","_id":"11974","date_published":"2021-03-19T00:00:00Z","abstract":[{"text":"Visible light photocatalysis has become a powerful tool in organic synthesis that uses photons as traceless, sustainable reagents. Most of the activities in the field focus on the development of new reactions via common photoredox cycles, but recently a number of exciting new concepts and strategies entered less charted territories. We survey approaches that enable the use of longer wavelengths and show that the wavelength and intensity of photons are import parameters that enable tuning of the reactivity of a photocatalyst to control or change the selectivity of chemical reactions. In addition, we discuss recent efforts to substitute strong reductants, such as elemental lithium and sodium, by light and technological advances in the field.","lang":"eng"}],"article_number":"102209","article_processing_charge":"No","issue":"3","volume":24,"oa":1,"main_file_link":[{"url":"https://doi.org/10.1016/j.isci.2021.102209","open_access":"1"}],"publication_status":"published","author":[{"first_name":"Susanne","full_name":"Reischauer, Susanne","last_name":"Reischauer"},{"full_name":"Pieber, Bartholomäus","first_name":"Bartholomäus","last_name":"Pieber","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","orcid":"0000-0001-8689-388X"}],"type":"journal_article","day":"19","title":"Emerging concepts in photocatalytic organic synthesis","citation":{"mla":"Reischauer, Susanne, and Bartholomäus Pieber. “Emerging Concepts in Photocatalytic Organic Synthesis.” <i>IScience</i>, vol. 24, no. 3, 102209, Elsevier, 2021, doi:<a href=\"https://doi.org/10.1016/j.isci.2021.102209\">10.1016/j.isci.2021.102209</a>.","ista":"Reischauer S, Pieber B. 2021. Emerging concepts in photocatalytic organic synthesis. iScience. 24(3), 102209.","ieee":"S. Reischauer and B. Pieber, “Emerging concepts in photocatalytic organic synthesis,” <i>iScience</i>, vol. 24, no. 3. Elsevier, 2021.","chicago":"Reischauer, Susanne, and Bartholomäus Pieber. “Emerging Concepts in Photocatalytic Organic Synthesis.” <i>IScience</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.isci.2021.102209\">https://doi.org/10.1016/j.isci.2021.102209</a>.","apa":"Reischauer, S., &#38; Pieber, B. (2021). Emerging concepts in photocatalytic organic synthesis. <i>IScience</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.isci.2021.102209\">https://doi.org/10.1016/j.isci.2021.102209</a>","ama":"Reischauer S, Pieber B. Emerging concepts in photocatalytic organic synthesis. <i>iScience</i>. 2021;24(3). doi:<a href=\"https://doi.org/10.1016/j.isci.2021.102209\">10.1016/j.isci.2021.102209</a>","short":"S. Reischauer, B. Pieber, IScience 24 (2021)."},"doi":"10.1016/j.isci.2021.102209","language":[{"iso":"eng"}],"date_created":"2022-08-25T10:31:44Z","month":"03","extern":"1","intvolume":"        24","status":"public","publication":"iScience","quality_controlled":"1","publisher":"Elsevier"},{"article_processing_charge":"No","issue":"2","abstract":[{"text":"The cleavage of benzyl ethers by catalytic hydrogenolysis or Birch reduction suffers from poor functional group compatibility and limits their use as a protecting group. The visible-light-mediated debenzylation disclosed here renders benzyl ethers temporary protective groups, enabling new orthogonal protection strategies. Using 2,3-dichloro-5,6-dicyano-1,4-benzoquinone (DDQ) as a stoichiometric or catalytic photooxidant, benzyl ethers can be cleaved in the presence of azides, alkenes, and alkynes. The reaction time can be reduced from hours to minutes in continuous flow.","lang":"eng"}],"_id":"11981","date_published":"2021-01-15T00:00:00Z","publication_status":"published","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1021/acs.orglett.0c04026"}],"oa":1,"volume":23,"article_type":"letter_note","oa_version":"Published Version","year":"2021","external_id":{"pmid":["33400534"]},"scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-21T10:10:16Z","publication_identifier":{"issn":["1523-7060"],"eissn":["1523-7052"]},"page":"514-518","month":"01","extern":"1","date_created":"2022-08-25T11:13:05Z","publisher":"American Chemical Society","publication":"Organic Letters","quality_controlled":"1","status":"public","intvolume":"        23","citation":{"mla":"Cavedon, Cristian, et al. “Visible-Light-Mediated Oxidative Debenzylation Enables the Use of Benzyl Ethers as Temporary Protecting Groups.” <i>Organic Letters</i>, vol. 23, no. 2, American Chemical Society, 2021, pp. 514–18, doi:<a href=\"https://doi.org/10.1021/acs.orglett.0c04026\">10.1021/acs.orglett.0c04026</a>.","ieee":"C. Cavedon, E. T. Sletten, A. Madani, O. Niemeyer, P. H. Seeberger, and B. Pieber, “Visible-light-mediated oxidative debenzylation enables the use of benzyl ethers as temporary protecting groups,” <i>Organic Letters</i>, vol. 23, no. 2. American Chemical Society, pp. 514–518, 2021.","ista":"Cavedon C, Sletten ET, Madani A, Niemeyer O, Seeberger PH, Pieber B. 2021. Visible-light-mediated oxidative debenzylation enables the use of benzyl ethers as temporary protecting groups. Organic Letters. 23(2), 514–518.","chicago":"Cavedon, Cristian, Eric T. Sletten, Amiera Madani, Olaf Niemeyer, Peter H. Seeberger, and Bartholomäus Pieber. “Visible-Light-Mediated Oxidative Debenzylation Enables the Use of Benzyl Ethers as Temporary Protecting Groups.” <i>Organic Letters</i>. American Chemical Society, 2021. <a href=\"https://doi.org/10.1021/acs.orglett.0c04026\">https://doi.org/10.1021/acs.orglett.0c04026</a>.","apa":"Cavedon, C., Sletten, E. T., Madani, A., Niemeyer, O., Seeberger, P. H., &#38; Pieber, B. (2021). Visible-light-mediated oxidative debenzylation enables the use of benzyl ethers as temporary protecting groups. <i>Organic Letters</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acs.orglett.0c04026\">https://doi.org/10.1021/acs.orglett.0c04026</a>","ama":"Cavedon C, Sletten ET, Madani A, Niemeyer O, Seeberger PH, Pieber B. Visible-light-mediated oxidative debenzylation enables the use of benzyl ethers as temporary protecting groups. <i>Organic Letters</i>. 2021;23(2):514-518. doi:<a href=\"https://doi.org/10.1021/acs.orglett.0c04026\">10.1021/acs.orglett.0c04026</a>","short":"C. Cavedon, E.T. Sletten, A. Madani, O. Niemeyer, P.H. Seeberger, B. Pieber, Organic Letters 23 (2021) 514–518."},"title":"Visible-light-mediated oxidative debenzylation enables the use of benzyl ethers as temporary protecting groups","day":"15","type":"journal_article","author":[{"last_name":"Cavedon","first_name":"Cristian","full_name":"Cavedon, Cristian"},{"full_name":"Sletten, Eric T.","first_name":"Eric T.","last_name":"Sletten"},{"full_name":"Madani, Amiera","first_name":"Amiera","last_name":"Madani"},{"first_name":"Olaf","full_name":"Niemeyer, Olaf","last_name":"Niemeyer"},{"last_name":"Seeberger","full_name":"Seeberger, Peter H.","first_name":"Peter H."},{"orcid":"0000-0001-8689-388X","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","first_name":"Bartholomäus","full_name":"Pieber, Bartholomäus","last_name":"Pieber"}],"pmid":1,"language":[{"iso":"eng"}],"doi":"10.1021/acs.orglett.0c04026"}]