[{"main_file_link":[{"url":"https://eprint.iacr.org/2023/081","open_access":"1"}],"ddc":["000"],"publication":"Proceedings of the 2023 Network and Distributed System Security Symposium","oa_version":"Published Version","status":"public","month":"03","quality_controlled":"1","_id":"14989","publisher":"Internet Society","scopus_import":"1","date_created":"2024-02-14T14:20:40Z","department":[{"_id":"ElKo"}],"abstract":[{"lang":"eng","text":"Encryption alone is not enough for secure end-to end encrypted messaging: a server must also honestly serve public keys to users. Key transparency has been presented as an efficient\r\nsolution for detecting (and hence deterring) a server that attempts to dishonestly serve keys. Key transparency involves two major components: (1) a username to public key mapping, stored and cryptographically committed to by the server, and, (2) an outof-band consistency protocol for serving short commitments to users. In the setting of real-world deployments and supporting production scale, new challenges must be considered for both of these components. We enumerate these challenges and provide solutions to address them. In particular, we design and implement a memory-optimized and privacy-preserving verifiable data structure for committing to the username to public key store.\r\nTo make this implementation viable for production, we also integrate support for persistent and distributed storage. We also propose a future-facing solution, termed “compaction”, as\r\na mechanism for mitigating practical issues that arise from dealing with infinitely growing server data structures. Finally, we implement a consensusless solution that achieves the minimum requirements for a service that consistently distributes commitments for a transparency application, providing a much more efficient protocol for distributing small and consistent\r\ncommitments to users. This culminates in our production-grade implementation of a key transparency system (Parakeet) which we have open-sourced, along with a demonstration of feasibility through our benchmarks."}],"citation":{"chicago":"Malvai, Harjasleen, Eleftherios Kokoris Kogias, Alberto Sonnino, Esha Ghosh, Ercan Oztürk, Kevin Lewi, and Sean Lawlor. “Parakeet: Practical Key Transparency for End-to-End EEncrypted Messaging.” In <i>Proceedings of the 2023 Network and Distributed System Security Symposium</i>. Internet Society, 2023. <a href=\"https://doi.org/10.14722/ndss.2023.24545\">https://doi.org/10.14722/ndss.2023.24545</a>.","short":"H. Malvai, E. Kokoris Kogias, A. Sonnino, E. Ghosh, E. Oztürk, K. Lewi, S. Lawlor, in:, Proceedings of the 2023 Network and Distributed System Security Symposium, Internet Society, 2023.","mla":"Malvai, Harjasleen, et al. “Parakeet: Practical Key Transparency for End-to-End EEncrypted Messaging.” <i>Proceedings of the 2023 Network and Distributed System Security Symposium</i>, Internet Society, 2023, doi:<a href=\"https://doi.org/10.14722/ndss.2023.24545\">10.14722/ndss.2023.24545</a>.","ieee":"H. Malvai <i>et al.</i>, “Parakeet: Practical key transparency for end-to-end eEncrypted messaging,” in <i>Proceedings of the 2023 Network and Distributed System Security Symposium</i>, San Diego, CA, United States, 2023.","ista":"Malvai H, Kokoris Kogias E, Sonnino A, Ghosh E, Oztürk E, Lewi K, Lawlor S. 2023. Parakeet: Practical key transparency for end-to-end eEncrypted messaging. Proceedings of the 2023 Network and Distributed System Security Symposium. NDSS: Network and Distributed Systems Security.","ama":"Malvai H, Kokoris Kogias E, Sonnino A, et al. Parakeet: Practical key transparency for end-to-end eEncrypted messaging. In: <i>Proceedings of the 2023 Network and Distributed System Security Symposium</i>. Internet Society; 2023. doi:<a href=\"https://doi.org/10.14722/ndss.2023.24545\">10.14722/ndss.2023.24545</a>","apa":"Malvai, H., Kokoris Kogias, E., Sonnino, A., Ghosh, E., Oztürk, E., Lewi, K., &#38; Lawlor, S. (2023). Parakeet: Practical key transparency for end-to-end eEncrypted messaging. In <i>Proceedings of the 2023 Network and Distributed System Security Symposium</i>. San Diego, CA, United States: Internet Society. <a href=\"https://doi.org/10.14722/ndss.2023.24545\">https://doi.org/10.14722/ndss.2023.24545</a>"},"doi":"10.14722/ndss.2023.24545","language":[{"iso":"eng"}],"author":[{"full_name":"Malvai, Harjasleen","first_name":"Harjasleen","last_name":"Malvai"},{"id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","full_name":"Kokoris Kogias, Eleftherios","first_name":"Eleftherios","orcid":"0000-0002-8827-3382","last_name":"Kokoris Kogias"},{"full_name":"Sonnino, Alberto","last_name":"Sonnino","first_name":"Alberto"},{"full_name":"Ghosh, Esha","last_name":"Ghosh","first_name":"Esha"},{"first_name":"Ercan","last_name":"Oztürk","full_name":"Oztürk, Ercan"},{"first_name":"Kevin","last_name":"Lewi","full_name":"Lewi, Kevin"},{"last_name":"Lawlor","first_name":"Sean","full_name":"Lawlor, Sean"}],"article_processing_charge":"No","year":"2023","publication_status":"published","date_published":"2023-03-01T00:00:00Z","date_updated":"2026-06-18T17:41:59Z","title":"Parakeet: Practical key transparency for end-to-end eEncrypted messaging","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"isbn":["1891562835"]},"acknowledgement":"This work is supported by the Novi team at Meta and funded in part by IC3 industry partners and NSF grant 1943499.","day":"01","oa":1,"type":"conference","conference":{"end_date":"2023-03-03","start_date":"2023-02-27","name":"NDSS: Network and Distributed Systems Security","location":"San Diego, CA, United States"}},{"citation":{"short":"T. Meggendorfer, (2023).","chicago":"Meggendorfer, Tobias. “Artefact for: Correct Approximation of Stationary Distributions.” Zenodo, 2023. <a href=\"https://doi.org/10.5281/ZENODO.7548214\">https://doi.org/10.5281/ZENODO.7548214</a>.","apa":"Meggendorfer, T. (2023). Artefact for: Correct Approximation of Stationary Distributions. Zenodo. <a href=\"https://doi.org/10.5281/ZENODO.7548214\">https://doi.org/10.5281/ZENODO.7548214</a>","ista":"Meggendorfer T. 2023. Artefact for: Correct Approximation of Stationary Distributions, Zenodo, <a href=\"https://doi.org/10.5281/ZENODO.7548214\">10.5281/ZENODO.7548214</a>.","ama":"Meggendorfer T. Artefact for: Correct Approximation of Stationary Distributions. 2023. doi:<a href=\"https://doi.org/10.5281/ZENODO.7548214\">10.5281/ZENODO.7548214</a>","mla":"Meggendorfer, Tobias. <i>Artefact for: Correct Approximation of Stationary Distributions</i>. Zenodo, 2023, doi:<a href=\"https://doi.org/10.5281/ZENODO.7548214\">10.5281/ZENODO.7548214</a>.","ieee":"T. Meggendorfer, “Artefact for: Correct Approximation of Stationary Distributions.” Zenodo, 2023."},"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.5281/ZENODO.7548214","publisher":"Zenodo","department":[{"_id":"KrCh"}],"date_created":"2024-02-14T14:27:06Z","has_accepted_license":"1","abstract":[{"lang":"eng","text":"The software artefact to evaluate the approximation of stationary distributions implementation."}],"oa_version":"Published Version","corr_author":"1","month":"01","status":"public","ddc":["000"],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.5281/zenodo.7548214"}],"_id":"14990","oa":1,"type":"research_data_reference","day":"18","related_material":{"record":[{"relation":"used_in_publication","id":"13139","status":"public"}]},"title":"Artefact for: Correct Approximation of Stationary Distributions","date_published":"2023-01-18T00:00:00Z","date_updated":"2025-09-09T12:28:12Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Tobias","orcid":"0000-0002-1712-2165","last_name":"Meggendorfer","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","full_name":"Meggendorfer, Tobias"}],"year":"2023","article_processing_charge":"No"},{"citation":{"short":"Y.-L. Hwong, M. Colin, P. Aglas, C.J. Muller, S.C. Sherwood, (2023).","chicago":"Hwong, Yi-Ling, Maxime Colin, Philipp Aglas, Caroline J Muller, and Steven C. Sherwood. “Data-Assessing Memory in Convection Schemes Using Idealized Tests.” Zenodo, 2023. <a href=\"https://doi.org/10.5281/ZENODO.7757041\">https://doi.org/10.5281/ZENODO.7757041</a>.","ama":"Hwong Y-L, Colin M, Aglas P, Muller CJ, Sherwood SC. Data-assessing memory in convection schemes using idealized tests. 2023. doi:<a href=\"https://doi.org/10.5281/ZENODO.7757041\">10.5281/ZENODO.7757041</a>","ista":"Hwong Y-L, Colin M, Aglas P, Muller CJ, Sherwood SC. 2023. Data-assessing memory in convection schemes using idealized tests, Zenodo, <a href=\"https://doi.org/10.5281/ZENODO.7757041\">10.5281/ZENODO.7757041</a>.","apa":"Hwong, Y.-L., Colin, M., Aglas, P., Muller, C. J., &#38; Sherwood, S. C. (2023). Data-assessing memory in convection schemes using idealized tests. Zenodo. <a href=\"https://doi.org/10.5281/ZENODO.7757041\">https://doi.org/10.5281/ZENODO.7757041</a>","mla":"Hwong, Yi-Ling, et al. <i>Data-Assessing Memory in Convection Schemes Using Idealized Tests</i>. Zenodo, 2023, doi:<a href=\"https://doi.org/10.5281/ZENODO.7757041\">10.5281/ZENODO.7757041</a>.","ieee":"Y.-L. Hwong, M. Colin, P. Aglas, C. J. Muller, and S. C. Sherwood, “Data-assessing memory in convection schemes using idealized tests.” Zenodo, 2023."},"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.5281/ZENODO.7757041","project":[{"grant_number":"101034413","name":"IST-BRIDGE: International postdoctoral program","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","call_identifier":"H2020"}],"publisher":"Zenodo","date_created":"2024-02-14T14:37:57Z","has_accepted_license":"1","abstract":[{"lang":"eng","text":"This repository contains the data, scripts, WRF codes and files required to reproduce the results of the manuscript \"Assessing Memory in Convection Schemes Using Idealized Tests\" submitted to the Journal of Advances in Modeling Earth Systems (JAMES)."}],"department":[{"_id":"CaMu"}],"status":"public","month":"06","oa_version":"Published Version","corr_author":"1","ddc":["550"],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.5281/zenodo.7757041"}],"_id":"14991","oa":1,"ec_funded":1,"type":"research_data_reference","day":"23","related_material":{"record":[{"status":"public","id":"14654","relation":"used_in_publication"}]},"title":"Data-assessing memory in convection schemes using idealized tests","date_updated":"2025-09-09T13:35:40Z","date_published":"2023-06-23T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0001-9281-3479","last_name":"Hwong","first_name":"Yi-Ling","id":"1217aa61-4dd1-11ec-9ac3-f2ba3f17ee22","full_name":"Hwong, Yi-Ling"},{"full_name":"Colin, Maxime","last_name":"Colin","first_name":"Maxime"},{"last_name":"Aglas","first_name":"Philipp","full_name":"Aglas, Philipp","id":"02eace56-97fc-11ee-b81a-f0939ca85a77"},{"full_name":"Muller, Caroline J","id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b","last_name":"Muller","orcid":"0000-0001-5836-5350","first_name":"Caroline J"},{"full_name":"Sherwood, Steven C.","last_name":"Sherwood","first_name":"Steven C."}],"year":"2023","article_processing_charge":"No"},{"doi":"10.1007/978-3-031-22340-2_3","citation":{"mla":"Lewin, Mathieu, et al. “Universal Functionals in Density Functional Theory.” <i>Density Functional Theory</i>, edited by Eric Cances and Gero Friesecke, 1st ed., Springer, 2023, pp. 115–82, doi:<a href=\"https://doi.org/10.1007/978-3-031-22340-2_3\">10.1007/978-3-031-22340-2_3</a>.","ieee":"M. Lewin, E. H. Lieb, and R. Seiringer, “Universal Functionals in Density Functional Theory,” in <i>Density Functional Theory</i>, 1st ed., E. Cances and G. Friesecke, Eds. Springer, 2023, pp. 115–182.","ista":"Lewin M, Lieb EH, Seiringer R. 2023.Universal Functionals in Density Functional Theory. In: Density Functional Theory. Mathematics and Molecular Modeling, , 115–182.","apa":"Lewin, M., Lieb, E. H., &#38; Seiringer, R. (2023). Universal Functionals in Density Functional Theory. In E. Cances &#38; G. Friesecke (Eds.), <i>Density Functional Theory</i> (1st ed., pp. 115–182). Springer. <a href=\"https://doi.org/10.1007/978-3-031-22340-2_3\">https://doi.org/10.1007/978-3-031-22340-2_3</a>","ama":"Lewin M, Lieb EH, Seiringer R. Universal Functionals in Density Functional Theory. In: Cances E, Friesecke G, eds. <i>Density Functional Theory</i>. 1st ed. MAMOMO. Springer; 2023:115-182. doi:<a href=\"https://doi.org/10.1007/978-3-031-22340-2_3\">10.1007/978-3-031-22340-2_3</a>","chicago":"Lewin, Mathieu, Elliott H. Lieb, and Robert Seiringer. “Universal Functionals in Density Functional Theory.” In <i>Density Functional Theory</i>, edited by Eric Cances and Gero Friesecke, 1st ed., 115–82. MAMOMO. Springer, 2023. <a href=\"https://doi.org/10.1007/978-3-031-22340-2_3\">https://doi.org/10.1007/978-3-031-22340-2_3</a>.","short":"M. Lewin, E.H. Lieb, R. Seiringer, in:, E. Cances, G. Friesecke (Eds.), Density Functional Theory, 1st ed., Springer, 2023, pp. 115–182."},"department":[{"_id":"RoSe"}],"edition":"1","_id":"14992","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1912.10424"}],"oa_version":"Preprint","quality_controlled":"1","external_id":{"arxiv":["1912.10424"]},"publication_identifier":{"eisbn":["9783031223402"],"isbn":["9783031223396"],"issn":["3005-0286"]},"day":"19","arxiv":1,"date_updated":"2024-02-20T08:33:06Z","title":"Universal Functionals in Density Functional Theory","author":[{"last_name":"Lewin","first_name":"Mathieu","full_name":"Lewin, Mathieu"},{"last_name":"Lieb","first_name":"Elliott H.","full_name":"Lieb, Elliott H."},{"id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","full_name":"Seiringer, Robert","first_name":"Robert","orcid":"0000-0002-6781-0521","last_name":"Seiringer"}],"language":[{"iso":"eng"}],"alternative_title":["Mathematics and Molecular Modeling"],"date_created":"2024-02-14T14:44:33Z","abstract":[{"text":"In this chapter we first review the Levy–Lieb functional, which gives the lowest kinetic and interaction energy that can be reached with all possible quantum states having a given density. We discuss two possible convex generalizations of this functional, corresponding to using mixed canonical and grand-canonical states, respectively. We present some recent works about the local density approximation, in which the functionals get replaced by purely local functionals constructed using the uniform electron gas energy per unit volume. We then review the known upper and lower bounds on the Levy–Lieb functionals. We start with the kinetic energy alone, then turn to the classical interaction alone, before we are able to put everything together. A later section is devoted to the Hohenberg–Kohn theorem and the role of many-body unique continuation in its proof.","lang":"eng"}],"publisher":"Springer","status":"public","month":"07","publication":"Density Functional Theory","type":"book_chapter","oa":1,"page":"115-182","editor":[{"full_name":"Cances, Eric","first_name":"Eric","last_name":"Cances"},{"first_name":"Gero","last_name":"Friesecke","full_name":"Friesecke, Gero"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2023-07-19T00:00:00Z","article_processing_charge":"No","year":"2023","publication_status":"published","series_title":"MAMOMO"},{"_id":"14993","publication":"1st Workshop on Machine Learning & Global Health","month":"03","ddc":["000"],"oa_version":"Published Version","quality_controlled":"1","status":"public","main_file_link":[{"open_access":"1","url":"https://openreview.net/forum?id=jHY_G91R880"}],"language":[{"iso":"eng"}],"citation":{"apa":"Currin, C., Asiedu , M. N., Fourie, C., Rosman, B., Turki, H., Lambebo Tonja, A., … Machangara, D. (2023). A framework for grassroots research collaboration in machine learning and global health. In <i>1st Workshop on Machine Learning &#38; Global Health</i>. Kigali, Rwanda: OpenReview.","ista":"Currin C, Asiedu  MN, Fourie C, Rosman B, Turki H, Lambebo Tonja A, Abbott J, Ajala M, Adedayo SA, Emezue CC, Machangara D. 2023. A framework for grassroots research collaboration in machine learning and global health. 1st Workshop on Machine Learning &#38; Global Health. ICLR: International Conference on Learning Representations.","ama":"Currin C, Asiedu  MN, Fourie C, et al. A framework for grassroots research collaboration in machine learning and global health. In: <i>1st Workshop on Machine Learning &#38; Global Health</i>. OpenReview; 2023.","mla":"Currin, Christopher, et al. “A Framework for Grassroots Research Collaboration in Machine Learning and Global Health.” <i>1st Workshop on Machine Learning &#38; Global Health</i>, OpenReview, 2023.","ieee":"C. Currin <i>et al.</i>, “A framework for grassroots research collaboration in machine learning and global health,” in <i>1st Workshop on Machine Learning &#38; Global Health</i>, Kigali, Rwanda, 2023.","short":"C. Currin, M.N. Asiedu , C. Fourie, B. Rosman, H. Turki, A. Lambebo Tonja, J. Abbott, M. Ajala, S.A. Adedayo, C.C. Emezue, D. Machangara, in:, 1st Workshop on Machine Learning &#38; Global Health, OpenReview, 2023.","chicago":"Currin, Christopher, Mercy Nyamewaa Asiedu , Chris Fourie, Benjamin Rosman, Houcemeddine Turki, Atnafu Lambebo Tonja, Jade Abbott, et al. “A Framework for Grassroots Research Collaboration in Machine Learning and Global Health.” In <i>1st Workshop on Machine Learning &#38; Global Health</i>. OpenReview, 2023."},"date_created":"2024-02-14T15:11:48Z","department":[{"_id":"TiVo"}],"abstract":[{"lang":"eng","text":"Traditional top-down approaches for global health have historically failed to achieve social progress (Hoffman et al., 2015; Hoffman & Røttingen, 2015). Recently, however, a more holistic, multi-level approach termed One Health (OH) (Osterhaus et al., 2020) is being adopted. Several sets of challenges have been identified for the implementation of OH (dos S. Ribeiro et al., 2019), including policy and funding, education and training, and multi-actor, multi-domain, and multi-level collaborations. These exist despite the increasing accessibility to\r\nknowledge and digital collaborative research tools through the internet. To address some of these challenges, we propose a general framework for grassroots community-based means of participatory research. Additionally, we present a specific roadmap to create a Machine Learning for Global Health community in Africa. The proposed framework aims to enable any small group of individuals with scarce resources to build and sustain an online community within approximately two years. We provide a discussion on the potential impact of the proposed framework for global health research collaborations."}],"publisher":"OpenReview","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"A framework for grassroots research collaboration in machine learning and global health","date_published":"2023-03-02T00:00:00Z","date_updated":"2026-06-18T17:42:25Z","publication_status":"published","year":"2023","article_processing_charge":"No","author":[{"first_name":"Christopher","last_name":"Currin","orcid":"0000-0002-4809-5059","full_name":"Currin, Christopher","id":"e8321fc5-3091-11eb-8a53-83f309a11ac9"},{"full_name":"Asiedu , Mercy Nyamewaa","last_name":"Asiedu ","first_name":"Mercy Nyamewaa"},{"full_name":"Fourie, Chris","last_name":"Fourie","first_name":"Chris"},{"first_name":"Benjamin","last_name":"Rosman","full_name":"Rosman, Benjamin"},{"full_name":"Turki, Houcemeddine","first_name":"Houcemeddine","last_name":"Turki"},{"full_name":"Lambebo Tonja, Atnafu","last_name":"Lambebo Tonja","first_name":"Atnafu"},{"full_name":"Abbott, Jade","last_name":"Abbott","first_name":"Jade"},{"full_name":"Ajala, Marvellous","last_name":"Ajala","first_name":"Marvellous"},{"full_name":"Adedayo, Sadiq Adewale","last_name":"Adedayo","first_name":"Sadiq Adewale"},{"full_name":"Emezue, Chris Chinenye","last_name":"Emezue","first_name":"Chris Chinenye"},{"full_name":"Machangara, Daphne","first_name":"Daphne","last_name":"Machangara"}],"conference":{"location":"Kigali, Rwanda","name":"ICLR: International Conference on Learning Representations","start_date":"2023-05-05","end_date":"2023-05-05"},"type":"conference","oa":1,"day":"02","acknowledgement":"Houcemeddine Turki’s contributions to this final output have been funded through the Adapting\r\nWikidata to support clinical practice using Data Science, Semantic Web and Machine Learning\r\nproject, which is part of the Wikimedia Research Fund maintained by the Wikimedia Foundation in San Francisco, California, United States of America."},{"related_material":{"record":[{"relation":"used_in_publication","id":"14758","status":"public"}]},"day":"28","oa":1,"type":"research_data_reference","author":[{"first_name":"Rupak","last_name":"Majumdar","full_name":"Majumdar, Rupak"},{"last_name":"Mallik","orcid":"0000-0001-9864-7475","first_name":"Kaushik","full_name":"Mallik, Kaushik","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598"},{"full_name":"Rychlicki, Mateusz","last_name":"Rychlicki","first_name":"Mateusz"},{"full_name":"Schmuck, Anne-Kathrin","first_name":"Anne-Kathrin","last_name":"Schmuck"},{"full_name":"Soudjani, Sadegh","last_name":"Soudjani","first_name":"Sadegh"}],"year":"2023","article_processing_charge":"No","date_published":"2023-04-28T00:00:00Z","date_updated":"2025-09-09T14:16:48Z","title":"A flexible toolchain for symbolic rabin games under fair and stochastic uncertainties","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Zenodo","department":[{"_id":"ToHe"}],"date_created":"2024-02-14T15:13:00Z","has_accepted_license":"1","abstract":[{"lang":"eng","text":"This resource contains the artifacts for reproducing the experimental results presented in the paper titled \"A Flexible Toolchain for Symbolic Rabin Games under Fair and Stochastic Uncertainties\" that has been submitted in CAV 2023."}],"doi":"10.5281/ZENODO.7877790","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":"R. Majumdar, K. Mallik, M. Rychlicki, A.-K. Schmuck, S. Soudjani, (2023).","chicago":"Majumdar, Rupak, Kaushik Mallik, Mateusz Rychlicki, Anne-Kathrin Schmuck, and Sadegh Soudjani. “A Flexible Toolchain for Symbolic Rabin Games under Fair and Stochastic Uncertainties.” Zenodo, 2023. <a href=\"https://doi.org/10.5281/ZENODO.7877790\">https://doi.org/10.5281/ZENODO.7877790</a>.","ama":"Majumdar R, Mallik K, Rychlicki M, Schmuck A-K, Soudjani S. A flexible toolchain for symbolic rabin games under fair and stochastic uncertainties. 2023. doi:<a href=\"https://doi.org/10.5281/ZENODO.7877790\">10.5281/ZENODO.7877790</a>","ista":"Majumdar R, Mallik K, Rychlicki M, Schmuck A-K, Soudjani S. 2023. A flexible toolchain for symbolic rabin games under fair and stochastic uncertainties, Zenodo, <a href=\"https://doi.org/10.5281/ZENODO.7877790\">10.5281/ZENODO.7877790</a>.","apa":"Majumdar, R., Mallik, K., Rychlicki, M., Schmuck, A.-K., &#38; Soudjani, S. (2023). A flexible toolchain for symbolic rabin games under fair and stochastic uncertainties. Zenodo. <a href=\"https://doi.org/10.5281/ZENODO.7877790\">https://doi.org/10.5281/ZENODO.7877790</a>","mla":"Majumdar, Rupak, et al. <i>A Flexible Toolchain for Symbolic Rabin Games under Fair and Stochastic Uncertainties</i>. Zenodo, 2023, doi:<a href=\"https://doi.org/10.5281/ZENODO.7877790\">10.5281/ZENODO.7877790</a>.","ieee":"R. Majumdar, K. Mallik, M. Rychlicki, A.-K. Schmuck, and S. Soudjani, “A flexible toolchain for symbolic rabin games under fair and stochastic uncertainties.” Zenodo, 2023."},"main_file_link":[{"url":"https://doi.org/10.5281/zenodo.7877790","open_access":"1"}],"status":"public","month":"04","corr_author":"1","oa_version":"Published Version","ddc":["000"],"_id":"14994"},{"status":"public","month":"12","oa_version":"Published Version","ddc":["570"],"corr_author":"1","main_file_link":[{"open_access":"1","url":"https://figshare.com/s/85798bba4ebc68d822ed"}],"_id":"15027","publisher":"Figshare","has_accepted_license":"1","abstract":[{"text":"This data repository underpins the paper, published in PNAS (doi pending) and bioarxiv (doi: https://doi.org/10.1101/2023.07.05.547777).","lang":"eng"}],"date_created":"2024-02-26T08:37:57Z","department":[{"_id":"AnSa"}],"tmp":{"short":"CC0 (1.0)","name":"Creative Commons Public Domain Dedication (CC0 1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","image":"/images/cc_0.png"},"citation":{"short":"S. Curk, (2023).","chicago":"Curk, Samo. “Aggregation_data.” Figshare, 2023.","apa":"Curk, S. (2023). aggregation_data. Figshare.","ama":"Curk S. aggregation_data. 2023.","ista":"Curk S. 2023. aggregation_data, Figshare.","ieee":"S. Curk, “aggregation_data.” Figshare, 2023.","mla":"Curk, Samo. <i>Aggregation_data</i>. Figshare, 2023."},"OA_type":"gold","author":[{"full_name":"Curk, Samo","id":"031eff0d-d481-11ee-8508-cd12a7a86e5b","first_name":"Samo","last_name":"Curk","orcid":"0000-0001-6160-9766"}],"year":"2023","article_processing_charge":"No","title":"aggregation_data","date_published":"2023-12-13T00:00:00Z","date_updated":"2025-09-04T12:03:11Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"13","related_material":{"record":[{"relation":"used_in_publication","id":"15001","status":"public"}]},"oa":1,"OA_place":"publisher","type":"research_data_reference","license":"https://creativecommons.org/publicdomain/zero/1.0/"},{"main_file_link":[{"url":"https://doi.org/10.5281/zenodo.8191722","open_access":"1"}],"status":"public","ddc":["000"],"month":"07","corr_author":"1","oa_version":"Published Version","_id":"15035","publisher":"Zenodo","department":[{"_id":"ToHe"}],"date_created":"2024-02-28T07:34:34Z","abstract":[{"lang":"eng","text":"This artifact aims to reproduce experiments from the paper Monitoring Hyperproperties With Prefix Transducers accepted at RV'23, and give further pointers to implementation of prefix transducers.\r\nIt has two parts: a pre-compiled docker image and sources that one can use to compile (locally or in docker) the software and run the experiments."}],"has_accepted_license":"1","doi":"10.5281/ZENODO.8191723","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":"Chalupa M, Henzinger TA. 2023. Monitoring hyperproperties with prefix transducers, Zenodo, <a href=\"https://doi.org/10.5281/ZENODO.8191723\">10.5281/ZENODO.8191723</a>.","apa":"Chalupa, M., &#38; Henzinger, T. A. (2023). Monitoring hyperproperties with prefix transducers. Zenodo. <a href=\"https://doi.org/10.5281/ZENODO.8191723\">https://doi.org/10.5281/ZENODO.8191723</a>","ama":"Chalupa M, Henzinger TA. Monitoring hyperproperties with prefix transducers. 2023. doi:<a href=\"https://doi.org/10.5281/ZENODO.8191723\">10.5281/ZENODO.8191723</a>","ieee":"M. Chalupa and T. A. Henzinger, “Monitoring hyperproperties with prefix transducers.” Zenodo, 2023.","mla":"Chalupa, Marek, and Thomas A. Henzinger. <i>Monitoring Hyperproperties with Prefix Transducers</i>. Zenodo, 2023, doi:<a href=\"https://doi.org/10.5281/ZENODO.8191723\">10.5281/ZENODO.8191723</a>.","short":"M. Chalupa, T.A. Henzinger, (2023).","chicago":"Chalupa, Marek, and Thomas A Henzinger. “Monitoring Hyperproperties with Prefix Transducers.” Zenodo, 2023. <a href=\"https://doi.org/10.5281/ZENODO.8191723\">https://doi.org/10.5281/ZENODO.8191723</a>."},"project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software"}],"author":[{"full_name":"Chalupa, Marek","id":"87e34708-d6c6-11ec-9f5b-9391e7be2463","last_name":"Chalupa","first_name":"Marek"},{"last_name":"Henzinger","orcid":"0000-0002-2985-7724","first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","year":"2023","date_published":"2023-07-28T00:00:00Z","date_updated":"2025-04-14T09:42:55Z","title":"Monitoring hyperproperties with prefix transducers","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"status":"public","id":"14076","relation":"used_in_publication"}]},"day":"28","oa":1,"ec_funded":1,"type":"research_data_reference"},{"page":"565-575","oa":1,"type":"journal_article","isi":1,"file":[{"access_level":"open_access","content_type":"application/pdf","file_size":598097,"file_name":"2023_ComptesRendusMath_Kwan.pdf","checksum":"d1d0e0a854a79ae95fb66d75d9117a68","creator":"dernst","date_created":"2024-03-25T07:21:52Z","relation":"main_file","date_updated":"2024-03-25T07:21:52Z","file_id":"15174","success":1}],"publication_status":"published","article_processing_charge":"Yes","year":"2023","date_published":"2023-02-01T00:00:00Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publisher":"Academie des Sciences","abstract":[{"lang":"eng","text":"We show that the number of linear spaces on a set of n points and the number of rank-3 matroids on a ground set of size n are both of the form (cn+o(n))n2/6, where c=e3√/2−3(1+3–√)/2. This is the final piece of the puzzle for enumerating fixed-rank matroids at this level of accuracy: the numbers of rank-1 and rank-2 matroids on a ground set of size n have exact representations in terms of well-known combinatorial functions, and it was recently proved by van der Hofstad, Pendavingh, and van der Pol that for constant r≥4 there are (e1−rn+o(n))nr−1/r! rank-r matroids on a ground set of size n. In our proof, we introduce a new approach for bounding the number of clique decompositions of a complete graph, using quasirandomness instead of the so-called entropy method that is common in this area."}],"has_accepted_license":"1","date_created":"2024-03-24T23:01:00Z","intvolume":"       361","language":[{"iso":"eng"}],"issue":"G2","publication":"Comptes Rendus Mathematique","status":"public","month":"02","ddc":["510"],"arxiv":1,"day":"01","file_date_updated":"2024-03-25T07:21:52Z","publication_identifier":{"issn":["1631-073X"],"eissn":["1778-3569"]},"acknowledgement":"Sah and Sawhney were supported by NSF Graduate Research Fellowship Program DGE-1745302. Sah was supported by the PD Soros Fellowship.\r\nWe thank Michael Simkin for helpful comments on the manuscript. We thank Zach Hunter for\r\nseveral corrections.","article_type":"original","external_id":{"isi":["001167671400009"],"arxiv":["2112.03788"]},"author":[{"first_name":"Matthew Alan","orcid":"0000-0002-4003-7567","last_name":"Kwan","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","full_name":"Kwan, Matthew Alan"},{"last_name":"Sah","first_name":"Ashwin","full_name":"Sah, Ashwin"},{"first_name":"Mehtaab","last_name":"Sawhney","full_name":"Sawhney, Mehtaab"}],"title":"Enumerating matroids and linear spaces","date_updated":"2025-09-09T14:26:32Z","volume":361,"scopus_import":"1","department":[{"_id":"MaKw"}],"citation":{"short":"M.A. Kwan, A. Sah, M. Sawhney, Comptes Rendus Mathematique 361 (2023) 565–575.","chicago":"Kwan, Matthew Alan, Ashwin Sah, and Mehtaab Sawhney. “Enumerating Matroids and Linear Spaces.” <i>Comptes Rendus Mathematique</i>. Academie des Sciences, 2023. <a href=\"https://doi.org/10.5802/crmath.423\">https://doi.org/10.5802/crmath.423</a>.","ista":"Kwan MA, Sah A, Sawhney M. 2023. Enumerating matroids and linear spaces. Comptes Rendus Mathematique. 361(G2), 565–575.","ama":"Kwan MA, Sah A, Sawhney M. Enumerating matroids and linear spaces. <i>Comptes Rendus Mathematique</i>. 2023;361(G2):565-575. doi:<a href=\"https://doi.org/10.5802/crmath.423\">10.5802/crmath.423</a>","apa":"Kwan, M. A., Sah, A., &#38; Sawhney, M. (2023). Enumerating matroids and linear spaces. <i>Comptes Rendus Mathematique</i>. Academie des Sciences. <a href=\"https://doi.org/10.5802/crmath.423\">https://doi.org/10.5802/crmath.423</a>","ieee":"M. A. Kwan, A. Sah, and M. Sawhney, “Enumerating matroids and linear spaces,” <i>Comptes Rendus Mathematique</i>, vol. 361, no. G2. Academie des Sciences, pp. 565–575, 2023.","mla":"Kwan, Matthew Alan, et al. “Enumerating Matroids and Linear Spaces.” <i>Comptes Rendus Mathematique</i>, vol. 361, no. G2, Academie des Sciences, 2023, pp. 565–75, doi:<a href=\"https://doi.org/10.5802/crmath.423\">10.5802/crmath.423</a>."},"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.5802/crmath.423","quality_controlled":"1","oa_version":"Published Version","_id":"15173"},{"type":"conference_poster","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2023-08-01T00:00:00Z","year":"2023","article_processing_charge":"No","publication_status":"published","file":[{"date_updated":"2024-04-03T14:58:24Z","file_id":"15293","success":1,"content_type":"video/mp4","access_level":"open_access","file_size":58770929,"creator":"yichen","checksum":"88bdef929ca262ee0eefae0bbc649139","file_name":"video.mp4","relation":"main_file","date_created":"2024-04-03T14:58:24Z"},{"file_id":"15294","success":1,"date_updated":"2024-04-03T14:58:23Z","date_created":"2024-04-03T14:58:23Z","relation":"main_file","creator":"yichen","checksum":"c06881ba847da365a74ac09c953eaffd","file_name":"frictionPoster_clean.pdf","file_size":3951968,"access_level":"open_access","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"abstract":[{"text":"We present a rigid body animation technique which prevents solids from interpenetrating, dissipates energy through friction, and propagates shocks through contacts. We employ the Alternating Direction Method of Multipliers (ADMM) to couple non-smooth Coulomb friction with impact propagation, allowing efficient and accurate non-smooth dynamics along with a correct transmission of impacts through assemblies of rigid bodies. We further extend our method to model adhesion, dynamic friction and lubricated contact.","lang":"eng"}],"has_accepted_license":"1","date_created":"2024-04-03T14:57:23Z","publisher":"ACM","month":"08","corr_author":"1","ddc":["005","531"],"publication":"Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation","status":"public","conference":{"end_date":"2023-08-06","start_date":"2023-08-04","location":"Los Angeles, CA, United States","name":"SCA: Symposium on Computer Animation"},"acknowledgement":"We thank the anonymous reviewers and the members of the Visual Computing Group at ISTA for their helpful comments. This research was supported by the Scientific Service Units (SSU) of ISTA through resources provided by Scientific Computing, and was funded in part by the European Union (ERC-2021-COG 101045083 CoDiNA)","file_date_updated":"2024-04-03T14:58:24Z","related_material":{"record":[{"id":"14748","relation":"other","status":"public"}]},"day":"01","date_updated":"2025-04-14T12:58:27Z","title":"Unified treatment of contact, friction and shock-propagation in rigid body animation","author":[{"first_name":"Yi-Lu","last_name":"Chen","full_name":"Chen, Yi-Lu","id":"0b467602-dbcd-11ea-9d1d-ed480aa46b70"},{"first_name":"Mickaël","last_name":"Ly","id":"6340d7f0-b48d-11eb-b10d-b7487e71d9f1","full_name":"Ly, Mickaël"},{"last_name":"Wojtan","orcid":"0000-0001-6646-5546","first_name":"Christopher J","full_name":"Wojtan, Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87"}],"project":[{"_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088","grant_number":"101045083","name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena"}],"doi":"10.1145/3606037.3606836","citation":{"mla":"Chen, Yi-Lu, et al. “Unified Treatment of Contact, Friction and Shock-Propagation in Rigid Body Animation.” <i>Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation</i>, ACM, 2023, doi:<a href=\"https://doi.org/10.1145/3606037.3606836\">10.1145/3606037.3606836</a>.","ieee":"Y.-L. Chen, M. Ly, and C. Wojtan, <i>Unified treatment of contact, friction and shock-propagation in rigid body animation</i>. ACM, 2023.","apa":"Chen, Y.-L., Ly, M., &#38; Wojtan, C. (2023). <i>Unified treatment of contact, friction and shock-propagation in rigid body animation</i>. <i>Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation</i>. Los Angeles, CA, United States: ACM. <a href=\"https://doi.org/10.1145/3606037.3606836\">https://doi.org/10.1145/3606037.3606836</a>","ista":"Chen Y-L, Ly M, Wojtan C. 2023. Unified treatment of contact, friction and shock-propagation in rigid body animation, ACM,p.","ama":"Chen Y-L, Ly M, Wojtan C. <i>Unified Treatment of Contact, Friction and Shock-Propagation in Rigid Body Animation</i>. ACM; 2023. doi:<a href=\"https://doi.org/10.1145/3606037.3606836\">10.1145/3606037.3606836</a>","chicago":"Chen, Yi-Lu, Mickaël Ly, and Chris Wojtan. <i>Unified Treatment of Contact, Friction and Shock-Propagation in Rigid Body Animation</i>. <i>Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation</i>. ACM, 2023. <a href=\"https://doi.org/10.1145/3606037.3606836\">https://doi.org/10.1145/3606037.3606836</a>.","short":"Y.-L. Chen, M. Ly, C. Wojtan, Unified Treatment of Contact, Friction and Shock-Propagation in Rigid Body Animation, ACM, 2023."},"department":[{"_id":"GradSch"},{"_id":"ChWo"}],"_id":"15292","oa_version":"None"},{"external_id":{"arxiv":["2111.13864"]},"arxiv":1,"day":"21","acknowledgement":"We are grateful to Rupert Frank for helpful discussions at an early stage of this project.\r\nFunding from the European Union’s Horizon 2020 research and innovation programme\r\nunder the ERC grant agreement No 694227 is acknowledged.","article_type":"original","publication_identifier":{"issn":["2690-0998"],"eissn":["2690-1005"]},"title":"Validity of Bogoliubov’s approximation fortranslation-invariant Bose gases","date_updated":"2025-04-14T07:26:59Z","author":[{"id":"B7ECF9FC-AA38-11E9-AC9A-0930E6697425","full_name":"Brooks, Morris","orcid":"0000-0002-6249-0928","last_name":"Brooks","first_name":"Morris"},{"id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","full_name":"Seiringer, Robert","first_name":"Robert","orcid":"0000-0002-6781-0521","last_name":"Seiringer"}],"citation":{"chicago":"Brooks, Morris, and Robert Seiringer. “Validity of Bogoliubov’s Approximation Fortranslation-Invariant Bose Gases.” <i>Probability and Mathematical Physics</i>. Mathematical Sciences Publishers, 2023. <a href=\"https://doi.org/10.2140/pmp.2022.3.939\">https://doi.org/10.2140/pmp.2022.3.939</a>.","short":"M. Brooks, R. Seiringer, Probability and Mathematical Physics 3 (2023) 939–1000.","mla":"Brooks, Morris, and Robert Seiringer. “Validity of Bogoliubov’s Approximation Fortranslation-Invariant Bose Gases.” <i>Probability and Mathematical Physics</i>, vol. 3, no. 4, Mathematical Sciences Publishers, 2023, pp. 939–1000, doi:<a href=\"https://doi.org/10.2140/pmp.2022.3.939\">10.2140/pmp.2022.3.939</a>.","ieee":"M. Brooks and R. Seiringer, “Validity of Bogoliubov’s approximation fortranslation-invariant Bose gases,” <i>Probability and Mathematical Physics</i>, vol. 3, no. 4. Mathematical Sciences Publishers, pp. 939–1000, 2023.","ista":"Brooks M, Seiringer R. 2023. Validity of Bogoliubov’s approximation fortranslation-invariant Bose gases. Probability and Mathematical Physics. 3(4), 939–1000.","ama":"Brooks M, Seiringer R. Validity of Bogoliubov’s approximation fortranslation-invariant Bose gases. <i>Probability and Mathematical Physics</i>. 2023;3(4):939-1000. doi:<a href=\"https://doi.org/10.2140/pmp.2022.3.939\">10.2140/pmp.2022.3.939</a>","apa":"Brooks, M., &#38; Seiringer, R. (2023). Validity of Bogoliubov’s approximation fortranslation-invariant Bose gases. <i>Probability and Mathematical Physics</i>. Mathematical Sciences Publishers. <a href=\"https://doi.org/10.2140/pmp.2022.3.939\">https://doi.org/10.2140/pmp.2022.3.939</a>"},"doi":"10.2140/pmp.2022.3.939","project":[{"name":"Analysis of quantum many-body systems","grant_number":"694227","call_identifier":"H2020","_id":"25C6DC12-B435-11E9-9278-68D0E5697425"}],"volume":3,"scopus_import":"1","department":[{"_id":"RoSe"}],"quality_controlled":"1","oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2111.13864"}],"_id":"17074","oa":1,"type":"journal_article","ec_funded":1,"page":"939-1000","date_published":"2023-02-21T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","year":"2023","article_processing_charge":"No","intvolume":"         3","language":[{"iso":"eng"}],"publisher":"Mathematical Sciences Publishers","date_created":"2024-05-29T06:12:54Z","abstract":[{"text":"We verify Bogoliubov's approximation for translation invariant Bose gases in the mean field regime, i.e. we prove that the ground state energy EN is given by EN=NeH+infσ(H)+oN→∞(1), where N is the number of particles, eH is the minimal Hartree energy and H is the Bogoliubov Hamiltonian. As an intermediate result we show the existence of approximate ground states ΨN, i.e. states satisfying ⟨HN⟩ΨN=EN+oN→∞(1), exhibiting complete Bose--Einstein condensation with respect to one of the Hartree minimizers.","lang":"eng"}],"publication":"Probability and Mathematical Physics","corr_author":"1","month":"02","status":"public","issue":"4"},{"type":"journal_article","isi":1,"oa":1,"year":"2023","article_processing_charge":"No","publication_status":"published","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_number":"2250049","date_published":"2023-01-01T00:00:00Z","abstract":[{"lang":"eng","text":"We study moments of characteristic polynomials of truncated Haar distributed matrices from the three classical compact groups O(N), U(N) and Sp(2N). For finite matrix size we calculate the moments in terms of hypergeometric functions of matrix argument and give explicit integral representations highlighting the duality between the moment and the matrix size as well as the duality between the orthogonal and symplectic cases. Asymptotic expansions in strong and weak non-unitarity regimes are obtained. Using the connection to matrix hypergeometric functions, we establish limit theorems for the log-modulus of the characteristic polynomial evaluated on the unit circle."}],"date_created":"2024-05-29T06:14:26Z","publisher":"World Scientific Publishing","language":[{"iso":"eng"}],"intvolume":"        12","issue":"01","status":"public","month":"01","publication":"Random Matrices: Theory and Applications","publication_identifier":{"issn":["2010-3263"],"eissn":["2010-3271"]},"acknowledgement":"N.S. gratefully acknowledges financial support of the Royal Society, grant URF/R1/180707. We would like to thank Emma Bailey, Yan Fyodorov and Jordan Stoyanov for helpful comments an an earlier version of this paper. We are grateful for the comments of an anonymous referee.","article_type":"original","day":"01","arxiv":1,"external_id":{"isi":["000848874400001"],"arxiv":["2109.10331"]},"author":[{"full_name":"Serebryakov, Alexander","last_name":"Serebryakov","first_name":"Alexander"},{"last_name":"Simm","first_name":"Nick","full_name":"Simm, Nick"},{"first_name":"Guillaume","last_name":"Dubach","orcid":"0000-0001-6892-8137","full_name":"Dubach, Guillaume","id":"D5C6A458-10C4-11EA-ABF4-A4B43DDC885E"}],"date_updated":"2025-09-09T14:27:10Z","title":"Characteristic polynomials of random truncations: Moments, duality and asymptotics","scopus_import":"1","department":[{"_id":"LaEr"}],"volume":12,"doi":"10.1142/s2010326322500496","citation":{"short":"A. Serebryakov, N. Simm, G. Dubach, Random Matrices: Theory and Applications 12 (2023).","chicago":"Serebryakov, Alexander, Nick Simm, and Guillaume Dubach. “Characteristic Polynomials of Random Truncations: Moments, Duality and Asymptotics.” <i>Random Matrices: Theory and Applications</i>. World Scientific Publishing, 2023. <a href=\"https://doi.org/10.1142/s2010326322500496\">https://doi.org/10.1142/s2010326322500496</a>.","ista":"Serebryakov A, Simm N, Dubach G. 2023. Characteristic polynomials of random truncations: Moments, duality and asymptotics. Random Matrices: Theory and Applications. 12(01), 2250049.","ama":"Serebryakov A, Simm N, Dubach G. Characteristic polynomials of random truncations: Moments, duality and asymptotics. <i>Random Matrices: Theory and Applications</i>. 2023;12(01). doi:<a href=\"https://doi.org/10.1142/s2010326322500496\">10.1142/s2010326322500496</a>","apa":"Serebryakov, A., Simm, N., &#38; Dubach, G. (2023). Characteristic polynomials of random truncations: Moments, duality and asymptotics. <i>Random Matrices: Theory and Applications</i>. World Scientific Publishing. <a href=\"https://doi.org/10.1142/s2010326322500496\">https://doi.org/10.1142/s2010326322500496</a>","ieee":"A. Serebryakov, N. Simm, and G. Dubach, “Characteristic polynomials of random truncations: Moments, duality and asymptotics,” <i>Random Matrices: Theory and Applications</i>, vol. 12, no. 01. World Scientific Publishing, 2023.","mla":"Serebryakov, Alexander, et al. “Characteristic Polynomials of Random Truncations: Moments, Duality and Asymptotics.” <i>Random Matrices: Theory and Applications</i>, vol. 12, no. 01, 2250049, World Scientific Publishing, 2023, doi:<a href=\"https://doi.org/10.1142/s2010326322500496\">10.1142/s2010326322500496</a>."},"_id":"17079","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2109.10331","open_access":"1"}],"oa_version":"Preprint","quality_controlled":"1"},{"department":[{"_id":"KrCh"}],"date_created":"2024-06-03T07:44:54Z","abstract":[{"lang":"eng","text":"Prophet inequalities are a central object of study in optimal stopping theory. A gambler is sent values online, sampled from an instance of independent distributions, in an adversarial, random or selected order, depending on the model. When observing each value, the gambler either accepts it as a reward or irrevocably rejects it and proceeds to observe the next value. The goal of the gambler, who cannot see the future, is maximising the expected value of the reward while competing against the expectation of a prophet (the offline maximum). In other words, one seeks to maximise the gambler-to-prophet ratio of the expectations.\r\nThe model, in which the gambler selects the arrival order first, and then observes the values, is known as Order Selection. In this model a ratio of 0.7251 has been proved to be attainable for any instance. In very recent work, this has been improved up to 0.7258. If the gambler chooses the arrival order (uniformly) at random, we obtain the Random Order model. The worst case ratio over all possible instances has been extensively studied for at least 40 years. In the recent work aforementioned, through simulations, this ratio has been shown to be at most 0.7254 for the Random Order model, thus establishing for the first time that carefully choosing the order, instead of simply taking it at random, benefits the gambler. We give an alternative, more rigorous proof of this fact, by showing mathematically that in the Random Order model, no algorithm can achieve a ratio larger than 0.7235. This sets a new state-of-the-art hardness for this model, and establishes more formally that there is a real benefit in choosing the order."}],"project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications"}],"language":[{"iso":"eng"}],"citation":{"ista":"Giambartolomei G, Frederik Mallmann-Trenn FM-T, Saona Urmeneta RJ. Prophet inequalities: Separating random order from order selection. arXiv, 2304.04024.","apa":"Giambartolomei, G., Frederik Mallmann-Trenn, F. M.-T., &#38; Saona Urmeneta, R. J. (n.d.). Prophet inequalities: Separating random order from order selection. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2304.04024\">https://doi.org/10.48550/arXiv.2304.04024</a>","ama":"Giambartolomei G, Frederik Mallmann-Trenn FM-T, Saona Urmeneta RJ. Prophet inequalities: Separating random order from order selection. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2304.04024\">10.48550/arXiv.2304.04024</a>","mla":"Giambartolomei, Giordano, et al. “Prophet Inequalities: Separating Random Order from Order Selection.” <i>ArXiv</i>, 2304.04024, doi:<a href=\"https://doi.org/10.48550/arXiv.2304.04024\">10.48550/arXiv.2304.04024</a>.","ieee":"G. Giambartolomei, F. M.-T. Frederik Mallmann-Trenn, and R. J. Saona Urmeneta, “Prophet inequalities: Separating random order from order selection,” <i>arXiv</i>. .","short":"G. Giambartolomei, F.M.-T. Frederik Mallmann-Trenn, R.J. Saona Urmeneta, ArXiv (n.d.).","chicago":"Giambartolomei, Giordano, Frederik Mallmann-Trenn Frederik Mallmann-Trenn, and Raimundo J Saona Urmeneta. “Prophet Inequalities: Separating Random Order from Order Selection.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2304.04024\">https://doi.org/10.48550/arXiv.2304.04024</a>."},"doi":"10.48550/arXiv.2304.04024","_id":"17100","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2304.04024","open_access":"1"}],"oa_version":"Preprint","month":"04","publication":"arXiv","status":"public","acknowledgement":"This research was partially supported by the EPSRC grant EP/W005573/1, the ERC CoG 863818 (ForM-SMArt) grant, and the ANID Chile grant ACT210005. We would like to thank Jos´e Correa and Bruno Zilotto for their precious advice, and Mona Mohammadi and Roodabeh Safavi for early conversations.","day":"08","arxiv":1,"ec_funded":1,"type":"preprint","external_id":{"arxiv":["2304.04024"]},"oa":1,"year":"2023","article_processing_charge":"No","publication_status":"submitted","author":[{"full_name":"Giambartolomei, Giordano","last_name":"Giambartolomei","first_name":"Giordano"},{"last_name":"Frederik Mallmann-Trenn","first_name":"Frederik Mallmann-Trenn","full_name":"Frederik Mallmann-Trenn, Frederik Mallmann-Trenn"},{"id":"BD1DF4C4-D767-11E9-B658-BC13E6697425","full_name":"Saona Urmeneta, Raimundo J","first_name":"Raimundo J","orcid":"0000-0001-5103-038X","last_name":"Saona Urmeneta"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2023-04-08T00:00:00Z","article_number":"2304.04024","date_updated":"2025-04-14T07:52:47Z","title":"Prophet inequalities: Separating random order from order selection"},{"title":"Multi-point functional central limit theorem for Wigner Matrices","date_updated":"2026-04-07T13:02:12Z","article_number":"2307.11028","date_published":"2023-07-21T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Jana","last_name":"Reker","id":"e796e4f9-dc8d-11ea-abe3-97e26a0323e9","full_name":"Reker, Jana"}],"publication_status":"draft","article_processing_charge":"No","year":"2023","oa":1,"external_id":{"arxiv":["2307.11028"]},"OA_place":"repository","type":"preprint","arxiv":1,"day":"21","related_material":{"record":[{"status":"public","id":"18762","relation":"later_version"},{"id":"17164","relation":"dissertation_contains","status":"public"}]},"month":"07","oa_version":"Preprint","status":"public","publication":"arXiv","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2307.11028","open_access":"1"}],"_id":"17173","doi":"10.48550/arXiv.2307.11028","citation":{"ieee":"J. Reker, “Multi-point functional central limit theorem for Wigner Matrices,” <i>arXiv</i>. .","mla":"Reker, Jana. “Multi-Point Functional Central Limit Theorem for Wigner Matrices.” <i>ArXiv</i>, 2307.11028, doi:<a href=\"https://doi.org/10.48550/arXiv.2307.11028\">10.48550/arXiv.2307.11028</a>.","ama":"Reker J. Multi-point functional central limit theorem for Wigner Matrices. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2307.11028\">10.48550/arXiv.2307.11028</a>","apa":"Reker, J. (n.d.). Multi-point functional central limit theorem for Wigner Matrices. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2307.11028\">https://doi.org/10.48550/arXiv.2307.11028</a>","ista":"Reker J. Multi-point functional central limit theorem for Wigner Matrices. arXiv, 2307.11028.","chicago":"Reker, Jana. “Multi-Point Functional Central Limit Theorem for Wigner Matrices.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2307.11028\">https://doi.org/10.48550/arXiv.2307.11028</a>.","short":"J. Reker, ArXiv (n.d.)."},"language":[{"iso":"eng"}],"date_created":"2024-06-26T08:54:56Z","abstract":[{"text":"Consider the random variable $\\mathrm{Tr}( f_1(W)A_1\\dots f_k(W)A_k)$ where $W$ is an $N\\times N$ Hermitian Wigner matrix, $k\\in\\mathbb{N}$, and choose (possibly $N$-dependent) regular functions $f_1,\\dots, f_k$ as well as bounded deterministic matrices $A_1,\\dots,A_k$. We give a functional central limit theorem showing that the fluctuations around the expectation are Gaussian. Moreover, we determine the limiting covariance structure and give explicit error bounds in terms of the scaling of $f_1,\\dots,f_k$ and the number of traceless matrices among $A_1,\\dots,A_k$, thus extending the results of [Cipolloni, Erdős, Schröder 2023] to products of arbitrary length $k\\geq2$. As an application, we consider the fluctuation of $\\mathrm{Tr}(\\mathrm{e}^{\\mathrm{i} tW}A_1\\mathrm{e}^{-\\mathrm{i} tW}A_2)$ around its thermal value $\\mathrm{Tr}(A_1)\\mathrm{Tr}(A_2)$ when $t$ is large and give an explicit formula for the variance.","lang":"eng"}],"department":[{"_id":"LaEr"}]},{"_id":"17174","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2310.06677"}],"oa_version":"Preprint","department":[{"_id":"LaEr"}],"project":[{"name":"Random matrices beyond Wigner-Dyson-Mehta","grant_number":"101020331","call_identifier":"H2020","_id":"62796744-2b32-11ec-9570-940b20777f1d"}],"citation":{"ista":"Erdös L, Henheik SJ, Reker J, Riabov V. Prethermalization for deformed Wigner Matrices. arXiv, 2310.06677.","apa":"Erdös, L., Henheik, S. J., Reker, J., &#38; Riabov, V. (n.d.). Prethermalization for deformed Wigner Matrices. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2310.06677\">https://doi.org/10.48550/arXiv.2310.06677</a>","ama":"Erdös L, Henheik SJ, Reker J, Riabov V. Prethermalization for deformed Wigner Matrices. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2310.06677\">10.48550/arXiv.2310.06677</a>","ieee":"L. Erdös, S. J. Henheik, J. Reker, and V. Riabov, “Prethermalization for deformed Wigner Matrices,” <i>arXiv</i>. .","mla":"Erdös, László, et al. “Prethermalization for Deformed Wigner Matrices.” <i>ArXiv</i>, 2310.06677, doi:<a href=\"https://doi.org/10.48550/arXiv.2310.06677\">10.48550/arXiv.2310.06677</a>.","short":"L. Erdös, S.J. Henheik, J. Reker, V. Riabov, ArXiv (n.d.).","chicago":"Erdös, László, Sven Joscha Henheik, Jana Reker, and Volodymyr Riabov. “Prethermalization for Deformed Wigner Matrices.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2310.06677\">https://doi.org/10.48550/arXiv.2310.06677</a>."},"doi":"10.48550/arXiv.2310.06677","author":[{"full_name":"Erdös, László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös","orcid":"0000-0001-5366-9603","first_name":"László"},{"id":"31d731d7-d235-11ea-ad11-b50331c8d7fb","full_name":"Henheik, Sven Joscha","orcid":"0000-0003-1106-327X","last_name":"Henheik","first_name":"Sven Joscha"},{"last_name":"Reker","first_name":"Jana","full_name":"Reker, Jana","id":"e796e4f9-dc8d-11ea-abe3-97e26a0323e9"},{"first_name":"Volodymyr","last_name":"Riabov","full_name":"Riabov, Volodymyr","id":"1949f904-edfb-11eb-afb5-e2dfddabb93b"}],"date_updated":"2026-04-07T13:02:12Z","title":"Prethermalization for deformed Wigner Matrices","related_material":{"record":[{"relation":"later_version","id":"18764","status":"public"},{"status":"public","id":"20575","relation":"dissertation_contains"},{"status":"public","id":"17164","relation":"dissertation_contains"}]},"day":"23","arxiv":1,"OA_place":"repository","external_id":{"arxiv":["2310.06677"]},"corr_author":"1","publication":"arXiv","month":"12","status":"public","abstract":[{"text":"We prove that a class of weakly perturbed Hamiltonians of the form $H_λ= H_0 + λW$, with $W$ being a Wigner matrix, exhibits prethermalization. That is, the time evolution generated by $H_λ$ relaxes to its ultimate thermal state via an intermediate prethermal state with a lifetime of order $λ^{-2}$. Moreover, we obtain a general relaxation formula, expressing the perturbed dynamics via the unperturbed dynamics and the ultimate thermal state. The proof relies on a two-resolvent law for the deformed Wigner matrix $H_λ$.","lang":"eng"}],"date_created":"2024-06-26T08:56:52Z","language":[{"iso":"eng"}],"article_processing_charge":"No","year":"2023","publication_status":"draft","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_published":"2023-12-23T00:00:00Z","article_number":"2310.06677","ec_funded":1,"type":"preprint","oa":1},{"author":[{"last_name":"Muñoz Hermosilla","first_name":"José M","id":"e1037a6d-646e-11ef-b402-e0ed9ab0901e","full_name":"Muñoz Hermosilla, José M"}],"article_processing_charge":"No","year":"2023","date_updated":"2024-12-09T09:43:47Z","date_published":"2023-06-05T00:00:00Z","title":"A 3D glacier dynamics-line plume model to estimate the frontal ablation of Hansbreen","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"relation":"research_data","id":"18628","status":"public"}]},"day":"05","oa":1,"type":"research_data_reference","OA_place":"repository","main_file_link":[{"url":"https://doi.org/10.5281/zenodo.8005258","open_access":"1"}],"oa_version":"Published Version","corr_author":"1","ddc":["550"],"month":"06","status":"public","_id":"18634","publisher":"Zenodo","date_created":"2024-12-09T09:33:07Z","department":[{"_id":"FrPe"}],"abstract":[{"lang":"eng","text":"There are 4 tar.xz files with the result of the model for the paper: A 3D glacier dynamics-line plume model to estimate the frontal ablation of Hansbreen, Svalbard. "}],"citation":{"short":"J.M. Muñoz Hermosilla, (2023).","chicago":"Muñoz Hermosilla, José M. “A 3D Glacier Dynamics-Line Plume Model to Estimate the Frontal Ablation of Hansbreen.” Zenodo, 2023. <a href=\"https://doi.org/10.5281/ZENODO.8005257\">https://doi.org/10.5281/ZENODO.8005257</a>.","ista":"Muñoz Hermosilla JM. 2023. A 3D glacier dynamics-line plume model to estimate the frontal ablation of Hansbreen, Zenodo, <a href=\"https://doi.org/10.5281/ZENODO.8005257\">10.5281/ZENODO.8005257</a>.","apa":"Muñoz Hermosilla, J. M. (2023). A 3D glacier dynamics-line plume model to estimate the frontal ablation of Hansbreen. Zenodo. <a href=\"https://doi.org/10.5281/ZENODO.8005257\">https://doi.org/10.5281/ZENODO.8005257</a>","ama":"Muñoz Hermosilla JM. A 3D glacier dynamics-line plume model to estimate the frontal ablation of Hansbreen. 2023. doi:<a href=\"https://doi.org/10.5281/ZENODO.8005257\">10.5281/ZENODO.8005257</a>","mla":"Muñoz Hermosilla, José M. <i>A 3D Glacier Dynamics-Line Plume Model to Estimate the Frontal Ablation of Hansbreen</i>. Zenodo, 2023, doi:<a href=\"https://doi.org/10.5281/ZENODO.8005257\">10.5281/ZENODO.8005257</a>.","ieee":"J. M. Muñoz Hermosilla, “A 3D glacier dynamics-line plume model to estimate the frontal ablation of Hansbreen.” Zenodo, 2023."},"doi":"10.5281/ZENODO.8005257"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2023-12-19T00:00:00Z","article_number":"7","year":"2023","article_processing_charge":"Yes","publication_status":"published","file":[{"access_level":"open_access","content_type":"application/pdf","file_size":6231778,"creator":"dernst","checksum":"97efcefa8151d69343b0b641630c86ee","file_name":"2023_Plants_Tamizhselvan.pdf","date_created":"2025-01-29T09:06:51Z","relation":"main_file","date_updated":"2025-01-29T09:06:51Z","file_id":"18943","success":1}],"type":"journal_article","oa":1,"ddc":["580"],"status":"public","month":"12","publication":"Plants","issue":"1","OA_type":"gold","language":[{"iso":"eng"}],"intvolume":"        13","has_accepted_license":"1","pmid":1,"abstract":[{"lang":"eng","text":"Photosynthesis is among the first processes negatively affected by environmental cues and its performance directly determines plant cell fitness and ultimately crop yield. Primarily sites of photosynthesis, chloroplasts are unique sites also for the biosynthesis of precursors of the growth regulator auxin and for sensing environmental stress, but their role in intracellular auxin homeostasis, vital for plant growth and survival in changing environments, remains poorly understood. Here, we identified two ATP-binding cassette (ABC) subfamily B transporters, ABCB28 and ABCB29, which export auxin across the chloroplast envelope to the cytosol in a concerted action in vivo. Moreover, we provide evidence for an auxin biosynthesis pathway in Arabidopsis thaliana chloroplasts. The overexpression of ABCB28 and ABCB29 influenced stomatal regulation and resulted in significantly improved water use efficiency and survival rates during salt and drought stresses. Our results suggest that chloroplast auxin production and transport contribute to stomata regulation for conserving water upon salt stress. ABCB28 and ABCB29 integrate photosynthesis and auxin signals and as such hold great potential to improve the adaptation potential of crops to environmental cues."}],"date_created":"2025-01-29T09:03:56Z","publisher":"MDPI","date_updated":"2025-01-29T09:07:53Z","title":"Chloroplast auxin efflux mediated by ABCB28 and ABCB29 fine-tunes salt and drought stress responses in Arabidopsis","author":[{"full_name":"Tamizhselvan, Prashanth","last_name":"Tamizhselvan","first_name":"Prashanth"},{"full_name":"Madhavan, Sharmila","first_name":"Sharmila","last_name":"Madhavan"},{"full_name":"Constan-Aguilar, Christian","first_name":"Christian","last_name":"Constan-Aguilar"},{"full_name":"Elrefaay, Eman Ryad","last_name":"Elrefaay","first_name":"Eman Ryad"},{"last_name":"Liu","first_name":"Jie","full_name":"Liu, Jie"},{"full_name":"Pěnčík, Aleš","last_name":"Pěnčík","first_name":"Aleš"},{"first_name":"Ondřej","last_name":"Novák","full_name":"Novák, Ondřej"},{"full_name":"Cairó, Albert","last_name":"Cairó","first_name":"Albert"},{"full_name":"Hrtyan, Mónika","id":"45A71A74-F248-11E8-B48F-1D18A9856A87","last_name":"Hrtyan","first_name":"Mónika"},{"first_name":"Markus","last_name":"Geisler","full_name":"Geisler, Markus"},{"full_name":"Tognetti, Vanesa Beatriz","last_name":"Tognetti","first_name":"Vanesa Beatriz"}],"OA_place":"publisher","external_id":{"pmid":["38202315"]},"publication_identifier":{"eissn":["2223-7747"]},"file_date_updated":"2025-01-29T09:06:51Z","article_type":"original","day":"19","DOAJ_listed":"1","_id":"18942","oa_version":"Published Version","quality_controlled":"1","citation":{"short":"P. Tamizhselvan, S. Madhavan, C. Constan-Aguilar, E.R. Elrefaay, J. Liu, A. Pěnčík, O. Novák, A. Cairó, M. Hrtyan, M. Geisler, V.B. Tognetti, Plants 13 (2023).","chicago":"Tamizhselvan, Prashanth, Sharmila Madhavan, Christian Constan-Aguilar, Eman Ryad Elrefaay, Jie Liu, Aleš Pěnčík, Ondřej Novák, et al. “Chloroplast Auxin Efflux Mediated by ABCB28 and ABCB29 Fine-Tunes Salt and Drought Stress Responses in Arabidopsis.” <i>Plants</i>. MDPI, 2023. <a href=\"https://doi.org/10.3390/plants13010007\">https://doi.org/10.3390/plants13010007</a>.","ista":"Tamizhselvan P, Madhavan S, Constan-Aguilar C, Elrefaay ER, Liu J, Pěnčík A, Novák O, Cairó A, Hrtyan M, Geisler M, Tognetti VB. 2023. Chloroplast auxin efflux mediated by ABCB28 and ABCB29 fine-tunes salt and drought stress responses in Arabidopsis. Plants. 13(1), 7.","ama":"Tamizhselvan P, Madhavan S, Constan-Aguilar C, et al. Chloroplast auxin efflux mediated by ABCB28 and ABCB29 fine-tunes salt and drought stress responses in Arabidopsis. <i>Plants</i>. 2023;13(1). doi:<a href=\"https://doi.org/10.3390/plants13010007\">10.3390/plants13010007</a>","apa":"Tamizhselvan, P., Madhavan, S., Constan-Aguilar, C., Elrefaay, E. R., Liu, J., Pěnčík, A., … Tognetti, V. B. (2023). Chloroplast auxin efflux mediated by ABCB28 and ABCB29 fine-tunes salt and drought stress responses in Arabidopsis. <i>Plants</i>. MDPI. <a href=\"https://doi.org/10.3390/plants13010007\">https://doi.org/10.3390/plants13010007</a>","ieee":"P. Tamizhselvan <i>et al.</i>, “Chloroplast auxin efflux mediated by ABCB28 and ABCB29 fine-tunes salt and drought stress responses in Arabidopsis,” <i>Plants</i>, vol. 13, no. 1. MDPI, 2023.","mla":"Tamizhselvan, Prashanth, et al. “Chloroplast Auxin Efflux Mediated by ABCB28 and ABCB29 Fine-Tunes Salt and Drought Stress Responses in Arabidopsis.” <i>Plants</i>, vol. 13, no. 1, 7, MDPI, 2023, doi:<a href=\"https://doi.org/10.3390/plants13010007\">10.3390/plants13010007</a>."},"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/plants13010007","department":[{"_id":"EvBe"}],"scopus_import":"1","volume":13},{"type":"journal_article","day":"09","acknowledgement":"The MFO and the workshop organizers would like to thank the National Science Foundation for supporting the participation of junior researchers in the workshop by the grant DMS-2230648, “US Junior Oberwolfach Fellows”.","publication_identifier":{"eissn":["1660-8941"],"issn":["1660-8933"]},"article_type":"original","page":"1671-1730","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Dynamische Systeme","date_updated":"2025-01-29T13:23:15Z","date_published":"2023-07-09T00:00:00Z","publication_status":"published","article_processing_charge":"No","year":"2023","author":[{"full_name":"Arnaud, Marie-Claude","last_name":"Arnaud","first_name":"Marie-Claude"},{"last_name":"Hutchings","first_name":"Michael","full_name":"Hutchings, Michael"},{"last_name":"Kaloshin","orcid":"0000-0002-6051-2628","first_name":"Vadim","full_name":"Kaloshin, Vadim","id":"FE553552-CDE8-11E9-B324-C0EBE5697425"}],"language":[{"iso":"eng"}],"citation":{"chicago":"Arnaud, Marie-Claude, Michael Hutchings, and Vadim Kaloshin. “Dynamische Systeme.” <i>Oberwolfach Reports</i>. EMS Press, 2023. <a href=\"https://doi.org/10.4171/owr/2023/30\">https://doi.org/10.4171/owr/2023/30</a>.","short":"M.-C. Arnaud, M. Hutchings, V. Kaloshin, Oberwolfach Reports 20 (2023) 1671–1730.","ieee":"M.-C. Arnaud, M. Hutchings, and V. Kaloshin, “Dynamische Systeme,” <i>Oberwolfach Reports</i>, vol. 20, no. 3. EMS Press, pp. 1671–1730, 2023.","mla":"Arnaud, Marie-Claude, et al. “Dynamische Systeme.” <i>Oberwolfach Reports</i>, vol. 20, no. 3, EMS Press, 2023, pp. 1671–730, doi:<a href=\"https://doi.org/10.4171/owr/2023/30\">10.4171/owr/2023/30</a>.","ista":"Arnaud M-C, Hutchings M, Kaloshin V. 2023. Dynamische Systeme. Oberwolfach Reports. 20(3), 1671–1730.","ama":"Arnaud M-C, Hutchings M, Kaloshin V. Dynamische Systeme. <i>Oberwolfach Reports</i>. 2023;20(3):1671-1730. doi:<a href=\"https://doi.org/10.4171/owr/2023/30\">10.4171/owr/2023/30</a>","apa":"Arnaud, M.-C., Hutchings, M., &#38; Kaloshin, V. (2023). Dynamische Systeme. <i>Oberwolfach Reports</i>. EMS Press. <a href=\"https://doi.org/10.4171/owr/2023/30\">https://doi.org/10.4171/owr/2023/30</a>"},"intvolume":"        20","doi":"10.4171/owr/2023/30","date_created":"2025-01-29T13:19:15Z","abstract":[{"text":"This workshop continues a series of workshops whose current format originated in 1981 under then-organizers Moser and Zehnder, and whose latest iteration took place in July 2023. The general goal of this series of workshops is to discuss the latest developments in the field of dynamical systems, broadly construed, and its connections with neighboring areas of mathematics such as differential geometry, partial differential equations, and more recently contact and symplectic geometry. We continued this tradition, bringing in new participants working in areas of dynamical systems and its connections with other areas of mathematics that are currently highly active and/or showing great promise for future development. Key focus areas for the 2023 workshop include spectral rigidity for planar domains, chaotic and oscillatory motions in celestial mechanics, conformal symplectic dynamics, and relations between dynamics.he workshop by the grant DMS-2230648, “US Junior Oberwolfach Fellows”.","lang":"eng"}],"department":[{"_id":"VaKa"}],"publisher":"EMS Press","volume":20,"_id":"18959","quality_controlled":"1","status":"public","publication":"Oberwolfach Reports","month":"07","oa_version":"None","issue":"3"},{"_id":"19985","oa_version":"None","quality_controlled":"1","project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications"}],"citation":{"chicago":"Schmid, Stefan, Jakub Svoboda, and Michelle X Yeo. “Weighted Acket Selection for Rechargeable Links in Cryptocurrency Networks: Complexity and Approximation.” In <i>30th International Colloquium on Structural Information and Communication Complexity</i>, 13892:576–94. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-32733-9_26\">https://doi.org/10.1007/978-3-031-32733-9_26</a>.","short":"S. Schmid, J. Svoboda, M.X. Yeo, in:, 30th International Colloquium on Structural Information and Communication Complexity, Springer Nature, 2023, pp. 576–594.","mla":"Schmid, Stefan, et al. “Weighted Acket Selection for Rechargeable Links in Cryptocurrency Networks: Complexity and Approximation.” <i>30th International Colloquium on Structural Information and Communication Complexity</i>, vol. 13892, Springer Nature, 2023, pp. 576–94, doi:<a href=\"https://doi.org/10.1007/978-3-031-32733-9_26\">10.1007/978-3-031-32733-9_26</a>.","ieee":"S. Schmid, J. Svoboda, and M. X. Yeo, “Weighted acket selection for rechargeable links in cryptocurrency networks: Complexity and approximation,” in <i>30th International Colloquium on Structural Information and Communication Complexity</i>, Alcalá de Henares, Spain, 2023, vol. 13892, pp. 576–594.","ista":"Schmid S, Svoboda J, Yeo MX. 2023. Weighted acket selection for rechargeable links in cryptocurrency networks: Complexity and approximation. 30th International Colloquium on Structural Information and Communication Complexity. SIROCCO: International Colloquium on Structural Information and Communication Complexity, LNCS, vol. 13892, 576–594.","apa":"Schmid, S., Svoboda, J., &#38; Yeo, M. X. (2023). Weighted acket selection for rechargeable links in cryptocurrency networks: Complexity and approximation. In <i>30th International Colloquium on Structural Information and Communication Complexity</i> (Vol. 13892, pp. 576–594). Alcalá de Henares, Spain: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-32733-9_26\">https://doi.org/10.1007/978-3-031-32733-9_26</a>","ama":"Schmid S, Svoboda J, Yeo MX. Weighted acket selection for rechargeable links in cryptocurrency networks: Complexity and approximation. In: <i>30th International Colloquium on Structural Information and Communication Complexity</i>. Vol 13892. Springer Nature; 2023:576-594. doi:<a href=\"https://doi.org/10.1007/978-3-031-32733-9_26\">10.1007/978-3-031-32733-9_26</a>"},"doi":"10.1007/978-3-031-32733-9_26","scopus_import":"1","department":[{"_id":"KrCh"},{"_id":"KrPi"}],"volume":13892,"title":"Weighted acket selection for rechargeable links in cryptocurrency networks: Complexity and approximation","date_updated":"2025-12-02T14:02:38Z","author":[{"full_name":"Schmid, Stefan","first_name":"Stefan","last_name":"Schmid"},{"id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","full_name":"Svoboda, Jakub","first_name":"Jakub","orcid":"0000-0002-1419-3267","last_name":"Svoboda"},{"full_name":"Yeo, Michelle X","id":"2D82B818-F248-11E8-B48F-1D18A9856A87","first_name":"Michelle X","last_name":"Yeo","orcid":"0009-0001-3676-4809"}],"conference":{"start_date":"2023-06-06","location":"Alcalá de Henares, Spain","name":"SIROCCO: International Colloquium on Structural Information and Communication Complexity","end_date":"2023-06-09"},"external_id":{"isi":["001292782600026"]},"day":"25","publication_identifier":{"issn":["0302-9743"],"eisbn":["9783031327339"],"isbn":["9783031327322"],"eissn":["1611-3349"]},"related_material":{"record":[{"id":"14820","relation":"later_version","status":"public"}]},"acknowledgement":"We thank Mahsa Bastankhah and Mohammad Ali Maddah-Ali for fruitful discussions about different variants of the problem. This work is supported by the European Research Council (ERC) Consolidator Project 864228 (AdjustNet), 2020-2025, the ERC CoG 863818 (ForM-SMArt), and the German Research Foundation (DFG) grant 470029389 (FlexNets), 2021–2024.","month":"05","status":"public","corr_author":"1","publication":"30th International Colloquium on Structural Information and Communication Complexity","OA_type":"closed access","language":[{"iso":"eng"}],"intvolume":"     13892","abstract":[{"lang":"eng","text":"We consider a natural problem dealing with weighted packet selection across a rechargeable link, which e.g., finds applications in cryptocurrency networks. The capacity of a link (u, v) is determined by how much nodes u and v allocate for this link. Specifically, the input is a finite ordered sequence of packets that arrive in both directions along a link. Given (u, v) and a packet of weight x going from u to v, node u can either accept or reject the packet. If u accepts the packet, the capacity on link (u, v) decreases by x. Correspondingly, v’s capacity on (u, v) increases by x. If a node rejects the packet, this will entail a cost affinely linear in the weight of the packet. A link is “rechargeable” in the sense that the total capacity of the link has to remain constant, but the allocation of capacity at the ends of the link can depend arbitrarily on the nodes’ decisions. The goal is to minimise the sum of the capacity injected into the link and the cost of rejecting packets. We show that the problem is NP-hard, but can be approximated efficiently with a ratio of (1 + E) . (1 + square3) for some arbitrary E>0."}],"date_created":"2025-07-10T13:15:43Z","alternative_title":["LNCS"],"publisher":"Springer Nature","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2023-05-25T00:00:00Z","publication_status":"published","year":"2023","article_processing_charge":"No","ec_funded":1,"type":"conference","isi":1,"page":"576-594"},{"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2309.11292","open_access":"1"}],"oa_version":"Preprint","_id":"20572","doi":"10.48550/arXiv.2309.11292","citation":{"short":"L. Dello Schiavo, F. Quattrocchi, ArXiv (n.d.).","chicago":"Dello Schiavo, Lorenzo, and Filippo Quattrocchi. “Multivariate Dirichlet Moments and a Polychromatic Ewens Sampling Formula.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2309.11292\">https://doi.org/10.48550/arXiv.2309.11292</a>.","ista":"Dello Schiavo L, Quattrocchi F. Multivariate Dirichlet moments and a polychromatic Ewens sampling formula. arXiv, 2309.11292.","apa":"Dello Schiavo, L., &#38; Quattrocchi, F. (n.d.). Multivariate Dirichlet moments and a polychromatic Ewens sampling formula. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2309.11292\">https://doi.org/10.48550/arXiv.2309.11292</a>","ama":"Dello Schiavo L, Quattrocchi F. Multivariate Dirichlet moments and a polychromatic Ewens sampling formula. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2309.11292\">10.48550/arXiv.2309.11292</a>","ieee":"L. Dello Schiavo and F. Quattrocchi, “Multivariate Dirichlet moments and a polychromatic Ewens sampling formula,” <i>arXiv</i>. .","mla":"Dello Schiavo, Lorenzo, and Filippo Quattrocchi. “Multivariate Dirichlet Moments and a Polychromatic Ewens Sampling Formula.” <i>ArXiv</i>, 2309.11292, doi:<a href=\"https://doi.org/10.48550/arXiv.2309.11292\">10.48550/arXiv.2309.11292</a>."},"project":[{"name":"Configuration Spaces over Non-Smooth Spaces","grant_number":"E208","_id":"34dbf174-11ca-11ed-8bc3-afe9d43d4b9c"},{"name":"Taming Complexity in Partial Differential Systems","grant_number":"F06504","call_identifier":"FWF","_id":"260482E2-B435-11E9-9278-68D0E5697425"}],"department":[{"_id":"GradSch"},{"_id":"JaMa"}],"date_updated":"2025-11-24T13:53:48Z","title":"Multivariate Dirichlet moments and a polychromatic Ewens sampling formula","author":[{"first_name":"Lorenzo","last_name":"Dello Schiavo","orcid":"0000-0002-9881-6870","full_name":"Dello Schiavo, Lorenzo","id":"ECEBF480-9E4F-11EA-B557-B0823DDC885E"},{"id":"3ebd6ba8-edfb-11eb-afb5-91a9745ba308","full_name":"Quattrocchi, Filippo","orcid":"0009-0000-9773-1931","last_name":"Quattrocchi","first_name":"Filippo"}],"external_id":{"arxiv":["2309.11292"]},"OA_place":"repository","arxiv":1,"acknowledgement":"This research was funded by the Austrian Science Fund (FWF) ESPRIT 208. For the purpose of open access, the authors have applied a CC BY public copyright licence to any Author Accepted Manuscript version arising from this submission. F.Q. gratefully acknowledges support by the Austrian Science Fund (FWF), Project SFB F65. The authors are grateful to Professor Nathanaël Berestycki for several helpful suggestions, and to Nicola Battisti and Dr. Elizabeth Hollwey for enlightening discussions on DNA-methylation.","day":"20","status":"public","corr_author":"1","month":"09","publication":"arXiv","language":[{"iso":"eng"}],"OA_type":"green","abstract":[{"lang":"eng","text":"We present an elementary non-recursive formula for the multivariate moments\r\nof the Dirichlet distribution on the standard simplex, in terms of the pattern\r\ninventory of the moments' exponents. We obtain analog formulas for the\r\nmultivariate moments of the Dirichlet-Ferguson and Gamma measures. We further\r\nintroduce a polychromatic analogue of Ewens sampling formula on colored integer\r\npartitions, discuss its relation with suitable extensions of Hoppe's urn model\r\nand of the Chinese restaurant process, and prove that it satisfies an adapted\r\nnotion of consistency in the sense of Kingman."}],"date_created":"2025-10-28T13:13:08Z","date_published":"2023-09-20T00:00:00Z","article_number":"2309.11292","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","keyword":["Dirichlet distribution","Ewens sampling formula","Hoppe urn model","colored partitions"],"article_processing_charge":"No","year":"2023","publication_status":"draft","oa":1,"type":"preprint"}]