[{"_id":"11844","day":"21","conference":{"name":"PODC: Symposium on Principles of Distributed Computing","location":"Salerno, Italy","start_date":"2022-07-25","end_date":"2022-07-29"},"ec_funded":1,"oa":1,"ddc":["000"],"date_created":"2022-08-14T22:01:46Z","publication_status":"published","file":[{"creator":"cchlebak","checksum":"4c6b29172b8e355b4fbc364a2e0827b2","content_type":"application/pdf","relation":"main_file","file_size":1593474,"date_created":"2022-08-16T08:05:15Z","access_level":"open_access","date_updated":"2022-08-16T08:05:15Z","file_id":"11854","file_name":"2022_PODC_Alistarh.pdf","success":1}],"citation":{"mla":"Alistarh, Dan-Adrian, et al. “Near-Optimal Leader Election in Population Protocols on Graphs.” <i>Proceedings of the Annual ACM Symposium on Principles of Distributed Computing</i>, Association for Computing Machinery, 2022, pp. 246–56, doi:<a href=\"https://doi.org/10.1145/3519270.3538435\">10.1145/3519270.3538435</a>.","ieee":"D.-A. Alistarh, J. Rybicki, and S. Voitovych, “Near-optimal leader election in population protocols on graphs,” in <i>Proceedings of the Annual ACM Symposium on Principles of Distributed Computing</i>, Salerno, Italy, 2022, pp. 246–256.","apa":"Alistarh, D.-A., Rybicki, J., &#38; Voitovych, S. (2022). Near-optimal leader election in population protocols on graphs. In <i>Proceedings of the Annual ACM Symposium on Principles of Distributed Computing</i> (pp. 246–256). Salerno, Italy: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3519270.3538435\">https://doi.org/10.1145/3519270.3538435</a>","short":"D.-A. Alistarh, J. Rybicki, S. Voitovych, in:, Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2022, pp. 246–256.","ista":"Alistarh D-A, Rybicki J, Voitovych S. 2022. Near-optimal leader election in population protocols on graphs. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. PODC: Symposium on Principles of Distributed Computing, 246–256.","ama":"Alistarh D-A, Rybicki J, Voitovych S. Near-optimal leader election in population protocols on graphs. In: <i>Proceedings of the Annual ACM Symposium on Principles of Distributed Computing</i>. Association for Computing Machinery; 2022:246-256. doi:<a href=\"https://doi.org/10.1145/3519270.3538435\">10.1145/3519270.3538435</a>","chicago":"Alistarh, Dan-Adrian, Joel Rybicki, and Sasha Voitovych. “Near-Optimal Leader Election in Population Protocols on Graphs.” In <i>Proceedings of the Annual ACM Symposium on Principles of Distributed Computing</i>, 246–56. Association for Computing Machinery, 2022. <a href=\"https://doi.org/10.1145/3519270.3538435\">https://doi.org/10.1145/3519270.3538435</a>."},"external_id":{"arxiv":["2205.12597"],"isi":["001031439100030"]},"author":[{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian"},{"orcid":"0000-0002-6432-6646","first_name":"Joel","last_name":"Rybicki","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","full_name":"Rybicki, Joel"},{"first_name":"Sasha","last_name":"Voitovych","full_name":"Voitovych, Sasha"}],"doi":"10.1145/3519270.3538435","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"07","publisher":"Association for Computing Machinery","date_updated":"2025-12-30T09:04:17Z","year":"2022","corr_author":"1","publication":"Proceedings of the Annual ACM Symposium on Principles of Distributed Computing","publication_identifier":{"isbn":["9781450392624"]},"title":"Near-optimal leader election in population protocols on graphs","article_processing_charge":"Yes (via OA deal)","quality_controlled":"1","abstract":[{"text":"In the stochastic population protocol model, we are given a connected graph with n nodes, and in every time step, a scheduler samples an edge of the graph uniformly at random and the nodes connected by this edge interact. A fundamental task in this model is stable leader election, in which all nodes start in an identical state and the aim is to reach a configuration in which (1) exactly one node is elected as leader and (2) this node remains as the unique leader no matter what sequence of interactions follows. On cliques, the complexity of this problem has recently been settled: time-optimal protocols stabilize in Θ(n log n) expected steps using Θ(log log n) states, whereas protocols that use O(1) states require Θ(n2) expected steps.\r\n\r\nIn this work, we investigate the complexity of stable leader election on general graphs. We provide the first non-trivial time lower bounds for leader election on general graphs, showing that, when moving beyond cliques, the complexity landscape of leader election becomes very diverse: the time required to elect a leader can range from O(1) to Θ(n3) expected steps. On the upper bound side, we first observe that there exists a protocol that is time-optimal on many graph families, but uses polynomially-many states. In contrast, we give a near-time-optimal protocol that uses only O(log2n) states that is at most a factor log n slower. Finally, we show that the constant-state protocol of Beauquier et al. [OPODIS 2013] is at most a factor n log n slower than the fast polynomial-state protocol. Moreover, among constant-state protocols, this protocol has near-optimal average case complexity on dense random graphs.","lang":"eng"}],"file_date_updated":"2022-08-16T08:05:15Z","page":"246-256","language":[{"iso":"eng"}],"oa_version":"Published Version","license":"https://creativecommons.org/licenses/by/4.0/","status":"public","type":"conference","related_material":{"record":[{"relation":"later_version","id":"19969","status":"public"}]},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_published":"2022-07-21T00:00:00Z","arxiv":1,"acknowledgement":"We thank the anonymous reviewers for their helpful comments. We gratefully acknowledge funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML).","has_accepted_license":"1","scopus_import":"1","isi":1,"department":[{"_id":"DaAl"}],"project":[{"name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}]},{"publication":"Journal of Evolution Equations","publisher":"Springer Nature","date_updated":"2024-10-09T21:03:06Z","corr_author":"1","year":"2022","publication_identifier":{"issn":["1424-3199"],"eissn":["1424-3202"]},"title":"Nonlinear parabolic stochastic evolution equations in critical spaces part II","citation":{"short":"A. Agresti, M. Veraar, Journal of Evolution Equations 22 (2022).","apa":"Agresti, A., &#38; Veraar, M. (2022). Nonlinear parabolic stochastic evolution equations in critical spaces part II. <i>Journal of Evolution Equations</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00028-022-00786-7\">https://doi.org/10.1007/s00028-022-00786-7</a>","ieee":"A. Agresti and M. Veraar, “Nonlinear parabolic stochastic evolution equations in critical spaces part II,” <i>Journal of Evolution Equations</i>, vol. 22, no. 2. Springer Nature, 2022.","mla":"Agresti, Antonio, and Mark Veraar. “Nonlinear Parabolic Stochastic Evolution Equations in Critical Spaces Part II.” <i>Journal of Evolution Equations</i>, vol. 22, no. 2, 56, Springer Nature, 2022, doi:<a href=\"https://doi.org/10.1007/s00028-022-00786-7\">10.1007/s00028-022-00786-7</a>.","chicago":"Agresti, Antonio, and Mark Veraar. “Nonlinear Parabolic Stochastic Evolution Equations in Critical Spaces Part II.” <i>Journal of Evolution Equations</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/s00028-022-00786-7\">https://doi.org/10.1007/s00028-022-00786-7</a>.","ama":"Agresti A, Veraar M. Nonlinear parabolic stochastic evolution equations in critical spaces part II. <i>Journal of Evolution Equations</i>. 2022;22(2). doi:<a href=\"https://doi.org/10.1007/s00028-022-00786-7\">10.1007/s00028-022-00786-7</a>","ista":"Agresti A, Veraar M. 2022. Nonlinear parabolic stochastic evolution equations in critical spaces part II. Journal of Evolution Equations. 22(2), 56."},"external_id":{"isi":["000809108500001"]},"author":[{"first_name":"Antonio","orcid":"0000-0002-9573-2962","last_name":"Agresti","id":"673cd0cc-9b9a-11eb-b144-88f30e1fbb72","full_name":"Agresti, Antonio"},{"full_name":"Veraar, Mark","last_name":"Veraar","first_name":"Mark"}],"doi":"10.1007/s00028-022-00786-7","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","month":"06","keyword":["Mathematics (miscellaneous)"],"issue":"2","file":[{"content_type":"application/pdf","checksum":"59b99d1b48b6bd40983e7ce298524a21","creator":"kschuh","date_created":"2022-08-16T08:52:46Z","access_level":"open_access","relation":"main_file","file_size":1758371,"date_updated":"2022-08-16T08:52:46Z","file_id":"11862","file_name":"2022_Journal of Evolution Equations_Agresti.pdf","success":1}],"publication_status":"published","_id":"11858","day":"01","ddc":["510"],"date_created":"2022-08-16T08:39:43Z","oa":1,"has_accepted_license":"1","article_number":"56","date_published":"2022-06-01T00:00:00Z","acknowledgement":"The authors thank Emiel Lorist for helpful comments. The authors thank the anonymous referees for their helpful remarks to improve the presentation.\r\nOpen access funding provided by Institute of Science and Technology (IST Austria).","department":[{"_id":"JuFi"}],"isi":1,"scopus_import":"1","status":"public","type":"journal_article","intvolume":"        22","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"volume":22,"quality_controlled":"1","article_type":"original","article_processing_charge":"Yes (via OA deal)","language":[{"iso":"eng"}],"oa_version":"Published Version","abstract":[{"text":"This paper is a continuation of Part I of this project, where we developed a new local well-posedness theory for nonlinear stochastic PDEs with Gaussian noise. In the current Part II we consider blow-up criteria and regularization phenomena. As in Part I we can allow nonlinearities with polynomial growth and rough initial values from critical spaces. In the first main result we obtain several new blow-up criteria for quasi- and semilinear stochastic evolution equations. In particular, for semilinear equations we obtain a Serrin type blow-up criterium, which extends a recent result of Prüss–Simonett–Wilke (J Differ Equ 264(3):2028–2074, 2018) to the stochastic setting. Blow-up criteria can be used to prove global well-posedness for SPDEs. As in Part I, maximal regularity techniques and weights in time play a central role in the proofs. Our second contribution is a new method to bootstrap Sobolev and Hölder regularity in time and space, which does not require smoothness of the initial data. The blow-up criteria are at the basis of these new methods. Moreover, in applications the bootstrap results can be combined with our blow-up criteria, to obtain efficient ways to prove global existence. This gives new results even in classical 𝐿2-settings, which we illustrate for a concrete SPDE. In future works in preparation we apply the results of the current paper to obtain global well-posedness results and regularity for several concrete SPDEs. These include stochastic Navier–Stokes equations, reaction– diffusion equations and the Allen–Cahn equation. Our setting allows to put these SPDEs into a more flexible framework, where less restrictions on the nonlinearities are needed, and we are able to treat rough initial values from critical spaces. Moreover, we will obtain higher-order regularity results.","lang":"eng"}],"file_date_updated":"2022-08-16T08:52:46Z"},{"abstract":[{"text":"A domain is called Kac regular for a quadratic form on L2 if every functions vanishing almost everywhere outside the domain can be approximated in form norm by functions with compact support in the domain. It is shown that this notion is stable under domination of quadratic forms. As applications measure perturbations of quasi-regular Dirichlet forms, Cheeger energies on metric measure spaces and Schrödinger operators on manifolds are studied. Along the way a characterization of the Sobolev space with Dirichlet boundary conditions on domains in infinitesimally Riemannian metric measure spaces is obtained.","lang":"eng"}],"file_date_updated":"2022-08-18T08:02:34Z","language":[{"iso":"eng"}],"oa_version":"Published Version","article_processing_charge":"Yes (via OA deal)","quality_controlled":"1","article_type":"original","volume":7,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"intvolume":"         7","type":"journal_article","status":"public","scopus_import":"1","department":[{"_id":"JaMa"}],"date_published":"2022-07-01T00:00:00Z","article_number":"38","acknowledgement":"The author was supported by the German Academic Scholarship Foundation (Studienstiftung des deutschen Volkes) and by the German Research Foundation (DFG) via RTG 1523/2. The author would like to thank Daniel Lenz for his support and encouragement during the author’s ongoing graduate studies and him as well as Marcel Schmidt for fruitful discussions on domination of quadratic forms. He wants to thank Batu Güneysu and Peter Stollmann for valuable comments on a preliminary version of this article. He would also like to thank the organizers of the conference Analysis and Geometry on Graphs and Manifolds in Potsdam, where the initial motivation of this article was conceived, and the organizers of the intense activity period Metric Measure Spaces and Ricci Curvature at MPIM in Bonn, where this work was finished.\r\nOpen access funding provided by Institute of Science and Technology (IST Austria).","has_accepted_license":"1","oa":1,"ddc":["510"],"date_created":"2022-08-18T07:22:24Z","_id":"11916","day":"01","publication_status":"published","issue":"3","file":[{"access_level":"open_access","date_created":"2022-08-18T08:02:34Z","relation":"main_file","file_size":389060,"content_type":"application/pdf","checksum":"913474844a1b38264fb710746d5e2e98","creator":"dernst","date_updated":"2022-08-18T08:02:34Z","success":1,"file_name":"2022_AdvancesOperatorTheory_Wirth.pdf","file_id":"11921"}],"keyword":["Algebra and Number Theory","Analysis"],"author":[{"orcid":"0000-0002-0519-4241","first_name":"Melchior","full_name":"Wirth, Melchior","id":"88644358-0A0E-11EA-8FA5-49A33DDC885E","last_name":"Wirth"}],"doi":"10.1007/s43036-022-00199-w","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"07","citation":{"ieee":"M. Wirth, “Kac regularity and domination of quadratic forms,” <i>Advances in Operator Theory</i>, vol. 7, no. 3. Springer Nature, 2022.","mla":"Wirth, Melchior. “Kac Regularity and Domination of Quadratic Forms.” <i>Advances in Operator Theory</i>, vol. 7, no. 3, 38, Springer Nature, 2022, doi:<a href=\"https://doi.org/10.1007/s43036-022-00199-w\">10.1007/s43036-022-00199-w</a>.","apa":"Wirth, M. (2022). Kac regularity and domination of quadratic forms. <i>Advances in Operator Theory</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s43036-022-00199-w\">https://doi.org/10.1007/s43036-022-00199-w</a>","short":"M. Wirth, Advances in Operator Theory 7 (2022).","ista":"Wirth M. 2022. Kac regularity and domination of quadratic forms. Advances in Operator Theory. 7(3), 38.","chicago":"Wirth, Melchior. “Kac Regularity and Domination of Quadratic Forms.” <i>Advances in Operator Theory</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/s43036-022-00199-w\">https://doi.org/10.1007/s43036-022-00199-w</a>.","ama":"Wirth M. Kac regularity and domination of quadratic forms. <i>Advances in Operator Theory</i>. 2022;7(3). doi:<a href=\"https://doi.org/10.1007/s43036-022-00199-w\">10.1007/s43036-022-00199-w</a>"},"publication_identifier":{"eissn":["2538-225X"]},"title":"Kac regularity and domination of quadratic forms","publisher":"Springer Nature","date_updated":"2024-10-09T21:03:07Z","year":"2022","corr_author":"1","publication":"Advances in Operator Theory"},{"ec_funded":1,"_id":"11917","day":"01","ddc":["510"],"date_created":"2022-08-18T07:23:26Z","oa":1,"keyword":["Mathematical Physics","Statistical and Nonlinear Physics"],"file":[{"access_level":"open_access","date_created":"2022-08-18T08:09:00Z","file_size":483481,"relation":"main_file","creator":"dernst","checksum":"44418cb44f07fa21ed3907f85abf7f39","content_type":"application/pdf","date_updated":"2022-08-18T08:09:00Z","success":1,"file_id":"11922","file_name":"2022_JournalStatisticalPhysics_Rademacher.pdf"}],"publication_status":"published","citation":{"ieee":"S. A. E. Rademacher and R. Seiringer, “Large deviation estimates for weakly interacting bosons,” <i>Journal of Statistical Physics</i>, vol. 188. Springer Nature, 2022.","mla":"Rademacher, Simone Anna Elvira, and Robert Seiringer. “Large Deviation Estimates for Weakly Interacting Bosons.” <i>Journal of Statistical Physics</i>, vol. 188, 9, Springer Nature, 2022, doi:<a href=\"https://doi.org/10.1007/s10955-022-02940-4\">10.1007/s10955-022-02940-4</a>.","short":"S.A.E. Rademacher, R. Seiringer, Journal of Statistical Physics 188 (2022).","apa":"Rademacher, S. A. E., &#38; Seiringer, R. (2022). Large deviation estimates for weakly interacting bosons. <i>Journal of Statistical Physics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s10955-022-02940-4\">https://doi.org/10.1007/s10955-022-02940-4</a>","ista":"Rademacher SAE, Seiringer R. 2022. Large deviation estimates for weakly interacting bosons. Journal of Statistical Physics. 188, 9.","chicago":"Rademacher, Simone Anna Elvira, and Robert Seiringer. “Large Deviation Estimates for Weakly Interacting Bosons.” <i>Journal of Statistical Physics</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/s10955-022-02940-4\">https://doi.org/10.1007/s10955-022-02940-4</a>.","ama":"Rademacher SAE, Seiringer R. Large deviation estimates for weakly interacting bosons. <i>Journal of Statistical Physics</i>. 2022;188. doi:<a href=\"https://doi.org/10.1007/s10955-022-02940-4\">10.1007/s10955-022-02940-4</a>"},"external_id":{"isi":["000805175000001"]},"doi":"10.1007/s10955-022-02940-4","author":[{"full_name":"Rademacher, Simone Anna Elvira","id":"856966FE-A408-11E9-977E-802DE6697425","last_name":"Rademacher","orcid":"0000-0001-5059-4466","first_name":"Simone Anna Elvira"},{"id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","full_name":"Seiringer, Robert","last_name":"Seiringer","first_name":"Robert","orcid":"0000-0002-6781-0521"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","month":"07","publication":"Journal of Statistical Physics","date_updated":"2025-04-14T07:26:59Z","publisher":"Springer Nature","year":"2022","corr_author":"1","publication_identifier":{"eissn":["1572-9613"],"issn":["0022-4715"]},"title":"Large deviation estimates for weakly interacting bosons","quality_controlled":"1","article_type":"original","article_processing_charge":"Yes (via OA deal)","language":[{"iso":"eng"}],"oa_version":"Published Version","file_date_updated":"2022-08-18T08:09:00Z","abstract":[{"text":"We study the many-body dynamics of an initially factorized bosonic wave function in the mean-field regime. We prove large deviation estimates for the fluctuations around the condensate. We derive an upper bound extending a recent result to more general interactions. Furthermore, we derive a new lower bound which agrees with the upper bound in leading order.","lang":"eng"}],"status":"public","type":"journal_article","volume":188,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"intvolume":"       188","has_accepted_license":"1","date_published":"2022-07-01T00:00:00Z","article_number":"9","acknowledgement":"The authors thank Gérard Ben Arous for pointing out the question of a lower bound. Funding from the European Union’s Horizon 2020 research and innovation programme under the ERC Grant Agreement No. 694227 (R.S.) and under the Marie Skłodowska-Curie Grant Agreement No. 754411 (S.R.) is gratefully acknowledged.\r\nOpen access funding provided by IST Austria.","isi":1,"department":[{"_id":"RoSe"}],"scopus_import":"1","project":[{"_id":"25C6DC12-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Analysis of quantum many-body systems","grant_number":"694227"},{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships"}]},{"type":"conference","status":"public","extern":"1","publication_status":"published","day":"01","_id":"11918","article_processing_charge":"No","quality_controlled":"1","conference":{"name":"SODA: Symposium on Discrete Algorithms","location":"Alexandria, VA, United States","start_date":"2022-01-09","end_date":"2022-01-12"},"abstract":[{"lang":"eng","text":"Statistics of small subgraph counts such as triangles, four-cycles, and s-t paths of short lengths reveal important structural properties of the underlying graph. These problems have been widely studied in social network analysis. In most relevant applications, the graphs are not only massive but also change dynamically over time. Most of these problems become hard in the dynamic setting when considering the worst case. In this paper, we ask whether the question of small subgraph counting over dynamic graphs is hard also in the average case.\r\n\r\nWe consider the simplest possible average case model where the updates follow an Erdős-Rényi graph: each update selects a pair of vertices (u, v) uniformly at random and flips the existence of the edge (u, v). We develop new lower bounds and matching algorithms in this model for counting four-cycles, counting triangles through a specified point s, or a random queried point, and st paths of length 3, 4 and 5. Our results indicate while computing st paths of length 3, and 4 are easy in the average case with O(1) update time (note that they are hard in the worst case), it becomes hard when considering st paths of length 5.\r\n\r\nWe introduce new techniques which allow us to get average-case hardness for these graph problems from the worst-case hardness of the Online Matrix vector problem (OMv). Our techniques rely on recent advances in fine-grained average-case complexity. Our techniques advance this literature, giving the ability to prove new lower bounds on average-case dynamic algorithms."}],"date_created":"2022-08-18T07:26:19Z","oa_version":"None","language":[{"iso":"eng"}],"page":"459-498","year":"2022","publisher":"Society for Industrial and Applied Mathematics","date_updated":"2024-11-06T12:25:50Z","publication":"33rd Annual ACM-SIAM Symposium on Discrete Algorithms","title":"The complexity of average-case dynamic subgraph counting","publication_identifier":{"eisbn":["978-1-61197-707-3"]},"citation":{"short":"M. Henzinger, A. Lincoln, B. Saha, in:, 33rd Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2022, pp. 459–498.","apa":"Henzinger, M., Lincoln, A., &#38; Saha, B. (2022). The complexity of average-case dynamic subgraph counting. In <i>33rd Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 459–498). Alexandria, VA, United States: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611977073.23\">https://doi.org/10.1137/1.9781611977073.23</a>","mla":"Henzinger, Monika, et al. “The Complexity of Average-Case Dynamic Subgraph Counting.” <i>33rd Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Society for Industrial and Applied Mathematics, 2022, pp. 459–98, doi:<a href=\"https://doi.org/10.1137/1.9781611977073.23\">10.1137/1.9781611977073.23</a>.","ieee":"M. Henzinger, A. Lincoln, and B. Saha, “The complexity of average-case dynamic subgraph counting,” in <i>33rd Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Alexandria, VA, United States, 2022, pp. 459–498.","ama":"Henzinger M, Lincoln A, Saha B. The complexity of average-case dynamic subgraph counting. In: <i>33rd Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Society for Industrial and Applied Mathematics; 2022:459-498. doi:<a href=\"https://doi.org/10.1137/1.9781611977073.23\">10.1137/1.9781611977073.23</a>","chicago":"Henzinger, Monika, Andrea Lincoln, and Barna Saha. “The Complexity of Average-Case Dynamic Subgraph Counting.” In <i>33rd Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 459–98. Society for Industrial and Applied Mathematics, 2022. <a href=\"https://doi.org/10.1137/1.9781611977073.23\">https://doi.org/10.1137/1.9781611977073.23</a>.","ista":"Henzinger M, Lincoln A, Saha B. 2022. The complexity of average-case dynamic subgraph counting. 33rd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 459–498."},"date_published":"2022-01-01T00:00:00Z","month":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","doi":"10.1137/1.9781611977073.23","author":[{"orcid":"0000-0002-5008-6530","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","last_name":"Henzinger"},{"last_name":"Lincoln","full_name":"Lincoln, Andrea","first_name":"Andrea"},{"last_name":"Saha","full_name":"Saha, Barna","first_name":"Barna"}]},{"type":"conference","status":"public","extern":"1","article_processing_charge":"No","quality_controlled":"1","abstract":[{"text":"We present a practically efficient algorithm for maintaining a global minimum cut in large dynamic graphs under both edge insertions and deletions. While there has been theoretical work on this problem, our algorithm is the first implementation of a fully-dynamic algorithm. The algorithm uses the theoretical foundation and combines it with efficient and finely-tuned implementations to give an algorithm that can maintain the global minimum cut of a graph with rapid update times. We show that our algorithm gives up to multiple orders of magnitude speedup compared to static approaches both on edge insertions and deletions.","lang":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/2101.05033","open_access":"1"}],"page":"13-26","language":[{"iso":"eng"}],"oa_version":"Preprint","date_published":"2022-01-01T00:00:00Z","arxiv":1,"scopus_import":"1","publication_status":"published","_id":"11930","day":"01","conference":{"end_date":"2022-01-10","start_date":"2022-01-09","name":"ALENEX: Symposium on Algorithm Engineering and Experiments","location":"Alexandria, VA, United States"},"oa":1,"date_created":"2022-08-19T07:27:51Z","date_updated":"2024-11-06T12:26:51Z","publisher":"Society for Industrial and Applied Mathematics","year":"2022","publication":"2022 Proceedings of the Symposium on Algorithm Engineering and Experiments","publication_identifier":{"eisbn":["978-1-61197-704-2"]},"title":"Practical fully dynamic minimum cut algorithms","external_id":{"arxiv":["2101.05033"]},"citation":{"ieee":"M. Henzinger, A. Noe, and C. Schulz, “Practical fully dynamic minimum cut algorithms,” in <i>2022 Proceedings of the Symposium on Algorithm Engineering and Experiments</i>, Alexandria, VA, United States, 2022, pp. 13–26.","mla":"Henzinger, Monika, et al. “Practical Fully Dynamic Minimum Cut Algorithms.” <i>2022 Proceedings of the Symposium on Algorithm Engineering and Experiments</i>, Society for Industrial and Applied Mathematics, 2022, pp. 13–26, doi:<a href=\"https://doi.org/10.1137/1.9781611977042.2\">10.1137/1.9781611977042.2</a>.","short":"M. Henzinger, A. Noe, C. Schulz, in:, 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments, Society for Industrial and Applied Mathematics, 2022, pp. 13–26.","apa":"Henzinger, M., Noe, A., &#38; Schulz, C. (2022). Practical fully dynamic minimum cut algorithms. In <i>2022 Proceedings of the Symposium on Algorithm Engineering and Experiments</i> (pp. 13–26). Alexandria, VA, United States: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611977042.2\">https://doi.org/10.1137/1.9781611977042.2</a>","ista":"Henzinger M, Noe A, Schulz C. 2022. Practical fully dynamic minimum cut algorithms. 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments. ALENEX: Symposium on Algorithm Engineering and Experiments, 13–26.","chicago":"Henzinger, Monika, Alexander Noe, and Christian Schulz. “Practical Fully Dynamic Minimum Cut Algorithms.” In <i>2022 Proceedings of the Symposium on Algorithm Engineering and Experiments</i>, 13–26. Society for Industrial and Applied Mathematics, 2022. <a href=\"https://doi.org/10.1137/1.9781611977042.2\">https://doi.org/10.1137/1.9781611977042.2</a>.","ama":"Henzinger M, Noe A, Schulz C. Practical fully dynamic minimum cut algorithms. In: <i>2022 Proceedings of the Symposium on Algorithm Engineering and Experiments</i>. Society for Industrial and Applied Mathematics; 2022:13-26. doi:<a href=\"https://doi.org/10.1137/1.9781611977042.2\">10.1137/1.9781611977042.2</a>"},"doi":"10.1137/1.9781611977042.2","author":[{"first_name":"Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","last_name":"Henzinger"},{"first_name":"Alexander","last_name":"Noe","full_name":"Noe, Alexander"},{"full_name":"Schulz, Christian","last_name":"Schulz","first_name":"Christian"}],"month":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"publisher":"Springer Nature","date_updated":"2024-10-09T21:03:16Z","corr_author":"1","year":"2022","publication":"Nature Communications","publication_identifier":{"eissn":["2041-1723"]},"title":"Thermodynamics of high-pressure ice phases explored with atomistic simulations","external_id":{"pmid":["35948550"],"isi":["000838655300022"]},"citation":{"ista":"Reinhardt A, Bethkenhagen M, Coppari F, Millot M, Hamel S, Cheng B. 2022. Thermodynamics of high-pressure ice phases explored with atomistic simulations. Nature Communications. 13, 4707.","chicago":"Reinhardt, Aleks, Mandy Bethkenhagen, Federica Coppari, Marius Millot, Sebastien Hamel, and Bingqing Cheng. “Thermodynamics of High-Pressure Ice Phases Explored with Atomistic Simulations.” <i>Nature Communications</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1038/s41467-022-32374-1\">https://doi.org/10.1038/s41467-022-32374-1</a>.","ama":"Reinhardt A, Bethkenhagen M, Coppari F, Millot M, Hamel S, Cheng B. Thermodynamics of high-pressure ice phases explored with atomistic simulations. <i>Nature Communications</i>. 2022;13. doi:<a href=\"https://doi.org/10.1038/s41467-022-32374-1\">10.1038/s41467-022-32374-1</a>","ieee":"A. Reinhardt, M. Bethkenhagen, F. Coppari, M. Millot, S. Hamel, and B. Cheng, “Thermodynamics of high-pressure ice phases explored with atomistic simulations,” <i>Nature Communications</i>, vol. 13. Springer Nature, 2022.","mla":"Reinhardt, Aleks, et al. “Thermodynamics of High-Pressure Ice Phases Explored with Atomistic Simulations.” <i>Nature Communications</i>, vol. 13, 4707, Springer Nature, 2022, doi:<a href=\"https://doi.org/10.1038/s41467-022-32374-1\">10.1038/s41467-022-32374-1</a>.","short":"A. Reinhardt, M. Bethkenhagen, F. Coppari, M. Millot, S. Hamel, B. Cheng, Nature Communications 13 (2022).","apa":"Reinhardt, A., Bethkenhagen, M., Coppari, F., Millot, M., Hamel, S., &#38; Cheng, B. (2022). Thermodynamics of high-pressure ice phases explored with atomistic simulations. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-022-32374-1\">https://doi.org/10.1038/s41467-022-32374-1</a>"},"doi":"10.1038/s41467-022-32374-1","author":[{"first_name":"Aleks","last_name":"Reinhardt","full_name":"Reinhardt, Aleks"},{"last_name":"Bethkenhagen","full_name":"Bethkenhagen, Mandy","first_name":"Mandy"},{"first_name":"Federica","last_name":"Coppari","full_name":"Coppari, Federica"},{"first_name":"Marius","full_name":"Millot, Marius","last_name":"Millot"},{"first_name":"Sebastien","full_name":"Hamel, Sebastien","last_name":"Hamel"},{"full_name":"Cheng, Bingqing","id":"cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9","last_name":"Cheng","orcid":"0000-0002-3584-9632","first_name":"Bingqing"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","month":"08","publication_status":"published","file":[{"success":1,"file_name":"2022_NatureCommunications_Reinhardt.pdf","file_id":"11939","date_updated":"2022-08-22T06:33:02Z","date_created":"2022-08-22T06:33:02Z","access_level":"open_access","file_size":1767206,"relation":"main_file","creator":"dernst","checksum":"8ff9b689cde59fd3a9959a9f01929dea","content_type":"application/pdf"}],"_id":"11937","day":"10","oa":1,"ddc":["540"],"date_created":"2022-08-21T22:01:55Z","pmid":1,"article_number":"4707","date_published":"2022-08-10T00:00:00Z","acknowledgement":"We thank Chris Pickard for providing the initial structures of high-pressure ice phases and for useful advice. A.R. and B.C. acknowledge resources provided by the Cambridge Tier-2 system operated by the University of Cambridge Research Computing Service funded by EPSRC Tier-2 capital grant EP/P020259/1. M.B. was supported by the European Union within the Marie Skłodowska-Curie actions (xICE grant 894725) and acknowledges computational resources at North-German Supercomputing Alliance (HLRN) facilities. S.H. and M.M. acknowledge support from LDRD 19-ERD-031 and computing support from the Lawrence Livermore National Laboratory (LLNL) Institutional Computing Grand Challenge programme. F.C. acknowledges support from the US DOE Office of Science, Office of Fusion Energy Sciences. Lawrence Livermore National Laboratory is operated by Lawrence Livermore National Security, LLC, for the U.S. Department of Energy, National Nuclear Security Administration under Contract DE-AC52-07NA27344.","has_accepted_license":"1","scopus_import":"1","department":[{"_id":"BiCh"}],"isi":1,"status":"public","type":"journal_article","volume":13,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"intvolume":"        13","article_processing_charge":"No","quality_controlled":"1","article_type":"original","abstract":[{"text":"Most experimentally known high-pressure ice phases have a body-centred cubic (bcc) oxygen lattice. Our large-scale molecular-dynamics simulations with a machine-learning potential indicate that, amongst these bcc ice phases, ices VII, VII′ and X are the same thermodynamic phase under different conditions, whereas superionic ice VII″ has a first-order phase boundary with ice VII′. Moreover, at about 300 GPa, the transformation between ice X and the Pbcm phase has a sharp structural change but no apparent activation barrier, whilst at higher pressures the barrier gradually increases. Our study thus clarifies the phase behaviour of the high-pressure ices and reveals peculiar solid–solid transition mechanisms not known in other systems.","lang":"eng"}],"file_date_updated":"2022-08-22T06:33:02Z","language":[{"iso":"eng"}],"oa_version":"Published Version"},{"acknowledged_ssus":[{"_id":"Bio"},{"_id":"SSU"}],"title":"A direct excitatory projection from entorhinal layer 6b neurons to the hippocampus contributes to spatial coding and memory","publication_identifier":{"issn":["2041-1723"]},"publication":"Nature Communications","corr_author":"1","year":"2022","date_updated":"2025-06-12T06:10:44Z","publisher":"Springer Nature","month":"08","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1038/s41467-022-32559-8","author":[{"first_name":"Yoav","last_name":"Ben Simon","id":"43DF3136-F248-11E8-B48F-1D18A9856A87","full_name":"Ben Simon, Yoav"},{"id":"2DAA49AA-F248-11E8-B48F-1D18A9856A87","full_name":"Käfer, Karola","last_name":"Käfer","first_name":"Karola"},{"orcid":"0000-0002-2340-7431","first_name":"Philipp","last_name":"Velicky","id":"39BDC62C-F248-11E8-B48F-1D18A9856A87","full_name":"Velicky, Philipp"},{"orcid":"0000-0002-5193-4036","first_name":"Jozsef L","last_name":"Csicsvari","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","full_name":"Csicsvari, Jozsef L"},{"full_name":"Danzl, Johann G","id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87","last_name":"Danzl","first_name":"Johann G","orcid":"0000-0001-8559-3973"},{"orcid":"0000-0001-5001-4804","first_name":"Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","full_name":"Jonas, Peter M","last_name":"Jonas"}],"external_id":{"isi":["000841396400008"],"pmid":["35974109"]},"citation":{"ieee":"Y. Ben Simon, K. Käfer, P. Velicky, J. L. Csicsvari, J. G. Danzl, and P. M. Jonas, “A direct excitatory projection from entorhinal layer 6b neurons to the hippocampus contributes to spatial coding and memory,” <i>Nature Communications</i>, vol. 13. Springer Nature, 2022.","mla":"Ben Simon, Yoav, et al. “A Direct Excitatory Projection from Entorhinal Layer 6b Neurons to the Hippocampus Contributes to Spatial Coding and Memory.” <i>Nature Communications</i>, vol. 13, 4826, Springer Nature, 2022, doi:<a href=\"https://doi.org/10.1038/s41467-022-32559-8\">10.1038/s41467-022-32559-8</a>.","short":"Y. Ben Simon, K. Käfer, P. Velicky, J.L. Csicsvari, J.G. Danzl, P.M. Jonas, Nature Communications 13 (2022).","apa":"Ben Simon, Y., Käfer, K., Velicky, P., Csicsvari, J. L., Danzl, J. G., &#38; Jonas, P. M. (2022). A direct excitatory projection from entorhinal layer 6b neurons to the hippocampus contributes to spatial coding and memory. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-022-32559-8\">https://doi.org/10.1038/s41467-022-32559-8</a>","ista":"Ben Simon Y, Käfer K, Velicky P, Csicsvari JL, Danzl JG, Jonas PM. 2022. A direct excitatory projection from entorhinal layer 6b neurons to the hippocampus contributes to spatial coding and memory. Nature Communications. 13, 4826.","chicago":"Ben Simon, Yoav, Karola Käfer, Philipp Velicky, Jozsef L Csicsvari, Johann G Danzl, and Peter M Jonas. “A Direct Excitatory Projection from Entorhinal Layer 6b Neurons to the Hippocampus Contributes to Spatial Coding and Memory.” <i>Nature Communications</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1038/s41467-022-32559-8\">https://doi.org/10.1038/s41467-022-32559-8</a>.","ama":"Ben Simon Y, Käfer K, Velicky P, Csicsvari JL, Danzl JG, Jonas PM. A direct excitatory projection from entorhinal layer 6b neurons to the hippocampus contributes to spatial coding and memory. <i>Nature Communications</i>. 2022;13. doi:<a href=\"https://doi.org/10.1038/s41467-022-32559-8\">10.1038/s41467-022-32559-8</a>"},"file":[{"date_updated":"2022-08-26T11:51:40Z","file_name":"2022_NatureCommunications_BenSimon.pdf","file_id":"11990","success":1,"content_type":"application/pdf","creator":"dernst","checksum":"405936d9e4d33625d80c093c9713a91f","date_created":"2022-08-26T11:51:40Z","access_level":"open_access","relation":"main_file","file_size":5910357}],"publication_status":"published","keyword":["General Physics and Astronomy","General Biochemistry","Genetics and Molecular Biology","General Chemistry","Multidisciplinary"],"date_created":"2022-08-24T08:25:50Z","ddc":["570"],"oa":1,"ec_funded":1,"day":"16","_id":"11951","pmid":1,"project":[{"name":"Biophysics and circuit function of a giant cortical glutamatergic synapse","grant_number":"692692","_id":"25B7EB9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"name":"Optical control of synaptic function via adhesion molecules","grant_number":"I03600","_id":"265CB4D0-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"Z00312","name":"Synaptic communication in neuronal microcircuits","call_identifier":"FWF","_id":"25C5A090-B435-11E9-9278-68D0E5697425"}],"isi":1,"department":[{"_id":"JoCs"},{"_id":"PeJo"},{"_id":"JoDa"}],"scopus_import":"1","has_accepted_license":"1","acknowledgement":"We thank F. Marr and A. Schlögl for technical assistance, E. Kralli-Beller for manuscript editing, as well as C. Sommer and the Imaging and Optics Facility of the Institute of Science and Technology Austria (ISTA) for image analysis scripts and microscopy support. We extend our gratitude to J. Wallenschus and D. Rangel Guerrero for technical assistance acquiring single-unit data and I. Gridchyn for help with single-unit clustering. Finally, we also thank B. Suter for discussions, A. Saunders, M. Jösch, and H. Monyer for critically reading earlier versions of the manuscript, C. Petersen for sharing clearing protocols, and the Scientific Service Units of ISTA for efficient support. This project was funded by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (ERC advanced grant No 692692 to P.J.) and the Fond zur Förderung der Wissenschaftlichen Forschung (Z 312-B27, Wittgenstein award for P.J. and I3600-B27 for J.G.D. and P.V.).","date_published":"2022-08-16T00:00:00Z","article_number":"4826","intvolume":"        13","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"volume":13,"type":"journal_article","status":"public","oa_version":"Published Version","language":[{"iso":"eng"}],"file_date_updated":"2022-08-26T11:51:40Z","abstract":[{"lang":"eng","text":"The mammalian hippocampal formation (HF) plays a key role in several higher brain functions, such as spatial coding, learning and memory. Its simple circuit architecture is often viewed as a trisynaptic loop, processing input originating from the superficial layers of the entorhinal cortex (EC) and sending it back to its deeper layers. Here, we show that excitatory neurons in layer 6b of the mouse EC project to all sub-regions comprising the HF and receive input from the CA1, thalamus and claustrum. Furthermore, their output is characterized by unique slow-decaying excitatory postsynaptic currents capable of driving plateau-like potentials in their postsynaptic targets. Optogenetic inhibition of the EC-6b pathway affects spatial coding in CA1 pyramidal neurons, while cell ablation impairs not only acquisition of new spatial memories, but also degradation of previously acquired ones. Our results provide evidence of a functional role for cortical layer 6b neurons in the adult brain."}],"article_type":"original","quality_controlled":"1","article_processing_charge":"No"},{"publication_status":"published","issue":"21","oa":1,"date_created":"2022-08-24T10:41:25Z","_id":"11955","day":"16","publication_identifier":{"issn":["1433-7851"],"eissn":["1521-3773"]},"title":"Acridine‐functionalized covalent organic frameworks (COFs) as photocatalysts for metallaphotocatalytic C−N cross‐coupling","date_updated":"2024-10-14T11:42:54Z","publisher":"Wiley","year":"2022","publication":"Angewandte Chemie International Edition","author":[{"last_name":"Traxler","full_name":"Traxler, Michael","first_name":"Michael"},{"last_name":"Gisbertz","full_name":"Gisbertz, Sebastian","first_name":"Sebastian"},{"full_name":"Pachfule, Pradip","last_name":"Pachfule","first_name":"Pradip"},{"full_name":"Schmidt, Johannes","last_name":"Schmidt","first_name":"Johannes"},{"first_name":"Jérôme","full_name":"Roeser, Jérôme","last_name":"Roeser"},{"first_name":"Susanne","last_name":"Reischauer","full_name":"Reischauer, Susanne"},{"first_name":"Jabor","full_name":"Rabeah, Jabor","last_name":"Rabeah"},{"first_name":"Bartholomäus","orcid":"0000-0001-8689-388X","last_name":"Pieber","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","full_name":"Pieber, Bartholomäus"},{"full_name":"Thomas, Arne","last_name":"Thomas","first_name":"Arne"}],"doi":"10.1002/anie.202117738","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"05","citation":{"ieee":"M. Traxler <i>et al.</i>, “Acridine‐functionalized covalent organic frameworks (COFs) as photocatalysts for metallaphotocatalytic C−N cross‐coupling,” <i>Angewandte Chemie International Edition</i>, vol. 61, no. 21. Wiley, 2022.","mla":"Traxler, Michael, et al. “Acridine‐functionalized Covalent Organic Frameworks (COFs) as Photocatalysts for Metallaphotocatalytic C−N Cross‐coupling.” <i>Angewandte Chemie International Edition</i>, vol. 61, no. 21, e202117738, Wiley, 2022, doi:<a href=\"https://doi.org/10.1002/anie.202117738\">10.1002/anie.202117738</a>.","apa":"Traxler, M., Gisbertz, S., Pachfule, P., Schmidt, J., Roeser, J., Reischauer, S., … Thomas, A. (2022). Acridine‐functionalized covalent organic frameworks (COFs) as photocatalysts for metallaphotocatalytic C−N cross‐coupling. <i>Angewandte Chemie International Edition</i>. Wiley. <a href=\"https://doi.org/10.1002/anie.202117738\">https://doi.org/10.1002/anie.202117738</a>","short":"M. Traxler, S. Gisbertz, P. Pachfule, J. Schmidt, J. Roeser, S. Reischauer, J. Rabeah, B. Pieber, A. Thomas, Angewandte Chemie International Edition 61 (2022).","ista":"Traxler M, Gisbertz S, Pachfule P, Schmidt J, Roeser J, Reischauer S, Rabeah J, Pieber B, Thomas A. 2022. Acridine‐functionalized covalent organic frameworks (COFs) as photocatalysts for metallaphotocatalytic C−N cross‐coupling. Angewandte Chemie International Edition. 61(21), e202117738.","chicago":"Traxler, Michael, Sebastian Gisbertz, Pradip Pachfule, Johannes Schmidt, Jérôme Roeser, Susanne Reischauer, Jabor Rabeah, Bartholomäus Pieber, and Arne Thomas. “Acridine‐functionalized Covalent Organic Frameworks (COFs) as Photocatalysts for Metallaphotocatalytic C−N Cross‐coupling.” <i>Angewandte Chemie International Edition</i>. Wiley, 2022. <a href=\"https://doi.org/10.1002/anie.202117738\">https://doi.org/10.1002/anie.202117738</a>.","ama":"Traxler M, Gisbertz S, Pachfule P, et al. Acridine‐functionalized covalent organic frameworks (COFs) as photocatalysts for metallaphotocatalytic C−N cross‐coupling. <i>Angewandte Chemie International Edition</i>. 2022;61(21). doi:<a href=\"https://doi.org/10.1002/anie.202117738\">10.1002/anie.202117738</a>"},"external_id":{"pmid":["35188714"]},"intvolume":"        61","volume":61,"type":"journal_article","status":"public","extern":"1","abstract":[{"text":"Covalent organic frameworks (COFs) are structurally tuneable, porous and crystalline polymers constructed through the covalent attachment of small organic building blocks as elementary units. Using the myriad of such building blocks, a broad spectrum of functionalities has been applied for COF syntheses for broad applications, including heterogeneous catalysis. Herein, we report the synthesis of a new family of porous and crystalline COFs using a novel acridine linker and benzene-1,3,5-tricarbaldehyde derivatives bearing a variable number of hydroxy groups. With the broad absorption in the visible light region, the COFs were applied as photocatalysts in metallaphotocatalytic C−N cross-coupling. The fully β-ketoenamine linked COF showed the highest activity, due to the increased charge separation upon irradiation. The COF showed good to excellent yields for several aryl bromides, good recyclability and even catalyzed the organic transformation in presence of green light as energy source.","lang":"eng"}],"language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1002/anie.202117738"}],"oa_version":"Published Version","article_processing_charge":"No","quality_controlled":"1","article_type":"original","pmid":1,"scopus_import":"1","article_number":"e202117738","date_published":"2022-05-16T00:00:00Z"},{"issue":"3","publication_status":"published","date_created":"2022-08-27T11:23:37Z","oa":1,"_id":"11991","day":"01","publication_identifier":{"issn":["2372-3491"]},"title":"An invitation to the promise constraint satisfaction problem","publication":"ACM SIGLOG News","publisher":"Association for Computing Machinery","date_updated":"2022-09-05T08:19:38Z","year":"2022","doi":"10.1145/3559736.3559740","author":[{"full_name":"Krokhin, Andrei","last_name":"Krokhin","first_name":"Andrei"},{"orcid":"0000-0003-1245-3456","first_name":"Jakub","last_name":"Opršal","id":"ec596741-c539-11ec-b829-c79322a91242","full_name":"Opršal, Jakub"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"07","citation":{"ista":"Krokhin A, Opršal J. 2022. An invitation to the promise constraint satisfaction problem. ACM SIGLOG News. 9(3), 30–59.","ama":"Krokhin A, Opršal J. An invitation to the promise constraint satisfaction problem. <i>ACM SIGLOG News</i>. 2022;9(3):30-59. doi:<a href=\"https://doi.org/10.1145/3559736.3559740\">10.1145/3559736.3559740</a>","chicago":"Krokhin, Andrei, and Jakub Opršal. “An Invitation to the Promise Constraint Satisfaction Problem.” <i>ACM SIGLOG News</i>. Association for Computing Machinery, 2022. <a href=\"https://doi.org/10.1145/3559736.3559740\">https://doi.org/10.1145/3559736.3559740</a>.","mla":"Krokhin, Andrei, and Jakub Opršal. “An Invitation to the Promise Constraint Satisfaction Problem.” <i>ACM SIGLOG News</i>, vol. 9, no. 3, Association for Computing Machinery, 2022, pp. 30–59, doi:<a href=\"https://doi.org/10.1145/3559736.3559740\">10.1145/3559736.3559740</a>.","ieee":"A. Krokhin and J. Opršal, “An invitation to the promise constraint satisfaction problem,” <i>ACM SIGLOG News</i>, vol. 9, no. 3. Association for Computing Machinery, pp. 30–59, 2022.","apa":"Krokhin, A., &#38; Opršal, J. (2022). An invitation to the promise constraint satisfaction problem. <i>ACM SIGLOG News</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3559736.3559740\">https://doi.org/10.1145/3559736.3559740</a>","short":"A. Krokhin, J. Opršal, ACM SIGLOG News 9 (2022) 30–59."},"external_id":{"arxiv":["2208.13538"]},"volume":9,"intvolume":"         9","status":"public","type":"journal_article","language":[{"iso":"eng"}],"main_file_link":[{"url":"http://arxiv.org/abs/2208.13538","open_access":"1"}],"page":"30-59","oa_version":"Preprint","abstract":[{"text":"The study of the complexity of the constraint satisfaction problem (CSP), centred around the Feder-Vardi Dichotomy Conjecture, has been very prominent in the last two decades. After a long concerted effort and many partial results, the Dichotomy Conjecture has been proved in 2017 independently by Bulatov and Zhuk. At about the same time, a vast generalisation of CSP, called promise CSP, has started to gain prominence. In this survey, we explain the importance of promise CSP and highlight many new very interesting features that the study of promise CSP has brought to light. The complexity classification quest for the promise CSP is wide open, and we argue that, despite the promise CSP being more general, this quest is rather more accessible to a wide range of researchers than the dichotomy-led study of the CSP has been.","lang":"eng"}],"quality_controlled":"1","article_type":"original","article_processing_charge":"No","department":[{"_id":"UlWa"}],"date_published":"2022-07-01T00:00:00Z","arxiv":1},{"date_published":"2022-09-01T00:00:00Z","has_accepted_license":"1","scopus_import":"1","isi":1,"department":[{"_id":"BeBi"}],"type":"journal_article","status":"public","intvolume":"        41","volume":41,"article_processing_charge":"No","article_type":"original","quality_controlled":"1","abstract":[{"text":"Moulding refers to a set of manufacturing techniques in which a mould, usually a cavity or a solid frame, is used to shape a liquid or pliable material into an object of the desired shape. The popularity of moulding comes from its effectiveness, scalability and versatility in terms of employed materials. Its relevance as a fabrication process is demonstrated by the extensive literature covering different aspects related to mould design, from material flow simulation to the automation of mould geometry design. In this state-of-the-art report, we provide an extensive review of the automatic methods for the design of moulds, focusing on contributions from a geometric perspective. We classify existing mould design methods based on their computational approach and the nature of their target moulding process. We summarize the relationships between computational approaches and moulding techniques, highlighting their strengths and limitations. Finally, we discuss potential future research directions.","lang":"eng"}],"file_date_updated":"2022-08-28T18:18:08Z","oa_version":"Submitted Version","language":[{"iso":"eng"}],"page":"435-452","year":"2022","corr_author":"1","date_updated":"2024-10-09T21:03:21Z","publisher":"Wiley","publication":"Computer Graphics Forum","title":"State of the art in computational mould design","publication_identifier":{"eissn":["1467-8659"],"issn":["0167-7055"]},"citation":{"ista":"Alderighi T, Malomo L, Auzinger T, Bickel B, Cignoni P, Pietroni N. 2022. State of the art in computational mould design. Computer Graphics Forum. 41(6), 435–452.","chicago":"Alderighi, Thomas, Luigi Malomo, Thomas Auzinger, Bernd Bickel, Paulo Cignoni, and Nico Pietroni. “State of the Art in Computational Mould Design.” <i>Computer Graphics Forum</i>. Wiley, 2022. <a href=\"https://doi.org/10.1111/cgf.14581\">https://doi.org/10.1111/cgf.14581</a>.","ama":"Alderighi T, Malomo L, Auzinger T, Bickel B, Cignoni P, Pietroni N. State of the art in computational mould design. <i>Computer Graphics Forum</i>. 2022;41(6):435-452. doi:<a href=\"https://doi.org/10.1111/cgf.14581\">10.1111/cgf.14581</a>","ieee":"T. Alderighi, L. Malomo, T. Auzinger, B. Bickel, P. Cignoni, and N. Pietroni, “State of the art in computational mould design,” <i>Computer Graphics Forum</i>, vol. 41, no. 6. Wiley, pp. 435–452, 2022.","mla":"Alderighi, Thomas, et al. “State of the Art in Computational Mould Design.” <i>Computer Graphics Forum</i>, vol. 41, no. 6, Wiley, 2022, pp. 435–52, doi:<a href=\"https://doi.org/10.1111/cgf.14581\">10.1111/cgf.14581</a>.","apa":"Alderighi, T., Malomo, L., Auzinger, T., Bickel, B., Cignoni, P., &#38; Pietroni, N. (2022). State of the art in computational mould design. <i>Computer Graphics Forum</i>. Wiley. <a href=\"https://doi.org/10.1111/cgf.14581\">https://doi.org/10.1111/cgf.14581</a>","short":"T. Alderighi, L. Malomo, T. Auzinger, B. Bickel, P. Cignoni, N. Pietroni, Computer Graphics Forum 41 (2022) 435–452."},"external_id":{"isi":["000842638900001"]},"month":"09","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","doi":"10.1111/cgf.14581","author":[{"full_name":"Alderighi, Thomas","last_name":"Alderighi","first_name":"Thomas"},{"last_name":"Malomo","full_name":"Malomo, Luigi","first_name":"Luigi"},{"first_name":"Thomas","orcid":"0000-0002-1546-3265","id":"4718F954-F248-11E8-B48F-1D18A9856A87","full_name":"Auzinger, Thomas","last_name":"Auzinger"},{"last_name":"Bickel","full_name":"Bickel, Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","first_name":"Bernd"},{"last_name":"Cignoni","full_name":"Cignoni, Paulo","first_name":"Paulo"},{"first_name":"Nico","last_name":"Pietroni","full_name":"Pietroni, Nico"}],"keyword":["Computer Graphics and Computer-Aided Design"],"publication_status":"published","file":[{"description":"This is the pre-peer reviewed version of the following article: Alderighi, T., Malomo, L., Auzinger, T., Bickel, B., Cignoni, P. and Pietroni, N. (2022), State of the Art in Computational Mould Design. Computer Graphics Forum, which has been published in final form at https://doi.org/10.1111/cgf.14581. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Use of Self-Archived Versions.","content_type":"application/pdf","checksum":"c40cc8ceb7b7f0512172b883d712198e","creator":"bbickel","date_created":"2022-08-28T18:18:08Z","access_level":"open_access","file_size":32480850,"relation":"main_file","date_updated":"2022-08-28T18:18:08Z","file_id":"11994","file_name":"star_molding_preprint.pdf","title":"pre-peer reviewed version"}],"issue":"6","day":"01","_id":"11993","oa":1,"date_created":"2022-08-28T18:17:01Z","ddc":["000"]},{"external_id":{"pmid":["35951689 "]},"citation":{"ama":"Palacci JA. A soft active matter that can climb walls. <i>Science</i>. 2022;377(6607):710-711. doi:<a href=\"https://doi.org/10.1126/science.adc9202\">10.1126/science.adc9202</a>","chicago":"Palacci, Jérémie A. “A Soft Active Matter That Can Climb Walls.” <i>Science</i>. American Association for the Advancement of Science, 2022. <a href=\"https://doi.org/10.1126/science.adc9202\">https://doi.org/10.1126/science.adc9202</a>.","ista":"Palacci JA. 2022. A soft active matter that can climb walls. Science. 377(6607), 710–711.","short":"J.A. Palacci, Science 377 (2022) 710–711.","apa":"Palacci, J. A. (2022). A soft active matter that can climb walls. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.adc9202\">https://doi.org/10.1126/science.adc9202</a>","mla":"Palacci, Jérémie A. “A Soft Active Matter That Can Climb Walls.” <i>Science</i>, vol. 377, no. 6607, American Association for the Advancement of Science, 2022, pp. 710–11, doi:<a href=\"https://doi.org/10.1126/science.adc9202\">10.1126/science.adc9202</a>.","ieee":"J. A. Palacci, “A soft active matter that can climb walls,” <i>Science</i>, vol. 377, no. 6607. American Association for the Advancement of Science, pp. 710–711, 2022."},"author":[{"id":"8fb92548-2b22-11eb-b7c1-a3f0d08d7c7d","full_name":"Palacci, Jérémie A","last_name":"Palacci","first_name":"Jérémie A","orcid":"0000-0002-7253-9465"}],"doi":"10.1126/science.adc9202","month":"08","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-10-09T21:03:21Z","publisher":"American Association for the Advancement of Science","year":"2022","corr_author":"1","publication":"Science","publication_identifier":{"issn":["0036-8075"],"eissn":["1095-9203"]},"title":"A soft active matter that can climb walls","_id":"11996","day":"12","date_created":"2022-08-28T22:02:00Z","publication_status":"published","issue":"6607","date_published":"2022-08-12T00:00:00Z","scopus_import":"1","department":[{"_id":"JePa"}],"pmid":1,"article_processing_charge":"No","quality_controlled":"1","article_type":"letter_note","abstract":[{"lang":"eng","text":"If you mix fruit syrups with alcohol to make a schnapps, the two liquids will remain perfectly blended forever. But if you mix oil with vinegar to make a vinaigrette, the oil and vinegar will soon separate back into their previous selves. Such liquid-liquid phase separation is a thermodynamically driven phenomenon and plays an important role in many biological processes (1). Although energy injection at the macroscale can reverse the phase separation—a strong shake is the normal response to a separated vinaigrette—little is known about the effect of energy added at the microscopic level on phase separation. This fundamental question has deep ramifications, notably in biology, because active processes also make the interior of a living cell different from a dead one. On page 768 of this issue, Adkins et al. (2) examine how mechanical activity at the microscopic scale affects liquid-liquid phase separation and allows liquids to climb surfaces."}],"language":[{"iso":"eng"}],"page":"710-711","oa_version":"None","status":"public","type":"journal_article","volume":377,"intvolume":"       377"},{"date_created":"2022-08-28T22:02:00Z","oa":1,"day":"04","_id":"11997","issue":"2","publication_status":"published","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","month":"08","doi":"10.1103/PhysRevA.106.023301","author":[{"first_name":"Giacomo","orcid":"0000-0001-8823-9777","last_name":"Bighin","full_name":"Bighin, Giacomo","id":"4CA96FD4-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Burchianti","full_name":"Burchianti, A.","first_name":"A."},{"first_name":"F.","full_name":"Minardi, F.","last_name":"Minardi"},{"full_name":"Macrì, T.","last_name":"Macrì","first_name":"T."}],"citation":{"ieee":"G. Bighin, A. Burchianti, F. Minardi, and T. Macrì, “Impurity in a heteronuclear two-component Bose mixture,” <i>Physical Review A</i>, vol. 106, no. 2. American Physical Society, 2022.","mla":"Bighin, Giacomo, et al. “Impurity in a Heteronuclear Two-Component Bose Mixture.” <i>Physical Review A</i>, vol. 106, no. 2, 023301, American Physical Society, 2022, doi:<a href=\"https://doi.org/10.1103/PhysRevA.106.023301\">10.1103/PhysRevA.106.023301</a>.","short":"G. Bighin, A. Burchianti, F. Minardi, T. Macrì, Physical Review A 106 (2022).","apa":"Bighin, G., Burchianti, A., Minardi, F., &#38; Macrì, T. (2022). Impurity in a heteronuclear two-component Bose mixture. <i>Physical Review A</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevA.106.023301\">https://doi.org/10.1103/PhysRevA.106.023301</a>","ista":"Bighin G, Burchianti A, Minardi F, Macrì T. 2022. Impurity in a heteronuclear two-component Bose mixture. Physical Review A. 106(2), 023301.","chicago":"Bighin, Giacomo, A. Burchianti, F. Minardi, and T. Macrì. “Impurity in a Heteronuclear Two-Component Bose Mixture.” <i>Physical Review A</i>. American Physical Society, 2022. <a href=\"https://doi.org/10.1103/PhysRevA.106.023301\">https://doi.org/10.1103/PhysRevA.106.023301</a>.","ama":"Bighin G, Burchianti A, Minardi F, Macrì T. Impurity in a heteronuclear two-component Bose mixture. <i>Physical Review A</i>. 2022;106(2). doi:<a href=\"https://doi.org/10.1103/PhysRevA.106.023301\">10.1103/PhysRevA.106.023301</a>"},"external_id":{"arxiv":["2109.07451"],"isi":["000837953600006"]},"title":"Impurity in a heteronuclear two-component Bose mixture","publication_identifier":{"eissn":["2469-9934"],"issn":["2469-9926"]},"publication":"Physical Review A","year":"2022","publisher":"American Physical Society","date_updated":"2025-04-14T08:57:11Z","oa_version":"Preprint","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2109.07451"}],"abstract":[{"text":"We study the fate of an impurity in an ultracold heteronuclear Bose mixture, focusing on the experimentally relevant case of a ⁴¹K - ⁸⁷Rb mixture, with the impurity in a ⁴¹K hyperfine state. Our paper provides a comprehensive description of an impurity in a BEC mixture with contact interactions across its phase diagram. We present results for the miscible and immiscible regimes, as well as for the impurity in a self-bound quantum droplet. Here, varying the interactions, we find exotic states where the impurity localizes either at the center or\r\nat the surface of the droplet. ","lang":"eng"}],"article_type":"original","quality_controlled":"1","article_processing_charge":"No","intvolume":"       106","volume":106,"status":"public","type":"journal_article","department":[{"_id":"MiLe"}],"isi":1,"scopus_import":"1","acknowledgement":"We thank A. Simoni for providing the calculations of the intercomponent scattering lengths. We gratefully acknowledge stimulating discussions with L. A. Peña Ardila, R. Schmidt, H. Silva, V. Zampronio, and M. Prevedelli for careful reading. G.B. acknowledges support from the Austrian Science Fund (FWF) under Project No. M2641-N27. T.M. acknowledges CNPq for support through Bolsa de produtividade em Pesquisa No. 311079/2015-6. This work is supported by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany's Excellence Strategy No. EXC2181/1-390900948 (the Heidelberg STRUCTURES Excellence Cluster). This work was supported by the Serrapilheira Institute (Grant No. Serra-1812-27802). We thank the High-Performance Computing Center (NPAD) at UFRN for providing computational resources.","date_published":"2022-08-04T00:00:00Z","arxiv":1,"article_number":"023301","project":[{"grant_number":"M02641","name":"A path-integral approach to composite impurities","call_identifier":"FWF","_id":"26986C82-B435-11E9-9278-68D0E5697425"}]},{"title":"A simple model for high rotational excitations of molecules in a superfluid","publication_identifier":{"issn":["1367-2630"]},"publication":"New Journal of Physics","year":"2022","corr_author":"1","publisher":"IOP Publishing","date_updated":"2025-05-14T11:20:18Z","month":"08","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1088/1367-2630/ac8113","author":[{"first_name":"Igor","last_name":"Cherepanov","id":"339C7E5A-F248-11E8-B48F-1D18A9856A87","full_name":"Cherepanov, Igor"},{"last_name":"Bighin","full_name":"Bighin, Giacomo","id":"4CA96FD4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8823-9777","first_name":"Giacomo"},{"last_name":"Schouder","full_name":"Schouder, Constant A.","first_name":"Constant A."},{"last_name":"Chatterley","full_name":"Chatterley, Adam S.","first_name":"Adam S."},{"first_name":"Henrik","full_name":"Stapelfeldt, Henrik","last_name":"Stapelfeldt"},{"full_name":"Lemeshko, Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","last_name":"Lemeshko","orcid":"0000-0002-6990-7802","first_name":"Mikhail"}],"citation":{"ama":"Cherepanov I, Bighin G, Schouder CA, Chatterley AS, Stapelfeldt H, Lemeshko M. A simple model for high rotational excitations of molecules in a superfluid. <i>New Journal of Physics</i>. 2022;24(7). doi:<a href=\"https://doi.org/10.1088/1367-2630/ac8113\">10.1088/1367-2630/ac8113</a>","chicago":"Cherepanov, Igor, Giacomo Bighin, Constant A. Schouder, Adam S. Chatterley, Henrik Stapelfeldt, and Mikhail Lemeshko. “A Simple Model for High Rotational Excitations of Molecules in a Superfluid.” <i>New Journal of Physics</i>. IOP Publishing, 2022. <a href=\"https://doi.org/10.1088/1367-2630/ac8113\">https://doi.org/10.1088/1367-2630/ac8113</a>.","ista":"Cherepanov I, Bighin G, Schouder CA, Chatterley AS, Stapelfeldt H, Lemeshko M. 2022. A simple model for high rotational excitations of molecules in a superfluid. New Journal of Physics. 24(7), 075004.","short":"I. Cherepanov, G. Bighin, C.A. Schouder, A.S. Chatterley, H. Stapelfeldt, M. Lemeshko, New Journal of Physics 24 (2022).","apa":"Cherepanov, I., Bighin, G., Schouder, C. A., Chatterley, A. S., Stapelfeldt, H., &#38; Lemeshko, M. (2022). A simple model for high rotational excitations of molecules in a superfluid. <i>New Journal of Physics</i>. IOP Publishing. <a href=\"https://doi.org/10.1088/1367-2630/ac8113\">https://doi.org/10.1088/1367-2630/ac8113</a>","mla":"Cherepanov, Igor, et al. “A Simple Model for High Rotational Excitations of Molecules in a Superfluid.” <i>New Journal of Physics</i>, vol. 24, no. 7, 075004, IOP Publishing, 2022, doi:<a href=\"https://doi.org/10.1088/1367-2630/ac8113\">10.1088/1367-2630/ac8113</a>.","ieee":"I. Cherepanov, G. Bighin, C. A. Schouder, A. S. Chatterley, H. Stapelfeldt, and M. Lemeshko, “A simple model for high rotational excitations of molecules in a superfluid,” <i>New Journal of Physics</i>, vol. 24, no. 7. IOP Publishing, 2022."},"external_id":{"isi":["000839216900001"]},"file":[{"file_id":"12005","file_name":"2022_NewJournalofPhysics_Cherepanov.pdf","success":1,"date_updated":"2022-08-29T09:57:40Z","content_type":"application/pdf","creator":"alisjak","checksum":"10116a08d3489befc13dba2cc44490f1","relation":"main_file","file_size":1912882,"access_level":"open_access","date_created":"2022-08-29T09:57:40Z"}],"issue":"7","publication_status":"published","date_created":"2022-08-28T22:02:01Z","ddc":["530"],"oa":1,"ec_funded":1,"day":"11","_id":"11998","project":[{"name":"International IST Doctoral Program","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"call_identifier":"H2020","_id":"2688CF98-B435-11E9-9278-68D0E5697425","grant_number":"801770","name":"Angulon: physics and applications of a new quasiparticle"},{"grant_number":"M02641","name":"A path-integral approach to composite impurities","call_identifier":"FWF","_id":"26986C82-B435-11E9-9278-68D0E5697425"}],"isi":1,"department":[{"_id":"MiLe"}],"scopus_import":"1","has_accepted_license":"1","acknowledgement":"IC acknowledges the support by the European Union's Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385. GB acknowledges support from the Austrian Science Fund (FWF), under Project No. M2461-N27 and from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany's Excellence Strategy EXC2181/1-390900948 (the Heidelberg STRUCTURES Excellence Cluster). ML 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). HS acknowledges support from the Independent Research Fund Denmark (Project No. 8021-00232B) and from the Villum Fonden through a Villum Investigator Grant No. 25886.","date_published":"2022-08-11T00:00:00Z","article_number":"075004","intvolume":"        24","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"volume":24,"status":"public","type":"journal_article","oa_version":"Published Version","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Recently it became possible to study highly excited rotational states of molecules in superfluid helium through nonadiabatic alignment experiments (Cherepanov et al 2021 Phys. Rev. A 104 L061303). This calls for theoretical approaches that go beyond explaining renormalized values of molecular spectroscopic constants, which suffices when only the lowest few rotational states are involved. As the first step in this direction, here we present a basic quantum mechanical model describing highly excited rotational states of molecules in superfluid helium nanodroplets. We show that a linear molecule immersed in a superfluid can be seen as an effective symmetric top, similar to the rotational structure of radicals, such as OH or NO, but with the angular momentum of the superfluid playing the role of the electronic angular momentum in free molecules. The simple theory sheds light onto what happens when the rotational angular momentum of the molecule increases beyond the lowest excited states accessible by infrared spectroscopy. In addition, the model allows to estimate the effective rotational and centrifugal distortion constants for a broad range of species and to explain the crossover between light and heavy molecules in superfluid 4He in terms of the many-body wavefunction structure. Some of the above mentioned insights can be acquired by analyzing a simple 2 × 2 matrix."}],"file_date_updated":"2022-08-29T09:57:40Z","article_type":"original","quality_controlled":"1","article_processing_charge":"Yes"},{"status":"public","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"intvolume":"         6","volume":6,"article_processing_charge":"Yes","article_type":"original","quality_controlled":"1","abstract":[{"text":"Sexual antagonism is a common hypothesis for driving the evolution of sex chromosomes, whereby recombination suppression is favored between sexually antagonistic loci and the sex-determining locus to maintain beneficial combinations of alleles. This results in the formation of a sex-determining region. Chromosomal inversions may contribute to recombination suppression but their precise role in sex chromosome evolution remains unclear. Because local adaptation is frequently facilitated through the suppression of recombination between adaptive loci by chromosomal inversions, there is potential for inversions that cover sex-determining regions to be involved in local adaptation as well, particularly if habitat variation creates environment-dependent sexual antagonism. With these processes in mind, we investigated sex determination in a well-studied example of local adaptation within a species: the intertidal snail, Littorina saxatilis. Using SNP data from a Swedish hybrid zone, we find novel evidence for a female-heterogametic sex determination system that is restricted to one ecotype. Our results suggest that four putative chromosomal inversions, two previously described and two newly discovered, span the putative sex chromosome pair. We determine their differing associations with sex, which suggest distinct strata of differing ages. The same inversions are found in the second ecotype but do not show any sex association. The striking disparity in inversion-sex associations between ecotypes that are connected by gene flow across a habitat transition that is just a few meters wide indicates a difference in selective regime that has produced a distinct barrier to the spread of the newly discovered sex-determining region between ecotypes. Such sex chromosome-environment interactions have not previously been uncovered in L. saxatilis and are known in few other organisms. A combination of both sex-specific selection and divergent natural selection is required to explain these highly unusual patterns.","lang":"eng"}],"file_date_updated":"2023-02-27T07:17:42Z","oa_version":"Published Version","page":"358-374","language":[{"iso":"eng"}],"pmid":1,"acknowledgement":"We thank A. Wright and four anonymous reviewers for valuable comments on an earlier draft of this manuscript and all members of the Littorina group for helpful discussions. This work was supported by a European Research Council grant to RKB and by a Natural Environment Research Council studentship to KEH through the ACCE doctoral training program. KJ acknowledges support from the Swedish Science Research Council VR (Vetenskaprådet) (2017-03798). RF was supported by an FCT CEEC (Fundação para a Ciênca e a Tecnologia, Concurso Estímulo ao Emprego Científico) contract (2020.00275.CEECIND).","date_published":"2022-10-01T00:00:00Z","has_accepted_license":"1","scopus_import":"1","department":[{"_id":"NiBa"}],"isi":1,"publication_status":"published","file":[{"success":1,"file_name":"2022_EvolutionLetters_Hearn.pdf","file_id":"12686","date_updated":"2023-02-27T07:17:42Z","file_size":2368965,"relation":"main_file","access_level":"open_access","date_created":"2023-02-27T07:17:42Z","creator":"dernst","checksum":"2dcd06186a11b7d1be4cddc6b189f8fb","content_type":"application/pdf"}],"issue":"5","day":"01","_id":"12001","oa":1,"date_created":"2022-08-28T22:02:02Z","ddc":["570"],"year":"2022","publisher":"Oxford University Press","date_updated":"2025-06-12T06:22:56Z","publication":"Evolution Letters","title":"Differing associations between sex determination and sex-linked inversions in two ecotypes of Littorina saxatilis","publication_identifier":{"eissn":["2056-3744"]},"citation":{"ama":"Hearn KE, Koch EL, Stankowski S, et al. Differing associations between sex determination and sex-linked inversions in two ecotypes of Littorina saxatilis. <i>Evolution Letters</i>. 2022;6(5):358-374. doi:<a href=\"https://doi.org/10.1002/evl3.295\">10.1002/evl3.295</a>","chicago":"Hearn, Katherine E., Eva L. Koch, Sean Stankowski, Roger K. Butlin, Rui Faria, Kerstin Johannesson, and Anja M Westram. “Differing Associations between Sex Determination and Sex-Linked Inversions in Two Ecotypes of Littorina Saxatilis.” <i>Evolution Letters</i>. Oxford University Press, 2022. <a href=\"https://doi.org/10.1002/evl3.295\">https://doi.org/10.1002/evl3.295</a>.","ista":"Hearn KE, Koch EL, Stankowski S, Butlin RK, Faria R, Johannesson K, Westram AM. 2022. Differing associations between sex determination and sex-linked inversions in two ecotypes of Littorina saxatilis. Evolution Letters. 6(5), 358–374.","apa":"Hearn, K. E., Koch, E. L., Stankowski, S., Butlin, R. K., Faria, R., Johannesson, K., &#38; Westram, A. M. (2022). Differing associations between sex determination and sex-linked inversions in two ecotypes of Littorina saxatilis. <i>Evolution Letters</i>. Oxford University Press. <a href=\"https://doi.org/10.1002/evl3.295\">https://doi.org/10.1002/evl3.295</a>","short":"K.E. Hearn, E.L. Koch, S. Stankowski, R.K. Butlin, R. Faria, K. Johannesson, A.M. Westram, Evolution Letters 6 (2022) 358–374.","mla":"Hearn, Katherine E., et al. “Differing Associations between Sex Determination and Sex-Linked Inversions in Two Ecotypes of Littorina Saxatilis.” <i>Evolution Letters</i>, vol. 6, no. 5, Oxford University Press, 2022, pp. 358–74, doi:<a href=\"https://doi.org/10.1002/evl3.295\">10.1002/evl3.295</a>.","ieee":"K. E. Hearn <i>et al.</i>, “Differing associations between sex determination and sex-linked inversions in two ecotypes of Littorina saxatilis,” <i>Evolution Letters</i>, vol. 6, no. 5. Oxford University Press, pp. 358–374, 2022."},"external_id":{"pmid":["36254259"],"isi":["000839621100001"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"10","doi":"10.1002/evl3.295","author":[{"first_name":"Katherine E.","last_name":"Hearn","full_name":"Hearn, Katherine E."},{"last_name":"Koch","full_name":"Koch, Eva L.","first_name":"Eva L."},{"id":"43161670-5719-11EA-8025-FABC3DDC885E","full_name":"Stankowski, Sean","last_name":"Stankowski","first_name":"Sean"},{"last_name":"Butlin","full_name":"Butlin, Roger K.","first_name":"Roger K."},{"last_name":"Faria","full_name":"Faria, Rui","first_name":"Rui"},{"first_name":"Kerstin","full_name":"Johannesson, Kerstin","last_name":"Johannesson"},{"first_name":"Anja M","orcid":"0000-0003-1050-4969","full_name":"Westram, Anja M","id":"3C147470-F248-11E8-B48F-1D18A9856A87","last_name":"Westram"}]},{"author":[{"last_name":"GOSWAMI","full_name":"GOSWAMI, BIDYUT B","id":"3a4ac09c-6d61-11ec-bf66-884cde66b64b","first_name":"BIDYUT B"},{"first_name":"Soon-Il","full_name":"An, Soon-Il","last_name":"An"},{"first_name":"Raghu","last_name":"Murtugudde","full_name":"Murtugudde, Raghu"}],"doi":"10.1007/s10584-022-03426-8","month":"08","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"B. B. GOSWAMI, S.-I. An, and R. Murtugudde, “Role of the Tibetan plateau glaciers in the Asian summer monsoon,” <i>Climatic Change</i>, vol. 173, no. 3–4. Springer Nature, 2022.","mla":"GOSWAMI, BIDYUT B., et al. “Role of the Tibetan Plateau Glaciers in the Asian Summer Monsoon.” <i>Climatic Change</i>, vol. 173, no. 3–4, 29, Springer Nature, 2022, doi:<a href=\"https://doi.org/10.1007/s10584-022-03426-8\">10.1007/s10584-022-03426-8</a>.","short":"B.B. GOSWAMI, S.-I. An, R. Murtugudde, Climatic Change 173 (2022).","apa":"GOSWAMI, B. B., An, S.-I., &#38; Murtugudde, R. (2022). Role of the Tibetan plateau glaciers in the Asian summer monsoon. <i>Climatic Change</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s10584-022-03426-8\">https://doi.org/10.1007/s10584-022-03426-8</a>","ista":"GOSWAMI BB, An S-I, Murtugudde R. 2022. Role of the Tibetan plateau glaciers in the Asian summer monsoon. Climatic Change. 173(3–4), 29.","chicago":"GOSWAMI, BIDYUT B, Soon-Il An, and Raghu Murtugudde. “Role of the Tibetan Plateau Glaciers in the Asian Summer Monsoon.” <i>Climatic Change</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/s10584-022-03426-8\">https://doi.org/10.1007/s10584-022-03426-8</a>.","ama":"GOSWAMI BB, An S-I, Murtugudde R. Role of the Tibetan plateau glaciers in the Asian summer monsoon. <i>Climatic Change</i>. 2022;173(3-4). doi:<a href=\"https://doi.org/10.1007/s10584-022-03426-8\">10.1007/s10584-022-03426-8</a>"},"publication_identifier":{"issn":["0165-0009","1573-1480"]},"title":"Role of the Tibetan plateau glaciers in the Asian summer monsoon","publisher":"Springer Nature","date_updated":"2022-09-05T08:33:33Z","year":"2022","publication":"Climatic Change","oa":1,"ddc":["550"],"date_created":"2022-09-03T07:24:13Z","_id":"12007","day":"30","publication_status":"published","issue":"3-4","file":[{"success":1,"file_name":"2022_ClimateChange_Goswami.pdf","file_id":"12021","date_updated":"2022-09-05T08:29:27Z","date_created":"2022-09-05T08:29:27Z","access_level":"open_access","file_size":1350575,"relation":"main_file","creator":"dernst","content_type":"application/pdf","checksum":"38071d5c142bb76f8c8665dc374838a8"}],"keyword":["Atmospheric Science","Global and Planetary Change"],"scopus_import":"1","article_number":"29","date_published":"2022-08-30T00:00:00Z","acknowledgement":"This research is funded by the IRCC research funding.","has_accepted_license":"1","abstract":[{"text":"The Tibetan plateau (TP) plays an important role in the Asian summer monsoon (ASM) dynamics as a heat source during the pre-monsoon and monsoon seasons. A significant contribution to the pre-monsoon TP heating comes from the sensible heat flux (SHF), which depend on the surface properties. A glaciated surface would have a different SHF compared to a non-glaciated surface. Therefore, the TP glaciers potentially can also impact the hydrological cycle in the Asian continent by impacting the ASM rainfall via its contribution to the total plateau heating. However, there is no assessment of this putative link available. Here, we attempt to qualitatively study the role of TP glaciers on ASM by analyzing the sensitivity of an atmospheric model to the absence of TP glaciers. We find that the absence of the glaciers is most felt in climatologically less snowy regions (which are mostly located at the south-central boundary of the TP during the pre-monsoon season), which leads to positive SHF anomalies. The resulting positive diabatic heating leads to rising air in the eastern TP and sinking air in the western TP. This altered circulation in turn leads to a positive SHF memory in the western TP, which persists until the end of the monsoon season. The impact of SHF anomalies on diabatic heating results in a large-scale subsidence over the ASM domain. The net result is a reduced seasonal ASM rainfall. Given the relentless warming and the vulnerability of glaciers to warming, this is another flag in the ASM variability and change that needs further attention.","lang":"eng"}],"file_date_updated":"2022-09-05T08:29:27Z","language":[{"iso":"eng"}],"oa_version":"Published Version","article_processing_charge":"No","quality_controlled":"1","article_type":"original","intvolume":"       173","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"volume":173,"status":"public","type":"journal_article","extern":"1"},{"project":[{"name":"What’s in a memory? Spatiotemporal dynamics in strongly coupled recurrent neuronal networks.","grant_number":"214316/Z/18/Z","_id":"c084a126-5a5b-11eb-8a69-d75314a70a87"},{"name":"Learning the shape of synaptic plasticity rules for neuronal architectures and function through machine learning.","grant_number":"819603","_id":"0aacfa84-070f-11eb-9043-d7eb2c709234","call_identifier":"H2020"}],"scopus_import":"1","department":[{"_id":"TiVo"}],"isi":1,"date_published":"2022-08-25T00:00:00Z","article_number":"873","acknowledgement":"We would like to thank the Vogels Lab for feedback on an earlier version of this manuscript. D.W.J. was supported by a Marshall Scholarship and a Clarendon Scholarship. R.P.C. and T.P.V. were supported by a Wellcome Trust and Royal Society Sir Henry Dale Fellowship (WT 100000), a Wellcome Trust Senior Research Fellowship (214316/Z/18/Z), and an ERC Consolidator Grant (SYNAPSEEK).","has_accepted_license":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"intvolume":"         5","volume":5,"status":"public","type":"journal_article","file_date_updated":"2022-09-05T08:55:11Z","abstract":[{"lang":"eng","text":"Changes in the short-term dynamics of excitatory synapses over development have been observed throughout cortex, but their purpose and consequences remain unclear. Here, we propose that developmental changes in synaptic dynamics buffer the effect of slow inhibitory long-term plasticity, allowing for continuously stable neural activity. Using computational modeling we demonstrate that early in development excitatory short-term depression quickly stabilises neural activity, even in the face of strong, unbalanced excitation. We introduce a model of the commonly observed developmental shift from depression to facilitation and show that neural activity remains stable throughout development, while inhibitory synaptic plasticity slowly balances excitation, consistent with experimental observations. Our model predicts changes in the input responses from phasic to phasic-and-tonic and more precise spike timings. We also observe a gradual emergence of short-lasting memory traces governed by short-term plasticity development. We conclude that the developmental depression-to-facilitation shift may control excitation-inhibition balance throughout development with important functional consequences."}],"language":[{"iso":"eng"}],"oa_version":"Published Version","article_processing_charge":"No","quality_controlled":"1","article_type":"original","publication_identifier":{"eissn":["2399-3642"]},"title":"Developmental depression-to-facilitation shift controls excitation-inhibition balance","publisher":"Springer Nature","date_updated":"2025-04-14T09:44:14Z","year":"2022","publication":"Communications biology","author":[{"first_name":"David W.","last_name":"Jia","full_name":"Jia, David W."},{"last_name":"Vogels","id":"CB6FF8D2-008F-11EA-8E08-2637E6697425","full_name":"Vogels, Tim P","first_name":"Tim P","orcid":"0000-0003-3295-6181"},{"first_name":"Rui Ponte","full_name":"Costa, Rui Ponte","last_name":"Costa"}],"doi":"10.1038/s42003-022-03801-2","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","month":"08","citation":{"ieee":"D. W. Jia, T. P. Vogels, and R. P. Costa, “Developmental depression-to-facilitation shift controls excitation-inhibition balance,” <i>Communications biology</i>, vol. 5. Springer Nature, 2022.","mla":"Jia, David W., et al. “Developmental Depression-to-Facilitation Shift Controls Excitation-Inhibition Balance.” <i>Communications Biology</i>, vol. 5, 873, Springer Nature, 2022, doi:<a href=\"https://doi.org/10.1038/s42003-022-03801-2\">10.1038/s42003-022-03801-2</a>.","apa":"Jia, D. W., Vogels, T. P., &#38; Costa, R. P. (2022). Developmental depression-to-facilitation shift controls excitation-inhibition balance. <i>Communications Biology</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s42003-022-03801-2\">https://doi.org/10.1038/s42003-022-03801-2</a>","short":"D.W. Jia, T.P. Vogels, R.P. Costa, Communications Biology 5 (2022).","ista":"Jia DW, Vogels TP, Costa RP. 2022. Developmental depression-to-facilitation shift controls excitation-inhibition balance. Communications biology. 5, 873.","chicago":"Jia, David W., Tim P Vogels, and Rui Ponte Costa. “Developmental Depression-to-Facilitation Shift Controls Excitation-Inhibition Balance.” <i>Communications Biology</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1038/s42003-022-03801-2\">https://doi.org/10.1038/s42003-022-03801-2</a>.","ama":"Jia DW, Vogels TP, Costa RP. Developmental depression-to-facilitation shift controls excitation-inhibition balance. <i>Communications biology</i>. 2022;5. doi:<a href=\"https://doi.org/10.1038/s42003-022-03801-2\">10.1038/s42003-022-03801-2</a>"},"external_id":{"isi":["000844814800007"]},"publication_status":"published","file":[{"file_size":2491191,"relation":"main_file","date_created":"2022-09-05T08:55:11Z","access_level":"open_access","content_type":"application/pdf","checksum":"3ec724c4f6d3440028c217305e32915f","creator":"dernst","success":1,"file_id":"12022","file_name":"2022_CommBiology_Jia.pdf","date_updated":"2022-09-05T08:55:11Z"}],"oa":1,"ddc":["570"],"date_created":"2022-09-04T22:02:02Z","_id":"12009","day":"25","ec_funded":1},{"oa":1,"date_created":"2022-09-04T22:02:02Z","_id":"12010","day":"12","conference":{"location":"Philadelphia, PA, United States","name":"ICRA: International Conference on Robotics and Automation","end_date":"2022-05-27","start_date":"2022-05-23"},"ec_funded":1,"publication_status":"published","author":[{"last_name":"Brunnbauer","full_name":"Brunnbauer, Axel","first_name":"Axel"},{"first_name":"Luigi","last_name":"Berducci","full_name":"Berducci, Luigi"},{"first_name":"Andreas","last_name":"Brandstatter","full_name":"Brandstatter, Andreas"},{"last_name":"Lechner","full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias"},{"full_name":"Hasani, Ramin","last_name":"Hasani","first_name":"Ramin"},{"first_name":"Daniela","full_name":"Rus, Daniela","last_name":"Rus"},{"full_name":"Grosu, Radu","last_name":"Grosu","first_name":"Radu"}],"doi":"10.1109/ICRA46639.2022.9811650","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"07","external_id":{"isi":["000941277600124"],"arxiv":["2103.04909"]},"citation":{"apa":"Brunnbauer, A., Berducci, L., Brandstatter, A., Lechner, M., Hasani, R., Rus, D., &#38; Grosu, R. (2022). Latent imagination facilitates zero-shot transfer in autonomous racing. In <i>2022 International Conference on Robotics and Automation</i> (pp. 7513–7520). Philadelphia, PA, United States: IEEE. <a href=\"https://doi.org/10.1109/ICRA46639.2022.9811650\">https://doi.org/10.1109/ICRA46639.2022.9811650</a>","short":"A. Brunnbauer, L. Berducci, A. Brandstatter, M. Lechner, R. Hasani, D. Rus, R. Grosu, in:, 2022 International Conference on Robotics and Automation, IEEE, 2022, pp. 7513–7520.","mla":"Brunnbauer, Axel, et al. “Latent Imagination Facilitates Zero-Shot Transfer in Autonomous Racing.” <i>2022 International Conference on Robotics and Automation</i>, IEEE, 2022, pp. 7513–20, doi:<a href=\"https://doi.org/10.1109/ICRA46639.2022.9811650\">10.1109/ICRA46639.2022.9811650</a>.","ieee":"A. Brunnbauer <i>et al.</i>, “Latent imagination facilitates zero-shot transfer in autonomous racing,” in <i>2022 International Conference on Robotics and Automation</i>, Philadelphia, PA, United States, 2022, pp. 7513–7520.","ama":"Brunnbauer A, Berducci L, Brandstatter A, et al. Latent imagination facilitates zero-shot transfer in autonomous racing. In: <i>2022 International Conference on Robotics and Automation</i>. IEEE; 2022:7513-7520. doi:<a href=\"https://doi.org/10.1109/ICRA46639.2022.9811650\">10.1109/ICRA46639.2022.9811650</a>","chicago":"Brunnbauer, Axel, Luigi Berducci, Andreas Brandstatter, Mathias Lechner, Ramin Hasani, Daniela Rus, and Radu Grosu. “Latent Imagination Facilitates Zero-Shot Transfer in Autonomous Racing.” In <i>2022 International Conference on Robotics and Automation</i>, 7513–20. IEEE, 2022. <a href=\"https://doi.org/10.1109/ICRA46639.2022.9811650\">https://doi.org/10.1109/ICRA46639.2022.9811650</a>.","ista":"Brunnbauer A, Berducci L, Brandstatter A, Lechner M, Hasani R, Rus D, Grosu R. 2022. Latent imagination facilitates zero-shot transfer in autonomous racing. 2022 International Conference on Robotics and Automation. ICRA: International Conference on Robotics and Automation, 7513–7520."},"publication_identifier":{"isbn":["9781728196817"],"issn":["1050-4729"]},"title":"Latent imagination facilitates zero-shot transfer in autonomous racing","publisher":"IEEE","date_updated":"2025-09-10T09:39:53Z","year":"2022","publication":"2022 International Conference on Robotics and Automation","abstract":[{"lang":"eng","text":"World models learn behaviors in a latent imagination space to enhance the sample-efficiency of deep reinforcement learning (RL) algorithms. While learning world models for high-dimensional observations (e.g., pixel inputs) has become practicable on standard RL benchmarks and some games, their effectiveness in real-world robotics applications has not been explored. In this paper, we investigate how such agents generalize to real-world autonomous vehicle control tasks, where advanced model-free deep RL algorithms fail. In particular, we set up a series of time-lap tasks for an F1TENTH racing robot, equipped with a high-dimensional LiDAR sensor, on a set of test tracks with a gradual increase in their complexity. In this continuous-control setting, we show that model-based agents capable of learning in imagination substantially outperform model-free agents with respect to performance, sample efficiency, successful task completion, and generalization. Moreover, we show that the generalization ability of model-based agents strongly depends on the choice of their observation model. We provide extensive empirical evidence for the effectiveness of world models provided with long enough memory horizons in sim2real tasks."}],"language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2103.04909"}],"page":"7513-7520","oa_version":"Preprint","article_processing_charge":"No","quality_controlled":"1","status":"public","type":"conference","scopus_import":"1","isi":1,"department":[{"_id":"ToHe"}],"date_published":"2022-07-12T00:00:00Z","arxiv":1,"acknowledgement":"L.B. was supported by the Doctoral College Resilient Embedded Systems. M.L. was supported in part by the ERC2020-AdG 101020093 and the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). R.H. and D.R. were supported by The Boeing Company and the Office of Naval Research (ONR) Grant N00014-18-1-2830. R.G. was partially supported by the Horizon-2020 ECSEL Project grant No. 783163 (iDev40) and A.B. by FFG Project ADEX.","project":[{"name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211"}]},{"abstract":[{"text":"We characterize the capacity for the discrete-time arbitrarily varying channel with discrete inputs, outputs, and states when (a) the encoder and decoder do not share common randomness, (b) the input and state are subject to cost constraints, (c) the transition matrix of the channel is deterministic given the state, and (d) at each time step the adversary can only observe the current and past channel inputs when choosing the state at that time. The achievable strategy involves stochastic encoding together with list decoding and a disambiguation step. The converse uses a two-phase \"babble-and-push\" strategy where the adversary chooses the state randomly in the first phase, list decodes the output, and then chooses state inputs to symmetrize the channel in the second phase. These results generalize prior work on specific channels models (additive, erasure) to general discrete alphabets and models.","lang":"eng"}],"oa_version":"Preprint","language":[{"iso":"eng"}],"page":"2523-2528","main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.2205.06708"}],"article_processing_charge":"No","quality_controlled":"1","intvolume":"      2022","volume":2022,"status":"public","type":"conference","scopus_import":"1","isi":1,"department":[{"_id":"MaMo"}],"acknowledgement":"The work of ADS and ML was supported in part by the US National Science Foundation under awards CCF-1909468 and CCF-1909451.","arxiv":1,"date_published":"2022-08-03T00:00:00Z","oa":1,"date_created":"2022-09-04T22:02:03Z","day":"03","_id":"12011","conference":{"name":"ISIT: International Symposium on Information Theory","location":"Espoo, Finland","start_date":"2022-06-26","end_date":"2022-07-01"},"publication_status":"published","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"08","doi":"10.1109/ISIT50566.2022.9834709","author":[{"orcid":"0000-0002-6465-6258","first_name":"Yihan","last_name":"Zhang","full_name":"Zhang, Yihan","id":"2ce5da42-b2ea-11eb-bba5-9f264e9d002c"},{"first_name":"Sidharth","full_name":"Jaggi, Sidharth","last_name":"Jaggi"},{"full_name":"Langberg, Michael","last_name":"Langberg","first_name":"Michael"},{"full_name":"Sarwate, Anand D.","last_name":"Sarwate","first_name":"Anand D."}],"citation":{"chicago":"Zhang, Yihan, Sidharth Jaggi, Michael Langberg, and Anand D. Sarwate. “The Capacity of Causal Adversarial Channels.” In <i>2022 IEEE International Symposium on Information Theory</i>, 2022:2523–28. IEEE, 2022. <a href=\"https://doi.org/10.1109/ISIT50566.2022.9834709\">https://doi.org/10.1109/ISIT50566.2022.9834709</a>.","ama":"Zhang Y, Jaggi S, Langberg M, Sarwate AD. The capacity of causal adversarial channels. In: <i>2022 IEEE International Symposium on Information Theory</i>. Vol 2022. IEEE; 2022:2523-2528. doi:<a href=\"https://doi.org/10.1109/ISIT50566.2022.9834709\">10.1109/ISIT50566.2022.9834709</a>","ista":"Zhang Y, Jaggi S, Langberg M, Sarwate AD. 2022. The capacity of causal adversarial channels. 2022 IEEE International Symposium on Information Theory. ISIT: International Symposium on Information Theory vol. 2022, 2523–2528.","apa":"Zhang, Y., Jaggi, S., Langberg, M., &#38; Sarwate, A. D. (2022). The capacity of causal adversarial channels. In <i>2022 IEEE International Symposium on Information Theory</i> (Vol. 2022, pp. 2523–2528). Espoo, Finland: IEEE. <a href=\"https://doi.org/10.1109/ISIT50566.2022.9834709\">https://doi.org/10.1109/ISIT50566.2022.9834709</a>","short":"Y. Zhang, S. Jaggi, M. Langberg, A.D. Sarwate, in:, 2022 IEEE International Symposium on Information Theory, IEEE, 2022, pp. 2523–2528.","ieee":"Y. Zhang, S. Jaggi, M. Langberg, and A. D. Sarwate, “The capacity of causal adversarial channels,” in <i>2022 IEEE International Symposium on Information Theory</i>, Espoo, Finland, 2022, vol. 2022, pp. 2523–2528.","mla":"Zhang, Yihan, et al. “The Capacity of Causal Adversarial Channels.” <i>2022 IEEE International Symposium on Information Theory</i>, vol. 2022, IEEE, 2022, pp. 2523–28, doi:<a href=\"https://doi.org/10.1109/ISIT50566.2022.9834709\">10.1109/ISIT50566.2022.9834709</a>."},"external_id":{"isi":["001254261902114"],"arxiv":["2205.06708"]},"title":"The capacity of causal adversarial channels","publication_identifier":{"issn":["2157-8095"],"isbn":["9781665421591"]},"year":"2022","publisher":"IEEE","date_updated":"2025-09-10T09:40:42Z","publication":"2022 IEEE International Symposium on Information Theory"},{"publisher":"IEEE","date_updated":"2025-09-10T09:42:41Z","year":"2022","publication":"2022 IEEE International Symposium on Information Theory","publication_identifier":{"issn":["2157-8095"],"isbn":["9781665421591"]},"title":"Heterogeneous differential privacy via graphs","external_id":{"arxiv":["2203.15429"],"isi":["001254261901131"]},"citation":{"chicago":"Torkamani, Sahel, Javad B. Ebrahimi, Parastoo Sadeghi, Rafael G.L. D’Oliveira, and Muriel Médard. “Heterogeneous Differential Privacy via Graphs.” In <i>2022 IEEE International Symposium on Information Theory</i>, 2022:1623–28. IEEE, 2022. <a href=\"https://doi.org/10.1109/ISIT50566.2022.9834711\">https://doi.org/10.1109/ISIT50566.2022.9834711</a>.","ama":"Torkamani S, Ebrahimi JB, Sadeghi P, D’Oliveira RGL, Médard M. Heterogeneous differential privacy via graphs. In: <i>2022 IEEE International Symposium on Information Theory</i>. Vol 2022. IEEE; 2022:1623-1628. doi:<a href=\"https://doi.org/10.1109/ISIT50566.2022.9834711\">10.1109/ISIT50566.2022.9834711</a>","ista":"Torkamani S, Ebrahimi JB, Sadeghi P, D’Oliveira RGL, Médard M. 2022. Heterogeneous differential privacy via graphs. 2022 IEEE International Symposium on Information Theory. ISIT: International Symposium on Information Theory vol. 2022, 1623–1628.","apa":"Torkamani, S., Ebrahimi, J. B., Sadeghi, P., D’Oliveira, R. G. L., &#38; Médard, M. (2022). Heterogeneous differential privacy via graphs. In <i>2022 IEEE International Symposium on Information Theory</i> (Vol. 2022, pp. 1623–1628). Espoo, Finland: IEEE. <a href=\"https://doi.org/10.1109/ISIT50566.2022.9834711\">https://doi.org/10.1109/ISIT50566.2022.9834711</a>","short":"S. Torkamani, J.B. Ebrahimi, P. Sadeghi, R.G.L. D’Oliveira, M. Médard, in:, 2022 IEEE International Symposium on Information Theory, IEEE, 2022, pp. 1623–1628.","ieee":"S. Torkamani, J. B. Ebrahimi, P. Sadeghi, R. G. L. D’Oliveira, and M. Médard, “Heterogeneous differential privacy via graphs,” in <i>2022 IEEE International Symposium on Information Theory</i>, Espoo, Finland, 2022, vol. 2022, pp. 1623–1628.","mla":"Torkamani, Sahel, et al. “Heterogeneous Differential Privacy via Graphs.” <i>2022 IEEE International Symposium on Information Theory</i>, vol. 2022, IEEE, 2022, pp. 1623–28, doi:<a href=\"https://doi.org/10.1109/ISIT50566.2022.9834711\">10.1109/ISIT50566.2022.9834711</a>."},"doi":"10.1109/ISIT50566.2022.9834711","author":[{"full_name":"Torkamani, Sahel","id":"0503e7f8-2d05-11ed-aa17-db0640c720fc","last_name":"Torkamani","first_name":"Sahel"},{"first_name":"Javad B.","full_name":"Ebrahimi, Javad B.","last_name":"Ebrahimi"},{"first_name":"Parastoo","full_name":"Sadeghi, Parastoo","last_name":"Sadeghi"},{"first_name":"Rafael G.L.","last_name":"D'Oliveira","full_name":"D'Oliveira, Rafael G.L."},{"last_name":"Médard","full_name":"Médard, Muriel","first_name":"Muriel"}],"month":"08","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_status":"published","_id":"12012","day":"03","conference":{"start_date":"2022-06-26","end_date":"2022-07-01","name":"ISIT: International Symposium on Information Theory","location":"Espoo, Finland"},"oa":1,"date_created":"2022-09-04T22:02:04Z","arxiv":1,"date_published":"2022-08-03T00:00:00Z","scopus_import":"1","isi":1,"department":[{"_id":"MaMo"}],"status":"public","type":"conference","intvolume":"      2022","volume":2022,"article_processing_charge":"No","quality_controlled":"1","abstract":[{"text":"This paper is eligible for the Jack Keil Wolf ISIT Student Paper Award. We generalize a previous framework for designing utility-optimal differentially private (DP) mechanisms via graphs, where datasets are vertices in the graph and edges represent dataset neighborhood. The boundary set contains datasets where an individual’s response changes the binary-valued query compared to its neighbors. Previous work was limited to the homogeneous case where the privacy parameter ε across all datasets was the same and the mechanism at boundary datasets was identical. In our work, the mechanism can take different distributions at the boundary and the privacy parameter ε is a function of neighboring datasets, which recovers an earlier definition of personalized DP as special case. The problem is how to extend the mechanism, which is only defined at the boundary set, to other datasets in the graph in a computationally efficient and utility optimal manner. Using the concept of strongest induced DP condition we solve this problem efficiently in polynomial time (in the size of the graph).","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2203.15429"}],"page":"1623-1628","language":[{"iso":"eng"}],"oa_version":"Preprint"}]