[{"article_processing_charge":"No","year":"2021","publication_status":"published","file":[{"date_created":"2021-09-21T09:17:34Z","relation":"source_file","checksum":"8cd60dcb8762e8f21867e21e8001e183","file_name":"tex_and_pictures.zip","creator":"cchlebak","file_size":3876668,"access_level":"closed","content_type":"application/x-zip-compressed","file_id":"10032","date_updated":"2022-03-10T12:14:42Z"},{"date_updated":"2021-09-27T11:14:31Z","file_id":"10047","file_size":2532673,"content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2021-09-27T11:14:31Z","checksum":"9789e9d967c853c1503ec7f307170279","creator":"cchlebak","file_name":"thesis_portinale_Final (1).pdf"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_published":"2021-09-22T00:00:00Z","type":"dissertation","oa":1,"degree_awarded":"PhD","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"status":"public","corr_author":"1","month":"09","ddc":["515"],"alternative_title":["ISTA Thesis"],"has_accepted_license":"1","abstract":[{"text":"This PhD thesis is primarily focused on the study of discrete transport problems, introduced for the first time in the seminal works of Maas [Maa11] and Mielke [Mie11] on finite state Markov chains and reaction-diffusion equations, respectively. More in detail, my research focuses on the study of transport costs on graphs, in particular the convergence and the stability of such problems in the discrete-to-continuum limit. This thesis also includes some results concerning\r\nnon-commutative optimal transport. The first chapter of this thesis consists of a general introduction to the optimal transport problems, both in the discrete, the continuous, and the non-commutative setting. Chapters 2 and 3 present the content of two works, obtained in collaboration with Peter Gladbach, Eva Kopfer, and Jan Maas, where we have been able to show the convergence of discrete transport costs on periodic graphs to suitable continuous ones, which can be described by means of a homogenisation result. We first focus on the particular case of quadratic costs on the real line and then extending the result to more general costs in arbitrary dimension. Our results are the first complete characterisation of limits of transport costs on periodic graphs in arbitrary dimension which do not rely on any additional symmetry. In Chapter 4 we turn our attention to one of the intriguing connection between evolution equations and optimal transport, represented by the theory of gradient flows. We show that discrete gradient flow structures associated to a finite volume approximation of a certain class of diffusive equations (Fokker–Planck) is stable in the limit of vanishing meshes, reproving the convergence of the scheme via the method of evolutionary Γ-convergence and exploiting a more variational point of view on the problem. This is based on a collaboration with Dominik Forkert and Jan Maas. Chapter 5 represents a change of perspective, moving away from the discrete world and reaching the non-commutative one. As in the discrete case, we discuss how classical tools coming from the commutative optimal transport can be translated into the setting of density matrices. In particular, in this final chapter we present a non-commutative version of the Schrödinger problem (or entropic regularised optimal transport problem) and discuss existence and characterisation of minimisers, a duality result, and present a non-commutative version of the well-known Sinkhorn algorithm to compute the above mentioned optimisers. This is based on a joint work with Dario Feliciangeli and Augusto Gerolin. Finally, Appendix A and B contain some additional material and discussions, with particular attention to Harnack inequalities and the regularity of flows on discrete spaces.","lang":"eng"}],"date_created":"2021-09-21T09:14:15Z","publisher":"Institute of Science and Technology Austria","supervisor":[{"id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","full_name":"Maas, Jan","orcid":"0000-0002-0845-1338","last_name":"Maas","first_name":"Jan"}],"language":[{"iso":"eng"}],"author":[{"last_name":"Portinale","first_name":"Lorenzo","full_name":"Portinale, Lorenzo","id":"30AD2CBC-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2026-04-08T07:00:04Z","title":"Discrete-to-continuum limits of transport problems and gradient flows in the space of measures","file_date_updated":"2022-03-10T12:14:42Z","publication_identifier":{"issn":["2663-337X"]},"related_material":{"record":[{"relation":"part_of_dissertation","id":"9792","status":"public"},{"status":"public","id":"10022","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"7573","status":"public"}]},"acknowledgement":"The author gratefully acknowledges support by the Austrian Science Fund (FWF), grants No W1245.","day":"22","OA_place":"publisher","_id":"10030","oa_version":"Published Version","department":[{"_id":"GradSch"},{"_id":"JaMa"}],"project":[{"name":"Dissipation and dispersion in nonlinear partial differential equations","grant_number":"W1245","call_identifier":"FWF","_id":"260788DE-B435-11E9-9278-68D0E5697425"},{"grant_number":"F6504","name":"Taming Complexity in Partial Differential Systems","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2"}],"citation":{"ieee":"L. Portinale, “Discrete-to-continuum limits of transport problems and gradient flows in the space of measures,” Institute of Science and Technology Austria, 2021.","mla":"Portinale, Lorenzo. <i>Discrete-to-Continuum Limits of Transport Problems and Gradient Flows in the Space of Measures</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/at:ista:10030\">10.15479/at:ista:10030</a>.","apa":"Portinale, L. (2021). <i>Discrete-to-continuum limits of transport problems and gradient flows in the space of measures</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:10030\">https://doi.org/10.15479/at:ista:10030</a>","ama":"Portinale L. Discrete-to-continuum limits of transport problems and gradient flows in the space of measures. 2021. doi:<a href=\"https://doi.org/10.15479/at:ista:10030\">10.15479/at:ista:10030</a>","ista":"Portinale L. 2021. Discrete-to-continuum limits of transport problems and gradient flows in the space of measures. Institute of Science and Technology Austria.","chicago":"Portinale, Lorenzo. “Discrete-to-Continuum Limits of Transport Problems and Gradient Flows in the Space of Measures.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/at:ista:10030\">https://doi.org/10.15479/at:ista:10030</a>.","short":"L. Portinale, Discrete-to-Continuum Limits of Transport Problems and Gradient Flows in the Space of Measures, Institute of Science and Technology Austria, 2021."},"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"doi":"10.15479/at:ista:10030"},{"isi":1,"type":"journal_article","oa":1,"year":"2021","keyword":["Chiral algebras","Chiral homology","Factorization algebras","Koszul duality","Ran space"],"article_processing_charge":"Yes (via OA deal)","publication_status":"published","file":[{"file_size":840635,"content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2021-09-21T15:58:52Z","checksum":"f3c0086d41af11db31c00014efb38072","file_name":"1-s2.0-S000187082100431X-main.pdf","creator":"qho","date_updated":"2021-09-21T15:58:52Z","file_id":"10034"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_published":"2021-09-21T00:00:00Z","article_number":"107992","date_created":"2021-09-21T15:58:59Z","abstract":[{"text":"The ⊗*-monoidal structure on the category of sheaves on the Ran space is not pro-nilpotent in the sense of [3]. However, under some connectivity assumptions, we prove that Koszul duality induces an equivalence of categories and that this equivalence behaves nicely with respect to Verdier duality on the Ran space and integrating along the Ran space, i.e. taking factorization homology. Based on ideas sketched in [4], we show that these results also offer a simpler alternative to one of the two main steps in the proof of the Atiyah-Bott formula given in [7] and [5].","lang":"eng"}],"has_accepted_license":"1","publisher":"Elsevier","language":[{"iso":"eng"}],"intvolume":"       392","publication":"Advances in Mathematics","ddc":["514"],"month":"09","corr_author":"1","status":"public","article_type":"original","acknowledgement":"The author would like to express his gratitude to D. Gaitsgory, without whose tireless guidance and encouragement in pursuing this problem, this work would not have been possible. The author is grateful to his advisor B.C. Ngô for many years of patient guidance and support. This paper is revised while the author is a postdoc in Hausel group at IST Austria. We thank him and the group for providing a wonderful research environment. The author also gratefully acknowledges the support of the Lise Meitner fellowship “Algebro-Geometric Applications of Factorization Homology,” Austrian Science Fund (FWF): M 2751.","publication_identifier":{"issn":["0001-8708"],"eissn":["1090-2082"]},"file_date_updated":"2021-09-21T15:58:52Z","day":"21","arxiv":1,"external_id":{"arxiv":["1610.00212"],"isi":["000707040300031"]},"author":[{"first_name":"Quoc P","orcid":"0000-0001-6889-1418","last_name":"Ho","id":"3DD82E3C-F248-11E8-B48F-1D18A9856A87","full_name":"Ho, Quoc P"}],"date_updated":"2025-04-14T09:09:35Z","title":"The Atiyah-Bott formula and connectivity in chiral Koszul duality","department":[{"_id":"TaHa"}],"scopus_import":"1","volume":392,"project":[{"call_identifier":"FWF","_id":"26B96266-B435-11E9-9278-68D0E5697425","name":"Algebro-Geometric Applications of Factorization Homology","grant_number":"M02751"}],"doi":"10.1016/j.aim.2021.107992","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"citation":{"ista":"Ho QP. 2021. The Atiyah-Bott formula and connectivity in chiral Koszul duality. Advances in Mathematics. 392, 107992.","ama":"Ho QP. The Atiyah-Bott formula and connectivity in chiral Koszul duality. <i>Advances in Mathematics</i>. 2021;392. doi:<a href=\"https://doi.org/10.1016/j.aim.2021.107992\">10.1016/j.aim.2021.107992</a>","apa":"Ho, Q. P. (2021). The Atiyah-Bott formula and connectivity in chiral Koszul duality. <i>Advances in Mathematics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.aim.2021.107992\">https://doi.org/10.1016/j.aim.2021.107992</a>","ieee":"Q. P. Ho, “The Atiyah-Bott formula and connectivity in chiral Koszul duality,” <i>Advances in Mathematics</i>, vol. 392. Elsevier, 2021.","mla":"Ho, Quoc P. “The Atiyah-Bott Formula and Connectivity in Chiral Koszul Duality.” <i>Advances in Mathematics</i>, vol. 392, 107992, Elsevier, 2021, doi:<a href=\"https://doi.org/10.1016/j.aim.2021.107992\">10.1016/j.aim.2021.107992</a>.","short":"Q.P. Ho, Advances in Mathematics 392 (2021).","chicago":"Ho, Quoc P. “The Atiyah-Bott Formula and Connectivity in Chiral Koszul Duality.” <i>Advances in Mathematics</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.aim.2021.107992\">https://doi.org/10.1016/j.aim.2021.107992</a>."},"_id":"10033","oa_version":"Published Version","quality_controlled":"1"},{"author":[{"id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","full_name":"Klein, Karen","first_name":"Karen","last_name":"Klein"},{"last_name":"Pascual Perez","orcid":"0000-0001-8630-415X","first_name":"Guillermo","full_name":"Pascual Perez, Guillermo","id":"2D7ABD02-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Michael","orcid":"0000-0003-3186-2482","last_name":"Walter","id":"488F98B0-F248-11E8-B48F-1D18A9856A87","full_name":"Walter, Michael"},{"full_name":"Kamath Hosdurg, Chethan","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87","first_name":"Chethan","last_name":"Kamath Hosdurg","orcid":"0009-0006-6812-7317"},{"first_name":"Margarita","last_name":"Capretto","full_name":"Capretto, Margarita"},{"id":"ffc563a3-f6e0-11ea-865d-e3cce03d17cc","full_name":"Cueto Noval, Miguel","first_name":"Miguel","orcid":"0000-0002-2505-4246","last_name":"Cueto Noval"},{"first_name":"Ilia","last_name":"Markov","id":"D0CF4148-C985-11E9-8066-0BDEE5697425","full_name":"Markov, Ilia"},{"id":"2D82B818-F248-11E8-B48F-1D18A9856A87","full_name":"Yeo, Michelle X","orcid":"0009-0001-3676-4809","last_name":"Yeo","first_name":"Michelle X"},{"last_name":"Alwen","first_name":"Joel F","full_name":"Alwen, Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z"}],"date_updated":"2026-04-08T07:01:44Z","title":"Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement","acknowledgement":"The first three authors contributed equally to this work. Funded by the European Research Council (ERC) under the European Union’s Horizon2020 research and innovation programme (682815-TOCNeT). Funded by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No.665385.","related_material":{"record":[{"status":"public","id":"18088","relation":"dissertation_contains"},{"status":"public","id":"10035","relation":"dissertation_contains"}]},"day":"26","conference":{"end_date":"2021-05-27","location":"San Francisco, CA, United States","name":"SP: Symposium on Security and Privacy","start_date":"2021-05-24"},"external_id":{"isi":["001316065000016"]},"_id":"10049","main_file_link":[{"url":"https://eprint.iacr.org/2019/1489","open_access":"1"}],"oa_version":"Preprint","quality_controlled":"1","scopus_import":"1","department":[{"_id":"KrPi"},{"_id":"DaAl"}],"project":[{"call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","grant_number":"665385"},{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"682815","name":"Teaching Old Crypto New Tricks"}],"doi":"10.1109/sp40001.2021.00035","citation":{"chicago":"Klein, Karen, Guillermo Pascual Perez, Michael Walter, Chethan Kamath Hosdurg, Margarita Capretto, Miguel Cueto Noval, Ilia Markov, Michelle X Yeo, Joel F Alwen, and Krzysztof Z Pietrzak. “Keep the Dirt: Tainted TreeKEM, Adaptively and Actively Secure Continuous Group Key Agreement.” In <i>2021 IEEE Symposium on Security and Privacy </i>, 268–84. IEEE, 2021. <a href=\"https://doi.org/10.1109/sp40001.2021.00035\">https://doi.org/10.1109/sp40001.2021.00035</a>.","short":"K. Klein, G. Pascual Perez, M. Walter, C. Kamath Hosdurg, M. Capretto, M. Cueto Noval, I. Markov, M.X. Yeo, J.F. Alwen, K.Z. Pietrzak, in:, 2021 IEEE Symposium on Security and Privacy , IEEE, 2021, pp. 268–284.","mla":"Klein, Karen, et al. “Keep the Dirt: Tainted TreeKEM, Adaptively and Actively Secure Continuous Group Key Agreement.” <i>2021 IEEE Symposium on Security and Privacy </i>, IEEE, 2021, pp. 268–84, doi:<a href=\"https://doi.org/10.1109/sp40001.2021.00035\">10.1109/sp40001.2021.00035</a>.","ieee":"K. Klein <i>et al.</i>, “Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement,” in <i>2021 IEEE Symposium on Security and Privacy </i>, San Francisco, CA, United States, 2021, pp. 268–284.","apa":"Klein, K., Pascual Perez, G., Walter, M., Kamath Hosdurg, C., Capretto, M., Cueto Noval, M., … Pietrzak, K. Z. (2021). Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement. In <i>2021 IEEE Symposium on Security and Privacy </i> (pp. 268–284). San Francisco, CA, United States: IEEE. <a href=\"https://doi.org/10.1109/sp40001.2021.00035\">https://doi.org/10.1109/sp40001.2021.00035</a>","ama":"Klein K, Pascual Perez G, Walter M, et al. Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement. In: <i>2021 IEEE Symposium on Security and Privacy </i>. IEEE; 2021:268-284. doi:<a href=\"https://doi.org/10.1109/sp40001.2021.00035\">10.1109/sp40001.2021.00035</a>","ista":"Klein K, Pascual Perez G, Walter M, Kamath Hosdurg C, Capretto M, Cueto Noval M, Markov I, Yeo MX, Alwen JF, Pietrzak KZ. 2021. Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement. 2021 IEEE Symposium on Security and Privacy . SP: Symposium on Security and Privacy, 268–284."},"year":"2021","article_processing_charge":"No","publication_status":"published","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_published":"2021-08-26T00:00:00Z","page":"268-284","isi":1,"type":"conference","ec_funded":1,"oa":1,"publication":"2021 IEEE Symposium on Security and Privacy ","status":"public","month":"08","corr_author":"1","abstract":[{"lang":"eng","text":"While messaging systems with strong security guarantees are widely used in practice, designing a protocol that scales efficiently to large groups and enjoys similar security guarantees remains largely open. The two existing proposals to date are ART (Cohn-Gordon et al., CCS18) and TreeKEM (IETF, The Messaging Layer Security Protocol, draft). TreeKEM is the currently considered candidate by the IETF MLS working group, but dynamic group operations (i.e. adding and removing users) can cause efficiency issues. In this paper we formalize and analyze a variant of TreeKEM which we term Tainted TreeKEM (TTKEM for short). The basic idea underlying TTKEM was suggested by Millican (MLS mailing list, February 2018). This version is more efficient than TreeKEM for some natural distributions of group operations, we quantify this through simulations.Our second contribution is two security proofs for TTKEM which establish post compromise and forward secrecy even against adaptive attackers. The security loss (to the underlying PKE) in the Random Oracle Model is a polynomial factor, and a quasipolynomial one in the Standard Model. Our proofs can be adapted to TreeKEM as well. Before our work no security proof for any TreeKEM-like protocol establishing tight security against an adversary who can adaptively choose the sequence of operations was known. We also are the first to prove (or even formalize) active security where the server can arbitrarily deviate from the protocol specification. Proving fully active security – where also the users can arbitrarily deviate – remains open."}],"date_created":"2021-09-27T13:46:27Z","publisher":"IEEE","language":[{"iso":"eng"}]},{"publisher":"Society for Neuroscience","abstract":[{"lang":"eng","text":"Rab-interacting molecule (RIM)-binding protein 2 (BP2) is a multidomain protein of the presynaptic active zone (AZ). By binding to RIM, bassoon (Bsn), and voltage-gated Ca2+ channels (CaV), it is considered to be a central organizer of the topography of CaV and release sites of synaptic vesicles (SVs) at the AZ. Here, we used RIM-BP2 knock-out (KO) mice and their wild-type (WT) littermates of either sex to investigate the role of RIM-BP2 at the endbulb of Held synapse of auditory nerve fibers (ANFs) with bushy cells (BCs) of the cochlear nucleus, a fast relay of the auditory pathway with high release probability. Disruption of RIM-BP2 lowered release probability altering short-term plasticity and reduced evoked EPSCs. Analysis of SV pool dynamics during high-frequency train stimulation indicated a reduction of SVs with high release probability but an overall normal size of the readily releasable SV pool (RRP). The Ca2+-dependent fast component of SV replenishment after RRP depletion was slowed. Ultrastructural analysis by superresolution light and electron microscopy revealed an impaired topography of presynaptic CaV and a reduction of docked and membrane-proximal SVs at the AZ. We conclude that RIM-BP2 organizes the topography of CaV, and promotes SV tethering and docking. This way RIM-BP2 is critical for establishing a high initial release probability as required to reliably signal sound onset information that we found to be degraded in BCs of RIM-BP2-deficient mice in vivo. SIGNIFICANCE STATEMENT: Rab-interacting molecule (RIM)-binding proteins (BPs) are key organizers of the active zone (AZ). Using a multidisciplinary approach to the calyceal endbulb of Held synapse that transmits auditory information at rates of up to hundreds of Hertz with submillisecond precision we demonstrate a requirement for RIM-BP2 for normal auditory signaling. Endbulb synapses lacking RIM-BP2 show a reduced release probability despite normal whole-terminal Ca2+ influx and abundance of the key priming protein Munc13-1, a reduced rate of SV replenishment, as well as an altered topography of voltage-gated (CaV)2.1 Ca2+ channels, and fewer docked and membrane proximal synaptic vesicles (SVs). This hampers transmission of sound onset information likely affecting downstream neural computations such as of sound localization."}],"date_created":"2021-09-27T14:33:13Z","pmid":1,"has_accepted_license":"1","intvolume":"        41","language":[{"iso":"eng"}],"issue":"37","publication":"Journal of Neuroscience","month":"09","status":"public","ddc":["570"],"page":"7742-7767","oa":1,"type":"journal_article","isi":1,"file":[{"content_type":"application/pdf","access_level":"open_access","file_size":11571961,"file_name":"2021_JourNeuroscience_Butola.pdf","checksum":"769ab627c7355a50ccfd445e43a5f351","creator":"dernst","relation":"main_file","date_created":"2022-05-31T09:10:15Z","date_updated":"2022-05-31T09:10:15Z","success":1,"file_id":"11423"}],"year":"2021","article_processing_charge":"No","publication_status":"published","date_published":"2021-09-15T00:00:00Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","volume":41,"department":[{"_id":"RySh"}],"scopus_import":"1","citation":{"mla":"Butola, Tanvi, et al. “RIM-Binding Protein 2 Organizes Ca<sup>21</sup> Channel Topography and Regulates Release Probability and Vesicle Replenishment at a Fast Central Synapse.” <i>Journal of Neuroscience</i>, vol. 41, no. 37, Society for Neuroscience, 2021, pp. 7742–67, doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.0586-21.2021\">10.1523/JNEUROSCI.0586-21.2021</a>.","ieee":"T. Butola <i>et al.</i>, “RIM-binding protein 2 organizes Ca<sup>21</sup> channel topography and regulates release probability and vesicle replenishment at a fast central synapse,” <i>Journal of Neuroscience</i>, vol. 41, no. 37. Society for Neuroscience, pp. 7742–7767, 2021.","ama":"Butola T, Alvanos T, Hintze A, et al. RIM-binding protein 2 organizes Ca<sup>21</sup> channel topography and regulates release probability and vesicle replenishment at a fast central synapse. <i>Journal of Neuroscience</i>. 2021;41(37):7742-7767. doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.0586-21.2021\">10.1523/JNEUROSCI.0586-21.2021</a>","apa":"Butola, T., Alvanos, T., Hintze, A., Koppensteiner, P., Kleindienst, D., Shigemoto, R., … Moser, T. (2021). RIM-binding protein 2 organizes Ca<sup>21</sup> channel topography and regulates release probability and vesicle replenishment at a fast central synapse. <i>Journal of Neuroscience</i>. Society for Neuroscience. <a href=\"https://doi.org/10.1523/JNEUROSCI.0586-21.2021\">https://doi.org/10.1523/JNEUROSCI.0586-21.2021</a>","ista":"Butola T, Alvanos T, Hintze A, Koppensteiner P, Kleindienst D, Shigemoto R, Wichmann C, Moser T. 2021. RIM-binding protein 2 organizes Ca<sup>21</sup> channel topography and regulates release probability and vesicle replenishment at a fast central synapse. Journal of Neuroscience. 41(37), 7742–7767.","chicago":"Butola, Tanvi, Theocharis Alvanos, Anika Hintze, Peter Koppensteiner, David Kleindienst, Ryuichi Shigemoto, Carolin Wichmann, and Tobias Moser. “RIM-Binding Protein 2 Organizes Ca<sup>21</sup> Channel Topography and Regulates Release Probability and Vesicle Replenishment at a Fast Central Synapse.” <i>Journal of Neuroscience</i>. Society for Neuroscience, 2021. <a href=\"https://doi.org/10.1523/JNEUROSCI.0586-21.2021\">https://doi.org/10.1523/JNEUROSCI.0586-21.2021</a>.","short":"T. Butola, T. Alvanos, A. Hintze, P. Koppensteiner, D. Kleindienst, R. Shigemoto, C. Wichmann, T. Moser, Journal of Neuroscience 41 (2021) 7742–7767."},"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"doi":"10.1523/JNEUROSCI.0586-21.2021","quality_controlled":"1","oa_version":"Published Version","_id":"10051","acknowledgement":"This work was supported by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) through the Collaborative Sensory Research Center 1286 [to C.W. (A4) and T.M. (B5)] and under Germany’s Excellence Strategy Grant EXC 2067/1-390729940. We thank S. Gerke, A.J. Goldak, and C. Senger-Freitag for expert technical assistance; G. Hoch for developing image analysis routines; and S. Chepurwar and N. Strenzke for technical support and discussion regarding in vivo experiments. We also thank Dr. Christian Rosenmund, Dr. Katharina Grauel, and Dr. Stephan Sigrist for providing RIM-BP2 KO mice and Dr. Masahiko Watanabe for providing the anti-neurexin-antibody, and Dr. Toshihisa Ohtsuka for the anti-ELKS-antibody. J. Neef for help with the STED imaging and image analysis; E. Neher and S. Rizzoli for discussion and comments on the manuscript; K. Eguchi for help with the statistical analysis; and C. H. Huang and J. Neef for constant support and scientific discussion.","publication_identifier":{"eissn":["1529-2401"],"issn":["0270-6474"]},"file_date_updated":"2022-05-31T09:10:15Z","article_type":"original","day":"15","external_id":{"pmid":["34353898"],"isi":["000752287700005"]},"author":[{"last_name":"Butola","first_name":"Tanvi","full_name":"Butola, Tanvi"},{"last_name":"Alvanos","first_name":"Theocharis","full_name":"Alvanos, Theocharis"},{"full_name":"Hintze, Anika","last_name":"Hintze","first_name":"Anika"},{"full_name":"Koppensteiner, Peter","id":"3B8B25A8-F248-11E8-B48F-1D18A9856A87","first_name":"Peter","last_name":"Koppensteiner","orcid":"0000-0002-3509-1948"},{"first_name":"David","last_name":"Kleindienst","full_name":"Kleindienst, David","id":"42E121A4-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Shigemoto","orcid":"0000-0001-8761-9444","first_name":"Ryuichi","full_name":"Shigemoto, Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Wichmann","first_name":"Carolin","full_name":"Wichmann, Carolin"},{"full_name":"Moser, Tobias","first_name":"Tobias","last_name":"Moser"}],"date_updated":"2023-08-14T06:56:30Z","title":"RIM-binding protein 2 organizes Ca<sup>21</sup> channel topography and regulates release probability and vesicle replenishment at a fast central synapse"},{"language":[{"iso":"eng"}],"intvolume":"       203","alternative_title":["LIPIcs"],"abstract":[{"lang":"eng","text":"A deterministic finite automaton (DFA) 𝒜 is composite if its language L(𝒜) can be decomposed into an intersection ⋂_{i = 1}^k L(𝒜_i) of languages of smaller DFAs. Otherwise, 𝒜 is prime. This notion of primality was introduced by Kupferman and Mosheiff in 2013, and while they proved that we can decide whether a DFA is composite, the precise complexity of this problem is still open, with a doubly-exponential gap between the upper and lower bounds. In this work, we focus on permutation DFAs, i.e., those for which the transition monoid is a group. We provide an NP algorithm to decide whether a permutation DFA is composite, and show that the difficulty of this problem comes from the number of non-accepting states of the instance: we give a fixed-parameter tractable algorithm with the number of rejecting states as the parameter. Moreover, we investigate the class of commutative permutation DFAs. Their structural properties allow us to decide compositionality in NL, and even in LOGSPACE if the alphabet size is fixed. Despite this low complexity, we show that complex behaviors still arise in this class: we provide a family of composite DFAs each requiring polynomially many factors with respect to its size. We also consider the variant of the problem that asks whether a DFA is k-factor composite, that is, decomposable into k smaller DFAs, for some given integer k ∈ ℕ. We show that, for commutative permutation DFAs, restricting the number of factors makes the decision computationally harder, and yields a problem with tight bounds: it is NP-complete. Finally, we show that in general, this problem is in PSPACE, and it is in LOGSPACE for DFAs with a singleton alphabet."}],"date_created":"2021-09-27T14:33:14Z","has_accepted_license":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication":"32nd International Conference on Concurrency Theory","month":"08","ddc":["000"],"status":"public","ec_funded":1,"type":"conference","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_number":"18","date_published":"2021-08-13T00:00:00Z","article_processing_charge":"No","year":"2021","publication_status":"published","file":[{"access_level":"open_access","content_type":"application/pdf","file_size":1003552,"checksum":"4722c81be82265cf45e78adf9db91250","file_name":"2021_CONCUR_Jecker.pdf","creator":"cchlebak","date_created":"2021-10-01T11:10:53Z","relation":"main_file","date_updated":"2021-10-01T11:10:53Z","file_id":"10064","success":1}],"project":[{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"citation":{"ieee":"I. R. Jecker, N. Mazzocchi, and P. Wolf, “Decomposing permutation automata,” in <i>32nd International Conference on Concurrency Theory</i>, Paris, France, 2021, vol. 203.","mla":"Jecker, Ismael R., et al. “Decomposing Permutation Automata.” <i>32nd International Conference on Concurrency Theory</i>, vol. 203, 18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2021.18\">10.4230/LIPIcs.CONCUR.2021.18</a>.","ama":"Jecker IR, Mazzocchi N, Wolf P. Decomposing permutation automata. In: <i>32nd International Conference on Concurrency Theory</i>. Vol 203. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2021.18\">10.4230/LIPIcs.CONCUR.2021.18</a>","ista":"Jecker IR, Mazzocchi N, Wolf P. 2021. Decomposing permutation automata. 32nd International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 203, 18.","apa":"Jecker, I. R., Mazzocchi, N., &#38; Wolf, P. (2021). Decomposing permutation automata. In <i>32nd International Conference on Concurrency Theory</i> (Vol. 203). Paris, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2021.18\">https://doi.org/10.4230/LIPIcs.CONCUR.2021.18</a>","chicago":"Jecker, Ismael R, Nicolas Mazzocchi, and Petra Wolf. “Decomposing Permutation Automata.” In <i>32nd International Conference on Concurrency Theory</i>, Vol. 203. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2021.18\">https://doi.org/10.4230/LIPIcs.CONCUR.2021.18</a>.","short":"I.R. Jecker, N. Mazzocchi, P. Wolf, in:, 32nd International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021."},"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"doi":"10.4230/LIPIcs.CONCUR.2021.18","department":[{"_id":"KrCh"}],"scopus_import":"1","volume":203,"_id":"10052","quality_controlled":"1","oa_version":"Published Version","conference":{"start_date":"2021-08-23","location":"Paris, France","name":"CONCUR: Conference on Concurrency Theory","end_date":"2021-08-27"},"external_id":{"arxiv":["2107.04683"]},"acknowledgement":"Ismaël Jecker: Marie Skłodowska-Curie Grant Agreement No. 754411. Nicolas Mazzocchi: BOSCO project PGC2018-102210-B-I00 (MCIU/AEI/FEDER, UE), BLOQUESCM project S2018/TCS-4339, and MINECO grant RYC-2016-20281.\r\nPetra Wolf : DFG project FE 560/9-1.\r\n","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-9597-7203-7"]},"file_date_updated":"2021-10-01T11:10:53Z","day":"13","arxiv":1,"date_updated":"2025-05-14T10:55:28Z","title":"Decomposing permutation automata","author":[{"first_name":"Ismael R","last_name":"Jecker","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","full_name":"Jecker, Ismael R"},{"first_name":"Nicolas","last_name":"Mazzocchi","full_name":"Mazzocchi, Nicolas"},{"full_name":"Wolf, Petra","first_name":"Petra","last_name":"Wolf"}]},{"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"last_name":"Henzinger","orcid":"0000-0002-5008-6530","first_name":"Monika H","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"last_name":"Kale","first_name":"Sagar Sudhir","full_name":"Kale, Sagar Sudhir"},{"full_name":"Svozil, Alexander","first_name":"Alexander","last_name":"Svozil"}],"title":"Faster algorithms for bounded liveness in graphs and game graphs","date_updated":"2025-05-14T10:55:19Z","day":"02","file_date_updated":"2021-10-01T08:49:26Z","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-195-5"]},"acknowledgement":"Krishnendu Chatterjee: Supported by the ERC CoG 863818 (ForM-SMArt). Monika Henzinger: Supported by the Austrian Science Fund (FWF) and netIDEE SCIENCE project P 33775-N. Sagar Sudhir Kale: Partially supported by the Vienna Science and Technology Fund (WWTF) through project ICT15-003. Alexander Svozil: Fully supported by the Vienna Science and Technology Fund (WWTF) through project ICT15-003.","conference":{"end_date":"2021-07-16","start_date":"2021-07-12","location":"Glasgow, Scotland","name":"ICALP: Automata, Languages and Programming"},"_id":"10054","oa_version":"Published Version","quality_controlled":"1","scopus_import":"1","department":[{"_id":"KrCh"}],"volume":198,"project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"citation":{"chicago":"Chatterjee, Krishnendu, Monika Henzinger, Sagar Sudhir Kale, and Alexander Svozil. “Faster Algorithms for Bounded Liveness in Graphs and Game Graphs.” In <i>48th International Colloquium on Automata, Languages, and Programming</i>, Vol. 198. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2021.124\">https://doi.org/10.4230/LIPIcs.ICALP.2021.124</a>.","short":"K. Chatterjee, M. Henzinger, S.S. Kale, A. Svozil, in:, 48th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.","ieee":"K. Chatterjee, M. Henzinger, S. S. Kale, and A. Svozil, “Faster algorithms for bounded liveness in graphs and game graphs,” in <i>48th International Colloquium on Automata, Languages, and Programming</i>, Glasgow, Scotland, 2021, vol. 198.","mla":"Chatterjee, Krishnendu, et al. “Faster Algorithms for Bounded Liveness in Graphs and Game Graphs.” <i>48th International Colloquium on Automata, Languages, and Programming</i>, vol. 198, 124, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2021.124\">10.4230/LIPIcs.ICALP.2021.124</a>.","ama":"Chatterjee K, Henzinger M, Kale SS, Svozil A. Faster algorithms for bounded liveness in graphs and game graphs. In: <i>48th International Colloquium on Automata, Languages, and Programming</i>. Vol 198. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2021.124\">10.4230/LIPIcs.ICALP.2021.124</a>","apa":"Chatterjee, K., Henzinger, M., Kale, S. S., &#38; Svozil, A. (2021). Faster algorithms for bounded liveness in graphs and game graphs. In <i>48th International Colloquium on Automata, Languages, and Programming</i> (Vol. 198). Glasgow, Scotland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2021.124\">https://doi.org/10.4230/LIPIcs.ICALP.2021.124</a>","ista":"Chatterjee K, Henzinger M, Kale SS, Svozil A. 2021. Faster algorithms for bounded liveness in graphs and game graphs. 48th International Colloquium on Automata, Languages, and Programming. ICALP: Automata, Languages and Programming, LIPIcs, vol. 198, 124."},"doi":"10.4230/LIPIcs.ICALP.2021.124","publication_status":"published","article_processing_charge":"No","year":"2021","file":[{"checksum":"5a3fed8dbba8c088cbeac1e24cc10bc5","creator":"cchlebak","file_name":"2021_LIPIcs_Chatterjee.pdf","date_created":"2021-10-01T08:49:26Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_size":854576,"file_id":"10062","success":1,"date_updated":"2021-10-01T08:49:26Z"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2021-07-02T00:00:00Z","article_number":"124","ec_funded":1,"type":"conference","oa":1,"publication":"48th International Colloquium on Automata, Languages, and Programming","corr_author":"1","status":"public","month":"07","ddc":["000"],"date_created":"2021-09-27T14:33:15Z","abstract":[{"text":"Graphs and games on graphs are fundamental models for the analysis of reactive systems, in particular, for model-checking and the synthesis of reactive systems. The class of ω-regular languages provides a robust specification formalism for the desired properties of reactive systems. In the classical infinitary formulation of the liveness part of an ω-regular specification, a \"good\" event must happen eventually without any bound between the good events. A stronger notion of liveness is bounded liveness, which requires that good events happen within d transitions. Given a graph or a game graph with n vertices, m edges, and a bounded liveness objective, the previous best-known algorithmic bounds are as follows: (i) O(dm) for graphs, which in the worst-case is O(n³); and (ii) O(n² d²) for games on graphs. Our main contributions improve these long-standing algorithmic bounds. For graphs we present: (i) a randomized algorithm with one-sided error with running time O(n^{2.5} log n) for the bounded liveness objectives; and (ii) a deterministic linear-time algorithm for the complement of bounded liveness objectives. For games on graphs, we present an O(n² d) time algorithm for the bounded liveness objectives.","lang":"eng"}],"has_accepted_license":"1","alternative_title":["LIPIcs"],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","language":[{"iso":"eng"}],"intvolume":"       198"},{"publication":"38th International Symposium on Theoretical Aspects of Computer Science","month":"03","ddc":["000"],"status":"public","language":[{"iso":"eng"}],"intvolume":"       187","alternative_title":["LIPIcs"],"has_accepted_license":"1","date_created":"2021-09-27T14:33:15Z","abstract":[{"lang":"eng","text":"Repeated idempotent elements are commonly used to characterise iterable behaviours in abstract models of computation. Therefore, given a monoid M, it is natural to ask how long a sequence of elements of M needs to be to ensure the presence of consecutive idempotent factors. This question is formalised through the notion of the Ramsey function R_M associated to M, obtained by mapping every k ∈ ℕ to the minimal integer R_M(k) such that every word u ∈ M^* of length R_M(k) contains k consecutive non-empty factors that correspond to the same idempotent element of M. In this work, we study the behaviour of the Ramsey function R_M by investigating the regular 𝒟-length of M, defined as the largest size L(M) of a submonoid of M isomorphic to the set of natural numbers {1,2, …, L(M)} equipped with the max operation. We show that the regular 𝒟-length of M determines the degree of R_M, by proving that k^L(M) ≤ R_M(k) ≤ (k|M|⁴)^L(M). To allow applications of this result, we provide the value of the regular 𝒟-length of diverse monoids. In particular, we prove that the full monoid of n × n Boolean matrices, which is used to express transition monoids of non-deterministic automata, has a regular 𝒟-length of (n²+n+2)/2."}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_number":"44","date_published":"2021-03-10T00:00:00Z","article_processing_charge":"No","year":"2021","publication_status":"published","file":[{"content_type":"application/pdf","access_level":"open_access","file_size":720250,"creator":"cchlebak","checksum":"17432a05733f408de300e17e390a90e4","file_name":"2021_LIPIcs_Jecker.pdf","relation":"main_file","date_created":"2021-10-01T09:55:00Z","date_updated":"2021-10-01T09:55:00Z","file_id":"10063","success":1}],"ec_funded":1,"isi":1,"type":"conference","oa":1,"_id":"10055","quality_controlled":"1","oa_version":"Published Version","project":[{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"}],"doi":"10.4230/LIPIcs.STACS.2021.44","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"citation":{"chicago":"Jecker, Ismael R. “A Ramsey Theorem for Finite Monoids.” In <i>38th International Symposium on Theoretical Aspects of Computer Science</i>, Vol. 187. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2021.44\">https://doi.org/10.4230/LIPIcs.STACS.2021.44</a>.","short":"I.R. Jecker, in:, 38th International Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.","ieee":"I. R. Jecker, “A Ramsey theorem for finite monoids,” in <i>38th International Symposium on Theoretical Aspects of Computer Science</i>, Saarbrücken, Germany, 2021, vol. 187.","mla":"Jecker, Ismael R. “A Ramsey Theorem for Finite Monoids.” <i>38th International Symposium on Theoretical Aspects of Computer Science</i>, vol. 187, 44, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2021.44\">10.4230/LIPIcs.STACS.2021.44</a>.","apa":"Jecker, I. R. (2021). A Ramsey theorem for finite monoids. In <i>38th International Symposium on Theoretical Aspects of Computer Science</i> (Vol. 187). Saarbrücken, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2021.44\">https://doi.org/10.4230/LIPIcs.STACS.2021.44</a>","ista":"Jecker IR. 2021. A Ramsey theorem for finite monoids. 38th International Symposium on Theoretical Aspects of Computer Science. STACS: Symposium on Theoretical Aspects of Computer Science, LIPIcs, vol. 187, 44.","ama":"Jecker IR. A Ramsey theorem for finite monoids. In: <i>38th International Symposium on Theoretical Aspects of Computer Science</i>. Vol 187. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2021.44\">10.4230/LIPIcs.STACS.2021.44</a>"},"scopus_import":"1","department":[{"_id":"KrCh"}],"volume":187,"date_updated":"2025-05-14T10:55:11Z","title":"A Ramsey theorem for finite monoids","author":[{"full_name":"Jecker, Ismael R","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","first_name":"Ismael R","last_name":"Jecker"}],"conference":{"end_date":"2021-03-19","name":"STACS: Symposium on Theoretical Aspects of Computer Science","location":"Saarbrücken, Germany","start_date":"2021-03-16"},"external_id":{"isi":["000635691700044"]},"file_date_updated":"2021-10-01T09:55:00Z","acknowledgement":"This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 754411. I wish to thank Michaël Cadilhac, Emmanuel Filiot and Charles Paperman for their valuable insights concerning Green’s relations.","publication_identifier":{"isbn":["978-3-9597-7180-1"],"issn":["1868-8969"]},"day":"10"},{"title":"Entanglement transitions from restricted Boltzmann machines","date_updated":"2026-04-07T12:43:22Z","author":[{"first_name":"Raimel A","orcid":"0000-0002-5383-2869","last_name":"Medina Ramos","id":"CE680B90-D85A-11E9-B684-C920E6697425","full_name":"Medina Ramos, Raimel A"},{"full_name":"Vasseur, Romain","last_name":"Vasseur","first_name":"Romain"},{"full_name":"Serbyn, Maksym","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","first_name":"Maksym","last_name":"Serbyn","orcid":"0000-0002-2399-5827"}],"external_id":{"isi":["000704414400002"],"arxiv":["2107.05735"]},"arxiv":1,"day":"30","article_type":"original","publication_identifier":{"eissn":["2469-9969"],"issn":["2469-9950"]},"acknowledgement":"We would like to thank S. De Nicola, P. Brighi, and V. Karle for fruitful discussions and valuable feedback on the manuscript. R.M. and M.S. acknowledge support by the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation program (Grant Agreement No. 850899). R.V. acknowledges support from the US Department of Energy, Office of Science, Basic Energy Sciences, under Early Career Award No. DE-SC0019168, and the Alfred P. Sloan Foundation through a Sloan Research Fellowship.","related_material":{"record":[{"id":"17208","relation":"dissertation_contains","status":"public"}]},"oa_version":"Preprint","quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/2107.05735","open_access":"1"}],"_id":"10067","citation":{"mla":"Medina Ramos, Raimel A., et al. “Entanglement Transitions from Restricted Boltzmann Machines.” <i>Physical Review B</i>, vol. 104, no. 10, 104205, American Physical Society, 2021, doi:<a href=\"https://doi.org/10.1103/physrevb.104.104205\">10.1103/physrevb.104.104205</a>.","ieee":"R. A. Medina Ramos, R. Vasseur, and M. Serbyn, “Entanglement transitions from restricted Boltzmann machines,” <i>Physical Review B</i>, vol. 104, no. 10. American Physical Society, 2021.","ista":"Medina Ramos RA, Vasseur R, Serbyn M. 2021. Entanglement transitions from restricted Boltzmann machines. Physical Review B. 104(10), 104205.","ama":"Medina Ramos RA, Vasseur R, Serbyn M. Entanglement transitions from restricted Boltzmann machines. <i>Physical Review B</i>. 2021;104(10). doi:<a href=\"https://doi.org/10.1103/physrevb.104.104205\">10.1103/physrevb.104.104205</a>","apa":"Medina Ramos, R. A., Vasseur, R., &#38; Serbyn, M. (2021). Entanglement transitions from restricted Boltzmann machines. <i>Physical Review B</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevb.104.104205\">https://doi.org/10.1103/physrevb.104.104205</a>","chicago":"Medina Ramos, Raimel A, Romain Vasseur, and Maksym Serbyn. “Entanglement Transitions from Restricted Boltzmann Machines.” <i>Physical Review B</i>. American Physical Society, 2021. <a href=\"https://doi.org/10.1103/physrevb.104.104205\">https://doi.org/10.1103/physrevb.104.104205</a>.","short":"R.A. Medina Ramos, R. Vasseur, M. Serbyn, Physical Review B 104 (2021)."},"doi":"10.1103/physrevb.104.104205","project":[{"name":"Non-Ergodic Quantum Matter: Universality, Dynamics and Control","grant_number":"850899","call_identifier":"H2020","_id":"23841C26-32DE-11EA-91FC-C7463DDC885E"}],"volume":104,"scopus_import":"1","department":[{"_id":"MaSe"}],"date_published":"2021-09-30T00:00:00Z","article_number":"104205","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publication_status":"published","article_processing_charge":"No","year":"2021","oa":1,"ec_funded":1,"type":"journal_article","isi":1,"publication":"Physical Review B","corr_author":"1","month":"09","status":"public","issue":"10","intvolume":"       104","language":[{"iso":"eng"}],"publisher":"American Physical Society","abstract":[{"text":"The search for novel entangled phases of matter has lead to the recent discovery of a new class of “entanglement transitions,” exemplified by random tensor networks and monitored quantum circuits. Most known examples can be understood as some classical ordering transitions in an underlying statistical mechanics model, where entanglement maps onto the free-energy cost of inserting a domain wall. In this paper we study the possibility of entanglement transitions driven by physics beyond such statistical mechanics mappings. Motivated by recent applications of neural-network-inspired variational Ansätze, we investigate under what conditions on the variational parameters these Ansätze can capture an entanglement transition. We study the entanglement scaling of short-range restricted Boltzmann machine (RBM) quantum states with random phases. For uncorrelated random phases, we analytically demonstrate the absence of an entanglement transition and reveal subtle finite-size effects in finite-size numerical simulations. Introducing phases with correlations decaying as 1/r^α in real space, we observe three regions with a different scaling of entanglement entropy depending on the exponent α. We study the nature of the transition between these regions, finding numerical evidence for critical behavior. Our work establishes the presence of long-range correlated phases in RBM-based wave functions as a required ingredient for entanglement transitions.","lang":"eng"}],"date_created":"2021-10-02T09:03:42Z"},{"doi":"10.1038/s41598-021-98411-z","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"citation":{"chicago":"Robinson, Matthew Richard, Marion Patxot, Miloš Stojanov, Sabine Blum, and David Baud. “Postpartum Hemorrhage Risk Is Driven by Changes in Blood Composition through Pregnancy.” <i>Scientific Reports</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1038/s41598-021-98411-z\">https://doi.org/10.1038/s41598-021-98411-z</a>.","short":"M.R. Robinson, M. Patxot, M. Stojanov, S. Blum, D. Baud, Scientific Reports 11 (2021).","mla":"Robinson, Matthew Richard, et al. “Postpartum Hemorrhage Risk Is Driven by Changes in Blood Composition through Pregnancy.” <i>Scientific Reports</i>, vol. 11, 19238, Springer Nature, 2021, doi:<a href=\"https://doi.org/10.1038/s41598-021-98411-z\">10.1038/s41598-021-98411-z</a>.","ieee":"M. R. Robinson, M. Patxot, M. Stojanov, S. Blum, and D. Baud, “Postpartum hemorrhage risk is driven by changes in blood composition through pregnancy,” <i>Scientific Reports</i>, vol. 11. Springer Nature, 2021.","ista":"Robinson MR, Patxot M, Stojanov M, Blum S, Baud D. 2021. Postpartum hemorrhage risk is driven by changes in blood composition through pregnancy. Scientific Reports. 11, 19238.","apa":"Robinson, M. R., Patxot, M., Stojanov, M., Blum, S., &#38; Baud, D. (2021). Postpartum hemorrhage risk is driven by changes in blood composition through pregnancy. <i>Scientific Reports</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41598-021-98411-z\">https://doi.org/10.1038/s41598-021-98411-z</a>","ama":"Robinson MR, Patxot M, Stojanov M, Blum S, Baud D. Postpartum hemorrhage risk is driven by changes in blood composition through pregnancy. <i>Scientific Reports</i>. 2021;11. doi:<a href=\"https://doi.org/10.1038/s41598-021-98411-z\">10.1038/s41598-021-98411-z</a>"},"department":[{"_id":"MaRo"}],"scopus_import":"1","volume":11,"_id":"10069","quality_controlled":"1","oa_version":"Published Version","external_id":{"pmid":["34584125"],"isi":["000701575500083"]},"file_date_updated":"2021-10-05T14:56:48Z","publication_identifier":{"eissn":["2045-2322"]},"acknowledgement":"This project was funded by an SNSF Eccellenza Grant to MRR (PCEGP3-181181), and by core funding from the Institute of Science and Technology Austria. We would like to thank the participants of the study and all the midwives and doctors for the computerized obstetrical data.","article_type":"original","day":"28","date_updated":"2024-10-09T21:00:57Z","title":"Postpartum hemorrhage risk is driven by changes in blood composition through pregnancy","author":[{"id":"E5D42276-F5DA-11E9-8E24-6303E6697425","full_name":"Robinson, Matthew Richard","first_name":"Matthew Richard","orcid":"0000-0001-8982-8813","last_name":"Robinson"},{"full_name":"Patxot, Marion","last_name":"Patxot","first_name":"Marion"},{"first_name":"Miloš","last_name":"Stojanov","full_name":"Stojanov, Miloš"},{"first_name":"Sabine","last_name":"Blum","full_name":"Blum, Sabine"},{"last_name":"Baud","first_name":"David","full_name":"Baud, David"}],"language":[{"iso":"eng"}],"intvolume":"        11","has_accepted_license":"1","date_created":"2021-10-03T22:01:21Z","pmid":1,"abstract":[{"text":"The extent to which women differ in the course of blood cell counts throughout pregnancy, and the importance of these changes to pregnancy outcomes has not been well defined. Here, we develop a series of statistical analyses of repeated measures data to reveal the degree to which women differ in the course of pregnancy, predict the changes that occur, and determine the importance of these changes for post-partum hemorrhage (PPH) which is one of the leading causes of maternal mortality. We present a prospective cohort of 4082 births recorded at the University Hospital, Lausanne, Switzerland between 2009 and 2014 where full labour records could be obtained, along with complete blood count data taken at hospital admission. We find significant differences, at a [Formula: see text] level, among women in how blood count values change through pregnancy for mean corpuscular hemoglobin, mean corpuscular volume, mean platelet volume, platelet count and red cell distribution width. We find evidence that almost all complete blood count values show trimester-specific associations with PPH. For example, high platelet count (OR 1.20, 95% CI 1.01-1.53), high mean platelet volume (OR 1.58, 95% CI 1.04-2.08), and high erythrocyte levels (OR 1.36, 95% CI 1.01-1.57) in trimester 1 increased PPH, but high values in trimester 3 decreased PPH risk (OR 0.85, 0.79, 0.67 respectively). We show that differences among women in the course of blood cell counts throughout pregnancy have an important role in shaping pregnancy outcome and tracking blood count value changes through pregnancy improves identification of women at increased risk of postpartum hemorrhage. This study provides greater understanding of the complex changes in blood count values that occur through pregnancy and provides indicators to guide the stratification of patients into risk groups.","lang":"eng"}],"publisher":"Springer Nature","month":"09","ddc":["618"],"status":"public","corr_author":"1","publication":"Scientific Reports","isi":1,"type":"journal_article","oa":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_published":"2021-09-28T00:00:00Z","article_number":"19238","article_processing_charge":"Yes","year":"2021","publication_status":"published","file":[{"file_id":"10091","success":1,"date_updated":"2021-10-05T14:56:48Z","file_name":"2021_ScientificReports_Robinson.pdf","creator":"cchlebak","checksum":"f002ec22f609f58e1263b79e7f79601e","date_created":"2021-10-05T14:56:48Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_size":6970368}]},{"intvolume":"       281","language":[{"iso":"eng"}],"publisher":"Elsevier","abstract":[{"text":"We extensively discuss the Rademacher and Sobolev-to-Lipschitz properties for generalized intrinsic distances on strongly local Dirichlet spaces possibly without square field operator. We present many non-smooth and infinite-dimensional examples. As an application, we prove the integral Varadhan short-time asymptotic with respect to a given distance function for a large class of strongly local Dirichlet forms.","lang":"eng"}],"date_created":"2021-10-03T22:01:21Z","publication":"Journal of Functional Analysis","status":"public","corr_author":"1","month":"09","issue":"11","oa":1,"isi":1,"ec_funded":1,"type":"journal_article","article_number":"109234","date_published":"2021-09-15T00:00:00Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","article_processing_charge":"No","year":"2021","publication_status":"published","citation":{"chicago":"Dello Schiavo, Lorenzo, and Kohei Suzuki. “Rademacher-Type Theorems and Sobolev-to-Lipschitz Properties for Strongly Local Dirichlet Spaces.” <i>Journal of Functional Analysis</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.jfa.2021.109234\">https://doi.org/10.1016/j.jfa.2021.109234</a>.","short":"L. Dello Schiavo, K. Suzuki, Journal of Functional Analysis 281 (2021).","mla":"Dello Schiavo, Lorenzo, and Kohei Suzuki. “Rademacher-Type Theorems and Sobolev-to-Lipschitz Properties for Strongly Local Dirichlet Spaces.” <i>Journal of Functional Analysis</i>, vol. 281, no. 11, 109234, Elsevier, 2021, doi:<a href=\"https://doi.org/10.1016/j.jfa.2021.109234\">10.1016/j.jfa.2021.109234</a>.","ieee":"L. Dello Schiavo and K. Suzuki, “Rademacher-type theorems and Sobolev-to-Lipschitz properties for strongly local Dirichlet spaces,” <i>Journal of Functional Analysis</i>, vol. 281, no. 11. Elsevier, 2021.","ista":"Dello Schiavo L, Suzuki K. 2021. Rademacher-type theorems and Sobolev-to-Lipschitz properties for strongly local Dirichlet spaces. Journal of Functional Analysis. 281(11), 109234.","apa":"Dello Schiavo, L., &#38; Suzuki, K. (2021). Rademacher-type theorems and Sobolev-to-Lipschitz properties for strongly local Dirichlet spaces. <i>Journal of Functional Analysis</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jfa.2021.109234\">https://doi.org/10.1016/j.jfa.2021.109234</a>","ama":"Dello Schiavo L, Suzuki K. Rademacher-type theorems and Sobolev-to-Lipschitz properties for strongly local Dirichlet spaces. <i>Journal of Functional Analysis</i>. 2021;281(11). doi:<a href=\"https://doi.org/10.1016/j.jfa.2021.109234\">10.1016/j.jfa.2021.109234</a>"},"doi":"10.1016/j.jfa.2021.109234","project":[{"grant_number":"F6504","name":"Taming Complexity in Partial Differential Systems","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2"},{"name":"Optimal Transport and Stochastic Dynamics","grant_number":"716117","call_identifier":"H2020","_id":"256E75B8-B435-11E9-9278-68D0E5697425"}],"volume":281,"scopus_import":"1","department":[{"_id":"JaMa"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2008.01492"}],"oa_version":"Preprint","quality_controlled":"1","_id":"10070","external_id":{"isi":["000703896600005"],"arxiv":["2008.01492"]},"arxiv":1,"article_type":"original","publication_identifier":{"eissn":["1096-0783"],"issn":["0022-1236"]},"acknowledgement":"The authors are grateful to Professor Kazuhiro Kuwae for kindly providing a copy of [49]. They are also grateful to Dr. Bang-Xian Han for helpful discussions on the Sobolev-to-Lipschitz property on metric measure spaces. They wish to express their deepest gratitude to an anonymous Reviewer, whose punctual remarks and comments greatly improved the accessibility and overall quality of the initial submission. This work was completed while L.D.S. was a member of the Institut für Angewandte Mathematik of the University of Bonn. He acknowledges funding of his position at that time by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) through the Sonderforschungsbereich (Sfb, Collaborative Research Center) 1060 - project number 211504053. He also acknowledges funding of his current position by the Austrian Science Fund (FWF) grant F65, and by the European Research Council (ERC, grant No. 716117, awarded to Prof. Dr. Jan Maas). K.S. gratefully acknowledges funding by: the JSPS Overseas Research Fellowships, Grant Nr. 290142; World Premier International Research Center Initiative (WPI), MEXT, Japan; and JSPS Grant-in-Aid for Scientific Research on Innovative Areas “Discrete Geometric Analysis for Materials Design”, Grant Number 17H06465.","day":"15","date_updated":"2025-04-14T07:27:45Z","title":"Rademacher-type theorems and Sobolev-to-Lipschitz properties for strongly local Dirichlet spaces","author":[{"id":"ECEBF480-9E4F-11EA-B557-B0823DDC885E","full_name":"Dello Schiavo, Lorenzo","orcid":"0000-0002-9881-6870","last_name":"Dello Schiavo","first_name":"Lorenzo"},{"first_name":"Kohei","last_name":"Suzuki","full_name":"Suzuki, Kohei"}]},{"type":"journal_article","oa":1,"page":"1511-1514","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2021-10-01T00:00:00Z","publication_status":"published","article_processing_charge":"No","year":"2021","language":[{"iso":"eng"}],"intvolume":"        68","date_created":"2021-10-03T22:01:22Z","alternative_title":["Early Career"],"publisher":"American Mathematical Society","publication":"Notices of the American Mathematical Society","ddc":["500"],"month":"10","status":"public","issue":"9","day":"01","article_type":"letter_note","publication_identifier":{"issn":["0002-9920"],"eissn":["1088-9477"]},"title":"How to tutorial-a-thon","date_updated":"2026-06-18T08:36:13Z","author":[{"full_name":"Adams, Henry","first_name":"Henry","last_name":"Adams"},{"orcid":"0000-0001-7841-0091","last_name":"Kourimska","first_name":"Hana","id":"D9B8E14C-3C26-11EA-98F5-1F833DDC885E","full_name":"Kourimska, Hana"},{"full_name":"Heiss, Teresa","id":"4879BB4E-F248-11E8-B48F-1D18A9856A87","last_name":"Heiss","orcid":"0000-0002-1780-2689","first_name":"Teresa"},{"full_name":"Percival, Sarah","last_name":"Percival","first_name":"Sarah"},{"full_name":"Ziegelmeier, Lori","first_name":"Lori","last_name":"Ziegelmeier"}],"citation":{"mla":"Adams, Henry, et al. “How to Tutorial-a-Thon.” <i>Notices of the American Mathematical Society</i>, vol. 68, no. 9, American Mathematical Society, 2021, pp. 1511–14, doi:<a href=\"https://doi.org/10.1090/noti2349\">10.1090/noti2349</a>.","ieee":"H. Adams, H. Kourimska, T. Heiss, S. Percival, and L. Ziegelmeier, “How to tutorial-a-thon,” <i>Notices of the American Mathematical Society</i>, vol. 68, no. 9. American Mathematical Society, pp. 1511–1514, 2021.","ama":"Adams H, Kourimska H, Heiss T, Percival S, Ziegelmeier L. How to tutorial-a-thon. <i>Notices of the American Mathematical Society</i>. 2021;68(9):1511-1514. doi:<a href=\"https://doi.org/10.1090/noti2349\">10.1090/noti2349</a>","apa":"Adams, H., Kourimska, H., Heiss, T., Percival, S., &#38; Ziegelmeier, L. (2021). How to tutorial-a-thon. <i>Notices of the American Mathematical Society</i>. American Mathematical Society. <a href=\"https://doi.org/10.1090/noti2349\">https://doi.org/10.1090/noti2349</a>","ista":"Adams H, Kourimska H, Heiss T, Percival S, Ziegelmeier L. 2021. How to tutorial-a-thon. Notices of the American Mathematical Society. 68(9), 1511–1514.","chicago":"Adams, Henry, Hana Kourimska, Teresa Heiss, Sarah Percival, and Lori Ziegelmeier. “How to Tutorial-a-Thon.” <i>Notices of the American Mathematical Society</i>. American Mathematical Society, 2021. <a href=\"https://doi.org/10.1090/noti2349\">https://doi.org/10.1090/noti2349</a>.","short":"H. Adams, H. Kourimska, T. Heiss, S. Percival, L. Ziegelmeier, Notices of the American Mathematical Society 68 (2021) 1511–1514."},"doi":"10.1090/noti2349","department":[{"_id":"HeEd"}],"scopus_import":"1","volume":68,"_id":"10071","oa_version":"Published Version","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"http://www.ams.org/notices/"}]},{"title":"A new notion of commutativity for the algorithmic Lovász Local Lemma","date_updated":"2026-02-10T09:59:59Z","author":[{"first_name":"David G.","last_name":"Harris","full_name":"Harris, David G."},{"last_name":"Iliopoulos","first_name":"Fotis","full_name":"Iliopoulos, Fotis"},{"first_name":"Vladimir","last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"}],"conference":{"location":"Virtual","name":"APPROX/RANDOM: Approximation Algorithms for Combinatorial Optimization Problems/ Randomization and Computation","start_date":"2021-08-16","end_date":"2021-08-18"},"external_id":{"arxiv":["2008.05569"]},"day":"15","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-9597-7207-5"]},"acknowledgement":"Fotis Iliopoulos: This material is based upon work directly supported by the IAS Fund for Math and indirectly supported by the National Science Foundation Grant No. CCF-1900460. Any opinions, findings and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation. This work is also supported by the National Science Foundation Grant No. CCF-1815328.\r\nVladimir Kolmogorov: Supported by the European Research Council under the European Unions Seventh Framework Programme (FP7/2007-2013)/ERC grant agreement no 616160.","file_date_updated":"2021-10-06T13:51:54Z","related_material":{"record":[{"id":"21143","relation":"later_version","status":"public"}]},"arxiv":1,"_id":"10072","quality_controlled":"1","oa_version":"Published Version","project":[{"call_identifier":"FP7","_id":"25FBA906-B435-11E9-9278-68D0E5697425","name":"Discrete Optimization in Computer Vision: Theory and Practice","grant_number":"616160"}],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"citation":{"mla":"Harris, David G., et al. “A New Notion of Commutativity for the Algorithmic Lovász Local Lemma.” <i>Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques</i>, vol. 207, 31, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:<a href=\"https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.31\">10.4230/LIPIcs.APPROX/RANDOM.2021.31</a>.","ieee":"D. G. Harris, F. Iliopoulos, and V. Kolmogorov, “A new notion of commutativity for the algorithmic Lovász Local Lemma,” in <i>Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques</i>, Virtual, 2021, vol. 207.","apa":"Harris, D. G., Iliopoulos, F., &#38; Kolmogorov, V. (2021). A new notion of commutativity for the algorithmic Lovász Local Lemma. In <i>Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques</i> (Vol. 207). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.31\">https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.31</a>","ista":"Harris DG, Iliopoulos F, Kolmogorov V. 2021. A new notion of commutativity for the algorithmic Lovász Local Lemma. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. APPROX/RANDOM: Approximation Algorithms for Combinatorial Optimization Problems/ Randomization and Computation, LIPIcs, vol. 207, 31.","ama":"Harris DG, Iliopoulos F, Kolmogorov V. A new notion of commutativity for the algorithmic Lovász Local Lemma. In: <i>Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques</i>. Vol 207. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:<a href=\"https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.31\">10.4230/LIPIcs.APPROX/RANDOM.2021.31</a>","chicago":"Harris, David G., Fotis Iliopoulos, and Vladimir Kolmogorov. “A New Notion of Commutativity for the Algorithmic Lovász Local Lemma.” In <i>Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques</i>, Vol. 207. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.31\">https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.31</a>.","short":"D.G. Harris, F. Iliopoulos, V. Kolmogorov, in:, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021."},"doi":"10.4230/LIPIcs.APPROX/RANDOM.2021.31","scopus_import":"1","department":[{"_id":"VlKo"}],"volume":207,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_number":"31","date_published":"2021-09-15T00:00:00Z","publication_status":"published","article_processing_charge":"Yes","year":"2021","file":[{"relation":"main_file","date_created":"2021-10-06T13:51:54Z","file_name":"2021_LIPIcs_Harris.pdf","creator":"cchlebak","checksum":"9d2544d53aa5b01565c6891d97a4d765","file_size":804472,"content_type":"application/pdf","access_level":"open_access","success":1,"file_id":"10098","date_updated":"2021-10-06T13:51:54Z"}],"type":"conference","ec_funded":1,"oa":1,"ddc":["000"],"status":"public","month":"09","publication":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","language":[{"iso":"eng"}],"intvolume":"       207","has_accepted_license":"1","abstract":[{"text":"The Lovász Local Lemma (LLL) is a powerful tool in probabilistic combinatorics which can be used to establish the existence of objects that satisfy certain properties. The breakthrough paper of Moser and Tardos and follow-up works revealed that the LLL has intimate connections with a class of stochastic local search algorithms for finding such desirable objects. In particular, it can be seen as a sufficient condition for this type of algorithms to converge fast. Besides conditions for existence of and fast convergence to desirable objects, one may naturally ask further questions regarding properties of these algorithms. For instance, \"are they parallelizable?\", \"how many solutions can they output?\", \"what is the expected \"weight\" of a solution?\", etc. These questions and more have been answered for a class of LLL-inspired algorithms called commutative. In this paper we introduce a new, very natural and more general notion of commutativity (essentially matrix commutativity) which allows us to show a number of new refined properties of LLL-inspired local search algorithms with significantly simpler proofs.","lang":"eng"}],"date_created":"2021-10-03T22:01:22Z","alternative_title":["LIPIcs"],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik"},{"author":[{"full_name":"Chang, Cheng","id":"9E331C2E-9F27-11E9-AE48-5033E6697425","last_name":"Chang","orcid":"0000-0002-9515-4277","first_name":"Cheng"},{"full_name":"Ibáñez, Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87","first_name":"Maria","last_name":"Ibáñez","orcid":"0000-0001-5013-2843"}],"title":"Enhanced thermoelectric performance by surface engineering in SnTe-PbS nanocomposites","date_updated":"2025-04-14T09:29:32Z","day":"19","article_type":"original","acknowledgement":"The authors thank the EMF facility in IST Austria for providing SEM and EDX measurements.\r\n","publication_identifier":{"eissn":["1996-1944"]},"file_date_updated":"2021-10-14T11:56:39Z","external_id":{"pmid":["34576640"],"isi":["000700689400001"]},"_id":"10073","oa_version":"Published Version","quality_controlled":"1","department":[{"_id":"MaIb"}],"scopus_import":"1","volume":14,"project":[{"name":"Bottom-up Engineering for Thermoelectric Applications","grant_number":"M02889","_id":"9B8804FC-BA93-11EA-9121-9846C619BF3A"}],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"doi":"10.3390/ma14185416","citation":{"mla":"Chang, Cheng, and Maria Ibáñez. “Enhanced Thermoelectric Performance by Surface Engineering in SnTe-PbS Nanocomposites.” <i>Materials</i>, vol. 14, no. 18, 5416, MDPI, 2021, doi:<a href=\"https://doi.org/10.3390/ma14185416\">10.3390/ma14185416</a>.","ieee":"C. Chang and M. Ibáñez, “Enhanced thermoelectric performance by surface engineering in SnTe-PbS nanocomposites,” <i>Materials</i>, vol. 14, no. 18. MDPI, 2021.","ama":"Chang C, Ibáñez M. Enhanced thermoelectric performance by surface engineering in SnTe-PbS nanocomposites. <i>Materials</i>. 2021;14(18). doi:<a href=\"https://doi.org/10.3390/ma14185416\">10.3390/ma14185416</a>","apa":"Chang, C., &#38; Ibáñez, M. (2021). Enhanced thermoelectric performance by surface engineering in SnTe-PbS nanocomposites. <i>Materials</i>. MDPI. <a href=\"https://doi.org/10.3390/ma14185416\">https://doi.org/10.3390/ma14185416</a>","ista":"Chang C, Ibáñez M. 2021. Enhanced thermoelectric performance by surface engineering in SnTe-PbS nanocomposites. Materials. 14(18), 5416.","chicago":"Chang, Cheng, and Maria Ibáñez. “Enhanced Thermoelectric Performance by Surface Engineering in SnTe-PbS Nanocomposites.” <i>Materials</i>. MDPI, 2021. <a href=\"https://doi.org/10.3390/ma14185416\">https://doi.org/10.3390/ma14185416</a>.","short":"C. Chang, M. Ibáñez, Materials 14 (2021)."},"publication_status":"published","year":"2021","article_processing_charge":"Yes","file":[{"success":1,"file_id":"10140","date_updated":"2021-10-14T11:56:39Z","checksum":"4929dfc673a3ae77c010b6174279cc1d","file_name":"2021_Materials_Chang.pdf","creator":"cchlebak","relation":"main_file","date_created":"2021-10-14T11:56:39Z","content_type":"application/pdf","access_level":"open_access","file_size":4404141}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","article_number":"5416","date_published":"2021-09-19T00:00:00Z","type":"journal_article","isi":1,"oa":1,"issue":"18","publication":"Materials","month":"09","status":"public","corr_author":"1","ddc":["540"],"acknowledged_ssus":[{"_id":"EM-Fac"}],"date_created":"2021-10-03T22:01:23Z","pmid":1,"abstract":[{"lang":"eng","text":"Thermoelectric materials enable the direct conversion between heat and electricity. SnTe is a promising candidate due to its high charge transport performance. Here, we prepared SnTe nanocomposites by employing an aqueous method to synthetize SnTe nanoparticles (NP), followed by a unique surface treatment prior NP consolidation. This synthetic approach allowed optimizing the charge and phonon transport synergistically. The novelty of this strategy was the use of a soluble PbS molecular complex prepared using a thiol-amine solvent mixture that upon blending is adsorbed on the SnTe NP surface. Upon consolidation with spark plasma sintering, SnTe-PbS nanocomposite is formed. The presence of PbS complexes significantly compensates for the Sn vacancy and increases the average grain size of the nanocomposite, thus improving the carrier mobility. Moreover, lattice thermal conductivity is also reduced by the Pb and S-induced mass and strain fluctuation. As a result, an enhanced ZT of ca. 0.8 is reached at 873 K. Our finding provides a novel strategy to conduct rational surface treatment on NP-based thermoelectrics."}],"has_accepted_license":"1","publisher":"MDPI","language":[{"iso":"eng"}],"intvolume":"        14"},{"conference":{"end_date":"2021-08-27","start_date":"2021-08-23","location":"Tallinn, Estonia","name":"MFCS: Mathematical Foundations of Computer Science"},"external_id":{"arxiv":["2105.02611"]},"day":"18","file_date_updated":"2021-10-06T12:44:05Z","publication_identifier":{"isbn":["978-3-9597-7201-3"],"issn":["1868-8969"]},"acknowledgement":"Ismaël Jecker: Funded by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 754411. Karoliina Lehtinen: Funded by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 892704.","arxiv":1,"title":"A bit of nondeterminism makes pushdown automata expressive and succinct","date_updated":"2025-05-14T10:54:50Z","author":[{"full_name":"Guha, Shibashis","last_name":"Guha","first_name":"Shibashis"},{"full_name":"Jecker, Ismael R","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","first_name":"Ismael R","last_name":"Jecker"},{"last_name":"Lehtinen","first_name":"Karoliina","full_name":"Lehtinen, Karoliina"},{"last_name":"Zimmermann","first_name":"Martin","full_name":"Zimmermann, Martin"}],"project":[{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"citation":{"ieee":"S. Guha, I. R. Jecker, K. Lehtinen, and M. Zimmermann, “A bit of nondeterminism makes pushdown automata expressive and succinct,” in <i>46th International Symposium on Mathematical Foundations of Computer Science</i>, Tallinn, Estonia, 2021, vol. 202.","mla":"Guha, Shibashis, et al. “A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct.” <i>46th International Symposium on Mathematical Foundations of Computer Science</i>, vol. 202, 53, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2021.53\">10.4230/LIPIcs.MFCS.2021.53</a>.","ista":"Guha S, Jecker IR, Lehtinen K, Zimmermann M. 2021. A bit of nondeterminism makes pushdown automata expressive and succinct. 46th International Symposium on Mathematical Foundations of Computer Science. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 202, 53.","ama":"Guha S, Jecker IR, Lehtinen K, Zimmermann M. A bit of nondeterminism makes pushdown automata expressive and succinct. In: <i>46th International Symposium on Mathematical Foundations of Computer Science</i>. Vol 202. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2021.53\">10.4230/LIPIcs.MFCS.2021.53</a>","apa":"Guha, S., Jecker, I. R., Lehtinen, K., &#38; Zimmermann, M. (2021). A bit of nondeterminism makes pushdown automata expressive and succinct. In <i>46th International Symposium on Mathematical Foundations of Computer Science</i> (Vol. 202). Tallinn, Estonia: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2021.53\">https://doi.org/10.4230/LIPIcs.MFCS.2021.53</a>","chicago":"Guha, Shibashis, Ismael R Jecker, Karoliina Lehtinen, and Martin Zimmermann. “A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct.” In <i>46th International Symposium on Mathematical Foundations of Computer Science</i>, Vol. 202. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2021.53\">https://doi.org/10.4230/LIPIcs.MFCS.2021.53</a>.","short":"S. Guha, I.R. Jecker, K. Lehtinen, M. Zimmermann, in:, 46th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021."},"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"doi":"10.4230/LIPIcs.MFCS.2021.53","scopus_import":"1","department":[{"_id":"KrCh"}],"volume":202,"_id":"10075","oa_version":"Published Version","quality_controlled":"1","ec_funded":1,"type":"conference","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_number":"53","date_published":"2021-08-18T00:00:00Z","publication_status":"published","year":"2021","article_processing_charge":"No","file":[{"date_updated":"2021-10-06T12:44:05Z","file_id":"10097","success":1,"content_type":"application/pdf","access_level":"open_access","file_size":825567,"checksum":"f4d407d43a97330c3fb11e6a7a6fbfb2","file_name":"2021_LIPIcs_Guha.pdf","creator":"cchlebak","relation":"main_file","date_created":"2021-10-06T12:44:05Z"}],"language":[{"iso":"eng"}],"intvolume":"       202","has_accepted_license":"1","abstract":[{"text":"We study the expressiveness and succinctness of good-for-games pushdown automata (GFG-PDA) over finite words, that is, pushdown automata whose nondeterminism can be resolved based on the run constructed so far, but independently of the remainder of the input word. We prove that GFG-PDA recognise more languages than deterministic PDA (DPDA) but not all context-free languages (CFL). This class is orthogonal to unambiguous CFL. We further show that GFG-PDA can be exponentially more succinct than DPDA, while PDA can be double-exponentially more succinct than GFG-PDA. We also study GFGness in visibly pushdown automata (VPA), which enjoy better closure properties than PDA, and for which we show GFGness to be ExpTime-complete. GFG-VPA can be exponentially more succinct than deterministic VPA, while VPA can be exponentially more succinct than GFG-VPA. Both of these lower bounds are tight. Finally, we study the complexity of resolving nondeterminism in GFG-PDA. Every GFG-PDA has a positional resolver, a function that resolves nondeterminism and that is only dependant on the current configuration. Pushdown transducers are sufficient to implement the resolvers of GFG-VPA, but not those of GFG-PDA. GFG-PDA with finite-state resolvers are determinisable.","lang":"eng"}],"date_created":"2021-10-03T22:01:23Z","alternative_title":["LIPIcs"],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","status":"public","month":"08","publication":"46th International Symposium on Mathematical Foundations of Computer Science","ddc":["000"]},{"external_id":{"isi":["000713005000034"]},"conference":{"end_date":"2021-03-05","start_date":"2021-03-01","location":"Virtual","name":"FC: Financial Cryptography and Data Security"},"acknowledgement":"The authors would like to thank all anonymous reviewers of FC21 WTSC workshop for comments and suggestions that greatly improved the quality of this paper.","publication_identifier":{"eissn":["1611-3349"],"isbn":["978-3-6626-3957-3"],"eisbn":["978-3-662-63958-0"],"issn":["0302-9743"]},"day":"17","date_updated":"2025-07-10T11:49:40Z","title":"Reactive key-loss protection in blockchains","author":[{"last_name":"Blackshear","first_name":"Sam","full_name":"Blackshear, Sam"},{"first_name":"Konstantinos","last_name":"Chalkias","full_name":"Chalkias, Konstantinos"},{"full_name":"Chatzigiannis, Panagiotis","first_name":"Panagiotis","last_name":"Chatzigiannis"},{"last_name":"Faizullabhoy","first_name":"Riyaz","full_name":"Faizullabhoy, Riyaz"},{"full_name":"Khaburzaniya, Irakliy","first_name":"Irakliy","last_name":"Khaburzaniya"},{"last_name":"Kokoris Kogias","first_name":"Eleftherios","full_name":"Kokoris Kogias, Eleftherios","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30"},{"last_name":"Lind","first_name":"Joshua","full_name":"Lind, Joshua"},{"full_name":"Wong, David","last_name":"Wong","first_name":"David"},{"full_name":"Zakian, Tim","first_name":"Tim","last_name":"Zakian"}],"doi":"10.1007/978-3-662-63958-0_34","citation":{"chicago":"Blackshear, Sam, Konstantinos Chalkias, Panagiotis Chatzigiannis, Riyaz Faizullabhoy, Irakliy Khaburzaniya, Eleftherios Kokoris Kogias, Joshua Lind, David Wong, and Tim Zakian. “Reactive Key-Loss Protection in Blockchains.” In <i>FC 2021 Workshops</i>, 12676:431–50. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-662-63958-0_34\">https://doi.org/10.1007/978-3-662-63958-0_34</a>.","short":"S. Blackshear, K. Chalkias, P. Chatzigiannis, R. Faizullabhoy, I. Khaburzaniya, E. Kokoris Kogias, J. Lind, D. Wong, T. Zakian, in:, FC 2021 Workshops, Springer Nature, 2021, pp. 431–450.","ieee":"S. Blackshear <i>et al.</i>, “Reactive key-loss protection in blockchains,” in <i>FC 2021 Workshops</i>, Virtual, 2021, vol. 12676, pp. 431–450.","mla":"Blackshear, Sam, et al. “Reactive Key-Loss Protection in Blockchains.” <i>FC 2021 Workshops</i>, vol. 12676, Springer Nature, 2021, pp. 431–50, doi:<a href=\"https://doi.org/10.1007/978-3-662-63958-0_34\">10.1007/978-3-662-63958-0_34</a>.","apa":"Blackshear, S., Chalkias, K., Chatzigiannis, P., Faizullabhoy, R., Khaburzaniya, I., Kokoris Kogias, E., … Zakian, T. (2021). Reactive key-loss protection in blockchains. In <i>FC 2021 Workshops</i> (Vol. 12676, pp. 431–450). Virtual: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-662-63958-0_34\">https://doi.org/10.1007/978-3-662-63958-0_34</a>","ama":"Blackshear S, Chalkias K, Chatzigiannis P, et al. Reactive key-loss protection in blockchains. In: <i>FC 2021 Workshops</i>. Vol 12676. Springer Nature; 2021:431-450. doi:<a href=\"https://doi.org/10.1007/978-3-662-63958-0_34\">10.1007/978-3-662-63958-0_34</a>","ista":"Blackshear S, Chalkias K, Chatzigiannis P, Faizullabhoy R, Khaburzaniya I, Kokoris Kogias E, Lind J, Wong D, Zakian T. 2021. Reactive key-loss protection in blockchains. FC 2021 Workshops. FC: Financial Cryptography and Data Security, LNCS, vol. 12676, 431–450."},"volume":"12676 ","scopus_import":"1","department":[{"_id":"ElKo"}],"main_file_link":[{"url":"https://research.fb.com/publications/reactive-key-loss-protection-in-blockchains/","open_access":"1"}],"oa_version":"Preprint","quality_controlled":"1","_id":"10076","oa":1,"isi":1,"type":"conference","page":"431-450","date_published":"2021-09-17T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2021","article_processing_charge":"No","publication_status":"published","language":[{"iso":"eng"}],"publisher":"Springer Nature","alternative_title":["LNCS"],"date_created":"2021-10-03T22:01:24Z","abstract":[{"text":"We present a novel approach for blockchain asset owners to reclaim their funds in case of accidental private-key loss or transfer to a mistyped address. Our solution can be deployed upon failure or absence of proactively implemented backup mechanisms, such as secret sharing and cold storage. The main advantages against previous proposals is it does not require any prior action from users and works with both single-key and multi-sig accounts. We achieve this by a 3-phase   Commit()→Reveal()→Claim()−or−Challenge()  smart contract that enables accessing funds of addresses for which the spending key is not available. We provide an analysis of the threat and incentive models and formalize the concept of reactive KEy-Loss Protection (KELP).","lang":"eng"}],"month":"09","status":"public","publication":"FC 2021 Workshops"},{"acknowledgement":"We thank Volker M. Vogt for his critical comments in preparation of the review.","publication_identifier":{"issn":["1999-4915"]},"article_type":"original","file_date_updated":"2021-10-08T10:38:15Z","day":"17","external_id":{"isi":["000699841100001"],"pmid":["34578434"]},"author":[{"full_name":"Obr, Martin","id":"4741CA5A-F248-11E8-B48F-1D18A9856A87","last_name":"Obr","orcid":"0000-0003-1756-6564","first_name":"Martin"},{"id":"48AD8942-F248-11E8-B48F-1D18A9856A87","full_name":"Schur, Florian KM","first_name":"Florian KM","orcid":"0000-0003-4790-8078","last_name":"Schur"},{"full_name":"Dick, Robert A.","first_name":"Robert A.","last_name":"Dick"}],"date_updated":"2025-04-15T08:24:49Z","title":"A structural perspective of the role of IP6 in immature and mature retroviral assembly","volume":13,"scopus_import":"1","department":[{"_id":"FlSc"}],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"doi":"10.3390/v13091853","citation":{"chicago":"Obr, Martin, Florian KM Schur, and Robert A. Dick. “A Structural Perspective of the Role of IP6 in Immature and Mature Retroviral Assembly.” <i>Viruses</i>. MDPI, 2021. <a href=\"https://doi.org/10.3390/v13091853\">https://doi.org/10.3390/v13091853</a>.","short":"M. Obr, F.K. Schur, R.A. Dick, Viruses 13 (2021).","ieee":"M. Obr, F. K. Schur, and R. A. Dick, “A structural perspective of the role of IP6 in immature and mature retroviral assembly,” <i>Viruses</i>, vol. 13, no. 9. MDPI, 2021.","mla":"Obr, Martin, et al. “A Structural Perspective of the Role of IP6 in Immature and Mature Retroviral Assembly.” <i>Viruses</i>, vol. 13, no. 9, 1853, MDPI, 2021, doi:<a href=\"https://doi.org/10.3390/v13091853\">10.3390/v13091853</a>.","apa":"Obr, M., Schur, F. K., &#38; Dick, R. A. (2021). A structural perspective of the role of IP6 in immature and mature retroviral assembly. <i>Viruses</i>. MDPI. <a href=\"https://doi.org/10.3390/v13091853\">https://doi.org/10.3390/v13091853</a>","ista":"Obr M, Schur FK, Dick RA. 2021. A structural perspective of the role of IP6 in immature and mature retroviral assembly. Viruses. 13(9), 1853.","ama":"Obr M, Schur FK, Dick RA. A structural perspective of the role of IP6 in immature and mature retroviral assembly. <i>Viruses</i>. 2021;13(9). doi:<a href=\"https://doi.org/10.3390/v13091853\">10.3390/v13091853</a>"},"project":[{"_id":"26736D6A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P31445","name":"Structural conservation and diversity in retroviral capsid"}],"quality_controlled":"1","oa_version":"Published Version","_id":"10103","oa":1,"isi":1,"type":"journal_article","file":[{"file_size":4146796,"content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2021-10-08T10:38:15Z","creator":"cchlebak","file_name":"2021_Viruses_Obr.pdf","checksum":"bcfd72a12977d48e22df3d0cc55aacf1","date_updated":"2021-10-08T10:38:15Z","success":1,"file_id":"10115"}],"article_processing_charge":"Yes","year":"2021","keyword":["virology","infectious diseases"],"publication_status":"published","date_published":"2021-09-17T00:00:00Z","article_number":"1853","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publisher":"MDPI","has_accepted_license":"1","pmid":1,"date_created":"2021-10-07T09:13:29Z","abstract":[{"text":"The small cellular molecule inositol hexakisphosphate (IP6) has been known for ~20 years to promote the in vitro assembly of HIV-1 into immature virus-like particles. However, the molecular details underlying this effect have been determined only recently, with the identification of the IP6 binding site in the immature Gag lattice. IP6 also promotes formation of the mature capsid protein (CA) lattice via a second IP6 binding site, and enhances core stability, creating a favorable environment for reverse transcription. IP6 also enhances assembly of other retroviruses, from both the Lentivirus and the Alpharetrovirus genera. These findings suggest that IP6 may have a conserved function throughout the family Retroviridae. Here, we discuss the different steps in the viral life cycle that are influenced by IP6, and describe in detail how IP6 interacts with the immature and mature lattices of different retroviruses.","lang":"eng"}],"intvolume":"        13","language":[{"iso":"eng"}],"issue":"9","ddc":["616"],"status":"public","month":"09","corr_author":"1","publication":"Viruses"},{"file_date_updated":"2021-10-07T23:32:18Z","acknowledgement":"The authors would like to thank Borzoo Bonakdarpour, Derek Dreyer, Adrian Francalanza, Owolabi Legunsen, Mae Milano, Manuel Rigger, Cesar Sanchez, and the members of the IST Verification Seminar for their helpful comments and insights on various stages of this work, as well as the reviewers of RV’21 for their helpful suggestions on the actual paper.","related_material":{"record":[{"relation":"extended_version","id":"9946","status":"public"}]},"publication_identifier":{"issn":["0302-9743"],"isbn":["978-3-030-88493-2"],"eisbn":["978-3-030-88494-9"],"eissn":["1611-3349"]},"day":"06","external_id":{"isi":["000719383800012"]},"conference":{"end_date":"2021-10-14","start_date":"2021-10-11","name":"RV: Runtime Verification","location":"Virtual"},"author":[{"first_name":"Fabian","last_name":"Mühlböck","orcid":"0000-0003-1548-0177","full_name":"Mühlböck, Fabian","id":"6395C5F6-89DF-11E9-9C97-6BDFE5697425"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000-0002-2985-7724"}],"date_updated":"2025-04-15T06:26:12Z","title":"Differential monitoring","volume":12974,"scopus_import":"1","department":[{"_id":"ToHe"}],"citation":{"ieee":"F. Mühlböck and T. A. Henzinger, “Differential monitoring,” in <i>International Conference on Runtime Verification</i>, Virtual, 2021, vol. 12974, pp. 231–243.","mla":"Mühlböck, Fabian, and Thomas A. Henzinger. “Differential Monitoring.” <i>International Conference on Runtime Verification</i>, vol. 12974, Springer Nature, 2021, pp. 231–43, doi:<a href=\"https://doi.org/10.1007/978-3-030-88494-9_12\">10.1007/978-3-030-88494-9_12</a>.","apa":"Mühlböck, F., &#38; Henzinger, T. A. (2021). Differential monitoring. In <i>International Conference on Runtime Verification</i> (Vol. 12974, pp. 231–243). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-88494-9_12\">https://doi.org/10.1007/978-3-030-88494-9_12</a>","ama":"Mühlböck F, Henzinger TA. Differential monitoring. In: <i>International Conference on Runtime Verification</i>. Vol 12974. Cham: Springer Nature; 2021:231-243. doi:<a href=\"https://doi.org/10.1007/978-3-030-88494-9_12\">10.1007/978-3-030-88494-9_12</a>","ista":"Mühlböck F, Henzinger TA. 2021. Differential monitoring. International Conference on Runtime Verification. RV: Runtime Verification, LNCS, vol. 12974, 231–243.","chicago":"Mühlböck, Fabian, and Thomas A Henzinger. “Differential Monitoring.” In <i>International Conference on Runtime Verification</i>, 12974:231–43. Cham: Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-88494-9_12\">https://doi.org/10.1007/978-3-030-88494-9_12</a>.","short":"F. Mühlböck, T.A. Henzinger, in:, International Conference on Runtime Verification, Springer Nature, Cham, 2021, pp. 231–243."},"doi":"10.1007/978-3-030-88494-9_12","project":[{"grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"oa_version":"Preprint","quality_controlled":"1","_id":"10108","page":"231-243","oa":1,"isi":1,"type":"conference","file":[{"file_name":"differentialmonitoring-cameraready-openaccess.pdf","creator":"fmuehlbo","checksum":"554c7fdb259eda703a8b6328a6dad55a","date_created":"2021-10-07T23:32:18Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_size":350632,"file_id":"10109","success":1,"date_updated":"2021-10-07T23:32:18Z"}],"article_processing_charge":"No","keyword":["run-time verification","software engineering","implicit specification"],"year":"2021","publication_status":"published","date_published":"2021-10-06T00:00:00Z","place":"Cham","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publisher":"Springer Nature","alternative_title":["LNCS"],"has_accepted_license":"1","date_created":"2021-10-07T23:30:10Z","abstract":[{"lang":"eng","text":"We argue that the time is ripe to investigate differential monitoring, in which the specification of a program's behavior is implicitly given by a second program implementing the same informal specification. Similar ideas have been proposed before, and are currently implemented in restricted form for testing and specialized run-time analyses, aspects of which we combine. We discuss the challenges of implementing differential monitoring as a general-purpose, black-box run-time monitoring framework, and present promising results of a preliminary implementation, showing low monitoring overheads for diverse programs."}],"intvolume":"     12974","language":[{"iso":"eng"}],"ddc":["005"],"corr_author":"1","month":"10","status":"public","publication":"International Conference on Runtime Verification"},{"has_accepted_license":"1","date_created":"2021-10-10T22:01:22Z","pmid":1,"abstract":[{"lang":"eng","text":"The ubiquitous Ca2+ sensor calmodulin (CaM) binds and regulates many proteins, including ion channels, CaM kinases, and calcineurin, according to Ca2+-CaM levels. What regulates neuronal CaM levels, is, however, unclear. CaM-binding transcription activators (CAMTAs) are ancient proteins expressed broadly in nervous systems and whose loss confers pleiotropic behavioral defects in flies, mice, and humans. Using Caenorhabditis elegans and Drosophila, we show that CAMTAs control neuronal CaM levels. The behavioral and neuronal Ca2+ signaling defects in mutants lacking camt-1, the sole C. elegans CAMTA, can be rescued by supplementing neuronal CaM. CAMT-1 binds multiple sites in the CaM promoter and deleting these sites phenocopies camt-1. Our data suggest CAMTAs mediate a conserved and general mechanism that controls neuronal CaM levels, thereby regulating Ca2+ signaling, physiology, and behavior."}],"publisher":"eLife Sciences Publications","language":[{"iso":"eng"}],"intvolume":"        10","month":"09","publication":"eLife","ddc":["610"],"status":"public","ec_funded":1,"type":"journal_article","isi":1,"oa":1,"publication_status":"published","article_processing_charge":"No","year":"2021","file":[{"relation":"main_file","date_created":"2021-10-11T14:15:07Z","file_name":"2021_eLife_VuongBrender.pdf","creator":"cchlebak","checksum":"b465e172d2b1f57aa26a2571a085d052","file_size":1774624,"content_type":"application/pdf","access_level":"open_access","success":1,"file_id":"10122","date_updated":"2021-10-11T14:15:07Z"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","article_number":"e68238","date_published":"2021-09-17T00:00:00Z","scopus_import":"1","department":[{"_id":"MaDe"}],"volume":10,"project":[{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"citation":{"ista":"Vuong-Brender T, Flynn S, Vallis Y, de Bono M. 2021. Neuronal calmodulin levels are controlled by CAMTA transcription factors. eLife. 10, e68238.","apa":"Vuong-Brender, T., Flynn, S., Vallis, Y., &#38; de Bono, M. (2021). Neuronal calmodulin levels are controlled by CAMTA transcription factors. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/eLife.68238\">https://doi.org/10.7554/eLife.68238</a>","ama":"Vuong-Brender T, Flynn S, Vallis Y, de Bono M. Neuronal calmodulin levels are controlled by CAMTA transcription factors. <i>eLife</i>. 2021;10. doi:<a href=\"https://doi.org/10.7554/eLife.68238\">10.7554/eLife.68238</a>","ieee":"T. Vuong-Brender, S. Flynn, Y. Vallis, and M. de Bono, “Neuronal calmodulin levels are controlled by CAMTA transcription factors,” <i>eLife</i>, vol. 10. eLife Sciences Publications, 2021.","mla":"Vuong-Brender, Thanh, et al. “Neuronal Calmodulin Levels Are Controlled by CAMTA Transcription Factors.” <i>ELife</i>, vol. 10, e68238, eLife Sciences Publications, 2021, doi:<a href=\"https://doi.org/10.7554/eLife.68238\">10.7554/eLife.68238</a>.","short":"T. Vuong-Brender, S. Flynn, Y. Vallis, M. de Bono, ELife 10 (2021).","chicago":"Vuong-Brender, Thanh, Sean Flynn, Yvonne Vallis, and Mario de Bono. “Neuronal Calmodulin Levels Are Controlled by CAMTA Transcription Factors.” <i>ELife</i>. eLife Sciences Publications, 2021. <a href=\"https://doi.org/10.7554/eLife.68238\">https://doi.org/10.7554/eLife.68238</a>."},"doi":"10.7554/eLife.68238","_id":"10116","oa_version":"Published Version","quality_controlled":"1","day":"17","publication_identifier":{"eissn":["2050-084X"]},"file_date_updated":"2021-10-11T14:15:07Z","acknowledgement":"The authors thank the MRC-LMB Flow Cytometry facility and Imaging Service for support, the Cancer Research UK Cambridge Institute Genomics Core for Next Generation Sequencing, Julie Ahringer and Alex Appert for advice and technical help for ChIP-seq experiments, Paula Freire-Pritchett, Tim Stevens, and Gurpreet Ghattaoraya for RNA-seq and ChIP-seq analyses, Nikos Chronis for the TN-XL plasmid, Hong-Sheng Li and Daisuke Yamamoto for generously sending the tes2 and cro mutants, Daria Siekhaus for hosting the fly work, Michaela Misova for technical assistance. The authors are very grateful to Salihah Ece Sönmez for teaching us how to dissect, mount and stain Drosophila retinae. This work was supported by an Advanced ERC grant (269058 ACMO) and a Wellcome Investigator Award (209504/Z/17/Z) to MdB, and an IST Plus Fellowship to TV-B (Marie Sklodowska-Curie Agreement no 754411).","article_type":"original","external_id":{"pmid":["34499028"],"isi":["000695716100001"]},"author":[{"last_name":"Vuong-Brender","first_name":"Thanh","full_name":"Vuong-Brender, Thanh","id":"D389312E-10C4-11EA-ABF4-A4B43DDC885E"},{"first_name":"Sean","last_name":"Flynn","full_name":"Flynn, Sean"},{"full_name":"Vallis, Yvonne","id":"05A2795C-31B5-11EA-83A7-7DA23DDC885E","last_name":"Vallis","first_name":"Yvonne"},{"full_name":"De Bono, Mario","id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87","last_name":"De Bono","orcid":"0000-0001-8347-0443","first_name":"Mario"}],"title":"Neuronal calmodulin levels are controlled by CAMTA transcription factors","date_updated":"2025-04-14T07:43:46Z"},{"issue":"3","publication":"Journal of Biological Chemistry","status":"public","ddc":["612"],"month":"09","publisher":"Elsevier","abstract":[{"lang":"eng","text":"Proximity labeling provides a powerful in vivo tool to characterize the proteome of subcellular structures and the interactome of specific proteins. The nematode Caenorhabditis elegans is one of the most intensely studied organisms in biology, offering many advantages for biochemistry. Using the highly active biotin ligase TurboID, we optimize here a proximity labeling protocol for C. elegans. An advantage of TurboID is that biotin's high affinity for streptavidin means biotin-labeled proteins can be affinity-purified under harsh denaturing conditions. By combining extensive sonication with aggressive denaturation using SDS and urea, we achieved near-complete solubilization of worm proteins. We then used this protocol to characterize the proteomes of the worm gut, muscle, skin, and nervous system. Neurons are among the smallest C. elegans cells. To probe the method's sensitivity, we expressed TurboID exclusively in the two AFD neurons and showed that the protocol could identify known and previously unknown proteins expressed selectively in AFD. The active zones of synapses are composed of a protein matrix that is difficult to solubilize and purify. To test if our protocol could solubilize active zone proteins, we knocked TurboID into the endogenous elks-1 gene, which encodes a presynaptic active zone protein. We identified many known ELKS-1-interacting active zone proteins, as well as previously uncharacterized synaptic proteins. Versatile vectors and the inherent advantages of using C. elegans, including fast growth and the ability to rapidly make and functionally test knock-ins, make proximity labeling a valuable addition to the armory of this model organism."}],"has_accepted_license":"1","date_created":"2021-10-10T22:01:23Z","intvolume":"       297","language":[{"iso":"eng"}],"file":[{"date_updated":"2021-10-11T12:20:58Z","success":1,"file_id":"10121","access_level":"open_access","content_type":"application/pdf","file_size":1680010,"checksum":"19e39d36c5b9387c6dc0e89c9ae856ab","creator":"cchlebak","file_name":"2021_JBC_Artan.pdf","date_created":"2021-10-11T12:20:58Z","relation":"main_file"}],"publication_status":"published","article_processing_charge":"Yes","year":"2021","date_published":"2021-09-01T00:00:00Z","article_number":"101094","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa":1,"type":"journal_article","isi":1,"ec_funded":1,"oa_version":"Published Version","quality_controlled":"1","_id":"10117","volume":297,"scopus_import":"1","department":[{"_id":"MaDe"},{"_id":"LifeSc"}],"doi":"10.1016/J.JBC.2021.101094","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"citation":{"short":"M. Artan, S. Barratt, S.M. Flynn, F. Begum, M. Skehel, A. Nicolas, M. de Bono, Journal of Biological Chemistry 297 (2021).","chicago":"Artan, Murat, Stephen Barratt, Sean M. Flynn, Farida Begum, Mark Skehel, Armel Nicolas, and Mario de Bono. “Interactome Analysis of Caenorhabditis Elegans Synapses by TurboID-Based Proximity Labeling.” <i>Journal of Biological Chemistry</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/J.JBC.2021.101094\">https://doi.org/10.1016/J.JBC.2021.101094</a>.","apa":"Artan, M., Barratt, S., Flynn, S. M., Begum, F., Skehel, M., Nicolas, A., &#38; de Bono, M. (2021). Interactome analysis of Caenorhabditis elegans synapses by TurboID-based proximity labeling. <i>Journal of Biological Chemistry</i>. Elsevier. <a href=\"https://doi.org/10.1016/J.JBC.2021.101094\">https://doi.org/10.1016/J.JBC.2021.101094</a>","ista":"Artan M, Barratt S, Flynn SM, Begum F, Skehel M, Nicolas A, de Bono M. 2021. Interactome analysis of Caenorhabditis elegans synapses by TurboID-based proximity labeling. Journal of Biological Chemistry. 297(3), 101094.","ama":"Artan M, Barratt S, Flynn SM, et al. Interactome analysis of Caenorhabditis elegans synapses by TurboID-based proximity labeling. <i>Journal of Biological Chemistry</i>. 2021;297(3). doi:<a href=\"https://doi.org/10.1016/J.JBC.2021.101094\">10.1016/J.JBC.2021.101094</a>","mla":"Artan, Murat, et al. “Interactome Analysis of Caenorhabditis Elegans Synapses by TurboID-Based Proximity Labeling.” <i>Journal of Biological Chemistry</i>, vol. 297, no. 3, 101094, Elsevier, 2021, doi:<a href=\"https://doi.org/10.1016/J.JBC.2021.101094\">10.1016/J.JBC.2021.101094</a>.","ieee":"M. Artan <i>et al.</i>, “Interactome analysis of Caenorhabditis elegans synapses by TurboID-based proximity labeling,” <i>Journal of Biological Chemistry</i>, vol. 297, no. 3. Elsevier, 2021."},"project":[{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"}],"author":[{"last_name":"Artan","orcid":"0000-0001-8945-6992","first_name":"Murat","full_name":"Artan, Murat","id":"C407B586-6052-11E9-B3AE-7006E6697425"},{"first_name":"Stephen","last_name":"Barratt","full_name":"Barratt, Stephen","id":"57740d2b-2a88-11ec-97cf-d9e6d1b39677"},{"last_name":"Flynn","first_name":"Sean M.","full_name":"Flynn, Sean M."},{"last_name":"Begum","first_name":"Farida","full_name":"Begum, Farida"},{"full_name":"Skehel, Mark","first_name":"Mark","last_name":"Skehel"},{"id":"2A103192-F248-11E8-B48F-1D18A9856A87","full_name":"Nicolas, Armel","last_name":"Nicolas","first_name":"Armel"},{"id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87","full_name":"De Bono, Mario","first_name":"Mario","orcid":"0000-0001-8347-0443","last_name":"De Bono"}],"title":"Interactome analysis of Caenorhabditis elegans synapses by TurboID-based proximity labeling","date_updated":"2025-04-14T07:43:46Z","day":"01","article_type":"original","file_date_updated":"2021-10-11T12:20:58Z","acknowledgement":"We thank de Bono lab members for helpful comments on the manuscript, IST Austria and University of Vienna Mass Spec Facilities for invaluable discussions and comments for the optimization of mass spec analyses of worm samples. The biotin auxotropic E. coli strain MG1655bioB:kan was gift from John Cronan (University of Illinois) and was kindly sent to us by Jessica Feldman and Ariana Sanchez (Stanford University). dg398 pEntryslot2_mNeongreen::3XFLAG::stop and dg397 pEntryslot3_mNeongreen::3XFLAG::stop::unc-54 3′UTR entry vector were kindly shared by Dr Dominique Glauser (University of Fribourg). Codon-optimized mScarlet vector was a generous gift from Dr Manuel Zimmer (University of Vienna).","publication_identifier":{"issn":["0021-9258"],"eissn":["1083-351X"]},"external_id":{"isi":["000706409200006"]}},{"_id":"10124","extern":"1","status":"public","month":"09","oa_version":"Preprint","publication":"ACS Nano","quality_controlled":"1","main_file_link":[{"url":"https://www.biorxiv.org/content/10.1101/2021.04.01.438065","open_access":"1"}],"date_created":"2021-10-12T07:31:21Z","pmid":1,"abstract":[{"text":"The transport of macromolecules and nanoscopic particles to a target cellular site is a crucial aspect in many physiological processes. This directional motion is generally controlled via active mechanical and chemical processes. Here we show, by means of molecular dynamics simulations and an analytical theory, that completely passive nanoparticles can exhibit directional motion when embedded in non-uniform mechanical environments. Specifically, we study the motion of a passive nanoparticle adhering to a mechanically non-uniform elastic membrane. We observe a non-monotonic affinity of the particle to the membrane as a function of the membrane’s rigidity, which results in the particle transport. This transport can be both up or down the rigidity gradient, depending on the absolute values of the rigidities that the gradient spans across. We conclude that rigidity gradients can be used to direct average motion of passive macromolecules and nanoparticles on deformable membranes, resulting in the preferential accumulation of the macromolecules in regions of certain mechanical properties.","lang":"eng"}],"publisher":"American Chemical Society","language":[{"iso":"eng"}],"doi":"10.1021/acsnano.1c02777 ","citation":{"short":"I. Palaia, A. Paraschiv, V. Debets, C. Storm, A. Šarić, ACS Nano (2021).","chicago":"Palaia, Ivan, Alexandru Paraschiv, Vincent Debets, Cornelis Storm, and Anđela Šarić. “Durotaxis of Passive Nanoparticles on Elastic Membranes.” <i>ACS Nano</i>. American Chemical Society, 2021. <a href=\"https://doi.org/10.1021/acsnano.1c02777 \">https://doi.org/10.1021/acsnano.1c02777 </a>.","ama":"Palaia I, Paraschiv A, Debets V, Storm C, Šarić A. Durotaxis of passive nanoparticles on elastic membranes. <i>ACS Nano</i>. 2021. doi:<a href=\"https://doi.org/10.1021/acsnano.1c02777 \">10.1021/acsnano.1c02777 </a>","ista":"Palaia I, Paraschiv A, Debets V, Storm C, Šarić A. 2021. Durotaxis of passive nanoparticles on elastic membranes. ACS Nano.","apa":"Palaia, I., Paraschiv, A., Debets, V., Storm, C., &#38; Šarić, A. (2021). Durotaxis of passive nanoparticles on elastic membranes. <i>ACS Nano</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acsnano.1c02777 \">https://doi.org/10.1021/acsnano.1c02777 </a>","mla":"Palaia, Ivan, et al. “Durotaxis of Passive Nanoparticles on Elastic Membranes.” <i>ACS Nano</i>, American Chemical Society, 2021, doi:<a href=\"https://doi.org/10.1021/acsnano.1c02777 \">10.1021/acsnano.1c02777 </a>.","ieee":"I. Palaia, A. Paraschiv, V. Debets, C. Storm, and A. Šarić, “Durotaxis of passive nanoparticles on elastic membranes,” <i>ACS Nano</i>. American Chemical Society, 2021."},"publication_status":"published","year":"2021","article_processing_charge":"No","author":[{"last_name":"Palaia","first_name":"Ivan","full_name":"Palaia, Ivan"},{"first_name":"Alexandru","last_name":"Paraschiv","full_name":"Paraschiv, Alexandru"},{"last_name":"Debets","first_name":"Vincent","full_name":"Debets, Vincent"},{"last_name":"Storm","first_name":"Cornelis","full_name":"Storm, Cornelis"},{"first_name":"Anđela","orcid":"0000-0002-7854-2139","last_name":"Šarić","id":"bf63d406-f056-11eb-b41d-f263a6566d8b","full_name":"Šarić, Anđela"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","title":"Durotaxis of passive nanoparticles on elastic membranes","date_published":"2021-09-22T00:00:00Z","date_updated":"2021-10-12T09:50:19Z","day":"22","article_type":"original","acknowledgement":"We acknowledge support from the Engineering and Physical Sciences Research Council (A.P. and A.Š.), the Royal Society (A.Š.) and the European Research Council (I.P. and A.Š.).","type":"journal_article","oa":1,"external_id":{"pmid":["34550677 "]}}]